{"meta":{"query_hash":"17f67e24d851","filters":{"topic":"Parallel Computing and Optimization Techniques"},"cohort_total":2094,"direct_labels_cover":1,"predictions_cover":2094,"exported":2094,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/17f67e24d851","api":"https://metacan.xera.ac/api/v1/cohort?topic=Parallel+Computing+and+Optimization+Techniques"},"results":[{"id":"W1002013509","doi":"10.1007/978-3-319-18356-5_9","title":"An Improved Machine Learning Approach for Selecting a Polyhedral Model Transformation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Process (computing); Transformation (genetics); Feature selection; Classifier (UML); Selection (genetic algorithm); Machine learning; Key (lock); Pattern recognition (psychology); Algorithm","score_opus":0.029891830176709627,"score_gpt":0.27512301672772405,"score_spread":0.24523118655101442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002013509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014509869,0.00022027887,0.99601895,0.00013635769,0.00022538134,0.0007062028,0.0000054815505,0.0007983154,0.0018744994],"genre_scores_gemma":[0.11841293,0.000010931955,0.8808629,0.0002670046,0.00017606803,0.000024074789,0.000048237805,0.000038676673,0.0001591653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689364,0.000050780327,0.0005542909,0.0012501193,0.0006117579,0.0006394202],"domain_scores_gemma":[0.9980899,0.00013053649,0.000340519,0.00073800446,0.0004947752,0.00020623335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017951209,0.00048924907,0.00048080567,0.0007604445,0.00046214997,0.00064970396,0.0023750716,0.00034022055,0.0000010592904],"category_scores_gemma":[0.00008264145,0.0004681673,0.00012388421,0.00048768023,0.00017598765,0.0011202322,0.00030517703,0.0008248343,0.0000012490613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008595684,0.000022170769,0.0000029214157,0.00002760339,0.000004311422,6.0671056e-7,0.0012201796,0.82996583,0.00015590136,0.0049059517,0.000003906277,0.16368203],"study_design_scores_gemma":[0.00032627123,0.0003431702,6.3272523e-7,0.00005698323,0.000006613564,0.000026619475,2.2760649e-7,0.9540406,0.00063150586,0.04392788,0.00010817881,0.00053132954],"about_ca_topic_score_codex":0.00002299823,"about_ca_topic_score_gemma":0.00001213369,"teacher_disagreement_score":0.1631507,"about_ca_system_score_codex":0.00029447098,"about_ca_system_score_gemma":0.0006120407,"threshold_uncertainty_score":0.999777},"labels":[],"label_agreement":null},{"id":"W100502903","doi":"10.26077/ry9p-qs64","title":"An Efficient Approach to Subsystem Design: Autonomous GNC - A Case Study","year":2025,"lang":"en","type":"article","venue":"Digital Commons - USU (Utah State University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Carleton University; Canadian Space Agency","funders":"","keywords":"Computer science; Systems engineering; Engineering","score_opus":0.02484563505090619,"score_gpt":0.2431801434420964,"score_spread":0.2183345083911902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100502903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15644051,0.000007282489,0.81995624,0.00004628425,0.00007643941,0.000715986,0.000015446496,0.0009512244,0.021790557],"genre_scores_gemma":[0.96303165,4.0966628e-7,0.035287227,0.00005326973,0.00000524628,0.0000038069159,0.0000071762465,0.000010536466,0.0016006584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982909,0.00024853088,0.00024278146,0.0006517837,0.00020150324,0.0003644759],"domain_scores_gemma":[0.9984645,0.000119432094,0.00008820682,0.00092744955,0.00017122597,0.00022915029],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002646483,0.0002412334,0.00027685842,0.0008787967,0.0004401182,0.0007215994,0.0013787358,0.000052061834,5.762683e-7],"category_scores_gemma":[0.000017752871,0.00026437806,0.00007481355,0.0020148496,0.00004765617,0.00059661106,0.0006967358,0.00015658954,0.000012854256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007065266,0.0029798294,0.0017742001,0.000029477795,0.00012409336,0.0038703345,0.008443872,0.94896,0.000007330606,0.021336919,0.0011300801,0.011273197],"study_design_scores_gemma":[0.0008946935,0.0007888906,0.0002792988,0.00003716145,0.000027906428,0.00025916792,0.0032818504,0.9891626,0.00010481696,0.00015670646,0.0044163265,0.0005905841],"about_ca_topic_score_codex":0.0001949825,"about_ca_topic_score_gemma":0.000024433819,"teacher_disagreement_score":0.80659115,"about_ca_system_score_codex":0.00022732932,"about_ca_system_score_gemma":0.00017307412,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W100921371","doi":"","title":"Realizability Results Involving Two Connectivity Parameters.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realizability; Mathematics; Algorithm","score_opus":0.021915729100403198,"score_gpt":0.28322971006960185,"score_spread":0.26131398096919867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100921371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47848126,0.00008888432,0.507701,0.00038925145,0.0014686354,0.00025149653,0.000001944314,0.001513649,0.010103873],"genre_scores_gemma":[0.90793514,0.000009239629,0.091777064,0.00021272452,0.0000072079615,0.000004495483,0.000004035874,0.000009446901,0.000040637588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810445,0.00018187595,0.0004297498,0.00056824845,0.0002986831,0.00041700056],"domain_scores_gemma":[0.9977918,0.00069712364,0.00018920268,0.0009799543,0.00019395685,0.00014792313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028219107,0.00017374594,0.00021978946,0.00013062917,0.00022019459,0.00014558653,0.0008458199,0.00009086851,0.0000015250621],"category_scores_gemma":[0.000679542,0.00017864173,0.000077734505,0.000636103,0.00007265782,0.00039244743,0.00034285893,0.00022158898,0.000016913997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003507928,0.00018564146,0.005197952,0.000009477312,0.000015069531,0.00002386237,0.00059832406,0.00061046507,0.00015659528,0.9831507,0.0026436234,0.0073731984],"study_design_scores_gemma":[0.0016404074,0.00021574572,0.01588877,0.00004215911,0.000006149359,0.000015880394,0.000021179318,0.080288574,0.017443117,0.8830153,0.00093135727,0.0004913864],"about_ca_topic_score_codex":0.00033773953,"about_ca_topic_score_gemma":0.00002341701,"teacher_disagreement_score":0.42945388,"about_ca_system_score_codex":0.00012542156,"about_ca_system_score_gemma":0.00005883819,"threshold_uncertainty_score":0.7284798},"labels":[],"label_agreement":null},{"id":"W1035720181","doi":"10.1007/978-1-4615-1681-1_6","title":"Measurement of Virtual Function Call Overhead on Modern Processors","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Table (database); Overhead (engineering); Lookup table; Function (biology); Scheduling (production processes); Isolation (microbiology); Parallel computing; Operating system; Data mining; Mathematics; Mathematical optimization","score_opus":0.03613908881865429,"score_gpt":0.23922893646613402,"score_spread":0.20308984764747973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1035720181","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017694805,0.000086914006,0.555408,0.000052649684,0.0001035763,0.00011824632,7.632248e-7,0.00032199267,0.44390607],"genre_scores_gemma":[0.12316997,0.00036866925,0.040242374,0.0010985531,0.00025384585,0.000024642366,0.000016634413,0.000096141666,0.8347292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980455,0.000016959135,0.0003842743,0.0004912718,0.00089034654,0.00017161529],"domain_scores_gemma":[0.9986496,0.000020031013,0.000285127,0.00055826426,0.0004202966,0.000066664485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030685173,0.00027592762,0.0003035222,0.0002314904,0.000059822145,0.000045543715,0.0005653372,0.00023394554,0.000038649065],"category_scores_gemma":[0.0000171579,0.0002467982,0.00011696001,0.000057043908,0.00003198206,0.00011377365,0.00013445884,0.00022296545,0.000038701513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049466445,0.0001031931,0.00000415129,0.000053349482,0.00008754256,0.000005449229,0.00011532475,0.025041515,0.000041238625,0.8498412,0.015501498,0.109156094],"study_design_scores_gemma":[0.0010144543,0.003209427,0.000051279723,0.0016339261,0.00008320323,0.000019168889,0.0000031766783,0.68446773,0.0025583894,0.14904566,0.15613371,0.001779872],"about_ca_topic_score_codex":0.00001165278,"about_ca_topic_score_gemma":0.000007141798,"teacher_disagreement_score":0.70079553,"about_ca_system_score_codex":0.000119882636,"about_ca_system_score_gemma":0.00012905677,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W108479562","doi":"","title":"Clara: a Framework for Statically Evaluating Finite-state Runtime Monitors","year":2010,"lang":"en","type":"article","venue":"Runtime Verification","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Computer science; State (computer science); Finite-state machine; Finite state; Programming language; Distributed computing; Parallel computing","score_opus":0.02799736163093753,"score_gpt":0.32983242671742213,"score_spread":0.3018350650864846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108479562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02233956,0.000030647414,0.97485507,0.00067389826,0.00048286538,0.00053020346,0.000007062877,0.00077395537,0.00030674288],"genre_scores_gemma":[0.31461573,0.000009682789,0.68480206,0.00014013468,0.000092425595,0.00009903266,0.000018867726,0.000017653627,0.00020440084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831265,0.00008221401,0.0004209801,0.0005235959,0.00032937157,0.0003311998],"domain_scores_gemma":[0.9978158,0.0006098258,0.000264717,0.00082308904,0.00038627815,0.00010028228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772546,0.00018404628,0.00018846901,0.00016317483,0.00031774587,0.00032147797,0.0008210752,0.00015606427,0.000024348548],"category_scores_gemma":[0.0010435607,0.00018844454,0.00008663365,0.00048804513,0.000055283323,0.00038389963,0.000102489365,0.0003255202,0.00011783334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119779936,0.00071116345,0.0013358399,0.0001378658,0.0001313706,0.00000682053,0.0053621316,0.040879864,0.04898327,0.6179094,0.0074960995,0.27692643],"study_design_scores_gemma":[0.0002404012,0.00014179439,0.0015993563,0.00003348382,0.000011940281,0.0000028285683,0.0000091526945,0.9330061,0.0072681606,0.05561089,0.0017972852,0.00027861525],"about_ca_topic_score_codex":0.000010498302,"about_ca_topic_score_gemma":6.775777e-7,"teacher_disagreement_score":0.8921262,"about_ca_system_score_codex":0.00002949009,"about_ca_system_score_gemma":0.00012361395,"threshold_uncertainty_score":0.7684545},"labels":[],"label_agreement":null},{"id":"W1086484114","doi":"","title":"Thread and Memory Placement on NUMA Systems: Asymmetry Matters.","year":2015,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Thread (computing); Parallel computing; Shared memory; Distributed computing; Distributed shared memory; Memory bandwidth; Non-uniform memory access; Distributed memory; Uniform memory access; Cache; Operating system; CPU cache; Memory management; Overlay; Cache coloring","score_opus":0.0426310543331708,"score_gpt":0.28571466561798886,"score_spread":0.24308361128481806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1086484114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026462227,0.0001658359,0.98317206,0.002789432,0.00026757928,0.00034202117,0.000011266389,0.00149159,0.009113976],"genre_scores_gemma":[0.9034746,0.000032139105,0.09425925,0.0015186387,0.00006401635,0.00003808889,0.0000049733626,0.000015478441,0.00059279497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812883,0.00014025874,0.0003452456,0.000579222,0.00047332616,0.00033308993],"domain_scores_gemma":[0.9984976,0.00015057184,0.00012974169,0.00068117527,0.00026753344,0.00027337475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006040017,0.00023492085,0.0002888325,0.0001587461,0.00010107084,0.00029406766,0.0008799429,0.00015740588,0.000004964849],"category_scores_gemma":[0.00013684577,0.00020503328,0.00004007696,0.0002773286,0.00011416666,0.00032026126,0.00053762,0.00029179634,0.00006790825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093996874,0.00040234972,0.00040660045,0.00008088365,0.000043199296,0.00009156131,0.0014242,0.0051194024,0.00017301687,0.79299504,0.18057534,0.018594438],"study_design_scores_gemma":[0.009510512,0.010754081,0.004192334,0.0025112652,0.00012167258,0.0012822524,0.003408083,0.6420254,0.013718644,0.09982672,0.20522834,0.007420681],"about_ca_topic_score_codex":0.000045562258,"about_ca_topic_score_gemma":0.0000020352147,"teacher_disagreement_score":0.9008284,"about_ca_system_score_codex":0.000076684504,"about_ca_system_score_gemma":0.000108958644,"threshold_uncertainty_score":0.8361015},"labels":[],"label_agreement":null},{"id":"W111571758","doi":"","title":"Q-Analogue Of The Pascal Matrix.","year":2008,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Mathematics; Pascal matrix; Algebra over a field; Pure mathematics; Matrix function; Computer science; Programming language; Symmetric matrix; Physics","score_opus":0.01554864130113826,"score_gpt":0.2458505113631648,"score_spread":0.23030187006202654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111571758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7063737,0.00035933763,0.276063,0.0023453108,0.0030502493,0.0003537002,0.0000023282473,0.0008716958,0.010580703],"genre_scores_gemma":[0.9830283,0.000016688447,0.016543461,0.000099096054,0.0000036528802,0.0000031012416,4.937465e-7,0.0000045324523,0.0003006689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922365,0.000079429,0.00018421958,0.0001594383,0.00021944317,0.00013380364],"domain_scores_gemma":[0.9991505,0.000058394366,0.000103323044,0.0005653658,0.00008764577,0.000034739292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001529259,0.00007585751,0.00012181432,0.000042590742,0.00014912077,0.000015057227,0.0010001344,0.000046406585,0.0000033033148],"category_scores_gemma":[0.000044668835,0.000055442808,0.00008195523,0.00041329968,0.000073996365,0.00010251435,0.00027854755,0.00009904201,0.0000107717715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012746297,0.000062798004,0.0048947507,0.0000038870844,0.000009609539,0.0000039873576,0.00032502477,0.00045752706,0.00008145307,0.98430866,0.009506757,0.00034428353],"study_design_scores_gemma":[0.0010693414,0.00019432783,0.051503796,0.000052226587,0.000013818615,0.00013084617,0.000013739576,0.10014384,0.02983376,0.81109107,0.0054799453,0.00047329624],"about_ca_topic_score_codex":0.000020153731,"about_ca_topic_score_gemma":5.17742e-7,"teacher_disagreement_score":0.27665463,"about_ca_system_score_codex":0.000016723261,"about_ca_system_score_gemma":0.00005871668,"threshold_uncertainty_score":0.22608921},"labels":[],"label_agreement":null},{"id":"W1139117140","doi":"","title":"Static task scheduling for configurable multiprocessors","year":2010,"lang":"en","type":"article","venue":"uO Research (University of Ottawa)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Speedup; Parallel computing; Multiprocessing; Scheduling (production processes); Compiler; Multiprocessor scheduling; Dynamic priority scheduling; Programming language; Rate-monotonic scheduling; Operating system; Schedule; Mathematics","score_opus":0.044297837555160514,"score_gpt":0.3197394119228022,"score_spread":0.27544157436764166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1139117140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028206281,0.000006116577,0.96250695,0.0015644302,0.000065457396,0.00026594131,0.000006059875,0.00018178267,0.007196968],"genre_scores_gemma":[0.4831608,0.000010668509,0.51529187,0.000019726644,0.0000125942115,8.0782814e-7,0.000003679007,0.0000046766354,0.0014951822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885744,0.000071725786,0.00009363988,0.00028794655,0.00035954005,0.000329686],"domain_scores_gemma":[0.99839634,0.00036029815,0.00007374985,0.0003717297,0.0006811648,0.00011674913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012247446,0.00006923526,0.00013163024,0.0003229483,0.00045388483,0.000064266016,0.0012593146,0.00007552282,0.00002806296],"category_scores_gemma":[0.00030989072,0.0000821362,0.000054079184,0.00051345216,0.00018962062,0.0003736388,0.00020624521,0.0003142894,0.000018772345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021627284,0.0004791273,0.0048791394,0.00046809134,0.00009563464,0.000039793154,0.0047848043,0.013203257,0.041976303,0.85104364,0.028196014,0.05481254],"study_design_scores_gemma":[0.0006669678,0.00016760813,0.0007179732,0.000028563962,0.0000032466914,0.0000027327287,0.00031323757,0.9356032,0.00727266,0.006149396,0.048913855,0.00016053108],"about_ca_topic_score_codex":0.000060283062,"about_ca_topic_score_gemma":0.00006225843,"teacher_disagreement_score":0.9224,"about_ca_system_score_codex":0.000021567877,"about_ca_system_score_gemma":0.00016414865,"threshold_uncertainty_score":0.34909612},"labels":[],"label_agreement":null},{"id":"W114672764","doi":"10.1007/978-3-642-31057-7_7","title":"McSAF: A Static Analysis Framework for MATLAB","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Compiler; Programming language; Popularity; Variety (cybernetics); Key (lock); Software engineering; Artificial intelligence; Operating system","score_opus":0.021554044612445623,"score_gpt":0.2852327739081108,"score_spread":0.26367872929566516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114672764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060616494,0.00063001004,0.99617976,0.00069263694,0.0007958008,0.0005164134,0.000009859936,0.0004927253,0.00067671505],"genre_scores_gemma":[0.02545797,0.00006179463,0.97240615,0.001425394,0.00033492962,0.000026520864,0.000013098035,0.00003317387,0.00024099322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637944,0.000041355837,0.0006146019,0.001364545,0.0007753506,0.0008246912],"domain_scores_gemma":[0.9961562,0.0011793625,0.0004446387,0.0016555683,0.0003448789,0.00021933552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012092034,0.0005282796,0.00075903494,0.0016646328,0.00030729917,0.0006238544,0.0033323446,0.000411579,0.000024689461],"category_scores_gemma":[0.00018741748,0.00049272616,0.00032415014,0.0016536678,0.00034145114,0.00047679848,0.000937291,0.0006259348,0.00002483613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006685357,0.000049387156,0.0000851271,0.00006483016,0.00012680919,0.000011644988,0.0009861153,0.23936617,0.0000067373903,0.24568108,0.000095742835,0.51351964],"study_design_scores_gemma":[0.000082244966,0.00007425459,0.00003729906,0.00012742673,0.000057045254,0.000007184409,5.4185943e-8,0.6383872,0.00021027676,0.35940814,0.0011533147,0.00045551866],"about_ca_topic_score_codex":0.000011372609,"about_ca_topic_score_gemma":0.000011395212,"teacher_disagreement_score":0.51306415,"about_ca_system_score_codex":0.00024422607,"about_ca_system_score_gemma":0.00031656554,"threshold_uncertainty_score":0.99975246},"labels":[],"label_agreement":null},{"id":"W118959728","doi":"","title":"Parallel Unstructured Grids Package for the solution of CFD problems on parallel computers","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Polygon mesh; Grid; Computational science; Parallel computing; Set (abstract data type); Fortran; Hexahedron; Node (physics); Mesh generation; Computational fluid dynamics; Construct (python library); Unstructured grid; Finite element method; Programming language; Computer graphics (images); Engineering; Geometry","score_opus":0.015014379517050088,"score_gpt":0.2657034489336531,"score_spread":0.250689069416603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118959728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028063104,0.00054835196,0.99470025,0.002234271,0.00003810459,0.0012376669,0.00006517937,0.000671282,0.0002242613],"genre_scores_gemma":[0.44332227,0.00036706272,0.5550108,0.00014480701,0.000089455636,0.0009168879,0.000105881874,0.000014826495,0.000028031369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853796,0.00003189586,0.00041961388,0.0005236853,0.00018093536,0.00030589628],"domain_scores_gemma":[0.9985965,0.00020797046,0.00032422863,0.0005427604,0.00021809366,0.00011043636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035881915,0.00026022192,0.00027330747,0.00009582068,0.00075221853,0.00024874049,0.00068104913,0.00017616106,0.0000011252207],"category_scores_gemma":[0.000025720441,0.00019207556,0.00007484357,0.0003673617,0.00030369367,0.00020963232,0.0001969811,0.00028408522,4.983243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009697615,0.00038248897,0.0004800578,0.00044627843,0.00006896771,0.0000012035832,0.00048636278,0.0056611034,0.003036664,0.46696636,0.0069698,0.51540375],"study_design_scores_gemma":[0.0015954671,0.0004962725,0.0019056031,0.00022744699,0.00009149768,0.00011657703,0.000057948808,0.71144915,0.00428192,0.17358884,0.10515674,0.0010325155],"about_ca_topic_score_codex":0.000023625707,"about_ca_topic_score_gemma":0.000005316549,"teacher_disagreement_score":0.7057881,"about_ca_system_score_codex":0.0000132255345,"about_ca_system_score_gemma":0.0000608613,"threshold_uncertainty_score":0.7832614},"labels":[],"label_agreement":null},{"id":"W1210553197","doi":"10.1016/j.sysarc.2015.07.009","title":"Memory organizations for 3D-DRAMs and PCMs in processor memory hierarchy","year":2015,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Computer science; Dram; Universal memory; Interleaved memory; CAS latency; Registered memory; Parallel computing; Embedded system; Memory hierarchy; Phase-change memory; Memory controller; Computer hardware; Cache; Memory management; Semiconductor memory","score_opus":0.015710484784179742,"score_gpt":0.252119442067023,"score_spread":0.23640895728284328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1210553197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0123658925,0.0014063906,0.98398703,0.001095933,0.00037731597,0.00031605555,0.0000018563122,0.00007629714,0.0003732151],"genre_scores_gemma":[0.6046283,0.000026667996,0.3943705,0.0001800732,0.0003709167,0.000014229109,0.0000015601014,0.000021998529,0.00038570908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988037,0.00011539482,0.00048060223,0.0001730851,0.00024355763,0.00018370902],"domain_scores_gemma":[0.9985764,0.000116422285,0.00036534815,0.00019310263,0.0005922655,0.00015643606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089478027,0.00012569982,0.00028608087,0.00036697672,0.00007347343,0.00015732531,0.0004959795,0.00008100997,4.785678e-7],"category_scores_gemma":[0.00036107656,0.00009689753,0.000034905595,0.000565752,0.00003375073,0.00024231206,0.00009449749,0.00023448549,6.5683264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013137345,0.00030356113,0.0017675296,0.00070305774,0.000116630894,0.00008801503,0.035805177,0.86529607,0.0007717329,0.00402289,0.014774214,0.07621973],"study_design_scores_gemma":[0.0072800354,0.0021486226,0.0012388537,0.0018159265,0.000061397,0.0053462093,0.0015681409,0.9245469,0.0028495353,0.021163331,0.030714476,0.0012665947],"about_ca_topic_score_codex":0.000017066937,"about_ca_topic_score_gemma":0.000006043431,"teacher_disagreement_score":0.59226245,"about_ca_system_score_codex":0.00005675997,"about_ca_system_score_gemma":0.0002748109,"threshold_uncertainty_score":0.39513665},"labels":[],"label_agreement":null},{"id":"W124523214","doi":"10.1007/978-3-540-39920-9_3","title":"Predicated Instructions for Code Compaction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Opcode; Computer science; Executable; Abstraction; Code (set theory); Programming language; Function (biology); Set (abstract data type)","score_opus":0.023189305684854236,"score_gpt":0.2703252090117288,"score_spread":0.24713590332687457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W124523214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009956261,0.00014219154,0.99244153,0.0008286821,0.0020154847,0.0006075391,0.000012324555,0.00065106875,0.0032911906],"genre_scores_gemma":[0.0130686145,0.000060209488,0.98475194,0.0012712202,0.00023785584,0.00002580848,0.000017420054,0.00003541326,0.00053154706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709755,0.00003484328,0.00052061176,0.0012466721,0.0005763237,0.00052401365],"domain_scores_gemma":[0.9977389,0.00028929653,0.00034788845,0.0010667624,0.0003996089,0.00015752221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006999701,0.00041993163,0.0004327598,0.00088446384,0.00044055842,0.00030663883,0.0020247216,0.00034837052,0.000008804345],"category_scores_gemma":[0.00011222557,0.0004172861,0.00013895748,0.00063727563,0.000434293,0.00047277755,0.0003684907,0.00055259635,0.000010218058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013926345,0.00008551433,0.000059203434,0.00009403062,0.000035174035,0.000013517045,0.00045784772,0.45200467,0.00010521058,0.102922395,0.0015840075,0.4426245],"study_design_scores_gemma":[0.00027424295,0.00014967924,0.000026311518,0.00015679002,0.000008105311,0.00006820746,5.2625836e-8,0.8360079,0.0013436006,0.15059938,0.01088967,0.00047607665],"about_ca_topic_score_codex":0.000007917953,"about_ca_topic_score_gemma":0.000017350281,"teacher_disagreement_score":0.44214845,"about_ca_system_score_codex":0.0003187147,"about_ca_system_score_gemma":0.00039697386,"threshold_uncertainty_score":0.9998279},"labels":[],"label_agreement":null},{"id":"W128049675","doi":"10.5753/sbac-pad.2000.41216","title":"Efficient ECC-Based Directory Implementations for Scalable Multiprocessors","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Directory; Memory bandwidth; Embedded system; Operating system; Latency (audio); Scalability; Datapath; Memory controller; Semiconductor memory","score_opus":0.020577779984065264,"score_gpt":0.3017073489670968,"score_spread":0.28112956898303154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128049675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009524642,0.000025203703,0.98171383,0.0003814463,0.000052104264,0.00026593663,0.0000037752566,0.00091120007,0.007121882],"genre_scores_gemma":[0.36738372,0.0000021224985,0.62977636,0.0005910276,0.000016976459,0.00007624008,0.0000075281537,0.000006536437,0.002139486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991956,0.000023449127,0.00017540295,0.00026553086,0.00012210009,0.00021796618],"domain_scores_gemma":[0.9994419,0.00012086773,0.000036063517,0.00025329142,0.0000885585,0.00005927853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019216606,0.00008938422,0.000086719665,0.00008229283,0.00022023426,0.000087009044,0.0003743604,0.000026210788,0.00018514572],"category_scores_gemma":[0.000018246896,0.00008138171,0.00005430157,0.00028375146,0.000018690143,0.00006103035,0.000024024357,0.00003243414,0.000033012166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093971075,0.00020335952,0.00018533717,0.000018391238,0.000008655954,5.435356e-7,0.0001954647,0.90546215,0.00024101035,0.006104527,0.014720938,0.072850235],"study_design_scores_gemma":[0.00036941186,0.0000368575,0.00013917315,0.000006281084,0.0000022696227,4.3341768e-7,0.0000038977246,0.97773117,0.0105357645,0.00027676296,0.010778953,0.000119006385],"about_ca_topic_score_codex":0.000030714116,"about_ca_topic_score_gemma":0.0000032861644,"teacher_disagreement_score":0.35785908,"about_ca_system_score_codex":0.000027198585,"about_ca_system_score_gemma":0.00007385068,"threshold_uncertainty_score":0.33186498},"labels":[],"label_agreement":null},{"id":"W128638405","doi":"10.1007/978-3-540-78791-4_11","title":"Compiler-Guaranteed Safety in Code-Copying Virtual Machines","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Copying; Compiler; Programming language; Dead code elimination; Just-in-time compilation; Code generation; Machine code; Programmer; Code (set theory); Source code; Virtual machine; Parallel computing; Operating system; Object code; Key (lock); Set (abstract data type)","score_opus":0.017167235097016377,"score_gpt":0.2536954088233018,"score_spread":0.23652817372628546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128638405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013513541,0.0005728496,0.9905576,0.00045718675,0.0012112742,0.000451966,0.000009324669,0.00064003875,0.0059646172],"genre_scores_gemma":[0.17993577,0.00043526597,0.8158115,0.0027859597,0.00040171525,0.000012563662,0.000016916887,0.00007321406,0.00052710815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950053,0.000098831886,0.0010611456,0.0018766888,0.001104621,0.0008534168],"domain_scores_gemma":[0.9970493,0.0006613906,0.0004463495,0.001440543,0.00022762318,0.00017480343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012018209,0.0007301641,0.00092612643,0.0015992048,0.00042205068,0.0003800737,0.0043524695,0.00045056475,0.000017094217],"category_scores_gemma":[0.00013089945,0.00070260075,0.00017943619,0.0011428406,0.0007567441,0.00057404564,0.0016625855,0.0013256364,0.000039534265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024147406,0.000066770015,0.00032962853,0.000026501166,0.000010958663,0.00024966864,0.0016512515,0.5160513,0.000036815323,0.011266793,0.00015313906,0.470133],"study_design_scores_gemma":[0.00047975485,0.00018022899,0.00029819508,0.0005484548,0.0000029647372,0.00016327281,1.3183103e-7,0.9799552,0.00029565912,0.014913055,0.002323155,0.0008399535],"about_ca_topic_score_codex":0.000074650634,"about_ca_topic_score_gemma":0.00012831496,"teacher_disagreement_score":0.46929306,"about_ca_system_score_codex":0.00041016508,"about_ca_system_score_gemma":0.00062925735,"threshold_uncertainty_score":0.99954253},"labels":[],"label_agreement":null},{"id":"W130096246","doi":"10.1007/978-3-642-39038-8_27","title":"Simple Profile Rectifications Go a Long Way","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Speedup; Simple (philosophy); Profiling (computer programming); Scripting language; Algorithm; Parallel computing; Programming language","score_opus":0.020890440091589992,"score_gpt":0.2620434682541749,"score_spread":0.2411530281625849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130096246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017978256,0.00026038126,0.97720397,0.000602344,0.00078027544,0.00062662293,0.0000040089976,0.00081148476,0.01969291],"genre_scores_gemma":[0.039645433,0.000060026618,0.9544599,0.0009910415,0.00034278884,0.000052964228,0.000019830388,0.00004694071,0.0043810746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99634707,0.00005005287,0.00059206167,0.0015997351,0.00075397856,0.0006570877],"domain_scores_gemma":[0.99669415,0.00036812475,0.00036506262,0.001913378,0.0004645775,0.00019468537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007149192,0.0004963373,0.00046131673,0.0008596164,0.0004268008,0.0008915283,0.0037577024,0.00033855168,0.00011340264],"category_scores_gemma":[0.00012522144,0.00046370318,0.00013123242,0.0008589694,0.00045904168,0.0006913745,0.0012621838,0.00076367497,0.00037631654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018619305,0.00005029634,0.00006479463,0.000036373014,0.00001330567,0.000027979886,0.00053442735,0.0564099,0.00007436256,0.03453318,0.0017695088,0.906484],"study_design_scores_gemma":[0.000117744305,0.000101972684,0.0002217583,0.0001860363,0.0000050228055,0.000045788936,5.9414877e-8,0.87077534,0.0019064497,0.121409245,0.0045412094,0.00068935053],"about_ca_topic_score_codex":0.00003701949,"about_ca_topic_score_gemma":0.000029728906,"teacher_disagreement_score":0.9057947,"about_ca_system_score_codex":0.00028104798,"about_ca_system_score_gemma":0.00044820443,"threshold_uncertainty_score":0.9997815},"labels":[],"label_agreement":null},{"id":"W131783155","doi":"","title":"Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Symbolic computation; Symbolic-numeric computation; Computer science; Computation; Algebraic number; Theoretical computer science; Symbolic data analysis; Symbolic trajectory evaluation; The Symbolic; Algorithm; Mathematics; Model checking","score_opus":0.020136637262479367,"score_gpt":0.27120261006728263,"score_spread":0.25106597280480325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131783155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025058983,0.000021313384,0.89995605,0.0014408169,0.0005884907,0.00011894191,2.7702666e-7,0.00028482825,0.072530285],"genre_scores_gemma":[0.916298,0.000005226764,0.0823401,0.0003875376,0.00006148845,0.000003951528,4.8739e-7,0.0000036446597,0.0008996059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.000010332921,0.00014578235,0.000112645444,0.00021190399,0.000120125944],"domain_scores_gemma":[0.99960417,0.000040365256,0.00011581565,0.000099158446,0.00010836105,0.000032118634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017829904,0.00006546369,0.000069540554,0.000070070004,0.00005519168,0.000045363675,0.0005392624,0.000030501005,0.000015632879],"category_scores_gemma":[0.000021829972,0.000044258275,0.000040665705,0.00020999795,0.000022026685,0.00029403312,0.00017677496,0.00006858465,0.000023623652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013947316,0.00048430084,0.043126818,0.000017187876,0.00004852018,1.3756087e-7,0.0026036846,0.010071671,0.00093198195,0.7733248,0.07674331,0.09263368],"study_design_scores_gemma":[0.00045923772,0.000083027,0.19670835,0.00013276355,0.000010207056,0.000024815758,0.00011017347,0.7557046,0.029408505,0.0090036765,0.00788454,0.00047013426],"about_ca_topic_score_codex":0.000005567049,"about_ca_topic_score_gemma":8.7789765e-8,"teacher_disagreement_score":0.891239,"about_ca_system_score_codex":0.00002016898,"about_ca_system_score_gemma":0.00000968019,"threshold_uncertainty_score":0.18048},"labels":[],"label_agreement":null},{"id":"W133242469","doi":"","title":"Jupiter: A Modular and Extensible JVM","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Modular design; Jupiter (rocket family); Operating system; Java; Workstation; Flexibility (engineering); Spacecraft; Aerospace engineering","score_opus":0.013484897921785312,"score_gpt":0.24053939997588436,"score_spread":0.22705450205409905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133242469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075336816,0.00014139975,0.9724656,0.0006459803,0.00003893457,0.000043957454,4.9741598e-8,0.0006495499,0.018480897],"genre_scores_gemma":[0.42747545,0.0001195152,0.5692777,0.0008320965,0.000018366414,0.000002473017,3.208802e-7,0.0000032977373,0.0022707705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995022,0.00001761898,0.00008303165,0.00019634758,0.00007830185,0.00012254572],"domain_scores_gemma":[0.9996165,0.000016203605,0.000019648922,0.00025699518,0.0000406778,0.000049975803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001060716,0.00005913828,0.000066671026,0.00006337196,0.00006609301,0.000109500936,0.00022476347,0.000025918533,0.000011271071],"category_scores_gemma":[0.000008084008,0.00005082037,0.000015501397,0.0001849061,0.00001539747,0.00019632399,0.00014423666,0.000037267706,0.000016418651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009893237,0.00018074489,0.008273243,0.000018298471,0.00003082311,0.00014035054,0.000898425,0.014264237,0.0013808154,0.52509665,0.036096543,0.41360995],"study_design_scores_gemma":[0.00010650564,0.00003499681,0.0010337312,0.0000057784287,9.1837467e-7,0.00006947003,0.000002628769,0.9746006,0.00072393264,0.008821047,0.014493517,0.00010686115],"about_ca_topic_score_codex":0.000016004833,"about_ca_topic_score_gemma":9.0586235e-7,"teacher_disagreement_score":0.9603364,"about_ca_system_score_codex":0.0000051071456,"about_ca_system_score_gemma":0.0000088013085,"threshold_uncertainty_score":0.20723945},"labels":[],"label_agreement":null},{"id":"W133275886","doi":"10.5555/2499968.2499984","title":"Arbiter work stealing for parallelizing games on heterogeneous computing environments","year":2013,"lang":"en","type":"article","venue":"High Performance Computing Symposium","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Arbiter; Computer science; Locality; Distributed computing; Schedule; Scheduling (production processes); Parallel computing; Operating system","score_opus":0.012867185359920473,"score_gpt":0.23078848457695078,"score_spread":0.2179212992170303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133275886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3736066,0.00006980182,0.6236053,0.00041762996,0.00057316374,0.0005926949,8.8159203e-7,0.0007277588,0.0004061524],"genre_scores_gemma":[0.78844243,0.0000362986,0.20983353,0.0010545929,0.00031122088,0.00003805215,0.00001450133,0.00004580083,0.00022355301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968183,0.00011213235,0.0007295314,0.0009444785,0.0004379353,0.0009576181],"domain_scores_gemma":[0.99813217,0.00033607488,0.00039704196,0.000853473,0.00010287588,0.00017835229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051266514,0.0004745507,0.00044958704,0.00025753348,0.00080120616,0.000556245,0.0012996282,0.00016396638,0.000009155227],"category_scores_gemma":[0.000020013595,0.00046420217,0.0001533383,0.00038401986,0.000069717215,0.00047587845,0.00053422624,0.00032936034,0.00015363007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027481345,0.00015785455,0.0030789166,0.00009413832,0.000057632475,0.0000044023236,0.00091561524,0.9523722,0.0009784213,0.0015263963,0.0018775736,0.038909364],"study_design_scores_gemma":[0.00064660935,0.00039564475,0.002887294,0.00035515206,0.000009939827,0.000020056808,0.000008930726,0.98473835,0.00839048,0.00019879866,0.0017123801,0.00063637155],"about_ca_topic_score_codex":0.000015956535,"about_ca_topic_score_gemma":1.2406808e-7,"teacher_disagreement_score":0.41483584,"about_ca_system_score_codex":0.00014086705,"about_ca_system_score_gemma":0.000032738255,"threshold_uncertainty_score":0.99978095},"labels":[],"label_agreement":null},{"id":"W139764261","doi":"10.1007/978-1-4614-4975-1_1","title":"Fundamental Limits on Run-Time Power Management Algorithms for MPSoCs","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Power (physics); Algorithm; Parallel computing; Physics","score_opus":0.02596613002662088,"score_gpt":0.2557484556181812,"score_spread":0.22978232559156034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W139764261","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3442114e-7,0.000037844926,0.48308071,0.00025396672,0.00022312753,0.00057015294,0.0000064180113,0.0006379171,0.5151895],"genre_scores_gemma":[0.00004317257,0.000055094017,0.40922058,0.0010026554,0.00006116349,0.00004264403,0.00002648445,0.00003440439,0.58951384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981417,0.00001176404,0.0003612553,0.00075713603,0.00039096497,0.0003371943],"domain_scores_gemma":[0.99868435,0.00008144835,0.00020124622,0.00079626223,0.00012101612,0.00011565832],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017576756,0.00041796538,0.0003410904,0.00026410786,0.00015761839,0.0002942595,0.0010992408,0.00024572434,0.00066216086],"category_scores_gemma":[0.0000035081644,0.00037756097,0.00022210822,0.000041154784,0.00003852805,0.0001621094,0.00035927162,0.00018047997,0.0017446758],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046622417,0.000041967734,1.4160673e-7,0.000020007652,0.00009078685,0.0000076552715,0.00003273504,0.00016971068,0.0000018173248,0.7227681,0.22636184,0.050500553],"study_design_scores_gemma":[0.0005104553,0.0006629776,0.0000073295555,0.00022004802,0.000026522637,0.00000923378,0.0000026784278,0.10903128,0.00019187605,0.04532972,0.84304655,0.0009613444],"about_ca_topic_score_codex":0.000002398929,"about_ca_topic_score_gemma":1.7040175e-7,"teacher_disagreement_score":0.6774384,"about_ca_system_score_codex":0.00011663741,"about_ca_system_score_gemma":0.000024905714,"threshold_uncertainty_score":0.9998676},"labels":[],"label_agreement":null},{"id":"W141061235","doi":"10.1007/978-3-319-03859-9_20","title":"Memory Efficient Multi-Swarm PSO Algorithm in OpenCL on an APU","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Parallel computing; Very long instruction word; Asynchronous communication; Particle swarm optimization; Feature (linguistics); Vectorization (mathematics); Algorithm","score_opus":0.02204053626496093,"score_gpt":0.2737207215293828,"score_spread":0.2516801852644219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141061235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011730643,0.00020976801,0.9934199,0.0003149661,0.0013338387,0.00080338045,0.0000036011652,0.000523587,0.0032736382],"genre_scores_gemma":[0.02137597,0.000036120902,0.97588134,0.0018096665,0.00024291518,0.000027432927,0.0000080418795,0.000048195376,0.0005703462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948687,0.00011634906,0.00076183927,0.0022598917,0.0011121883,0.0008810105],"domain_scores_gemma":[0.9967436,0.00033650757,0.00034815894,0.0020052525,0.00028755414,0.0002789072],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014079186,0.0007154512,0.00067835103,0.0016001048,0.0002836826,0.0008076512,0.005120604,0.00044173517,0.000028008251],"category_scores_gemma":[0.000080227335,0.0006564951,0.00012484699,0.00089501933,0.0004897495,0.0005399948,0.0015851205,0.0011787218,0.00014423845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018972421,0.000101029684,0.0000029490006,0.000008880039,0.0000026350197,0.00005067816,0.0005242554,0.45011094,0.000010795139,0.0016352143,0.00002679066,0.5475239],"study_design_scores_gemma":[0.00039460394,0.000285134,0.00011041155,0.00037642138,0.000002386362,0.000031762476,2.6343383e-7,0.9853173,0.001965224,0.010468064,0.00027454997,0.00077389344],"about_ca_topic_score_codex":0.000119199714,"about_ca_topic_score_gemma":0.000040303916,"teacher_disagreement_score":0.54675,"about_ca_system_score_codex":0.00045646797,"about_ca_system_score_gemma":0.00045357886,"threshold_uncertainty_score":0.9995886},"labels":[],"label_agreement":null},{"id":"W1410829195","doi":"10.1007/978-3-642-55224-3_49","title":"Adaptive Fork-Heuristics for Software Thread-Level Speculation","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Fork (system call); Heuristics; Thread (computing); Parallel computing; Software; Benchmark (surveying); Programming language; Operating system","score_opus":0.038596472022990096,"score_gpt":0.2688901419481105,"score_spread":0.2302936699251204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1410829195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019155973,0.00016080255,0.9959846,0.00028123916,0.0011090684,0.0006714075,0.000016965801,0.000552476,0.0012215191],"genre_scores_gemma":[0.01281925,0.000021607239,0.9850433,0.0008805863,0.0005223316,0.000019088548,0.000022684482,0.000043586984,0.0006275633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966286,0.000033019223,0.00057259353,0.0014337724,0.0007291744,0.00060288113],"domain_scores_gemma":[0.9965194,0.0008933105,0.0004487276,0.0012213388,0.0007714425,0.00014579126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008972127,0.000530782,0.00054978475,0.0006595401,0.00036467373,0.00044978314,0.0026168649,0.0003852348,0.000005044975],"category_scores_gemma":[0.00034395553,0.00051340286,0.0001589581,0.00048118256,0.00037158612,0.00029102433,0.0008408981,0.00048675106,0.000017112156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009672088,0.00001778777,0.000025173093,0.00003866559,0.000011863002,0.000008062139,0.0002444496,0.25383455,0.0000044618864,0.14792787,0.00030923888,0.5975682],"study_design_scores_gemma":[0.00017582501,0.00019067933,0.00003766872,0.00020807025,0.000006812971,0.000013946183,3.005606e-8,0.6607464,0.00026525065,0.3363604,0.0015363478,0.0004585829],"about_ca_topic_score_codex":0.000008087316,"about_ca_topic_score_gemma":0.000018770937,"teacher_disagreement_score":0.5971096,"about_ca_system_score_codex":0.00026939757,"about_ca_system_score_gemma":0.00043768765,"threshold_uncertainty_score":0.9997318},"labels":[],"label_agreement":null},{"id":"W1443472105","doi":"10.1007/978-3-642-37658-0_13","title":"A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Executor; Computer science; Parallel computing; Metis; Computation; Graph partition; Graph; Multi-core processor; Scheduling (production processes); Cluster analysis; Locality; Shared memory; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.018734449565246756,"score_gpt":0.2530993612407089,"score_spread":0.23436491167546217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1443472105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017159893,0.0004998921,0.9890095,0.0006896509,0.0011059603,0.0009838874,0.000017111164,0.0008562577,0.0068205674],"genre_scores_gemma":[0.01669448,0.000086044136,0.9798646,0.001306989,0.0005477588,0.0001381205,0.00003175126,0.000056786244,0.0012734463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587256,0.00003986823,0.0007052315,0.0017480911,0.00078861916,0.0008456364],"domain_scores_gemma":[0.99699306,0.0003748027,0.00042933715,0.0014294368,0.00054651266,0.0002268493],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00059464056,0.00068562716,0.00064865965,0.0009496954,0.00045675944,0.0017000153,0.0034084443,0.00041154315,0.000067474335],"category_scores_gemma":[0.000065390435,0.0006329314,0.00025138655,0.0005921722,0.00063412916,0.001378756,0.00088476954,0.0006172072,0.00007224567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015464968,0.000097729426,0.00001707993,0.00014113863,0.000042600237,0.000038385708,0.0014049235,0.5308472,0.00010258023,0.19475986,0.0034043565,0.26912865],"study_design_scores_gemma":[0.00035122366,0.00023985573,0.00005684119,0.0003121451,0.000008567037,0.000029543178,5.921302e-7,0.64156723,0.0003893456,0.35393724,0.0022265776,0.0008808417],"about_ca_topic_score_codex":0.00003244907,"about_ca_topic_score_gemma":0.00003383757,"teacher_disagreement_score":0.2682478,"about_ca_system_score_codex":0.0002146705,"about_ca_system_score_gemma":0.0006867975,"threshold_uncertainty_score":0.9996122},"labels":[],"label_agreement":null},{"id":"W1479912924","doi":"10.1007/3-540-44520-x_148","title":"Compiling Multithreaded Java Bytecode for Distributed Execution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Java concurrency; strictfp; Java; Operating system; Real time Java; Java annotation; Java bytecode; Java applet; Generics in Java; Embedded Java; Parallel computing; Software portability; Programming language","score_opus":0.022182369773421418,"score_gpt":0.26656178455270807,"score_spread":0.24437941477928665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479912924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020671772,0.00030722667,0.9953062,0.00047315258,0.0008295789,0.00075083965,0.000036118963,0.0008115157,0.0014647152],"genre_scores_gemma":[0.043404814,0.000094222385,0.9550307,0.00074616534,0.00034905557,0.000028661972,0.00009102474,0.000043026535,0.0002123529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962903,0.00003588126,0.00068252697,0.0016032861,0.00065259694,0.0007353916],"domain_scores_gemma":[0.99741304,0.000496989,0.00034268666,0.0012413289,0.00033614924,0.00016981436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007715873,0.0005701176,0.0005993736,0.0007226352,0.00045689038,0.00056549226,0.0029505375,0.00040764824,0.00001414007],"category_scores_gemma":[0.00009340311,0.0005648153,0.00019575197,0.0005612045,0.00043083343,0.0004757276,0.0006079957,0.00058539683,0.000022605613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750022,0.000047840644,0.000013997615,0.000038627823,0.000013770525,0.000017821238,0.0002928238,0.4827703,0.00007462958,0.017411634,0.00018167295,0.49911937],"study_design_scores_gemma":[0.0003534279,0.00013079248,0.000021753063,0.00028783723,0.0000071238824,0.000026799727,5.512685e-8,0.8539368,0.002249313,0.13914493,0.0032523014,0.0005888661],"about_ca_topic_score_codex":0.000018432822,"about_ca_topic_score_gemma":0.000018467967,"teacher_disagreement_score":0.4985305,"about_ca_system_score_codex":0.0003357693,"about_ca_system_score_gemma":0.00037748634,"threshold_uncertainty_score":0.99968034},"labels":[],"label_agreement":null},{"id":"W1481784341","doi":"10.1007/978-3-642-03237-0_12","title":"Increasing the Scope and Resolution of Interprocedural Static Single Assignment","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scope (computer science); Heap (data structure); Compiler; Liveness; Programming language; Parallel computing","score_opus":0.015856516252184052,"score_gpt":0.247463998360478,"score_spread":0.23160748210829396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481784341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019012693,0.00086400536,0.9954491,0.00080034183,0.00022087432,0.00026754543,9.827617e-7,0.00012372759,0.0020832412],"genre_scores_gemma":[0.379733,0.0000845458,0.6192691,0.0007668264,0.00006851593,0.0000022278748,0.0000013461099,0.0000109295515,0.00006353281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978844,0.000074839074,0.00045374595,0.00069768657,0.0005687947,0.00032054432],"domain_scores_gemma":[0.99830306,0.00043217413,0.0003507866,0.00067661726,0.00016664744,0.000070708404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011283064,0.000281669,0.00032613723,0.00039668972,0.0002057122,0.00032312845,0.0015373122,0.00012939751,0.0000020811674],"category_scores_gemma":[0.00013709908,0.00021038779,0.00005312672,0.00035640938,0.0005768027,0.00031428057,0.00079263694,0.00037176264,0.0000014514831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112428925,0.00003386073,0.000023078073,0.000037021215,0.0000073302526,0.000008944863,0.0008801747,0.064272605,0.00040180844,0.008389217,0.000037790887,0.92589694],"study_design_scores_gemma":[0.00014474177,0.00037779554,0.00016224402,0.00093113625,0.0000072504317,0.00009931758,2.6212427e-7,0.9041946,0.0032942186,0.09021428,0.00023326115,0.0003408781],"about_ca_topic_score_codex":0.000031106563,"about_ca_topic_score_gemma":0.000012933753,"teacher_disagreement_score":0.92555606,"about_ca_system_score_codex":0.00018201007,"about_ca_system_score_gemma":0.0002283016,"threshold_uncertainty_score":0.8579365},"labels":[],"label_agreement":null},{"id":"W1486295934","doi":"10.1007/11512622_24","title":"Ultra Fast Cycle-Accurate Compiled Emulation of Inorder Pipelined Architectures","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Emulation; Architecture; Porting; Hardware emulation; Software; Computer architecture; Process (computing); Embedded system; Software architecture; Operating system","score_opus":0.014311283434656975,"score_gpt":0.2610552479532722,"score_spread":0.2467439645186152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486295934","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003120998,0.00027414932,0.99335444,0.0005015823,0.00059127307,0.00043957285,0.0000076648,0.00045854598,0.004060668],"genre_scores_gemma":[0.4597368,0.00003552642,0.5391948,0.0005484833,0.00028297392,0.00000483982,0.000011219202,0.000029506149,0.00015587604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960879,0.00007516831,0.0009563564,0.0013245357,0.00096746755,0.00058857823],"domain_scores_gemma":[0.9968698,0.00046850086,0.0007017971,0.0013500827,0.0004597127,0.00015011383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007293671,0.0005979198,0.00073363836,0.0011994933,0.00022378252,0.00030478465,0.0030384713,0.0003523887,0.000025486475],"category_scores_gemma":[0.00010834229,0.000555931,0.00018054467,0.00078936684,0.0005971148,0.0003219033,0.0006951854,0.0007570892,0.000015256185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007833872,0.000029087472,0.000040676892,0.00002483258,0.000008345215,0.0000066475923,0.00055320567,0.700707,0.000178371,0.0032040721,0.000015952459,0.29522398],"study_design_scores_gemma":[0.0003177475,0.00013931487,0.00026815635,0.00032228453,0.0000073972624,0.000032669548,1.09003444e-7,0.9510195,0.0038907388,0.042980436,0.00042149378,0.000600139],"about_ca_topic_score_codex":0.000026887106,"about_ca_topic_score_gemma":0.000041466046,"teacher_disagreement_score":0.45942467,"about_ca_system_score_codex":0.00018546436,"about_ca_system_score_gemma":0.00043850607,"threshold_uncertainty_score":0.9996892},"labels":[],"label_agreement":null},{"id":"W1486384684","doi":"10.1109/fpt.2003.1275768","title":"A parameterized automatic cache generator for FPGAs","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Parameterized complexity; Generator (circuit theory); Field-programmable gate array; Embedded system; Parallel computing; Variety (cybernetics); Computer architecture; Computer hardware; Power (physics); Algorithm","score_opus":0.024673204209582085,"score_gpt":0.2723252393196437,"score_spread":0.24765203511006162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486384684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008312807,0.000026557567,0.9881654,0.0009288326,0.00010027421,0.0002465533,5.814643e-7,0.001375932,0.0008431071],"genre_scores_gemma":[0.17777613,0.0000024157928,0.82117945,0.0007490317,0.00002419091,0.000056001467,0.0000015896618,0.000005785235,0.0002053755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993039,0.000022128708,0.00016827347,0.00022765224,0.000095996795,0.00018207956],"domain_scores_gemma":[0.9994481,0.000051558625,0.00005037585,0.000328387,0.000062683765,0.000058870133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018284583,0.00009090485,0.00011996919,0.000060720846,0.00009556377,0.00013580325,0.00044786284,0.000042168343,0.0000064861615],"category_scores_gemma":[0.0000549743,0.000076128366,0.000061481325,0.00017963804,0.000014167828,0.00014878329,0.0000765901,0.000035054836,0.000017975779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012649472,0.00042354714,0.00006193705,0.00010912142,0.000092214876,0.000014795104,0.0015727148,0.11677929,0.0073639755,0.7315257,0.017338963,0.124705106],"study_design_scores_gemma":[0.00065219396,0.00009000751,0.000032504187,0.000013514153,0.0000033052513,0.0000088839015,0.0000024308636,0.9475785,0.02730953,0.022831488,0.0013096334,0.00016800777],"about_ca_topic_score_codex":0.0000133406365,"about_ca_topic_score_gemma":0.0000013719618,"teacher_disagreement_score":0.8307992,"about_ca_system_score_codex":0.00003370215,"about_ca_system_score_gemma":0.00007061796,"threshold_uncertainty_score":0.31044248},"labels":[],"label_agreement":null},{"id":"W1487500788","doi":"10.3233/jec-2012-0110","title":"Parallelization of multimedia applications on the multi-level computing architecture","year":2011,"lang":"en","type":"article","venue":"Journal of Embedded Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture; Multimedia; Architecture; Human–computer interaction","score_opus":0.07973010655389298,"score_gpt":0.2962578734672572,"score_spread":0.2165277669133642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487500788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086031435,0.000100850826,0.98952585,0.00020390483,0.00020785262,0.00024233146,0.0000011784697,0.000113044895,0.0010018547],"genre_scores_gemma":[0.49706548,0.000007123482,0.50263953,0.0001646745,0.00009870723,0.0000010164761,6.152315e-7,0.000009010452,0.000013832736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794704,0.00024481403,0.00090337545,0.0002360789,0.00040717825,0.0002614948],"domain_scores_gemma":[0.9969166,0.0005689247,0.0013855329,0.0004922792,0.00054131076,0.000095334224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671743,0.0001964667,0.000331815,0.00028588797,0.0002475333,0.00006391948,0.0014850164,0.000085884894,0.000008065365],"category_scores_gemma":[0.0002259256,0.00013915222,0.00018365394,0.00057563157,0.000081792285,0.00013794792,0.0002535187,0.00044462786,0.0000062543127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079381374,0.0012393058,0.0020117203,0.000100044614,0.00029766458,0.000030323732,0.028015243,0.44045302,0.0020566292,0.07478782,0.0015727129,0.44935614],"study_design_scores_gemma":[0.00058358494,0.0002258544,0.0027199376,0.00023332748,0.000018477545,0.000088433684,0.00015263275,0.9847824,0.007549322,0.003180182,0.00023969196,0.00022615299],"about_ca_topic_score_codex":0.0000050353515,"about_ca_topic_score_gemma":6.346652e-7,"teacher_disagreement_score":0.54432935,"about_ca_system_score_codex":0.00003432802,"about_ca_system_score_gemma":0.000096742864,"threshold_uncertainty_score":0.5674463},"labels":[],"label_agreement":null},{"id":"W1488305958","doi":"10.1007/978-3-642-03770-2_31","title":"Process Arrival Pattern and Shared Memory Aware Alltoall on InfiniBand","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"InfiniBand; Computer science; Remote direct memory access; Process (computing); Benchmark (surveying); Parallel computing; Distributed computing; Operating system","score_opus":0.01668044754364808,"score_gpt":0.2597993563467144,"score_spread":0.24311890880306633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488305958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016197385,0.00019042307,0.99314094,0.0009345346,0.0004597885,0.00039363842,0.000005444598,0.00052170665,0.0041915644],"genre_scores_gemma":[0.6171244,0.00018816526,0.3691531,0.0116034215,0.00087832613,0.000023801134,0.000026183543,0.00009505866,0.0009075217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962804,0.000039835017,0.0004976648,0.0016867614,0.0009046156,0.00059076474],"domain_scores_gemma":[0.9978734,0.00026582004,0.0003094348,0.0011159142,0.00022471821,0.00021070852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058167626,0.0006006703,0.00054755463,0.00079460803,0.00029019156,0.00070753705,0.0026638478,0.00035094997,0.000011586573],"category_scores_gemma":[0.000060654245,0.000551425,0.00008859677,0.00040411102,0.00037172236,0.00048374012,0.00070091063,0.00082193234,0.000013727814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070039887,0.000031857522,0.00004679301,0.00004371893,0.000007470436,0.00007767225,0.000773819,0.06781996,0.000007777127,0.0008160033,0.000080593905,0.9302873],"study_design_scores_gemma":[0.00044799957,0.00064810953,0.00039442774,0.001027714,0.000007650723,0.000099048084,2.0501179e-7,0.92205405,0.0011279953,0.072468705,0.00061125576,0.0011128654],"about_ca_topic_score_codex":0.00001050176,"about_ca_topic_score_gemma":0.000018878889,"teacher_disagreement_score":0.9291745,"about_ca_system_score_codex":0.00013297376,"about_ca_system_score_gemma":0.00033025534,"threshold_uncertainty_score":0.99969375},"labels":[],"label_agreement":null},{"id":"W148859280","doi":"10.1201/9781584888239-c28","title":"Parallel Computation","year":2009,"lang":"en","type":"book-chapter","venue":"Chapman & Hall/CRC applied algorithms and data structures series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.03064309020315106,"score_gpt":0.26653224731283004,"score_spread":0.23588915710967898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148859280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000030185217,0.001681184,0.8367685,0.00042253855,0.0002938717,0.0005387802,0.00021537673,0.0010701802,0.15900654],"genre_scores_gemma":[0.0012767157,0.0023218927,0.9676887,0.0007743637,0.0006538898,0.000010247003,0.0029024123,0.000094429146,0.024277342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967232,0.000021799699,0.000624321,0.0016491425,0.00052755873,0.00045402185],"domain_scores_gemma":[0.9972506,0.000055327815,0.00048973213,0.0018634053,0.00012666784,0.00021425118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024682397,0.0007684936,0.00075132813,0.00026242348,0.00047818755,0.00070186734,0.0022633001,0.0004960089,0.00003175673],"category_scores_gemma":[0.0000104202945,0.000725207,0.00007880982,0.00009018083,0.0002788145,0.00067649124,0.0017684739,0.00056039455,0.000017299211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017443175,0.0000089118175,4.1667963e-7,0.000044348883,0.000057941863,0.000017884931,0.00018311848,0.0006636795,0.0000049719383,0.7436214,0.005975299,0.24940458],"study_design_scores_gemma":[0.0005487377,0.00017285152,0.00012312905,0.000091995134,0.00005853825,0.0001737769,0.000019507435,0.046470545,0.00004566008,0.77357465,0.17739975,0.0013208706],"about_ca_topic_score_codex":0.000017507447,"about_ca_topic_score_gemma":0.000010689551,"teacher_disagreement_score":0.24808371,"about_ca_system_score_codex":0.000042691852,"about_ca_system_score_gemma":0.00010263167,"threshold_uncertainty_score":0.9995199},"labels":[],"label_agreement":null},{"id":"W1497408952","doi":"10.1109/pact.1996.552669","title":"Bulk Synchronous Parallel: practical experience with a model for parallel computing","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parallel computing; Bulk synchronous parallel; Computer science; Parallel algorithm","score_opus":0.048922055323676224,"score_gpt":0.3029319557329171,"score_spread":0.2540099004092409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497408952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006989812,0.000060661514,0.9908543,0.0020763548,0.000059591148,0.0004539725,6.767677e-7,0.0013934597,0.004401971],"genre_scores_gemma":[0.40340853,0.000013566301,0.59512115,0.00058272085,0.000033068536,0.000049526076,0.0000011443336,0.000013121262,0.00077716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981095,0.000044671368,0.00034297057,0.0006570636,0.00031065466,0.0005351168],"domain_scores_gemma":[0.99863434,0.00023210532,0.00015524204,0.00063474895,0.00017765652,0.00016588038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022098748,0.00024634748,0.00026102006,0.000093006645,0.00032829144,0.0002772441,0.0007436639,0.00009104387,0.000024032739],"category_scores_gemma":[0.00007263615,0.00019925633,0.00007649313,0.00028881262,0.00012574773,0.00056916266,0.00021718834,0.00015694703,0.000031670777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024060011,0.0002553725,0.000111803725,0.000018299725,0.000022916443,0.000017035514,0.0031343694,0.8486152,0.000009918077,0.13180177,0.009008701,0.00698051],"study_design_scores_gemma":[0.0005423291,0.00020143265,0.0000136004755,0.00002175023,0.0000048950933,0.000087333574,0.000037942533,0.99686146,0.00007124408,0.0012001699,0.00062359706,0.00033424652],"about_ca_topic_score_codex":0.0000124694825,"about_ca_topic_score_gemma":0.0000037218128,"teacher_disagreement_score":0.40270954,"about_ca_system_score_codex":0.00004852139,"about_ca_system_score_gemma":0.00005826343,"threshold_uncertainty_score":0.81254375},"labels":[],"label_agreement":null},{"id":"W1497964494","doi":"10.1023/a:1011487018981","title":"Software Implementation Strategies for Power-Conscious Systems","year":2001,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Variety (cybernetics); Embedded system; Sorting; Software; Energy (signal processing); Power (physics); Computation; Computer engineering; Distributed computing; Algorithm; Programming language; Artificial intelligence","score_opus":0.010886766106432645,"score_gpt":0.2835454590841653,"score_spread":0.27265869297773265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497964494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064841256,0.0010283948,0.99645233,0.000066242465,0.000056716242,0.0009985853,0.000004595666,0.00044119835,0.0003035175],"genre_scores_gemma":[0.9502921,0.00042468013,0.04489547,0.00015883094,0.00016394287,0.003890982,0.00004265857,0.0000115618905,0.0001197812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933046,0.000016574213,0.0001749994,0.00024880562,0.000059931233,0.00016920586],"domain_scores_gemma":[0.99945164,0.00008148113,0.00008056,0.00024913048,0.000086772634,0.00005040641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012999606,0.00008594562,0.000092943425,0.000041776973,0.00029380078,0.00030833672,0.000226203,0.000045145134,0.0000030398683],"category_scores_gemma":[0.0000014166529,0.00008362938,0.000026822294,0.00023163443,0.000024231422,0.00018256399,0.0000548087,0.00004408713,0.0000015476643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027535486,0.000049865706,0.0006328329,0.0000149149855,0.000014760184,4.833838e-7,0.00010255745,0.6030556,0.000012122424,0.24916823,0.0078052552,0.13914062],"study_design_scores_gemma":[0.0003177941,0.00013203175,0.00035723977,0.000012576152,0.000008982416,0.000022105614,0.00034186017,0.73801255,0.000013242484,0.007905146,0.25263324,0.00024324864],"about_ca_topic_score_codex":0.00002024365,"about_ca_topic_score_gemma":0.000006091461,"teacher_disagreement_score":0.95155686,"about_ca_system_score_codex":0.000013789166,"about_ca_system_score_gemma":0.000028869088,"threshold_uncertainty_score":0.34103072},"labels":[],"label_agreement":null},{"id":"W1499396827","doi":"10.1002/9780470050118.ecse437","title":"Time‐Sharing Systems","year":2009,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Computer Science and Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Virtualization; Time-sharing; Multi-core processor; Shared resource; Operating system; Central processing unit; Embedded system; Distributed computing; Computer architecture; Cloud computing","score_opus":0.005313509014087956,"score_gpt":0.20215119838342333,"score_spread":0.19683768936933538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499396827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003353123,0.0017616996,0.8876825,0.000027580489,0.0007856258,0.00019330333,0.0000016911616,0.0011678057,0.108346246],"genre_scores_gemma":[0.001363362,0.004588393,0.9417183,0.00013594041,0.0012203795,0.000022493623,0.0000066403463,0.00023927781,0.050705217],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811673,0.000011042481,0.00030938053,0.0006433251,0.0005348346,0.00038471122],"domain_scores_gemma":[0.9988238,0.00003210346,0.0001924723,0.00068265304,0.00011062566,0.00015832837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005042738,0.00028444323,0.00040190524,0.0008209828,0.00006790186,0.00022628006,0.0016681848,0.00013500004,0.0000051560382],"category_scores_gemma":[0.000028835204,0.00028016622,0.000042659158,0.0008355302,0.00012135157,0.00032861112,0.00057094934,0.0001627732,0.0000135107075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002386437,0.00012418113,0.00007977651,0.0007420448,0.000085164225,0.000053969285,0.0010395984,0.17506383,0.00028518782,0.025487982,0.57696384,0.22007203],"study_design_scores_gemma":[0.00007457375,0.00005393616,0.000042846612,0.0006445287,0.000004699862,0.000019429632,5.3209754e-7,0.8668682,0.000020838623,0.0000362142,0.13192026,0.00031393257],"about_ca_topic_score_codex":0.000025997682,"about_ca_topic_score_gemma":2.104285e-7,"teacher_disagreement_score":0.69180435,"about_ca_system_score_codex":0.000036909827,"about_ca_system_score_gemma":0.000115384224,"threshold_uncertainty_score":0.9999651},"labels":[],"label_agreement":null},{"id":"W1504382467","doi":"10.1007/978-3-540-74309-5_18","title":"Exploiting Task Temperature Profiling in Temperature-Aware Task Scheduling for Computational Clusters","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Queue; Scheduling (production processes); Scaling; Spec#; Profiling (computer programming); Cluster (spacecraft); Exploit; Multi-core processor; Parallel computing; Distributed computing; Operating system; Computer network; Mathematics","score_opus":0.02350019597188969,"score_gpt":0.28094817701877556,"score_spread":0.2574479810468859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504382467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005119313,0.00045999355,0.9950271,0.0005571044,0.0012273765,0.0011885129,0.000017153365,0.00056155294,0.00044922158],"genre_scores_gemma":[0.16163051,0.000023661387,0.83562076,0.0019181259,0.0005321096,0.00003775679,0.00007346676,0.00006717711,0.00009642463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99429375,0.00006900115,0.0011347807,0.0022472197,0.0011285109,0.001126736],"domain_scores_gemma":[0.9965135,0.0010711978,0.00052497,0.00096300716,0.00070631405,0.00022102904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022665043,0.0008321239,0.0008223755,0.001980192,0.0005726211,0.0010306444,0.0029102494,0.00076642877,0.0000029245093],"category_scores_gemma":[0.00023688159,0.0008369383,0.00022639541,0.0012954624,0.00039746222,0.0008507534,0.0010028541,0.001661426,0.0000065726135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016712325,0.00003492752,0.00006390104,0.00010530476,0.000011412887,0.000055051172,0.0005965875,0.9527977,0.0003500348,0.0073372857,0.000026059277,0.038605027],"study_design_scores_gemma":[0.0006168018,0.00013916138,0.00002764544,0.001159542,0.00000620313,0.00006458673,0.0000017579595,0.956351,0.0020658001,0.038465388,0.00014866762,0.0009534544],"about_ca_topic_score_codex":0.000011720789,"about_ca_topic_score_gemma":0.000033540466,"teacher_disagreement_score":0.16111858,"about_ca_system_score_codex":0.000585337,"about_ca_system_score_gemma":0.0009202388,"threshold_uncertainty_score":0.9994081},"labels":[],"label_agreement":null},{"id":"W1505642482","doi":"","title":"Identifying opportunities for automatic remote field cloning","year":2004,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloning (programming); Suite; Compiler; Field (mathematics); Benchmark (surveying); Replication (statistics); Cache; Locality of reference; Locality; Programming language; Parallel computing; Object (grammar); Theoretical computer science; Artificial intelligence","score_opus":0.2645477734440196,"score_gpt":0.44475071839336516,"score_spread":0.18020294494934558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505642482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059037195,0.00060142885,0.9718235,0.018133702,0.00049410743,0.0018836166,0.000027073678,0.00016418839,0.0009686483],"genre_scores_gemma":[0.58033574,0.00066705776,0.41683784,0.00017708271,0.0000443748,0.00014232387,0.0000028135426,0.00001712775,0.0017756341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983108,0.00018600449,0.0003356242,0.00035098725,0.0004193739,0.0003971879],"domain_scores_gemma":[0.99409777,0.0015552024,0.00022911251,0.00049461966,0.003568239,0.000055064924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017371,0.000151931,0.00029959428,0.00015842698,0.0007775121,0.00012561043,0.0010044997,0.00004933698,0.000001144293],"category_scores_gemma":[0.0031872196,0.000112234964,0.00008873599,0.00070191413,0.00021494887,0.0002467549,0.0004171424,0.00016997341,8.6301895e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018951298,0.00015200916,0.0000141461,0.0006698905,0.0002492276,0.0000042282745,0.015884534,0.026870651,0.002395693,0.8329176,0.007129625,0.11352289],"study_design_scores_gemma":[0.0027313407,0.001638127,0.00002315128,0.003262359,0.000021178304,0.0000016786146,0.025656508,0.12804538,0.45277005,0.3780001,0.0073286262,0.00052148075],"about_ca_topic_score_codex":0.0000032677456,"about_ca_topic_score_gemma":0.000025418161,"teacher_disagreement_score":0.574432,"about_ca_system_score_codex":0.00016216877,"about_ca_system_score_gemma":0.0004780709,"threshold_uncertainty_score":0.5980073},"labels":[],"label_agreement":null},{"id":"W1505883827","doi":"10.1007/978-3-642-19861-8_3","title":"Staged Static Techniques to Efficiently Implement Array Copy Semantics in a MATLAB JIT Compiler","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Compiler; MATLAB; Benchmark (surveying); Programming language; Semantics (computer science); Parallel computing; Set (abstract data type); Static analysis","score_opus":0.022546181754094972,"score_gpt":0.27645237116506705,"score_spread":0.2539061894109721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505883827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011141305,0.00008676986,0.99345255,0.0010616038,0.0006337278,0.0012572288,0.000012077679,0.0007239033,0.0026606994],"genre_scores_gemma":[0.0721704,0.000054142914,0.92364943,0.003625053,0.00012917405,0.000042739826,0.00001045667,0.000055997378,0.00026262915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467325,0.00011018553,0.0010700751,0.0019127907,0.001157272,0.0010764017],"domain_scores_gemma":[0.9967223,0.0003701474,0.00043542258,0.0018103197,0.00038146935,0.00028033045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019110774,0.0007576544,0.00085574714,0.002084885,0.00025066908,0.00060950354,0.004255559,0.00031562464,0.000037792757],"category_scores_gemma":[0.0000892609,0.0007269293,0.00013059693,0.0013163006,0.00031714686,0.00037119177,0.0016723897,0.0009456577,0.000053972486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007038082,0.00055043015,0.00066102546,0.0003624801,0.00005699772,0.00043787603,0.013682878,0.1927472,0.0012148629,0.08329651,0.0023988078,0.7045206],"study_design_scores_gemma":[0.0013021048,0.002193946,0.00040042266,0.004054604,0.00003249728,0.00013820789,0.0000024830392,0.6646876,0.0713282,0.23019218,0.020821674,0.004846085],"about_ca_topic_score_codex":0.000088471286,"about_ca_topic_score_gemma":0.000101993544,"teacher_disagreement_score":0.6996745,"about_ca_system_score_codex":0.00055471243,"about_ca_system_score_gemma":0.00053950935,"threshold_uncertainty_score":0.99951816},"labels":[],"label_agreement":null},{"id":"W1506478314","doi":"10.1007/978-3-540-85451-7_17","title":"Performance Implications of Cache Affinity on Multicore Processors","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cache; Multi-core processor; Parallel computing; Cache algorithms; Cache pollution; Multiprocessing; Scheduling (production processes); CPU cache; Smart Cache; Cache invalidation; Cache coloring; Process (computing); Operating system","score_opus":0.029688930364759815,"score_gpt":0.26600431462501506,"score_spread":0.23631538426025525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1506478314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010447977,0.00012105297,0.9897762,0.00041360356,0.00028914478,0.0003404337,0.0000044483218,0.00030857374,0.007701725],"genre_scores_gemma":[0.55018973,0.00020221369,0.44883797,0.0004791354,0.00009175924,0.000011205223,0.0000043655955,0.00002071666,0.0001628982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997326,0.000025861224,0.00053294253,0.0010516124,0.0006442552,0.00041933393],"domain_scores_gemma":[0.99732757,0.00033926967,0.000434773,0.001362559,0.00042185557,0.000113976814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044086794,0.0003944201,0.00044624007,0.00075078616,0.0002986434,0.00010074483,0.0030558466,0.00025626205,0.0000049547534],"category_scores_gemma":[0.00010730843,0.00035897162,0.00010232773,0.00072367326,0.0006034567,0.00031582578,0.00068672496,0.0006097899,0.000015373507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008165608,0.000107981294,0.00057156914,0.00008161348,0.000010227988,0.000009311194,0.0012174512,0.463116,0.00005850541,0.0054171006,0.00013714128,0.5292649],"study_design_scores_gemma":[0.00021562296,0.0003426367,0.0021723572,0.0004728591,0.000005107537,0.00005337863,6.402647e-8,0.98000205,0.0061910744,0.00940142,0.00053392106,0.00060949894],"about_ca_topic_score_codex":0.00000869154,"about_ca_topic_score_gemma":0.00000668215,"teacher_disagreement_score":0.5491449,"about_ca_system_score_codex":0.00016814859,"about_ca_system_score_gemma":0.00053947966,"threshold_uncertainty_score":0.9998862},"labels":[],"label_agreement":null},{"id":"W1507587294","doi":"10.1007/978-3-642-02011-7_12","title":"A Heuristic Strong Connectivity Algorithm for Large Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Algorithm; Hopcroft–Karp algorithm; Heuristic; Undirected graph; Graph; Theoretical computer science; Pathwidth; Line graph; Artificial intelligence","score_opus":0.01628712586283387,"score_gpt":0.26597556620708024,"score_spread":0.24968844034424637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507587294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034707555,0.00036144082,0.99507886,0.00031444442,0.00089579204,0.0006959246,0.000020718262,0.00064130157,0.0019880189],"genre_scores_gemma":[0.019621657,0.000037725425,0.97860193,0.0010806028,0.0002712863,0.00001928049,0.000012747276,0.000031982287,0.0003227886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962148,0.00004604451,0.00051818613,0.0016662398,0.00069043296,0.000864298],"domain_scores_gemma":[0.99719346,0.0006561379,0.0003481331,0.0012329356,0.0003890224,0.00018029433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012605388,0.00056509627,0.0006348636,0.00088971097,0.0004486607,0.00055910577,0.0028588732,0.00034303538,0.0000057184234],"category_scores_gemma":[0.0001283718,0.00055485213,0.00022276078,0.00058602274,0.00024391002,0.00044465557,0.0007413676,0.0006416909,0.000008239911],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025168392,0.000046412893,0.0000062923505,0.000016182763,0.000008553511,0.00002164293,0.00013122977,0.01450172,0.0000041962685,0.0757331,0.00008485407,0.9094433],"study_design_scores_gemma":[0.0002707263,0.00023078657,0.000024280327,0.00014638896,0.0000059379313,0.00002551875,3.6591242e-8,0.72005236,0.00021777391,0.2770939,0.0014580906,0.00047425093],"about_ca_topic_score_codex":0.000008149666,"about_ca_topic_score_gemma":0.000017512702,"teacher_disagreement_score":0.90896904,"about_ca_system_score_codex":0.0002270194,"about_ca_system_score_gemma":0.00042551366,"threshold_uncertainty_score":0.9996903},"labels":[],"label_agreement":null},{"id":"W1510288926","doi":"10.5555/1787553.1787560","title":"Implementation, compilation, optimization of object-oriented languages, programs and systems: report on the workshop ICOOOLPS 2007 at ECOOP 2007","year":2007,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Attendance; Plan (archaeology); Set (abstract data type); Computer science; Object (grammar); Openness to experience; Software engineering; Library science; Programming language; Political science; Artificial intelligence; History; Psychology; Law","score_opus":0.04295373025969248,"score_gpt":0.23515150020003237,"score_spread":0.19219776994033988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510288926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076648414,0.000062787076,0.91951054,0.000060566985,0.00015171722,0.0003824217,0.0000022790355,0.00023748114,0.002943798],"genre_scores_gemma":[0.9884155,0.000046092253,0.010203412,0.00007830189,0.000043043226,0.000001133533,0.000052678664,0.000009507936,0.0011503267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882257,0.0001021915,0.0003123356,0.00040649582,0.00012649829,0.00022993184],"domain_scores_gemma":[0.99855614,0.00019169513,0.00036591472,0.0005026911,0.00030530954,0.000078222954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084407086,0.00013846839,0.00014715186,0.00016739641,0.00024849418,0.00005655769,0.00033942118,0.00007300712,0.000024463543],"category_scores_gemma":[0.00004220944,0.00012424754,0.000041793905,0.00081039255,0.000081510225,0.00023845586,0.00017528055,0.00009415643,0.000005164109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000449996,0.0001260479,0.069414295,0.000020653279,0.0000563216,0.0001277636,0.00053858384,0.7707606,0.000016033557,0.15357359,0.004455745,0.00086536433],"study_design_scores_gemma":[0.00070854556,0.00018069075,0.0094008,0.00008738984,0.000032903827,0.000057565023,0.0011385942,0.98488206,0.00054809067,0.000233689,0.0023895148,0.00034013973],"about_ca_topic_score_codex":0.00006905141,"about_ca_topic_score_gemma":0.000032744403,"teacher_disagreement_score":0.91176707,"about_ca_system_score_codex":0.00010554275,"about_ca_system_score_gemma":0.0000363559,"threshold_uncertainty_score":0.5066667},"labels":[],"label_agreement":null},{"id":"W1512669332","doi":"10.1007/11587514_15","title":"Induction Variable Analysis with Delayed Abstractions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Compiler; Scalar (mathematics); Representation (politics); Abstraction; Variable (mathematics); Benchmark (surveying); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.013560627076295967,"score_gpt":0.24620673216598962,"score_spread":0.23264610508969366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512669332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022585882,0.00015283228,0.9891284,0.0003911097,0.0003885239,0.00022227346,0.000003425177,0.0005351867,0.009155626],"genre_scores_gemma":[0.042219706,0.0000478775,0.9560548,0.0005093382,0.00030012897,0.000008769797,0.000013509595,0.000022708271,0.00082318374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690896,0.000029241657,0.00046710984,0.0013277355,0.0007807262,0.00048622896],"domain_scores_gemma":[0.99761796,0.00019906212,0.0003704739,0.0012887594,0.0003786964,0.00014502837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464451,0.00042781548,0.00048742237,0.0018452763,0.00034110234,0.0005076998,0.0019215329,0.00030930716,0.00005005815],"category_scores_gemma":[0.00002430478,0.0003761831,0.00012248995,0.0020963775,0.00031374494,0.0007717577,0.00043963813,0.0007776488,0.000027997507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037857706,0.00002430291,0.000020040963,0.0000041308344,0.00007168576,0.000011460767,0.00011860799,0.82797885,0.000014160642,0.010085267,0.000024823888,0.16164285],"study_design_scores_gemma":[0.00014112174,0.00015072635,0.00019384129,0.00007764342,0.00008252555,0.00006531505,7.955753e-8,0.9718671,0.00033896527,0.024792245,0.0017052328,0.0005851931],"about_ca_topic_score_codex":0.00006952896,"about_ca_topic_score_gemma":0.00012224472,"teacher_disagreement_score":0.16105767,"about_ca_system_score_codex":0.00032150748,"about_ca_system_score_gemma":0.0005038067,"threshold_uncertainty_score":0.999869},"labels":[],"label_agreement":null},{"id":"W1513020047","doi":"10.1007/11556930_61","title":"Area-Aware Pipeline Gating for Embedded Processors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Pipeline (software); Overhead (engineering); Branch predictor; Power gating; Embedded system; Parallel computing; Simple (philosophy); Critical path method; Microarchitecture; Gating; Computer hardware; Operating system; Transistor","score_opus":0.023643820143294934,"score_gpt":0.2777259816483452,"score_spread":0.2540821615050503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513020047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070766746,0.0002770667,0.99280816,0.001269462,0.00056355994,0.00068092893,0.000006967537,0.000760064,0.0036266902],"genre_scores_gemma":[0.030807113,0.000042296113,0.96476716,0.002692977,0.0004799744,0.00003403348,0.000016602444,0.000048774837,0.0011110787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962441,0.000030823445,0.0006856028,0.0015963252,0.0007505392,0.0006926405],"domain_scores_gemma":[0.99709904,0.00059546944,0.00047900464,0.0011030716,0.0005647297,0.00015866588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012474877,0.00057440094,0.00057564233,0.0007601871,0.00033673004,0.0006353254,0.0031769278,0.00032871665,0.000011329782],"category_scores_gemma":[0.00021059174,0.00053838687,0.00016957115,0.00052036863,0.00028913916,0.00061968836,0.00093087973,0.0006347013,0.000010755532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005987484,0.00003315923,0.000008617177,0.00006553481,0.0000070700257,0.000010974199,0.0008042017,0.4138755,0.000023874201,0.011726892,0.00028048852,0.5731577],"study_design_scores_gemma":[0.0002463145,0.00011135732,0.0000037151067,0.00043702012,0.0000056387553,0.000029848969,1.5014783e-7,0.93064076,0.0014102813,0.06416623,0.0023428788,0.0006058185],"about_ca_topic_score_codex":0.000004471319,"about_ca_topic_score_gemma":0.000024901747,"teacher_disagreement_score":0.5725519,"about_ca_system_score_codex":0.00022374396,"about_ca_system_score_gemma":0.00065443903,"threshold_uncertainty_score":0.99970675},"labels":[],"label_agreement":null},{"id":"W1514196962","doi":"10.1023/a:1011808526481","title":"Exploiting Locality in Single Assignment Data Structures Updated Through Split-Phase Transactions","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"International Social Science Council; Defense Advanced Research Projects Agency; Australian Centre for Advanced Photovoltaics; University of Delaware","keywords":"Computer science; Cache; Locality; Speedup; Porting; Exploit; Latency (audio); Parallel computing; Locality of reference; Software; Operating system","score_opus":0.0872778500453001,"score_gpt":0.3401463011643994,"score_spread":0.25286845111909934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514196962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032602467,0.00009336193,0.9640394,0.0006725936,0.00029585944,0.00024796237,0.0000076899505,0.00079010293,0.0012505667],"genre_scores_gemma":[0.68449986,0.0000065406193,0.3147934,0.0005336534,0.00007450964,0.0000023566438,0.000048079353,0.000013695962,0.000027917733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744505,0.0002527668,0.0006440491,0.00083633163,0.00030805534,0.00051374454],"domain_scores_gemma":[0.9982059,0.00016305053,0.00020953479,0.0012465874,0.00008486854,0.00009007283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006715419,0.00024784874,0.00028922406,0.00014549318,0.00031393307,0.00033157153,0.0016816503,0.00010301212,0.000031427953],"category_scores_gemma":[0.000048913815,0.00025506516,0.000054120355,0.00076790224,0.000058896556,0.00091812806,0.0006240009,0.00032689841,0.000010643126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004939314,0.001065222,0.0010073673,0.000060348375,0.00006306549,0.00014158725,0.0044767885,0.58645946,0.00047812235,0.003480691,0.0028111022,0.39990684],"study_design_scores_gemma":[0.0009766928,0.00006325695,0.00023485237,0.00008130757,0.0000065909494,0.000062713334,0.0001266824,0.992202,0.0009245652,0.002486671,0.0025239198,0.00031074008],"about_ca_topic_score_codex":0.00006408403,"about_ca_topic_score_gemma":0.000016200487,"teacher_disagreement_score":0.6518974,"about_ca_system_score_codex":0.0001386101,"about_ca_system_score_gemma":0.000061547056,"threshold_uncertainty_score":0.99999017},"labels":[],"label_agreement":null},{"id":"W1514336338","doi":"10.1109/fccm.2004.48","title":"Reconfigurable Molecular Dynamics Simulator","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Microprocessor; Speedup; Multiprocessing; Embedded system; Computation; Parallel computing; System on a chip; Computer architecture; Operating system","score_opus":0.00822305375736852,"score_gpt":0.23747622719671718,"score_spread":0.22925317343934867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514336338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021128915,0.000024672638,0.9431029,0.001036378,0.00007336469,0.000058863265,2.1106469e-7,0.00091749884,0.052673206],"genre_scores_gemma":[0.6178386,0.0000029673718,0.3810108,0.0005964266,0.000005843804,0.0000019686868,0.0000012332781,0.000004121476,0.0005380363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941105,0.000013334208,0.00011671234,0.00020208163,0.00010451961,0.0001523095],"domain_scores_gemma":[0.999492,0.000013705425,0.000031763302,0.00035336392,0.00005420809,0.000054958786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000966744,0.00007309875,0.00007456862,0.00005710555,0.000059809245,0.00009705811,0.00047057567,0.000040187868,0.000011726278],"category_scores_gemma":[0.000017421786,0.00006831875,0.00003624922,0.00022035104,0.000011999672,0.00017239936,0.000052603107,0.000058354468,0.000058630212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3372276e-7,0.00002220023,0.000016384221,0.0000017600508,0.0000037950624,0.000008304641,0.000044086322,0.36612636,0.00013124931,0.6289459,0.00013679448,0.004562752],"study_design_scores_gemma":[0.0001962864,0.000038215043,0.00002246073,0.000008426738,0.0000010049317,0.000009200902,0.0000028781913,0.91621274,0.023148108,0.05947229,0.00074078055,0.00014760651],"about_ca_topic_score_codex":0.000029832088,"about_ca_topic_score_gemma":0.0000026912712,"teacher_disagreement_score":0.6157257,"about_ca_system_score_codex":0.00008696445,"about_ca_system_score_gemma":0.00007880397,"threshold_uncertainty_score":0.2785958},"labels":[],"label_agreement":null},{"id":"W1514801348","doi":"10.1007/978-3-642-19595-2_1","title":"McFLAT: A Profile-Based Framework for MATLAB Loop Analysis and Transformations","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Compiler; Programming language; Interpreter; Parallel computing; Loop (graph theory); For loop; Code generation; Code (set theory); Computational science; Operating system","score_opus":0.02035546000123966,"score_gpt":0.2623846154754576,"score_spread":0.24202915547421794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514801348","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013486333,0.00021099094,0.9967629,0.0006107431,0.0002877808,0.00067277154,0.000015100925,0.00040168912,0.0010245432],"genre_scores_gemma":[0.031514283,0.000030621224,0.967309,0.00086155755,0.00008602815,0.00004069056,0.000015718353,0.000022002041,0.0001200799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736804,0.000029971125,0.0005294921,0.001119869,0.00046384087,0.0004887806],"domain_scores_gemma":[0.9977238,0.0005005342,0.0002955378,0.0010152017,0.00031008705,0.00015481615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000719211,0.00043081376,0.0005704854,0.0016227826,0.00035529156,0.00050147745,0.0018340894,0.00038158396,0.000015868325],"category_scores_gemma":[0.00007794676,0.0003989059,0.00021751974,0.0012870729,0.00039649228,0.0004107002,0.0002946348,0.00048753616,0.0000062281474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018762115,0.0000657364,0.00014859508,0.00015091649,0.00012508726,0.000011692059,0.0017694166,0.11474043,0.000012502717,0.23332387,0.000036524463,0.64959645],"study_design_scores_gemma":[0.00013741132,0.00011275758,0.0000639289,0.00016384864,0.000052575746,0.000004261688,5.100177e-8,0.7511235,0.000879422,0.24684404,0.00022119388,0.00039704313],"about_ca_topic_score_codex":0.000016546055,"about_ca_topic_score_gemma":0.000025026276,"teacher_disagreement_score":0.6491994,"about_ca_system_score_codex":0.000103694394,"about_ca_system_score_gemma":0.0003522802,"threshold_uncertainty_score":0.9998463},"labels":[],"label_agreement":null},{"id":"W1515695673","doi":"10.1109/iccad.2004.1382557","title":"DynamoSim: a trace-based dynamically compiled instruction set simulator","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Flexibility (engineering); Construct (python library); Instruction set; Computer architecture; Suite; TRACE (psycholinguistics); Programming language; Set (abstract data type); Scope (computer science); Computer architecture simulator; Parallel computing; Just-in-time compilation; Code (set theory)","score_opus":0.012156040534086265,"score_gpt":0.25684963149978934,"score_spread":0.2446935909657031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515695673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023550697,0.000017454982,0.9698348,0.0017228714,0.00010865417,0.00014918765,0.0000016360354,0.0017971088,0.0028175765],"genre_scores_gemma":[0.5892164,0.0000013835636,0.4099804,0.00057913916,0.000034535187,0.0000050759504,0.0000051587353,0.000006238584,0.00017167095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988314,0.000069425296,0.000281322,0.0003512541,0.00023303682,0.00023358282],"domain_scores_gemma":[0.9991759,0.000071983595,0.00008918229,0.00045093754,0.00010798817,0.00010400214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019046037,0.0001480286,0.0001560145,0.00013846469,0.00013548377,0.00015683995,0.0006001781,0.00008796324,0.000046642963],"category_scores_gemma":[0.000024080999,0.00013685119,0.00007059641,0.00038555014,0.000035161516,0.00034637927,0.00008878675,0.00013114847,0.000058550635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015045273,0.00013352363,0.00047106727,0.000009192753,0.000011979953,0.0000028178836,0.00012019798,0.89833707,0.00018075178,0.026116699,0.0023702409,0.07223144],"study_design_scores_gemma":[0.0005613297,0.00005732522,0.0005094221,0.000009777005,0.00000253649,0.0000060147413,0.000002315478,0.9917708,0.0011271968,0.00045345668,0.0053158943,0.00018390172],"about_ca_topic_score_codex":0.000010729731,"about_ca_topic_score_gemma":0.000013603044,"teacher_disagreement_score":0.5656657,"about_ca_system_score_codex":0.000090948895,"about_ca_system_score_gemma":0.00007405949,"threshold_uncertainty_score":0.558063},"labels":[],"label_agreement":null},{"id":"W1515959796","doi":"10.1109/pacrim.2003.1235707","title":"Prototype implementation and evaluation of a multibank embedded memory architecture in programmable logic","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Embedded system; Memory controller; Computer architecture; Programmable logic device; Dram; System on a chip; Memory architecture; Computer hardware; Semiconductor memory","score_opus":0.03300272482348893,"score_gpt":0.3486545215483691,"score_spread":0.3156517967248802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515959796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1084462,0.000057272322,0.8880838,0.00028547278,0.000017533834,0.0013146368,2.2831753e-7,0.00015112634,0.0016437038],"genre_scores_gemma":[0.6434391,0.000002652523,0.35643154,0.0000368066,0.0000033970384,0.00007734385,0.0000022305005,0.0000019620345,0.0000049789346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991972,0.000084131934,0.00018706951,0.000190681,0.00022706563,0.000113859016],"domain_scores_gemma":[0.9996023,0.000014056241,0.000076778066,0.00015849975,0.00012639827,0.00002192337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072265527,0.000066198896,0.000086417465,0.000129484,0.000028554252,0.000033201275,0.00014592157,0.000031417945,0.000007817861],"category_scores_gemma":[0.000022367669,0.00005627059,0.000014443371,0.0002843305,0.000019590509,0.00013609874,0.000060879538,0.000051668092,7.5031e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024582485,0.00021723696,0.0014134073,0.00006249947,0.000013191203,0.0000021661838,0.004767632,0.26703238,0.0017572496,0.047486715,0.000026954573,0.67719597],"study_design_scores_gemma":[0.0046251314,0.00074096513,0.008551422,0.00008212368,0.000015143172,0.000018554369,0.00033687637,0.7029752,0.068129405,0.21415006,0.000038624967,0.00033649945],"about_ca_topic_score_codex":0.00012455549,"about_ca_topic_score_gemma":0.00012639296,"teacher_disagreement_score":0.6768595,"about_ca_system_score_codex":0.000037773734,"about_ca_system_score_gemma":0.00010055687,"threshold_uncertainty_score":0.2294648},"labels":[],"label_agreement":null},{"id":"W1518789001","doi":"10.1109/mascot.1994.284453","title":"Evaluating memory system performance of a large scale NUMA multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Esri (Canada); University of Toronto","funders":"","keywords":"Computer science; Latency (audio); Parallel computing; Multiprocessing; Replication (statistics); Distributed memory; Performance tuning; Uniform memory access; Memory model; Shared memory; Memory management; Operating system; Semiconductor memory","score_opus":0.03736862643069354,"score_gpt":0.2984328095789396,"score_spread":0.26106418314824603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518789001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20864087,0.00010395956,0.7723304,0.000067436355,0.000082501814,0.00013045857,5.720582e-7,0.0007849315,0.01785884],"genre_scores_gemma":[0.67049426,0.00000600826,0.32868522,0.000047095444,0.00001484348,0.000007774835,2.7866665e-7,0.0000040279574,0.0007404729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896675,0.000052542877,0.0002725265,0.0002374959,0.00027154796,0.00019915821],"domain_scores_gemma":[0.9992324,0.000043370183,0.00013459871,0.0003746012,0.00017220741,0.000042789987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020533,0.00009124791,0.00014982215,0.00008534712,0.00012265763,0.000037695765,0.00055908365,0.00004201305,0.000030586834],"category_scores_gemma":[0.000026920985,0.000078882666,0.000039912105,0.0003269843,0.000016448204,0.0002660968,0.00015887147,0.00006516535,0.00004383078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005742974,0.0020543335,0.02013267,0.0042605517,0.00014716739,0.000020370664,0.037253838,0.3468742,0.008260119,0.042499553,0.015990682,0.5224491],"study_design_scores_gemma":[0.00024983461,0.00008651828,0.00017058349,0.00007963998,0.0000020679702,0.000008757602,0.00005767609,0.9848423,0.01436122,0.0000101293645,0.000033259967,0.000098007535],"about_ca_topic_score_codex":0.0000053899957,"about_ca_topic_score_gemma":5.949638e-7,"teacher_disagreement_score":0.6379681,"about_ca_system_score_codex":0.000024890262,"about_ca_system_score_gemma":0.0000133383455,"threshold_uncertainty_score":0.32167417},"labels":[],"label_agreement":null},{"id":"W1518915275","doi":"10.5555/1045658.1045689","title":"Extending a J2EE™ server with dynamic and flexible resource management","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Operating system; Java; Scalability; Virtual machine; Resource management (computing); Interface (matter); Overhead (engineering); Server; Application server; Distributed computing","score_opus":0.007515475247848583,"score_gpt":0.23401385584192533,"score_spread":0.22649838059407673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518915275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003322066,0.00006458435,0.97213775,0.0005840511,0.000013066266,0.00009861659,7.8714216e-8,0.0007845576,0.02299525],"genre_scores_gemma":[0.3786708,0.000023841176,0.6188848,0.0003372959,0.0000037133238,0.0000053620347,7.383783e-7,0.000005220913,0.0020682244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935395,0.000012860758,0.00008651686,0.0002621644,0.00012986631,0.00015461887],"domain_scores_gemma":[0.999614,0.00000868272,0.000030330546,0.00028240148,0.000016932707,0.00004765139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012524707,0.00008377723,0.000070295006,0.000095792195,0.000108470434,0.00013457124,0.00027993874,0.00002009436,0.000002768769],"category_scores_gemma":[0.0000012144637,0.00006550869,0.000012483254,0.00025710062,0.000021859203,0.00018536492,0.00021544962,0.000047673366,0.0000066603625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014063127,0.000092520626,0.00034160647,0.00005419145,0.000044444183,0.00007602879,0.00055840495,0.06763584,0.000060617564,0.89300835,0.00045830687,0.037655607],"study_design_scores_gemma":[0.0045840507,0.0009137219,0.013135271,0.0005781832,0.000040595398,0.00042636556,0.0003482571,0.86297375,0.0056225616,0.08797374,0.021621155,0.0017823185],"about_ca_topic_score_codex":0.0000129261325,"about_ca_topic_score_gemma":0.0000033013582,"teacher_disagreement_score":0.80503464,"about_ca_system_score_codex":0.000033274195,"about_ca_system_score_gemma":0.000009569042,"threshold_uncertainty_score":0.2671367},"labels":[],"label_agreement":null},{"id":"W1519429395","doi":"10.1109/icsm.1991.160335","title":"Visual editing of data structures","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Debugging; Computer science; Programmer; Programming language; Variable (mathematics); Data structure; State (computer science); Duration (music)","score_opus":0.05902321019991806,"score_gpt":0.3153779226676757,"score_spread":0.25635471246775765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519429395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006747248,0.000059086742,0.9848439,0.0001847694,0.00007234197,0.000025050314,8.4492643e-7,0.0002974316,0.013841828],"genre_scores_gemma":[0.5069363,0.000006302123,0.49277145,0.000086277665,0.00004293974,2.1318445e-7,0.0000018264285,0.0000016112828,0.00015310476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947405,0.000019349685,0.00012600808,0.00017586569,0.00011902249,0.00008569288],"domain_scores_gemma":[0.99937004,0.00003393469,0.000056320558,0.0004813026,0.000036211426,0.000022195487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109026834,0.00004445305,0.00006571599,0.000046259585,0.000037044683,0.000037420876,0.0010234559,0.00002117701,0.00006976013],"category_scores_gemma":[0.000033395758,0.0000375,0.000011300579,0.00015287413,0.000016490381,0.00033591088,0.0004904996,0.00003830241,0.000006001749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011804964,0.00013680183,0.0015591065,0.000030252724,0.000029026143,0.0000068477448,0.00067776523,0.003968859,0.00054777047,0.2310252,0.21067977,0.5513374],"study_design_scores_gemma":[0.00004610737,0.00001910759,0.00016465252,0.0000039615393,7.6422225e-7,0.0000034886891,0.000003996933,0.9938516,0.002901691,0.0013569866,0.0015975937,0.000050026483],"about_ca_topic_score_codex":0.000009688513,"about_ca_topic_score_gemma":5.6516126e-7,"teacher_disagreement_score":0.98988277,"about_ca_system_score_codex":0.0000027427714,"about_ca_system_score_gemma":0.000004174463,"threshold_uncertainty_score":0.19018526},"labels":[],"label_agreement":null},{"id":"W1520174615","doi":"","title":"Learning basic block scheduling heuristics from optimal data","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Greedy algorithm; Compiler; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Programming language","score_opus":0.032963500049492646,"score_gpt":0.2801046594780463,"score_spread":0.24714115942855366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520174615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008367278,0.00012300748,0.98524475,0.0007928908,0.00008599332,0.00004668183,0.0000022190854,0.0012744153,0.004062742],"genre_scores_gemma":[0.33411482,0.000024764182,0.6649725,0.00025384294,0.00015300677,8.0719116e-7,0.000020809764,0.0000064509286,0.0004530522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988541,0.0000572023,0.000213702,0.00046783735,0.00019157144,0.0002156036],"domain_scores_gemma":[0.9987491,0.00012609562,0.00007481721,0.00091256056,0.00006125322,0.00007617253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028238122,0.00011466587,0.000121116136,0.000063105574,0.00016955781,0.00024097909,0.0016972449,0.00005468664,0.000033705623],"category_scores_gemma":[0.0001327274,0.00011113291,0.000023465875,0.00019599799,0.000019777775,0.0004633525,0.0010816164,0.00021610185,0.0001233446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022644567,0.000053342545,0.00054414425,0.000002307572,0.000016386542,0.00000594071,0.00024576977,0.9322918,0.00011193465,0.0043286276,0.0056869336,0.056710564],"study_design_scores_gemma":[0.000111760884,0.000022585624,0.000083522245,0.00001093487,0.0000034682087,0.000004192466,0.00000968397,0.98078877,0.0010327259,0.0001348832,0.017647624,0.00014987201],"about_ca_topic_score_codex":0.000036171477,"about_ca_topic_score_gemma":0.0000031228553,"teacher_disagreement_score":0.32574752,"about_ca_system_score_codex":0.000019285862,"about_ca_system_score_gemma":0.000046096247,"threshold_uncertainty_score":0.45318687},"labels":[],"label_agreement":null},{"id":"W1520189063","doi":"10.1109/hipc.2014.7116889","title":"Optimizing shared data accesses in distributed-memory X10 systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cache coherence; Distributed shared memory; Shared memory; Stencil; Protocol (science); Variable (mathematics); Operating system; Speedup; Parallel computing; Distributed computing; Memory management; Uniform memory access; Overlay; Cache; CPU cache","score_opus":0.04240179644893977,"score_gpt":0.2913089414957313,"score_spread":0.2489071450467915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520189063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025067123,0.000106547515,0.9894344,0.00033686293,0.00021493179,0.00012547751,0.000009843805,0.00087493274,0.008646315],"genre_scores_gemma":[0.6643724,0.000031576026,0.33500043,0.00018512092,0.000065533255,0.000010614933,0.00011411096,0.000008794553,0.00021142395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866223,0.000110663466,0.00029253433,0.0004984671,0.00018592276,0.00025015944],"domain_scores_gemma":[0.99824595,0.00014805602,0.000092016206,0.0013849107,0.00006225794,0.0000668197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624124,0.00012376769,0.00018507267,0.00012787672,0.00008245048,0.0005246224,0.0027986753,0.000060151615,0.000007323636],"category_scores_gemma":[0.0001561905,0.00011113353,0.000017912205,0.00046529097,0.000018669009,0.0009921334,0.0012563939,0.00011169073,0.000021950555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012924982,0.00030828424,0.0028191053,0.00019925168,0.000035964185,0.000035546505,0.00076877885,0.7860862,0.00022587174,0.06989207,0.09643429,0.04318169],"study_design_scores_gemma":[0.00017148169,0.000015640919,0.0002957404,0.000050953127,0.000001237706,0.0000059228378,0.00001376045,0.99326503,0.00027139377,0.00019903475,0.005547913,0.00016186018],"about_ca_topic_score_codex":0.00014055298,"about_ca_topic_score_gemma":0.0000113080405,"teacher_disagreement_score":0.66412175,"about_ca_system_score_codex":0.000028669057,"about_ca_system_score_gemma":0.000039121853,"threshold_uncertainty_score":0.52006817},"labels":[],"label_agreement":null},{"id":"W1523978917","doi":"10.1109/pacrim.1993.407201","title":"A novel multiprocessor cache memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; MESI protocol; Cache pollution; Cache algorithms; Cache coloring; Cache; Cache invalidation; Bus sniffing; Cache coherence; Page cache; Parallel computing; Multiprocessing; Smart Cache; CPU cache; Operating system","score_opus":0.03659125664036488,"score_gpt":0.24842279011573892,"score_spread":0.21183153347537403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523978917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017013118,0.00008042663,0.93431664,0.000807535,0.000062294304,0.000054319244,1.8020646e-7,0.0010813151,0.06342719],"genre_scores_gemma":[0.28216395,0.000009892742,0.7091309,0.00087862357,0.000025865107,0.000006457628,2.5817056e-7,0.0000043229347,0.007779786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938256,0.00001139642,0.00011418998,0.00021692041,0.00012450677,0.00015041951],"domain_scores_gemma":[0.9995176,0.000033406013,0.000035536472,0.0003044066,0.00005704413,0.00005197329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009835207,0.00007431197,0.00007285335,0.00006192088,0.000077826924,0.00008085417,0.0005567304,0.000036397654,0.000073019764],"category_scores_gemma":[0.000033809818,0.00006319326,0.000029630242,0.00024984917,0.000015321173,0.00021306842,0.00012413583,0.00006281449,0.00012107642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005326938,0.0015756402,0.0003793265,0.00006961997,0.00006747033,0.000034678753,0.0067940955,0.061955787,0.0070131626,0.133473,0.25304165,0.53559023],"study_design_scores_gemma":[0.0001585287,0.000016518241,0.000053635144,0.000004123462,7.358328e-7,0.000013986303,0.0000044209746,0.9927832,0.003709565,0.00016162108,0.0029853506,0.000108332104],"about_ca_topic_score_codex":0.000018038128,"about_ca_topic_score_gemma":0.0000014054481,"teacher_disagreement_score":0.9308274,"about_ca_system_score_codex":0.000011699179,"about_ca_system_score_gemma":0.0000066936527,"threshold_uncertainty_score":0.25769463},"labels":[],"label_agreement":null},{"id":"W1525896424","doi":"10.1007/978-3-540-72521-3_17","title":"Tree-Traversal Orientation Analysis","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Computer science; Pointer (user interface); Data structure; Parallel computing; Compiler; Tree (set theory); Benchmark (surveying); Programming language; Artificial intelligence; Mathematics","score_opus":0.019222499828934765,"score_gpt":0.2789464715031697,"score_spread":0.25972397167423494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525896424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018984196,0.00013669518,0.9828446,0.0001762932,0.00077202736,0.00022105759,0.000002156147,0.0004887568,0.015339413],"genre_scores_gemma":[0.059122574,0.000038654725,0.93898445,0.00094738405,0.0002602865,0.0000034095779,0.000017449815,0.000023469684,0.0006023087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620277,0.00003482011,0.00059376773,0.0015022545,0.0010761245,0.00059023785],"domain_scores_gemma":[0.9975198,0.00032902168,0.00036320704,0.0012732925,0.00033891216,0.00017576017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012222258,0.00045447046,0.0005460727,0.0027716476,0.00025025677,0.0005110172,0.0026596198,0.00033823148,0.000029654931],"category_scores_gemma":[0.00005982019,0.00044468231,0.00024300066,0.0025544434,0.00039549393,0.0004979389,0.0007224542,0.00059145765,0.000032467684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005452009,0.000027909324,0.00019109967,0.000011482025,0.00006618046,0.00006838547,0.00063451653,0.22946759,0.000017085174,0.031173352,0.000043962034,0.738293],"study_design_scores_gemma":[0.00015554547,0.00010265634,0.0003177793,0.00006391369,0.000046148987,0.00001557519,1.0789675e-7,0.95751643,0.00085478026,0.03974312,0.0006290344,0.00055493414],"about_ca_topic_score_codex":0.000033759006,"about_ca_topic_score_gemma":0.00012189973,"teacher_disagreement_score":0.7377381,"about_ca_system_score_codex":0.0002643814,"about_ca_system_score_gemma":0.00032147596,"threshold_uncertainty_score":0.9998005},"labels":[],"label_agreement":null},{"id":"W1526495669","doi":"10.1007/3-540-45307-5_15","title":"Shared Virtual Memory Clusters with Next-Generation Interconnection Networks and Wide Compute Nodes","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Shared memory; Distributed shared memory; Synchronization (alternating current); Cache coherence; Interconnection; Distributed computing; Abstraction; Node (physics); Key (lock); Cache; Software; Computer architecture; Embedded system; Computer network; Parallel computing; CPU cache; Uniform memory access; Overlay; Memory management; Operating system; Cache algorithms","score_opus":0.024391213788908076,"score_gpt":0.2328951185804879,"score_spread":0.20850390479157982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526495669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000268289,0.0003722215,0.9954156,0.0005765656,0.0010384776,0.00042303436,0.0000013819332,0.0005415968,0.0013628025],"genre_scores_gemma":[0.37978405,0.00020031424,0.61621755,0.0027634187,0.00062759704,0.000014487283,0.00002829007,0.00005789868,0.00030637864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654776,0.00007631721,0.0005384371,0.0016528799,0.0006386099,0.000545971],"domain_scores_gemma":[0.99781483,0.00039388452,0.00037007718,0.00092684256,0.00030058387,0.00019379226],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000729538,0.0006070313,0.000540823,0.0008282141,0.00043819603,0.0013754086,0.001619023,0.000354168,0.000007488181],"category_scores_gemma":[0.000049534978,0.00054388103,0.0000783057,0.0006270298,0.0005629458,0.0012447885,0.0010181289,0.0007520491,0.000005098932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010973361,0.000015328596,0.000043455457,0.0000101282085,0.000013186979,0.00003670115,0.00031112615,0.74334633,0.000023799304,0.002379978,0.00009126652,0.25371772],"study_design_scores_gemma":[0.00033808348,0.00036376988,0.000052994405,0.0004008111,0.000010053209,0.00017644948,4.473841e-7,0.99369454,0.00022580948,0.0038438851,0.00023669272,0.00065648864],"about_ca_topic_score_codex":0.000036067922,"about_ca_topic_score_gemma":0.000113298614,"teacher_disagreement_score":0.37951577,"about_ca_system_score_codex":0.00025799236,"about_ca_system_score_gemma":0.000219267,"threshold_uncertainty_score":0.99970126},"labels":[],"label_agreement":null},{"id":"W1526863280","doi":"","title":"Mixed mode execution with context threading","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bytecode; Programming language; Compiler; Operating system; Interpreter; Context (archaeology); Virtual machine; Code generation; Runtime system; Source code; Key (lock)","score_opus":0.022281690075421044,"score_gpt":0.2532024445138627,"score_spread":0.23092075443844165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526863280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046385783,0.000032650307,0.9713468,0.0009848572,0.000031378226,0.00006300615,1.2143657e-7,0.0008962247,0.022006404],"genre_scores_gemma":[0.57311326,0.000003843895,0.42580143,0.00034102102,0.000019974952,0.000003167887,6.425389e-7,0.0000025500751,0.00071410084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994406,0.000020305635,0.00009877899,0.00018774932,0.000115893694,0.00013664398],"domain_scores_gemma":[0.99960333,0.00002186809,0.000038054866,0.00023876263,0.000055995042,0.00004196577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000924174,0.000072451796,0.00007377661,0.000056668214,0.00008501644,0.00008917742,0.00029920772,0.000027561911,0.000008748726],"category_scores_gemma":[0.0000052043215,0.000054966204,0.000018358283,0.00015929465,0.00001621574,0.00035118512,0.000058566868,0.00005001079,0.000035789602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001328448,0.00007317979,0.00037311114,0.000003804993,0.0000144492515,0.0000031756151,0.0006760037,0.07088401,0.00021570268,0.71176636,0.014691504,0.2012854],"study_design_scores_gemma":[0.00016864378,0.00005898064,0.00010558749,0.000012464474,0.0000013019958,0.000012627136,0.000012798547,0.98032045,0.013466127,0.0010504328,0.0046709836,0.00011960425],"about_ca_topic_score_codex":0.000027743725,"about_ca_topic_score_gemma":0.000028817905,"teacher_disagreement_score":0.9094364,"about_ca_system_score_codex":0.000028139464,"about_ca_system_score_gemma":0.000021798292,"threshold_uncertainty_score":0.22414567},"labels":[],"label_agreement":null},{"id":"W1527161470","doi":"","title":"A quantitative analysis of the performance impact of specialized bytecodes in java","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Java; Benchmark (surveying); Operating system; Class (philosophy); Virtual machine; Programming language; Artificial intelligence","score_opus":0.022352392107344222,"score_gpt":0.314078695584088,"score_spread":0.2917263034767438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527161470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5351484,0.000015751806,0.46330127,0.000036817724,0.000010874731,0.000045247096,7.547465e-7,0.000025335952,0.0014155515],"genre_scores_gemma":[0.8617936,0.000019735495,0.13814233,0.000013395582,0.0000015713897,0.0000011161675,3.5866876e-7,0.0000013434696,0.00002656651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993827,0.00004412476,0.00024049402,0.00011482429,0.00013028223,0.000087604465],"domain_scores_gemma":[0.9994189,0.000046118625,0.0001456322,0.0002957207,0.00008012872,0.000013460488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022501999,0.000058657584,0.00019928056,0.0002819894,0.000022865048,0.000011782237,0.00050420134,0.000022587421,0.0000117034015],"category_scores_gemma":[0.000035818968,0.00003584023,0.00015545501,0.0021676756,0.000046431127,0.0001261675,0.00009783004,0.000042718493,6.7906404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009954413,0.00007595612,0.03245852,0.0000046315486,0.00011503681,2.1049287e-7,0.0011816112,0.9357372,0.00056508434,0.029209727,0.000026538053,0.0006155226],"study_design_scores_gemma":[0.00021436941,0.000110793706,0.21121593,0.000022018226,0.000016618718,2.9815487e-7,0.000012148644,0.77530575,0.012169453,0.0008744345,0.0000017993036,0.000056402594],"about_ca_topic_score_codex":0.000514461,"about_ca_topic_score_gemma":0.00008188572,"teacher_disagreement_score":0.3266452,"about_ca_system_score_codex":0.000041323226,"about_ca_system_score_gemma":0.00008228621,"threshold_uncertainty_score":0.14615221},"labels":[],"label_agreement":null},{"id":"W1528455415","doi":"10.1007/978-3-540-93900-9_24","title":"A Scalable Memory Model for Low-Level Code","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Code (set theory); Scalability; Parallel computing; Programming language; Operating system","score_opus":0.040442354558481004,"score_gpt":0.26696342567454723,"score_spread":0.22652107111606623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528455415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000997001,0.000389904,0.99401087,0.00048754783,0.00073230086,0.0006707748,0.000022621969,0.0006286591,0.0030473438],"genre_scores_gemma":[0.010623316,0.00013630891,0.98392844,0.0019044436,0.00025733572,0.00003283352,0.000010022733,0.000050868053,0.003056407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959832,0.000023806577,0.0006234728,0.0017350982,0.0008357345,0.000798683],"domain_scores_gemma":[0.99702877,0.00040803515,0.0003380586,0.0015354091,0.0004878693,0.00020187609],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000797305,0.000585886,0.0006377424,0.0008340642,0.000491432,0.00039025635,0.0039522042,0.00041454978,0.000004693959],"category_scores_gemma":[0.00011288357,0.00057067565,0.00021278748,0.00049009157,0.00056932546,0.0005417463,0.0012092318,0.00059322815,0.000020039733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056084714,0.000031739368,0.0000018008403,0.00003665735,0.0000068822064,0.000015917416,0.0005252354,0.8146219,0.000024579425,0.0036283785,0.0009920902,0.18010917],"study_design_scores_gemma":[0.00027821376,0.00008594902,0.0000029331882,0.00024732345,0.000004285964,0.000051275,2.698577e-8,0.9217396,0.0012642007,0.07503738,0.00066712085,0.0006217086],"about_ca_topic_score_codex":0.000009887622,"about_ca_topic_score_gemma":0.000021226697,"teacher_disagreement_score":0.17948745,"about_ca_system_score_codex":0.0002905739,"about_ca_system_score_gemma":0.0010328892,"threshold_uncertainty_score":0.9996745},"labels":[],"label_agreement":null},{"id":"W1529108641","doi":"10.1109/pacrim.1995.519532","title":"Efficient object-oriented execution strategies for parallel computers","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Concurrency; Concurrency control; Object (grammar); Object-oriented programming; Synchronization (alternating current); Task (project management); Programming language; Distributed computing; Control (management); Separation of concerns; Software engineering; Software; Artificial intelligence; Database transaction","score_opus":0.022254547010149697,"score_gpt":0.25363618917437564,"score_spread":0.23138164216422594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529108641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009966616,0.00008024759,0.98635507,0.0005459827,0.0003162601,0.00032231255,0.0000010170484,0.0013656806,0.010016771],"genre_scores_gemma":[0.38004056,0.000008063972,0.6190614,0.00033111608,0.00003514652,0.00003095856,0.0000032893624,0.0000063076186,0.00048312254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887604,0.000039893086,0.0002351647,0.00037236078,0.00018431783,0.00029222463],"domain_scores_gemma":[0.99925214,0.00009332572,0.00008205428,0.0003668914,0.00013255462,0.00007304534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017007715,0.00014485008,0.00014285269,0.0001243334,0.00020260642,0.00021175304,0.0004877084,0.00005924737,0.000016194697],"category_scores_gemma":[0.000015996202,0.00013066099,0.000084520514,0.0003229336,0.000035374618,0.00015606926,0.00011039747,0.00006457492,0.000029023196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004890806,0.00014493297,0.000013108632,0.000012646577,0.000013284463,0.0000019905926,0.0007716805,0.4564055,0.00006079477,0.4999394,0.03491892,0.0077128666],"study_design_scores_gemma":[0.00035248292,0.000112054615,0.000041779433,0.000011375495,0.0000024085168,0.0000059630415,0.000041594343,0.9928221,0.00019700508,0.0019106405,0.0043260637,0.0001765008],"about_ca_topic_score_codex":0.00001074207,"about_ca_topic_score_gemma":0.0000010593834,"teacher_disagreement_score":0.53641665,"about_ca_system_score_codex":0.00003695949,"about_ca_system_score_gemma":0.000022018654,"threshold_uncertainty_score":0.53282005},"labels":[],"label_agreement":null},{"id":"W153103601","doi":"10.1007/978-3-642-39799-8_12","title":"Duet: Static Analysis for Unbounded Parallelism","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Concurrency; Computer science; Invariant (physics); Abstract interpretation; Modular design; Static analysis; Bounded function; Data flow diagram; Theoretical computer science; Programming language; Data-flow analysis; Parallelism (grammar); Parallel computing; Domain (mathematical analysis); Construct (python library); Algorithm; Mathematics; Database","score_opus":0.021356358182480717,"score_gpt":0.265792047061964,"score_spread":0.2444356888794833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153103601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019155252,0.00025250914,0.9946199,0.0009383373,0.0006458174,0.00076262513,0.0000074125846,0.0004942083,0.002260019],"genre_scores_gemma":[0.033375487,0.000054899774,0.9631895,0.0016724629,0.00020272774,0.000050139573,0.000022675025,0.000034694272,0.001397439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960143,0.000043019478,0.00071256445,0.0016826444,0.0007984003,0.0007490447],"domain_scores_gemma":[0.9964714,0.00070259627,0.00045634588,0.0016494591,0.00052022317,0.0001999567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090076576,0.0005746875,0.000822917,0.001769176,0.00035366154,0.0010324034,0.0036460862,0.0003354816,0.000043582888],"category_scores_gemma":[0.000113837355,0.00052981096,0.00034202432,0.0013890661,0.00043384137,0.0005477219,0.0008652295,0.00047730972,0.000046116147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051063353,0.00003956604,0.000043767523,0.00004931225,0.00014861829,0.000016649661,0.0007127041,0.6676703,0.000013860872,0.07222099,0.00038014693,0.25869894],"study_design_scores_gemma":[0.00017366526,0.00010587267,0.000053198186,0.000069289425,0.000039179562,0.0000068403324,6.1721344e-8,0.7626124,0.00015571418,0.23473227,0.0015429299,0.00050860085],"about_ca_topic_score_codex":0.000038124963,"about_ca_topic_score_gemma":0.0000347774,"teacher_disagreement_score":0.25819033,"about_ca_system_score_codex":0.0002588989,"about_ca_system_score_gemma":0.0004396974,"threshold_uncertainty_score":0.9997153},"labels":[],"label_agreement":null},{"id":"W1531673041","doi":"10.1007/11577188_36","title":"Can Out-of-Order Instruction Execution in Multiprocessors Be Made Sequentially Consistent?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Correctness; Sequential consistency; Synchronization (alternating current); Consistency (knowledge bases); Parallel computing; Consistency model; Out-of-order execution; Order (exchange); Programming language; Theoretical computer science; Artificial intelligence","score_opus":0.02210780547691989,"score_gpt":0.2617374258447762,"score_spread":0.23962962036785632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531673041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048224305,0.00019394708,0.9943865,0.0010986415,0.001235652,0.00038005854,0.0000051941724,0.00025819908,0.001959583],"genre_scores_gemma":[0.24507895,0.00010530945,0.75354123,0.0007699046,0.0001918016,0.000009042209,0.000012223657,0.000027757238,0.00026376804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965612,0.000056901,0.0008143784,0.0012323366,0.00081826025,0.0005168925],"domain_scores_gemma":[0.9978795,0.00015774705,0.0005331313,0.00087079965,0.00044785003,0.00011093907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072218396,0.00045806024,0.00054853305,0.0013062231,0.00014722682,0.00023083991,0.0019590678,0.00039868834,0.000009720257],"category_scores_gemma":[0.00011322248,0.0004691581,0.00010679765,0.00086366537,0.0005932051,0.0004991196,0.00069737853,0.0006814487,0.000004159402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012987264,0.00006636066,0.00017858118,0.000078095756,0.000013849445,0.00003330964,0.002214461,0.5046602,0.00038886842,0.014106588,0.00002276319,0.47822395],"study_design_scores_gemma":[0.00061330106,0.00013742442,0.00018133399,0.0005957773,0.000008591615,0.000045479093,6.316628e-7,0.95545423,0.005646769,0.035792906,0.0007784662,0.0007450855],"about_ca_topic_score_codex":0.000091413225,"about_ca_topic_score_gemma":0.00044136323,"teacher_disagreement_score":0.47747886,"about_ca_system_score_codex":0.00041558413,"about_ca_system_score_gemma":0.000740635,"threshold_uncertainty_score":0.999776},"labels":[],"label_agreement":null},{"id":"W1531893649","doi":"10.1109/second.2006.1629366","title":"Predictive Line Buffer: A Fast, Energy Efficient Cache Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Cache; Microarchitecture; Architecture; Parallel computing; Cache-only memory architecture; Smart Cache; Cache pollution; Computer architecture; Embedded system; Energy consumption; CPU cache; Branch predictor; Multiplexer; Cache algorithms; Memory architecture; Cache coloring; Multiplexing","score_opus":0.0054550840384034295,"score_gpt":0.20980006370415494,"score_spread":0.20434497966575152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531893649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072805944,0.0001113716,0.95737827,0.00056266424,0.00007408852,0.000068130874,0.0000018532843,0.0012428641,0.039832722],"genre_scores_gemma":[0.7185059,0.000004009079,0.2780638,0.00039842213,0.00012058409,0.000013154363,0.0000090548165,0.00000824298,0.0028768012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998958,0.00006055517,0.00018482182,0.00034318777,0.00021621818,0.00023723712],"domain_scores_gemma":[0.9993682,0.000055578275,0.000059852904,0.00037454002,0.00008570133,0.000056164245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117266914,0.0001366845,0.00012431305,0.00012567583,0.00010618299,0.000089969086,0.000535284,0.00006834389,0.000011187405],"category_scores_gemma":[0.00000935098,0.00010846675,0.000052379648,0.00033559132,0.0000331765,0.000047984046,0.00021290465,0.000107397944,0.000008854557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000431091,0.00010160137,0.00003413304,0.0000023160178,0.000006187998,0.0000056828103,0.00008243033,0.9071682,0.0001370054,0.075781316,0.005592533,0.011084267],"study_design_scores_gemma":[0.00015688642,0.00009424142,0.0001886556,0.000008157176,0.0000024599315,0.0000147194905,0.000002446816,0.97994494,0.00671794,0.00423637,0.00848533,0.00014783467],"about_ca_topic_score_codex":0.0002854534,"about_ca_topic_score_gemma":0.000014740602,"teacher_disagreement_score":0.71777785,"about_ca_system_score_codex":0.00003071347,"about_ca_system_score_gemma":0.00003906985,"threshold_uncertainty_score":0.44231457},"labels":[],"label_agreement":null},{"id":"W1532814626","doi":"10.1007/3-540-44467-x_32","title":"Memory Consistency and Process Coordination for SPARC Multiprocessors","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sequential consistency; Correctness; Consistency (knowledge bases); Consistency model; Critical section; Rotation formalisms in three dimensions; Memory model; Synchronization (alternating current); Set (abstract data type); Parallel computing; Theoretical computer science; Shared memory; Programming language; Distributed computing","score_opus":0.016796391757680617,"score_gpt":0.2644749244284944,"score_spread":0.2476785326708138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532814626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000083306986,0.00053723995,0.9929483,0.0006959031,0.0003610855,0.0006875317,0.000004824472,0.00038852452,0.00429332],"genre_scores_gemma":[0.20806189,0.000107106,0.7899032,0.0010587561,0.00021553393,0.00004534691,0.00000990928,0.00003891536,0.0005593128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971769,0.000021752809,0.00046706162,0.0013491352,0.0005206463,0.00046450648],"domain_scores_gemma":[0.9981003,0.0004141405,0.00027949517,0.0006461906,0.00042768172,0.00013221927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068914134,0.00042383472,0.0004521042,0.0006991239,0.00037704883,0.0004420555,0.0016314362,0.00028004945,0.0000072008356],"category_scores_gemma":[0.00012941362,0.00040757176,0.00007661778,0.00041613166,0.00055890845,0.00053425133,0.00033821032,0.0003671489,0.00000461474],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011128789,0.000028738392,0.000018442777,0.00012608689,0.000008467527,0.000010334139,0.0008957877,0.070389695,0.00001761374,0.008974028,0.000043921966,0.91947573],"study_design_scores_gemma":[0.00030841486,0.0001363684,0.000019311856,0.0002751566,0.000006633545,0.00003911655,1.9151832e-7,0.7815372,0.0013502302,0.21531554,0.0005297741,0.00048211854],"about_ca_topic_score_codex":0.000007963506,"about_ca_topic_score_gemma":0.00001181731,"teacher_disagreement_score":0.91899365,"about_ca_system_score_codex":0.00010544009,"about_ca_system_score_gemma":0.00043313994,"threshold_uncertainty_score":0.99983764},"labels":[],"label_agreement":null},{"id":"W1533782139","doi":"10.1007/978-3-642-12659-8_3","title":"Application of Parallel Processing to the Simulation of Heart Mechanics","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Polygon mesh; Computational science; Computational fluid dynamics; Cluster (spacecraft); Algorithm; Parallel computing; Mechanics; Computer graphics (images); Physics","score_opus":0.015860667593832672,"score_gpt":0.2744582109178014,"score_spread":0.2585975433239688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1533782139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018199782,0.000106488864,0.9980392,0.00077992637,0.00024119909,0.00049345626,0.0000015347646,0.00011106617,0.00020895],"genre_scores_gemma":[0.37944883,0.000004016654,0.620094,0.00034856505,0.00007102595,0.0000062362956,0.0000013999017,0.000010131082,0.00001576045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791014,0.000025677133,0.00051539054,0.000661508,0.000649373,0.0002379191],"domain_scores_gemma":[0.9976637,0.00027194092,0.00044573177,0.001053639,0.00050210877,0.000062877596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094561727,0.00023240804,0.00033956542,0.00044006042,0.00015625684,0.00010593982,0.0022397228,0.00021461537,0.0000016382583],"category_scores_gemma":[0.00009259207,0.00018231709,0.00007506111,0.0006688956,0.00017902885,0.00020750146,0.0006640586,0.0004124636,0.0000038296844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023583586,0.000010638833,0.0000062585887,0.000020144682,0.0000013859665,2.1797909e-7,0.0003280183,0.7936396,0.00042074808,0.006553873,0.0000029436305,0.19901381],"study_design_scores_gemma":[0.00005505504,0.00007661294,0.000025474663,0.00012612401,0.0000031361078,0.0000039516835,6.350776e-8,0.9325351,0.004075438,0.06202433,0.0009009528,0.00017372113],"about_ca_topic_score_codex":0.000014109114,"about_ca_topic_score_gemma":0.000018156103,"teacher_disagreement_score":0.37943062,"about_ca_system_score_codex":0.000050696002,"about_ca_system_score_gemma":0.00026267543,"threshold_uncertainty_score":0.7434675},"labels":[],"label_agreement":null},{"id":"W1535718607","doi":"10.1007/11796435_31","title":"Reducing Execution Unit Leakage Power in Embedded Processors","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leakage (economics); Leakage power; Unit (ring theory); Computer science; Embedded system; Power (physics); Power consumption; Psychology; Physics; Economics","score_opus":0.01537262898530158,"score_gpt":0.2574425904635573,"score_spread":0.24206996147825569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535718607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003588445,0.00030817118,0.98227763,0.00033437487,0.00069185585,0.00040802706,0.0000017588338,0.00053723407,0.015082105],"genre_scores_gemma":[0.39980072,0.000032997774,0.5981563,0.0006631689,0.00019490284,0.000014273235,0.00001199529,0.000047578513,0.0010780867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959424,0.0000613686,0.0007378046,0.0016442963,0.0008732593,0.0007408859],"domain_scores_gemma":[0.99779457,0.00022599027,0.00039113607,0.0011904209,0.00028117222,0.00011669705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011302878,0.00055427384,0.00054473046,0.0016574105,0.00023313017,0.0005447815,0.0029121304,0.0004177748,0.000011766158],"category_scores_gemma":[0.00010085139,0.00055365416,0.00010491988,0.0013729043,0.00040467846,0.00071630103,0.00094870094,0.0009672165,0.000020908315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000697202,0.000069753936,0.0001139997,0.000050404808,0.000005285798,0.00012334448,0.0013768486,0.86653113,0.000120122604,0.010566963,0.00022527114,0.12080993],"study_design_scores_gemma":[0.00029361207,0.0001392377,0.00027324702,0.0008133103,0.0000035593584,0.000052141313,2.7666158e-7,0.9292499,0.002295985,0.06529749,0.00072274543,0.00085853034],"about_ca_topic_score_codex":0.00007453479,"about_ca_topic_score_gemma":0.000048731752,"teacher_disagreement_score":0.39944187,"about_ca_system_score_codex":0.0003519662,"about_ca_system_score_gemma":0.0005590997,"threshold_uncertainty_score":0.9996915},"labels":[],"label_agreement":null},{"id":"W1536797392","doi":"","title":"Proceedings, International Conference on Parallel Processing, 18-21 August 2002, Vancouver, B.C., Canada","year":2002,"lang":"en","type":"book","venue":"IEEE Computer Society eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Computer science; Architecture; Grid; Scheduling (production processes); Grid system; Grid computing; Parallel computing; Library science; Computer architecture; Operating system; History; Engineering; Geography; Archaeology","score_opus":0.029774444213098904,"score_gpt":0.24120174566147526,"score_spread":0.21142730144837635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536797392","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015563228,0.0001027253,0.49901924,0.00019099521,0.00397562,0.00038399827,0.000018953355,0.00093698426,0.4953699],"genre_scores_gemma":[0.0003341234,0.00011244453,0.22213008,0.0034964974,0.0015385571,0.00006286008,0.000026015545,0.000091793154,0.7722076],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555445,0.000036203677,0.0007956026,0.0014965654,0.001368084,0.0007491241],"domain_scores_gemma":[0.99716127,0.000065939144,0.0008289873,0.00072952406,0.00091417274,0.00030010677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000247534,0.0008971817,0.000735164,0.00014598756,0.00043218114,0.00085265335,0.0036937918,0.00059873366,0.000106346284],"category_scores_gemma":[0.0000062552167,0.0009349318,0.00040438984,0.00012376925,0.0001659473,0.0002847554,0.00064467214,0.0012082667,0.000034897883],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045812326,0.000049499293,0.000002200423,0.00009125682,0.000117433774,0.000024315808,0.00044888785,0.0014116769,0.0000015877408,0.0051653013,0.976744,0.01593924],"study_design_scores_gemma":[0.00043863585,0.000106349464,0.0000025412085,0.000531041,0.000018170718,0.000020355044,0.0000069854923,0.5274779,0.000033351454,0.0015767635,0.46892694,0.0008609641],"about_ca_topic_score_codex":0.0018095239,"about_ca_topic_score_gemma":0.0029946798,"teacher_disagreement_score":0.52606624,"about_ca_system_score_codex":0.0010970677,"about_ca_system_score_gemma":0.0024668537,"threshold_uncertainty_score":0.99931014},"labels":[],"label_agreement":null},{"id":"W1537460407","doi":"10.1007/11549468_65","title":"A Novel Lightweight Directory Architecture for Scalable Shared-Memory Multiprocessors","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Directory; Computer science; Scalability; Cache coherence; Operating system; Cache-only memory architecture; Lightweight Directory Access Protocol; Shared memory; Distributed shared memory; Directory service; Parallel computing; Computer architecture; Uniform memory access; Computer network; CPU cache; Cache; Memory management; Cache algorithms; Overlay","score_opus":0.01762340893797223,"score_gpt":0.25552755548724093,"score_spread":0.2379041465492687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537460407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009732192,0.0011105161,0.99046206,0.0010816996,0.0010533674,0.0008859979,0.000024692932,0.000953774,0.004418168],"genre_scores_gemma":[0.004439367,0.00005419358,0.9904545,0.0018968127,0.00090830075,0.00005746554,0.00001863986,0.000074926786,0.0020958108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950738,0.00002610399,0.000725763,0.0022383248,0.0009471739,0.0009888319],"domain_scores_gemma":[0.9965261,0.0006907463,0.00046079332,0.0015538567,0.0005017334,0.00026673853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092355214,0.0008109464,0.00076988834,0.0012942551,0.0004950116,0.00071988895,0.004545099,0.0005292723,0.000021658261],"category_scores_gemma":[0.00018164323,0.0007427703,0.00026958706,0.0007580255,0.000520669,0.000636172,0.00122524,0.0009257693,0.000022782264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014490411,0.00008459769,0.000007967073,0.00010823398,0.000019960928,0.000014025772,0.00089012017,0.34207535,0.00036459538,0.0046845954,0.00040185917,0.6513342],"study_design_scores_gemma":[0.0005805619,0.0001667801,0.000022631779,0.00063680316,0.0000123181135,0.00007308728,8.442556e-8,0.93999666,0.0056552296,0.031638257,0.020047268,0.0011703405],"about_ca_topic_score_codex":0.000016414539,"about_ca_topic_score_gemma":0.000055961813,"teacher_disagreement_score":0.6501639,"about_ca_system_score_codex":0.00036670675,"about_ca_system_score_gemma":0.00069777144,"threshold_uncertainty_score":0.99950236},"labels":[],"label_agreement":null},{"id":"W1539438108","doi":"","title":"CoreASM: An Extensible ASM Execution Engine","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Abstract state machines; Extensibility; Executable; Computer science; Programming language; Architecture; State (computer science); Scheduling (production processes); Finite-state machine; Engineering","score_opus":0.016355228574913165,"score_gpt":0.263037308996665,"score_spread":0.24668208042175183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539438108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032251442,0.000041232757,0.9759862,0.0009725827,0.00006988754,0.000059861195,1.7983132e-7,0.0015642084,0.018080695],"genre_scores_gemma":[0.43806767,0.000011394078,0.5603269,0.00047062367,0.00006290851,0.0000026139226,0.0000025946222,0.0000035821643,0.0010517392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993129,0.00002978899,0.00013023028,0.00023579926,0.00012912221,0.00016220598],"domain_scores_gemma":[0.999382,0.000015945461,0.000034375473,0.00040314096,0.00008484472,0.0000796679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018424829,0.00008092577,0.00007767972,0.00008729287,0.00008079208,0.000098836696,0.00041124533,0.000041657917,0.000032924545],"category_scores_gemma":[0.000013228519,0.00007282504,0.000025314008,0.00022084237,0.000013252128,0.00055720133,0.00008333693,0.000059824055,0.000075830234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006443904,0.00030646825,0.00026433694,0.000005364082,0.000011161785,0.000008219078,0.0004907673,0.08352065,0.0014534366,0.4146503,0.044599134,0.45468372],"study_design_scores_gemma":[0.000113699105,0.00006141698,0.0004699124,0.0000044593703,0.0000011435928,0.00001999987,0.0000028973259,0.9732952,0.012934472,0.0018690168,0.0110965995,0.00013115088],"about_ca_topic_score_codex":0.000018242803,"about_ca_topic_score_gemma":0.000003523661,"teacher_disagreement_score":0.88977456,"about_ca_system_score_codex":0.000023779552,"about_ca_system_score_gemma":0.000024007273,"threshold_uncertainty_score":0.29697186},"labels":[],"label_agreement":null},{"id":"W1540085086","doi":"10.1007/978-3-540-77090-9_56","title":"Energy-Efficiency on a Variable-Bitrate Device","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Conventional PCI; Energy consumption; Network packet; Efficient energy use; Dynamic demand; Power management; Variable (mathematics); Power consumption; Power (physics); Embedded system; Real-time computing; Computer network; Engineering; Electrical engineering","score_opus":0.023437669300936256,"score_gpt":0.26270223703147183,"score_spread":0.23926456773053556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540085086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000042589563,0.0003127328,0.9421919,0.00026535284,0.001561344,0.00022520636,0.0000025358077,0.0007234658,0.054713175],"genre_scores_gemma":[0.023190765,0.00007073936,0.968286,0.006804465,0.0005888804,0.000008891484,0.000006835443,0.000054166478,0.0009892813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995029,0.000054444827,0.00070808636,0.0019709899,0.0012846057,0.00095290976],"domain_scores_gemma":[0.9965356,0.00066500297,0.00039470984,0.0017638679,0.00039267837,0.00024812194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016303213,0.0006979399,0.0005828878,0.0015810978,0.00040696177,0.00065589097,0.0044587804,0.00048452013,0.000021471042],"category_scores_gemma":[0.000081043036,0.0006500224,0.0001393264,0.0014974496,0.0004674584,0.00041322966,0.0011209387,0.00093959866,0.000049647686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009206688,0.000073389456,0.0000054744874,0.000021996888,0.0000096412,0.00010394464,0.00020871838,0.24199487,0.000030732885,0.32140404,0.0001191564,0.43601882],"study_design_scores_gemma":[0.0001980148,0.00028486786,0.0000060929337,0.00043178425,0.000005146826,0.000056165332,3.799784e-8,0.8513751,0.0018062571,0.13864933,0.0063977367,0.00078946166],"about_ca_topic_score_codex":0.000036478552,"about_ca_topic_score_gemma":0.000018572986,"teacher_disagreement_score":0.60938025,"about_ca_system_score_codex":0.0003668754,"about_ca_system_score_gemma":0.0007508827,"threshold_uncertainty_score":0.9995951},"labels":[],"label_agreement":null},{"id":"W1540671747","doi":"10.1109/iscas.2015.7168921","title":"Analysis and characterization of data energy tradeoffs: For VLSI architectural agility in C-RAN platforms","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Datapath; Very-large-scale integration; Computer science; Computer architecture; Flexibility (engineering); Cloud computing; Adaptation (eye); Efficient energy use; Scaling; Embedded system; Distributed computing; Engineering; Operating system; Electrical engineering","score_opus":0.059922433338142275,"score_gpt":0.2930187751475127,"score_spread":0.2330963418093704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540671747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14265569,0.00001116753,0.85692424,0.00013407612,0.000017193135,0.00006477408,0.000009992472,0.00007897298,0.00010393126],"genre_scores_gemma":[0.81644464,0.000006091615,0.18328764,0.00006328508,0.000008965666,0.000004016108,0.00014297284,0.0000021605736,0.000040246458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925834,0.000020935398,0.00023140594,0.000276821,0.00010523757,0.00010725312],"domain_scores_gemma":[0.9992893,0.000053458545,0.000084963336,0.00046603262,0.00005505174,0.00005122049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040851135,0.0000692988,0.00017381695,0.00023620274,0.0000206361,0.00003927426,0.00053331524,0.000035123092,8.3036485e-7],"category_scores_gemma":[0.00003772499,0.000056046843,0.000025162251,0.00057019136,0.000024688052,0.00043346058,0.00020759316,0.00002918691,6.885194e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001849193,0.00046212177,0.078630686,0.000110784684,0.00040704978,0.0000036079707,0.0062113716,0.013977922,0.0052075614,0.0656347,0.00028487272,0.8288844],"study_design_scores_gemma":[0.00023426325,0.000043877684,0.014739115,0.000003976021,0.000011257418,0.0000013942002,0.0000072987054,0.97998565,0.002563556,0.0021978675,0.00013300484,0.000078734505],"about_ca_topic_score_codex":0.0001464965,"about_ca_topic_score_gemma":0.00011308315,"teacher_disagreement_score":0.9660077,"about_ca_system_score_codex":0.0000106186935,"about_ca_system_score_gemma":0.000029994166,"threshold_uncertainty_score":0.22855239},"labels":[],"label_agreement":null},{"id":"W1544671815","doi":"10.1109/ccece.2015.7129301","title":"A survey on object cache locality in automated memory management systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign; Atlantic Canada Opportunities Agency","keywords":"Computer science; Virtual memory; Memory management; Memory map; Garbage collection; Cache; Locality; Distributed shared memory; Uniform memory access; Shared memory; Operating system; Overlay; Programming language; Garbage","score_opus":0.05394389905670606,"score_gpt":0.29866003835419613,"score_spread":0.2447161392974901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1544671815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004225914,0.00005950001,0.9461793,0.000094204355,0.00028124158,0.00028339686,0.0000010083485,0.0028838003,0.045991644],"genre_scores_gemma":[0.9701418,0.0000040306145,0.028431132,0.00021534905,0.0000094701745,0.000014874083,0.000005990024,0.000005533848,0.0011718039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985775,0.00042437075,0.00023366966,0.00030608434,0.0002645287,0.00019388492],"domain_scores_gemma":[0.9992253,0.000068548376,0.000054123335,0.0004864021,0.000082125676,0.00008347221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019162938,0.00010528071,0.00014873104,0.00016275048,0.000029920398,0.00012398367,0.0005507569,0.000049152026,0.0000012370115],"category_scores_gemma":[0.00004604985,0.00008924403,0.000018662708,0.0005558004,0.000014250241,0.000106789055,0.00019853373,0.00007693713,0.00005554974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025784715,0.00035682903,0.007576277,0.000048543712,0.000034034747,0.00009415706,0.00062573905,0.8113349,0.0000017671581,0.022601316,0.15025875,0.007041914],"study_design_scores_gemma":[0.00027039592,0.000050202303,0.019061282,0.000026452191,6.9890655e-7,0.0000016725576,0.000021997972,0.9800619,0.000066227716,0.00010981854,0.00020724519,0.00012210653],"about_ca_topic_score_codex":0.0020717143,"about_ca_topic_score_gemma":0.00008351061,"teacher_disagreement_score":0.9659159,"about_ca_system_score_codex":0.00012094827,"about_ca_system_score_gemma":0.000044011053,"threshold_uncertainty_score":0.3639266},"labels":[],"label_agreement":null},{"id":"W1545045518","doi":"10.1109/asap.1994.331814","title":"Minimizing memory requirements in rate-optimal schedules","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministère de la Transition écologique et Solidaire","keywords":"Dataflow; Computer science; Software pipelining; Scheduling (production processes); Testbed; Computation; Compiler; Parallel computing; Job shop scheduling; Block (permutation group theory); Mathematical optimization; Algorithm; Schedule; Mathematics; Programming language; Operating system; Computer network","score_opus":0.04419028858714385,"score_gpt":0.2706454820936643,"score_spread":0.22645519350652044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545045518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018600259,0.00014118258,0.94601417,0.00065357145,0.00010827191,0.000092348404,1.09554826e-7,0.00059965823,0.033790413],"genre_scores_gemma":[0.44095802,0.00003180623,0.557428,0.00041542752,0.000017144997,0.000006313669,4.259109e-7,0.000004777242,0.0011380806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.00009046161,0.00023064968,0.0002924829,0.000137322,0.00024062407],"domain_scores_gemma":[0.9994787,0.00004820725,0.000052277996,0.00033349064,0.000036256464,0.00005106515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037845757,0.00010252671,0.000116194096,0.00017115641,0.000067014946,0.00011059849,0.0005664772,0.00004719766,0.00009972197],"category_scores_gemma":[0.000043084267,0.000097475226,0.000031805997,0.00035890282,0.000021439273,0.00041400056,0.00019322774,0.00008913079,0.00009385969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027651236,0.0015621638,0.012432465,0.00009257662,0.000081062746,0.00028483965,0.005580844,0.23404993,0.0037299017,0.35827404,0.055924352,0.32796016],"study_design_scores_gemma":[0.00027928886,0.00003277843,0.00048739536,0.000023958853,7.7759137e-7,0.0000031668326,0.00002028975,0.99260527,0.005197262,0.0005620906,0.0006232129,0.00016453661],"about_ca_topic_score_codex":0.000015088516,"about_ca_topic_score_gemma":0.0000024907406,"teacher_disagreement_score":0.7585553,"about_ca_system_score_codex":0.000032690972,"about_ca_system_score_gemma":0.00000942413,"threshold_uncertainty_score":0.39749244},"labels":[],"label_agreement":null},{"id":"W1546160363","doi":"10.5281/zenodo.38525","title":"Loop Optimization With Tradeoff Between Cycle Count And Code Size For Dsp Applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Very long instruction word; Computer science; Software pipelining; Compiler; Program optimization; Parallel computing; Digital signal processing; Code generation; Optimizing compiler; Code (set theory); Flexibility (engineering); Heuristic; Software; Instruction-level parallelism; Computer hardware; Programming language; Parallelism (grammar); Operating system","score_opus":0.01359594731624964,"score_gpt":0.25462155439151624,"score_spread":0.2410256070752666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546160363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056259753,0.000031731168,0.9957437,0.0014387993,0.000009886817,0.00049794273,0.000007591101,0.0005835774,0.0011241994],"genre_scores_gemma":[0.18221435,0.000017245191,0.8172599,0.00023851913,0.000030599844,0.000097766395,0.0000089272535,0.000008591864,0.00012410918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992813,0.000010779458,0.00015223742,0.00029076278,0.00011255195,0.00015238361],"domain_scores_gemma":[0.99939954,0.000115903895,0.00006689308,0.00025223297,0.00009728303,0.000068123016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012762593,0.00009953021,0.00011611079,0.000044645072,0.00018224178,0.00013160892,0.00027785762,0.00004809554,0.0000022244976],"category_scores_gemma":[0.000012374687,0.00008384021,0.000018772274,0.00023511497,0.000039714676,0.00022791041,0.00004618474,0.00004569346,0.0000016555492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005385409,0.00005816788,0.0004043973,0.000018454177,0.000017335873,3.578554e-7,0.00017651358,0.9196702,0.00001942776,0.0730494,0.00025110878,0.00632921],"study_design_scores_gemma":[0.0014113243,0.00027850908,0.00085912715,0.000029446996,0.00002199257,0.000013202867,0.000018764773,0.97635424,0.0026868745,0.014246908,0.0036941743,0.000385438],"about_ca_topic_score_codex":0.000011643135,"about_ca_topic_score_gemma":0.0000051953925,"teacher_disagreement_score":0.18165176,"about_ca_system_score_codex":0.000030966516,"about_ca_system_score_gemma":0.00005799403,"threshold_uncertainty_score":0.34189048},"labels":[],"label_agreement":null},{"id":"W1549249462","doi":"10.1023/a:1025713926030","title":"Using System Emulation to Model Next-Generation Shared Virtual Memory Clusters","year":2003,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Emulation; Shared memory; Distributed shared memory; Cache coherence; Distributed computing; Abstraction; Software; Cache; Leverage (statistics); Abstraction layer; Scalability; Computer architecture; Embedded system; Operating system; CPU cache; Memory management; Uniform memory access; Overlay; Cache algorithms","score_opus":0.09454530633250477,"score_gpt":0.29453342677653127,"score_spread":0.1999881204440265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549249462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06586208,0.0000295469,0.9305348,0.000100352685,0.0006510934,0.00039437614,8.4153646e-7,0.0009301772,0.0014967574],"genre_scores_gemma":[0.5607671,2.4524778e-7,0.43854144,0.0004959867,0.000100922065,0.0000031386833,0.0000044671247,0.000016718086,0.000069983595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977325,0.000286293,0.00054406445,0.0006609561,0.0003505931,0.0004255683],"domain_scores_gemma":[0.99873257,0.000077290504,0.0002158183,0.0005881889,0.00021809392,0.00016806592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078430335,0.000257462,0.00026439613,0.00029730765,0.00051693065,0.0005931914,0.00060149963,0.000117022064,0.0000020323248],"category_scores_gemma":[0.000087092536,0.00028131023,0.00008867725,0.00058026897,0.000017388871,0.00068946404,0.00036529696,0.00015441234,0.000028284283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026180746,0.000015880521,0.000028790464,0.00001565861,0.0000075955454,0.000002110992,0.0012698873,0.9877143,0.0015786698,0.005745646,0.0005270923,0.003091779],"study_design_scores_gemma":[0.00030954182,0.000040435836,0.000012957419,0.000102086575,0.0000074100103,0.000034449266,0.00008541554,0.9973329,0.0016344393,0.00007088108,0.000043217788,0.00032628115],"about_ca_topic_score_codex":0.000009229251,"about_ca_topic_score_gemma":0.0000014018331,"teacher_disagreement_score":0.49490502,"about_ca_system_score_codex":0.00029605546,"about_ca_system_score_gemma":0.00011054267,"threshold_uncertainty_score":0.9999639},"labels":[],"label_agreement":null},{"id":"W1549924005","doi":"10.1109/mwscas.2002.1187262","title":"An optimal variable voltage scheduling","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Dynamic voltage scaling; Energy consumption; Computer science; Voltage; Workload; Scheduling (production processes); Variable (mathematics); Embedded system; CPU core voltage; Real-time computing; Voltage regulation; Electrical engineering; Voltage optimisation; Engineering; Operating system","score_opus":0.014085982823070161,"score_gpt":0.2596452057470691,"score_spread":0.24555922292399895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549924005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000972582,0.00003144341,0.9378503,0.000028724358,0.00009562923,0.000047286023,1.0826064e-7,0.0009984081,0.05997553],"genre_scores_gemma":[0.23046121,0.0000027882777,0.76868784,0.000282942,0.000013660794,0.0000027663332,6.689054e-7,0.000004458644,0.00054364867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992511,0.000050972227,0.00012599849,0.00026200156,0.000113040995,0.00019686414],"domain_scores_gemma":[0.999351,0.000026163196,0.000033068587,0.00044150453,0.0000648733,0.00008334236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760904,0.00008143736,0.00008004348,0.000063803745,0.00012326952,0.00019552464,0.00050517236,0.000044740842,0.00008447749],"category_scores_gemma":[0.000041328425,0.00007564221,0.000020469004,0.00030113643,0.000011993391,0.00045869738,0.000047630707,0.00007493847,0.000030499834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3706815e-7,0.000056035453,0.00010970213,0.0000020004625,0.000003477059,0.0000025382205,0.00007837256,0.19764242,0.0007042014,0.7988513,0.0005321152,0.002017074],"study_design_scores_gemma":[0.000095606585,0.000051373623,0.000016516069,0.0000040540435,9.801682e-7,0.000010390585,0.000008779841,0.9769115,0.01207527,0.0044304193,0.0062546614,0.0001404343],"about_ca_topic_score_codex":0.0000071361055,"about_ca_topic_score_gemma":1.5852449e-7,"teacher_disagreement_score":0.7944209,"about_ca_system_score_codex":0.000013095251,"about_ca_system_score_gemma":0.00005746733,"threshold_uncertainty_score":0.30845997},"labels":[],"label_agreement":null},{"id":"W1550697281","doi":"","title":"Multi-dispatch in the Java virtual machine: design and implementation","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"","keywords":"Computer science; Java; strictfp; Programming language; Real time Java; Operating system; Programmer; Java concurrency; Economic dispatch; Virtual machine; Java annotation; Java Modeling Language; Object-oriented programming","score_opus":0.028394266745863293,"score_gpt":0.3130173592494519,"score_spread":0.2846230925035886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550697281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006108935,0.000039172413,0.9922676,0.0009129231,0.000023267059,0.00017844544,1.4150929e-7,0.0001411874,0.000328324],"genre_scores_gemma":[0.49432102,0.00005452596,0.5049089,0.0006117273,0.0000060775037,0.0000100363,0.0000012202906,0.0000019379574,0.0000845763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937546,0.00013621457,0.000120651275,0.00015537655,0.000096847136,0.000115457995],"domain_scores_gemma":[0.9996826,0.00008859639,0.000028451579,0.0001642914,0.000017250264,0.000018795698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050374866,0.00006055918,0.000050219238,0.00005943945,0.00007354646,0.000110162924,0.00032181505,0.000019425404,0.000010607352],"category_scores_gemma":[0.00000900051,0.000040950606,0.00001030499,0.00022593408,0.000011993156,0.00017651661,0.00007222574,0.000053947653,0.000004277933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003087409,0.0004649687,0.07037371,0.000010365251,0.000022728513,0.00007509007,0.016499761,0.059585694,0.00084932643,0.09933735,0.020823374,0.7319268],"study_design_scores_gemma":[0.00030681433,0.00006354772,0.011224392,0.000002345986,8.065599e-7,0.000018564282,0.00009458501,0.98690337,0.00028965637,0.0004933582,0.0005276136,0.00007493776],"about_ca_topic_score_codex":0.00018474672,"about_ca_topic_score_gemma":0.00005826519,"teacher_disagreement_score":0.9273177,"about_ca_system_score_codex":0.000009390112,"about_ca_system_score_gemma":0.000012506887,"threshold_uncertainty_score":0.16699173},"labels":[],"label_agreement":null},{"id":"W1554746777","doi":"10.1002/tee.22123","title":"An XOR‐based parameterization for instruction register files","year":2015,"lang":"en","type":"article","venue":"IEEJ Transactions on Electrical and Electronic Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Canadian Institute of Steel Construction","keywords":"Computer science; Register file; Cache; Overhead (engineering); Parallel computing; Selection (genetic algorithm); Register (sociolinguistics); Processor register; Locality; Arithmetic; Instruction set; Programming language; Computer hardware; Artificial intelligence; Mathematics; Memory address","score_opus":0.014554886058457943,"score_gpt":0.2371303446394669,"score_spread":0.22257545858100894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554746777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042522727,0.00008748478,0.9945394,0.00022932932,0.00009100246,0.0001669088,0.0000013402364,0.00060997903,0.000022273436],"genre_scores_gemma":[0.894009,0.000027689983,0.10570285,0.0001069898,0.000034253888,0.00006655933,0.000007538347,0.000013987739,0.000031120642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909025,0.000026169368,0.00015667343,0.00028796648,0.00012075348,0.00031820036],"domain_scores_gemma":[0.99952227,0.000060950115,0.000034706314,0.00019919529,0.0000650817,0.00011780221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015393112,0.00013180375,0.00012193853,0.00020168169,0.0001048988,0.000101191064,0.00017499948,0.000081640195,9.295447e-7],"category_scores_gemma":[0.000018144581,0.00013130589,0.000042373144,0.00040973537,0.000010217647,0.0002892374,0.0000016181286,0.00017205809,8.6871347e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044026066,0.00009481787,0.00000464948,0.000013103897,0.0000150290625,4.857506e-7,0.00006121003,0.91327333,0.0009077116,0.0072703767,0.00006767236,0.078247584],"study_design_scores_gemma":[0.00046843267,0.000774123,0.000021565384,0.000009288688,0.0000075100425,0.00001253707,0.0000011241865,0.9872892,0.008588461,0.0009903876,0.0016748675,0.00016250083],"about_ca_topic_score_codex":0.0000059607564,"about_ca_topic_score_gemma":0.000001358247,"teacher_disagreement_score":0.88975674,"about_ca_system_score_codex":0.00010915051,"about_ca_system_score_gemma":0.00008147975,"threshold_uncertainty_score":0.53544986},"labels":[],"label_agreement":null},{"id":"W1555019970","doi":"10.1007/978-3-540-27776-7_35","title":"Using CoDeL to Rapidly Prototype Network Processsor Extensions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Workstation; Focus (optics); Latency (audio); Computer architecture; Embedded system; Computer network; Operating system; Distributed computing; Telecommunications","score_opus":0.03361342319958882,"score_gpt":0.28830881701349464,"score_spread":0.2546953938139058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555019970","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002210438,0.0002497995,0.994198,0.0008680336,0.0009390392,0.0013655778,0.0000024063677,0.00066018023,0.0016948619],"genre_scores_gemma":[0.019326964,0.00002492288,0.976577,0.0033441025,0.00049811235,0.00002771491,0.0000025329396,0.00004721473,0.00015148016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957255,0.00003825038,0.0006450736,0.0017590489,0.0009269976,0.00090512115],"domain_scores_gemma":[0.99718225,0.00017751037,0.00032693235,0.0014331387,0.0005812101,0.00029896328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094099395,0.00059583853,0.0006004503,0.0007881622,0.0005324205,0.0006033817,0.0033845806,0.0003470708,0.000012380097],"category_scores_gemma":[0.00012063676,0.000561061,0.0001258377,0.0013468995,0.00032805873,0.00045421493,0.0016797299,0.0007457183,0.00003486977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006904713,0.000019994552,0.000008136974,0.000025086478,0.000005303683,0.000027339154,0.0002452687,0.92147267,0.00006110538,0.016295245,0.00005620755,0.061776742],"study_design_scores_gemma":[0.00015604006,0.00022405059,0.000011788853,0.0009000476,0.000006072844,0.00003966007,3.8245705e-8,0.8190021,0.00058374915,0.17763653,0.0007642217,0.0006757022],"about_ca_topic_score_codex":0.000019465138,"about_ca_topic_score_gemma":0.000016249154,"teacher_disagreement_score":0.16134128,"about_ca_system_score_codex":0.00042594707,"about_ca_system_score_gemma":0.0014702767,"threshold_uncertainty_score":0.9996841},"labels":[],"label_agreement":null},{"id":"W1555785714","doi":"10.1007/978-3-540-74309-5_20","title":"A Power-Aware Alternative for the Perceptron Branch Predictor","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Branch predictor; Computation; Perceptron; Computational complexity theory; Power (physics); Multilayer perceptron; Dissipation; Predictive power; Algorithm; Artificial intelligence; Machine learning; Artificial neural network; Parallel computing","score_opus":0.023391801836428118,"score_gpt":0.2843282487658861,"score_spread":0.26093644692945794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555785714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011720065,0.0005019583,0.9928135,0.00085549575,0.0018685465,0.0009261419,0.000012037456,0.00042228765,0.002588276],"genre_scores_gemma":[0.14608048,0.00012044211,0.8483237,0.0032826504,0.0010542453,0.0000484637,0.0000093109675,0.000068638496,0.0010120787],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964415,0.000031545555,0.00052216864,0.0013669734,0.000926417,0.00071139715],"domain_scores_gemma":[0.99637556,0.0013022019,0.00033583774,0.0013771191,0.00047218008,0.00013710467],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013891248,0.00051591115,0.00043787176,0.00061533356,0.0005097658,0.0005587747,0.0046513416,0.00030255134,0.000020811289],"category_scores_gemma":[0.000116093,0.00038195582,0.00020712492,0.00048204177,0.0006326595,0.00038222305,0.0010797287,0.00072325836,0.000014010068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025967562,0.00005022034,0.000040492007,0.00004590521,0.000044315402,0.000024669664,0.002961373,0.20961384,0.000025786918,0.043239377,0.0005687178,0.7433593],"study_design_scores_gemma":[0.00026832137,0.00027881435,0.00008246751,0.00022358896,0.0000074013633,0.00003321778,2.2922934e-7,0.9039296,0.00047083755,0.08863114,0.0055732597,0.0005010996],"about_ca_topic_score_codex":0.000017439243,"about_ca_topic_score_gemma":0.000022712868,"teacher_disagreement_score":0.74285823,"about_ca_system_score_codex":0.0002906612,"about_ca_system_score_gemma":0.0003969531,"threshold_uncertainty_score":0.9998632},"labels":[],"label_agreement":null},{"id":"W1559021664","doi":"10.1007/3-540-45009-2_7","title":"Busy-Wait Barrier Synchronization Using Distributed Counters with Local Sensor","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Synchronization (alternating current); Overhead (engineering); Fetch; Benchmark (surveying); Cache; Parallel computing; CPU cache; Reduction (mathematics); Embedded system; Implementation; Distributed computing; Operating system; Computer network","score_opus":0.01179537747796493,"score_gpt":0.2329380179915319,"score_spread":0.22114264051356697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559021664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000552962,0.00019996362,0.9974331,0.00023050682,0.00061983545,0.0003867572,0.000012923712,0.0004242471,0.00063736574],"genre_scores_gemma":[0.117316246,0.00002863783,0.88072264,0.0015668435,0.00015494814,0.000004885787,0.000024598154,0.000055380217,0.00012580432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617845,0.0000668496,0.00052803394,0.0015173367,0.0010113571,0.0006979707],"domain_scores_gemma":[0.99747294,0.00019506631,0.00038626615,0.0011897527,0.0005486959,0.00020727885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005995145,0.0006172634,0.0005419405,0.00067101006,0.00040319996,0.00065972004,0.0018866599,0.00035308985,0.000013284795],"category_scores_gemma":[0.000056618945,0.0005468525,0.00009114368,0.0009985475,0.0008684185,0.0005866216,0.00052144396,0.0006436835,0.000008347726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068285917,0.000019181574,0.00007564581,0.000026466509,0.000014723082,0.00007990467,0.0001778365,0.93545604,0.000021020029,0.0027517756,0.000047056976,0.061323542],"study_design_scores_gemma":[0.0002641398,0.00014685586,0.000011514743,0.0004251754,0.000012749956,0.00019701618,3.8352113e-7,0.9903787,0.00080528914,0.0062067965,0.00083261664,0.0007188121],"about_ca_topic_score_codex":0.000027229262,"about_ca_topic_score_gemma":0.00001958257,"teacher_disagreement_score":0.11726095,"about_ca_system_score_codex":0.00074795075,"about_ca_system_score_gemma":0.0007247794,"threshold_uncertainty_score":0.9996983},"labels":[],"label_agreement":null},{"id":"W1559991472","doi":"10.1007/11407522_16","title":"LOMARC — Lookahead Matchmaking for Multi-resource Coscheduling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Workload; Schedule; Distributed computing; Context switch; Queue; Gang scheduling; Operating system; Computer network; Dynamic priority scheduling; Rate-monotonic scheduling; Mathematical optimization","score_opus":0.033239715042144825,"score_gpt":0.29211456991881357,"score_spread":0.2588748548766687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559991472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009881016,0.00069324765,0.99429315,0.0006817769,0.0007162349,0.0007073524,0.000005152202,0.0007632323,0.0021299815],"genre_scores_gemma":[0.008905432,0.00003177059,0.98749316,0.002043552,0.0006369153,0.000022886099,0.000008890904,0.000058379617,0.00079899025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958337,0.000037250666,0.0007134682,0.0017788942,0.0007563463,0.00088032073],"domain_scores_gemma":[0.9971127,0.0005569511,0.00044558116,0.0013599762,0.00033049312,0.0001942966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012405852,0.00063603587,0.0006374037,0.0009142938,0.00046742742,0.0007511951,0.0037960343,0.0004182232,0.000009144127],"category_scores_gemma":[0.00013562506,0.00063525414,0.00022220687,0.0004959064,0.00042179393,0.00048445535,0.0013207962,0.00073887134,0.000023584696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065484546,0.000039139857,0.000014119037,0.00005000949,0.0000116066885,0.000018253244,0.0005118766,0.34356263,0.000044612818,0.016909102,0.0000785167,0.6387536],"study_design_scores_gemma":[0.00038224296,0.00010719393,0.000011412756,0.00047437052,0.000007215269,0.000044002656,1.0915866e-7,0.96592796,0.0011380143,0.019885767,0.011294511,0.0007272016],"about_ca_topic_score_codex":0.000007959113,"about_ca_topic_score_gemma":0.000021994858,"teacher_disagreement_score":0.63802636,"about_ca_system_score_codex":0.0003565946,"about_ca_system_score_gemma":0.0004175655,"threshold_uncertainty_score":0.9996099},"labels":[],"label_agreement":null},{"id":"W1561287486","doi":"10.11606/d.55.2008.tde-26082008-145416","title":"Políticas de escalonamento memory-intensive para aplicações distribuídas","year":2008,"lang":"pt","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Operating system","score_opus":0.0279589889046549,"score_gpt":0.31228528940599953,"score_spread":0.2843263005013446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561287486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006225028,0.0007206331,0.9774339,0.0014869529,0.00069731334,0.0007308201,0.000026554604,0.0013949715,0.011283777],"genre_scores_gemma":[0.71670204,0.0021761663,0.17353582,0.0049874284,0.00044138095,0.00023244134,0.0017939783,0.00018806563,0.09994268],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951913,0.00029465076,0.0010386407,0.0015048841,0.00084079977,0.0011297195],"domain_scores_gemma":[0.99560624,0.00031511308,0.0006554202,0.001346649,0.0015580202,0.00051855174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003823019,0.00089281163,0.0009305266,0.0003907277,0.0007250122,0.00053699745,0.0020178675,0.0007356171,0.00014880796],"category_scores_gemma":[0.00043322274,0.00089010136,0.0004781107,0.00087775005,0.00017384636,0.00034985723,0.00036807684,0.00078554277,0.00032072535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094942533,0.0034372676,0.0036804874,0.0014487783,0.0020796272,0.0023348164,0.08023212,0.03884818,0.0029852092,0.086335726,0.5947084,0.18295996],"study_design_scores_gemma":[0.0010183426,0.0005947082,0.0029956663,0.000659332,0.00016418278,0.000453884,0.002421544,0.9557177,0.026177179,0.0016719279,0.005647217,0.0024783274],"about_ca_topic_score_codex":0.0006520336,"about_ca_topic_score_gemma":0.00003914169,"teacher_disagreement_score":0.9168695,"about_ca_system_score_codex":0.00035673642,"about_ca_system_score_gemma":0.00068789796,"threshold_uncertainty_score":0.99935496},"labels":[],"label_agreement":null},{"id":"W1566904115","doi":"10.1007/3-540-46423-9_8","title":"Simple Generation of Static Single-Assignment Form","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Simple (philosophy); Compiler; Compile time; Simplicity; Control flow graph; Algorithm; Control flow; Data-flow analysis; Data flow diagram; Parallel computing; Theoretical computer science; Programming language","score_opus":0.031647111147874996,"score_gpt":0.25784048052322434,"score_spread":0.22619336937534934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566904115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009658833,0.00015457156,0.9946188,0.00018150959,0.0003865319,0.0003112619,0.0000041047515,0.0002034764,0.0040431856],"genre_scores_gemma":[0.2796907,0.00006757653,0.71917254,0.00067406875,0.00019292612,0.0000066132775,0.000014712173,0.000024182702,0.0001566769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715394,0.00003369812,0.0006375997,0.000935885,0.00081956846,0.0004192826],"domain_scores_gemma":[0.9981297,0.0001911365,0.0003702927,0.0010113121,0.00019468166,0.000102876926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005430694,0.0003644896,0.00043805616,0.0006544227,0.00015852752,0.0002658285,0.0018807839,0.00020186053,0.00003393353],"category_scores_gemma":[0.00003369688,0.00034469253,0.000100770776,0.00043671217,0.0003051604,0.00041060988,0.00049787626,0.00031641094,0.000011050857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026604039,0.000047396556,0.000009530414,0.000022301465,0.0000072343605,0.000011494176,0.00047746938,0.34315264,0.00044205502,0.009466336,0.00010283077,0.64625806],"study_design_scores_gemma":[0.0001330368,0.0002492013,0.000010369695,0.00013204914,0.0000044196554,0.000012794005,4.0433992e-8,0.8399098,0.010113702,0.14820988,0.00087723,0.0003474861],"about_ca_topic_score_codex":0.000017846802,"about_ca_topic_score_gemma":0.000018279301,"teacher_disagreement_score":0.64591056,"about_ca_system_score_codex":0.00026501168,"about_ca_system_score_gemma":0.00032101356,"threshold_uncertainty_score":0.9999005},"labels":[],"label_agreement":null},{"id":"W1567114901","doi":"10.1007/978-3-540-77704-5_47","title":"Reducing Energy in Instruction Caches by Using Multiple Line Buffers with Prediction","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Queen's University","funders":"","keywords":"Cache; Computer science; Cache algorithms; Cache pollution; Smart Cache; Cache coloring; Cache invalidation; Page cache; MESI protocol; CPU cache; Parallel computing; Energy consumption; Embedded system; Engineering","score_opus":0.018008657117691205,"score_gpt":0.2263887488838319,"score_spread":0.2083800917661407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567114901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001482899,0.0003731805,0.99658614,0.000109195156,0.00051428494,0.00019800241,0.000004309109,0.00035056646,0.0003814362],"genre_scores_gemma":[0.38128993,0.00017208926,0.617998,0.00021761384,0.00019722334,0.0000058687724,0.000013803917,0.000030068308,0.00007540838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969867,0.00004929256,0.0005206268,0.0012956723,0.00066649105,0.00048123373],"domain_scores_gemma":[0.9985027,0.00016435937,0.00032607568,0.00071539654,0.00018314143,0.00010832863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038501978,0.00043817604,0.0004203409,0.0010399838,0.00028302902,0.00022981165,0.0012431646,0.00031436986,0.000001681551],"category_scores_gemma":[0.000038232032,0.00040868018,0.00005832936,0.0008629128,0.00042804942,0.00067479734,0.00043436757,0.000582755,8.586774e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066093,0.000022651207,0.0002220638,0.000010685462,0.0000051344155,0.000024357254,0.00042767945,0.7458152,0.00016429143,0.00017637837,0.00003130196,0.2530912],"study_design_scores_gemma":[0.00037234844,0.00017757298,0.000042913045,0.0004473407,0.0000034506197,0.00018426908,1.8108184e-7,0.9923289,0.0039831204,0.0016318506,0.00040249716,0.00042557795],"about_ca_topic_score_codex":0.00049975386,"about_ca_topic_score_gemma":0.00012600559,"teacher_disagreement_score":0.37980703,"about_ca_system_score_codex":0.0005334353,"about_ca_system_score_gemma":0.000412577,"threshold_uncertainty_score":0.9998365},"labels":[],"label_agreement":null},{"id":"W1568931959","doi":"10.1007/978-3-642-11970-5_4","title":"Optimizing Matlab through Just-In-Time Specialization","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Compiler; Interpreter; Octave (electronics); Just-in-time compilation; Implementation; Key (lock); Programming language; Computer engineering; Operating system","score_opus":0.019961239747998134,"score_gpt":0.26419405974444704,"score_spread":0.2442328199964489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568931959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032291457,0.00019871544,0.98335165,0.00054077414,0.0013706847,0.00041922808,0.0000020382197,0.00055705226,0.01352756],"genre_scores_gemma":[0.0062333653,0.00010745814,0.991032,0.0013795571,0.0005441636,0.000007868577,0.00001081751,0.000046410947,0.0006383691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958419,0.0000522984,0.00073034666,0.0016231013,0.0010319514,0.0007203807],"domain_scores_gemma":[0.9974939,0.0002962304,0.00039429113,0.0014353929,0.0002589843,0.00012120387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010325662,0.00057496486,0.0006203789,0.0009897763,0.00028850118,0.0009305377,0.0041937274,0.0005918744,0.00005909391],"category_scores_gemma":[0.00010781705,0.0005778437,0.0001229794,0.0010254484,0.00047949425,0.0009441974,0.001538876,0.0011957545,0.00008788273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015887254,0.00014200865,0.00010877701,0.00008612109,0.000016902515,0.00025554118,0.0048990976,0.65697086,0.0008875876,0.07949153,0.00019827834,0.2569274],"study_design_scores_gemma":[0.0002998341,0.0000906632,0.000037129128,0.00046922907,0.000005261889,0.000055021883,1.0054008e-7,0.84731126,0.0043949606,0.14281909,0.0036360158,0.0008814241],"about_ca_topic_score_codex":0.000028121269,"about_ca_topic_score_gemma":0.00003983315,"teacher_disagreement_score":0.25604597,"about_ca_system_score_codex":0.0003063743,"about_ca_system_score_gemma":0.0004357299,"threshold_uncertainty_score":0.9996673},"labels":[],"label_agreement":null},{"id":"W1575688676","doi":"10.1109/icppw.2004.8","title":"A data identi .cation scheme for automatic relative debugging","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Debugging; Computer science; Scheme (mathematics); Code (set theory); Algorithmic program debugging; Programming language; Identification (biology); Parallel computing; Mathematics","score_opus":0.08693031224175103,"score_gpt":0.3385768329552807,"score_spread":0.25164652071352966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575688676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063547073,0.000049522063,0.9762646,0.0081277555,0.00017935177,0.00037034944,0.000008071167,0.00033394172,0.008311682],"genre_scores_gemma":[0.6115233,0.0000086200025,0.38805324,0.00018864879,0.00003507512,0.000031561263,0.00000706685,0.000008467307,0.0001440721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844867,0.0000058132205,0.00040011335,0.00046189083,0.0004947058,0.00018881907],"domain_scores_gemma":[0.99817055,0.000043553086,0.00060180016,0.00027452773,0.00086995563,0.00003962457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005101283,0.00015959378,0.00016351652,0.00014879892,0.00024154455,0.0004019504,0.003521841,0.00006219529,0.0000039594115],"category_scores_gemma":[0.00044437856,0.00012783681,0.000061400184,0.00028602287,0.00006855254,0.0018163573,0.00066438,0.00016056212,0.000003912657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030351877,0.00016148537,0.00034614655,0.00014853314,0.000073924224,2.6758806e-7,0.0010189159,0.0028915473,0.005764115,0.9747513,0.00090435176,0.013909082],"study_design_scores_gemma":[0.0004308451,0.00004317337,0.00026588616,0.00060366286,0.000010546697,0.000008058552,0.000053034295,0.82217914,0.0043440545,0.17174579,0.00016123813,0.0001545572],"about_ca_topic_score_codex":0.0000075886715,"about_ca_topic_score_gemma":0.0000015142709,"teacher_disagreement_score":0.8192876,"about_ca_system_score_codex":0.0001044443,"about_ca_system_score_gemma":0.0002493147,"threshold_uncertainty_score":0.65445155},"labels":[],"label_agreement":null},{"id":"W157886190","doi":"","title":"Communication Characteristics of Message-Passing Scientific and Engineering Applications.","year":2005,"lang":"en","type":"article","venue":"IASTED PDCS","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Message passing; Computer science; Suite; Benchmark (surveying); Payload (computing); Distributed computing; Point-to-point; Message broker; Message Passing Interface; Communications system; Computer network","score_opus":0.011606274004377805,"score_gpt":0.2386618171016495,"score_spread":0.2270555430972717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157886190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018635739,0.00025046966,0.9800257,0.00036280716,0.000029050416,0.000096779055,0.000001437165,0.00023036254,0.00036764605],"genre_scores_gemma":[0.6471707,0.000023119337,0.35269424,0.000035987676,0.000012635807,0.000008275567,0.0000055258297,0.0000035668063,0.000045914898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944663,0.000024030875,0.00018866503,0.00014802047,0.000102205784,0.0000904429],"domain_scores_gemma":[0.99926287,0.000057494402,0.0001070868,0.00043817013,0.000100785,0.00003357665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023997451,0.000060961804,0.0000890785,0.00011115971,0.00012410697,0.00014484914,0.0003659443,0.000034216442,0.0000018037971],"category_scores_gemma":[0.000022116663,0.00006523413,0.0000147749815,0.00030456626,0.00004833047,0.00021172382,0.0001496283,0.000068488596,0.0000028768418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005088258,0.0002790915,0.0014827178,0.0001630886,0.000039513856,0.0000010048551,0.0040107584,0.015185089,0.017782979,0.11245765,0.0024174696,0.84617555],"study_design_scores_gemma":[0.00013957315,0.000012858479,0.005971448,0.00007112978,0.000005770652,0.000008502266,0.000009905429,0.9585119,0.007208934,0.00025640274,0.027648037,0.00015553602],"about_ca_topic_score_codex":0.0000021952128,"about_ca_topic_score_gemma":4.869654e-7,"teacher_disagreement_score":0.94332683,"about_ca_system_score_codex":0.000014995231,"about_ca_system_score_gemma":0.000018759907,"threshold_uncertainty_score":0.26601708},"labels":[],"label_agreement":null},{"id":"W1580752477","doi":"","title":"Tunable Instruction Set Extension Identification","year":2011,"lang":"en","type":"article","venue":"uO Research (University of Ottawa)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Speedup; Computer science; Compiler; Instruction set; Set (abstract data type); Extension (predicate logic); Design space exploration; State (computer science); Identification (biology); Constraint (computer-aided design); Parallel computing; Programming language; State space; Theoretical computer science; Algorithm; Embedded system; Mathematics","score_opus":0.11130325972816531,"score_gpt":0.3049454913027419,"score_spread":0.1936422315745766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580752477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06541904,0.0000104752735,0.9078751,0.0002517079,0.00008686214,0.00014541467,0.0000015523417,0.00024259988,0.025967253],"genre_scores_gemma":[0.85126686,0.00005352801,0.14625306,0.000007075254,0.000010089341,2.5881883e-7,0.000004652346,0.0000037598832,0.002400683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887615,0.00017471628,0.000096335716,0.00027513527,0.00038210428,0.00019556184],"domain_scores_gemma":[0.9988493,0.000035170666,0.00008226776,0.00047433577,0.00048797467,0.000070979986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002492,0.000052078354,0.00008499738,0.00042606148,0.0003749871,0.000031385363,0.00085714733,0.00006213686,0.000054846092],"category_scores_gemma":[0.000055765955,0.00006373075,0.000038367303,0.0007380548,0.0001346269,0.0006294194,0.00032555158,0.00015385264,0.00006596366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022557919,0.00045462963,0.018218916,0.00012604098,0.00005863373,0.000088760855,0.010500854,0.00073114387,0.012215879,0.7831268,0.0475463,0.12690951],"study_design_scores_gemma":[0.0015727554,0.0006867535,0.3238967,0.00012399597,0.000014988868,0.00005098525,0.0022838796,0.51854855,0.05412862,0.054014035,0.044033248,0.0006454655],"about_ca_topic_score_codex":0.00018519531,"about_ca_topic_score_gemma":0.000021692673,"teacher_disagreement_score":0.78584784,"about_ca_system_score_codex":0.000049751947,"about_ca_system_score_gemma":0.000057487017,"threshold_uncertainty_score":0.28841355},"labels":[],"label_agreement":null},{"id":"W1581970913","doi":"10.1109/pact.1996.554031","title":"Using the parallel complexity of programs to improve compaction","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Compaction; Computer science; Very long instruction word; Function (biology); Position (finance); Parallel computing; Process (computing); Algorithm; Programming language; Engineering","score_opus":0.13915137149513407,"score_gpt":0.31845856782939375,"score_spread":0.17930719633425968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581970913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035663156,0.000019481606,0.9900442,0.0009619793,0.000091067246,0.0002501362,2.8650538e-7,0.00031805458,0.0047484874],"genre_scores_gemma":[0.4846077,0.0000017661313,0.51506877,0.00017833925,0.000013938767,0.0000034279115,2.6036003e-7,0.0000023947575,0.00012341044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926347,0.000053150052,0.00018467497,0.00017798052,0.00016508604,0.00015566676],"domain_scores_gemma":[0.9993353,0.00002396806,0.00008481486,0.00040965975,0.00009583991,0.00005043678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017182069,0.000078767065,0.00011018249,0.000050289163,0.00012136049,0.00007978069,0.00053873565,0.000026215204,0.000016919774],"category_scores_gemma":[0.000012232414,0.000053277243,0.00004550885,0.00036396895,0.0000654479,0.00013856059,0.00015256388,0.00006415442,0.000010041718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020207417,0.00093694986,0.0021878837,0.00005264072,0.000080076825,0.0000033982883,0.004536948,0.15101625,0.006313097,0.5787986,0.013992318,0.24206161],"study_design_scores_gemma":[0.00008178843,0.00008145907,0.00022448001,0.000008671815,0.0000019291194,0.000004862816,0.000014522712,0.9942804,0.0022401698,0.002335185,0.0006460287,0.000080503174],"about_ca_topic_score_codex":0.00012866818,"about_ca_topic_score_gemma":0.0000057327993,"teacher_disagreement_score":0.84326416,"about_ca_system_score_codex":0.000021992113,"about_ca_system_score_gemma":0.0000073063843,"threshold_uncertainty_score":0.21725829},"labels":[],"label_agreement":null},{"id":"W1582191410","doi":"10.1002/9780470932025.ch8","title":"Nonserial–Parallel Algorithms","year":2011,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Parallel algorithm; Algorithm; Parallel computing; Analysis of parallel algorithms","score_opus":0.02269845453596123,"score_gpt":0.25274356309187807,"score_spread":0.23004510855591684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582191410","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.0151074e-9,0.00022672511,0.5054874,0.000037732312,0.0003177119,0.00008697679,0.0000010057721,0.002485744,0.4913567],"genre_scores_gemma":[0.000001340414,0.0001031338,0.49361664,0.00013892273,0.00011719596,0.000008830889,0.0000036041592,0.000089878275,0.50592047],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893135,0.000046364366,0.00017412417,0.00045400855,0.00015884987,0.00023529347],"domain_scores_gemma":[0.998894,0.000013226224,0.00015125406,0.0008294238,0.0000295334,0.000082574574],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011189388,0.00023579484,0.00024797764,0.0002609163,0.000037922284,0.00009029968,0.0013716983,0.00025314797,0.002273453],"category_scores_gemma":[0.000008263484,0.00020669705,0.00007788326,0.00019042952,0.000032093234,0.000064688145,0.00032981357,0.00012602429,0.0011180651],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6835794e-7,0.000021253287,0.0000015151285,0.0000055988785,0.000014987838,0.0000052996575,0.00002345194,0.0000088670795,4.8188684e-7,0.04220556,0.9513727,0.006339807],"study_design_scores_gemma":[0.0001263611,0.00003299626,0.0000035220849,0.00004308022,0.0000038606,0.000008539033,5.7718853e-7,0.014272822,0.00003835451,0.001666785,0.98345196,0.0003511479],"about_ca_topic_score_codex":0.00028568736,"about_ca_topic_score_gemma":0.000013627023,"teacher_disagreement_score":0.040538777,"about_ca_system_score_codex":0.0000126436935,"about_ca_system_score_gemma":0.000058966245,"threshold_uncertainty_score":0.99965966},"labels":[],"label_agreement":null},{"id":"W1582485370","doi":"10.1007/11532378_25","title":"Experiments with Auto-Parallelizing SPEC2000FP Benchmarks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Parallel computing; Scalability; Thread (computing); Fortran; IBM; Software; Multi-core processor; Optimizing compiler; Programming language; Automatic parallelization; Simple (philosophy); Operating system","score_opus":0.016209437256597296,"score_gpt":0.25819420733706244,"score_spread":0.24198477008046515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582485370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025889582,0.0006568985,0.97089624,0.0005193865,0.0005769818,0.00039152175,0.0000019191314,0.0005559682,0.026375163],"genre_scores_gemma":[0.03586603,0.00008987442,0.9611625,0.0013350226,0.00049730105,0.000013182872,0.000013183837,0.000046103247,0.0009768148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553525,0.000038533308,0.00060122757,0.0018236759,0.0011671302,0.0008341747],"domain_scores_gemma":[0.99730736,0.00019236,0.0003864017,0.0016339871,0.0002501411,0.00022977519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063358224,0.000701098,0.00062573625,0.0009340517,0.00035903708,0.0007527051,0.0037802719,0.00033926492,0.00008431724],"category_scores_gemma":[0.000028339698,0.0006087771,0.000118932316,0.00064301974,0.0005393644,0.0007607084,0.0012496012,0.00084535213,0.000039292998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016951482,0.000095232754,0.00010483264,0.000032530403,0.00003392036,0.00025345036,0.0016095433,0.40656954,0.00008977322,0.029636566,0.00042891264,0.56112874],"study_design_scores_gemma":[0.00042603537,0.00032180035,0.000054122298,0.0006218777,0.000008344257,0.00017256694,2.1545561e-7,0.96249497,0.002605574,0.021843916,0.010212881,0.0012376872],"about_ca_topic_score_codex":0.000015987267,"about_ca_topic_score_gemma":0.000019648143,"teacher_disagreement_score":0.55989105,"about_ca_system_score_codex":0.0004219537,"about_ca_system_score_gemma":0.000573213,"threshold_uncertainty_score":0.99963635},"labels":[],"label_agreement":null},{"id":"W1583055368","doi":"10.1007/978-3-540-24644-2_26","title":"To Inline or Not to Inline? Enhanced Inlining Decisions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Institute of Computing Technology, Chinese Academy of Sciences","keywords":"Heuristics; Computer science; Compiler; Suite; Adaptation (eye); Parallel computing; Speedup; Programming language; Operating system","score_opus":0.033876834559299136,"score_gpt":0.3127567003453888,"score_spread":0.2788798657860897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583055368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029436857,0.000048659298,0.9929357,0.002618228,0.0014623808,0.0007717571,0.000009114013,0.00075937517,0.001100375],"genre_scores_gemma":[0.10520245,0.000034630048,0.8832785,0.010424539,0.00047275613,0.00001963517,0.0000063357047,0.00005009188,0.00051106466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99431294,0.000044624565,0.0010117997,0.002323001,0.0013533635,0.00095429027],"domain_scores_gemma":[0.99545234,0.0009677005,0.00031755667,0.0020650148,0.0006296252,0.0005677548],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001168921,0.0007588897,0.00082749024,0.002044904,0.0004242495,0.0007638275,0.005539693,0.00041643172,0.00002245785],"category_scores_gemma":[0.0010805669,0.0006491998,0.0001555159,0.002222228,0.0002437531,0.0004691032,0.00354141,0.000947363,0.00016911072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003021045,0.000036204765,0.0000025645652,0.000009393714,0.000006519651,0.00005582309,0.0012195681,0.56964684,0.00022813847,0.008700563,0.00006261975,0.42000157],"study_design_scores_gemma":[0.0007840079,0.0014294568,0.00014625829,0.0032680552,0.000013637462,0.000089744695,6.448646e-7,0.8856374,0.017046724,0.08473204,0.004434164,0.0024178957],"about_ca_topic_score_codex":0.000026419893,"about_ca_topic_score_gemma":0.0001020342,"teacher_disagreement_score":0.41758367,"about_ca_system_score_codex":0.00055850757,"about_ca_system_score_gemma":0.0014018216,"threshold_uncertainty_score":0.9998408},"labels":[],"label_agreement":null},{"id":"W1583304127","doi":"","title":"Proceedings of the 36th international symposium on Symbolic and algebraic computation","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Symbolic computation; Computer science; Algebra over a field; Symbolic-numeric computation; Software; Algebraic number; Mathematical software; Field (mathematics); Quantifier elimination; Differential algebraic geometry; Computation; Theoretical computer science; Mathematics; Ordinary differential equation; Programming language; Differential equation; Pure mathematics; Differential algebraic equation","score_opus":0.017347307514902873,"score_gpt":0.2320558177809985,"score_spread":0.21470851026609564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583304127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16070351,0.000009936171,0.65069133,0.0012754399,0.00031646635,0.00021410377,5.56837e-7,0.00040081312,0.1863878],"genre_scores_gemma":[0.93175286,0.0000068444324,0.06771081,0.00028459702,0.000012293765,0.000002813395,2.2725057e-7,0.0000028208829,0.00022673447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952406,0.0000073557667,0.00012009141,0.0001480724,0.0001353071,0.00006514352],"domain_scores_gemma":[0.9996987,0.00001656821,0.00008352697,0.0000747298,0.00010575167,0.000020719292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010699062,0.000056921468,0.000057895777,0.000046785466,0.000048052316,0.000039889735,0.00041846422,0.000024420406,0.000004144786],"category_scores_gemma":[0.000011027751,0.00003858985,0.000021472842,0.00014227301,0.000034173318,0.00015011936,0.00016710196,0.000046553338,0.0000021139285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008689463,0.00011964359,0.009482527,0.000014370111,0.000021991169,2.8695308e-7,0.0030846535,0.0003337208,0.0010488108,0.9736588,0.0024433557,0.00978315],"study_design_scores_gemma":[0.0005931458,0.00032881848,0.12440234,0.00013454072,0.000009968222,0.000036258996,0.00007347887,0.7302357,0.09389054,0.049295023,0.0006390961,0.0003610822],"about_ca_topic_score_codex":0.000013271952,"about_ca_topic_score_gemma":4.138125e-7,"teacher_disagreement_score":0.9243638,"about_ca_system_score_codex":0.000008732695,"about_ca_system_score_gemma":0.0000081586295,"threshold_uncertainty_score":0.15736483},"labels":[],"label_agreement":null},{"id":"W1585142088","doi":"10.1109/hpcsim.2015.7237068","title":"A Reduced Complexity Instruction Set architecture for low cost embedded processors","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Reduced instruction set computing; Digital signal processing; Instruction set; Benchmark (surveying); Embedded system; Very long instruction word; Microarchitecture; Efficient energy use; Computer architecture; Energy consumption; Parallel computing; Computer hardware; Engineering","score_opus":0.07326702617097079,"score_gpt":0.31880268264384287,"score_spread":0.24553565647287207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585142088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010025318,0.000007775916,0.98438776,0.0009478584,0.00020516186,0.0004828877,0.000003692559,0.0010554261,0.0028840983],"genre_scores_gemma":[0.3060435,9.288213e-7,0.6931834,0.00033374035,0.00006337736,0.0000566233,0.00001808531,0.000007855972,0.00029246692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.0000470312,0.00019153676,0.00032291928,0.0001825822,0.00021481265],"domain_scores_gemma":[0.99913883,0.000032987205,0.00009726535,0.00032618004,0.0002743153,0.00013039213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027930125,0.00012341388,0.00014587159,0.00010454975,0.000114764356,0.00013584312,0.00053064845,0.000065782784,0.0000030593364],"category_scores_gemma":[0.00011493988,0.000106342464,0.000046118796,0.00033943713,0.000048618836,0.0002101791,0.000116680756,0.000095211864,0.000006807997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033727358,0.00048286645,0.00033716823,0.0002836398,0.00009417235,0.0000073361152,0.015392492,0.20508547,0.0009048841,0.2392896,0.20030788,0.3374772],"study_design_scores_gemma":[0.0010441261,0.00014550507,0.0000758113,0.000025477375,0.0000035449127,0.00003987001,0.00006352594,0.9157414,0.015043848,0.061846904,0.0056872927,0.00028269502],"about_ca_topic_score_codex":0.000015469546,"about_ca_topic_score_gemma":0.000008671192,"teacher_disagreement_score":0.7106559,"about_ca_system_score_codex":0.000045457007,"about_ca_system_score_gemma":0.00012632809,"threshold_uncertainty_score":0.43365198},"labels":[],"label_agreement":null},{"id":"W1586569732","doi":"","title":"A Modular and Extensible JVM Infrastructure","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operating system; Modular design; Scalability; Java; Workstation; Embedded system","score_opus":0.01155838321062375,"score_gpt":0.2119228987506567,"score_spread":0.20036451554003296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586569732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021687893,0.00020411806,0.9805288,0.0006652486,0.000039827763,0.00004051167,1.000405e-7,0.0005372187,0.015815413],"genre_scores_gemma":[0.37991458,0.00006751935,0.6177956,0.00091467606,0.000015387192,0.0000014547511,1.6351494e-7,0.0000028765744,0.0012877361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995431,0.000015097041,0.000074660195,0.0001810568,0.00007837504,0.00010775595],"domain_scores_gemma":[0.99962914,0.000012962613,0.000020452473,0.00023902598,0.00003431921,0.000064083135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049095273,0.00006143884,0.000064818574,0.000054336328,0.00006673767,0.00009653796,0.0002198977,0.000033580927,0.000047111676],"category_scores_gemma":[0.000017448763,0.00005122966,0.000013660632,0.00015843354,0.000017691957,0.00017307549,0.00013300501,0.0000521087,0.000014221105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016055259,0.000072693445,0.0016045152,0.000020975724,0.000023813616,0.000032314085,0.0012687539,0.03439409,0.0010953043,0.3312989,0.21677516,0.4134119],"study_design_scores_gemma":[0.000069964386,0.000020228495,0.0005451857,0.0000032103083,6.3775775e-7,0.000024572348,0.000002056956,0.9849628,0.00047866197,0.0070172646,0.0067976094,0.000077787096],"about_ca_topic_score_codex":0.0000041504513,"about_ca_topic_score_gemma":1.939632e-7,"teacher_disagreement_score":0.95056874,"about_ca_system_score_codex":0.0000052050045,"about_ca_system_score_gemma":0.0000041932803,"threshold_uncertainty_score":0.2089085},"labels":[],"label_agreement":null},{"id":"W1586644070","doi":"10.1007/bfb0038676","title":"Loop storage optimization for dataflow machines","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dataflow; Dataflow architecture; Computer science; Parallel computing; Computation; Exploit; FIFO (computing and electronics); Graph; Loop (graph theory); FIFO and LIFO accounting; Data flow diagram; Queue; Model of computation; Overhead (engineering); Algorithm; Theoretical computer science; Programming language; Mathematics","score_opus":0.015998272213382656,"score_gpt":0.256564949369787,"score_spread":0.24056667715640437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586644070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036019428,0.0003478287,0.99419063,0.0004409193,0.0011916019,0.00064803154,0.000020995501,0.0006373258,0.0025190373],"genre_scores_gemma":[0.0023314373,0.000034752768,0.9951713,0.0007650892,0.0004630799,0.000020242775,0.00008558606,0.000046710895,0.0010817744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965929,0.000032499625,0.00058009237,0.0015469015,0.0006642676,0.00058333593],"domain_scores_gemma":[0.997319,0.00038634063,0.0003820313,0.0014106053,0.00038569546,0.000116336065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083604845,0.0005383348,0.0005084238,0.0008968185,0.00036427545,0.0007252431,0.0033119041,0.0003323956,0.000013958165],"category_scores_gemma":[0.000099459794,0.0005176706,0.00014334681,0.0005608752,0.00032088062,0.00068892067,0.0009693698,0.00043894554,0.000008469283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030208216,0.000018829913,0.0000066066705,0.000026829754,0.000004154009,0.000008880517,0.000044825803,0.843696,0.0000066783296,0.004758413,0.0005345213,0.15089124],"study_design_scores_gemma":[0.0002336672,0.00011179543,0.0000068206477,0.00016308628,0.000006675051,0.000019888956,1.242456e-8,0.96404827,0.00025032373,0.032762073,0.0018286374,0.00056876324],"about_ca_topic_score_codex":0.000023236445,"about_ca_topic_score_gemma":0.000016434027,"teacher_disagreement_score":0.15032248,"about_ca_system_score_codex":0.00022745253,"about_ca_system_score_gemma":0.00037009188,"threshold_uncertainty_score":0.9997275},"labels":[],"label_agreement":null},{"id":"W1586645253","doi":"10.1007/978-3-540-89740-8_15","title":"P-OPT: Program-Directed Optimal Cache Management","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Cache; Parallel computing; Operating system","score_opus":0.017494910414269694,"score_gpt":0.25765740619138233,"score_spread":0.24016249577711263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586645253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017394705,0.0005576966,0.9754933,0.0003530857,0.0008724424,0.00084753375,0.0000020859816,0.0025849272,0.019271497],"genre_scores_gemma":[0.0074472465,0.00037293936,0.98974603,0.000686529,0.0002384517,0.000039627685,0.000010373065,0.000044815803,0.0014140113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953949,0.00005089488,0.00063202274,0.0019026134,0.0011529083,0.00086670154],"domain_scores_gemma":[0.99726653,0.00017539205,0.00033411483,0.0017116654,0.0002971566,0.00021514506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062917406,0.0006724756,0.00058474956,0.0011295202,0.00042214658,0.00057791604,0.004282808,0.00036371654,0.00001452932],"category_scores_gemma":[0.000034018216,0.0006436879,0.0001796042,0.0010601616,0.0006497685,0.00044949463,0.002077932,0.0008256785,0.000054180866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004554524,0.0000742345,0.00001045669,0.000032853473,0.000022351716,0.00028222048,0.0004160914,0.13435568,0.0000034484851,0.0048423368,0.0006280052,0.8593278],"study_design_scores_gemma":[0.00028346284,0.00023526615,0.000083963576,0.00031585936,0.0000095219275,0.00016569092,7.172333e-8,0.97369146,0.0004527027,0.008674387,0.015181101,0.00090651604],"about_ca_topic_score_codex":0.000012860233,"about_ca_topic_score_gemma":0.0000064965016,"teacher_disagreement_score":0.85842127,"about_ca_system_score_codex":0.00033051838,"about_ca_system_score_gemma":0.00031201128,"threshold_uncertainty_score":0.9996014},"labels":[],"label_agreement":null},{"id":"W1589200278","doi":"10.22215/etd/2010-08701","title":"Practical parallel external memory algorithms via simulation of parallel algorithms","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Computer science; Parallel computing; Algorithm; Parallel algorithm","score_opus":0.04068022882561018,"score_gpt":0.3369788041953137,"score_spread":0.2962985753697035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589200278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021043295,0.00017355129,0.9932613,0.00077543675,0.0012394987,0.0006583082,0.000006255862,0.0011744484,0.002500775],"genre_scores_gemma":[0.06485737,0.00008499292,0.9333635,0.00020524158,0.0003441921,0.000055738314,0.000030200601,0.000039707982,0.0010190824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586684,0.00027994838,0.0011393346,0.0012236312,0.0009617354,0.00052851334],"domain_scores_gemma":[0.9957662,0.00047516916,0.0009896227,0.0018743556,0.00064220355,0.00025242835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010527056,0.0005738671,0.00077114545,0.00036789582,0.00015187167,0.0003083369,0.002018119,0.00092439214,0.000092323695],"category_scores_gemma":[0.00019298657,0.00054168416,0.00035349073,0.0002915535,0.00016226522,0.00050343334,0.002495302,0.0016850906,0.00004254429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002359582,0.00028812428,0.000033993238,0.00007108306,0.00006128667,0.000029350897,0.00022553864,0.9495048,0.00008929347,0.00658131,0.0010134217,0.04207822],"study_design_scores_gemma":[0.00039227502,0.000111351976,0.000193407,0.00008778779,0.000026260173,0.00003781854,0.000005230054,0.97528535,0.00082568504,0.02202979,0.00042132684,0.0005837288],"about_ca_topic_score_codex":0.00020817175,"about_ca_topic_score_gemma":0.0000068133286,"teacher_disagreement_score":0.064646944,"about_ca_system_score_codex":0.00007100793,"about_ca_system_score_gemma":0.0003937049,"threshold_uncertainty_score":0.99970347},"labels":[],"label_agreement":null},{"id":"W1594046035","doi":"","title":"Evaluating the Performance Impact of Dynamic Handle Lookup in Modern Network Interfaces","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Embedded system; Distributed computing; Operating system","score_opus":0.03292242769851358,"score_gpt":0.34606999117097426,"score_spread":0.3131475634724607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594046035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4538816,0.00015145948,0.5439815,0.000018202623,0.000033249537,0.00007012063,6.104334e-8,0.00006184465,0.0018020081],"genre_scores_gemma":[0.85071665,0.000025466778,0.14903106,0.000027635511,0.000003979015,0.0000044089525,2.1836733e-7,0.000003439248,0.00018713075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991538,0.00013325905,0.00021712086,0.00016622621,0.00013754515,0.00019202662],"domain_scores_gemma":[0.99941254,0.000091126945,0.000092194176,0.00033220576,0.00005304249,0.000018920608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008941452,0.00008470306,0.00011438781,0.000049353494,0.000072625786,0.00004970378,0.00048894045,0.00002857905,0.000010674008],"category_scores_gemma":[0.000039849103,0.00005256036,0.000040766197,0.0003550456,0.000027999396,0.0001748966,0.000095611314,0.00009594772,0.0000026863006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029434943,0.00001784271,0.0040640105,0.0000037014,0.000005881092,1.3841255e-7,0.0003786447,0.96657544,0.00017341264,0.0009606957,0.00007451511,0.027742784],"study_design_scores_gemma":[0.000112106456,0.00018352714,0.0033849739,0.000033830118,0.0000010622268,0.000003469362,0.000006186826,0.9930809,0.0010295941,0.002094361,0.000002405681,0.00006758949],"about_ca_topic_score_codex":0.000033199627,"about_ca_topic_score_gemma":0.0000103642415,"teacher_disagreement_score":0.39683506,"about_ca_system_score_codex":0.00004198168,"about_ca_system_score_gemma":0.00007227087,"threshold_uncertainty_score":0.21433492},"labels":[],"label_agreement":null},{"id":"W1594982746","doi":"10.1007/11532378_15","title":"A Practical MHP Information Analysis for Concurrent Java Programs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Java; Variety (cybernetics); Programming language; Range (aeronautics); Distributed computing; Software engineering; Artificial intelligence","score_opus":0.03244970569755555,"score_gpt":0.3090443089362728,"score_spread":0.27659460323871726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594982746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003128749,0.00009737117,0.9950152,0.0014460781,0.0006700017,0.00078609015,0.000005491581,0.0004797316,0.0014968944],"genre_scores_gemma":[0.028192895,0.000036272202,0.9701781,0.001061496,0.0002731942,0.000042171014,0.00005094443,0.0000142413,0.00015068459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689484,0.000032856005,0.0007230516,0.00093073276,0.0008386566,0.0005798405],"domain_scores_gemma":[0.9973329,0.00040298232,0.000530512,0.00095728465,0.0006049616,0.00017141618],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010829424,0.0004331642,0.0005610512,0.0014041875,0.00025393936,0.001053107,0.0018738166,0.00031245354,0.000009061009],"category_scores_gemma":[0.00017022314,0.00039879957,0.00027887456,0.001221132,0.0003307115,0.0014132031,0.0007127526,0.00051883986,0.000022169372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003843207,0.000036669913,0.000035924142,0.000024365434,0.00004906602,0.0000035769567,0.0003558757,0.10947073,8.075835e-7,0.038307264,0.00012355969,0.8515883],"study_design_scores_gemma":[0.00021079551,0.00019211818,0.000028010076,0.000091654176,0.000047985148,0.000018942583,9.6511116e-8,0.9667496,0.00011652709,0.013938467,0.018131083,0.00047470912],"about_ca_topic_score_codex":0.000008514131,"about_ca_topic_score_gemma":0.000025597074,"teacher_disagreement_score":0.8572789,"about_ca_system_score_codex":0.00028989805,"about_ca_system_score_gemma":0.00057571457,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W1597797825","doi":"10.1109/pacrim.2003.1235742","title":"A design space analysis of Java processors","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Java; Computer science; Tree traversal; Embedded Java; Java Card; Operating system; Real time Java; strictfp; Programming language; Computer architecture; Embedded system","score_opus":0.022619310001777516,"score_gpt":0.2668627567024705,"score_spread":0.24424344670069298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597797825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001336503,0.000027895147,0.9945353,0.00038222485,0.000012599802,0.00005966438,1.07442204e-7,0.00035103777,0.0032946663],"genre_scores_gemma":[0.44811684,0.0000053511194,0.55167437,0.000060692324,0.0000018232844,0.000001809578,3.0279017e-7,0.0000013721195,0.00013741024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994258,0.000024249644,0.00013872253,0.00017247492,0.00013737741,0.00010134806],"domain_scores_gemma":[0.9994903,0.000032147407,0.00007429332,0.0002726613,0.000098337136,0.00003223345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020047315,0.000058868365,0.00013849568,0.00028440962,0.000032727774,0.000032765773,0.00043481338,0.000027304899,0.0000076219235],"category_scores_gemma":[0.00002393848,0.000049476734,0.000054875192,0.0018308128,0.000017382417,0.00012860476,0.00006700303,0.000029962019,0.0000045193883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014629265,0.000043630123,0.000103684935,0.000003169365,0.00008349646,0.0000011457679,0.00047890688,0.9488624,0.00020420503,0.049203854,0.00016465395,0.00084939325],"study_design_scores_gemma":[0.00013782369,0.00006645229,0.00034742328,0.000008298251,0.000049808026,0.0000011834599,0.000008108156,0.93293846,0.060120672,0.006148347,0.000058331625,0.00011511025],"about_ca_topic_score_codex":0.000043992797,"about_ca_topic_score_gemma":0.0000027093142,"teacher_disagreement_score":0.44678035,"about_ca_system_score_codex":0.000016006694,"about_ca_system_score_gemma":0.00005800975,"threshold_uncertainty_score":0.20176026},"labels":[],"label_agreement":null},{"id":"W1598811966","doi":"10.1007/978-3-540-39762-5_48","title":"Power-Aware Branch Predictor Update for High-Performance Processors","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Branch predictor; Computer science; Spec#; Energy consumption; Power consumption; Predictive power; Power (physics); Parallel computing","score_opus":0.01035047317748304,"score_gpt":0.23566915186015308,"score_spread":0.22531867868267005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598811966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023358784,0.0002903766,0.9943132,0.00076257414,0.001660987,0.0008383587,0.000014543886,0.0006762083,0.0012101982],"genre_scores_gemma":[0.27374524,0.00012670131,0.7224678,0.002679845,0.00026340276,0.000054231823,0.000017804075,0.000065879234,0.00057912513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580944,0.00003125254,0.0006730729,0.0017691564,0.0008677655,0.0008493266],"domain_scores_gemma":[0.99717784,0.0002571338,0.0004389389,0.001377755,0.00056290027,0.00018541547],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089000404,0.000653461,0.0006267016,0.00078517647,0.0004321696,0.00055326923,0.0037177426,0.00041894204,0.00001647802],"category_scores_gemma":[0.00008971697,0.0006120998,0.00011823548,0.0007323925,0.00043192532,0.0007787699,0.00069038395,0.000625894,0.00002091071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004154016,0.00016642468,0.00018141151,0.0004732368,0.00005465242,0.000031591873,0.0010197413,0.43151703,0.000059280108,0.0629519,0.0019106953,0.5015925],"study_design_scores_gemma":[0.0005767835,0.00059839874,0.00006535798,0.0006195689,0.000009851214,0.000050547016,5.3298173e-8,0.8395343,0.005926465,0.14516897,0.0062408554,0.0012088595],"about_ca_topic_score_codex":0.0000029321027,"about_ca_topic_score_gemma":0.0000033220397,"teacher_disagreement_score":0.5003836,"about_ca_system_score_codex":0.00024049157,"about_ca_system_score_gemma":0.0005582696,"threshold_uncertainty_score":0.999633},"labels":[],"label_agreement":null},{"id":"W1598901422","doi":"10.1007/978-3-540-69330-7_21","title":"Software Thread Level Speculation for the Java Language and Virtual Machine Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Java; strictfp; Bytecode; Java concurrency; Real time Java; Concurrency; Java annotation; Operating system; Virtual machine; Implementation; Java bytecode; Generics in Java","score_opus":0.01826517896625244,"score_gpt":0.24234614684980424,"score_spread":0.2240809678835518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598901422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003077654,0.0011513358,0.99698234,0.00053612556,0.00034289903,0.0005149595,0.000018023935,0.0002004762,0.00022308624],"genre_scores_gemma":[0.03604534,0.000080757316,0.9619908,0.0006754653,0.00028925756,0.000016083233,0.00002366111,0.000027865552,0.00085078634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979142,0.000021192602,0.0003271392,0.0009000099,0.0004970131,0.00034044092],"domain_scores_gemma":[0.99820584,0.0006355585,0.00021146446,0.0008074992,0.00007827412,0.000061391154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060886826,0.00034368003,0.0002746811,0.00026352724,0.0003580925,0.00036542665,0.0014167125,0.00017441067,0.000005645197],"category_scores_gemma":[0.000059356098,0.0002574213,0.000072901305,0.0001770325,0.00038255326,0.0002215629,0.0007746076,0.0003237108,0.000005041463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038906387,0.000014809389,0.000040247254,0.000012697926,0.00000797924,0.000007699465,0.00043826256,0.33164716,0.00003176873,0.010924821,0.00013780061,0.65673286],"study_design_scores_gemma":[0.00022126138,0.00013042164,0.00035604113,0.00008553786,0.000009228792,0.000026313466,1.6722652e-7,0.96128184,0.0005680289,0.03539192,0.001537046,0.0003921835],"about_ca_topic_score_codex":0.000043191067,"about_ca_topic_score_gemma":0.000024425142,"teacher_disagreement_score":0.65634066,"about_ca_system_score_codex":0.00012960997,"about_ca_system_score_gemma":0.000105686464,"threshold_uncertainty_score":0.9999878},"labels":[],"label_agreement":null},{"id":"W1603617425","doi":"10.1007/978-3-642-16478-1_1","title":"PICOBIT: A Compact Scheme System for Microcontrollers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Compiler; Scheme (mathematics); Microcontroller; Bytecode; Programming language; Virtual machine; Embedded system; Computer hardware; Parallel computing","score_opus":0.014473035750432165,"score_gpt":0.25149342639898403,"score_spread":0.23702039064855188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603617425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020784977,0.00026943238,0.99099547,0.00070420996,0.0017832555,0.0010129447,0.000010035082,0.0008779027,0.0043259743],"genre_scores_gemma":[0.05254278,0.00001185218,0.94558454,0.0008238791,0.0005077393,0.000022631146,0.000008027211,0.00004969205,0.00044884623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622345,0.000031414165,0.0006810127,0.0016059603,0.0006626931,0.0007954877],"domain_scores_gemma":[0.9967127,0.0005796848,0.00046773162,0.0015486048,0.00046598937,0.00022527734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011551339,0.0006326555,0.00080645655,0.0009543221,0.0004844154,0.00078376074,0.004067102,0.00054433604,0.0000055573014],"category_scores_gemma":[0.000090369926,0.00058523763,0.0002749077,0.0004517168,0.00050006766,0.00039502737,0.00065215223,0.0009577682,0.000023519213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011472303,0.00021427798,0.00016666173,0.0008358904,0.00016425322,0.00017379806,0.0019029406,0.22722074,0.009994525,0.22944348,0.0010538374,0.5287149],"study_design_scores_gemma":[0.0007161179,0.00018561796,0.000015798598,0.00050773064,0.00000950592,0.00008993426,1.2044826e-7,0.9592917,0.008467445,0.023711126,0.0061741783,0.0008307045],"about_ca_topic_score_codex":0.000018049404,"about_ca_topic_score_gemma":0.000022672504,"teacher_disagreement_score":0.732071,"about_ca_system_score_codex":0.00035331657,"about_ca_system_score_gemma":0.0006274568,"threshold_uncertainty_score":0.9996599},"labels":[],"label_agreement":null},{"id":"W160396381","doi":"10.1007/978-3-642-35632-2_8","title":"Detecting Unread Memory Using Dynamic Binary Translation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary translation; Static analysis; Memory address; Set (abstract data type); Parallel computing; Binary number; C dynamic memory allocation; Benchmark (surveying); Theoretical computer science; Algorithm; Programming language; Memory management; Operating system; Arithmetic; Semiconductor memory; Software","score_opus":0.02727075868484898,"score_gpt":0.27035162757210657,"score_spread":0.24308086888725758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160396381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000311633,0.00069011503,0.9939379,0.00021276006,0.0010522113,0.000461081,0.000001382711,0.0006711337,0.0026617628],"genre_scores_gemma":[0.11697213,0.000039950006,0.88220644,0.00038437452,0.00015811661,0.0000057492393,0.000003925885,0.000041198236,0.00018809119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649215,0.00006320848,0.00061547424,0.0014296202,0.0007643059,0.0006352229],"domain_scores_gemma":[0.9976532,0.00038309937,0.00039754208,0.0011623244,0.00025991222,0.00014390789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081220357,0.00054078177,0.0004884505,0.0011765338,0.0004276893,0.00060120324,0.0024762074,0.00039178683,0.000020768855],"category_scores_gemma":[0.00005291277,0.0005366844,0.0001433042,0.00076513254,0.00037072,0.0008899655,0.000728359,0.00079813023,0.00003370465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015866287,0.000010859277,0.0000045180936,0.000023376566,0.0000055633263,0.000021064683,0.00036240372,0.38218242,0.0005415782,0.00065510446,0.000004229175,0.6161873],"study_design_scores_gemma":[0.0001425604,0.00008898783,0.00001815126,0.00037071103,0.0000067161673,0.00007094963,1.3706536e-7,0.9619049,0.0012610124,0.035459924,0.00009325376,0.000582712],"about_ca_topic_score_codex":0.000044781526,"about_ca_topic_score_gemma":0.00001889812,"teacher_disagreement_score":0.6156046,"about_ca_system_score_codex":0.00039281766,"about_ca_system_score_gemma":0.00041630666,"threshold_uncertainty_score":0.9997085},"labels":[],"label_agreement":null},{"id":"W1605221606","doi":"","title":"LCTES 2006 : proceedings of the 2006 ACM SIGPLAN/SIGBED Conference for Languages, Compilers, and Tools for Embedded Systems, June 14-16, 2006, Ottawa, Ontario, Canada","year":2006,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Programming language; Computer science; Library science","score_opus":0.013356772204330849,"score_gpt":0.22838486807694094,"score_spread":0.2150280958726101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605221606","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007941415,0.00072455517,0.7709917,0.0012882311,0.003238948,0.010878937,0.004299691,0.0011539073,0.20662992],"genre_scores_gemma":[0.0253071,0.0000037962552,0.087290026,0.00075398304,0.00057387556,0.00029634908,0.001656316,0.0001367568,0.8839818],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966181,0.00009593272,0.0011785403,0.0008199864,0.0006439787,0.0006434414],"domain_scores_gemma":[0.99213666,0.002981198,0.0027284296,0.0004966441,0.001558914,0.00009814883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018226843,0.00059397187,0.0010087717,0.00018312865,0.0005902791,0.0008367618,0.0015460901,0.00046694934,0.0000010797282],"category_scores_gemma":[0.00090441114,0.00054141413,0.00029553118,0.00010042618,0.000056016477,0.00021816022,0.0004465651,0.0004574193,2.499133e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022036043,0.000032220203,0.00077487895,0.00055704894,0.00019532953,3.8371732e-7,0.0004168922,0.002717758,0.000036762987,0.04186707,0.9517673,0.0016123076],"study_design_scores_gemma":[0.003075791,0.00028758185,0.00095055427,0.0013329565,0.00035574863,0.000016147584,0.000075504744,0.22064877,0.0004788529,0.011725968,0.75927734,0.0017748064],"about_ca_topic_score_codex":0.10858813,"about_ca_topic_score_gemma":0.22624429,"teacher_disagreement_score":0.68370163,"about_ca_system_score_codex":0.001490082,"about_ca_system_score_gemma":0.0020435443,"threshold_uncertainty_score":0.99970376},"labels":[],"label_agreement":null},{"id":"W1605442146","doi":"10.1109/pacrim.2003.1235873","title":"Evolution and research applications of an objected-oriented framework for architectural simulation","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Object-oriented programming; Visualization; Tracing; Multiprocessing; Front and back ends; Network simulation; Architecture; Computer architecture; Distributed computing; Simulation; Operating system; Data mining","score_opus":0.031101245288871347,"score_gpt":0.36855809910542997,"score_spread":0.3374568538165586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605442146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018519808,0.000026467043,0.9803738,0.00016520002,0.000024864998,0.00045084057,0.0000013446868,0.00027737863,0.00016029853],"genre_scores_gemma":[0.51562077,8.369173e-7,0.48429862,0.000011044196,0.000018240022,0.000031737,0.000003164509,0.0000022801871,0.000013297877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992576,0.000051167342,0.00014939769,0.00022904016,0.00017100135,0.00014176178],"domain_scores_gemma":[0.9990187,0.00025378607,0.000048577727,0.00029211442,0.0003377565,0.000049047572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643752,0.000053288066,0.000070771464,0.00019673233,0.0001790228,0.00004054397,0.00022997046,0.000058412676,7.36401e-7],"category_scores_gemma":[0.00012602501,0.000049251426,0.000018854626,0.0005884598,0.000059935206,0.00017254133,0.000078491496,0.00009512436,7.5091475e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069299917,0.000045508754,0.000053012496,0.000009667665,0.0000022286447,4.345865e-8,0.00036540537,0.27252364,0.00012854289,0.7130429,0.00000440597,0.013817716],"study_design_scores_gemma":[0.00014254493,0.00013339188,0.0008548341,0.000013314433,9.771953e-7,0.0000014818511,0.000018130988,0.6445775,0.0021565137,0.3519544,0.00009484897,0.00005205394],"about_ca_topic_score_codex":0.00005044377,"about_ca_topic_score_gemma":0.0000052364267,"teacher_disagreement_score":0.49710098,"about_ca_system_score_codex":0.000038103608,"about_ca_system_score_gemma":0.00005225096,"threshold_uncertainty_score":0.20084149},"labels":[],"label_agreement":null},{"id":"W1605785205","doi":"10.11234/gi1990.13.469","title":"A π-Calculus Model of the Na Pump","year":2002,"lang":"en","type":"article","venue":"Proceedings Genome Informatics Workshop/Genome informatics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Calculus (dental); Applied mathematics; Computer science; Mathematics; Medicine; Dentistry","score_opus":0.027035919558009495,"score_gpt":0.22476492129449172,"score_spread":0.19772900173648222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605785205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01736785,0.00014499588,0.926256,0.00039580793,0.00018117718,0.0007859353,0.000015304406,0.00067697227,0.054175984],"genre_scores_gemma":[0.6316754,0.00029894555,0.36550364,0.0013542472,0.00005639159,0.00005623175,0.0000069396688,0.00003525417,0.0010129192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956487,0.000013142152,0.0023329116,0.00018069183,0.0010203576,0.00080420426],"domain_scores_gemma":[0.9963582,0.00008269682,0.0016484982,0.0009086096,0.0007616481,0.0002403407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087218435,0.00048354644,0.00055773807,0.00046866163,0.0004949521,0.00062462426,0.0037896459,0.00027808524,0.000029386663],"category_scores_gemma":[0.00022178503,0.00038031518,0.00027551875,0.0019120966,0.00021227472,0.002672817,0.0015873831,0.00062671053,0.00011628145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016501364,0.00033963006,0.0002598332,0.0016979006,0.00023293201,7.937348e-7,0.19678794,0.6959017,0.0005000343,0.08585874,0.0037062333,0.01469775],"study_design_scores_gemma":[0.00035525623,0.000050952713,0.000034008113,0.00009736624,0.000023883049,0.0000360835,0.00097368436,0.9925612,0.00052165106,0.0013356175,0.0035334593,0.00047682453],"about_ca_topic_score_codex":0.0000013470147,"about_ca_topic_score_gemma":2.3239242e-7,"teacher_disagreement_score":0.6143076,"about_ca_system_score_codex":0.00018235062,"about_ca_system_score_gemma":0.00010154686,"threshold_uncertainty_score":0.9998649},"labels":[],"label_agreement":null},{"id":"W1606347560","doi":"10.48550/arxiv.1211.5590","title":"Theano: new features and speed improvements","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1041,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Implementation; Computation; Linear algebra; Speedup; Artificial neural network; Parallel computing; Computer architecture; Artificial intelligence; Computer engineering; Programming language; Theoretical computer science; Mathematics","score_opus":0.054911238636542195,"score_gpt":0.2015849026973034,"score_spread":0.1466736640607612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606347560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026018325,0.0003197506,0.9666302,0.0001458037,0.00044151445,0.00023746751,0.00000312432,0.00062591786,0.0055778637],"genre_scores_gemma":[0.9679459,0.00027790602,0.025594214,0.00019144978,0.000115686256,1.5851737e-7,0.000007411789,0.000013061747,0.0058542574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987674,0.000070580725,0.00012293698,0.00067881605,0.00006941148,0.00029089858],"domain_scores_gemma":[0.9987319,0.000039407885,0.00017499794,0.0007753906,0.000065478634,0.00021278784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016715351,0.00024248776,0.00021943037,0.00016352518,0.00012067636,0.00016359381,0.0011178447,0.00021765786,0.000011132309],"category_scores_gemma":[0.00001399704,0.00025956173,0.000085833715,0.00023158539,0.000047709575,0.0002785283,0.0021794727,0.00036519018,0.00001750489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008521174,0.00038908952,0.014345522,0.00027388454,0.00046789588,0.00019320672,0.002459629,0.24441157,0.00034975444,0.65696025,0.046347857,0.03371615],"study_design_scores_gemma":[0.0012441463,0.000119868615,0.00990074,0.000209511,0.00012066676,0.00002254896,0.00003951364,0.8322464,0.00165613,0.14991984,0.0030231257,0.0014974817],"about_ca_topic_score_codex":0.0002479473,"about_ca_topic_score_gemma":0.000006465228,"teacher_disagreement_score":0.94192755,"about_ca_system_score_codex":0.000069120455,"about_ca_system_score_gemma":0.00011198494,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W1606804836","doi":"10.1109/rtas.2015.7108453","title":"Reverse-engineering embedded memory controllers through latency-based analysis","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Predictability; Dram; CAS latency; Reverse engineering; Arbitration; Cover (algebra); Memory controller; Distributed computing; Software; Computer engineering; Computer architecture; Operating system; Computer hardware","score_opus":0.025505947370082323,"score_gpt":0.2549283654313955,"score_spread":0.2294224180613132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606804836","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048843445,0.000056123634,0.98285425,0.0007175014,0.00013303803,0.00009391568,4.8584434e-7,0.0013145418,0.014341689],"genre_scores_gemma":[0.31952164,0.0000026752925,0.67892164,0.0008450206,0.000020779558,0.000007217685,0.0000035502196,0.0000063613816,0.000671122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895406,0.000051551975,0.00022269198,0.0003008964,0.00024987245,0.00022094189],"domain_scores_gemma":[0.99906284,0.00006572925,0.00007245874,0.00052418065,0.00016145753,0.0001133485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037459368,0.00013273413,0.00024889296,0.00021551302,0.000051610845,0.00010675822,0.00056242413,0.000060307982,0.00001960441],"category_scores_gemma":[0.0000854176,0.000117809475,0.0001385705,0.0012000398,0.000015876098,0.00030175163,0.00008430356,0.000087161505,0.000029448669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004025702,0.000020976951,0.00011032818,0.0000025844624,0.00009330555,0.0000068167105,0.00026275325,0.9851018,0.000025156734,0.004889964,0.009239553,0.0002426921],"study_design_scores_gemma":[0.0004765107,0.000030055853,0.00004970823,0.0000046721966,0.000036884343,9.796792e-7,0.000019471112,0.99651814,0.0011494795,0.0003880606,0.0011592774,0.00016674258],"about_ca_topic_score_codex":0.00007240669,"about_ca_topic_score_gemma":0.0000031776126,"teacher_disagreement_score":0.3190332,"about_ca_system_score_codex":0.00004894734,"about_ca_system_score_gemma":0.000095206306,"threshold_uncertainty_score":0.4804131},"labels":[],"label_agreement":null},{"id":"W1609491598","doi":"10.1155/2015/940628","title":"LTTng CLUST: A System-Wide Unified CPU and GPU Tracing Tool for OpenCL Applications","year":2015,"lang":"en","type":"article","venue":"Advances in Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Scalability; Central processing unit; Kernel (algebra); Computation; Parallel computing; CUDA; General-purpose computing on graphics processing units; Interface (matter); Embedded system; Computer architecture; Operating system; Graphics; Programming language","score_opus":0.011258210585095303,"score_gpt":0.25578058409111976,"score_spread":0.24452237350602446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609491598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006506877,0.0022181007,0.99549395,0.000032634875,0.00014877679,0.00041862237,0.0000020302446,0.0009398355,0.00009534816],"genre_scores_gemma":[0.27082062,0.000057935955,0.7287958,0.00002725398,0.000036134068,0.00022538108,0.0000033984875,0.000011851109,0.00002158667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991374,0.000014942106,0.0002387431,0.00028923107,0.00010745424,0.00021220742],"domain_scores_gemma":[0.9991776,0.00035476737,0.000059636972,0.00026502842,0.00007497328,0.00006803951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036404224,0.00012361418,0.00016436452,0.00012486323,0.00006794476,0.000085230065,0.00036652992,0.000047536654,1.1830861e-7],"category_scores_gemma":[0.00029168383,0.0001320461,0.000022908967,0.00032056772,0.00001230864,0.0006631868,0.00012800598,0.00009121727,0.0000012069287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038101944,0.000012883059,0.0012974872,0.00020506195,0.0000044972926,0.0000029887995,0.00040321157,0.9500676,0.000011105259,0.020184215,0.000065835295,0.027741337],"study_design_scores_gemma":[0.00045479066,0.000042079686,0.00020317073,0.00022710713,0.000004007586,0.000020204048,0.000048328682,0.9782921,0.00036160485,0.0010227938,0.019012928,0.00031086078],"about_ca_topic_score_codex":0.000004407431,"about_ca_topic_score_gemma":0.0000018306819,"teacher_disagreement_score":0.27016994,"about_ca_system_score_codex":0.00008559231,"about_ca_system_score_gemma":0.000029355091,"threshold_uncertainty_score":0.53846836},"labels":[],"label_agreement":null},{"id":"W1641368799","doi":"10.1007/978-3-642-36949-0_60","title":"Efficient Design Space Exploration of GPGPU Architectures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Design space exploration; Constraint (computer-aided design); Mathematical optimization; Space (punctuation); General-purpose computing on graphics processing units; CUDA; Resource (disambiguation); Computer engineering; Parallel computing; Embedded system; Mathematics; Graphics","score_opus":0.030547678472455448,"score_gpt":0.2550810952208534,"score_spread":0.22453341674839797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641368799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041221985,0.0003282249,0.9948093,0.000599402,0.0006060379,0.00063728285,0.0000014722383,0.0003550753,0.00262196],"genre_scores_gemma":[0.10598233,0.000024504985,0.8933007,0.00026946512,0.00013668193,0.000014234234,0.000001922443,0.00002698597,0.00024318324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966442,0.000089048204,0.00061821105,0.0011854075,0.0009587541,0.0005043832],"domain_scores_gemma":[0.9970898,0.00054036465,0.000509515,0.001317726,0.0004065427,0.00013604853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009572631,0.0004833807,0.00054049044,0.0011178054,0.00018216699,0.00030994264,0.0027247018,0.0002769906,0.000019235738],"category_scores_gemma":[0.00012650849,0.00042888027,0.0001275298,0.000678921,0.0005420027,0.00022713307,0.0009383129,0.00054668856,0.000034604902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031576608,0.000021837395,0.0000018301024,0.000019715475,0.000005029924,0.000006385143,0.00067422417,0.8373911,0.000119672935,0.014221105,0.000045062057,0.14749089],"study_design_scores_gemma":[0.00011874036,0.00017425082,0.0000125040315,0.00026141308,0.000003915572,0.0000147796745,9.5856144e-8,0.85689527,0.0073742643,0.13462095,0.0001302568,0.00039357046],"about_ca_topic_score_codex":0.000022233871,"about_ca_topic_score_gemma":0.000003825401,"teacher_disagreement_score":0.14709732,"about_ca_system_score_codex":0.00015487238,"about_ca_system_score_gemma":0.00041631024,"threshold_uncertainty_score":0.9998163},"labels":[],"label_agreement":null},{"id":"W1648429130","doi":"10.1109/hicss.1990.205117","title":"CAPS: a connectionist architecture for production systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Connectionism; Computer science; Implementation; Architecture; Programming language; Artificial neural network; Negation; Variable (mathematics); Artificial intelligence; Computer architecture; Theoretical computer science","score_opus":0.02560790640909476,"score_gpt":0.2422106407505327,"score_spread":0.21660273434143792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1648429130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020979224,0.00013730291,0.9896092,0.001876468,0.0005695215,0.0003133348,4.6150004e-7,0.0010656175,0.006218339],"genre_scores_gemma":[0.505742,0.000018348203,0.4806674,0.00023867199,0.0002735263,0.00012133085,0.000002233565,0.000009590189,0.012926865],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938333,0.000027552485,0.00012269351,0.00025147694,0.000085869746,0.00012906647],"domain_scores_gemma":[0.9995219,0.000032217627,0.000045599572,0.0002720081,0.00009585667,0.0000324007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013192781,0.00006982816,0.00007820463,0.00007076157,0.00019505495,0.00015261483,0.00023588889,0.00003493218,0.000005986634],"category_scores_gemma":[0.000053805245,0.00005958721,0.0000340151,0.00018874354,0.00002012986,0.00011625995,0.000030316161,0.00004701066,0.000013940609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006764596,0.00019622514,0.00008450442,0.00011361363,0.00003977309,0.0000020479893,0.0017051112,0.26933363,0.00056696683,0.23812446,0.43957493,0.050251987],"study_design_scores_gemma":[0.000111839494,0.000074860465,0.00000889482,0.000013387589,0.000002037781,0.00004870532,0.000014666071,0.9344404,0.0015015196,0.0014956573,0.06216032,0.00012772129],"about_ca_topic_score_codex":0.000019078294,"about_ca_topic_score_gemma":0.0000028758157,"teacher_disagreement_score":0.6651068,"about_ca_system_score_codex":0.000020155412,"about_ca_system_score_gemma":0.0000061677215,"threshold_uncertainty_score":0.2429896},"labels":[],"label_agreement":null},{"id":"W1650292994","doi":"10.5555/2874988.2874989","title":"Approximate mean value analysis for multi-core systems","year":2015,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Multi-core processor; Core (optical fiber); Computer performance; Stability (learning theory); Distributed computing; Algorithm; Computer engineering; Parallel computing; Machine learning","score_opus":0.10924562693680548,"score_gpt":0.3489595384770916,"score_spread":0.23971391154028612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650292994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046720475,0.00030452255,0.9495742,0.0002630009,0.000954847,0.00084715395,0.0000119341485,0.00019123148,0.0011326742],"genre_scores_gemma":[0.90943164,0.000108752305,0.08984993,0.000058732054,0.000111968155,0.00023590517,0.00011813208,0.000011911684,0.00007303159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737126,0.00032982303,0.0007616021,0.00039395626,0.0009695457,0.00017381321],"domain_scores_gemma":[0.9960699,0.00017032574,0.00060792646,0.0008350888,0.0022133938,0.000103330676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038198524,0.00019718255,0.00035536566,0.0004565027,0.00014987448,0.0002803388,0.0011278691,0.00009401324,0.0000010435555],"category_scores_gemma":[0.00004227219,0.00018546204,0.00010499587,0.00049287366,0.000046344303,0.00051051704,0.00022653127,0.000106238826,0.0000046756795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024914965,0.00013370097,0.0022665751,0.00002934092,0.00027490646,5.9066384e-8,0.0008273292,0.9607054,0.000028062115,0.030425495,0.00023563365,0.0050485707],"study_design_scores_gemma":[0.001188384,0.0001941012,0.0024800869,0.00007831207,0.00008418021,0.000008244315,0.000038050322,0.9941975,0.00023836778,0.000079318655,0.0012223783,0.00019110856],"about_ca_topic_score_codex":0.000065379194,"about_ca_topic_score_gemma":0.0000020930788,"teacher_disagreement_score":0.8627112,"about_ca_system_score_codex":0.00018481053,"about_ca_system_score_gemma":0.00010420565,"threshold_uncertainty_score":0.7562922},"labels":[],"label_agreement":null},{"id":"W1652141976","doi":"10.48550/arxiv.cs/0506035","title":"Fast Recompilation of Object Oriented Modules","year":2005,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Compiler; Programming language; Object (grammar); Code (set theory); Generator (circuit theory); Compile time; Code generation; Parallel computing; Operating system; Artificial intelligence; Key (lock)","score_opus":0.012763776515835896,"score_gpt":0.2446048857099378,"score_spread":0.2318411091941019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1652141976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008952584,0.0009715393,0.9820706,0.0019762146,0.00038648388,0.0009357677,0.000058029498,0.003086642,0.0015621148],"genre_scores_gemma":[0.3258674,0.00043009812,0.67229706,0.0004500738,0.00016932414,0.00021798874,0.00009113755,0.00005389087,0.00042301512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960565,0.00032755756,0.0011612343,0.0010866135,0.00066333305,0.00070475315],"domain_scores_gemma":[0.99554473,0.00014425348,0.0011345866,0.0024198943,0.00050423504,0.00025231438],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010321008,0.00063505117,0.0008328283,0.001081865,0.00021094913,0.0002934599,0.0023912846,0.0007815134,0.000016248267],"category_scores_gemma":[0.00020045842,0.0006864573,0.00039644353,0.0008479463,0.000107090775,0.0004451384,0.0022819806,0.0010300407,0.0000104705305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006231889,0.00060513587,0.00537617,0.00023246184,0.00016237922,0.000025314552,0.0011054322,0.7529598,0.0014327031,0.0839175,0.008327572,0.14579324],"study_design_scores_gemma":[0.0002674107,0.00010762645,0.0073513384,0.00028772518,0.000026620206,0.00003289018,0.000012415987,0.9663491,0.01569708,0.0077996217,0.0014089822,0.0006591709],"about_ca_topic_score_codex":0.0022587453,"about_ca_topic_score_gemma":0.00031642042,"teacher_disagreement_score":0.31691483,"about_ca_system_score_codex":0.0005464456,"about_ca_system_score_gemma":0.00047965988,"threshold_uncertainty_score":0.9995587},"labels":[],"label_agreement":null},{"id":"W1658056400","doi":"10.1142/s0129626412500089","title":"DETERMINISTIC SAMPLE SORT FOR GPUS","year":2012,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Merge sort; sort; Computer science; Sorting algorithm; Parallel computing; Sorting; Sample (material); Algorithm","score_opus":0.030169005202916807,"score_gpt":0.28704899431932235,"score_spread":0.2568799891164055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658056400","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024012527,0.0002704883,0.994279,0.0014649862,0.00026310695,0.00021192104,0.0000023448233,0.0007327472,0.0003741026],"genre_scores_gemma":[0.4202707,0.0000032647765,0.57677746,0.0026532558,0.00016055201,0.00006509002,0.000007289739,0.000014286074,0.000048097027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998637,0.00003728842,0.0002590016,0.00031413985,0.00018549745,0.0005670293],"domain_scores_gemma":[0.99914724,0.00018217521,0.00014795794,0.00032844325,0.00006223996,0.00013193073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037087087,0.00017957573,0.00018152094,0.00010955064,0.00031689258,0.00023766972,0.00066173007,0.0000562823,0.000003767999],"category_scores_gemma":[0.0001117144,0.0001731322,0.000077738434,0.00021530633,0.00005096478,0.0006186691,0.00011134432,0.00009601045,0.000016378428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015708151,0.0011267953,0.025776977,0.0013342286,0.00017151648,0.00001850523,0.01579664,0.0659976,0.0092093935,0.039297733,0.14968677,0.69142675],"study_design_scores_gemma":[0.00094317656,0.000102924176,0.0017686927,0.00010826881,0.00003264378,0.000058702277,0.000024770668,0.9337899,0.0020275796,0.0042975782,0.05578801,0.0010577543],"about_ca_topic_score_codex":0.0000080602695,"about_ca_topic_score_gemma":3.255256e-7,"teacher_disagreement_score":0.8677923,"about_ca_system_score_codex":0.000039730185,"about_ca_system_score_gemma":0.00004339943,"threshold_uncertainty_score":0.7060126},"labels":[],"label_agreement":null},{"id":"W1661934190","doi":"10.1109/ipdpsw.2015.74","title":"Graph Coloring on the GPU and Some Techniques to Improve Load Imbalance","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Computer science; Graph coloring; Parallel computing; Graph; Graphics; Graph algorithms; General-purpose computing on graphics processing units; Graph bandwidth; Graph partition; Theoretical computer science; Graph power; Line graph; Computer graphics (images)","score_opus":0.02261578027155068,"score_gpt":0.2604176710503093,"score_spread":0.2378018907787586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661934190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008144983,0.00006362243,0.9667826,0.0063338364,0.00013905816,0.0003077916,4.8555336e-7,0.0012787291,0.016948879],"genre_scores_gemma":[0.6193701,0.000033950917,0.37298277,0.0064029912,0.00008355363,0.00006887985,2.1290178e-7,0.000009161187,0.0010483518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991899,0.00003916281,0.000118039665,0.00027331625,0.00020545349,0.0001740896],"domain_scores_gemma":[0.99926907,0.00007343831,0.00003946383,0.00040396207,0.000109147775,0.000104936065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053431856,0.00010028557,0.00009484019,0.000065209904,0.00009483551,0.0001664219,0.0005458163,0.000036768557,9.952797e-7],"category_scores_gemma":[0.00008566928,0.00006536122,0.000019984835,0.0002390105,0.000028986595,0.00019103939,0.00029720957,0.00009092061,0.000014900048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024003992,0.00008054925,0.00046651607,0.000008817465,0.000015848113,0.000007763917,0.0013449237,0.0006962557,0.0021879224,0.8558508,0.0902135,0.04910307],"study_design_scores_gemma":[0.0007307187,0.0025805938,0.0013800462,0.00017553022,0.000008870809,0.000036142705,0.0001550932,0.20633246,0.49458608,0.20649517,0.08612922,0.001390069],"about_ca_topic_score_codex":0.000035201774,"about_ca_topic_score_gemma":0.0000019207966,"teacher_disagreement_score":0.64935565,"about_ca_system_score_codex":0.000040351104,"about_ca_system_score_gemma":0.000045378878,"threshold_uncertainty_score":0.26653534},"labels":[],"label_agreement":null},{"id":"W1665373133","doi":"10.1109/ipdpsw.2015.81","title":"Heterogeneous Habanero-C (H2C): A Portable Programming Model for Heterogeneous Processors","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Software portability; Compiler; Locality; Distributed computing; Parallel computing; Synchronization (alternating current); Symmetric multiprocessor system; Computer architecture; Computation; Embedded system; Programming language; Computer network; Channel (broadcasting)","score_opus":0.05063550933845977,"score_gpt":0.28895634519908475,"score_spread":0.23832083586062497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1665373133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002967564,0.000199772,0.99325824,0.00023532679,0.00010926594,0.00058668427,0.000001874924,0.0017578815,0.00088341895],"genre_scores_gemma":[0.39783722,0.0000043548876,0.6000289,0.00032580772,0.000033080676,0.0001471174,0.0000065874824,0.000019532677,0.0015974409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982477,0.00002863555,0.0003464698,0.0005614813,0.00030201086,0.0005137402],"domain_scores_gemma":[0.9986706,0.00003189037,0.00014013915,0.0005333648,0.0003675501,0.00025645952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004076087,0.0002238716,0.00023743266,0.00012265681,0.0001567956,0.00030511312,0.0009021233,0.00009962646,0.0000018670609],"category_scores_gemma":[0.00007186701,0.0002013919,0.00010741542,0.00028389494,0.000030961462,0.00034156372,0.00022111161,0.00007810473,0.000010720184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016006607,0.00012498515,0.00007065648,0.000029110717,0.000022115573,0.000011764294,0.00062114536,0.96794856,0.00002200527,0.0031250939,0.0034382541,0.024570297],"study_design_scores_gemma":[0.00033313778,0.00018271305,4.1782118e-7,0.00001105618,0.000005935374,0.000078841884,0.000006126989,0.9865962,0.004223944,0.004654356,0.0036294113,0.00027781303],"about_ca_topic_score_codex":0.000018830324,"about_ca_topic_score_gemma":0.000010651498,"teacher_disagreement_score":0.39486966,"about_ca_system_score_codex":0.00005898177,"about_ca_system_score_gemma":0.00019943653,"threshold_uncertainty_score":0.82125235},"labels":[],"label_agreement":null},{"id":"W1675260315","doi":"10.1109/ipdpsw.2015.40","title":"Implementing Cross-Device Atomics in Heterogeneous Processors","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Astellas Pharma US; Advanced Micro Devices","keywords":"Computer science; Compiler; Parallel computing; Scalability; Operating system","score_opus":0.042831890070495676,"score_gpt":0.333790047397182,"score_spread":0.2909581573266863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1675260315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1322227,0.000069095804,0.8575582,0.00023737895,0.00007097683,0.000107482076,2.2635582e-7,0.0005900095,0.00914393],"genre_scores_gemma":[0.7681871,0.000003978331,0.23105443,0.00046642756,0.000017701052,0.000007697413,0.0000011650518,0.0000057621924,0.00025575972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.000032900032,0.00024118331,0.00026156785,0.00013330503,0.00032003038],"domain_scores_gemma":[0.9994337,0.000032012897,0.000069034744,0.00025987654,0.00012522413,0.00008018456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061855104,0.00008885373,0.0000997648,0.00010108488,0.000060304625,0.00022439533,0.0006086448,0.00003843593,0.0000041873705],"category_scores_gemma":[0.00006805873,0.000083943625,0.00002267586,0.0003748731,0.00001407523,0.00030750802,0.00038532642,0.00006860358,0.000021272228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032629967,0.00044073127,0.22705646,0.00009685864,0.000039625065,0.00013862856,0.0078016147,0.5559312,0.00013558328,0.11593756,0.00913115,0.08325794],"study_design_scores_gemma":[0.0003527822,0.00003700525,0.00026897853,0.000010236117,6.549442e-7,0.000021576363,0.00002080216,0.98168504,0.0064269984,0.0050698943,0.005916078,0.00018993184],"about_ca_topic_score_codex":0.00007066553,"about_ca_topic_score_gemma":0.000050040937,"teacher_disagreement_score":0.6359644,"about_ca_system_score_codex":0.00004924599,"about_ca_system_score_gemma":0.000081067075,"threshold_uncertainty_score":0.34231216},"labels":[],"label_agreement":null},{"id":"W16951981","doi":"10.1007/0-387-28967-4_8","title":"Energy Aware Scheduling for Heterogeneous Real-Time Embedded Systems Using Genetics Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheduling (production processes); Energy consumption; Dynamic voltage scaling; Genetic algorithm; Distributed computing; Real-time computing; Algorithm; Dynamic priority scheduling; Simulated annealing; Mathematical optimization; Engineering; Schedule; Mathematics; Electrical engineering","score_opus":0.03381436979837589,"score_gpt":0.2733660332818529,"score_spread":0.239551663483477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16951981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032713433,0.0011530991,0.9514494,0.000023982748,0.00041807667,0.0003736566,0.000018767,0.0013047713,0.045254998],"genre_scores_gemma":[0.00033404073,0.0006334112,0.81975317,0.00013074176,0.00072972366,0.000020479332,0.00005380294,0.00010825832,0.1782364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974921,0.00004234526,0.0007093662,0.00089943927,0.0003912275,0.00046555317],"domain_scores_gemma":[0.9978354,0.00013111957,0.0004654555,0.0009727744,0.00042449468,0.00017076562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028904228,0.0005407145,0.0006296156,0.0003102218,0.00024802706,0.00039495982,0.0011249115,0.00054833794,0.000025670875],"category_scores_gemma":[0.0000058718447,0.00055400375,0.0002748139,0.000065051725,0.000043689633,0.00012625504,0.00038835887,0.00015641845,0.000020398777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063207435,0.00002711022,3.1622764e-7,0.00008153433,0.00016556325,0.000027860964,0.00006533551,0.8802328,0.00014288249,0.07328843,0.0015294432,0.04443236],"study_design_scores_gemma":[0.00015884936,0.00007894573,1.5324371e-8,0.00018611217,0.000031893553,0.00009529292,0.0000011180123,0.973572,0.0006769314,0.0017427244,0.02281612,0.00063998444],"about_ca_topic_score_codex":0.00004409416,"about_ca_topic_score_gemma":0.0000023278308,"teacher_disagreement_score":0.1329814,"about_ca_system_score_codex":0.00018471033,"about_ca_system_score_gemma":0.00019881665,"threshold_uncertainty_score":0.9996911},"labels":[],"label_agreement":null},{"id":"W170123544","doi":"10.1007/978-3-642-19861-8_11","title":"Actor-Based Parallel Dataflow Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dataflow; Computer science; Scala; Distributive property; Parallel computing; Context (archaeology); Multi-core processor; Many core; Programming language; Theoretical computer science; Algorithm; Java; Mathematics","score_opus":0.027659976090365235,"score_gpt":0.2591298384465871,"score_spread":0.23146986235622186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170123544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006913591,0.000251428,0.9916404,0.00028419588,0.0006168295,0.000286597,0.000008424909,0.00068946864,0.0062157433],"genre_scores_gemma":[0.06200781,0.000045159366,0.9358927,0.0014310903,0.0001763578,0.0000096505955,0.000032497905,0.00003399288,0.00037076423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554896,0.00006271752,0.00066373014,0.002000255,0.0009877278,0.000736611],"domain_scores_gemma":[0.9958768,0.00034982292,0.00045497395,0.0027512151,0.00032515117,0.00024202636],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009928211,0.0006535664,0.0008081292,0.0023370353,0.00029192274,0.0005972138,0.0058256565,0.00041233926,0.00006425697],"category_scores_gemma":[0.000073902585,0.00060857006,0.00033438145,0.0019516846,0.00056270976,0.0005766294,0.0013634651,0.0007723091,0.000057312034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010360898,0.00007757332,0.00031410568,0.000029700816,0.00011762015,0.00009307425,0.00033568416,0.7096635,0.000013466415,0.02597484,0.00014383397,0.2632262],"study_design_scores_gemma":[0.00018450766,0.00011405527,0.0002069069,0.00010890971,0.00005547502,0.000007923151,1.7658085e-8,0.9364156,0.0004503235,0.060116228,0.0015778979,0.0007621396],"about_ca_topic_score_codex":0.000051908035,"about_ca_topic_score_gemma":0.000074769705,"teacher_disagreement_score":0.26246408,"about_ca_system_score_codex":0.0002241415,"about_ca_system_score_gemma":0.00063331745,"threshold_uncertainty_score":0.9996366},"labels":[],"label_agreement":null},{"id":"W1707454109","doi":"10.5555/1516124.1516147","title":"Consistent and scalable cache replication for multi-tier J2EE applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Replication (statistics); Cache; Quality of service; Distributed computing; Computer network; Protocol (science); Benchmark (surveying); High availability; Database","score_opus":0.04851370001562343,"score_gpt":0.3239429433966011,"score_spread":0.2754292433809777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1707454109","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002043781,0.00011081548,0.9947196,0.00049413095,0.000023514092,0.0004947032,8.949499e-7,0.0004637095,0.0034882568],"genre_scores_gemma":[0.0781725,0.000014980829,0.91925484,0.00045082407,0.000020960908,0.00010814721,0.000005176528,0.000004905525,0.0019676588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992636,0.000010315335,0.00017687633,0.000333079,0.0000675366,0.00014859137],"domain_scores_gemma":[0.9991383,0.00009135163,0.000061825835,0.0005037827,0.00014031085,0.000064409374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760199,0.00006620543,0.00007384292,0.00006569551,0.00016003377,0.00007164842,0.00023104117,0.00004621082,0.0000017979359],"category_scores_gemma":[0.000038100457,0.000060609353,0.000024969895,0.00017281623,0.00003090385,0.000111495654,0.00008114481,0.000036444104,0.0000052269334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009782132,0.00025221586,0.0023958178,0.000044678574,0.000025403104,5.3423025e-7,0.00032269463,0.0006564582,0.0017094404,0.5964509,0.012605773,0.38552627],"study_design_scores_gemma":[0.0004474762,0.000055447537,0.0026629553,0.000007768649,0.0000067875067,0.000013531827,0.000022647266,0.893097,0.017216902,0.0037738695,0.08247235,0.00022329408],"about_ca_topic_score_codex":0.000013919586,"about_ca_topic_score_gemma":0.0000060214693,"teacher_disagreement_score":0.8924405,"about_ca_system_score_codex":0.000021290629,"about_ca_system_score_gemma":0.000019975862,"threshold_uncertainty_score":0.24715777},"labels":[],"label_agreement":null},{"id":"W1710634562","doi":"10.1109/hpca.2000.824355","title":"Combining static and dynamic branch prediction to reduce destructive aliasing","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Branch predictor; Computer science; Aliasing; Simple (philosophy); Algorithm; Artificial intelligence; Parallel computing","score_opus":0.01818151232033799,"score_gpt":0.2600436392355342,"score_spread":0.2418621269151962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710634562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07641738,0.000036601363,0.9192056,0.00058471266,0.000100160905,0.000111511225,6.178543e-7,0.0005596302,0.0029837636],"genre_scores_gemma":[0.66277486,0.000012155757,0.3367354,0.00021051377,0.0000061533556,0.000004068832,5.174931e-7,0.0000039156403,0.00025239753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992974,0.00004327216,0.00014036689,0.00025779265,0.00011368343,0.00014751093],"domain_scores_gemma":[0.99960095,0.000047507085,0.000038424438,0.00018797515,0.000050095572,0.00007506641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117114294,0.000079895544,0.00008655492,0.00010630109,0.00013136919,0.00013593934,0.00018531496,0.000027910135,0.000007681435],"category_scores_gemma":[0.00003327834,0.000079212165,0.000012379469,0.00028106864,0.000019742503,0.00028289034,0.00010466964,0.000062199375,0.000009445578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016369244,0.00020294604,0.0029513282,0.000059673006,0.00006525112,0.00001521788,0.02012832,0.057098016,0.0059947176,0.05630999,0.012749461,0.8444087],"study_design_scores_gemma":[0.00014434365,0.00008775023,0.001955582,0.000029636481,0.000002103704,0.000028130518,0.000023060695,0.992785,0.0010501534,0.0036869897,0.00010523291,0.000102017024],"about_ca_topic_score_codex":0.000013436285,"about_ca_topic_score_gemma":0.0000011987437,"teacher_disagreement_score":0.935687,"about_ca_system_score_codex":0.00003283787,"about_ca_system_score_gemma":0.0000064364817,"threshold_uncertainty_score":0.3230178},"labels":[],"label_agreement":null},{"id":"W1715605981","doi":"10.1109/hicss.1991.183914","title":"Hector-a hierarchically structured shared memory multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Distributed memory; Parallel computing; Uniform memory access; Distributed shared memory; Modular design; Multiprocessing; Locality; Exploit; Shared memory; Bandwidth (computing); Interconnection; Interleaved memory; Computer architecture; Memory management; Computer hardware; Operating system; Semiconductor memory; Computer network","score_opus":0.01995628978834156,"score_gpt":0.23897148574000202,"score_spread":0.21901519595166047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1715605981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014004553,0.00010143415,0.96740764,0.001309125,0.00012941429,0.0001217313,0.000001129477,0.0018130258,0.02771602],"genre_scores_gemma":[0.47801495,0.0000122157335,0.5183211,0.0007791789,0.000041940355,0.0000074434834,0.0000015878279,0.0000072951957,0.0028143283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889964,0.000046397025,0.00020375173,0.0003722042,0.0002307995,0.00024722904],"domain_scores_gemma":[0.9992063,0.000058823116,0.000060439565,0.00047255337,0.00009469663,0.000107191045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009590875,0.00013364902,0.00013542234,0.00010862631,0.00013233193,0.00018620158,0.0009584791,0.00006954484,0.00033031366],"category_scores_gemma":[0.00006458421,0.00011286795,0.00005369766,0.0003538554,0.00003042929,0.0003089826,0.00020148426,0.00013925222,0.000086383174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021516244,0.000553874,0.0009827291,0.000101336984,0.00010419604,0.00009206636,0.006955619,0.024207113,0.005165362,0.08565293,0.21520217,0.6609611],"study_design_scores_gemma":[0.00031449264,0.000055432298,0.0005515894,0.000009643158,0.0000015729834,0.000015298247,0.0000039609804,0.9883094,0.0044068797,0.0035688258,0.00252599,0.00023691622],"about_ca_topic_score_codex":0.000008671252,"about_ca_topic_score_gemma":0.0000028006345,"teacher_disagreement_score":0.96410227,"about_ca_system_score_codex":0.000019404484,"about_ca_system_score_gemma":0.000014268507,"threshold_uncertainty_score":0.46026215},"labels":[],"label_agreement":null},{"id":"W171601837","doi":"","title":"Comparing a genetic algorithm penalty function and repair heuristic in the DSP application domain","year":2006,"lang":"en","type":"article","venue":"International conference on Artificial intelligence and applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Compiler; Heuristic; Digital signal processing; Bandwidth (computing); High memory; Algorithm; Computer hardware; Artificial intelligence","score_opus":0.05196156630285464,"score_gpt":0.30629215989859265,"score_spread":0.254330593595738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171601837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004227829,0.000057874164,0.9894524,0.0016043175,0.000044145014,0.00037500777,0.0000031214317,0.00015613086,0.004079146],"genre_scores_gemma":[0.9454698,0.00006682101,0.053730886,0.0002605106,0.00012000976,0.0003020541,0.000018400857,0.000004682299,0.00002684341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998825,0.00006393671,0.00034779208,0.0004012669,0.00022153191,0.00014043075],"domain_scores_gemma":[0.9993516,0.00010535136,0.00011184473,0.00027703284,0.00012119721,0.000032939723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003020431,0.00012159951,0.0001029453,0.00014967994,0.00020603849,0.0002718154,0.00046386634,0.00004777946,0.000006035687],"category_scores_gemma":[0.0000107428905,0.00010519032,0.000029045337,0.00029017264,0.00009923297,0.00013848174,0.000084230545,0.00015230487,0.000023525257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004789174,0.00010160624,0.0005765711,0.0000030712572,0.0000035397286,8.760737e-7,0.00009331506,0.0016945455,0.00008743628,0.90138304,0.000049221195,0.096002005],"study_design_scores_gemma":[0.00002539852,0.000032599914,0.0068749767,0.000011858905,0.0000028513084,0.000008336717,0.00009664593,0.5741165,0.00010129104,0.41756752,0.0010648065,0.00009717267],"about_ca_topic_score_codex":0.0001905223,"about_ca_topic_score_gemma":0.000082242674,"teacher_disagreement_score":0.941242,"about_ca_system_score_codex":0.000028283845,"about_ca_system_score_gemma":0.000025763533,"threshold_uncertainty_score":0.42895368},"labels":[],"label_agreement":null},{"id":"W1716855832","doi":"10.1007/10720115_12","title":"Efficient Communication Using Message Prediction for Cluster of Multiprocessors","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Uniprocessor system; Message passing; Overhead (engineering); Cache; User space; Message broker; Computer network; Locality; Copying; Parallel computing; Multiprocessing; Operating system","score_opus":0.021304963648798747,"score_gpt":0.2709031792857305,"score_spread":0.24959821563693174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1716855832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033884952,0.0003345948,0.99680024,0.0001320935,0.0003166882,0.0006552848,0.000011822725,0.00023127523,0.0011791331],"genre_scores_gemma":[0.1829081,0.000048819453,0.81665003,0.0002116222,0.00007578686,0.000011195107,0.000009578164,0.000023652561,0.000061212995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975194,0.000047769587,0.0006451273,0.0008596517,0.000568934,0.00035911755],"domain_scores_gemma":[0.99747276,0.0003968799,0.0004636457,0.0012024139,0.0003896675,0.00007465779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010418488,0.00033287736,0.00042396277,0.00073005137,0.0002765835,0.00017329783,0.0022981875,0.00027818314,0.00000534608],"category_scores_gemma":[0.00007003838,0.0003239115,0.00012622678,0.00046855333,0.00042333236,0.00020814574,0.00059249485,0.0003467246,0.000001828255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009106849,0.000028226292,0.00000899483,0.000037808724,0.000005469494,5.017109e-7,0.00047978174,0.89988387,0.000044534816,0.0023607777,0.00000777926,0.09713313],"study_design_scores_gemma":[0.00028829166,0.000090531845,0.00001615287,0.0004933831,0.000009105327,0.0000120053,8.9645056e-8,0.9670106,0.0015574791,0.030045614,0.00019935967,0.00027738733],"about_ca_topic_score_codex":0.000016521808,"about_ca_topic_score_gemma":0.0000045031034,"teacher_disagreement_score":0.18256925,"about_ca_system_score_codex":0.00019664265,"about_ca_system_score_gemma":0.00029119977,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W1723577572","doi":"10.1109/async.1997.587143","title":"Self-timed meshes are faster than synchronous","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon mesh; Computer science; Parallel computing; Bounded function; Constant (computer programming); Mathematics; Computer graphics (images)","score_opus":0.015762426224305643,"score_gpt":0.22112418118975183,"score_spread":0.20536175496544617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1723577572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084960216,0.00015315703,0.9301939,0.0010723061,0.0001033787,0.00009720631,2.3427543e-7,0.002302247,0.06522799],"genre_scores_gemma":[0.49569726,0.00003527926,0.50028354,0.00052754546,0.000038565013,0.000007192875,3.6672904e-7,0.000006848293,0.0034034192],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.0000442177,0.00015079496,0.00028451794,0.00015950746,0.00022191447],"domain_scores_gemma":[0.9993142,0.00004038085,0.000066836845,0.00045101246,0.00005618551,0.00007141444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096594595,0.000115459035,0.00012410346,0.00007887903,0.00010510338,0.00016251016,0.000646174,0.000052457144,0.00011711701],"category_scores_gemma":[0.000011999978,0.00009701463,0.000050644874,0.00022386751,0.000015150568,0.00026454314,0.00018277424,0.00007122976,0.0002875995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009086877,0.0019998853,0.015815679,0.00019267753,0.0003114137,0.00020906844,0.011685313,0.010639027,0.00020664219,0.11984224,0.5878381,0.25125083],"study_design_scores_gemma":[0.0001415261,0.00005134719,0.0005084262,0.000012522258,0.0000027642682,0.000018815546,0.00001034502,0.98743474,0.001330381,0.0005174793,0.009771318,0.00020031692],"about_ca_topic_score_codex":0.0000059757003,"about_ca_topic_score_gemma":0.0000021009312,"teacher_disagreement_score":0.97679573,"about_ca_system_score_codex":0.000025070478,"about_ca_system_score_gemma":0.000007542273,"threshold_uncertainty_score":0.39561418},"labels":[],"label_agreement":null},{"id":"W1733448862","doi":"10.1007/978-3-319-08311-7_8","title":"Parallelism in Ada: Status and Prospects","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Compiler; Programming language; Parallelism (grammar); Notation; Parallel computing; Data parallelism; Task parallelism; Parallel programming model; Computation; Programming paradigm","score_opus":0.012497292552085653,"score_gpt":0.24030414496598188,"score_spread":0.22780685241389623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1733448862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013851283,0.0008089641,0.99323,0.00047215918,0.0004947655,0.00037452762,0.000001011375,0.00031392532,0.004166147],"genre_scores_gemma":[0.23186131,0.0002933024,0.7659079,0.0012603274,0.0002035445,0.000011829819,0.000003428978,0.000032244934,0.00042612458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966562,0.000046547153,0.00050021405,0.0014571975,0.00061716116,0.00072272855],"domain_scores_gemma":[0.99814624,0.00029319787,0.0002410908,0.000992745,0.00014026421,0.00018646337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082314544,0.00045759074,0.00054022035,0.00096495386,0.00015455115,0.0004820915,0.0017623866,0.00029909733,0.000005318664],"category_scores_gemma":[0.00009433428,0.00043294538,0.000058341397,0.000537997,0.00045732633,0.00032576302,0.0012629775,0.00071918214,0.000011308546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007271731,0.000032780932,0.00083191897,0.000066006025,0.000007000513,0.00009057485,0.0011789656,0.10557184,0.000019688094,0.15197809,0.00007427389,0.7401416],"study_design_scores_gemma":[0.00033829123,0.00015804266,0.0009507952,0.00038039454,0.000002386219,0.00003505097,5.6717003e-8,0.78466105,0.00017540036,0.21041128,0.002247276,0.00063995615],"about_ca_topic_score_codex":0.00004830186,"about_ca_topic_score_gemma":0.00009682934,"teacher_disagreement_score":0.7395016,"about_ca_system_score_codex":0.0002228294,"about_ca_system_score_gemma":0.00034628806,"threshold_uncertainty_score":0.99981225},"labels":[],"label_agreement":null},{"id":"W17338413","doi":"","title":"Distributed Models of Thread Level Speculation.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"","keywords":"Speculation; Computer science; Speculative multithreading; Thread (computing); Parallel computing; Exploit; Multithreading; Distributed computing; Task parallelism; Operating system; Parallelism (grammar); Computer security","score_opus":0.03433359730238873,"score_gpt":0.283452634085353,"score_spread":0.24911903678296426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17338413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003123923,0.0014817546,0.99511147,0.0009390841,0.0000032550756,0.00032262647,0.00011618369,0.0007256673,0.0009875874],"genre_scores_gemma":[0.50233436,0.00039413932,0.4968941,0.000045611567,0.000035446134,0.00013177325,0.00012889133,0.0000066391453,0.000029035498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988987,0.00002192661,0.00035974113,0.0003776197,0.00014603206,0.00019598292],"domain_scores_gemma":[0.9991476,0.000036876274,0.00020796624,0.00031519632,0.00019316058,0.00009917961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128777,0.00017137865,0.00021299478,0.00008701266,0.00028356627,0.00013738837,0.00033851905,0.000101682075,0.000001598095],"category_scores_gemma":[0.000007909859,0.00015992463,0.00003611729,0.0004151928,0.00012659503,0.000456253,0.00019531295,0.00010665986,7.6707414e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013438913,0.00024728655,0.00050264917,0.000121740995,0.000017256103,0.0000010490529,0.00019051057,0.0128987115,0.00019487405,0.5882388,0.0013131641,0.39626053],"study_design_scores_gemma":[0.00036569085,0.00005836946,0.00065410073,0.000096022275,0.000023653203,0.000057039495,0.000021713864,0.7689244,0.003159457,0.19492897,0.03126926,0.0004413205],"about_ca_topic_score_codex":0.000016179027,"about_ca_topic_score_gemma":0.0000015279348,"teacher_disagreement_score":0.7560257,"about_ca_system_score_codex":0.000021268832,"about_ca_system_score_gemma":0.000045024513,"threshold_uncertainty_score":0.65215373},"labels":[],"label_agreement":null},{"id":"W1753157579","doi":"10.1007/11428831_20","title":"Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Oak Ridge National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; UT-Battelle; Battelle; National Science Foundation","keywords":"Tensor contraction; Contraction (grammar); Cartesian tensor; Minification; Tensor (intrinsic definition); Associative property; Commutative property; Computer science; Mathematics; Algebra over a field; Mathematical optimization; Tensor product; Pure mathematics; Mathematical analysis; Tensor field; Tensor density; Exact solutions in general relativity","score_opus":0.010898472698423192,"score_gpt":0.2652719437438985,"score_spread":0.2543734710454753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1753157579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005837077,0.00022665811,0.99699277,0.00042568482,0.00032649175,0.0004758745,0.0000072109437,0.00048169462,0.00047991637],"genre_scores_gemma":[0.59699583,0.000068092595,0.40243435,0.00024172985,0.00011279212,0.000007300646,0.000031304007,0.000019964351,0.00008862308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972612,0.000073270814,0.0007355066,0.00089987123,0.0005798707,0.00045026184],"domain_scores_gemma":[0.9981731,0.00023276245,0.00044323088,0.00074381666,0.00033294098,0.000074128024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039493514,0.00035413494,0.00043878067,0.0012009435,0.00018017371,0.00019251897,0.0011687706,0.00039284982,0.000023591156],"category_scores_gemma":[0.000111796064,0.0003400749,0.00007549855,0.00076307246,0.00020236183,0.00071794237,0.00028361115,0.0006065562,0.0000034565526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039818556,0.000030169469,0.00007785299,0.000011290459,0.0000047342046,0.0000033365666,0.00032590618,0.9399699,0.00066938996,0.009303284,0.000026077985,0.04957407],"study_design_scores_gemma":[0.00028003324,0.00006855788,0.00089144625,0.00024547265,0.000005365473,0.000019475205,1.4761937e-7,0.98323905,0.003321438,0.011307796,0.00029139372,0.00032980138],"about_ca_topic_score_codex":0.000031882315,"about_ca_topic_score_gemma":0.00015112468,"teacher_disagreement_score":0.5964121,"about_ca_system_score_codex":0.0004250048,"about_ca_system_score_gemma":0.0006334125,"threshold_uncertainty_score":0.9999051},"labels":[],"label_agreement":null},{"id":"W1773424846","doi":"10.48550/arxiv.1005.1695","title":"CrystalGPU: Transparent and Efficient Utilization of GPU Power","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; General-purpose computing on graphics processing units; CUDA; Power (physics); Computational science; Computer graphics (images); Graphics; Physics","score_opus":0.07587969116579776,"score_gpt":0.21267636651027044,"score_spread":0.13679667534447268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1773424846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18397705,0.00006971694,0.8140407,0.0000326155,0.0002146657,0.00016852448,0.0000065349523,0.00023857034,0.0012515896],"genre_scores_gemma":[0.98594695,0.0001427002,0.013733603,0.000022741548,0.000009881371,4.0499228e-7,0.000007963421,0.000009369727,0.0001263731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881136,0.00007960539,0.00020159458,0.00064754265,0.00008663225,0.0001732696],"domain_scores_gemma":[0.99875027,0.000048143476,0.00023699745,0.0006936581,0.000176856,0.00009409331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002007067,0.00019641286,0.00025118398,0.00023507066,0.00008452777,0.00005436234,0.0008096347,0.00025037717,0.000011802918],"category_scores_gemma":[0.000018479055,0.00022072923,0.00009438931,0.00031979466,0.00011140847,0.00008470847,0.00069678854,0.0003374964,0.0000021059345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013771156,0.0001280669,0.00059709104,0.000077903554,0.000027961016,0.000019776024,0.000517978,0.88257587,0.00016283826,0.11507209,0.00008638654,0.00072024507],"study_design_scores_gemma":[0.00021397228,0.000045207664,0.0013338163,0.00007623953,0.000020923153,0.0000024373967,0.000013462216,0.9904067,0.0010859964,0.0063646436,0.00019717592,0.000239451],"about_ca_topic_score_codex":0.000032190866,"about_ca_topic_score_gemma":0.0000053717317,"teacher_disagreement_score":0.80196995,"about_ca_system_score_codex":0.000035805413,"about_ca_system_score_gemma":0.00008879928,"threshold_uncertainty_score":0.9001076},"labels":[],"label_agreement":null},{"id":"W1783202385","doi":"10.1007/978-3-540-75187-8_23","title":"Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Monomial; Lexicographical order; Computer science; Bounded function; Quotient; Amortized analysis; Polynomial; Data structure; Discrete mathematics; Mathematics; Algorithm; Combinatorics; Programming language","score_opus":0.023608894438104884,"score_gpt":0.27824144387327654,"score_spread":0.25463254943517166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1783202385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015340107,0.00068298867,0.9950991,0.00023515546,0.0012746848,0.0003356494,0.0000025947102,0.0003902082,0.0004455795],"genre_scores_gemma":[0.25978923,0.00008201822,0.73936754,0.0004624594,0.00018047738,0.0000018019697,0.000005060172,0.000035196234,0.00007623176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631196,0.000047093938,0.000585291,0.0015260351,0.00083006575,0.00069955544],"domain_scores_gemma":[0.99792916,0.0003073323,0.00033758188,0.0010259445,0.00017012411,0.00022985933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010408094,0.00056234753,0.0005406879,0.0011618759,0.00040385342,0.00056055357,0.0018255679,0.0003725738,0.0000053799363],"category_scores_gemma":[0.000060052396,0.0005344814,0.0001083227,0.0005554778,0.0005869491,0.0005052891,0.0014729259,0.00070268655,0.0000059641875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001678527,0.00006225551,0.00024705977,0.000061968014,0.000021083999,0.00013047562,0.001140941,0.14233081,0.00095444283,0.0022994184,0.00008437492,0.8526504],"study_design_scores_gemma":[0.00022591405,0.0001465606,0.0002142374,0.00039574364,0.0000058160085,0.00006860618,1.4830525e-7,0.9875426,0.0011358731,0.009121778,0.0004663112,0.0006763804],"about_ca_topic_score_codex":0.00004289706,"about_ca_topic_score_gemma":0.000029499142,"teacher_disagreement_score":0.851974,"about_ca_system_score_codex":0.0004174816,"about_ca_system_score_gemma":0.000324736,"threshold_uncertainty_score":0.9997107},"labels":[],"label_agreement":null},{"id":"W18002896","doi":"10.1007/978-1-4615-0351-4_18","title":"Automatic Porting of Binary File Descriptor Library","year":2003,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Porting; Suite; Computer science; Software; Interface (matter); Operating system; Software engineering; Binary number; Simple (philosophy); Programming language; Geography; Archaeology","score_opus":0.00790768572726867,"score_gpt":0.20024714866337787,"score_spread":0.1923394629361092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18002896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009725087,0.00054294465,0.93182504,0.0006253928,0.0033276358,0.00030230894,0.00006422638,0.0010745334,0.061265428],"genre_scores_gemma":[0.01667647,0.00022391694,0.96423024,0.0002978262,0.00015470308,0.000016062724,0.0000338381,0.000044839304,0.018322088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832153,0.000008923889,0.00049447647,0.00051145966,0.0004323868,0.00023123814],"domain_scores_gemma":[0.999132,0.00007453341,0.00023636458,0.00037159785,0.000103098704,0.00008240545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002631673,0.0002476199,0.00027905664,0.0006462803,0.00006544554,0.00024024968,0.0013705752,0.00010110309,0.00012510792],"category_scores_gemma":[0.000040395822,0.00025978367,0.00005793947,0.00022775138,0.00017545963,0.0011154553,0.0008198138,0.00022872009,0.0000024990231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007200985,0.00007919156,0.00019141483,0.00028433278,0.00007341053,0.00012586819,0.0008754385,0.08536067,0.00021699107,0.83319885,0.01836222,0.06122439],"study_design_scores_gemma":[0.000085441476,0.000072892624,0.00030975603,0.00057653774,0.000002246357,0.0000705102,0.0000014478537,0.9679162,0.00031990398,0.002888165,0.027447166,0.0003097162],"about_ca_topic_score_codex":0.0000024082362,"about_ca_topic_score_gemma":1.6545441e-7,"teacher_disagreement_score":0.88255554,"about_ca_system_score_codex":0.0000562181,"about_ca_system_score_gemma":0.000109596076,"threshold_uncertainty_score":0.99998546},"labels":[],"label_agreement":null},{"id":"W1802230","doi":"10.1007/978-3-642-33518-1_22","title":"An Integrated Runtime Scheduler for MPI","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Runtime system; Message Passing Interface; Code (set theory); Scheduling (production processes); Middleware (distributed applications); Operating system; Message passing; Distributed computing; Programming language; Set (abstract data type)","score_opus":0.02088466653682655,"score_gpt":0.2741662488557546,"score_spread":0.25328158231892806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1802230","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001705548,0.0004905927,0.99534136,0.0003210485,0.001212426,0.0005826323,0.0000077815275,0.00078160316,0.0012454849],"genre_scores_gemma":[0.03313572,0.000034053683,0.96474695,0.0011548195,0.0005120868,0.000022631188,0.000024586578,0.000047099133,0.00032203886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653554,0.00004562046,0.0005410205,0.0014312473,0.00063154637,0.00081502704],"domain_scores_gemma":[0.9969662,0.00031494955,0.00031646586,0.0016275943,0.0005115199,0.00026327797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013100791,0.000571408,0.00054546836,0.0009026185,0.00033540736,0.0006894627,0.0040366556,0.00043862092,0.00002530626],"category_scores_gemma":[0.00008611707,0.0005159623,0.00015210485,0.00058508816,0.00042976352,0.0010055271,0.0006860904,0.0006480227,0.000037146896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008309073,0.00007078144,0.000035203528,0.000029352743,0.0000133321255,0.0000073877914,0.0004539249,0.07147172,0.000114318056,0.0428441,0.00013326068,0.8848183],"study_design_scores_gemma":[0.0002207815,0.00023987022,0.000031404597,0.00019368996,0.0000083580435,0.000026773172,7.9000124e-8,0.9231653,0.0020583025,0.06501795,0.008313333,0.0007241578],"about_ca_topic_score_codex":0.000013756494,"about_ca_topic_score_gemma":0.00001077284,"teacher_disagreement_score":0.8840941,"about_ca_system_score_codex":0.00023622806,"about_ca_system_score_gemma":0.00050685584,"threshold_uncertainty_score":0.9997292},"labels":[],"label_agreement":null},{"id":"W18104785","doi":"10.1007/978-3-642-36424-2_12","title":"Inter-warp Instruction Temporal Locality in Deep-Multithreaded GPUs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Locality; Parallel computing; Cache; Locality of reference; Control flow; Throughput; Filter (signal processing); Instruction set; Multithreading; Multi-core processor; Thread (computing); Operating system; Programming language","score_opus":0.018829069990696473,"score_gpt":0.25395316613583707,"score_spread":0.2351240961451406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W18104785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034696952,0.00018810814,0.9940185,0.00046679442,0.0014852624,0.00051579793,0.0000014694161,0.00050372974,0.0024733443],"genre_scores_gemma":[0.30635047,0.000035098703,0.6924301,0.00069526583,0.00021608191,0.000016920629,0.000008058,0.000030109863,0.00021793919],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595785,0.00008642015,0.0008460135,0.001674305,0.00074669,0.0006887461],"domain_scores_gemma":[0.9975005,0.0002141787,0.00041280317,0.0013980678,0.00029778463,0.00017670152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093166775,0.0005885919,0.00063679024,0.0012786018,0.00018359133,0.0006172224,0.0030864947,0.00048493998,0.000029352279],"category_scores_gemma":[0.00010162875,0.00055986614,0.00012851831,0.00090557337,0.00062103826,0.00092491746,0.001411256,0.0011022112,0.00006800157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006993933,0.00005306033,0.0006737225,0.000040214432,0.0000076064894,0.000049117436,0.0007125577,0.0969273,0.000022494976,0.0077205645,0.00005231939,0.89373404],"study_design_scores_gemma":[0.00036954717,0.00011698861,0.00031707858,0.00035430098,0.0000025127588,0.00005815085,2.5083193e-7,0.9002389,0.00081481604,0.096499115,0.0005993831,0.0006289719],"about_ca_topic_score_codex":0.0002747607,"about_ca_topic_score_gemma":0.00026867288,"teacher_disagreement_score":0.8931051,"about_ca_system_score_codex":0.00055072847,"about_ca_system_score_gemma":0.00036707104,"threshold_uncertainty_score":0.9996853},"labels":[],"label_agreement":null},{"id":"W1815597787","doi":"10.1109/mm.2015.71","title":"Achieving Exascale Capabilities through Heterogeneous Computing","year":2015,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Exascale computing; Computer science; Supercomputer; Symmetric multiprocessor system; Computer architecture; Software; Efficient energy use; Parallel computing; Distributed computing; Embedded system; Operating system","score_opus":0.038072704502940986,"score_gpt":0.2769949186668803,"score_spread":0.23892221416393933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1815597787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14113316,0.00039683026,0.8542348,0.0002463297,0.00056311104,0.00009879959,9.982425e-7,0.00088692916,0.002439043],"genre_scores_gemma":[0.623486,0.0000073763013,0.37564078,0.00047836907,0.00012110797,0.000002506259,0.0000013216157,0.000011532599,0.0002510363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987299,0.00011105473,0.00026124206,0.00037887393,0.00019341729,0.00032551325],"domain_scores_gemma":[0.99907017,0.00008579446,0.000096084834,0.0005178309,0.00013227391,0.00009782472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000338522,0.00016017657,0.00018925995,0.000059053724,0.00015224595,0.00020238647,0.000799255,0.00006870783,0.0000027146561],"category_scores_gemma":[0.000040529514,0.00015824413,0.00007148444,0.00022135887,0.00006466861,0.00029436586,0.00023136756,0.00013048416,0.000054700722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050425628,0.00080764445,0.008648654,0.00023236741,0.00020704485,0.00025598143,0.07135431,0.61698693,0.047170967,0.016319662,0.16708836,0.070877664],"study_design_scores_gemma":[0.0013569302,0.00045211634,0.0002706045,0.00020501528,0.000018674851,0.00061598996,0.00028872752,0.5803214,0.35520586,0.011557701,0.048090674,0.0016163539],"about_ca_topic_score_codex":0.00007540869,"about_ca_topic_score_gemma":0.0000024257104,"teacher_disagreement_score":0.48235282,"about_ca_system_score_codex":0.000074345364,"about_ca_system_score_gemma":0.00006877632,"threshold_uncertainty_score":0.6453008},"labels":[],"label_agreement":null},{"id":"W1819272977","doi":"10.1007/978-3-642-32820-6_23","title":"A Practical Approach to DOACROSS Parallelization","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Automatic parallelization; Parallel computing; Compiler; Multi-core processor; Thread (computing); Synchronization (alternating current); Task parallelism; Nested loop join; Parallelism (grammar); Programming language","score_opus":0.03802015673996617,"score_gpt":0.30408009226269583,"score_spread":0.26605993552272966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819272977","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000043985333,0.00020763607,0.98447824,0.0009712522,0.00072998094,0.0005349498,0.0000018490865,0.0005610397,0.012510653],"genre_scores_gemma":[0.0264186,0.00004367261,0.9705667,0.0020924748,0.00043773436,0.000020302663,0.000008437053,0.000034934175,0.00037713425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961272,0.000057430512,0.00053965853,0.0014659677,0.0009930739,0.00081670494],"domain_scores_gemma":[0.9973718,0.00026986082,0.00026857157,0.001420019,0.00032435762,0.00034537265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012345802,0.0005067012,0.00048408433,0.0008041695,0.00030304282,0.00076095015,0.002496429,0.00037703957,0.000009141817],"category_scores_gemma":[0.0001711946,0.0004754352,0.00010870464,0.0008826806,0.00030863358,0.0008057523,0.0016425131,0.0007045834,0.000092065544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009852092,0.00015520956,0.00004831546,0.00004686061,0.000014450019,0.000022925966,0.0016139451,0.32188317,0.000031728057,0.19998662,0.0007732887,0.47541362],"study_design_scores_gemma":[0.00016622087,0.000117261174,0.00005993195,0.00014585155,0.000007039905,0.0001318482,1.0620932e-7,0.94805354,0.00048033652,0.041421533,0.008592715,0.0008236143],"about_ca_topic_score_codex":0.000011487979,"about_ca_topic_score_gemma":0.000004798055,"teacher_disagreement_score":0.6261704,"about_ca_system_score_codex":0.00028054867,"about_ca_system_score_gemma":0.0004613608,"threshold_uncertainty_score":0.99976975},"labels":[],"label_agreement":null},{"id":"W1819910853","doi":"10.1109/hicss.1997.663170","title":"Performance-power optimization of memory components for complex embedded systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Computation; Power (physics); Component (thermodynamics); Design flow; Memory management; Minimum-cost flow problem; Distributed computing; Parallel computing; Embedded system; Flow network; Computer engineering; Mathematical optimization; Computer hardware; Algorithm; Semiconductor memory","score_opus":0.05073522614715661,"score_gpt":0.2551761359523939,"score_spread":0.2044409098052373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819910853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019130536,0.000047530808,0.9784695,0.0000755857,0.0002158239,0.00035019068,0.000001995028,0.0004335908,0.018492738],"genre_scores_gemma":[0.5766945,0.000017713774,0.42255008,0.000058468293,0.000013392735,0.000016550612,0.0000067365095,0.000006373901,0.0006361748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990159,0.000049981554,0.00033573978,0.00022564191,0.00019182017,0.00018090697],"domain_scores_gemma":[0.99912226,0.00007356829,0.00016276089,0.00037435992,0.00021799616,0.000049082268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024501825,0.000112203794,0.00019902657,0.00012821272,0.00010863853,0.00006168573,0.0005250132,0.00005336095,0.00006208057],"category_scores_gemma":[0.000018940565,0.00010220508,0.00005506049,0.00022697907,0.000030099634,0.00026923761,0.00009153223,0.00003879068,0.00000938311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041028015,0.00008947368,0.00008718469,0.000046699915,0.00001318648,2.1559892e-7,0.00027641893,0.98407423,0.0002573141,0.0028549568,0.010871569,0.001424645],"study_design_scores_gemma":[0.0003304744,0.00010098409,0.0000999513,0.000024067815,0.000002882577,0.0000044868934,0.000012073016,0.9979404,0.00081644976,0.000014368112,0.00052788,0.0001259858],"about_ca_topic_score_codex":0.000006222851,"about_ca_topic_score_gemma":7.1949714e-8,"teacher_disagreement_score":0.5747815,"about_ca_system_score_codex":0.000021209218,"about_ca_system_score_gemma":0.000007569309,"threshold_uncertainty_score":0.4167802},"labels":[],"label_agreement":null},{"id":"W1830619643","doi":"","title":"SableVM: a research framework for the efficient execution of java bytecode","year":2001,"lang":"sv","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bytecode; Computer science; Programming language; Java; Java bytecode; Interpreter; Interface (matter); Garbage collection; Virtual machine; Java annotation; Table (database); Operating system; Generics in Java; Real time Java; Database; Garbage","score_opus":0.09813452217089255,"score_gpt":0.3898301488613398,"score_spread":0.29169562669044724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830619643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009485112,0.0013168586,0.98485184,0.0048032943,0.00045777488,0.00095083204,0.0000054461675,0.00022897273,0.0064364467],"genre_scores_gemma":[0.5072457,0.00055171957,0.48867664,0.00023047585,0.00018591856,0.000059034355,0.0000018288413,0.000016821008,0.0030318615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972247,0.00031590203,0.0005265649,0.00053984526,0.00073235016,0.0006606506],"domain_scores_gemma":[0.99471945,0.002916419,0.00019398825,0.0011370562,0.00093792134,0.0000951712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037978345,0.00018353462,0.00025076495,0.00024654457,0.00071541034,0.00025813997,0.001650827,0.00022231946,0.000099371224],"category_scores_gemma":[0.0008221702,0.0001312365,0.00015964433,0.0016644892,0.00028990317,0.000091562004,0.00050919363,0.00044022253,0.00004007744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010352281,0.00043854417,0.000097485085,0.0000753941,0.000055594683,0.0000031677992,0.0019884582,0.22210975,0.00018271743,0.6857253,0.03198971,0.05723041],"study_design_scores_gemma":[0.00020634623,0.00029886502,0.00025547144,0.00018268693,0.000011309851,0.000008210973,0.00015330354,0.9624198,0.0034516135,0.020200001,0.012651063,0.0001613077],"about_ca_topic_score_codex":0.0001673591,"about_ca_topic_score_gemma":0.000005524279,"teacher_disagreement_score":0.7403101,"about_ca_system_score_codex":0.00008792519,"about_ca_system_score_gemma":0.00022376182,"threshold_uncertainty_score":0.550243},"labels":[],"label_agreement":null},{"id":"W1837798711","doi":"10.1109/tpds.2014.2329688","title":"Parallel Application Signature for Performance Analysis and Prediction","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad; Mountain Equipment Co-operative","keywords":"Computer science; Signature (topology); Message passing; Performance prediction; Parallel computing; Supercomputer; Parallel processing; Distributed computing; Data mining; Simulation","score_opus":0.009504642863838113,"score_gpt":0.2248824556128849,"score_spread":0.21537781274904677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837798711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026167603,0.00015216529,0.9957832,0.00016795579,0.00015981027,0.0004942061,0.00012944103,0.00041960884,0.00007684845],"genre_scores_gemma":[0.9748625,0.00014325736,0.024322249,0.00005380832,0.000036906782,0.00030962392,0.00009695292,0.000008546878,0.00016613863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871236,0.000082262784,0.00031819506,0.0004949486,0.00017405294,0.00021816308],"domain_scores_gemma":[0.99911714,0.00013438893,0.00013321284,0.0003697918,0.00012415058,0.00012131244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034628707,0.00018897427,0.00028120156,0.00021518751,0.000410193,0.00018085624,0.0001993287,0.0001583272,9.424496e-7],"category_scores_gemma":[0.0000055171313,0.0001725646,0.00008657465,0.0005600459,0.000045972934,0.00025568236,0.0000035824728,0.00013712094,0.0000025584593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003390661,0.000057292797,0.0002846666,0.000056146622,0.000110633926,1.168626e-7,0.000059710113,0.9869576,0.00007460297,0.0014412015,0.0003097856,0.010614312],"study_design_scores_gemma":[0.0005239001,0.0001805876,0.0013640024,0.000019450452,0.00010395086,0.00000782641,0.000012668002,0.99562466,0.00011955346,0.0001741289,0.0016860756,0.00018320078],"about_ca_topic_score_codex":0.00003755372,"about_ca_topic_score_gemma":0.000007372912,"teacher_disagreement_score":0.97224575,"about_ca_system_score_codex":0.000029717032,"about_ca_system_score_gemma":0.000015867572,"threshold_uncertainty_score":0.70369804},"labels":[],"label_agreement":null},{"id":"W1838450684","doi":"10.1002/spe.2396","title":"Cold object identification in the Java virtual machine","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; IBM (Canada)","funders":"Atlantic Canada Opportunities Agency; International Business Machines Corporation","keywords":"Heap (data structure); Computer science; Java; Correctness; Marshalling; Programming language; Operating system; Stack (abstract data type)","score_opus":0.014006271210751988,"score_gpt":0.28875143193738834,"score_spread":0.27474516072663635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1838450684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011225525,0.00026846546,0.9839279,0.0038700376,0.00010371809,0.000120135875,8.1725346e-7,0.00020631416,0.00027707894],"genre_scores_gemma":[0.94569993,0.00028298213,0.052510794,0.0012737716,0.000021335733,0.00004769602,4.9655205e-7,0.0000037925806,0.0001591755],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898916,0.00017706421,0.00018188181,0.00028772102,0.00021163888,0.00015251475],"domain_scores_gemma":[0.99860406,0.00078551803,0.00011364936,0.00039687028,0.00006831582,0.00003160607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594785,0.000083263905,0.00007072678,0.000058580466,0.00015765861,0.00020099123,0.0005850238,0.00003638495,0.000003743036],"category_scores_gemma":[0.001163965,0.000049215832,0.000015935175,0.00029950833,0.000073638985,0.0014078611,0.0001284692,0.00008183556,0.0000178192],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010317836,0.00058453094,0.012390419,0.000022839038,0.000023223727,0.000121177436,0.10690702,0.0002394401,0.008332423,0.20849052,0.0063135205,0.6564717],"study_design_scores_gemma":[0.006510344,0.002803617,0.06673885,0.00091482495,0.00008198697,0.0020049028,0.020830872,0.087343186,0.11002294,0.030586129,0.66727936,0.0048830095],"about_ca_topic_score_codex":0.00005457811,"about_ca_topic_score_gemma":0.0000047706662,"teacher_disagreement_score":0.9344744,"about_ca_system_score_codex":0.000018760784,"about_ca_system_score_gemma":0.000030280968,"threshold_uncertainty_score":0.20069633},"labels":[],"label_agreement":null},{"id":"W183904622","doi":"","title":"Proceedings of the 17th international conference on Parallel architectures and compilation techniques","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Session (web analytics); Architecture; Period (music); Library science; Operations research; Programming language; World Wide Web; History; Engineering","score_opus":0.028312982290330392,"score_gpt":0.259754524376346,"score_spread":0.2314415420860156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W183904622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055065233,0.00001244207,0.8074393,0.0032878793,0.00008072031,0.0002725539,0.0000016822164,0.00058444164,0.13325569],"genre_scores_gemma":[0.7828494,0.000027872135,0.21659192,0.0002351004,0.000013642657,0.0000054559464,4.3760383e-7,0.000002308866,0.000273895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941796,0.00001042023,0.00013806872,0.00016709004,0.0001933802,0.000073053365],"domain_scores_gemma":[0.99961144,0.000022832792,0.00009754093,0.00011110537,0.0001360906,0.000020988993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009367731,0.000073753654,0.000078755525,0.00007497084,0.00009804069,0.000036857175,0.0005131386,0.000032190037,0.0000042760257],"category_scores_gemma":[0.000020595486,0.000048115526,0.00002521567,0.00012350868,0.00009308153,0.0000804032,0.00017870945,0.000082721905,6.0934553e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019770183,0.00009830644,0.014969225,0.000012767303,0.000017176762,7.420352e-7,0.0014467265,0.0008739021,0.002486617,0.9587912,0.0075082975,0.013775286],"study_design_scores_gemma":[0.00047953308,0.0003407371,0.10920464,0.00017527299,0.0000048679144,0.00014434494,0.000039584556,0.6873317,0.13085291,0.068931535,0.002051513,0.00044339735],"about_ca_topic_score_codex":0.000007767941,"about_ca_topic_score_gemma":6.26536e-7,"teacher_disagreement_score":0.8898597,"about_ca_system_score_codex":0.000009155992,"about_ca_system_score_gemma":0.00001868505,"threshold_uncertainty_score":0.19620942},"labels":[],"label_agreement":null},{"id":"W1839773802","doi":"10.1145/2818311","title":"KBLAS","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Nvidia; University of Pennsylvania","keywords":"Computer science; Parallel computing; Speedup; CUDA; Matrix multiplication; Supercomputer; Linear algebra; General-purpose computing on graphics processing units; Overhead (engineering); Multiplication (music); Graphics; Mathematics; Programming language; Operating system","score_opus":0.022416727862066825,"score_gpt":0.26374912844059584,"score_spread":0.241332400578529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839773802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011423688,0.0000046717623,0.97983503,0.01817439,0.000051178416,0.000093970426,0.0000020254947,0.0015444952,0.00018002378],"genre_scores_gemma":[0.024613285,0.000007121101,0.9717547,0.0026053633,0.000018017548,0.000028344775,2.0205506e-7,0.00001131434,0.0009616287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990606,0.000043061882,0.0001923747,0.000265063,0.00022092987,0.0002179702],"domain_scores_gemma":[0.9982997,0.0006484284,0.00003789026,0.00087778963,0.000055837445,0.00008036282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012724086,0.00011994057,0.00012854024,0.00008302824,0.00014371655,0.000058550875,0.00087519427,0.00008261815,0.00019165053],"category_scores_gemma":[0.00022252911,0.00007616534,0.000086683074,0.00021589646,0.000046608846,0.00022615877,0.000019273453,0.00011586328,0.0006322201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004453053,0.00019509172,0.000014799965,0.000022606122,0.000023475377,0.000012109865,0.0001366681,0.0003256588,0.00008385173,0.010942501,0.0011719315,0.98706686],"study_design_scores_gemma":[0.00028644106,0.0001301755,0.00004066233,0.00011955407,0.0000074303452,0.00003536109,0.000002877004,0.0020454854,0.009595603,0.98352575,0.0039556767,0.00025495343],"about_ca_topic_score_codex":5.4571217e-7,"about_ca_topic_score_gemma":1.3164757e-7,"teacher_disagreement_score":0.9868119,"about_ca_system_score_codex":0.000033811502,"about_ca_system_score_gemma":0.000021544525,"threshold_uncertainty_score":0.8126122},"labels":[],"label_agreement":null},{"id":"W1843576360","doi":"10.1109/ipdpsw.2015.131","title":"On the Performance, Energy, and Power of Data-Access Methods in Heterogeneous Computing Systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Astellas Pharma US; Division of Industrial Innovation and Partnerships; Advanced Micro Devices","keywords":"Computer science; PCI Express; Overhead (engineering); Host (biology); Context (archaeology); Data access; Parallel computing; Embedded system; Operating system; Field-programmable gate array; Database","score_opus":0.09863759952872242,"score_gpt":0.37138823599197024,"score_spread":0.2727506364632478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843576360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023526164,0.00016400023,0.97185546,0.00010870591,0.00011370943,0.000068167,5.433312e-7,0.00010825475,0.004054973],"genre_scores_gemma":[0.7894784,0.000012908439,0.21024689,0.00020738003,0.0000074885634,0.0000016229181,0.0000011004204,0.000003574182,0.000040622985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990001,0.00024355148,0.00023658368,0.00024515693,0.00014827646,0.0001263593],"domain_scores_gemma":[0.99887466,0.00025792618,0.00010176145,0.0006585584,0.00006497445,0.00004210233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014170328,0.000082963226,0.00014785325,0.000097466145,0.00004313577,0.0001392653,0.0012838386,0.00003251378,0.0000011485807],"category_scores_gemma":[0.000043540527,0.000053023305,0.000010448861,0.00027308502,0.000033334625,0.00027770796,0.00097571424,0.000054011616,4.6831957e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022085982,0.00017045363,0.0032580073,0.000052457915,0.000046972218,0.000009837261,0.0016170181,0.6914125,0.00006993434,0.22274469,0.012059379,0.06853667],"study_design_scores_gemma":[0.0000889784,0.00006350928,0.00008267741,0.00002757462,8.8432876e-7,0.0000126815885,0.000012267444,0.9973434,0.0012746484,0.00032567157,0.00069714227,0.00007056478],"about_ca_topic_score_codex":0.00012092929,"about_ca_topic_score_gemma":0.0000028345848,"teacher_disagreement_score":0.7659522,"about_ca_system_score_codex":0.000014243169,"about_ca_system_score_gemma":0.00003143678,"threshold_uncertainty_score":0.2385713},"labels":[],"label_agreement":null},{"id":"W1848162185","doi":"10.1109/empdp.1996.500585","title":"Systematic assessment of the overhead of tracing parallel programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Apache (Canada)","funders":"","keywords":"Computer science; Generality; Overhead (engineering); Tracing; Parallel computing; Transient (computer programming); Computer engineering; Programming language; Distributed computing","score_opus":0.028405479759760793,"score_gpt":0.2734382376911343,"score_spread":0.2450327579313735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848162185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002166249,0.00013065188,0.9854025,0.00015759631,0.00005744124,0.00034801263,1.2157487e-7,0.00014681109,0.011590618],"genre_scores_gemma":[0.73308474,0.0000102578615,0.26651463,0.000028353948,0.0000031273632,0.00001090506,8.2879296e-8,0.0000023160262,0.0003455685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902546,0.00010233125,0.00037534456,0.00012668523,0.0002647602,0.00010542604],"domain_scores_gemma":[0.9990832,0.000063906424,0.00025002044,0.0005031864,0.000079023426,0.000020630234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030157762,0.00006951069,0.0002013138,0.00003930976,0.000042817417,0.000029064668,0.00066352193,0.000028686327,0.000007910751],"category_scores_gemma":[0.00002291962,0.00004170613,0.00008643446,0.00029976384,0.000031045125,0.00009875714,0.00012532357,0.00005378193,0.000001110694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031270301,0.0024023282,0.018418806,0.0218344,0.00032178275,0.000004807713,0.0063799894,0.116017394,0.0009059039,0.7969233,0.0043281154,0.032460056],"study_design_scores_gemma":[0.00009308961,0.00005347349,0.0006270528,0.0013631926,0.000006033889,0.0000043255745,0.0000146090115,0.99666256,0.0006795165,0.0004314225,0.000005454869,0.00005928869],"about_ca_topic_score_codex":0.000012242635,"about_ca_topic_score_gemma":0.000001146796,"teacher_disagreement_score":0.88064516,"about_ca_system_score_codex":0.000014486173,"about_ca_system_score_gemma":0.000014072594,"threshold_uncertainty_score":0.17007267},"labels":[],"label_agreement":null},{"id":"W1851113295","doi":"10.1007/11406921_22","title":"Using Inter-Procedural Side-Effect Information in JIT Optimizations","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Side effect (computer science); Static analysis; Compiler; Parallel computing; Just-in-time compilation; Heap (data structure); Execution time; Programming language","score_opus":0.018838015857023046,"score_gpt":0.2730569146381558,"score_spread":0.25421889878113274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851113295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006285293,0.00011574784,0.9933923,0.0005050479,0.0006591108,0.0005103434,0.0000026526698,0.00040435913,0.0043475917],"genre_scores_gemma":[0.0789526,0.000036505775,0.91916883,0.0014774249,0.00020743553,0.00001165312,0.000013667503,0.000024971094,0.00010693835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969935,0.000060517974,0.00080514327,0.00088674854,0.00065430265,0.0005997772],"domain_scores_gemma":[0.9979647,0.00030312125,0.00039206145,0.00094198517,0.000271403,0.00012672284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009562663,0.0005166432,0.0005167393,0.0019388006,0.00023404048,0.00078177004,0.002436567,0.00035258124,0.000014105937],"category_scores_gemma":[0.00018320976,0.0005026492,0.00011578436,0.0010762949,0.00029759438,0.0022610489,0.0011327047,0.000789626,0.00003304809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003113706,0.000010175896,0.000038331393,0.000021891748,0.0000031424413,0.000008190498,0.0004184754,0.78766006,0.000008687477,0.0027127864,0.000022263765,0.20909289],"study_design_scores_gemma":[0.00025940454,0.00010687418,0.000029476265,0.0004739208,0.0000043610153,0.000063137086,1.1517729e-7,0.98755366,0.0005090995,0.009802564,0.00067149947,0.0005259083],"about_ca_topic_score_codex":0.00003785496,"about_ca_topic_score_gemma":0.000041152838,"teacher_disagreement_score":0.20856698,"about_ca_system_score_codex":0.00061143294,"about_ca_system_score_gemma":0.0005166696,"threshold_uncertainty_score":0.9997425},"labels":[],"label_agreement":null},{"id":"W1858849203","doi":"10.1109/isqed.2005.126","title":"Two-Dimensional Layout Migration by Soft Constraint Satisfaction","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Compaction; Constraint (computer-aided design); Task (project management); Computer science; Process (computing); Computer engineering; Power (physics); Algorithm; Distributed computing; Parallel computing; Engineering; Mechanical engineering","score_opus":0.010595313547802427,"score_gpt":0.2519284542276211,"score_spread":0.24133314067981868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1858849203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014206951,0.00004635499,0.9780188,0.002547568,0.00008244047,0.00007726884,0.0000012571159,0.00079877075,0.004220582],"genre_scores_gemma":[0.61507076,0.0000021519909,0.3835131,0.0008780738,0.00003634414,0.0000035474789,0.0000061945484,0.0000029434416,0.0004868926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992445,0.000038314458,0.00017336322,0.00022757788,0.00017836444,0.00013785937],"domain_scores_gemma":[0.99957913,0.000043080076,0.00005955349,0.00019188962,0.000070522525,0.000055823482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015812537,0.000088138026,0.000075617834,0.00005702196,0.00010706669,0.000097460026,0.0001663941,0.00004064862,0.00006719851],"category_scores_gemma":[0.000014091561,0.00008041155,0.000031773427,0.00012232098,0.00002580071,0.00035512506,0.00005611118,0.00007239432,0.00008475058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007119981,0.00012848432,0.004048427,0.0000044086846,0.000023639952,0.0000022231668,0.00037917774,0.26780286,0.0070956573,0.084378295,0.25267455,0.38345516],"study_design_scores_gemma":[0.00019919599,0.000026885698,0.0005389223,0.000005349819,0.0000015338787,0.000016606115,0.0000037647137,0.98504376,0.009125615,0.0007604878,0.004138094,0.00013979305],"about_ca_topic_score_codex":0.00010759761,"about_ca_topic_score_gemma":0.000054117536,"teacher_disagreement_score":0.71724087,"about_ca_system_score_codex":0.000030715644,"about_ca_system_score_gemma":0.000036579335,"threshold_uncertainty_score":0.32790878},"labels":[],"label_agreement":null},{"id":"W1863515937","doi":"10.1109/ccece.1993.332333","title":"On the performance of a multi-threaded RISC architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pipeline (software); Computer science; Architecture; Parallel computing; Instruction set; Computer architecture; Context (archaeology); Reduced instruction set computing; Multithreading; Programming language; Thread (computing)","score_opus":0.029097350025647676,"score_gpt":0.2385622469116342,"score_spread":0.20946489688598652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863515937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026359424,0.00004036855,0.9585731,0.0012813307,0.00003562947,0.00009212548,2.1158768e-7,0.00026843572,0.013349393],"genre_scores_gemma":[0.82696694,0.00001768504,0.17060703,0.00050622463,0.000007511685,0.0000045155266,1.11750644e-7,0.0000027473432,0.0018872274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948764,0.00003858794,0.00010962954,0.00013251968,0.00012649992,0.00010512664],"domain_scores_gemma":[0.999409,0.00010117245,0.000050580467,0.00038678598,0.000032225515,0.000020215883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012212756,0.00006588717,0.000069146285,0.000049463026,0.00007526166,0.000025304675,0.00059151306,0.000025512218,0.00007830516],"category_scores_gemma":[0.000025751166,0.0000372182,0.00003249349,0.0002040591,0.000032359214,0.00004741068,0.00008184022,0.00009707391,0.000051010633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019357632,0.00093903026,0.0011867775,0.0000597991,0.00006513033,0.0000059832255,0.006044136,0.36571807,0.0014465711,0.3102413,0.09784578,0.21642807],"study_design_scores_gemma":[0.00008589886,0.000086015796,0.00018323724,0.0000131708475,6.0679645e-7,0.0000029564762,0.0000019165327,0.98702556,0.011543344,0.00039789794,0.000601783,0.00005758934],"about_ca_topic_score_codex":0.0000040431323,"about_ca_topic_score_gemma":5.617735e-7,"teacher_disagreement_score":0.8006075,"about_ca_system_score_codex":0.000005111607,"about_ca_system_score_gemma":0.0000039828315,"threshold_uncertainty_score":0.15177141},"labels":[],"label_agreement":null},{"id":"W1883550131","doi":"","title":"Adaptive Thread Management For Power, Temperature, And Reliability In Future Microprocessors","year":2010,"lang":"en","type":"article","venue":"eCommons (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Thread (computing); Reliability engineering; Computer science; Reliability (semiconductor); Embedded system; Engineering; Power (physics); Operating system","score_opus":0.01171319738261746,"score_gpt":0.20052897876624615,"score_spread":0.1888157813836287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883550131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4412822,0.000060963976,0.54385525,0.0005784384,0.00044742343,0.0006314688,0.000011261717,0.00044990465,0.0126831],"genre_scores_gemma":[0.8360275,0.00004829205,0.16321144,0.00007031249,0.000019632052,0.0000017591703,0.000002638194,0.0000061605215,0.000612269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991783,0.000035552952,0.00010593935,0.00043958315,0.00004550392,0.00019513225],"domain_scores_gemma":[0.99934596,0.00005529422,0.000058269878,0.00040068346,0.000071931856,0.00006788219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020410639,0.00012631934,0.0001345786,0.0002214911,0.00013520692,0.0000585512,0.00057863176,0.00010813629,0.0000040802383],"category_scores_gemma":[0.000009256836,0.00013343971,0.000043240827,0.0004994105,0.00005428243,0.0002678664,0.00026725692,0.00023888452,0.0000024179483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021396462,0.000638653,0.01930937,0.00011946188,0.00005892612,0.00014485088,0.0015209372,0.013180259,0.00027762188,0.9489574,0.006765308,0.008813273],"study_design_scores_gemma":[0.008798085,0.0012637558,0.16351171,0.00023401102,0.00009603428,0.00007501583,0.002166396,0.44918418,0.0057719955,0.25144687,0.11398789,0.0034640469],"about_ca_topic_score_codex":0.000015962121,"about_ca_topic_score_gemma":0.000093983734,"teacher_disagreement_score":0.6975105,"about_ca_system_score_codex":0.00003477227,"about_ca_system_score_gemma":0.000022332737,"threshold_uncertainty_score":0.54415137},"labels":[],"label_agreement":null},{"id":"W1883805637","doi":"10.1109/icci.1992.227685","title":"SELSYN-C: a self-synchronizing parallel programming language","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Synchronizing; Computer science; Compiler; Programming language; Scheduling (production processes); Parallel computing; Simple (philosophy); Mathematical optimization","score_opus":0.011636434799337228,"score_gpt":0.2510455362997952,"score_spread":0.23940910150045797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883805637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001545465,0.0002214478,0.9686881,0.00011012529,0.00006680789,0.00015550044,7.6541134e-8,0.0028665243,0.026346],"genre_scores_gemma":[0.27094924,0.0000107649785,0.7282519,0.0002306326,0.000016444475,0.000015669708,5.4124496e-7,0.0000075927323,0.0005172063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989004,0.000090567235,0.00018235766,0.00032890317,0.0001753263,0.00032244093],"domain_scores_gemma":[0.9994071,0.00004581694,0.00006094743,0.00034690325,0.00005348596,0.000085706175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003567379,0.00013160943,0.0001237409,0.00008886937,0.0001492909,0.00022130593,0.00048365022,0.00005618178,0.000016914139],"category_scores_gemma":[0.00004575258,0.000117826145,0.000054559503,0.00039275337,0.000013845476,0.00027406463,0.000097230375,0.00010749311,0.000053943677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021053131,0.0003391884,0.00087694026,0.000046573623,0.00006174815,0.0000589589,0.005531227,0.004861035,0.00034219463,0.83694386,0.0049423804,0.1459938],"study_design_scores_gemma":[0.0010166996,0.00022162404,0.00021993445,0.000058057325,0.000014995775,0.00016835656,0.0002918354,0.8751347,0.011027608,0.005345582,0.10537581,0.001124807],"about_ca_topic_score_codex":0.000012833228,"about_ca_topic_score_gemma":0.0000017518075,"teacher_disagreement_score":0.87027365,"about_ca_system_score_codex":0.000040681854,"about_ca_system_score_gemma":0.000055520246,"threshold_uncertainty_score":0.4804811},"labels":[],"label_agreement":null},{"id":"W1885730953","doi":"10.1007/978-3-540-74742-0_55","title":"Distributing Fixed Time Slices in Heterogeneous Networks of Workstations (NOWs)","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Workstation; Scheme (mathematics); Task (project management); Parallel computing; Simple (philosophy); Distributed computing; Heterogeneous network; Operating system","score_opus":0.016880154519154447,"score_gpt":0.26244294999218587,"score_spread":0.24556279547303142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885730953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015693718,0.00053547014,0.99641037,0.00011631885,0.00041538276,0.00031258888,0.000004594948,0.0002467638,0.0018015833],"genre_scores_gemma":[0.2523368,0.00006565926,0.7468271,0.00038539825,0.00017968845,0.0000057566267,0.000019900628,0.000030204701,0.00014945354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966616,0.000055304707,0.00087033166,0.0010854352,0.00064705906,0.0006802723],"domain_scores_gemma":[0.99729407,0.00080564,0.00053306663,0.0009732678,0.00027155425,0.00012238004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013551122,0.0004283888,0.00058217766,0.0010503985,0.00017456939,0.00025974197,0.0025914947,0.00037269713,0.000013479877],"category_scores_gemma":[0.000115373725,0.00043223237,0.00012706679,0.0012293368,0.0004271114,0.00032104072,0.0009775993,0.0007243876,0.000008956172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038675475,0.000025003932,0.000107735505,0.000013392478,0.000005471586,0.000037170175,0.00023646317,0.79783475,0.00001768512,0.0021934565,0.000010433077,0.19951458],"study_design_scores_gemma":[0.00015730369,0.000083667146,0.00013790093,0.00048644605,0.0000037491236,0.000028664608,8.181468e-8,0.98483086,0.00072443316,0.012960788,0.0001617844,0.00042434025],"about_ca_topic_score_codex":0.00003102967,"about_ca_topic_score_gemma":0.000064416774,"teacher_disagreement_score":0.25217986,"about_ca_system_score_codex":0.00026356394,"about_ca_system_score_gemma":0.00028878293,"threshold_uncertainty_score":0.99981296},"labels":[],"label_agreement":null},{"id":"W1885945138","doi":"10.1109/async.1999.761532","title":"A fast, asP*, RGD arbiter","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Arbiter; Spice; Throughput; Latency (audio); Computer science; CMOS; Computer architecture; Embedded system; Electronic engineering; Computer hardware; Engineering; Operating system; Telecommunications","score_opus":0.013454791076339661,"score_gpt":0.24377142833282694,"score_spread":0.2303166372564873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885945138","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000178681,0.000025622357,0.7580442,0.00019705086,0.00006956226,0.0000351077,5.326421e-8,0.00056952867,0.24088022],"genre_scores_gemma":[0.15226352,0.0000048657416,0.84057623,0.0013457596,0.000013588764,0.0000045411184,3.1695353e-7,0.0000042117545,0.005786952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940217,0.000045662568,0.00010466162,0.00019328084,0.000103472354,0.00015075487],"domain_scores_gemma":[0.9995348,0.000024395906,0.000026440568,0.00032433262,0.00004101587,0.000049007507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016015739,0.00006830669,0.00006659392,0.000061032362,0.000058640242,0.000103879516,0.00033727573,0.0000306575,0.00006337408],"category_scores_gemma":[0.000016166889,0.000057342335,0.000031028114,0.00022405348,0.000011413957,0.00016363377,0.000059266426,0.00005590585,0.00010751219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.81269e-7,0.000044097425,0.00039859788,0.0000025067825,0.000005626253,0.00000587259,0.00017499083,0.0013101209,0.000077376,0.9621815,0.023362631,0.012436181],"study_design_scores_gemma":[0.0007274952,0.00020216865,0.00079179957,0.00003090463,0.000005238123,0.00012231464,0.000024811243,0.47062328,0.05799363,0.060523942,0.40802887,0.00092553184],"about_ca_topic_score_codex":0.0000038553258,"about_ca_topic_score_gemma":4.446104e-7,"teacher_disagreement_score":0.9016576,"about_ca_system_score_codex":0.0000094973975,"about_ca_system_score_gemma":0.000025056852,"threshold_uncertainty_score":0.23383527},"labels":[],"label_agreement":null},{"id":"W1892184140","doi":"10.1109/ccece.1993.332460","title":"Designing parallel specifications in CCS","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Operator (biology); Programming language; Style (visual arts); Composition (language); Theoretical computer science; Computer network","score_opus":0.08192230864668257,"score_gpt":0.2603679336096349,"score_spread":0.17844562496295233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892184140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000113539725,0.000081420716,0.92556065,0.0010395071,0.00003380968,0.0000639492,5.1217004e-8,0.00049177575,0.072615266],"genre_scores_gemma":[0.25333232,0.000050875053,0.74469495,0.00021736091,0.00001244179,0.000008252151,3.2386754e-7,0.000002846695,0.0016806403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999374,0.000037171918,0.00015526793,0.00019532024,0.000090863316,0.00014737698],"domain_scores_gemma":[0.9995485,0.000050048366,0.000031542655,0.00030810267,0.000026483422,0.000035345594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001335766,0.000060433205,0.00006722072,0.00012553085,0.00006018536,0.00008009582,0.0004646319,0.000029740875,0.00007410152],"category_scores_gemma":[0.00002087888,0.00005808556,0.000020484787,0.0004209622,0.000012722108,0.00020674421,0.000066571236,0.00006867535,0.00013684331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001631525,0.0004265522,0.0043421094,0.000007304937,0.0000090703015,0.00002704407,0.00264845,0.08476997,0.0005097713,0.7547637,0.08702676,0.06546759],"study_design_scores_gemma":[0.00013707038,0.000015585556,0.0011274873,0.0000075689236,3.8831976e-7,0.0000052637297,0.000009736474,0.9895781,0.00073792797,0.0038327621,0.004422205,0.00012584779],"about_ca_topic_score_codex":0.000008896254,"about_ca_topic_score_gemma":0.0000027946076,"teacher_disagreement_score":0.90480816,"about_ca_system_score_codex":0.000020193882,"about_ca_system_score_gemma":0.0000057689517,"threshold_uncertainty_score":0.23686604},"labels":[],"label_agreement":null},{"id":"W1893683075","doi":"10.1109/ipdps.2003.1213519","title":"A case study of selected SPLASH-2 applications and the SBT debugging tool","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"SPMD; Debugging; Computer science; Splash; Overhead (engineering); Concurrency; Suite; Parallelism (grammar); Parallel computing; Operating system; Instrumentation (computer programming); Simple (philosophy); Embedded system","score_opus":0.012895685067238833,"score_gpt":0.25516013496509615,"score_spread":0.2422644498978573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893683075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1470061,0.000024287507,0.85166174,0.0001635946,0.000006645463,0.0003805761,1.0348828e-7,0.0002964086,0.00046052903],"genre_scores_gemma":[0.8627207,0.0000040983628,0.13712575,0.00006689238,0.0000060247867,0.000045721194,1.5049262e-7,0.000002188404,0.000028418379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949706,0.00004305148,0.00014808103,0.00015204916,0.000082312894,0.00007746482],"domain_scores_gemma":[0.9994618,0.000090209185,0.00005454829,0.00028319377,0.000091994836,0.000018230809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019135828,0.000054853415,0.000085427666,0.00004913274,0.00015649394,0.000056296965,0.0002326293,0.00001552132,8.9697085e-7],"category_scores_gemma":[0.000018157149,0.00003593409,0.0000120626355,0.00045138,0.000036059533,0.000081187616,0.00012049957,0.000050875693,0.0000010768422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004885572,0.0023884415,0.004042826,0.000057728106,0.0002391495,0.00037033984,0.04296564,0.12662292,0.00034900804,0.72492546,0.00087149354,0.09711816],"study_design_scores_gemma":[0.00760447,0.00048362784,0.001272016,0.000026161084,0.00005517515,0.003961357,0.001335205,0.96301794,0.0026235776,0.01883616,0.00029915688,0.00048513178],"about_ca_topic_score_codex":0.000268024,"about_ca_topic_score_gemma":0.000041763647,"teacher_disagreement_score":0.836395,"about_ca_system_score_codex":0.0000085346655,"about_ca_system_score_gemma":0.00003445115,"threshold_uncertainty_score":0.14653495},"labels":[],"label_agreement":null},{"id":"W1893780431","doi":"10.3233/fi-2000-42103","title":"Models For Dependable Computation with Multiple Inputs and Some Hardness Results","year":2000,"lang":"en","type":"article","venue":"Fundamenta Informaticae","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Computer science; Algorithm; Theoretical computer science","score_opus":0.02064399726817953,"score_gpt":0.24811833279753814,"score_spread":0.2274743355293586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1893780431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012997168,0.00002428137,0.9824973,0.00035675272,0.000050439045,0.00047706644,0.000020232237,0.00040154377,0.00317524],"genre_scores_gemma":[0.43859074,0.000018935203,0.5599973,0.0009396789,0.000019486106,0.00005283005,0.000045820892,0.000008603544,0.00032657955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896383,0.000020385889,0.0003664508,0.00020505284,0.00019637885,0.00024792473],"domain_scores_gemma":[0.99935675,0.00010653914,0.00011921588,0.00025066466,0.00007650385,0.0000903089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002608931,0.00014118811,0.0001629785,0.00009278402,0.0002372516,0.00034705002,0.00030034487,0.000047659207,0.0000041487733],"category_scores_gemma":[0.000014997439,0.00011855342,0.000025179525,0.00015859114,0.000041568324,0.0020496196,0.00007960714,0.00006825278,0.00001601342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047831875,0.00019259268,0.00023374241,0.00024038076,0.00008150071,0.0000041110216,0.009130065,0.7543185,0.000016420701,0.023461655,0.013657436,0.19818531],"study_design_scores_gemma":[0.0015037953,0.00019964868,0.00008242739,0.00004892605,0.0000047804515,0.000015060897,0.000023755832,0.9877465,0.00038638685,0.0042463876,0.005561127,0.00018120494],"about_ca_topic_score_codex":0.000017336779,"about_ca_topic_score_gemma":0.0000022642691,"teacher_disagreement_score":0.42559358,"about_ca_system_score_codex":0.000033683595,"about_ca_system_score_gemma":0.000041663065,"threshold_uncertainty_score":0.4834468},"labels":[],"label_agreement":null},{"id":"W1896755193","doi":"10.1109/adfsp.1998.685706","title":"Multithreaded processors: the upcoming generation for multimedia chips","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multithreading; Computer science; Compiler; Idle; Software; Multiprocessing; Simultaneous multithreading; Computer architecture; Process (computing); State (computer science); Embedded system; Parallel computing; Operating system; Thread (computing); Programming language","score_opus":0.07449934134092877,"score_gpt":0.2737034197846118,"score_spread":0.19920407844368304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1896755193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052435143,0.000097774035,0.9945912,0.0020106223,0.0001283964,0.00032230333,4.1173948e-7,0.00054419134,0.001780783],"genre_scores_gemma":[0.19367805,0.000012162104,0.8033129,0.0007036219,0.00016289362,0.00007972229,0.0000020426553,0.0000066396256,0.002041975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993108,0.000030577106,0.00015580545,0.00022819567,0.000113537906,0.00016111402],"domain_scores_gemma":[0.99940723,0.00010966226,0.00006317461,0.000293174,0.00009454104,0.00003224263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022637604,0.00008590306,0.00007435939,0.00004552921,0.00026111898,0.00016316885,0.0005123941,0.000039875285,0.000017996019],"category_scores_gemma":[0.00009822995,0.000056073834,0.000039857565,0.00017520665,0.00002049892,0.00023041248,0.000045998466,0.00005770673,0.000017074597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073728224,0.00038517863,0.00031716947,0.000050599985,0.000057414247,0.0000021368896,0.013359884,0.036779217,0.0049007274,0.056401663,0.23386942,0.6538692],"study_design_scores_gemma":[0.00018547023,0.000022977914,0.00002195117,0.0000042617244,0.0000018032064,0.0000024601327,0.000009264563,0.9881624,0.00841263,0.0002729325,0.0028135437,0.00009028837],"about_ca_topic_score_codex":0.0000064234237,"about_ca_topic_score_gemma":0.000004867707,"teacher_disagreement_score":0.9513832,"about_ca_system_score_codex":0.000012818523,"about_ca_system_score_gemma":0.000007976815,"threshold_uncertainty_score":0.22866245},"labels":[],"label_agreement":null},{"id":"W1897001408","doi":"10.1109/eeis.1991.217647","title":"Future trends in microprocessors: out-of-order execution, speculative branching and their CISC performance potential","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction; Intel Corporation","keywords":"Computer science; Microprocessor; Superscalar; Speculative execution; Out-of-order execution; Parallel computing; Instructions per cycle; Control flow; TRACE (psycholinguistics); Branching (polymer chemistry); Embedded system; Programming language; Operating system; Central processing unit","score_opus":0.012489219275148842,"score_gpt":0.22927293486791597,"score_spread":0.21678371559276713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897001408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09797642,0.0003987012,0.89466417,0.0004999047,0.00013893846,0.00005131269,6.6757286e-7,0.00016705994,0.0061028297],"genre_scores_gemma":[0.89121675,0.00012707006,0.10795005,0.00013849449,0.000054229364,0.0000020326254,0.000001460597,0.00000478637,0.00050510827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992523,0.000034064564,0.00020816135,0.0002532315,0.00009373386,0.00015847724],"domain_scores_gemma":[0.9996154,0.000012167649,0.000081843355,0.00018840321,0.0000704702,0.000031756364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012453076,0.00011967841,0.00014641983,0.0002167421,0.00007829457,0.000057832323,0.00027613627,0.00005805949,0.0000354415],"category_scores_gemma":[0.0000047070835,0.000093502276,0.000027867649,0.00051775394,0.00003751892,0.00035658045,0.00010980215,0.00011111422,0.0000021710603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028292376,0.00043137252,0.007030906,0.00009987711,0.00005628554,0.000011080974,0.040252674,0.03662088,0.003632984,0.0107244905,0.007429078,0.89368206],"study_design_scores_gemma":[0.0003118628,0.000055645396,0.004969267,0.000029187571,0.000001406678,0.0000096278,0.00008199805,0.98884004,0.004374735,0.0004273487,0.0007204769,0.00017840829],"about_ca_topic_score_codex":0.000008470924,"about_ca_topic_score_gemma":0.0000053482527,"teacher_disagreement_score":0.9522191,"about_ca_system_score_codex":0.000012264459,"about_ca_system_score_gemma":0.00000624538,"threshold_uncertainty_score":0.3812912},"labels":[],"label_agreement":null},{"id":"W1902102965","doi":"10.1109/hpcsa.2002.1019151","title":"Parallel Gaussian elimination using OpenMP and MPI","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Parallel computing; Gaussian elimination; Gaussian; Shared memory; Distributed memory; Message passing","score_opus":0.02891235880420709,"score_gpt":0.2816761321668901,"score_spread":0.25276377336268296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902102965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020349887,0.00008431463,0.9758201,0.00030047153,0.000054806,0.00007633542,6.047758e-8,0.00026087952,0.021368045],"genre_scores_gemma":[0.4405761,0.000014910309,0.5589286,0.00019241816,0.0000052802684,0.0000014888013,2.2625196e-7,0.000002730063,0.00027822488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00006113637,0.00011874048,0.0002112512,0.000097086995,0.00013229364],"domain_scores_gemma":[0.9996432,0.000018121107,0.000042656393,0.00020214396,0.00004143128,0.000052423133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023395166,0.00007417043,0.00007500107,0.00007454326,0.00012427272,0.0001571039,0.00019337682,0.000036853653,0.000010247761],"category_scores_gemma":[0.00003180282,0.000066465145,0.000015288744,0.00018170194,0.00001817324,0.00031413732,0.00007002103,0.000044623128,0.000005603635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011926215,0.000034213037,0.00061047287,0.0000068199947,0.00000563681,0.000004008303,0.00026241972,0.007128315,0.0002680502,0.9819282,0.00077086827,0.008979792],"study_design_scores_gemma":[0.00022543686,0.000038099497,0.0009942014,0.000015397703,0.0000026233913,0.000044056764,0.000017562119,0.98289436,0.0032202497,0.010097542,0.0022563688,0.0001941302],"about_ca_topic_score_codex":0.000014035032,"about_ca_topic_score_gemma":0.0000011784359,"teacher_disagreement_score":0.975766,"about_ca_system_score_codex":0.000015407051,"about_ca_system_score_gemma":0.000027384907,"threshold_uncertainty_score":0.271037},"labels":[],"label_agreement":null},{"id":"W190521828","doi":"","title":"Understanding the Behavior of Simultaneous Multithreaded and Multiprocessor Architectures.","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multiprocessing; Computer science; Multithreading; Parallel computing; Simple (philosophy); Computer architecture; Symmetric multiprocessor system; Architecture; Programming language; Thread (computing)","score_opus":0.03889740276509749,"score_gpt":0.26094200791848166,"score_spread":0.22204460515338417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190521828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024885587,0.00006742899,0.97304976,0.00015363404,0.000024112114,0.00018082208,6.3515864e-7,0.00024816414,0.0013898667],"genre_scores_gemma":[0.84263736,0.000003655743,0.15714638,0.00006145697,0.000011417487,0.000009485554,4.7612227e-7,0.000003802973,0.00012596462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939764,0.000027256292,0.0001525372,0.00017244054,0.00012890167,0.00012124593],"domain_scores_gemma":[0.9994171,0.00023961464,0.00007041685,0.00021178466,0.000040287276,0.00002079716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009352252,0.000080362785,0.00008979512,0.000059733535,0.00011239977,0.000058451278,0.0003232508,0.00003333265,0.0000018921671],"category_scores_gemma":[0.000025514611,0.000051151448,0.000023710623,0.00016763213,0.00008422384,0.00004024052,0.00010435813,0.00006783109,5.678832e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003866399,0.0005853213,0.022609452,0.000101606456,0.000043012547,0.000056712222,0.0032390035,0.6161535,0.008505503,0.27308816,0.0012973242,0.07428178],"study_design_scores_gemma":[0.00025819728,0.00004139632,0.00074420555,0.000012013755,0.000006291076,0.000022272161,0.000052834726,0.98073846,0.010009294,0.007944066,0.000045224093,0.00012576986],"about_ca_topic_score_codex":0.00017763722,"about_ca_topic_score_gemma":0.00005453439,"teacher_disagreement_score":0.81775177,"about_ca_system_score_codex":0.00001491128,"about_ca_system_score_gemma":0.0000133458925,"threshold_uncertainty_score":0.20858955},"labels":[],"label_agreement":null},{"id":"W1906008791","doi":"10.1017/cbo9780511584046.011","title":"Memory Leaks and Their Debugging","year":2003,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Debugging; Computer science; Memory leak; Background debug mode interface; Operating system; Embedded system; Programming language; Semiconductor memory; Memory management","score_opus":0.018645507252338527,"score_gpt":0.1904571549058903,"score_spread":0.17181164765355178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906008791","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004579958,0.00025928277,0.3629885,0.000023504059,0.00008994223,0.00012599574,0.000007870489,0.00046352908,0.63603675],"genre_scores_gemma":[0.0006659056,0.00016187356,0.010306281,0.00027037496,0.000035666624,3.4278693e-7,0.000005728253,0.00002522923,0.9885286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988966,0.00004891655,0.00014148935,0.0005537937,0.00013101446,0.0002281605],"domain_scores_gemma":[0.99891055,0.000066232154,0.00016872071,0.00061390223,0.000107775224,0.00013280855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013010458,0.0003159569,0.00030429306,0.00019708528,0.00024977984,0.000112294525,0.0007664892,0.0002479184,7.472965e-7],"category_scores_gemma":[0.000006073306,0.00034032972,0.00010753315,0.000010810046,0.00013532689,0.00013357992,0.0006231023,0.00034122885,0.0000027690935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045657243,0.0000037018044,3.4452293e-7,0.000027524742,0.000049895298,0.00006267763,0.00008960769,0.000032510612,0.000009042886,0.96287966,0.02778814,0.009052305],"study_design_scores_gemma":[0.00028999164,0.0000404032,0.0000020155437,0.00014072547,0.0000315426,0.000056548994,0.000009030269,0.0096759405,0.0011863788,0.00017852841,0.98781216,0.0005767289],"about_ca_topic_score_codex":0.00002114989,"about_ca_topic_score_gemma":3.2858156e-7,"teacher_disagreement_score":0.96270114,"about_ca_system_score_codex":0.000077850425,"about_ca_system_score_gemma":0.00006673172,"threshold_uncertainty_score":0.9999049},"labels":[],"label_agreement":null},{"id":"W1917361244","doi":"10.1109/mwscas.1989.102039","title":"Optimal allocation of multiport memories in datapath synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Datapath; Computer science; Register allocation; Set (abstract data type); Heuristic; Range (aeronautics); High-level synthesis; Arithmetic; Theoretical computer science; Parallel computing; Programming language; Embedded system; Mathematics; Artificial intelligence; Engineering; Field-programmable gate array","score_opus":0.018378639284593525,"score_gpt":0.25582310624443644,"score_spread":0.23744446695984292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917361244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009585864,0.000023845267,0.9799752,0.00006475984,0.000041821368,0.00007641517,4.023375e-7,0.00014857123,0.010083116],"genre_scores_gemma":[0.52382326,0.000009477717,0.4760484,0.00002064863,0.0000019863007,0.0000065026443,6.338879e-7,0.0000018223684,0.000087276174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.000059048474,0.00020916034,0.00017931375,0.00011656255,0.000104823164],"domain_scores_gemma":[0.9994369,0.00008234269,0.000066031964,0.00033463206,0.000057072728,0.000022985381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040255627,0.000062515355,0.00010788541,0.00010829727,0.000023304938,0.000023492072,0.00033864242,0.00003176336,0.000013443054],"category_scores_gemma":[0.00019306112,0.00005739393,0.000019315195,0.00029029208,0.00002177456,0.00024308231,0.00005480568,0.00003749885,0.0000035968962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013660165,0.000653412,0.021206016,0.000069295325,0.00003177888,0.000016010734,0.0020990851,0.25926346,0.0019991426,0.6721736,0.0032878658,0.039186638],"study_design_scores_gemma":[0.00018469417,0.000040296745,0.0029097078,0.0000356059,0.000002852626,0.000008529037,0.000059562346,0.6948717,0.29954517,0.00087224523,0.0012563266,0.00021327432],"about_ca_topic_score_codex":0.00003347141,"about_ca_topic_score_gemma":0.0000055658898,"teacher_disagreement_score":0.67130136,"about_ca_system_score_codex":0.000013876556,"about_ca_system_score_gemma":0.000049006743,"threshold_uncertainty_score":0.23404564},"labels":[],"label_agreement":null},{"id":"W1918654715","doi":"10.14796/jwmm.r206-03","title":"Parallel Processing Enhancement to SWMM/EXTRAN","year":2000,"lang":"en","type":"article","venue":"Journal of Water Management Modeling","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer graphics (images)","score_opus":0.02023288646278995,"score_gpt":0.2584124888353237,"score_spread":0.23817960237253374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918654715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016296962,0.00009511432,0.9767952,0.0014286689,0.00009326717,0.00013275053,4.9294727e-8,0.00009070545,0.0050672954],"genre_scores_gemma":[0.49825436,0.00008475019,0.5001509,0.0005172344,0.000056907025,0.0000036647366,3.3556503e-7,0.0000071242243,0.00092473556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985174,0.00003568533,0.0005427901,0.00021195828,0.0003965734,0.00029562094],"domain_scores_gemma":[0.99944067,0.0000038379044,0.00008729879,0.00023658128,0.00012632903,0.00010526758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033295,0.00013409936,0.00018061907,0.0002528168,0.00013174822,0.00026088292,0.0008151763,0.000026753016,0.00004543593],"category_scores_gemma":[0.0000013789668,0.0000973958,0.000079616926,0.00017171512,0.000006008262,0.00053771463,0.00013559166,0.00011332254,0.000040972158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001847236,0.000053867596,0.0000028415088,0.000021203348,0.000021762666,0.000024181298,0.0008355466,0.8383864,0.0001404463,0.00024535347,0.0004121797,0.15983775],"study_design_scores_gemma":[0.00029825332,0.00010117243,0.0000029949285,0.00014150755,0.000013062849,0.00001604923,0.00001893133,0.9899704,0.0017154593,0.0030793592,0.004486715,0.0001560893],"about_ca_topic_score_codex":0.0000019698957,"about_ca_topic_score_gemma":1.6521618e-7,"teacher_disagreement_score":0.4819574,"about_ca_system_score_codex":0.000050243052,"about_ca_system_score_gemma":0.00001202113,"threshold_uncertainty_score":0.39716855},"labels":[],"label_agreement":null},{"id":"W1919074074","doi":"10.1109/pacrim.1995.519539","title":"Time-cost analysis of fault-tolerant parallel programs with timing constraints","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Fault tolerance; Computation; Parallel computing; Software fault tolerance; Distributed computing; Algorithm","score_opus":0.031140679217588337,"score_gpt":0.25296841811520515,"score_spread":0.2218277388976168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919074074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039390055,0.000031040163,0.97836936,0.00017270855,0.00001220594,0.00019613239,0.0000010683748,0.0005141532,0.016764319],"genre_scores_gemma":[0.5380911,0.000008202853,0.46095943,0.000104404855,0.0000050106755,0.000011101681,0.00000621054,0.0000050150443,0.0008094874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988652,0.00004617109,0.00027922995,0.00031847772,0.0002593958,0.00023154206],"domain_scores_gemma":[0.9991334,0.000049413564,0.00014637971,0.00045227047,0.00014046213,0.000078074554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017342877,0.00013446837,0.0002975724,0.0002738821,0.00007356103,0.000085111154,0.00053502317,0.00004848797,0.00021318956],"category_scores_gemma":[0.000009656905,0.00010174806,0.000098843564,0.0013893376,0.00015027165,0.00017314868,0.00008307374,0.00007357128,0.00003156612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016886625,0.00082708494,0.005709313,0.000027233129,0.0014823256,0.000041297142,0.0030109251,0.4522692,0.00010466679,0.01302052,0.0035598138,0.5199307],"study_design_scores_gemma":[0.00019446241,0.000084415384,0.00026644277,0.000018836296,0.00006686158,0.0000070034102,0.000013247035,0.99870384,0.00017925537,0.00002507023,0.00028808144,0.00015247415],"about_ca_topic_score_codex":0.00001674438,"about_ca_topic_score_gemma":0.000004801297,"teacher_disagreement_score":0.54643464,"about_ca_system_score_codex":0.000014424717,"about_ca_system_score_gemma":0.000014335275,"threshold_uncertainty_score":0.41491655},"labels":[],"label_agreement":null},{"id":"W1921661832","doi":"10.1109/pacrim.1995.519412","title":"A DRAM interface coprocessor for a low-cost vector microprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dram; Computer science; Coprocessor; Interface (matter); Embedded system; Microprocessor; Computer hardware; Chip; Operating system","score_opus":0.02298150113098121,"score_gpt":0.2717814865955077,"score_spread":0.2487999854645265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921661832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007944066,0.00020564209,0.99164414,0.0014379284,0.00013710027,0.00041548192,0.0000027298047,0.0011477083,0.004214871],"genre_scores_gemma":[0.5258734,0.000023215818,0.4668023,0.00087208103,0.000056741483,0.00012481991,0.000001720517,0.000015958574,0.0062297783],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988925,0.000017075678,0.00023216386,0.00041292838,0.00013432765,0.0003110046],"domain_scores_gemma":[0.9991688,0.000082672545,0.000091168906,0.0003654013,0.00020551581,0.00008643243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014066292,0.000154526,0.00016725954,0.00009375906,0.00014539389,0.0002467774,0.0009128266,0.00006883941,0.00006643621],"category_scores_gemma":[0.00008517618,0.00013615629,0.000067336965,0.00035958044,0.000029507102,0.0003009728,0.00014354194,0.00008439005,0.00010929448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007831111,0.0015955085,0.0002259448,0.00070112443,0.00012597833,0.000016003974,0.0070311907,0.011617112,0.008498436,0.054831933,0.61302286,0.30225557],"study_design_scores_gemma":[0.000451322,0.00009652114,0.0000147206065,0.00004265619,0.000003453689,0.000013032548,0.000009510975,0.9119436,0.060950175,0.0008570017,0.025341555,0.00027644774],"about_ca_topic_score_codex":0.000005707009,"about_ca_topic_score_gemma":0.000002392126,"teacher_disagreement_score":0.9003265,"about_ca_system_score_codex":0.000032691805,"about_ca_system_score_gemma":0.000021204782,"threshold_uncertainty_score":0.55522925},"labels":[],"label_agreement":null},{"id":"W1929091259","doi":"10.1109/mascot.1996.501002","title":"Measurement and modeling of EARTH-MANNA multithreaded architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Computer science; Workload; Heuristics; Queueing theory; Multiprocessing; Multithreading; Parallel computing; Architecture; Distributed computing; Latency (audio); Thread (computing); Operating system; Computer network","score_opus":0.06285923081197631,"score_gpt":0.24801987785863489,"score_spread":0.18516064704665858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929091259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018175439,0.0003613421,0.99233526,0.00038247765,0.000021967138,0.000063666695,1.036309e-7,0.00021834945,0.004799301],"genre_scores_gemma":[0.6468633,0.000023703653,0.35295907,0.00007276327,0.000005865539,0.0000012863927,5.1965383e-8,0.0000020714099,0.000071867405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999373,0.000025843361,0.00013373786,0.00016515965,0.00020187852,0.000100333775],"domain_scores_gemma":[0.9996146,0.000008983782,0.00003328998,0.00021002116,0.000095344534,0.000037772446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001730149,0.00006549333,0.000089932335,0.00006907181,0.00004336773,0.000030191257,0.0002064074,0.000028749719,0.0000070217184],"category_scores_gemma":[0.000022069928,0.000054125863,0.00002194859,0.00010772333,0.000016161765,0.0000731238,0.000090130576,0.000058268975,0.000002537016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047847143,0.00017571788,0.0003128659,0.00006265263,0.00003850642,0.0000035403668,0.0030991691,0.8447732,0.002924982,0.025735946,0.000866121,0.12200251],"study_design_scores_gemma":[0.0001102658,0.00002829829,0.000042681324,0.000020946682,0.0000011571373,0.000003266116,0.000003335961,0.9958734,0.00277789,0.0009660939,0.000106225474,0.00006643924],"about_ca_topic_score_codex":0.000018362238,"about_ca_topic_score_gemma":0.000004821289,"teacher_disagreement_score":0.64504576,"about_ca_system_score_codex":0.0000034148418,"about_ca_system_score_gemma":0.000004923208,"threshold_uncertainty_score":0.22071886},"labels":[],"label_agreement":null},{"id":"W1930795142","doi":"10.1109/cluster.2015.15","title":"Automatic Command Queue Scheduling for Task-Parallel Workloads in OpenCL","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"State Council of Higher Education for Virginia","keywords":"Computer science; Scheduling (production processes); Programmer; Queue; Parallel computing; Distributed computing; Operating system; Programming language","score_opus":0.04649109714100505,"score_gpt":0.30520210655544355,"score_spread":0.2587110094144385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930795142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004351039,0.00014195825,0.9870973,0.0012049292,0.00013578768,0.0003558526,3.0907202e-7,0.0007070778,0.006005743],"genre_scores_gemma":[0.30557883,0.000005346655,0.6935699,0.00042404735,0.000021859487,0.00004415238,0.00000211608,0.000006635158,0.0003470859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889797,0.00006741489,0.00030714876,0.00029287388,0.00016375391,0.0002708252],"domain_scores_gemma":[0.99915725,0.00012009498,0.00007932427,0.00040426428,0.00012417806,0.00011487306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081534125,0.00012557961,0.00019858083,0.00015671653,0.00007256455,0.00021070408,0.0008676562,0.00007009144,0.000005437971],"category_scores_gemma":[0.00014013606,0.00011389989,0.00004133249,0.00038380027,0.000021984004,0.00038084335,0.00025613894,0.00009924079,0.00002321878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035264617,0.0004285341,0.0050912155,0.00008566777,0.000035743236,0.000019823838,0.0033599474,0.61744577,0.00005927524,0.23454198,0.046050772,0.09284601],"study_design_scores_gemma":[0.0006526711,0.00006532249,0.00011977954,0.00004856587,0.0000014313832,0.0000050665194,0.000034247805,0.9851637,0.00015444415,0.01242117,0.001165513,0.00016811126],"about_ca_topic_score_codex":0.00007939238,"about_ca_topic_score_gemma":0.000028869055,"teacher_disagreement_score":0.36771792,"about_ca_system_score_codex":0.00006932158,"about_ca_system_score_gemma":0.00013471123,"threshold_uncertainty_score":0.46447027},"labels":[],"label_agreement":null},{"id":"W1936400588","doi":"10.1109/icpp.1998.708506","title":"Concurrent SSA form in the presence of mutual exclusion","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mutual exclusion; Computer science; Synchronization (alternating current); Compiler; Parallel computing; Optimizing compiler; Extension (predicate logic); Semantics (computer science); Program optimization; Code (set theory); Lock (firearm); Critical section; Theoretical computer science; Programming language","score_opus":0.03380953039353195,"score_gpt":0.2711618318661094,"score_spread":0.23735230147257746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936400588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055876425,0.00011213813,0.97215945,0.00073449087,0.000070580885,0.000111335175,1.8405984e-7,0.000106178966,0.021118019],"genre_scores_gemma":[0.97227657,0.00004748345,0.02720509,0.00017847418,0.000009838311,0.00000442354,2.4989671e-7,0.0000012593333,0.00027663077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993925,0.00005357161,0.00015071829,0.00012083783,0.00017838784,0.00010395213],"domain_scores_gemma":[0.99952984,0.000113495385,0.000046735746,0.0002625371,0.000032763655,0.000014636556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000260381,0.00004861423,0.00006469251,0.000052933563,0.000038783848,0.000028088765,0.00074091804,0.000021914251,0.000026764043],"category_scores_gemma":[0.00003459245,0.000030572075,0.000022707318,0.00027286424,0.000026711257,0.00014420704,0.00017897465,0.000061858416,0.000009205545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023862715,0.00061823503,0.0023454216,0.000034571847,0.0000066715047,0.000013072868,0.02108665,0.0062826197,0.00023856736,0.4259176,0.08646891,0.4569853],"study_design_scores_gemma":[0.000112980335,0.00005758928,0.00051484,0.000015100693,4.3322913e-7,0.00000472688,0.000025198047,0.99469405,0.0011042937,0.0012579275,0.0021572695,0.00005559402],"about_ca_topic_score_codex":0.000019250785,"about_ca_topic_score_gemma":0.000004261363,"teacher_disagreement_score":0.9884114,"about_ca_system_score_codex":0.000007703202,"about_ca_system_score_gemma":0.0000057249163,"threshold_uncertainty_score":0.13768224},"labels":[],"label_agreement":null},{"id":"W1949003947","doi":"","title":"Java TM just-in-time compiler and virtual machine improvements for server and middleware applications","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Operating system; Just-in-time compilation; Java; Compiler; Scalability; Java concurrency; Middleware (distributed applications); Virtual machine; strictfp; Overhead (engineering); Embedded Java; IBM; Real time Java","score_opus":0.014183610337802287,"score_gpt":0.25583508994527093,"score_spread":0.24165147960746863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949003947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017259445,0.00009053008,0.98094773,0.00053285144,0.000019257923,0.00049103785,0.000005895308,0.00023675038,0.00041649464],"genre_scores_gemma":[0.5437289,0.00004023425,0.45409963,0.001033591,0.000024325107,0.00011373872,0.00001742415,0.000010557969,0.00093159766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992797,0.000011707899,0.0001657184,0.00029927166,0.000091641654,0.00015195954],"domain_scores_gemma":[0.999596,0.00003847789,0.00004266499,0.00021523958,0.000045817636,0.000061819905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015202373,0.00009979875,0.000114262744,0.00007926942,0.00010444278,0.00010583926,0.00026992572,0.0000441277,0.0000043180357],"category_scores_gemma":[0.0000060927937,0.000091020855,0.000017701646,0.00014231802,0.000028771054,0.00018175296,0.0002096743,0.00005141011,0.000005322255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009871909,0.0018113134,0.017702699,0.00036174257,0.00014896262,0.000013168631,0.0032733404,0.031464893,0.0054394286,0.69637185,0.005881558,0.2374323],"study_design_scores_gemma":[0.0060768537,0.0007318892,0.012666822,0.00009688057,0.000020382799,0.000033355467,0.0000572474,0.93096477,0.007077925,0.03261454,0.008696284,0.0009630787],"about_ca_topic_score_codex":0.000046878697,"about_ca_topic_score_gemma":0.0000153071,"teacher_disagreement_score":0.89949983,"about_ca_system_score_codex":0.000021846876,"about_ca_system_score_gemma":0.000019915658,"threshold_uncertainty_score":0.37117228},"labels":[],"label_agreement":null},{"id":"W1949410241","doi":"10.1109/hpca.1996.501172","title":"Register file design considerations in dynamically scheduled processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register file; Queue; Processor register; Parallel computing; Register allocation; Register (sociolinguistics); Operating system; Instruction set; Programming language; Compiler; Memory address","score_opus":0.04614104336871487,"score_gpt":0.25115340646543044,"score_spread":0.20501236309671556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949410241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010196019,0.00003355313,0.9767963,0.0022062366,0.00002587807,0.00015062765,8.5732887e-7,0.0005475673,0.020137005],"genre_scores_gemma":[0.23621917,0.0000057556786,0.76069665,0.0007403442,0.0000069887196,0.00002998865,0.0000016082413,0.000004304428,0.0022952086],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.0000797488,0.00021237106,0.00026300145,0.00011675288,0.00016939595],"domain_scores_gemma":[0.99933004,0.00019505578,0.00004987072,0.00030490602,0.00007521612,0.000044917477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016914266,0.00008509308,0.00010160323,0.00012576347,0.00007729358,0.00015506159,0.00028603245,0.000051846644,0.0009253592],"category_scores_gemma":[0.00020269098,0.00007755063,0.00002262283,0.0003178638,0.000026245843,0.00028118034,0.00007444301,0.00009255105,0.000090113164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004712572,0.0006073468,0.0005509979,0.000027515911,0.00002002252,0.000081729435,0.002201865,0.15576032,0.00018645545,0.2661954,0.5645556,0.009808069],"study_design_scores_gemma":[0.0001408072,0.00002866122,0.00015902816,0.000015218212,5.619488e-7,0.00001204319,0.0000030524566,0.99090254,0.0003314793,0.007917573,0.0003738628,0.00011517611],"about_ca_topic_score_codex":0.000008353113,"about_ca_topic_score_gemma":0.000009966528,"teacher_disagreement_score":0.8351422,"about_ca_system_score_codex":0.000025856954,"about_ca_system_score_gemma":0.000027331791,"threshold_uncertainty_score":0.99998796},"labels":[],"label_agreement":null},{"id":"W1950328736","doi":"","title":"Programmer-assisted automatic parallelization","year":2011,"lang":"en","type":"article","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Programmer; Computer science; Compiler; Automatic parallelization; Parallel computing; Multi-core processor; Programming language; Software","score_opus":0.05633768568895328,"score_gpt":0.31323126321830325,"score_spread":0.25689357752934994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950328736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032605217,0.000053304524,0.969028,0.00026170225,0.000093657894,0.0001496469,4.9337526e-8,0.0019833245,0.025169771],"genre_scores_gemma":[0.37061927,0.0000080587015,0.62833804,0.00014083655,0.000013015162,0.000018522105,0.0000017369068,0.0000069113266,0.0008535925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.000060566173,0.00014879153,0.0002219617,0.00014122861,0.00019472439],"domain_scores_gemma":[0.9993443,0.000017034869,0.00009118404,0.00040869732,0.000072782655,0.000065982094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001627642,0.00009818083,0.00010079903,0.00008219067,0.00008954715,0.000073639654,0.0004981472,0.000049339415,0.000046921832],"category_scores_gemma":[0.000029584551,0.000090833375,0.000036973644,0.000392148,0.000023842216,0.00017720733,0.000110132874,0.000059872993,0.00007315562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011430343,0.0007894918,0.0031318786,0.00008586211,0.0000716496,0.000047249465,0.029555812,0.0007259112,0.00037795855,0.24137853,0.020817146,0.7030071],"study_design_scores_gemma":[0.0003549469,0.00020140425,0.012534691,0.00004684688,0.000009717155,0.000036256544,0.0000892112,0.97073007,0.0043158014,0.0053569805,0.00591313,0.00041091986],"about_ca_topic_score_codex":0.000052242398,"about_ca_topic_score_gemma":0.0000024509168,"teacher_disagreement_score":0.9700042,"about_ca_system_score_codex":0.000019890607,"about_ca_system_score_gemma":0.000033179913,"threshold_uncertainty_score":0.37040773},"labels":[],"label_agreement":null},{"id":"W1954679557","doi":"10.1007/11758501_39","title":"Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Oak Ridge National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; UT-Battelle; Battelle; National Science Foundation","keywords":"Tensor contraction; Contraction (grammar); Computer science; Tensor (intrinsic definition); Associative property; Cartesian tensor; Algorithm; Algebra over a field; Applied mathematics; Mathematics; Tensor product; Pure mathematics; Tensor density; Exact solutions in general relativity; Tensor field; Mathematical analysis","score_opus":0.03318684147215604,"score_gpt":0.33991539469982696,"score_spread":0.3067285532276709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1954679557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032238083,0.00015747662,0.9925504,0.0008582145,0.0010835447,0.0026551136,0.0000074967866,0.00033401678,0.0020313703],"genre_scores_gemma":[0.49132648,0.000032237316,0.50635874,0.0011887723,0.000321475,0.0003259872,0.00003661169,0.000042423457,0.0003672581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614626,0.00016047106,0.0007342717,0.0014292585,0.00097253517,0.00055719045],"domain_scores_gemma":[0.9973572,0.00066137523,0.00032722935,0.001021766,0.0004836483,0.00014878542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015952613,0.000461645,0.000528345,0.0014879096,0.00046411168,0.00083383074,0.0017263594,0.00032443603,0.000009632804],"category_scores_gemma":[0.00018730584,0.0004612118,0.00009400488,0.0009377015,0.00019846788,0.0008859045,0.0006676637,0.0008274663,0.000035926245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009065311,0.000049764403,0.00008480894,0.000011518057,0.0000040342275,0.00001859908,0.000519686,0.7741084,0.0010196976,0.002822671,0.00021479586,0.22113693],"study_design_scores_gemma":[0.00037183362,0.0001475542,0.0016568692,0.00073497894,0.000008377756,0.000031183965,3.7232198e-7,0.96766263,0.006691723,0.021155996,0.0009349817,0.00060349365],"about_ca_topic_score_codex":0.00020880096,"about_ca_topic_score_gemma":0.0003991825,"teacher_disagreement_score":0.49100408,"about_ca_system_score_codex":0.0009898352,"about_ca_system_score_gemma":0.0004208652,"threshold_uncertainty_score":0.99978393},"labels":[],"label_agreement":null},{"id":"W1958945689","doi":"10.1109/hpca.1998.650541","title":"The potential for using thread-level data speculation to facilitate automatic parallelization","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":347,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Parallel computing; Speculation; Thread (computing); Speculative multithreading; Correctness; Exploit; Cache coherence; Cache; Multithreading; Speculative execution; Multiprocessing; Chip; Computer architecture; CPU cache; Programming language; Cache algorithms","score_opus":0.223990135150863,"score_gpt":0.320554106465231,"score_spread":0.09656397131436803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1958945689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070203864,0.00005053374,0.99621546,0.0014493037,0.00016279961,0.00041159583,0.000007494596,0.00045266535,0.00054810103],"genre_scores_gemma":[0.092064545,0.000013872015,0.90655607,0.00022921032,0.00004624335,0.000011153876,0.000020721143,0.000007015658,0.0010511854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897724,0.00004991441,0.00025014806,0.00032504307,0.00019285787,0.00020480396],"domain_scores_gemma":[0.9988098,0.00009307419,0.000074661446,0.0008536356,0.00011781809,0.000050998646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038922735,0.000097025826,0.000086606495,0.00006098928,0.0004088909,0.0003185695,0.0010586923,0.000034296725,0.000011483912],"category_scores_gemma":[0.00011027131,0.00007186735,0.000030016841,0.00026083298,0.000016612628,0.00042992053,0.00033223472,0.000033788787,0.000024982692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066684133,0.00008199431,0.000054053424,0.000025149682,0.000038809012,0.0000016549343,0.00081041286,0.5990167,0.00022577678,0.13072218,0.045142177,0.22387442],"study_design_scores_gemma":[0.000113418995,0.000025159556,0.00017002941,0.000008138933,0.0000041480007,0.000003917873,0.000008099567,0.9920245,0.000077997516,0.005275779,0.0021807938,0.000108065666],"about_ca_topic_score_codex":0.000021461183,"about_ca_topic_score_gemma":0.000009759729,"teacher_disagreement_score":0.39300773,"about_ca_system_score_codex":0.000028686201,"about_ca_system_score_gemma":0.000014839209,"threshold_uncertainty_score":0.31448996},"labels":[],"label_agreement":null},{"id":"W1959830946","doi":"10.1109/icsmc.1998.725414","title":"Performance bounds for distributed memory multithreaded architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Thread (computing); Parallel computing; Context switch; Multithreading; Synchronization (alternating current); Distributed memory; Architecture; Memory architecture; Distributed computing; Shared memory; Computer architecture; Embedded system; Operating system; Computer network","score_opus":0.025609530469589886,"score_gpt":0.24674714047942103,"score_spread":0.22113761000983115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959830946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009363328,0.00005446848,0.98306346,0.00068386074,0.000099785146,0.00018109461,0.0000030390001,0.001021212,0.0055297767],"genre_scores_gemma":[0.6280361,0.000012832722,0.37044206,0.00031081124,0.000035791094,0.00002673161,0.000005020338,0.0000052267947,0.0011254159],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924594,0.00001819345,0.0001500575,0.0002471793,0.00011433584,0.00022427949],"domain_scores_gemma":[0.9994154,0.000072314244,0.000047522637,0.00034339057,0.00006610142,0.000055266322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093738694,0.00010461068,0.000105433144,0.000070711445,0.00017697773,0.00010208294,0.0005412487,0.000043045657,0.000024189027],"category_scores_gemma":[0.000036225432,0.00008718952,0.000052276053,0.00019636595,0.000031079257,0.00010415915,0.000089458415,0.00006421843,0.000017744624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028200626,0.00044568477,0.0027928601,0.0001257796,0.00007072245,0.00000568316,0.0020554357,0.1584198,0.00049977016,0.016564608,0.15650772,0.66248375],"study_design_scores_gemma":[0.00026028077,0.00007505035,0.00041054905,0.0000070693877,0.0000016733785,0.000006713509,0.0000030771403,0.9899333,0.004873275,0.00045522235,0.0038335575,0.00014023624],"about_ca_topic_score_codex":0.0000074778827,"about_ca_topic_score_gemma":0.0000021352082,"teacher_disagreement_score":0.8315135,"about_ca_system_score_codex":0.000018245808,"about_ca_system_score_gemma":0.000008325011,"threshold_uncertainty_score":0.35554853},"labels":[],"label_agreement":null},{"id":"W1960744987","doi":"10.1109/mwscas.1990.140737","title":"A floating point convolution system","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"VMEbus; Convolution (computer science); Application-specific integrated circuit; Computer science; Very-large-scale integration; Floating point; Interface (matter); Point (geometry); Computer hardware; Integer (computer science); Parallel computing; Embedded system; Operating system; Artificial intelligence; Data acquisition; Mathematics","score_opus":0.020049096869676947,"score_gpt":0.2175971893268964,"score_spread":0.19754809245721944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960744987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028634723,0.00006257257,0.9167789,0.00031965188,0.00010058996,0.00005624383,7.654875e-8,0.0018678005,0.080527775],"genre_scores_gemma":[0.6283235,0.0000027874344,0.37076688,0.0001255122,0.000021470963,0.0000018667008,1.957668e-7,0.0000022506708,0.00075553905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942017,0.000038130653,0.00013809955,0.00016747846,0.00010743597,0.00012871613],"domain_scores_gemma":[0.9995928,0.000025419014,0.000046588673,0.00024619134,0.000051274223,0.000037760965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015623927,0.000057698755,0.000067626366,0.000056761237,0.00010300368,0.000085639535,0.00029353323,0.000028172411,0.000023092152],"category_scores_gemma":[0.000016744738,0.000051390718,0.000027210424,0.00019506416,0.0000087067465,0.00020148004,0.00008922641,0.000044275803,0.0001452564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.876478e-7,0.000054612396,0.0002366233,0.00003500022,0.0000104741275,0.0000117216905,0.0008594172,0.0067201215,0.00028723228,0.918266,0.040218208,0.03329991],"study_design_scores_gemma":[0.000068976646,0.000017904604,0.0000323134,0.000017245467,6.370039e-7,0.000019913205,0.000016886652,0.99777687,0.00095397717,0.0001856666,0.00083726965,0.00007232824],"about_ca_topic_score_codex":0.000017373193,"about_ca_topic_score_gemma":3.4485564e-7,"teacher_disagreement_score":0.99105674,"about_ca_system_score_codex":0.000040770625,"about_ca_system_score_gemma":0.0000041555454,"threshold_uncertainty_score":0.20956527},"labels":[],"label_agreement":null},{"id":"W1964042491","doi":"10.1109/hpca.2012.6169038","title":"Architectural support for synchronization-free deterministic parallel programming","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software versioning; Synchronization (alternating current); Programmer; Parallel computing; Programming language; Operating system; Programming paradigm; Distributed computing; Software; Computer network","score_opus":0.020411114509794572,"score_gpt":0.2789961075102326,"score_spread":0.2585849930004381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964042491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022322204,0.000040809628,0.9954435,0.0003012027,0.00022441438,0.0003691372,0.0000012915744,0.0009846096,0.0024117618],"genre_scores_gemma":[0.36013085,0.000001268814,0.638858,0.00022363044,0.00009379982,0.00006650264,0.000008624784,0.000008618043,0.00060870097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989021,0.00003036124,0.00022941381,0.00022847766,0.00015366012,0.0004559801],"domain_scores_gemma":[0.99904734,0.0001332082,0.00008203638,0.00052128267,0.00008507688,0.00013103957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029628864,0.0001339251,0.00013026419,0.000089123474,0.0001753379,0.0001460467,0.00083469594,0.0000498621,0.000015408727],"category_scores_gemma":[0.00015454492,0.00011638476,0.00006804182,0.00019457338,0.000032125623,0.00033049448,0.00024256704,0.000059001155,0.000016980595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018647816,0.00031303335,0.0052799997,0.00011931858,0.00004976014,0.0000038686894,0.001869749,0.0095336605,0.000035492478,0.28525263,0.017020235,0.6805036],"study_design_scores_gemma":[0.0006918624,0.00029151497,0.001155252,0.000018169192,0.000014238347,0.00010942978,0.000013394004,0.9614666,0.0005520178,0.0065176454,0.028644087,0.0005257803],"about_ca_topic_score_codex":0.000004674727,"about_ca_topic_score_gemma":0.0000017051294,"teacher_disagreement_score":0.95193297,"about_ca_system_score_codex":0.000028895787,"about_ca_system_score_gemma":0.000051413084,"threshold_uncertainty_score":0.4746033},"labels":[],"label_agreement":null},{"id":"W1964185335","doi":"10.1109/newcas.2014.6934044","title":"A memory transaction model for Sparse Matrix-Vector multiplications on GPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"CUDA; Parallel computing; Computer science; Sparse matrix; Multiplication (music); Row; Matrix multiplication; Matrix (chemical analysis); Double-precision floating-point format; Computational science; Algorithm; Mathematics; Programming language","score_opus":0.028788041927622816,"score_gpt":0.28486139285083356,"score_spread":0.25607335092321076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964185335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029481295,0.000005100193,0.9938278,0.0012106964,0.00008385812,0.0002842536,0.0000017693698,0.0009640421,0.003327654],"genre_scores_gemma":[0.46096498,0.0000028061645,0.5366181,0.00032049319,0.000025997177,0.00006362907,0.0000023796324,0.0000061624382,0.0019954396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992667,0.000028461558,0.00015980688,0.00028691677,0.00010700907,0.00015110994],"domain_scores_gemma":[0.99925977,0.00012253119,0.000053302665,0.00042494707,0.0000821833,0.000057294463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021498417,0.00009422101,0.000096549775,0.00009257489,0.00014655772,0.00006848932,0.00037008946,0.00005288846,0.0000038599524],"category_scores_gemma":[0.000033234584,0.000085436535,0.00006811975,0.00013382794,0.000012022129,0.00015100738,0.00001850851,0.000056469296,0.000023014998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001114882,0.000106684776,0.0000024998483,0.000010001107,0.0000063698253,6.1557486e-8,0.00027501315,0.8450061,0.00058914255,0.112613715,0.0048171855,0.036562096],"study_design_scores_gemma":[0.00024350866,0.00006249253,0.000021656204,0.0000055433543,0.0000029190528,0.0000011815304,0.0000017520226,0.987336,0.006951185,0.0044047106,0.00085667166,0.00011238316],"about_ca_topic_score_codex":0.000008568772,"about_ca_topic_score_gemma":0.0000042105444,"teacher_disagreement_score":0.46067014,"about_ca_system_score_codex":0.000025989093,"about_ca_system_score_gemma":0.000024235786,"threshold_uncertainty_score":0.34840006},"labels":[],"label_agreement":null},{"id":"W1964225254","doi":"10.1145/1880018.1880019","title":"Contention-Aware Scheduling on Multicore Systems","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Multi-core processor; Fair-share scheduling; Cache; Shared memory; Parallel computing; Quality of service; Operating system; Computer network","score_opus":0.026483386054960152,"score_gpt":0.2628462369562809,"score_spread":0.23636285090132075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964225254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004134219,0.000045885063,0.98048127,0.0003581009,0.012354662,0.00057432486,0.000009693782,0.0017648722,0.00027699055],"genre_scores_gemma":[0.8519436,0.000009591955,0.14686517,0.00018708533,0.0004807153,0.0000979028,0.0000062347344,0.00002961018,0.0003800421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976389,0.00018022255,0.0005665326,0.00073566404,0.0004771714,0.00040155672],"domain_scores_gemma":[0.9971322,0.00035815273,0.00020906745,0.0018039607,0.0003012121,0.00019541667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000433703,0.00033354654,0.00037318293,0.0003923737,0.0005067851,0.0007560887,0.0016970001,0.00022589859,0.0000060879306],"category_scores_gemma":[0.000020535004,0.00030998123,0.00017661508,0.00045091205,0.00004824204,0.00037311483,0.000039517367,0.00067337864,0.00017577052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017237257,0.00040294154,0.000088804496,0.0000967475,0.000106664695,0.000027357459,0.00035882188,0.9514528,0.00030672745,0.018434282,0.0013512047,0.027356422],"study_design_scores_gemma":[0.00050029525,0.00022978513,0.00010503252,0.00023719792,0.000009584253,0.00008796369,0.000026650176,0.9945075,0.00041826846,0.00006266963,0.003457656,0.0003573902],"about_ca_topic_score_codex":0.00013900678,"about_ca_topic_score_gemma":0.000007677166,"teacher_disagreement_score":0.84780943,"about_ca_system_score_codex":0.000061254366,"about_ca_system_score_gemma":0.0000609691,"threshold_uncertainty_score":0.9999352},"labels":[],"label_agreement":null},{"id":"W1964232008","doi":"10.1145/1646353.1646371","title":"Managing contention for shared resources on multicore processors","year":2010,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Scheduling (production processes); Shared memory; Processor scheduling; Distributed computing; Computer architecture; Operating system; Schedule","score_opus":0.05481865445768931,"score_gpt":0.31922914033000044,"score_spread":0.26441048587231114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964232008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06833998,0.0004120261,0.68695575,0.22788505,0.0006211989,0.0019429995,0.000021043923,0.0011911534,0.012630804],"genre_scores_gemma":[0.50617564,0.000013877141,0.49351263,0.00012431758,0.000006485117,0.00003546842,0.000002759186,0.0000037185396,0.0001251019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995056,0.00004834284,0.00015786223,0.00011984823,0.00008744578,0.00008093394],"domain_scores_gemma":[0.9860226,0.00028848735,0.00016610243,0.013338402,0.00016708579,0.000017355424],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00027876408,0.000056466964,0.00007284503,0.000061705665,0.0003127352,0.00005874405,0.02171791,0.00003377659,9.859766e-7],"category_scores_gemma":[0.0032714014,0.000042892152,0.00006185817,0.00019088892,0.000088593784,0.00011033166,0.0057670427,0.00013973552,0.0000018900464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008126059,0.00134759,0.0065158615,0.00023445819,0.00014588572,2.1390834e-7,0.012118622,0.010580205,0.027228551,0.71915644,0.10006292,0.12252802],"study_design_scores_gemma":[0.0004683405,0.00006688655,0.005780507,0.00015780491,0.000014008225,0.000002320476,0.0000685915,0.70054644,0.012146444,0.2631189,0.017442977,0.00018677542],"about_ca_topic_score_codex":0.000010017638,"about_ca_topic_score_gemma":0.00001182067,"teacher_disagreement_score":0.68996626,"about_ca_system_score_codex":0.0000073503747,"about_ca_system_score_gemma":0.000014712793,"threshold_uncertainty_score":0.98357505},"labels":[],"label_agreement":null},{"id":"W1964533240","doi":"10.1109/tmag.2011.2177814","title":"Power Aware Parallel 3-D Finite Element Mesh Refinement Performance Modeling and Analysis With CUDA/MPI on GPU and Multi-Core Architecture","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Parallel computing; CUDA; SPMD; Computational science; GPU cluster; Finite element method; Multi-core processor; SIMD; Software; Computation; Supercomputer; Algorithm; Operating system","score_opus":0.022970544148214294,"score_gpt":0.2509497496219653,"score_spread":0.22797920547375103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964533240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040004294,0.000099208984,0.95907414,0.00027091478,0.00006413857,0.00018647758,0.000008638302,0.00018396149,0.00010824658],"genre_scores_gemma":[0.7028686,0.0002523946,0.2964759,0.00020537108,0.0000089358455,0.000021855607,0.0000026034397,0.000009887952,0.00015446646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988024,0.000041950592,0.00022831558,0.00035267774,0.0002653843,0.00030927086],"domain_scores_gemma":[0.9992553,0.00005501515,0.00006778735,0.00040962358,0.00007010373,0.00014217554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017028676,0.00022483557,0.0002007569,0.00031175793,0.0002690292,0.00008591455,0.0001847964,0.00006900838,0.000018593979],"category_scores_gemma":[0.0000018303452,0.00018477603,0.000052067637,0.00043616613,0.000044566368,0.00012879506,0.000008146188,0.00025012682,0.000002887026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029333076,0.00015952445,0.00041493034,0.000013669961,0.000070244554,9.746246e-7,0.0009141386,0.9807926,0.000011255936,0.000072724804,0.00001531519,0.017505279],"study_design_scores_gemma":[0.0004617922,0.0005711679,0.0006929234,0.000033808014,0.000092371396,0.0000057474817,0.000028661523,0.9973314,0.0003666351,0.000018561454,0.0001538719,0.00024308408],"about_ca_topic_score_codex":0.000010480138,"about_ca_topic_score_gemma":0.000013537306,"teacher_disagreement_score":0.66286427,"about_ca_system_score_codex":0.00002689789,"about_ca_system_score_gemma":0.000018039558,"threshold_uncertainty_score":0.7534948},"labels":[],"label_agreement":null},{"id":"W1964642996","doi":"10.1145/1806672.1806680","title":"Interprocedural induction variable analysis based on interprocedural SSA form IR","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Variable (mathematics); Parallel computing; Heap (data structure); Algorithm; Programming language; Mathematics","score_opus":0.007423614477936341,"score_gpt":0.24588756225543565,"score_spread":0.2384639477774993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964642996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016714495,0.000002085992,0.9682953,0.0006348936,0.00041486404,0.00010668113,8.464292e-7,0.0010605035,0.0127703305],"genre_scores_gemma":[0.6813776,4.7339438e-7,0.31696787,0.0011062307,0.00004686128,0.000013641433,0.0000061348096,0.000006425599,0.00047477207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870235,0.000029152465,0.0002868732,0.0004621219,0.000244513,0.0002750173],"domain_scores_gemma":[0.9989369,0.00006709429,0.00011845252,0.00061261415,0.00016143068,0.00010349183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034228977,0.00018089799,0.00021178646,0.0005584544,0.00014049235,0.00022897728,0.0008290178,0.000120059805,0.0001398382],"category_scores_gemma":[0.000106882144,0.00015041043,0.00013192084,0.0015116216,0.000035155863,0.00047973142,0.0001523424,0.00034118135,0.000032773038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002953427,0.001977997,0.028449254,0.00014826324,0.000884225,0.00002210968,0.002581817,0.3497956,0.01265706,0.38280398,0.046353567,0.17403078],"study_design_scores_gemma":[0.00013965217,0.000106507636,0.0012913737,0.0000117782265,0.000022950895,0.000006107161,0.000008651019,0.9903553,0.0053774235,0.0021526415,0.00032267792,0.00020494903],"about_ca_topic_score_codex":0.00009633968,"about_ca_topic_score_gemma":0.000051303083,"teacher_disagreement_score":0.6646631,"about_ca_system_score_codex":0.00004201576,"about_ca_system_score_gemma":0.00009941004,"threshold_uncertainty_score":0.61335593},"labels":[],"label_agreement":null},{"id":"W1964784760","doi":"10.1088/1742-6596/256/1/012026","title":"SciNet: Lessons Learned from Building a Power-efficient Top-20 System and Data Centre","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":516,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Data center; Power (physics); State (computer science); Efficient energy use; Research centre; Point (geometry); Operating system; Architectural engineering; Engineering; Electrical engineering; Library science","score_opus":0.051577318952434406,"score_gpt":0.3030222129466453,"score_spread":0.2514448939942109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964784760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06785494,0.00007065178,0.9289291,0.002103187,0.00045538237,0.000051269177,0.00001860749,0.000097852695,0.00041900532],"genre_scores_gemma":[0.83969826,0.000023871995,0.16008145,0.000028092329,0.00013405805,2.7759077e-7,0.0000030480362,0.0000059837816,0.000024951152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891514,0.000061767525,0.0003017652,0.0002753831,0.00027267323,0.00017328415],"domain_scores_gemma":[0.9984579,0.000080704165,0.00039809264,0.0006141792,0.0003416894,0.00010743891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036362628,0.00013363952,0.0002543704,0.00006263931,0.00015120282,0.00044964594,0.0012560424,0.0000534077,0.000004830378],"category_scores_gemma":[0.000067506655,0.00011286558,0.00003746699,0.00017525018,0.000081505736,0.0007100469,0.0004372834,0.00033517872,0.0000018376784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034432298,0.00012942267,0.0005528666,0.00004167043,0.000079548154,0.00004276234,0.0034438884,0.0035053578,0.059946604,0.80753803,0.0009294929,0.12375593],"study_design_scores_gemma":[0.0011416599,0.00033254983,0.001580814,0.000825862,0.000070041926,0.00023004308,0.0016986469,0.744102,0.2001446,0.041216023,0.007824415,0.0008333067],"about_ca_topic_score_codex":0.000017825605,"about_ca_topic_score_gemma":0.0000053362346,"teacher_disagreement_score":0.7718433,"about_ca_system_score_codex":0.00001436634,"about_ca_system_score_gemma":0.00018583896,"threshold_uncertainty_score":0.46025246},"labels":[],"label_agreement":null},{"id":"W1965141213","doi":"10.5539/nct.v2n1p52","title":"Transparent Offloading of Computationally Demanding Operations in Microsoft .NET","year":2013,"lang":"en","type":"article","venue":"Network and Communication Technologies","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; .NET Framework; Operating system; Programming language; Microsoft Visual Studio; Microsoft Office; Microsoft Windows; Code (set theory); Software; Parallel computing","score_opus":0.020606209904847635,"score_gpt":0.257430473665942,"score_spread":0.2368242637610944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965141213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028887257,0.0033824823,0.96316385,0.0029771996,0.000022840175,0.00024501502,5.410139e-7,0.00074857223,0.0005722463],"genre_scores_gemma":[0.6839612,0.0011996825,0.31472638,0.000048652902,0.0000024303577,0.000041916835,0.0000055244973,0.000003005983,0.000011232728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.00007065559,0.00032676637,0.00016549557,0.00008426346,0.00014731773],"domain_scores_gemma":[0.99918145,0.00015504131,0.00008578311,0.00047051904,0.000092665876,0.0000145661725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022744924,0.000090758345,0.00016211296,0.00014875122,0.00016858395,0.0000961684,0.00080561324,0.00008608213,0.0000026052883],"category_scores_gemma":[0.000033273995,0.000088537636,0.000018524544,0.0004733163,0.00011371799,0.0002996406,0.00031071942,0.00014827368,0.0000021838002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023230677,0.00010607555,0.012743129,0.00003497658,0.000023366985,3.6602606e-7,0.00124301,0.5685995,0.0007508448,0.28358707,0.001997539,0.1309118],"study_design_scores_gemma":[0.00023445161,0.000051802715,0.010533485,0.00017682287,0.000003005916,0.0000045982692,0.00018197138,0.9249951,0.001166677,0.062019214,0.000454359,0.0001785058],"about_ca_topic_score_codex":0.00005723766,"about_ca_topic_score_gemma":0.000037158265,"teacher_disagreement_score":0.65507394,"about_ca_system_score_codex":0.000018529441,"about_ca_system_score_gemma":0.000017764685,"threshold_uncertainty_score":0.361046},"labels":[],"label_agreement":null},{"id":"W1965275787","doi":"10.5555/1071565.1071585","title":"a synergy between efficient interpretation and fast selective dynamic compilation for the acceleration of embedded Java virtual machines","year":2004,"lang":"en","type":"article","venue":"Espace ÉTS (ETS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Concordia University","funders":"","keywords":"Bytecode; Computer science; Just-in-time compilation; Interpreter; Compiler; Programming language; Dynamic compilation; Java; Virtual machine; Java bytecode; Abstract interpretation; Compile time; Code (set theory); Acceleration; Operating system; Java applet; Java annotation","score_opus":0.009028066298850218,"score_gpt":0.2681463728558997,"score_spread":0.2591183065570495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965275787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075443454,0.00005692653,0.9230583,0.00076229364,0.00008877795,0.0003578757,0.000009106092,0.00013945969,0.00008380486],"genre_scores_gemma":[0.9454673,0.000007627582,0.054341756,0.000049148992,0.000026436062,0.000024677038,0.000026772184,0.000008406831,0.00004785316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916154,0.00006596578,0.00021760626,0.00025805118,0.00016350413,0.00013334112],"domain_scores_gemma":[0.9991184,0.00027690336,0.00019379145,0.00020485818,0.00017475299,0.000031311425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027810325,0.000121948666,0.00015277044,0.00012540197,0.00019606699,0.00010971564,0.00026360116,0.000055318378,8.5735815e-7],"category_scores_gemma":[0.000084107516,0.00009611116,0.0000439408,0.00029564457,0.00004918541,0.00018594165,0.00008986634,0.00008047191,0.0000011931114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042195523,0.000047935107,0.00025905258,0.00001485154,0.000037231708,2.1091371e-7,0.0073758843,0.93257916,0.0011054998,0.0155927595,0.00006706432,0.042878132],"study_design_scores_gemma":[0.00040314085,0.0001871566,0.006883277,0.00003753709,0.000013559381,0.0000022662844,0.00007271392,0.9867957,0.0043309117,0.0011401498,0.000025353705,0.00010820209],"about_ca_topic_score_codex":0.000028350003,"about_ca_topic_score_gemma":0.000033610988,"teacher_disagreement_score":0.87002385,"about_ca_system_score_codex":0.00006422018,"about_ca_system_score_gemma":0.000049291575,"threshold_uncertainty_score":0.39192992},"labels":[],"label_agreement":null},{"id":"W1965470538","doi":"10.1145/2628071.2628097","title":"Velociraptor","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Compiler; Computer science; Parallel computing; Programming language; Computer architecture","score_opus":0.010252162443351946,"score_gpt":0.23335952607413532,"score_spread":0.22310736363078337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965470538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016024213,0.0000046706714,0.89899886,0.00047198922,0.000063059815,0.00001543045,1.1871327e-8,0.00081128103,0.09947447],"genre_scores_gemma":[0.37251547,0.0000012119801,0.62576663,0.00073216885,0.000021726195,0.0000012695125,1.5314717e-7,0.0000014486487,0.00095991464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996833,0.00002015259,0.000054678232,0.000106748164,0.00006039595,0.00007468152],"domain_scores_gemma":[0.9996859,0.000024399167,0.00001460043,0.00022431508,0.00002377823,0.000027011325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013178911,0.00003246823,0.000037030102,0.000029841727,0.00003986169,0.000049550035,0.00034600165,0.000015417265,0.00001100142],"category_scores_gemma":[0.000020215291,0.000027212958,0.000014779273,0.00010267849,0.0000064858264,0.000087607164,0.000071155206,0.000023343693,0.000078968864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8390533e-7,0.000009860263,0.00012015117,0.0000010286669,0.0000013687644,1.7997424e-7,0.000047933307,0.0005116359,0.000056275392,0.9039888,0.016771568,0.07849103],"study_design_scores_gemma":[0.00006262599,0.000027880504,0.00042283107,0.0000020063133,2.7262413e-7,0.0000020496157,5.477386e-7,0.9201146,0.0031863933,0.013335482,0.06276372,0.00008158808],"about_ca_topic_score_codex":0.0000028691536,"about_ca_topic_score_gemma":1.6057287e-7,"teacher_disagreement_score":0.919603,"about_ca_system_score_codex":0.0000038872117,"about_ca_system_score_gemma":0.000006167937,"threshold_uncertainty_score":0.11097122},"labels":[],"label_agreement":null},{"id":"W1965821966","doi":"10.1007/s11265-008-0293-4","title":"Multiprocessor, Multithreading and Memory Optimization for On-Chip Multimedia Applications","year":2008,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada); Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Multithreading; Computer science; Multiprocessing; Adaptation (eye); Computer architecture; Parallel computing; Locality; Chip; Embedded system; Thread (computing); Operating system","score_opus":0.030468916980718644,"score_gpt":0.273168184106578,"score_spread":0.24269926712585937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965821966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012823789,0.0014554753,0.9964019,0.00010185853,0.00010947778,0.00035477482,0.0000013429124,0.00012662412,0.0001661475],"genre_scores_gemma":[0.57688254,0.000052008123,0.4226811,0.00005432645,0.00021599948,0.000032394983,0.0000011216285,0.000012694123,0.00006781724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865043,0.000050395814,0.000570471,0.00023197928,0.0003135335,0.00018320729],"domain_scores_gemma":[0.99806416,0.00023187061,0.0007619206,0.0001310833,0.00069143524,0.00011955213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005785697,0.00015208872,0.00028496626,0.00027782313,0.00042429165,0.00018435145,0.0004140602,0.00008407065,6.675447e-7],"category_scores_gemma":[0.000069100264,0.00012847075,0.000060801845,0.0002789936,0.00006164391,0.00059327064,0.000035160574,0.00015976578,0.0000010240652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041233507,0.00014790545,0.00024907434,0.00029916078,0.000028876451,0.000009686373,0.0015422364,0.93717456,0.0005761135,0.00033397725,0.00052556174,0.05907162],"study_design_scores_gemma":[0.00064235,0.0001556026,0.000031342606,0.00029935612,0.000009793442,0.0002809939,0.00005981996,0.99697375,0.0009905803,0.00009718106,0.0003089198,0.00015032633],"about_ca_topic_score_codex":0.0000035286437,"about_ca_topic_score_gemma":9.131337e-8,"teacher_disagreement_score":0.57560015,"about_ca_system_score_codex":0.0000487976,"about_ca_system_score_gemma":0.00015077318,"threshold_uncertainty_score":0.5238885},"labels":[],"label_agreement":null},{"id":"W1965979241","doi":"10.1145/1278349.1278356","title":"MPSoC memory optimization using program transformation","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; MPSoC; Parallel computing; Cache; Multiprocessing; Code (set theory); Computer architecture; System on a chip; Loop tiling; Embedded system; Compiler; Programming language","score_opus":0.029455890917239734,"score_gpt":0.2916100862890081,"score_spread":0.2621541953717684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965979241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046623734,0.000117691445,0.9961952,0.00008887233,0.00024148801,0.00087864185,0.0000011583043,0.0013773642,0.00063334656],"genre_scores_gemma":[0.5550622,0.000021350847,0.4447527,0.000018242854,0.000016956224,0.000040736486,0.0000053200743,0.000013330807,0.00006919074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978661,0.00022365639,0.0007317882,0.0003052448,0.00045318448,0.00042005093],"domain_scores_gemma":[0.9984667,0.00020654309,0.00036631545,0.00061928766,0.0002709503,0.00007024412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015372306,0.00019943409,0.00024289144,0.0007279046,0.00024143113,0.00011410866,0.0006335735,0.00016077598,0.000014988801],"category_scores_gemma":[0.000027472477,0.00020792942,0.00010582816,0.0012416206,0.000033685737,0.0007768817,0.000005115906,0.00018453244,0.000006875318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016725957,0.0001295789,7.0061566e-7,0.000026215024,0.000029214052,4.076788e-7,0.00033993725,0.897506,0.0003515362,0.0021211605,0.00001898457,0.09945955],"study_design_scores_gemma":[0.00035856417,0.00041283228,0.000015898888,0.000070770555,0.000019919782,0.000034446744,0.000048422124,0.982656,0.015797429,0.00027785802,0.00011284037,0.00019499678],"about_ca_topic_score_codex":0.000030164829,"about_ca_topic_score_gemma":0.0000016752432,"teacher_disagreement_score":0.55459595,"about_ca_system_score_codex":0.0003145744,"about_ca_system_score_gemma":0.00015564606,"threshold_uncertainty_score":0.8479116},"labels":[],"label_agreement":null},{"id":"W1966497181","doi":"10.1007/s10732-007-9051-1","title":"Learning heuristics for basic block instruction scheduling","year":2007,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Critical path method; Scheduling (production processes); Compiler; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.01640675964308066,"score_gpt":0.27828064970157473,"score_spread":0.2618738900584941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966497181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025002554,0.00013186083,0.97340924,0.00013574329,0.0008492898,0.00006286433,5.1287634e-7,0.000102245984,0.00030566542],"genre_scores_gemma":[0.4618226,0.00004690279,0.537689,0.000055261324,0.0003231943,2.4287104e-7,4.864334e-7,0.000008101041,0.00005421167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987106,0.000044373734,0.00060821295,0.00012994041,0.0002764181,0.00023045798],"domain_scores_gemma":[0.99808776,0.0003406859,0.00062185555,0.00015308154,0.00069034577,0.0001062467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014850207,0.0001100613,0.00020171239,0.00024344245,0.00019520603,0.000111696914,0.00043469065,0.000078382574,9.589005e-7],"category_scores_gemma":[0.0009864438,0.00010466826,0.000102542355,0.0002556691,0.000027621478,0.00017180509,0.000068751935,0.00034895184,0.0000017705624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020966142,0.0003381054,0.006407056,0.00019032502,0.00014497338,0.0001987277,0.0014960516,0.75573343,0.0013764156,0.04326883,0.0069771204,0.18365929],"study_design_scores_gemma":[0.001447797,0.001167258,0.0011886919,0.00016844805,0.0000517167,0.0008690812,0.00010578272,0.9470842,0.00667486,0.01193398,0.028912254,0.00039594527],"about_ca_topic_score_codex":8.5781215e-7,"about_ca_topic_score_gemma":3.1343663e-7,"teacher_disagreement_score":0.43682006,"about_ca_system_score_codex":0.000061811435,"about_ca_system_score_gemma":0.00009084618,"threshold_uncertainty_score":0.42682478},"labels":[],"label_agreement":null},{"id":"W1966623795","doi":"10.1109/mascots.2013.77","title":"DistCL: A Framework for the Distributed Execution of OpenCL Kernels","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programmer; Speedup; InfiniBand; Parallel computing; Partition (number theory); Kernel (algebra); Scheduling (production processes); Distributed memory; Computation; Distributed computing; Shared memory; Operating system; Programming language","score_opus":0.02147213999140837,"score_gpt":0.2812185714220267,"score_spread":0.2597464314306184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966623795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033597788,0.000049027283,0.9962038,0.0021063855,0.0000878685,0.00040471082,0.000003282726,0.00023525495,0.0005737276],"genre_scores_gemma":[0.51751775,0.000009207017,0.48207605,0.00016368311,0.000015605929,0.00006248611,0.0000034874502,0.000002573247,0.00014919309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994256,0.000023508625,0.00017088182,0.00014955214,0.000102706435,0.00012773181],"domain_scores_gemma":[0.9989962,0.00034159055,0.00008696458,0.0003979824,0.00014863696,0.00002861187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017366507,0.00006479711,0.00008854797,0.000021508517,0.000105461215,0.00010952006,0.0007404259,0.00004512675,0.000027859694],"category_scores_gemma":[0.00012467786,0.000039949515,0.000052823143,0.00021502818,0.00003539685,0.00018427054,0.00015628121,0.00005257484,0.000010582165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027823787,0.000050086797,0.00018420504,0.000010057596,0.000016078995,9.496491e-8,0.00018926829,0.0038805248,0.00008811448,0.9477561,0.02556215,0.022260515],"study_design_scores_gemma":[0.00009195092,0.00005252008,0.0022168413,0.000019971807,0.0000035393766,0.0000011517928,0.000019644454,0.8516527,0.0044496297,0.1394018,0.0019995088,0.000090766305],"about_ca_topic_score_codex":0.00008098952,"about_ca_topic_score_gemma":5.9476884e-7,"teacher_disagreement_score":0.8477722,"about_ca_system_score_codex":0.000011010292,"about_ca_system_score_gemma":0.000018539587,"threshold_uncertainty_score":0.16290939},"labels":[],"label_agreement":null},{"id":"W1966675677","doi":"10.1145/2656075.2656091","title":"Job arrival rate aware scheduling for asymmetric multi-core servers in the dark silicon era","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Scheduling (production processes); Job scheduler; Cluster (spacecraft); Arrival time; Real-time computing; Data center; Core (optical fiber); Parallel computing; Distributed computing; Computer network; Operating system; Cloud computing; Mathematical optimization; Mathematics; Engineering","score_opus":0.03748348634330085,"score_gpt":0.2925167453358425,"score_spread":0.25503325899254164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966675677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022512224,0.000024086563,0.9745679,0.0008514238,0.00013994041,0.00029296483,6.292114e-7,0.00036017795,0.0012506838],"genre_scores_gemma":[0.6297899,0.0000045589677,0.36901933,0.0010301974,0.000034995377,0.000021425582,0.000002392211,0.00000608378,0.00009112897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988758,0.00014476202,0.00023116844,0.0003382185,0.00014500513,0.00026505312],"domain_scores_gemma":[0.99888194,0.0004327051,0.00007941065,0.00046776683,0.00009356968,0.000044624485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013429691,0.0001305251,0.00014646108,0.00021401107,0.0001684725,0.00019430181,0.0009840899,0.00006509955,0.0000013986348],"category_scores_gemma":[0.00028222168,0.00009321628,0.00007215062,0.0007839898,0.000020627453,0.00022391275,0.00012972056,0.00015557135,0.000008416992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049957172,0.00047362302,0.031001119,0.00016789572,0.000054893488,0.000011495673,0.0036625424,0.5558115,0.00062817696,0.25593704,0.010925931,0.14127578],"study_design_scores_gemma":[0.0004928048,0.00006392408,0.0054816785,0.00001704502,0.000002090858,0.0000021826704,0.00003379123,0.9907889,0.0007229325,0.0017835789,0.0004674218,0.0001436957],"about_ca_topic_score_codex":0.000057532285,"about_ca_topic_score_gemma":0.00002253375,"teacher_disagreement_score":0.60727763,"about_ca_system_score_codex":0.00002566707,"about_ca_system_score_gemma":0.000038800976,"threshold_uncertainty_score":0.38012496},"labels":[],"label_agreement":null},{"id":"W1966678916","doi":"10.1016/j.datak.2009.08.006","title":"Sorting improves word-aligned bitmap indexes","year":2009,"lang":"en","type":"article","venue":"Data & Knowledge Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université du Québec à Montréal","funders":"","keywords":"Bitmap; Lexicographical order; Sorting; Sorting algorithm; sort; Aggregate (composite); Table (database); Construct (python library); Simple (philosophy)","score_opus":0.02252072736554118,"score_gpt":0.27281816931913383,"score_spread":0.25029744195359266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966678916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014297736,0.00078045146,0.9941354,0.00016064668,0.0003123985,0.00009957775,0.000004366862,0.0017673622,0.0013100595],"genre_scores_gemma":[0.33251774,0.000034390257,0.66680604,0.00009733884,0.00026873185,0.000005699797,0.00006395108,0.000019115452,0.00018699297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987097,0.000021731694,0.000296135,0.0004921056,0.00012977149,0.0003505597],"domain_scores_gemma":[0.9985397,0.000073024836,0.000075985845,0.0011580636,0.0000577831,0.0000954554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004061922,0.0001899172,0.00018655547,0.00019939311,0.00010601221,0.00023403927,0.0020356565,0.00007091455,0.0000029029125],"category_scores_gemma":[0.00018475433,0.00019438686,0.000029469024,0.0005443951,0.0000100281095,0.0007921478,0.00067369296,0.00013174009,0.00003422016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002791918,0.00013025173,0.00006156053,0.000049617884,0.00003108665,0.000015164579,0.00085218693,0.004067713,0.016354974,0.018820988,0.010556758,0.9490569],"study_design_scores_gemma":[0.00010904107,0.000033635697,0.00048729268,0.00005838272,0.000003827007,0.0000068220647,0.000003008361,0.98883384,0.0038617565,0.00041937266,0.0059246398,0.0002583974],"about_ca_topic_score_codex":0.00000355147,"about_ca_topic_score_gemma":0.000001067666,"teacher_disagreement_score":0.9847661,"about_ca_system_score_codex":0.000030414989,"about_ca_system_score_gemma":0.00004339328,"threshold_uncertainty_score":0.7926866},"labels":[],"label_agreement":null},{"id":"W1967423732","doi":"10.1145/1508128.1508181","title":"Customizable bit-width in an OpenMP-based circuit design tool","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Compiler; Benchmark (surveying); Abstraction; Computer architecture; Set (abstract data type); Implementation; Register-transfer level; Abstraction layer; Parallel computing; Programming language; Logic synthesis; Software; Logic gate; Algorithm","score_opus":0.04253677194023555,"score_gpt":0.2777434950950347,"score_spread":0.23520672315479915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967423732","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000982746,0.000019260735,0.988719,0.00039160383,0.000044576045,0.00023284886,1.6983294e-7,0.0010099132,0.008599903],"genre_scores_gemma":[0.436482,0.0000023992404,0.5612249,0.0019374577,0.000013065878,0.000006694314,0.0000015574865,0.000004390752,0.0003275517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987594,0.00014860582,0.0002444624,0.00038322018,0.00017599191,0.00028834795],"domain_scores_gemma":[0.9991715,0.00006409461,0.000055060864,0.0005688209,0.0000657922,0.000074763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061109185,0.00013020542,0.00015990672,0.00022379226,0.00008195652,0.00026969315,0.0009662616,0.00006896273,0.00003338646],"category_scores_gemma":[0.000031920226,0.00012072561,0.000032343803,0.0006097753,0.000013772012,0.0006050539,0.000048277634,0.00010402604,0.000036035734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016902046,0.00032201823,0.00063013117,0.00000432163,0.000002710538,0.00003474294,0.00021528955,0.835558,0.0006935396,0.057854224,0.009203932,0.09546417],"study_design_scores_gemma":[0.00038239587,0.00021192797,0.0009123744,0.000014178587,8.80152e-7,0.0000025459658,0.0000016097833,0.9824671,0.0062116203,0.009180254,0.0004059228,0.00020916425],"about_ca_topic_score_codex":0.00002993385,"about_ca_topic_score_gemma":0.0000032533576,"teacher_disagreement_score":0.43549928,"about_ca_system_score_codex":0.00006801572,"about_ca_system_score_gemma":0.00016379896,"threshold_uncertainty_score":0.49230474},"labels":[],"label_agreement":null},{"id":"W1967680640","doi":"10.1145/2370816.2370908","title":"Using combined profiling to decide when thread level speculation is profitable","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Profiling (computer programming); Compiler; Parallel computing; Thread (computing); Static analysis; Speculative multithreading; Operating system; Programming language; Speculative execution; Speculation; Multithreading","score_opus":0.13623442538884592,"score_gpt":0.3352952796635924,"score_spread":0.19906085427474648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967680640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016096327,0.000031535546,0.9767734,0.00053072395,0.00018196949,0.00030566496,7.1620354e-7,0.0005461387,0.0055335183],"genre_scores_gemma":[0.25221297,7.091199e-7,0.74629384,0.0006706645,0.00005584956,0.000006816943,0.0000019258614,0.000008003785,0.0007492201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989178,0.000038377784,0.00022210433,0.00024835597,0.00022135019,0.00035198787],"domain_scores_gemma":[0.9992543,0.000031851687,0.00007108126,0.00038751416,0.00012418604,0.00013105209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039677066,0.00012156252,0.0001286626,0.00012912646,0.00015184311,0.00014076017,0.00039557426,0.0000522423,0.00002832155],"category_scores_gemma":[0.000029715044,0.00011157825,0.000036800568,0.0003263996,0.000009165738,0.00071505934,0.00025597482,0.000063985106,0.00006526745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026129092,0.00033310067,0.076306686,0.000043170818,0.00005311369,0.000002749758,0.0042191073,0.031966362,0.009732597,0.84046674,0.01818907,0.018661182],"study_design_scores_gemma":[0.00019278322,0.000045637018,0.0022380224,0.00003217544,0.000005261392,0.000008492577,0.000020770703,0.8514353,0.13464077,0.010459808,0.00061611587,0.0003048763],"about_ca_topic_score_codex":0.00007330713,"about_ca_topic_score_gemma":0.0000018310157,"teacher_disagreement_score":0.8300069,"about_ca_system_score_codex":0.000065731074,"about_ca_system_score_gemma":0.000045344605,"threshold_uncertainty_score":0.4550029},"labels":[],"label_agreement":null},{"id":"W1967930082","doi":"10.1145/2576779.2576790","title":"Power Modeling for Heterogeneous Processors","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Xeon; Benchmark (surveying); Multiprocessing; Parallel computing; Xeon Phi; Power (physics); Process (computing); Embedded system; Operating system","score_opus":0.017616040869883668,"score_gpt":0.2606083709629772,"score_spread":0.2429923300930935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967930082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015293797,0.000015924545,0.9905493,0.00026498275,0.0000652928,0.00010046084,1.1520408e-7,0.00076531473,0.0067091775],"genre_scores_gemma":[0.56609935,9.555877e-7,0.43331814,0.00036169903,0.000012450614,0.000010788045,3.7660305e-7,0.0000036434699,0.00019258303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944985,0.0000134827205,0.0001114148,0.00020357329,0.0000769899,0.00014470294],"domain_scores_gemma":[0.99958324,0.000031539483,0.000026615855,0.00022716535,0.0000934211,0.000038029928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018372238,0.000064262254,0.000071957205,0.00004435918,0.00008168646,0.000083525396,0.00040779126,0.000030514428,0.0000035658152],"category_scores_gemma":[0.000038694918,0.000054839213,0.00003689196,0.00008439781,0.0000052897817,0.00011174189,0.00006886945,0.000025500018,0.000007186105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028955458,0.000028381264,0.000015021717,0.000010675966,0.0000054986926,2.195133e-7,0.00018396959,0.8964049,0.00004965112,0.09255486,0.0012030965,0.009540806],"study_design_scores_gemma":[0.00007933028,0.000054239372,5.131529e-7,0.000003830976,5.268436e-7,0.0000029750706,8.9659056e-7,0.98398703,0.001985721,0.011957834,0.0018428448,0.00008426124],"about_ca_topic_score_codex":0.0000017897945,"about_ca_topic_score_gemma":3.3486188e-7,"teacher_disagreement_score":0.56456995,"about_ca_system_score_codex":0.000006844357,"about_ca_system_score_gemma":0.000012473721,"threshold_uncertainty_score":0.22362782},"labels":[],"label_agreement":null},{"id":"W1967936195","doi":"10.1023/b:supe.0000040613.43581.53","title":"Feedback Guided Dynamic Loop Scheduling: Convergence of the Continuous Case","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Convergence (economics); Scheduling (production processes); Workload; Loop (graph theory); Mathematical optimization; Feedback loop; Parallel computing; Distributed computing; Mathematics","score_opus":0.01889259081758587,"score_gpt":0.2653310294289088,"score_spread":0.24643843861132292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967936195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50369704,0.00033129097,0.49464685,0.0008311085,0.00032143257,0.000069224676,2.964379e-7,0.00003793323,0.00006484767],"genre_scores_gemma":[0.87403995,0.000040087478,0.12562215,0.00020975116,0.000057761197,1.9149894e-7,9.078718e-8,0.000009117611,0.000020896841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823827,0.0002289331,0.00077902875,0.0001361052,0.0003676265,0.00025004428],"domain_scores_gemma":[0.99810165,0.00022001218,0.0006075394,0.0005226346,0.0004811063,0.000067082656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017462156,0.00015154484,0.00028447883,0.00007625833,0.0003169118,0.000066343804,0.0017866135,0.000058192774,0.0000034331415],"category_scores_gemma":[0.00017543577,0.00008843986,0.00017225425,0.0005446815,0.00014858082,0.00026923112,0.00043945079,0.00038341753,0.0000032270907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014851701,0.00015927896,0.0018973069,0.000036869656,0.000096721604,0.00024378071,0.006341851,0.97481155,0.0044920626,0.0044120364,0.00028103596,0.007212675],"study_design_scores_gemma":[0.001835976,0.0003408241,0.0030325304,0.00082241447,0.00010528416,0.03314627,0.00090422755,0.9238591,0.028140163,0.007277706,0.000089130444,0.00044637578],"about_ca_topic_score_codex":0.00008125801,"about_ca_topic_score_gemma":0.0000051261686,"teacher_disagreement_score":0.3703429,"about_ca_system_score_codex":0.00006632718,"about_ca_system_score_gemma":0.00022304848,"threshold_uncertainty_score":0.3606473},"labels":[],"label_agreement":null},{"id":"W1968414460","doi":"10.1145/343477.362115","title":"Memory consistency and process coordination for SPARC v8 multiprocessors (brief announcement)","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Synchronization (alternating current); Multiprocessing; Consistency (knowledge bases); Scalability; Shared memory; Parallel computing; Consistency model; Sequential consistency; Cache coherence; Process (computing); Distributed computing; Distributed shared memory; Weak consistency; Distributed memory; Memory model; Strong consistency; Memory management; Uniform memory access; Data consistency; Operating system; Computer network; Overlay; Artificial intelligence; CPU cache","score_opus":0.01578068629412666,"score_gpt":0.26900945237211593,"score_spread":0.2532287660779893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968414460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011328679,0.00011381923,0.9632253,0.00090083294,0.000046222984,0.0004058095,0.000002201428,0.0006339148,0.023343207],"genre_scores_gemma":[0.75335974,0.000032818585,0.24043317,0.00071455305,0.000029899802,0.00007727419,0.0000085313795,0.000008255613,0.0053357803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991039,0.000020808922,0.00019868568,0.00034490647,0.00014498981,0.00018672175],"domain_scores_gemma":[0.99940693,0.00006631375,0.000060891547,0.00019367062,0.00021278314,0.00005941058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023753893,0.00011244542,0.00012487767,0.00006918903,0.00020891883,0.00013786751,0.0003005167,0.000047042195,0.00003911782],"category_scores_gemma":[0.000045997826,0.000102580074,0.000025298206,0.00021660382,0.000048928036,0.00040815453,0.000035639532,0.000044539225,0.0000050660906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092262904,0.00048054277,0.0013836508,0.00040653985,0.00006362752,0.000005961887,0.004194978,0.019159056,0.00031396828,0.057877198,0.02853126,0.8874909],"study_design_scores_gemma":[0.000894187,0.00017159931,0.00029526296,0.00003313045,0.000006955095,0.000013402536,0.000051693693,0.9786734,0.0048745996,0.0075006685,0.007183856,0.00030124208],"about_ca_topic_score_codex":0.000013784468,"about_ca_topic_score_gemma":0.0000030664178,"teacher_disagreement_score":0.9595143,"about_ca_system_score_codex":0.000016240356,"about_ca_system_score_gemma":0.000056961653,"threshold_uncertainty_score":0.41830942},"labels":[],"label_agreement":null},{"id":"W1968630848","doi":"10.1145/2145694.2145731","title":"OCTAVO","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Field-programmable gate array; Computer science; Stratix; Pipeline (software); Parallel computing; Application-specific integrated circuit; Block (permutation group theory); Architecture; Embedded system; Parameterized complexity; Thread (computing); Computer architecture; Operating system","score_opus":0.019567511963647196,"score_gpt":0.26308021988000124,"score_spread":0.24351270791635404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968630848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037720767,0.000051349813,0.88912714,0.00023183452,0.000108738255,0.00001721068,1.8461611e-8,0.0006861427,0.10940037],"genre_scores_gemma":[0.5257066,0.000002420435,0.47286958,0.00039729415,0.000031339234,0.0000010023305,1.2210249e-7,0.0000011061421,0.0009905183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969333,0.000013076491,0.00004925418,0.00005859259,0.000057516932,0.00012822072],"domain_scores_gemma":[0.99973124,0.000014291259,0.000012570615,0.00017882719,0.000014919977,0.000048170914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012299344,0.000030992556,0.000030258287,0.00002795596,0.000035166628,0.000030001826,0.00025240038,0.000014822675,0.000024132327],"category_scores_gemma":[0.000008222037,0.000025258269,0.000014107038,0.00011036621,0.00000502358,0.00027815494,0.00008783476,0.000023961666,0.00013363526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3375242e-7,0.00004373172,0.0035044712,0.0000012675815,0.000002623555,3.0307052e-7,0.00027053367,0.00012853734,0.00007155716,0.92822665,0.04033651,0.02741356],"study_design_scores_gemma":[0.0003328947,0.000080262085,0.015600949,0.0000120236855,0.0000034700374,0.00006105459,0.00001907827,0.56773543,0.04244365,0.01594772,0.35704523,0.0007182564],"about_ca_topic_score_codex":0.000002627091,"about_ca_topic_score_gemma":5.3109833e-8,"teacher_disagreement_score":0.91227895,"about_ca_system_score_codex":0.00000534499,"about_ca_system_score_gemma":0.000005036857,"threshold_uncertainty_score":0.17176555},"labels":[],"label_agreement":null},{"id":"W1968894530","doi":"10.1109/cgo.2013.6494981","title":"Experiences in designing a robust and scalable interpreter profiling framework","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Profiling (computer programming); Computer science; Just-in-time compilation; Interpreter; Scalability; Compiler; Java; Operating system; Embedded system; Memory footprint; Programming language","score_opus":0.019575834977105157,"score_gpt":0.2517331922287511,"score_spread":0.23215735725164596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968894530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06945811,0.00006888002,0.9270422,0.00016661934,0.000048057056,0.00013136653,1.1705146e-8,0.00027393512,0.0028108167],"genre_scores_gemma":[0.48110154,0.0000037692405,0.5186194,0.00017121575,0.000005484576,0.00004106352,5.8250862e-8,0.0000019116349,0.00005550635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999306,0.00004210189,0.00014948373,0.00024661873,0.000079945276,0.00017579773],"domain_scores_gemma":[0.99962616,0.00009585118,0.000031141335,0.00017038503,0.000032339394,0.000044142995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001695481,0.00007586623,0.0000900277,0.00009547307,0.000056600413,0.0002961851,0.00031205686,0.000050711395,0.00003325674],"category_scores_gemma":[0.000057283727,0.0000623269,0.000012040809,0.00023668939,0.000030524614,0.0005393282,0.00019253396,0.0000995666,0.000010574262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023704246,0.00043584485,0.18667029,0.00017649408,0.00005130941,0.000046967616,0.1922815,0.088459656,0.0053198566,0.26491684,0.009639827,0.2519777],"study_design_scores_gemma":[0.000046795365,0.000033423898,0.0002805405,0.00007378262,2.7421956e-7,0.0000042485517,0.0005478596,0.98384714,0.008100447,0.0069331625,0.000011752671,0.00012059644],"about_ca_topic_score_codex":0.00005192233,"about_ca_topic_score_gemma":8.1549354e-7,"teacher_disagreement_score":0.8953875,"about_ca_system_score_codex":0.000011439034,"about_ca_system_score_gemma":0.0000136034005,"threshold_uncertainty_score":0.285612},"labels":[],"label_agreement":null},{"id":"W1968939070","doi":"10.1109/tpds.2012.135","title":"Microarchitecture of a Coarse-Grain Out-of-Order Superscalar Processor","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Microarchitecture; Parallel computing; Computer architecture; Scheduling (production processes); Out-of-order execution; Instruction-level parallelism; Overhead (engineering); Task parallelism; Field-programmable gate array; Embedded system; Parallelism (grammar); Operating system","score_opus":0.013775158719820492,"score_gpt":0.23382682806072283,"score_spread":0.22005166934090234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968939070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006744364,0.00023614017,0.9915557,0.00026511835,0.0002742048,0.0004783276,0.00009837919,0.00020341162,0.00014435519],"genre_scores_gemma":[0.97138625,0.000041670264,0.028197959,0.000032648357,0.000011834887,0.00008953945,0.000011932611,0.000009904488,0.00021828317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986423,0.0001120031,0.00046265853,0.00032292926,0.00022901836,0.00023106107],"domain_scores_gemma":[0.998954,0.00008891605,0.0001714144,0.00037435457,0.00030248257,0.00010883103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016183207,0.00019359759,0.00035356628,0.00015177134,0.00011581191,0.000078529454,0.00038138573,0.00013238327,0.000008853347],"category_scores_gemma":[0.000009488283,0.00016265565,0.00008874896,0.00042120987,0.00011011771,0.00017774465,0.0000052081505,0.00016370404,0.000008730971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005970836,0.00067906745,0.00013403695,0.0005405985,0.00018797127,0.0000042971715,0.0023432318,0.97346634,0.0076404763,0.0015370899,0.0037326256,0.009674559],"study_design_scores_gemma":[0.0011416958,0.00040276357,0.00015055457,0.00023938692,0.000032533862,0.00003423376,0.00029634326,0.9893394,0.0064113634,0.0005352614,0.00097078795,0.00044568902],"about_ca_topic_score_codex":0.00019657053,"about_ca_topic_score_gemma":0.000006286262,"teacher_disagreement_score":0.96464187,"about_ca_system_score_codex":0.000016752145,"about_ca_system_score_gemma":0.000057382644,"threshold_uncertainty_score":0.66329044},"labels":[],"label_agreement":null},{"id":"W1969772443","doi":"10.1109/fpl.2009.5272561","title":"Fast critical sections via thread scheduling for FPGA-based multithreaded processors","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multithreading; Computer science; Thread (computing); Yarn; Scheduling (production processes); Field-programmable gate array; Parallel computing; Network packet; Pipeline (software); Limiting; Embedded system; Synchronization (alternating current); Distributed computing; Operating system; Computer network","score_opus":0.028369355778711965,"score_gpt":0.3182879449196801,"score_spread":0.28991858914096813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969772443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056221953,0.000030100382,0.99192566,0.0038911793,0.00012061497,0.00024275159,0.0000010489949,0.0016009591,0.0016254557],"genre_scores_gemma":[0.4230154,8.208563e-7,0.5760049,0.0008102212,0.00004157209,0.00002048719,0.0000024695473,0.0000047262924,0.00009941831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989302,0.000025022273,0.0002194879,0.00037308928,0.0001561835,0.00029602952],"domain_scores_gemma":[0.99913377,0.00017232668,0.000044652163,0.00030386113,0.00024794086,0.0000974767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019467797,0.000137426,0.0001424827,0.00013269325,0.00028879324,0.00017522724,0.00045496263,0.00008170562,0.0000061355295],"category_scores_gemma":[0.00017332047,0.00012543445,0.00007932297,0.00036260483,0.000036264,0.0002935087,0.000031711894,0.00010803742,0.000010737228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004940478,0.0011268485,0.00016076212,0.000101334714,0.000026303263,0.000007534123,0.0008044361,0.54871047,0.0019675407,0.32648382,0.0026767512,0.11788481],"study_design_scores_gemma":[0.0002772438,0.00016879178,0.00006673125,0.000024227655,0.0000042510155,0.0000052439577,0.000008063941,0.95169085,0.029059645,0.018349215,0.00016424638,0.00018148683],"about_ca_topic_score_codex":0.0000072374028,"about_ca_topic_score_gemma":0.0000035691885,"teacher_disagreement_score":0.42245317,"about_ca_system_score_codex":0.000028897703,"about_ca_system_score_gemma":0.00007603575,"threshold_uncertainty_score":0.51150686},"labels":[],"label_agreement":null},{"id":"W1970019860","doi":"10.1049/iet-cdt.2010.0024","title":"Reordering the assembly instructions in basic blocks to reduce switching activities on the instruction bus","year":2011,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Heuristics; Operand; Computer science; Parallel computing; Integer (computer science); Power (physics); Reduction (mathematics); Computation; Integer programming; Embedded system; Code (set theory); Dissipation; Computer hardware; Programming language; Algorithm; Operating system; Mathematics","score_opus":0.02590197359389883,"score_gpt":0.2451128317876077,"score_spread":0.21921085819370886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970019860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21197161,0.00001194148,0.7729541,0.0014263389,0.00041590715,0.00052401284,0.0000017882902,0.0017855196,0.010908765],"genre_scores_gemma":[0.8700283,0.0000141519,0.12903467,0.0006743234,0.00008601393,0.00009563253,0.0000011797796,0.00002077139,0.00004494981],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983022,0.00010541594,0.00038774236,0.0005246782,0.0003050059,0.00037495545],"domain_scores_gemma":[0.9986039,0.00021787573,0.0001646984,0.0008654635,0.00007487891,0.00007320465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042427945,0.00028073118,0.00021473327,0.00037836272,0.00038610172,0.00071191334,0.0015911064,0.000094409785,0.0000018916796],"category_scores_gemma":[0.00007071158,0.00019751507,0.000099770215,0.001056175,0.00008006135,0.00102795,0.0006037247,0.00044590156,0.000005472293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046284105,0.00021478925,0.00047006155,0.00001286003,0.00004262591,0.000019152092,0.0063712243,0.0014418137,0.0009758962,0.078606114,0.005687684,0.9061115],"study_design_scores_gemma":[0.0012747259,0.0030055167,0.012100202,0.0025540113,0.00003584742,0.0011985042,0.0019702727,0.22071707,0.56594336,0.15045667,0.03655733,0.004186468],"about_ca_topic_score_codex":0.000092417264,"about_ca_topic_score_gemma":0.000010361918,"teacher_disagreement_score":0.901925,"about_ca_system_score_codex":0.000121822384,"about_ca_system_score_gemma":0.000055968987,"threshold_uncertainty_score":0.8054431},"labels":[],"label_agreement":null},{"id":"W1970815868","doi":"10.1109/hpca.2014.6835936","title":"A scalable multi-path microarchitecture for efficient GPU control flow","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Advanced Micro Devices","keywords":"Computer science; Parallel computing; Serialization; Microarchitecture; Instruction set; Scalability; Control flow; Speedup; General-purpose computing on graphics processing units; Thread (computing); Graphics; Computer graphics (images); Operating system; Programming language","score_opus":0.009141866591213008,"score_gpt":0.23756766308565916,"score_spread":0.22842579649444616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970815868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037024933,0.000038562834,0.9963744,0.0007590815,0.00014797386,0.00035278965,0.0000027020571,0.00083148206,0.0011227515],"genre_scores_gemma":[0.25809044,7.4360315e-7,0.74029505,0.0009554943,0.00004108516,0.000029898782,0.0000018862448,0.0000074953778,0.00057787803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900943,0.000062993364,0.00017388028,0.00035042223,0.00011704473,0.00028625582],"domain_scores_gemma":[0.9991818,0.00015388375,0.000056978286,0.0004137341,0.00011224879,0.000081359176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042144844,0.00012768524,0.00016373118,0.000082763276,0.00015891474,0.0001301147,0.00059657125,0.000061007366,0.0000057654734],"category_scores_gemma":[0.0000898506,0.000101326084,0.000085014835,0.00016346866,0.000026519001,0.000043255324,0.00009202302,0.000075656084,0.000019615656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021211004,0.00024043092,0.00011914676,0.00003335659,0.0000214071,8.8127257e-7,0.0004117092,0.8858446,0.0015772238,0.025113689,0.013541408,0.07307492],"study_design_scores_gemma":[0.0009151608,0.00008443241,0.000066207656,0.000011483374,0.0000028939892,0.000004187971,0.0000013282121,0.9878068,0.0028815845,0.0005013501,0.007578479,0.00014607214],"about_ca_topic_score_codex":0.0000101853275,"about_ca_topic_score_gemma":0.0000021176106,"teacher_disagreement_score":0.2577202,"about_ca_system_score_codex":0.000017780245,"about_ca_system_score_gemma":0.000027192678,"threshold_uncertainty_score":0.41319576},"labels":[],"label_agreement":null},{"id":"W1971119496","doi":"10.1145/1188966.1188973","title":"A framework for reducing instruction scheduling overhead in dynamic compilers","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Compiler; Operating system; Server; IBM; Register allocation; Instruction scheduling; Dynamic priority scheduling; Embedded system; Distributed computing; Two-level scheduling; Schedule","score_opus":0.015511566088883297,"score_gpt":0.28632906543744335,"score_spread":0.27081749934856003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971119496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042771667,0.000039811104,0.9547122,0.00037681463,0.00020935624,0.00016194176,3.685012e-7,0.0005180666,0.0012097659],"genre_scores_gemma":[0.4553008,0.0000026888285,0.5445639,0.000056829336,0.000021753482,0.000009023462,0.0000022663683,0.0000038682406,0.000038874176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918133,0.000023848921,0.0002279847,0.0002759868,0.000093919065,0.00019693736],"domain_scores_gemma":[0.9995438,0.000094044895,0.00007134501,0.00022583482,0.000043140768,0.000021848235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019997628,0.000086608576,0.0001111302,0.00017164936,0.0000917527,0.000101537786,0.0002804953,0.000077756355,0.000002368652],"category_scores_gemma":[0.00003905843,0.00008955331,0.00004017962,0.00038475898,0.000016691169,0.00023107356,0.00006095166,0.00011363783,0.0000023972761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068759646,0.000050763418,0.000816101,0.000015976926,0.000002929757,0.0000010132155,0.00013403517,0.4953994,0.00020338662,0.48266366,0.00021370978,0.020492151],"study_design_scores_gemma":[0.00020246487,0.000023149118,0.0013994481,0.000060198843,7.062081e-7,0.000003922762,0.000011104445,0.9124838,0.0006789095,0.08493557,0.00009079408,0.00010991182],"about_ca_topic_score_codex":0.00012887517,"about_ca_topic_score_gemma":0.000019379482,"teacher_disagreement_score":0.41708443,"about_ca_system_score_codex":0.00007847352,"about_ca_system_score_gemma":0.000031685075,"threshold_uncertainty_score":0.3651878},"labels":[],"label_agreement":null},{"id":"W1971121727","doi":"10.5220/0005097803690376","title":"Toward Preventing Stack Overflow Using Kernel Properties","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Buffer overflow; Computer science; Kernel (algebra); Stack (abstract data type); Operating system; System call; Call stack; Code (set theory); Linux kernel; Source code; Embedded system; Programming language","score_opus":0.05492899374626001,"score_gpt":0.2642163936416756,"score_spread":0.2092873998954156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971121727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019855682,0.000046999892,0.97085524,0.00015385012,0.0001107251,0.00008272199,6.691984e-8,0.00079892157,0.0080958055],"genre_scores_gemma":[0.5877079,0.0000027132107,0.41142198,0.0001886324,0.000037526625,0.0000016936197,1.9301314e-7,0.0000049139458,0.00063448027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991302,0.00007389183,0.0001753489,0.00025160343,0.00016434831,0.00020464118],"domain_scores_gemma":[0.9994621,0.000022714652,0.00006813257,0.00033037952,0.00007030027,0.00004633607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033435083,0.000097561155,0.00011035188,0.000059352195,0.00011475486,0.00020628712,0.00050526747,0.00003714763,0.000008984623],"category_scores_gemma":[0.000059907743,0.00007910411,0.000042302854,0.00016285971,0.000019009274,0.00034022518,0.00027737688,0.00006614013,0.000016977192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023918421,0.00050085864,0.008340865,0.0004057061,0.0001232832,0.000013108407,0.006799814,0.44561756,0.02323142,0.30351746,0.015558358,0.19586763],"study_design_scores_gemma":[0.00008105484,0.000025092293,0.000086720655,0.000033646345,0.0000016621265,0.0000059495424,0.000006025893,0.9846679,0.012498727,0.0014792093,0.0009824928,0.00013153511],"about_ca_topic_score_codex":0.000032137294,"about_ca_topic_score_gemma":6.77482e-7,"teacher_disagreement_score":0.5678522,"about_ca_system_score_codex":0.000022201013,"about_ca_system_score_gemma":0.000031522803,"threshold_uncertainty_score":0.32257718},"labels":[],"label_agreement":null},{"id":"W1971292113","doi":"10.5555/2492708.2492824","title":"Toward virtualizing branch direction prediction","year":2012,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Virtualization; Proxy (statistics); Branch predictor; Table (database); Set (abstract data type); Operating system; Computer engineering; Database; Machine learning; Programming language; Cloud computing","score_opus":0.031065654445384738,"score_gpt":0.24992439271850309,"score_spread":0.21885873827311836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971292113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007053595,0.000286336,0.989206,0.00012002686,0.0002673826,0.00015060503,8.2496734e-7,0.0010685769,0.0018466588],"genre_scores_gemma":[0.8996723,0.00016582967,0.09979592,0.00012151452,0.000091858354,0.000013066049,0.0000047695753,0.00001006944,0.000124662],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00017974658,0.0002398095,0.00019959961,0.00013727343,0.00019207192],"domain_scores_gemma":[0.99934095,0.00023510667,0.000086287815,0.00017260046,0.000102654434,0.000062372535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068122876,0.00010448843,0.00010027342,0.000181302,0.00013054156,0.00012390647,0.00016359579,0.000048141435,0.0000033910753],"category_scores_gemma":[0.0003373605,0.000103199454,0.000013003421,0.00067061966,0.000020321753,0.0008798705,0.000053889184,0.000077422446,0.00001523578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025170524,0.0014631086,0.398362,0.00022853982,0.00005217462,0.000015246942,0.03057249,0.033506047,0.009786288,0.11596393,0.02053429,0.38949072],"study_design_scores_gemma":[0.00029340686,0.00011117702,0.24657753,0.000060952992,0.0000050771455,0.000051635678,0.000008827101,0.7430128,0.003375907,0.00091329735,0.005362065,0.00022735426],"about_ca_topic_score_codex":0.000012812325,"about_ca_topic_score_gemma":4.6835436e-7,"teacher_disagreement_score":0.8926187,"about_ca_system_score_codex":0.000027054117,"about_ca_system_score_gemma":0.00002448197,"threshold_uncertainty_score":0.42083517},"labels":[],"label_agreement":null},{"id":"W1971487398","doi":"10.5555/2555729.2555747","title":"From software to accelerators with LegUp high-level synthesis","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Debugging; Hardware acceleration; Field-programmable gate array; High-level synthesis; Hardware architecture; Embedded system; Software; Coprocessor; Hardware compatibility list; Profiling (computer programming); Computer architecture; Operating system; Computer hardware","score_opus":0.01990286702719394,"score_gpt":0.22520057818975817,"score_spread":0.20529771116256423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971487398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029260049,0.0000062283148,0.9666615,0.0014434052,0.00007278973,0.0001678444,0.0000026925366,0.001238336,0.0011471263],"genre_scores_gemma":[0.3550186,9.592756e-7,0.64352363,0.00082918984,0.000034693832,0.000046711884,0.0000010859538,0.0000074208965,0.000537718],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990495,0.000033528086,0.00014228956,0.00036670527,0.00019531889,0.0002126829],"domain_scores_gemma":[0.99901074,0.00015032415,0.0000410815,0.0005276951,0.00013262301,0.00013755026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000645069,0.00013358102,0.0001436857,0.00009457012,0.00009884717,0.00033840412,0.00082779565,0.00004749953,0.00024946124],"category_scores_gemma":[0.000053773445,0.00009763325,0.000023550443,0.0003331461,0.000014790359,0.00043575975,0.00022224798,0.000061182785,0.00041532196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017907927,0.0002799776,0.0066694394,0.000016509122,0.0001436824,0.000026507763,0.0019031125,0.018507889,0.0010393476,0.025888784,0.39207876,0.5534281],"study_design_scores_gemma":[0.0015062398,0.0010303135,0.13089482,0.0005052936,0.000054232263,0.000039084265,0.00027875975,0.31669277,0.48582473,0.039815582,0.018512057,0.0048461105],"about_ca_topic_score_codex":0.0012317334,"about_ca_topic_score_gemma":0.000014599744,"teacher_disagreement_score":0.54858196,"about_ca_system_score_codex":0.000023707475,"about_ca_system_score_gemma":0.000038933165,"threshold_uncertainty_score":0.53382623},"labels":[],"label_agreement":null},{"id":"W1972292481","doi":"10.1145/2568058.2568070","title":"SIMDizing pairwise sums","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Pairwise comparison; Throughput; Computer science; Cache; Algorithm; Parallel computing; Theoretical computer science; Artificial intelligence; Wireless; Telecommunications","score_opus":0.012399444272104718,"score_gpt":0.2362136818829085,"score_spread":0.2238142376108038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972292481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000456137,0.000010635202,0.9369891,0.00066288596,0.00008001111,0.000028836224,2.4218922e-8,0.0012717643,0.060500596],"genre_scores_gemma":[0.5059541,0.0000026022392,0.4924494,0.00073587726,0.000028521637,0.0000016905894,3.005086e-7,0.000002696515,0.0008248207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946964,0.00004224048,0.000094467956,0.00016991474,0.00009481854,0.0001289187],"domain_scores_gemma":[0.9995149,0.000058937458,0.000027504222,0.0003176772,0.00003550031,0.00004552204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026326222,0.000056159188,0.000061570856,0.000049145157,0.00007140652,0.00009432192,0.0004479945,0.000024929943,0.000010775607],"category_scores_gemma":[0.000042138985,0.000047717644,0.000026549982,0.0001542481,0.000010582087,0.0001549813,0.00013237367,0.00004272211,0.00006651171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.458542e-7,0.00003736331,0.00083481765,0.0000059808235,0.000004806691,0.0000015219332,0.00021861795,0.0071271937,0.00018702634,0.7993491,0.026098179,0.1661345],"study_design_scores_gemma":[0.00007001266,0.000028319624,0.0002476791,0.000004997524,5.000863e-7,0.0000023623238,0.0000013930588,0.9596473,0.0028507519,0.0076611596,0.029385423,0.00010011711],"about_ca_topic_score_codex":0.000009197538,"about_ca_topic_score_gemma":8.8524445e-7,"teacher_disagreement_score":0.9525201,"about_ca_system_score_codex":0.0000075554094,"about_ca_system_score_gemma":0.000009302488,"threshold_uncertainty_score":0.1945869},"labels":[],"label_agreement":null},{"id":"W1972346939","doi":"10.1145/2481268.2481273","title":"First steps to compiling Matlab to X10","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MATLAB; Computer science; Programming language; Set (abstract data type); Computation; Software engineering; Computational science","score_opus":0.015354173552320438,"score_gpt":0.24813076647214258,"score_spread":0.23277659291982214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972346939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054983296,0.0000065663125,0.97264355,0.0066962736,0.00012451793,0.0002855206,2.0644669e-7,0.0010502749,0.013694779],"genre_scores_gemma":[0.2763214,0.0000011613298,0.71814793,0.0037077095,0.000028860284,0.000025778387,3.9726945e-7,0.000005489725,0.0017612786],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991354,0.000019099845,0.00016928045,0.0002895658,0.00015303477,0.00023362794],"domain_scores_gemma":[0.9991692,0.000051829946,0.000023778364,0.00045319457,0.00011566214,0.00018635724],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012591745,0.00009701551,0.000108678825,0.0001247808,0.0001243176,0.00030847208,0.0008135561,0.00002986684,0.00010164943],"category_scores_gemma":[0.000030087393,0.00008527629,0.000027065013,0.00042604905,0.000006120439,0.00021392277,0.00043444292,0.00005283046,0.0018200245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005910922,0.00014887305,0.0012635596,0.000028124905,0.000019341074,0.000007142449,0.002580231,0.25215104,0.0005099001,0.10326311,0.57383263,0.06619013],"study_design_scores_gemma":[0.00012996288,0.00019525172,0.0036801917,0.000045662782,0.0000011183837,0.0000068522727,0.000024765612,0.94234663,0.003298545,0.0021454704,0.047743704,0.00038185538],"about_ca_topic_score_codex":0.00017153697,"about_ca_topic_score_gemma":0.00001321363,"teacher_disagreement_score":0.6901956,"about_ca_system_score_codex":0.000026232878,"about_ca_system_score_gemma":0.000014606271,"threshold_uncertainty_score":0.99895716},"labels":[],"label_agreement":null},{"id":"W1972375023","doi":"10.1109/cicc.2014.6946043","title":"AMD SOC power management: Improving performance/watt using run-time feedback","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Watt; Computer science; Power (physics); Power management; Embedded system","score_opus":0.009387954746752187,"score_gpt":0.22065155701133804,"score_spread":0.21126360226458585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972375023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017194046,0.000014524544,0.9072429,0.00009999049,0.00014526157,0.00011174186,1.1831918e-7,0.00095580315,0.07423564],"genre_scores_gemma":[0.46620136,0.000007115042,0.53061634,0.00044465403,0.00003581544,0.0000025967627,9.763921e-7,0.000011123188,0.0026800123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987916,0.000044877634,0.00022699733,0.00037672097,0.00022215188,0.00033765179],"domain_scores_gemma":[0.99919015,0.000025376909,0.00009581814,0.0005497749,0.000065605396,0.0000732968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042005832,0.00015682649,0.00014808052,0.00014973912,0.00024762444,0.00024988482,0.0007899618,0.000057016692,0.00006726144],"category_scores_gemma":[0.000008231899,0.00014246888,0.000055877503,0.00031153898,0.00002991559,0.00051044655,0.00050639285,0.00009536844,0.00020908266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002546256,0.00033488742,0.0027729152,0.00028500202,0.00014849896,0.000017457425,0.0012922301,0.0942068,0.004277931,0.15030304,0.01970059,0.7266352],"study_design_scores_gemma":[0.00018641548,0.000053081803,0.00045299385,0.000025480549,0.000004523354,0.000007428246,0.000004631096,0.9932594,0.0022230418,0.00041207363,0.0031444277,0.00022655564],"about_ca_topic_score_codex":0.000012554769,"about_ca_topic_score_gemma":2.0047351e-7,"teacher_disagreement_score":0.89905256,"about_ca_system_score_codex":0.000041085033,"about_ca_system_score_gemma":0.000015879705,"threshold_uncertainty_score":0.58097124},"labels":[],"label_agreement":null},{"id":"W1972410660","doi":"10.1145/1166133.1166135","title":"Investigating cache energy and latency break-even points in high performance processors","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache algorithms; Cache; Cache pollution; Smart Cache; Cache invalidation; Cache coloring; Parallel computing; Page cache; Latency (audio); MESI protocol; CPU cache; Efficient energy use; Embedded system; Telecommunications","score_opus":0.008837714043958306,"score_gpt":0.2098410249765574,"score_spread":0.2010033109325991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972410660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52484006,0.00007679854,0.46736416,0.0006613648,0.00003059659,0.00005168203,1.9284312e-7,0.00043012286,0.0065450054],"genre_scores_gemma":[0.784542,0.00001829763,0.21461326,0.00023956079,0.00001683945,0.000006103136,0.000001771994,0.0000046080854,0.0005575191],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920166,0.00003465326,0.00020140663,0.00025646074,0.000117827316,0.00018798254],"domain_scores_gemma":[0.99966407,0.000029461464,0.000065272536,0.0001599455,0.000043561336,0.000037689366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018872984,0.00009802034,0.000105437015,0.000113704795,0.000078502,0.000081182276,0.000289146,0.000049715174,0.0000025205693],"category_scores_gemma":[0.000016934171,0.00008743142,0.000009243932,0.00039541125,0.000032881173,0.0003499105,0.00014507676,0.00006169772,0.0000016878638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051092484,0.00025430883,0.392013,0.00015162914,0.000012655938,0.000019714163,0.0015680412,0.091296636,0.00089594064,0.38415888,0.005259518,0.12436455],"study_design_scores_gemma":[0.0002594328,0.000044583896,0.048870157,0.00006070365,0.0000011106944,0.00001547952,0.0000044088074,0.92467374,0.00830203,0.017248096,0.0002887166,0.00023155667],"about_ca_topic_score_codex":0.0009504441,"about_ca_topic_score_gemma":0.00006652706,"teacher_disagreement_score":0.83337706,"about_ca_system_score_codex":0.000018775521,"about_ca_system_score_gemma":0.000036394747,"threshold_uncertainty_score":0.356535},"labels":[],"label_agreement":null},{"id":"W1972783048","doi":"10.1145/2688500.2688521","title":"On optimizing machine learning workloads via kernel fusion","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Matrix multiplication; Parallel computing; Computation; Operator (biology); Range (aeronautics); Algorithm; Mathematics","score_opus":0.024973154199461507,"score_gpt":0.26008904406250055,"score_spread":0.23511588986303905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972783048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010380052,0.000092566515,0.9573269,0.00045329623,0.00016273277,0.00006480625,6.173213e-8,0.0014543554,0.039407294],"genre_scores_gemma":[0.4491506,0.000015470427,0.54790795,0.00051498646,0.000033812295,0.0000033354577,0.000002383709,0.000009022244,0.0023624485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989652,0.00009177109,0.00016653616,0.00030252605,0.0002616747,0.00021230943],"domain_scores_gemma":[0.9993158,0.00006901365,0.00007133356,0.00031999915,0.00008662558,0.00013723741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044799378,0.00012552235,0.00012113014,0.00012553927,0.00013405125,0.00014199934,0.0005320477,0.000058508933,0.000018971974],"category_scores_gemma":[0.000079224585,0.00010595787,0.000040236984,0.00032030078,0.0000143612815,0.0002048728,0.00030469496,0.00020701278,0.00011805115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024501045,0.00012246384,0.00067748764,0.0000046296504,0.000011407295,0.000020529988,0.0008474418,0.8575036,0.00018650915,0.0386377,0.010528429,0.09143533],"study_design_scores_gemma":[0.00022900502,0.00015464524,0.000027141921,0.000020473693,0.0000010941708,0.000009270796,0.000006084945,0.9927174,0.0012399998,0.0034063894,0.002035561,0.00015293666],"about_ca_topic_score_codex":0.000045267763,"about_ca_topic_score_gemma":0.0000013304021,"teacher_disagreement_score":0.4481126,"about_ca_system_score_codex":0.000044860488,"about_ca_system_score_gemma":0.000029884144,"threshold_uncertainty_score":0.43208364},"labels":[],"label_agreement":null},{"id":"W1973147517","doi":"10.4028/www.scientific.net/amm.65.590","title":"Performance Evaluation of a Massively Parallel Decoder for CISC Microprocessors","year":2011,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction; National Science Foundation","keywords":"x86; Computer science; Massively parallel; Decoding methods; Soft-decision decoder; Parallel computing; Computer hardware; Algorithm; Software; Operating system","score_opus":0.048215480642192755,"score_gpt":0.26260865350857215,"score_spread":0.2143931728663794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973147517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072793394,0.00003089014,0.9259901,0.000013635047,0.000101780606,0.00043087298,0.0000043710797,0.00007335564,0.0005616113],"genre_scores_gemma":[0.58335614,0.000047895886,0.41643322,0.00003785658,0.00000873385,0.00009863511,0.0000039129045,0.0000053652852,0.000008239008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924976,0.000020306077,0.00023344425,0.00022026822,0.00014056737,0.0001356861],"domain_scores_gemma":[0.99939483,0.000015411662,0.00018442656,0.00018576585,0.0001896389,0.000029922723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090908137,0.00009523329,0.00016484935,0.000057772224,0.0000684405,0.000033190085,0.00024301354,0.000059821778,0.000010745821],"category_scores_gemma":[0.000014268122,0.00008554821,0.00001637825,0.00007009793,0.000008046325,0.00008904791,0.000097562486,0.000017606239,0.0000021466792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007046082,0.000063772524,0.0000029422613,0.00011232473,0.000026242247,1.270294e-7,0.0010874479,0.00017187986,0.065304,0.9110729,0.0002052408,0.021882664],"study_design_scores_gemma":[0.00088214263,0.00014042457,0.000098320976,0.000030806943,0.000038605653,0.0000034498164,0.000026968422,0.16134761,0.6226548,0.21440826,0.00013763922,0.00023100134],"about_ca_topic_score_codex":0.0000037257294,"about_ca_topic_score_gemma":3.4156608e-7,"teacher_disagreement_score":0.69666463,"about_ca_system_score_codex":0.000008974569,"about_ca_system_score_gemma":0.00004324365,"threshold_uncertainty_score":0.34885547},"labels":[],"label_agreement":null},{"id":"W1973726053","doi":"10.1109/ainaw.2007.179","title":"Exploring Functional Unit Design Space of VLIW Processors for Optimizing Both Performance and Energy Consumption","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Very long instruction word; Computer science; Energy consumption; Integer (computer science); Design space exploration; Parallelism (grammar); Parallel computing; Energy (signal processing); Integer programming; Efficient energy use; Embedded system; Algorithm; Mathematics; Electrical engineering","score_opus":0.15690960755025757,"score_gpt":0.27590489175397465,"score_spread":0.11899528420371708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973726053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013408858,0.000054617056,0.9853244,0.000046554997,0.00007170507,0.00007310821,1.8588669e-7,0.00023791245,0.0007826476],"genre_scores_gemma":[0.42311737,0.00013949482,0.5764391,0.00003226633,0.000016816342,0.000014362849,9.536072e-7,0.0000044605795,0.00023522359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992959,0.000017000717,0.00018707139,0.00020297279,0.0001257709,0.00017127332],"domain_scores_gemma":[0.9994206,0.00018036437,0.00009753186,0.00012799531,0.00012571189,0.00004782401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056682253,0.0000881986,0.000102190774,0.00015328416,0.00012684944,0.000038958948,0.0001552719,0.000032616732,0.0000032395988],"category_scores_gemma":[0.00002176387,0.00008336167,0.000020033494,0.00018461063,0.000034145694,0.0005414326,0.00006291909,0.00003854418,4.3446434e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023326813,0.00016158637,0.004747076,0.00035194296,0.000059874368,0.000002034474,0.0014565387,0.5387575,0.0035547155,0.22594644,0.0012399689,0.22348906],"study_design_scores_gemma":[0.00029257263,0.00014603217,0.0018907008,0.00004829362,0.000004009533,0.000008924597,0.00002542257,0.9015017,0.0951165,0.000275789,0.0005522936,0.00013776221],"about_ca_topic_score_codex":0.0000065880295,"about_ca_topic_score_gemma":9.696836e-7,"teacher_disagreement_score":0.4097085,"about_ca_system_score_codex":0.000014195456,"about_ca_system_score_gemma":0.000032579122,"threshold_uncertainty_score":0.33993903},"labels":[],"label_agreement":null},{"id":"W1973806083","doi":"10.1145/2567938","title":"HARP","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pipeline (software); HARP; SIMD; Speedup; Overhead (engineering); Parallel computing; Pipeline transport; Embedded system; Operating system","score_opus":0.017847550038026055,"score_gpt":0.2595705963858104,"score_spread":0.24172304634778438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973806083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011525973,0.00004608899,0.9900806,0.0003778435,0.0013788887,0.0002238949,0.0000011449357,0.002418342,0.0043206005],"genre_scores_gemma":[0.7735078,0.0000051173647,0.22560842,0.00031605107,0.00011635493,0.000012573444,0.0000015976984,0.000019577406,0.00041255984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978535,0.00030701613,0.00046008325,0.0005988371,0.00037630778,0.00040422758],"domain_scores_gemma":[0.99747396,0.0004430109,0.00017691863,0.0016247965,0.00014342276,0.00013789073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007472408,0.00024751332,0.0003015209,0.000276198,0.0004871245,0.00037848754,0.0017167388,0.00012180821,0.000005404738],"category_scores_gemma":[0.000071541544,0.00024351827,0.00012946891,0.0005936123,0.00003582419,0.00022466658,0.000038646685,0.00029652155,0.000148126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007304772,0.00017094862,0.00002822573,0.000046997793,0.000054536773,0.000004295801,0.0011177417,0.84534025,0.00014002327,0.030437507,0.0018564705,0.120795675],"study_design_scores_gemma":[0.00033713726,0.0001473712,0.00003923853,0.00010692296,0.0000072625044,0.00004525633,0.000036025005,0.9916865,0.0009923382,0.001136028,0.005155324,0.0003105561],"about_ca_topic_score_codex":0.000036784128,"about_ca_topic_score_gemma":7.972088e-7,"teacher_disagreement_score":0.77235514,"about_ca_system_score_codex":0.000069120186,"about_ca_system_score_gemma":0.000038382484,"threshold_uncertainty_score":0.99303865},"labels":[],"label_agreement":null},{"id":"W1973814258","doi":"10.1504/ijhpcn.2006.013490","title":"Real-time minimum vertex cover for two-terminal series-parallel graphs","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vertex cover; Vertex (graph theory); Cardinality (data modeling); Terminal (telecommunication); Algorithm; Edge cover; Parallel algorithm; Series and parallel circuits; Series (stratigraphy); Graph; Time complexity; Theoretical computer science","score_opus":0.009274216943470406,"score_gpt":0.2574695263585593,"score_spread":0.24819530941508888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973814258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44434515,0.0002233926,0.5525613,0.00030972224,0.0017159571,0.00008624403,0.0000013468971,0.00011483569,0.0006420986],"genre_scores_gemma":[0.83235586,0.00025544228,0.16606504,0.00009627452,0.0010465396,0.0000013709786,0.000006382683,0.000012106515,0.00016098614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844944,0.000047085352,0.00061307556,0.00023263272,0.00037550728,0.00028226525],"domain_scores_gemma":[0.99854267,0.00020225991,0.00058942457,0.00013855184,0.00046496498,0.00006210901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063633086,0.00017859782,0.00027438597,0.0002460704,0.00023019151,0.00028580258,0.000790085,0.000057597543,0.0000029884175],"category_scores_gemma":[0.000010655056,0.00016645012,0.00010594178,0.0001640545,0.000055014832,0.0005590365,0.00019512807,0.00016948231,0.000002603414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000751591,0.00030097726,0.012741769,0.00007386773,0.00035168693,0.00019208189,0.0006177413,0.6738321,0.0017439136,0.026839536,0.023422224,0.25913247],"study_design_scores_gemma":[0.0012435335,0.00028780807,0.0029044817,0.0003195088,0.000013849488,0.00079264026,0.0000031211825,0.98721963,0.00046095875,0.004026367,0.0024923163,0.00023579742],"about_ca_topic_score_codex":0.000020348865,"about_ca_topic_score_gemma":6.264889e-7,"teacher_disagreement_score":0.38801074,"about_ca_system_score_codex":0.00005624732,"about_ca_system_score_gemma":0.00006325168,"threshold_uncertainty_score":0.6787639},"labels":[],"label_agreement":null},{"id":"W1974455942","doi":"10.1109/tc.2011.40","title":"Modeling Energy-Time Trade-Offs in VLSI Computation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Uniprocessor system; Computer science; Computation; Parallel computing; Energy consumption; Very-large-scale integration; Energy (signal processing); Efficient energy use; Upper and lower bounds; Algorithm; Computer engineering; Embedded system; Multiprocessing; Mathematics","score_opus":0.029382911710500677,"score_gpt":0.23722288576616574,"score_spread":0.20783997405566507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974455942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017762413,0.000017087217,0.99537194,0.00016007727,0.00058843277,0.00012547866,0.0000016334424,0.00095386937,0.0010052603],"genre_scores_gemma":[0.71023536,0.000015827452,0.28928486,0.0003824078,0.000017693019,0.0000140485945,0.0000016764093,0.000015292304,0.00003284958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983577,0.00013826769,0.0004085821,0.0005175505,0.000247528,0.0003303814],"domain_scores_gemma":[0.99932957,0.00007745204,0.00006775985,0.00037138432,0.00004302399,0.00011079625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020526432,0.00023337513,0.00023754466,0.0005269952,0.00016440803,0.00008912598,0.000653532,0.00011155937,0.000009988406],"category_scores_gemma":[0.0000012100991,0.00025572156,0.00012102084,0.0006669125,0.00003339147,0.00044549775,0.0000064598316,0.00022972899,0.000030000467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011617324,0.00019428304,0.0000023946004,0.0000035419398,0.000013798426,0.00001082141,0.00085100625,0.92305106,0.00004547357,0.00065028423,0.00015708483,0.07500862],"study_design_scores_gemma":[0.00038133917,0.00012886374,0.00002175635,0.000057633628,0.000004845104,0.000016194159,0.0000072957405,0.99503314,0.0029235499,0.0011242263,0.000027549671,0.00027361626],"about_ca_topic_score_codex":0.00015724947,"about_ca_topic_score_gemma":0.000014830917,"teacher_disagreement_score":0.7084591,"about_ca_system_score_codex":0.000094634444,"about_ca_system_score_gemma":0.000052286327,"threshold_uncertainty_score":0.9999895},"labels":[],"label_agreement":null},{"id":"W1974875636","doi":"10.1109/pact.2011.8","title":"No More Backstabbing... A Faithful Scheduling Policy for Multithreaded Programs","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of California, Riverside; University of Toronto; National Science Foundation","keywords":"Computer science; Thread (computing); Context switch; Scheduling (production processes); Scalability; Multi-core processor; Operating system; Parallel computing; Distributed computing","score_opus":0.054963244366668884,"score_gpt":0.29668694022683906,"score_spread":0.24172369586017017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974875636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075803715,0.000018886534,0.97419226,0.00026054346,0.000095317366,0.0004257324,6.3072497e-7,0.0014921842,0.022756394],"genre_scores_gemma":[0.122468375,0.000004690604,0.8756122,0.000434475,0.00008645236,0.000071076014,0.0000038125868,0.000013298559,0.0013056009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889064,0.000021677764,0.00022720461,0.00037081755,0.00013554438,0.00035414618],"domain_scores_gemma":[0.9990661,0.000032554188,0.00008932628,0.0004500786,0.00025751078,0.000104424755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021354933,0.00015080867,0.00015338873,0.00014804177,0.00013590505,0.0001234757,0.00077334774,0.00007622534,0.000010241231],"category_scores_gemma":[0.00009366645,0.00012958898,0.00008853464,0.00036740603,0.000044976685,0.00030452257,0.00019610158,0.000078075995,0.000040576746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006930035,0.0008997623,0.0025731593,0.00013899706,0.0001027835,0.000009873841,0.008483953,0.001799857,0.0007157973,0.76236707,0.003509411,0.21933006],"study_design_scores_gemma":[0.0005505486,0.00023881976,0.00019603074,0.00004283976,0.0000043268014,0.000007865671,0.00005025746,0.98113054,0.0056483154,0.0077641555,0.004020199,0.00034612574],"about_ca_topic_score_codex":0.00019849728,"about_ca_topic_score_gemma":0.000004146706,"teacher_disagreement_score":0.97933066,"about_ca_system_score_codex":0.00003005242,"about_ca_system_score_gemma":0.00009549434,"threshold_uncertainty_score":0.5284485},"labels":[],"label_agreement":null},{"id":"W1975335181","doi":"10.1109/tc.2014.2346184","title":"Methodology for Cycle-Accurate DRAM Performance Analysis","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Qualcomm (Canada)","funders":"","keywords":"Dram; Computer science; CAS latency; Root cause; Embedded system; Parallel computing; Reliability engineering; Computer hardware; Memory controller; Engineering; Semiconductor memory","score_opus":0.04258236473655359,"score_gpt":0.30096010901168657,"score_spread":0.258377744275133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975335181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023962844,0.0000060376506,0.995105,0.00039410006,0.00088677456,0.000192598,0.000003207906,0.00080506253,0.00021093391],"genre_scores_gemma":[0.48738882,0.000010903289,0.511992,0.00047732392,0.00002777987,0.000030600946,0.0000017546508,0.000007671723,0.00006314794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851334,0.00022851031,0.0002992422,0.0004928037,0.00015528899,0.00031083325],"domain_scores_gemma":[0.9983777,0.0007016451,0.000118075484,0.00059304445,0.00011303436,0.00009650268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006251728,0.00018868531,0.00032010194,0.0005070128,0.00032262976,0.00012318947,0.00075349235,0.000090375506,0.0000053671083],"category_scores_gemma":[0.000007860181,0.00018723424,0.0002633004,0.000950598,0.000045576988,0.00025259244,0.000005241742,0.00015319945,0.000015952857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001151724,0.000045028974,0.0000069871326,0.0000073751576,0.00012240157,2.3964304e-7,0.00012920737,0.85269386,0.000029201048,0.0007206746,0.00020035211,0.14603317],"study_design_scores_gemma":[0.00029104904,0.00025489324,0.00010478055,0.000010502383,0.00007160742,0.0000042894235,0.0000019757308,0.99126124,0.0061475863,0.00039550356,0.0012412413,0.00021531577],"about_ca_topic_score_codex":0.000011110253,"about_ca_topic_score_gemma":0.0000046926707,"teacher_disagreement_score":0.48499253,"about_ca_system_score_codex":0.000039928567,"about_ca_system_score_gemma":0.000026957829,"threshold_uncertainty_score":0.76351905},"labels":[],"label_agreement":null},{"id":"W1975369855","doi":"","title":"Latency Hiding on COMA Multiprocessors","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Michigan","keywords":"Computer science; Uniform memory access; Cache-only memory architecture; Latency (audio); Non-uniform memory access; Shared memory; Parallel computing; Cache coherence; Cache; Distributed memory; Interleaved memory; CPU cache; Cache coloring; Operating system; Memory management; Cache algorithms; Overlay; Telecommunications","score_opus":0.03333846700040844,"score_gpt":0.25369164652809206,"score_spread":0.22035317952768363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975369855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026085889,0.00001987488,0.932628,0.0004464401,0.00008091787,0.000051409876,7.439515e-8,0.0013075131,0.039379884],"genre_scores_gemma":[0.7461129,0.000022157425,0.2521527,0.00051347085,0.000016133012,0.0000028167838,4.0759727e-7,0.0000037069728,0.0011756904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993571,0.000021252767,0.000117573625,0.0002129259,0.00014313671,0.0001479863],"domain_scores_gemma":[0.99955183,0.000046959234,0.000037887006,0.00025770036,0.000058239802,0.000047399695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008084361,0.000078009594,0.00007882706,0.00008250197,0.00018624356,0.000031649142,0.00046881128,0.000033767952,0.0000108176255],"category_scores_gemma":[0.000032294545,0.00006529648,0.000029325889,0.00024384486,0.000018909603,0.0001581829,0.000086530934,0.00006983072,0.00009082459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000340531,0.0010351306,0.027515814,0.000049038357,0.000058314046,0.00035952326,0.008067871,0.07608192,0.0012096709,0.65726584,0.13545878,0.092864074],"study_design_scores_gemma":[0.00027969448,0.00013259333,0.0031040418,0.000021650305,8.07604e-7,0.000051988023,0.000006543612,0.97220373,0.01833667,0.0024149432,0.0031726332,0.00027469502],"about_ca_topic_score_codex":0.000011157028,"about_ca_topic_score_gemma":2.5474296e-7,"teacher_disagreement_score":0.8961218,"about_ca_system_score_codex":0.000014255886,"about_ca_system_score_gemma":0.000021314814,"threshold_uncertainty_score":0.26627132},"labels":[],"label_agreement":null},{"id":"W1976203248","doi":"10.1021/ct300857j","title":"OpenMM 4: A Reusable, Extensible, Hardware Independent Library for High Performance Molecular Simulation","year":2012,"lang":"en","type":"article","venue":"Journal of Chemical Theory and Computation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":750,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Institute of General Medical Sciences","keywords":"Computer science; Extensibility; CUDA; Graphics; Software; Computer architecture; Implementation; Range (aeronautics); Integrator; Supercomputer; Embedded system; Operating system; Software engineering","score_opus":0.014432080976423345,"score_gpt":0.27136281901570386,"score_spread":0.2569307380392805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976203248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32292995,0.0002527699,0.6764011,0.00010587134,0.000096651915,0.00007872132,5.3720083e-7,0.000047132202,0.00008726512],"genre_scores_gemma":[0.83438677,0.000020907755,0.165183,0.0002684024,0.00010462684,0.0000023799423,0.0000042398165,0.00000800611,0.000021669342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991331,0.00010217139,0.00032628843,0.00011286206,0.00017696526,0.00014861255],"domain_scores_gemma":[0.99898905,0.00035126062,0.00028855898,0.000097417695,0.00017993587,0.00009380659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007033856,0.00009691226,0.0001657805,0.00009562236,0.00005899893,0.000102198675,0.00024381545,0.00006846277,0.0000031512293],"category_scores_gemma":[0.000108640415,0.000083793195,0.0000499966,0.00014881519,0.000022536466,0.0013701641,0.00010340719,0.00012459634,8.8436076e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082156144,0.00041097502,0.001074682,0.00020279027,0.00012572067,0.000009333056,0.0012066694,0.56819576,0.014378663,0.20433812,0.0015652843,0.20767047],"study_design_scores_gemma":[0.0010428269,0.0002672414,0.0010898708,0.00014808419,0.000031404954,0.00010146616,0.000015215154,0.7148445,0.16068625,0.12105109,0.00046123966,0.00026080373],"about_ca_topic_score_codex":1.05124805e-7,"about_ca_topic_score_gemma":9.614016e-10,"teacher_disagreement_score":0.5114568,"about_ca_system_score_codex":0.000016299546,"about_ca_system_score_gemma":0.00003332948,"threshold_uncertainty_score":0.34169874},"labels":[],"label_agreement":null},{"id":"W1976954520","doi":"10.1145/1851476.1851507","title":"Scalability of communicators and groups in MPI","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scalability; Computer science; Message Passing Interface; Message passing; Scale (ratio); Interface (matter); Distributed computing; Computer architecture; Parallel computing; Operating system","score_opus":0.009724902930769976,"score_gpt":0.2547907177618277,"score_spread":0.24506581483105774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976954520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6174746,0.000021245543,0.3771146,0.00032373803,0.000034421446,0.000049296796,1.003748e-7,0.00013194725,0.0048500407],"genre_scores_gemma":[0.7429791,0.000006523077,0.25696066,0.000040645416,0.0000016778322,0.0000010037929,9.988233e-8,9.169972e-7,0.000009381082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996189,0.00003664524,0.000126169,0.000104387815,0.00005091098,0.000062987936],"domain_scores_gemma":[0.99942935,0.000060185932,0.00002988131,0.00043085808,0.000025002882,0.000024730449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003645158,0.00003632593,0.000074731484,0.000055091667,0.000020542118,0.000017147411,0.00041636534,0.000033852073,0.0000037327918],"category_scores_gemma":[0.00003976541,0.000031322674,0.000010813165,0.00016535554,0.00006551722,0.00009952838,0.00026985674,0.00010853053,6.8202127e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037045436,0.00022560441,0.38712242,0.000024880508,0.0000036708595,8.7136846e-7,0.0010362958,0.00017124,0.0023915577,0.5648516,0.000319435,0.04384874],"study_design_scores_gemma":[0.00038528547,0.00007604251,0.36320934,0.000021356542,0.0000010743862,0.000007717728,0.000022746377,0.57558554,0.017321756,0.04256809,0.0005837902,0.00021726337],"about_ca_topic_score_codex":0.00007626973,"about_ca_topic_score_gemma":0.00006385754,"teacher_disagreement_score":0.5754143,"about_ca_system_score_codex":0.000002793996,"about_ca_system_score_gemma":0.00001092524,"threshold_uncertainty_score":0.12773016},"labels":[],"label_agreement":null},{"id":"W1977207775","doi":"10.1109/eduhpc.2014.14","title":"Using the Pilot Library to Teach Message-Passing Programming","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Message passing; Debugging; Point (geometry); Message Passing Interface; Deadlock; Visibility; Channel (broadcasting); Fortran; Programming language; Process (computing); Computer network","score_opus":0.037629734331142736,"score_gpt":0.28589363480992874,"score_spread":0.248263900478786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977207775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011567657,0.000018147193,0.9817117,0.002793359,0.000099461235,0.00015713848,5.3144408e-8,0.0014002176,0.012663165],"genre_scores_gemma":[0.29775462,7.369873e-7,0.6998431,0.001777383,0.00006330121,0.0000058235137,3.386541e-7,0.000008570597,0.0005461343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990374,0.00013330943,0.00015874472,0.00026809174,0.00016435733,0.00023813752],"domain_scores_gemma":[0.9992786,0.000089260786,0.000050788174,0.0004792167,0.00002660486,0.0000755535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065458,0.000102036036,0.0000945224,0.00008157462,0.00032265717,0.00063452224,0.0009212227,0.00002419433,0.000008694811],"category_scores_gemma":[0.000039406474,0.000068080175,0.00003088314,0.00045193778,0.00002314179,0.00044294793,0.0004657521,0.00010236701,0.000010007893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008133778,0.00016518624,0.0010995797,0.000019821018,0.000022319888,0.000005521665,0.0011364974,0.045457944,0.0018721429,0.2758042,0.021064807,0.65334386],"study_design_scores_gemma":[0.000071104114,0.00010019029,0.00012954057,0.000027481532,0.000002444862,0.000012006946,0.000013196489,0.9225,0.005009719,0.0017669081,0.07019737,0.00017004313],"about_ca_topic_score_codex":0.000018802431,"about_ca_topic_score_gemma":7.15523e-7,"teacher_disagreement_score":0.87704206,"about_ca_system_score_codex":0.000012273829,"about_ca_system_score_gemma":0.000031517757,"threshold_uncertainty_score":0.6118713},"labels":[],"label_agreement":null},{"id":"W1977258855","doi":"10.1109/trustcom.2013.236","title":"Mobile Parallel Computing Algorithms for Single-Buffered, Speed-Scalable Processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; Speedup; Parallel computing; Computation; Mobile device; Task (project management); Energy consumption; Distributed computing; Algorithm; Real-time computing; Computer hardware; Embedded system; Operating system","score_opus":0.030304978187671715,"score_gpt":0.274289455638857,"score_spread":0.24398447745118526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977258855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017152972,0.00011975231,0.9811182,0.000308345,0.00018382033,0.0010246877,9.755835e-7,0.0017216931,0.013807226],"genre_scores_gemma":[0.19901796,0.000008552318,0.7972776,0.00045626296,0.00009310088,0.00008675803,0.0000069917683,0.000019693181,0.003033048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982429,0.000040265357,0.00038977485,0.0005642758,0.0002355561,0.00052722456],"domain_scores_gemma":[0.9987034,0.0001470472,0.00015227858,0.00048042953,0.00037220086,0.00014462943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800422,0.00022812879,0.00026274537,0.00012830492,0.00026070722,0.000505068,0.0010247903,0.00010517575,0.00004306937],"category_scores_gemma":[0.00004697273,0.00019967325,0.000100223806,0.00040555184,0.00004406602,0.0005988181,0.0002948189,0.00011282838,0.00011352207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002368053,0.0014752578,0.0009790304,0.0003321441,0.00014188429,0.00000955914,0.0035220648,0.26113468,0.0047534234,0.07311212,0.17005767,0.4844585],"study_design_scores_gemma":[0.00039592298,0.00028332413,0.000035396813,0.000025322857,0.000003296789,0.000014700803,0.000035725287,0.98219186,0.006117968,0.00644686,0.004135589,0.0003140254],"about_ca_topic_score_codex":0.000055556124,"about_ca_topic_score_gemma":7.144563e-7,"teacher_disagreement_score":0.7210572,"about_ca_system_score_codex":0.000047403457,"about_ca_system_score_gemma":0.000048645983,"threshold_uncertainty_score":0.8142439},"labels":[],"label_agreement":null},{"id":"W1977434943","doi":"10.1109/ccece.2010.5575190","title":"Design of a custom vector operation API exploiting SIMD intrinsics within Java","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"SIMD; Computer science; Intrinsics; Java; Parallel computing; Speedup; Operating system","score_opus":0.024106465197827165,"score_gpt":0.2541970577246358,"score_spread":0.23009059252680863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977434943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068225986,0.000006815532,0.9902967,0.00014643192,0.00022896347,0.0001526462,1.6992067e-7,0.00048558656,0.001860077],"genre_scores_gemma":[0.49238363,0.0000021416436,0.5074057,0.00009226283,0.000028795665,0.0000045746156,6.540568e-7,0.0000041452085,0.00007807409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991465,0.000066759145,0.00027031306,0.00021982324,0.000166919,0.00012967364],"domain_scores_gemma":[0.9992195,0.00010339508,0.00012212622,0.00035072415,0.00015690738,0.000047356516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005227562,0.00009284223,0.000120035904,0.000087305176,0.00008931386,0.00011117111,0.00048332065,0.000066901004,0.000013770544],"category_scores_gemma":[0.000112270194,0.00008171484,0.000024430201,0.0002378914,0.000029440393,0.00035437054,0.00013792765,0.0001571309,0.000014466504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001731402,0.00020017977,0.00033002906,0.000030692652,0.000026612614,0.0000054328257,0.004700628,0.45381308,0.12347504,0.37248957,0.0048074103,0.04010402],"study_design_scores_gemma":[0.00010507724,0.00006132677,0.000030836167,0.00000854504,0.000001451806,0.000005121425,0.000011018033,0.84989226,0.14874189,0.0009592437,0.00008291351,0.000100304256],"about_ca_topic_score_codex":0.00002854556,"about_ca_topic_score_gemma":0.0000044178582,"teacher_disagreement_score":0.48556104,"about_ca_system_score_codex":0.000010030679,"about_ca_system_score_gemma":0.00008228033,"threshold_uncertainty_score":0.33322343},"labels":[],"label_agreement":null},{"id":"W1977933385","doi":"10.1145/1629395.1629411","title":"Fine-grain performance scaling of soft vector processors","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Personalization; Flexibility (engineering); Scaling; Parallel computing; Computer architecture; Parallelism (grammar); Embedded system; Extensibility; Vector processor; Computer hardware; Operating system","score_opus":0.012370348909898935,"score_gpt":0.24797236710271628,"score_spread":0.23560201819281734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977933385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032636475,0.000043714877,0.9608285,0.0005172803,0.000040503703,0.0000598182,1.3412676e-7,0.00048480814,0.005388798],"genre_scores_gemma":[0.7565936,0.0000041552657,0.24287957,0.00015020155,0.000014111874,0.0000011576284,4.6135958e-7,0.0000019066781,0.00035487392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.000014304123,0.00017665862,0.00016700604,0.00014177123,0.0001397115],"domain_scores_gemma":[0.999557,0.00002059147,0.00007218547,0.00022592745,0.00009029293,0.000033955526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018154623,0.00007268575,0.000103658866,0.00007619992,0.000055860997,0.000034391105,0.00048164648,0.00003200534,0.0000062596],"category_scores_gemma":[0.000032802305,0.00006149543,0.000029970173,0.00033839533,0.000015357416,0.0002093066,0.000046601464,0.000054506807,0.0000061342994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024483466,0.00040261573,0.003903924,0.00013652607,0.00002062028,0.0000049194464,0.0023764202,0.12133652,0.0030616033,0.09616137,0.011337394,0.7612336],"study_design_scores_gemma":[0.000104672814,0.000119447934,0.0035145935,0.000035202847,0.0000011020069,0.000003502975,0.0000022627407,0.9512494,0.043342087,0.0011666844,0.00034353393,0.00011751355],"about_ca_topic_score_codex":0.0000027552703,"about_ca_topic_score_gemma":4.098372e-7,"teacher_disagreement_score":0.8299129,"about_ca_system_score_codex":0.000008252704,"about_ca_system_score_gemma":0.00003368663,"threshold_uncertainty_score":0.2507711},"labels":[],"label_agreement":null},{"id":"W1978016595","doi":"10.1145/1958746.1958821","title":"Combined profiling","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Profiling (computer programming); Computer science; Compiler; Suite; Implementation; IBM; Programming language","score_opus":0.03912519764282373,"score_gpt":0.24770183501157633,"score_spread":0.2085766373687526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978016595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005311489,0.0000046734112,0.83374083,0.000045542758,0.000057995774,0.000039616727,2.3404462e-8,0.0009508539,0.16462933],"genre_scores_gemma":[0.32820055,0.0000013737147,0.67110366,0.00017569358,0.000004647194,0.0000024970707,2.0812637e-7,0.0000016418579,0.00050971576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996366,0.000014848693,0.000078067475,0.000121693294,0.000056599423,0.00009219241],"domain_scores_gemma":[0.99967843,0.000008688824,0.000021711883,0.00022650257,0.000035229437,0.00002941055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009877641,0.00004106398,0.000043696247,0.00003941354,0.000041861254,0.000025710558,0.00039797658,0.000018455974,0.000024243718],"category_scores_gemma":[0.0000084292105,0.000034462017,0.000017051778,0.00013371976,0.000008826544,0.0001371016,0.00010570706,0.000032336757,0.000044249187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016072134,0.000041469895,0.0011532996,0.000001893421,0.0000032653409,0.0000029060784,0.00027653642,0.000036648275,0.00008822023,0.98942447,0.0015645255,0.0074051665],"study_design_scores_gemma":[0.00019629742,0.0001292116,0.0012214131,0.0000061759383,0.0000011745555,0.0000046326904,0.000008624327,0.84418243,0.11891953,0.03466132,0.00046923198,0.00019994235],"about_ca_topic_score_codex":0.000008551596,"about_ca_topic_score_gemma":1.3825655e-7,"teacher_disagreement_score":0.9547631,"about_ca_system_score_codex":0.000004245738,"about_ca_system_score_gemma":0.00001228357,"threshold_uncertainty_score":0.14053203},"labels":[],"label_agreement":null},{"id":"W1978904804","doi":"10.1109/mm.2014.5","title":"DeNovoND: Efficient Hardware for Disciplined Nondeterminism","year":2014,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Nondeterministic algorithm; Lock (firearm); Synchronization (alternating current); Protocol (science); Atomicity; State (computer science); Distributed computing; Parallel computing; Embedded system; Computer network; Theoretical computer science; Programming language","score_opus":0.015217905124170292,"score_gpt":0.2686536691295757,"score_spread":0.2534357640054054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978904804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014610778,0.000023888784,0.98287123,0.00041834617,0.00056595117,0.00020282232,0.000003830217,0.0005074326,0.0007957114],"genre_scores_gemma":[0.480964,0.0000014413611,0.5174313,0.0004620158,0.00014328731,0.000031197083,0.0000040941445,0.000013283455,0.00094937294],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990646,0.00003540143,0.00019253,0.0003450305,0.000109124056,0.00025331657],"domain_scores_gemma":[0.99918693,0.000108962355,0.00008218996,0.0004658754,0.00008981434,0.00006619531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002798926,0.00012348498,0.00014438925,0.00008517045,0.00017968698,0.00013435543,0.0007249138,0.000057167716,0.0000021932185],"category_scores_gemma":[0.000033335687,0.00011221509,0.00008306757,0.00013679743,0.000027450027,0.000063691805,0.00011812968,0.00006113686,0.000032587952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000936547,0.0010052474,0.00045299687,0.00032444447,0.00011289447,0.000021286169,0.007383296,0.20175306,0.27763808,0.05989999,0.21586826,0.23544677],"study_design_scores_gemma":[0.00045031242,0.00011902827,0.000094286006,0.000027269258,0.0000050005888,0.000010392799,0.000003268254,0.81950474,0.15527526,0.0018202899,0.022428367,0.00026179635],"about_ca_topic_score_codex":0.000002596462,"about_ca_topic_score_gemma":9.548799e-7,"teacher_disagreement_score":0.61775166,"about_ca_system_score_codex":0.000023170882,"about_ca_system_score_gemma":0.000030164572,"threshold_uncertainty_score":0.45759985},"labels":[],"label_agreement":null},{"id":"W1979395561","doi":"10.1145/2048147.2048203","title":"McLAB","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Compiler; Computer science; Programming language; Software engineering; Software; Compiler construction; High-level programming language; Programming paradigm","score_opus":0.04006365139865538,"score_gpt":0.24177947978355677,"score_spread":0.20171582838490137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979395561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012837625,0.0000071698655,0.7131378,0.000048849863,0.00004016784,0.000013889562,1.3651343e-8,0.0006507017,0.285973],"genre_scores_gemma":[0.29439086,0.0000023462,0.7039892,0.00032753093,0.0000056805393,0.0000012181722,6.7327484e-8,0.0000012154602,0.0012818471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.000010271387,0.0000531501,0.000096823234,0.000044945828,0.00007323989],"domain_scores_gemma":[0.99972004,0.0000058613655,0.000012935935,0.00021183881,0.000023752025,0.00002556969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006426637,0.000030515823,0.000030049652,0.000031600295,0.000029279714,0.000019069308,0.00037432095,0.0000147103865,0.00006244746],"category_scores_gemma":[0.0000051695033,0.00002510633,0.000013642188,0.00010802893,0.000007356754,0.00012278896,0.00008636749,0.000022581684,0.00009495833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.846091e-7,0.000028531003,0.00043011297,8.561329e-7,0.0000024079802,0.0000032452779,0.00045009682,0.000019789875,0.000025448417,0.96545976,0.011204158,0.022375101],"study_design_scores_gemma":[0.00036227723,0.00022957446,0.009622649,0.000013584189,0.000002962434,0.000042292024,0.000019209107,0.6823178,0.09300967,0.17765252,0.036084466,0.00064298575],"about_ca_topic_score_codex":0.00001437496,"about_ca_topic_score_gemma":3.5411801e-7,"teacher_disagreement_score":0.7878072,"about_ca_system_score_codex":0.0000032499067,"about_ca_system_score_gemma":0.000008380334,"threshold_uncertainty_score":0.122052886},"labels":[],"label_agreement":null},{"id":"W1979527452","doi":"10.1109/ispass.2009.4919648","title":"Analyzing CUDA workloads using a detailed GPU simulator","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1660,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; CUDA; Thread (computing); Graphics; Microarchitecture; Instruction set; SIMD; Computer architecture; General-purpose computing on graphics processing units; Memory bandwidth; Multithreading; Supercomputer; Operating system","score_opus":0.02341184931854888,"score_gpt":0.2874748231294658,"score_spread":0.2640629738109169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979527452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015755214,0.00010534327,0.9792586,0.0002766346,0.00006298172,0.00007117546,6.333268e-8,0.0010312389,0.0034387263],"genre_scores_gemma":[0.55635184,0.0000042763704,0.44307765,0.00037408274,0.000027463668,3.7222793e-7,2.3439219e-7,0.0000027286671,0.00016131949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990747,0.00004420473,0.00020826724,0.00028853997,0.00014081654,0.00024350292],"domain_scores_gemma":[0.99932355,0.00004069563,0.00007027794,0.00040812625,0.000075156524,0.00008222111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000203527,0.00011698431,0.00014457772,0.00014689159,0.0001467951,0.00020876106,0.0005448899,0.00005375545,0.000015435533],"category_scores_gemma":[0.000029174471,0.00010512526,0.00006590071,0.00061599776,0.000011596111,0.0003232539,0.00009479052,0.00008826194,0.000015522115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093474555,0.00015970513,0.005020057,0.0000060713724,0.000030809402,0.000029858138,0.00036671408,0.8296558,0.0030241113,0.049480174,0.0019287063,0.11028861],"study_design_scores_gemma":[0.00011687214,0.000033472134,0.00047642642,0.000018502846,0.0000031664968,0.0000053351173,0.0000021209407,0.9939107,0.0025658908,0.0024490855,0.00026268655,0.0001557888],"about_ca_topic_score_codex":0.000006464707,"about_ca_topic_score_gemma":7.3825373e-7,"teacher_disagreement_score":0.54059666,"about_ca_system_score_codex":0.00003743164,"about_ca_system_score_gemma":0.000040346804,"threshold_uncertainty_score":0.42868838},"labels":[],"label_agreement":null},{"id":"W1979593478","doi":"10.1145/2355585.2355586","title":"Dynamically dispatching speculative threads to improve sequential execution","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computer and Network Systems; Semiconductor Research Corporation; National Science Foundation","keywords":"Computer science; Speculative multithreading; Thread (computing); Spec#; Parallel computing; Compiler; Speculative execution; Multi-core processor; Multithreading; Benchmark (surveying); Instruction-level parallelism; Execution time; Execution model; Operating system; Embedded system; Programming language; Parallelism (grammar)","score_opus":0.012038153935295453,"score_gpt":0.26157256967392906,"score_spread":0.2495344157386336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979593478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027129364,0.000031425563,0.9940319,0.0016803254,0.0002547045,0.00032132166,0.000014685394,0.000440392,0.0005123267],"genre_scores_gemma":[0.46199706,0.000023591829,0.53740376,0.00040082217,0.000044328142,0.000026002042,0.000010899618,0.000012094348,0.000081423575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875915,0.00010162827,0.00022210191,0.0003782777,0.00022471376,0.00031410862],"domain_scores_gemma":[0.9990911,0.00008483714,0.000074604235,0.00048564852,0.00007204787,0.00019176728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019474738,0.00020243002,0.00015477023,0.0002497077,0.00033849583,0.00013759526,0.00037488688,0.00009757847,0.000015480793],"category_scores_gemma":[0.000034099372,0.00018779149,0.000064487576,0.00043512354,0.00003314063,0.00040365805,0.00004163784,0.00023096814,0.0000072319863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027947817,0.0000822892,0.000025717667,0.000006802758,0.000018628378,5.1619116e-7,0.001319574,0.8595935,0.0004268653,0.001990444,0.00001552052,0.13649218],"study_design_scores_gemma":[0.00033574665,0.00026396068,0.00049724954,0.00005601017,0.000033303684,0.00002916789,0.000031453805,0.988638,0.0051080296,0.004177,0.00037862296,0.0004514966],"about_ca_topic_score_codex":0.000016351773,"about_ca_topic_score_gemma":0.000013500793,"teacher_disagreement_score":0.45928413,"about_ca_system_score_codex":0.000060664526,"about_ca_system_score_gemma":0.000024750769,"threshold_uncertainty_score":0.7657915},"labels":[],"label_agreement":null},{"id":"W1979785091","doi":"10.1109/ccece.2012.6334941","title":"Performance optimization of a data transfer controller for parallel matrix multiplication in FPGAS","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Stratix; Computer science; Pipeline (software); Field-programmable gate array; Controller (irrigation); Host (biology); Parallel computing; Embedded system; Memory controller; Multiplication (music); Matrix multiplication; Computer hardware; Computer architecture; Operating system","score_opus":0.04675267009414886,"score_gpt":0.31193683828313046,"score_spread":0.2651841681889816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979785091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015186516,0.00010084779,0.99687964,0.00020004115,0.00003840259,0.00047947202,0.000004324532,0.00015229738,0.00062634295],"genre_scores_gemma":[0.49345696,0.000043976546,0.5063292,0.000038549762,0.00001479523,0.00003094221,0.000020494692,0.0000039077704,0.000061199906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991203,0.00003579119,0.00031209752,0.00022067301,0.000111103545,0.00020005663],"domain_scores_gemma":[0.99922526,0.00009264833,0.000056555884,0.00049857196,0.00008725246,0.000039722603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940756,0.00008681252,0.00015331591,0.00011801288,0.000040426392,0.000022129872,0.0007286616,0.000057095305,0.0000051378065],"category_scores_gemma":[0.000030779313,0.00007748431,0.00002652823,0.00024526968,0.000016220078,0.0010929515,0.00009682534,0.000042414664,0.0000022367203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040339393,0.00017341206,0.0036524837,0.000034569923,0.000008602258,2.6098196e-8,0.00031454177,0.9702119,0.00012081706,0.0125877,0.00048277335,0.012372788],"study_design_scores_gemma":[0.0008131644,0.000034128047,0.0012196488,0.00001225784,0.0000034148536,0.0000010601187,0.0000043727177,0.9968547,0.0005352113,0.00004959624,0.00037796627,0.00009446864],"about_ca_topic_score_codex":0.000012983633,"about_ca_topic_score_gemma":0.0000015555191,"teacher_disagreement_score":0.4919383,"about_ca_system_score_codex":0.000016485103,"about_ca_system_score_gemma":0.00002339493,"threshold_uncertainty_score":0.31597185},"labels":[],"label_agreement":null},{"id":"W1979978831","doi":"10.1109/micro.2012.31","title":"A Mostly-Clean DRAM Cache for Effective Hit Speculation and Self-Balancing Dispatch","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Sandia National Laboratories; National Science Foundation","keywords":"Computer science; Cache; Cache pollution; Dram; Embedded system; Smart Cache; Page cache; CAS latency; Cache coloring; Cache invalidation; Cache algorithms; Parallel computing; Bus sniffing; Operating system; CPU cache; Computer hardware; Memory controller; Semiconductor memory","score_opus":0.00840440789147472,"score_gpt":0.25470601951307315,"score_spread":0.24630161162159842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979978831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042136922,0.000046677316,0.9548234,0.00030048742,0.00010361257,0.0003863795,4.563893e-7,0.0006779625,0.0015241166],"genre_scores_gemma":[0.62016594,0.0000025927566,0.37957677,0.00010421855,0.000047842514,0.000021717793,0.0000016627828,0.000004835925,0.00007441671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993328,0.00004660215,0.00011199862,0.00019426577,0.00009273481,0.00022160796],"domain_scores_gemma":[0.99948674,0.00014771313,0.000053827138,0.00017909482,0.000055631954,0.00007699799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036899198,0.00009354547,0.00010363006,0.000051706396,0.00012787254,0.000089216934,0.00014904318,0.000047165213,0.0000018709272],"category_scores_gemma":[0.00003396917,0.00008140067,0.000031119947,0.00014023224,0.000010518707,0.00036213567,0.00010291251,0.00004859429,0.000002943336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035399986,0.00059804483,0.07901736,0.00017011983,0.000120723395,0.0000018077783,0.010698678,0.0049067372,0.00085485436,0.6138275,0.0063135624,0.2834552],"study_design_scores_gemma":[0.0003148714,0.00009246484,0.044461727,0.0000111220015,0.0000099227755,0.000008475925,0.000020145455,0.94445753,0.0057572112,0.003126523,0.0015324824,0.00020751658],"about_ca_topic_score_codex":0.00001864055,"about_ca_topic_score_gemma":0.0000030358278,"teacher_disagreement_score":0.9395508,"about_ca_system_score_codex":0.000042099542,"about_ca_system_score_gemma":0.000010611862,"threshold_uncertainty_score":0.3319423},"labels":[],"label_agreement":null},{"id":"W1980008253","doi":"10.1007/s10766-010-0152-3","title":"Process Arrival Pattern Aware Alltoall and Allgather on InfiniBand Clusters","year":2010,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"InfiniBand; Remote direct memory access; Computer science; Speedup; Process (computing); Implementation; Parallel computing; Message passing; Theory of computation; Message Passing Interface; Distributed computing; Operating system; Algorithm; Programming language","score_opus":0.012444799379636131,"score_gpt":0.2962985924852328,"score_spread":0.2838537931055967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980008253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11711762,0.000039600396,0.87866014,0.0025542374,0.0009816631,0.00012429936,9.34131e-7,0.00011160285,0.00040988575],"genre_scores_gemma":[0.9015593,0.000019764373,0.09749884,0.0005616533,0.00029641195,0.0000053930867,0.0000016571504,0.0000124872595,0.00004451623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849993,0.000043653796,0.00044190243,0.00022559079,0.000585915,0.0002029989],"domain_scores_gemma":[0.9987165,0.00009410505,0.0004415364,0.0001762926,0.00043867237,0.00013289381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004767717,0.00016137226,0.00017938997,0.0002474202,0.000074636584,0.00037622536,0.0011794785,0.00008412583,0.000010442043],"category_scores_gemma":[0.00008654955,0.00013593305,0.00009057173,0.00009728915,0.00006327479,0.0004680141,0.0001456953,0.00045585897,0.0000043908058],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016922902,0.0005096049,0.016019892,0.000033824916,0.0003471984,0.0003617847,0.0033932163,0.017974786,0.00037500612,0.0050438414,0.0011686716,0.95460296],"study_design_scores_gemma":[0.010227426,0.0036425253,0.018182011,0.0012302293,0.00008779732,0.0049971472,0.0005216761,0.8276681,0.0045813145,0.019718193,0.10663879,0.0025048275],"about_ca_topic_score_codex":0.0000093995,"about_ca_topic_score_gemma":0.000008562311,"teacher_disagreement_score":0.95209813,"about_ca_system_score_codex":0.000023592083,"about_ca_system_score_gemma":0.00007166451,"threshold_uncertainty_score":0.5543189},"labels":[],"label_agreement":null},{"id":"W1980136882","doi":"10.1109/sc.2014.16","title":"Managing DRAM Latency Divergence in Irregular GPGPU Applications","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; CAS latency; Memory controller; Parallel computing; Dram; Interleaved memory; Latency (audio); Registered memory; Scheduling (production processes); Memory bandwidth; Interleaving; General-purpose computing on graphics processing units; Flat memory model; Embedded system; Distributed computing; Memory management; Operating system; Computer hardware; Semiconductor memory; Graphics","score_opus":0.009242072573304977,"score_gpt":0.23918917320900643,"score_spread":0.22994710063570145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980136882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025332862,0.000036571604,0.9676866,0.0009729168,0.00004614989,0.00011861799,7.998148e-8,0.00060494203,0.03028081],"genre_scores_gemma":[0.56342095,0.000032758187,0.43544483,0.0003164561,0.00002122708,0.00003409366,0.0000011481036,0.0000041513936,0.00072437304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923664,0.000043325683,0.00015923112,0.00027469886,0.000115340314,0.00017076773],"domain_scores_gemma":[0.99940026,0.000037992304,0.000040615938,0.00044015067,0.00003727081,0.000043734315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026433257,0.00007475648,0.00008277441,0.00012442221,0.00008864061,0.00007145129,0.000732867,0.000032004536,0.000012244532],"category_scores_gemma":[0.000012070965,0.00007169619,0.000024278794,0.0004705213,0.000018780138,0.00018933993,0.00022852333,0.00006738923,0.000062967054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.425691e-7,0.00006657991,0.0051052007,0.000011673494,0.0000032529379,0.0000016274972,0.00026395285,0.026102263,0.000108056855,0.7868525,0.0015621376,0.17992213],"study_design_scores_gemma":[0.00007701199,0.000013631766,0.0027943116,0.000010202686,7.8183405e-7,0.0000019363276,0.0000041631833,0.91966814,0.000584697,0.06671642,0.009992625,0.00013607653],"about_ca_topic_score_codex":0.000042126838,"about_ca_topic_score_gemma":0.000005695202,"teacher_disagreement_score":0.8935659,"about_ca_system_score_codex":0.000017955528,"about_ca_system_score_gemma":0.00001142549,"threshold_uncertainty_score":0.2923686},"labels":[],"label_agreement":null},{"id":"W1980386426","doi":"10.1109/dsd.2013.19","title":"pCache: An Observable L1 Data Cache Model for FPGA Prototyping of Embedded Systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cache; Embedded system; Debugging; Field-programmable gate array; Emulation; Cache algorithms; FPGA prototype; Software; CPU cache; Computer hardware; Parallel computing; Operating system","score_opus":0.15023197888594614,"score_gpt":0.32725009190462573,"score_spread":0.1770181130186796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980386426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007800007,0.00008367587,0.9957138,0.00012833352,0.00006261769,0.0014741824,0.0000064401543,0.00054870866,0.0012022586],"genre_scores_gemma":[0.20930544,0.0000060779344,0.78908175,0.00009529646,0.000029499044,0.00023754805,0.000031903553,0.000011168445,0.0012013325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987808,0.0000640835,0.00032867692,0.00042946247,0.00016152582,0.00023547625],"domain_scores_gemma":[0.9979338,0.0000655637,0.00014150424,0.0015146534,0.000266229,0.00007825951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065549696,0.00011790494,0.00020039151,0.000063833766,0.00009315347,0.00020254837,0.0019669535,0.00007155051,0.0000049579885],"category_scores_gemma":[0.000061309234,0.00010027462,0.000029440795,0.00019674242,0.00002005518,0.0012717878,0.00043557602,0.000060783394,0.00000545728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012069197,0.00031704488,0.00016147332,0.00038787187,0.00005225854,4.8835045e-7,0.0015510621,0.8604335,0.0015564351,0.06873894,0.0403245,0.026464371],"study_design_scores_gemma":[0.0001444155,0.00005232297,0.000016182088,0.00002883486,0.0000032897376,0.0000016550838,0.000026729644,0.9959943,0.0015794695,0.0017176978,0.00029870804,0.00013637963],"about_ca_topic_score_codex":0.00027414344,"about_ca_topic_score_gemma":0.000004367561,"teacher_disagreement_score":0.20852543,"about_ca_system_score_codex":0.000016233404,"about_ca_system_score_gemma":0.00009415413,"threshold_uncertainty_score":0.40890804},"labels":[],"label_agreement":null},{"id":"W1980628485","doi":"10.1145/782814.782851","title":"miNI","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Virtual memory; Embedded system; Distributed computing; Memory management; Operating system; Semiconductor memory","score_opus":0.016471916814322612,"score_gpt":0.25192681481704987,"score_spread":0.23545489800272726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980628485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012831413,0.000016451235,0.7576927,0.00013492527,0.00004931511,0.000015832002,1.03402815e-8,0.00040839417,0.24155407],"genre_scores_gemma":[0.23103392,0.0000029687726,0.7657224,0.00043509484,0.0000037959323,0.0000013417493,6.734232e-8,0.0000012576963,0.0027991491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997006,0.00002255132,0.00005249917,0.00009800607,0.000051718274,0.00007462872],"domain_scores_gemma":[0.9997333,0.000015860169,0.000011974169,0.00019395372,0.000020082392,0.000024818648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009971526,0.000030488442,0.000031020405,0.000027495356,0.000033924844,0.000041628045,0.00021452188,0.000013995288,0.000028916607],"category_scores_gemma":[0.000023377323,0.000025781106,0.000013926675,0.00013103843,0.0000053304657,0.00008363993,0.000025260431,0.000020540667,0.000056111283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.818239e-8,0.000010216985,0.00013664046,4.2927235e-7,9.498693e-7,9.787594e-7,0.00003338677,0.00021710274,0.000022212264,0.9828585,0.013017173,0.0037023975],"study_design_scores_gemma":[0.00037093362,0.000099492005,0.0005953728,0.000008599703,0.0000016618836,0.000056509114,0.000013795506,0.31269628,0.066127144,0.096633404,0.52291656,0.00048024143],"about_ca_topic_score_codex":0.0000013851155,"about_ca_topic_score_gemma":1.4932347e-7,"teacher_disagreement_score":0.88622504,"about_ca_system_score_codex":0.0000039803685,"about_ca_system_score_gemma":0.000014082791,"threshold_uncertainty_score":0.105132304},"labels":[],"label_agreement":null},{"id":"W1981522608","doi":"10.5539/cis.v6n2p1","title":"Local Area Multicomputer (LAM -MPI)","year":2013,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Message Passing Interface; Interface (matter); Parallel computing; Message passing; Architecture; Computer architecture; Distributed computing; Operating system","score_opus":0.011234367415668208,"score_gpt":0.23143806508523834,"score_spread":0.22020369766957013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981522608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047543305,0.000016215243,0.98914236,0.00059426914,0.00033400452,0.0001983586,3.475845e-7,0.0005030818,0.004457063],"genre_scores_gemma":[0.6024763,0.000017328126,0.39499837,0.0024444426,0.000027594677,0.000012053205,0.0000019351903,0.0000021399414,0.000019819068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986243,0.000022373222,0.00034439395,0.00027635775,0.00040527366,0.00032728538],"domain_scores_gemma":[0.9987807,0.000052641557,0.00011666035,0.00042772834,0.0004261052,0.00019612024],"candidate_categories":["scholarly_communication"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.00042126788,0.0001442343,0.00013187891,0.0003812496,0.00036893642,0.0014215498,0.0010798748,0.000045442477,0.000013229294],"category_scores_gemma":[0.000020094696,0.000120219775,0.000030808893,0.0007957408,0.0003201667,0.013858804,0.0007473053,0.00010831082,0.00019583263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011394267,0.000029477807,0.00030885634,0.000016829152,0.00000435377,7.3673834e-7,0.0018992085,0.013136182,0.00006211661,0.06888848,0.008582259,0.90707034],"study_design_scores_gemma":[0.0001709635,0.000052492578,0.008531743,0.000014936318,6.570912e-7,0.000027122509,0.0000113564265,0.9835385,0.0005410431,0.0008618462,0.006077055,0.0001722635],"about_ca_topic_score_codex":0.000016826129,"about_ca_topic_score_gemma":1.1476665e-7,"teacher_disagreement_score":0.97040236,"about_ca_system_score_codex":0.000037930593,"about_ca_system_score_gemma":0.00008560879,"threshold_uncertainty_score":0.99993384},"labels":[],"label_agreement":null},{"id":"W1981806722","doi":"10.1109/igcc.2012.6322289","title":"A study of hardware performance monitoring counter selection in power modeling of computing systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Benchmark (surveying); Context (archaeology); Power (physics); Set (abstract data type); Energy consumption; Selection (genetic algorithm); Reliability engineering; Power management; Event (particle physics); Machine learning; Engineering","score_opus":0.033747887826688194,"score_gpt":0.2831618494895891,"score_spread":0.24941396166290092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981806722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5312782,0.000036889454,0.46800634,0.0000012385196,0.00011484308,0.00009768969,4.25257e-8,0.000077102515,0.00038768636],"genre_scores_gemma":[0.97053754,0.000003839782,0.029402813,0.0000027295832,0.000027398884,0.0000036649553,1.0301847e-7,0.00000504734,0.000016856267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990354,0.00006184197,0.00037556016,0.00013895628,0.00020806781,0.00018017858],"domain_scores_gemma":[0.99951005,0.000027729688,0.00013134125,0.00014949446,0.00015500425,0.000026378073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055794424,0.00008147325,0.00017733074,0.0001803627,0.000043021588,0.000024456673,0.00026466002,0.000034376822,6.0945814e-7],"category_scores_gemma":[0.000010361651,0.000075300224,0.000018977384,0.00038252177,0.0000055524947,0.00040045494,0.00012100371,0.00008474564,7.122807e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002375144,0.00016764093,0.2543688,0.000024299354,0.000006011362,1.173466e-7,0.0047418536,0.7402186,0.00008004933,0.00017187142,0.0000063110397,0.00021205447],"study_design_scores_gemma":[0.00017766781,0.00011462256,0.010331033,0.000105154664,0.0000016238772,0.0000033739855,0.00065024116,0.9874659,0.0010726884,0.0000016200548,0.000001532451,0.00007451614],"about_ca_topic_score_codex":0.00015279508,"about_ca_topic_score_gemma":0.0000010797872,"teacher_disagreement_score":0.43925938,"about_ca_system_score_codex":0.000043700118,"about_ca_system_score_gemma":0.00001544922,"threshold_uncertainty_score":0.3070654},"labels":[],"label_agreement":null},{"id":"W1982078374","doi":"10.1145/1189736.1189737","title":"Specifying memory consistency of write buffer multiprocessors","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Consistency model; Cache coherence; Sequential consistency; Write buffer; Parallel computing; Memory model; Consistency (knowledge bases); Scalability; Shared memory; Out-of-order execution; Multiprocessing; Weak consistency; Equivalence (formal languages); Causal consistency; Abstraction; Programming language; Strong consistency; CPU cache; Correctness; Operating system; Cache","score_opus":0.029202065292871972,"score_gpt":0.2672635606577219,"score_spread":0.2380614953648499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982078374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002931913,0.00022765585,0.99236965,0.0001272482,0.0020815702,0.0003005303,0.0000032709195,0.00071681885,0.0012413296],"genre_scores_gemma":[0.68576425,0.000020486827,0.31371164,0.00011440976,0.00014578387,0.000009351115,0.0000012535696,0.000015064045,0.0002177912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979588,0.000103748374,0.00069918606,0.00048665085,0.0004057755,0.00034584696],"domain_scores_gemma":[0.9977698,0.00043570992,0.00023974286,0.0011493476,0.00027943085,0.00012601017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077861745,0.00023106766,0.0003593845,0.00043298822,0.00022796067,0.00012032199,0.0012802561,0.00012831269,0.000006005117],"category_scores_gemma":[0.000015293303,0.00022438847,0.00015047455,0.0006455273,0.00006751582,0.00031202554,0.000039830713,0.00023588294,0.000026245027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000953001,0.0012281893,0.0005078886,0.0006670032,0.0003635148,0.00011164493,0.0054068957,0.48479152,0.0012406377,0.013548611,0.0027717464,0.48926705],"study_design_scores_gemma":[0.0017696227,0.00068900303,0.001648717,0.0008067783,0.000041414554,0.00026907524,0.00022627747,0.9518289,0.03547521,0.0005369126,0.005580589,0.001127479],"about_ca_topic_score_codex":0.000087483495,"about_ca_topic_score_gemma":0.000006774579,"teacher_disagreement_score":0.6828323,"about_ca_system_score_codex":0.000060885515,"about_ca_system_score_gemma":0.000053830692,"threshold_uncertainty_score":0.9150296},"labels":[],"label_agreement":null},{"id":"W1982444443","doi":"10.1109/ipdpsw.2010.5470770","title":"Performance study of mapping irregular computations on GPUs","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"CUDA; Computer science; Parallel computing; Parallelism (grammar); Synchronization (alternating current); General-purpose computing on graphics processing units; Focus (optics); Computation; Data parallelism; Graphics; Computational science; Algorithm; Computer graphics (images)","score_opus":0.019956886152854285,"score_gpt":0.2606445437121517,"score_spread":0.24068765755929739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982444443","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5191327,9.98217e-7,0.47459808,0.000060809547,0.00012213105,0.00010298071,8.09048e-8,0.00025071568,0.005731562],"genre_scores_gemma":[0.80142933,8.5013573e-7,0.19832794,0.00006053073,0.000014001705,0.000004751225,4.315566e-7,0.0000029621553,0.00015918993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.000027572898,0.00018652719,0.00018902661,0.0001742423,0.000105461564],"domain_scores_gemma":[0.99933535,0.000052124695,0.00007531239,0.0004074334,0.00009647208,0.00003328706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019487634,0.00007251333,0.000100499485,0.00014569852,0.0001119964,0.00003962606,0.00050391344,0.0000278586,0.000007921572],"category_scores_gemma":[0.000014599231,0.000063606814,0.000021599637,0.0003307897,0.000019182033,0.00013242305,0.00011349333,0.00012010235,0.0000126689265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018273997,0.0049321307,0.053731617,0.000075959026,0.00010953537,0.000013285596,0.016329367,0.5009525,0.005537868,0.15809809,0.00625166,0.25394973],"study_design_scores_gemma":[0.00023651255,0.0002867964,0.023353787,0.00000982437,0.000001367885,0.000003329608,0.00005759928,0.972973,0.0024375392,0.00026922446,0.00026921343,0.00010183712],"about_ca_topic_score_codex":0.000013472886,"about_ca_topic_score_gemma":0.000003687844,"teacher_disagreement_score":0.47202048,"about_ca_system_score_codex":0.0000049613445,"about_ca_system_score_gemma":0.00001933278,"threshold_uncertainty_score":0.25938106},"labels":[],"label_agreement":null},{"id":"W1982516565","doi":"10.1145/1862648.1862652","title":"MPI as a Programming Model for High-Performance Reconfigurable Computers","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"High Performance Research Computing, Texas A and M University","keywords":"Computer science; Software portability; Computer architecture; Programming paradigm; Usability; x86; Supercomputer; Field-programmable gate array; Software; Parallel computing; Embedded system; Programming language; Operating system","score_opus":0.01819585152449419,"score_gpt":0.2485739064517128,"score_spread":0.2303780549272186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982516565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03943972,0.00009918107,0.9540217,0.0018528595,0.0009355784,0.00081545534,0.0000072781995,0.0018929391,0.0009352751],"genre_scores_gemma":[0.81819993,0.00010410008,0.17962085,0.00013637342,0.000021523314,0.0004484752,0.0000038461912,0.000020448259,0.0014444368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825174,0.00003359617,0.00043960314,0.0006592424,0.0001367726,0.00047904818],"domain_scores_gemma":[0.9982565,0.00019444402,0.00017834219,0.0010774859,0.00019070906,0.000102542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005103191,0.0002678133,0.00036798257,0.0007222755,0.00069250364,0.00022702017,0.0011189126,0.00045851793,0.0000071951968],"category_scores_gemma":[0.000052381278,0.00026025652,0.00006138397,0.00065500994,0.00013933971,0.00053156,0.000010813081,0.0005996386,0.000021003132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056378387,0.00024252739,0.00008615958,0.00021194715,0.00013690596,0.0000052659348,0.0002958191,0.10197115,0.0034777059,0.18196088,0.0005352153,0.71102005],"study_design_scores_gemma":[0.00057497004,0.000389109,0.000011647949,0.00010627948,0.000015481857,0.00018131772,0.000037416165,0.9622009,0.02313014,0.009125479,0.0038571625,0.00037010736],"about_ca_topic_score_codex":0.000039201852,"about_ca_topic_score_gemma":0.000008557437,"teacher_disagreement_score":0.86022973,"about_ca_system_score_codex":0.000028876433,"about_ca_system_score_gemma":0.00009506756,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W1983111999","doi":"10.1109/fpl.2009.5272286","title":"Enhancements to FPGA design methodology using streaming","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Compiler; Throughput; Computer architecture; Kernel (algebra); Replication (statistics); Compile time; Logic synthesis; Embedded system; Parallel computing; Logic gate; Programming language; Operating system; Algorithm; Wireless","score_opus":0.16324950711483344,"score_gpt":0.3774101675354304,"score_spread":0.21416066042059695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983111999","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065976364,0.000015718848,0.9956733,0.00047185217,0.00008477124,0.00011831917,5.3934627e-8,0.00047563628,0.0025005671],"genre_scores_gemma":[0.10101676,0.0000025711506,0.89651906,0.0021930183,0.000021539672,0.0000016538414,2.0065511e-7,0.0000026641883,0.00024251765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990818,0.0001727594,0.00015681205,0.00026605066,0.00010941151,0.0002131792],"domain_scores_gemma":[0.999452,0.00009660416,0.00004339999,0.00028448677,0.000055314475,0.00006817541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207247,0.00008689892,0.000116920106,0.00012849733,0.00009185493,0.00007297229,0.00048287513,0.000036910522,0.000010832728],"category_scores_gemma":[0.00006474835,0.00008090479,0.00002293618,0.00033059978,0.000005826006,0.00021474596,0.00009812481,0.000045424396,0.000015554575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013548937,0.000121544756,0.00003011887,0.0000031615566,0.000017813905,0.000013637336,0.0010111984,0.32950944,0.048847362,0.049539488,0.006015465,0.5648772],"study_design_scores_gemma":[0.00012201045,0.00026632822,0.00013292341,0.000014004104,0.0000029225039,0.000010888231,0.00000655456,0.77249634,0.21288978,0.013189153,0.0006446315,0.00022443941],"about_ca_topic_score_codex":0.000013080302,"about_ca_topic_score_gemma":2.9562693e-7,"teacher_disagreement_score":0.5646528,"about_ca_system_score_codex":0.000034873396,"about_ca_system_score_gemma":0.000030113533,"threshold_uncertainty_score":0.32992017},"labels":[],"label_agreement":null},{"id":"W1984005572","doi":"10.1145/1290520.1290522","title":"<i>Forma</i>","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Pointer (user interface); Data structure; Partition (number theory); Alias; Parallel computing; Locality of reference; Theoretical computer science; Algorithm; Computer hardware; Programming language; Cache; Data mining","score_opus":0.01628096330478509,"score_gpt":0.2897348647963653,"score_spread":0.2734539014915802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984005572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025783523,0.0005725518,0.9944733,0.00014413508,0.00017568334,0.00018226067,8.72232e-7,0.00073282846,0.0011400309],"genre_scores_gemma":[0.83246696,0.000038915758,0.16672438,0.0001058996,0.000035388715,0.000016740649,0.0000013751043,0.000008039722,0.00060233026],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991381,0.000028908515,0.00020359839,0.00022522362,0.000157383,0.00024677877],"domain_scores_gemma":[0.99927056,0.00010397669,0.00005646072,0.00043969436,0.000042020456,0.00008727976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247665,0.000107830296,0.00011668007,0.0001273855,0.00021654852,0.00023276712,0.00036926876,0.00006354822,0.0000014311958],"category_scores_gemma":[0.000012695359,0.00009203891,0.0000412622,0.00024988328,0.000024812547,0.00017322045,0.0000122876845,0.00012263075,0.0000065903437],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051598504,0.000060424674,0.000086041255,0.000031538028,0.000018035822,0.000019152618,0.00086337165,0.00085351686,0.00006665309,0.0045423196,0.000107279324,0.9933465],"study_design_scores_gemma":[0.004717891,0.0045757582,0.0027788116,0.0012686838,0.00014801382,0.0023525795,0.011276402,0.39582878,0.028651629,0.0025472934,0.5413424,0.0045117647],"about_ca_topic_score_codex":0.00009944047,"about_ca_topic_score_gemma":0.000008602213,"teacher_disagreement_score":0.98883474,"about_ca_system_score_codex":0.000016805066,"about_ca_system_score_gemma":0.0000096430285,"threshold_uncertainty_score":0.37532377},"labels":[],"label_agreement":null},{"id":"W1984058114","doi":"10.1007/s00607-013-0329-x","title":"An integrated fine-grain runtime system for MPI","year":2013,"lang":"en","type":"article","venue":"Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vice Chancellor for Research and Technology, Kerman University of Medical Sciences","keywords":"Computer science; Parallel computing; Computational science","score_opus":0.015965434546085056,"score_gpt":0.26291138819052345,"score_spread":0.2469459536444384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984058114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108293975,0.000045058925,0.9846877,0.000199739,0.0003967057,0.00044854282,0.0000013081534,0.0024378377,0.0009537185],"genre_scores_gemma":[0.55352914,2.5384645e-7,0.4461549,0.000102572725,0.000089336274,0.000015527323,0.000009687772,0.000011281967,0.00008730618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859005,0.000104733524,0.0003440672,0.00044997284,0.00014312011,0.0003680329],"domain_scores_gemma":[0.99870753,0.00014130677,0.00015784273,0.0005596492,0.00031781898,0.00011586156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049362326,0.00017859194,0.00022194818,0.00014117414,0.00030357152,0.00047087978,0.0010830566,0.00007941215,0.0000063014068],"category_scores_gemma":[0.000061000956,0.00016375884,0.00007653714,0.00039482515,0.000025120178,0.00037025881,0.00018356756,0.00011920268,0.000079721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010220145,0.00027357167,0.0013634419,0.00026517286,0.00007893127,0.000011350772,0.0024240494,0.10490845,0.0036573727,0.10968343,0.051892415,0.72543156],"study_design_scores_gemma":[0.00021569412,0.000092022456,0.0002880587,0.0000802989,0.0000027030746,0.000011790374,0.000043535998,0.99500775,0.0020325717,0.000557518,0.0014564785,0.00021157792],"about_ca_topic_score_codex":0.0000549907,"about_ca_topic_score_gemma":9.001962e-7,"teacher_disagreement_score":0.8900993,"about_ca_system_score_codex":0.000060863535,"about_ca_system_score_gemma":0.000051867395,"threshold_uncertainty_score":0.66778916},"labels":[],"label_agreement":null},{"id":"W1984452033","doi":"10.1147/jrd.2010.2057911","title":"Exploitation of multicore systems in a Java virtual machine","year":2010,"lang":"en","type":"article","venue":"IBM Journal of Research and Development","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Multi-core processor; Java; Operating system; strictfp; Scalability; Java concurrency; Virtual machine; Embedded system; Real time Java; Software; Embedded Java; IBM; Computer architecture; Programming language","score_opus":0.055591771804629854,"score_gpt":0.35179258969077387,"score_spread":0.296200817886144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984452033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4851235,0.00043648086,0.51380956,0.0001835429,0.00017144138,0.00010463525,2.8026486e-7,0.000015041864,0.00015553166],"genre_scores_gemma":[0.807208,0.00007827205,0.19264214,0.000006188273,0.000017025963,0.0000023553732,2.964904e-7,0.0000022922957,0.00004344498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.00008798162,0.00037576607,0.000093076094,0.00047800553,0.00015127612],"domain_scores_gemma":[0.99899554,0.00017751358,0.00013164007,0.00009861263,0.00050447753,0.00009220147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021805456,0.00005067275,0.00013001004,0.000501817,0.000056597404,0.00006878288,0.00032604553,0.000036923393,0.0000020218613],"category_scores_gemma":[0.00019468676,0.000039792838,0.0000119740225,0.00026799485,0.000049680086,0.00019743886,0.00011891778,0.00031350722,0.0000011909495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053292536,0.0018344484,0.10199419,0.00047561334,0.00016658157,0.000484874,0.04110693,0.01312277,0.036328305,0.056674793,0.0065621478,0.7407164],"study_design_scores_gemma":[0.008349478,0.0046760887,0.16720837,0.0022702157,0.0000052447426,0.0010636032,0.003092162,0.67515516,0.10595607,0.007713465,0.02347221,0.0010379426],"about_ca_topic_score_codex":0.00002336481,"about_ca_topic_score_gemma":0.000011247789,"teacher_disagreement_score":0.7396785,"about_ca_system_score_codex":0.000025035308,"about_ca_system_score_gemma":0.00025473195,"threshold_uncertainty_score":0.16227049},"labels":[],"label_agreement":null},{"id":"W198468299","doi":"","title":"Array Data Layout for the Reduction of Cache Conflicts","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cache; Cache algorithms; Computer science; Cache pollution; Cache invalidation; Parallel computing; Cache coloring; Cache-oblivious algorithm; Smart Cache; Page cache; Locality; Bus sniffing; Distributed computing; CPU cache","score_opus":0.09565118565107916,"score_gpt":0.32489302278634263,"score_spread":0.22924183713526347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198468299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022944588,0.00007884182,0.9922662,0.0020567614,0.00013883525,0.00014876001,0.0000017930419,0.00019064781,0.0048887637],"genre_scores_gemma":[0.4229589,0.000060425984,0.5743004,0.00022657617,0.000092585484,0.000009848786,0.0000123063255,0.0000047499784,0.002334173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995071,0.000019968646,0.00012395199,0.00017386266,0.00008645975,0.0000886275],"domain_scores_gemma":[0.9989248,0.00009076742,0.000064401545,0.00082101335,0.00008160537,0.000017433156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036723242,0.00004567566,0.00006225285,0.000027384705,0.00007976974,0.000039367827,0.0010769967,0.000024157378,0.0000056084928],"category_scores_gemma":[0.00004865857,0.000029566874,0.000019218682,0.0001548923,0.000027232025,0.00018155221,0.00013452159,0.000033799875,0.0000021587578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006663255,0.00036514597,0.00072259945,0.00005303186,0.00017227494,0.0000019255583,0.0042624404,0.08059658,0.0083437,0.35878664,0.28274024,0.2638888],"study_design_scores_gemma":[0.0001420303,0.000040596555,0.00013220865,0.0000066914586,0.0000057389975,0.000016837315,0.000028440101,0.89500046,0.009506345,0.0011707824,0.09387381,0.000076034696],"about_ca_topic_score_codex":0.000056050318,"about_ca_topic_score_gemma":0.0000025515244,"teacher_disagreement_score":0.8144039,"about_ca_system_score_codex":0.0000049721907,"about_ca_system_score_gemma":0.000021017828,"threshold_uncertainty_score":0.20013456},"labels":[],"label_agreement":null},{"id":"W1984785310","doi":"10.1145/369534.369537","title":"Parallel shared-memory simulator performance for large ATM networks","year":2000,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Speedup; Kernel (algebra); Benchmark (surveying); Multiprocessing; Shared memory; Performance improvement","score_opus":0.023250719919683076,"score_gpt":0.2653314796262749,"score_spread":0.24208075970659182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984785310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015892552,0.00006980406,0.9826216,0.00015871864,0.00017345155,0.0003355475,0.00000470844,0.0006953829,0.000048245813],"genre_scores_gemma":[0.695967,0.00007500836,0.30332288,0.00037896194,0.000089986155,0.000026602584,0.000012315275,0.000014842528,0.00011238074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986074,0.000047239213,0.0003310062,0.00052048446,0.00016888726,0.0003249888],"domain_scores_gemma":[0.99893147,0.00019793908,0.00005599704,0.0005989175,0.00011983415,0.000095838266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024059141,0.00021675427,0.00019776342,0.00012519163,0.00059829536,0.00021110148,0.00046987474,0.00013164067,0.000016436574],"category_scores_gemma":[0.000004316874,0.00022205284,0.000098873614,0.00021579042,0.000011998482,0.00054547744,0.00001803871,0.00017968603,0.000008384476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028478635,0.00005575894,0.000008535137,0.000009083667,0.000011828018,2.4742363e-7,0.0001589693,0.7924119,2.1181914e-7,0.00012585464,0.000018406905,0.20717071],"study_design_scores_gemma":[0.0008185729,0.00018890385,0.000050655533,0.000049338014,0.000011714583,0.0000028902725,0.0000021647704,0.9973732,0.000007653937,0.0009132245,0.00032181022,0.00025986505],"about_ca_topic_score_codex":0.000004278703,"about_ca_topic_score_gemma":8.9768207e-7,"teacher_disagreement_score":0.68007445,"about_ca_system_score_codex":0.00002897638,"about_ca_system_score_gemma":0.000021653346,"threshold_uncertainty_score":0.90550524},"labels":[],"label_agreement":null},{"id":"W1985539519","doi":"10.1145/1272996.1273004","title":"Thread clustering","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":250,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multithreading; Thread (computing); Multiprocessing; Cache; Parallel computing; Operating system; Embedded system; Chip; Computer architecture","score_opus":0.02032641691659588,"score_gpt":0.27938234854282123,"score_spread":0.25905593162622537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985539519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031857513,0.000016181326,0.9035172,0.00016353441,0.00008809216,0.00002538107,1.4158253e-8,0.0008794256,0.09499162],"genre_scores_gemma":[0.2360134,0.000002632039,0.7627294,0.00038762199,0.000022398468,4.1088478e-7,1.4474996e-7,0.0000019444515,0.0008420311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995789,0.0000057386083,0.00009019094,0.000117410214,0.00007604261,0.00013173814],"domain_scores_gemma":[0.99968463,0.000029177208,0.000019417983,0.00020524226,0.000025536603,0.00003600106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029647478,0.00004046345,0.000039528793,0.00005413091,0.000047869537,0.00005092489,0.0003344791,0.00002092435,0.000008053175],"category_scores_gemma":[0.000008212747,0.000035109108,0.000016828057,0.00015457837,0.0000070631563,0.00012637104,0.00013681485,0.000034814,0.00003124161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031497675,0.00004390292,0.001213457,0.000005580043,0.0000068862505,0.00002127437,0.00040612128,0.004696072,0.00027151455,0.7586645,0.007422012,0.22724552],"study_design_scores_gemma":[0.0002767132,0.00008601711,0.0049026147,0.000019056344,0.0000013695327,0.00005328781,0.000017483468,0.9100278,0.026457205,0.03508598,0.022668578,0.0004038864],"about_ca_topic_score_codex":0.000008822809,"about_ca_topic_score_gemma":0.0000062109543,"teacher_disagreement_score":0.90533173,"about_ca_system_score_codex":0.00000993722,"about_ca_system_score_gemma":0.00000670794,"threshold_uncertainty_score":0.14317079},"labels":[],"label_agreement":null},{"id":"W1985856707","doi":"10.1109/cicc.1995.518232","title":"An SRAM-programmable field-configurable memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Static random-access memory; Field-programmable gate array; Application-specific integrated circuit; Embedded system; Memory refresh; Memory map; Flat memory model; Semiconductor memory; Computer hardware; Registered memory; Computer architecture; Flexibility (engineering); Racetrack memory; Memory architecture; Memory management; Computer memory","score_opus":0.019589849647841922,"score_gpt":0.2513628133669155,"score_spread":0.2317729637190736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985856707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006103283,0.00008377684,0.8435296,0.000850878,0.00010372877,0.00008257593,8.535715e-8,0.0015899925,0.15314907],"genre_scores_gemma":[0.53241795,0.000022047487,0.45627302,0.0017759094,0.000046871588,0.000011650371,0.0000010072308,0.000007037609,0.0094444975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991257,0.000043565,0.00014716735,0.00029116517,0.00014209212,0.00025027242],"domain_scores_gemma":[0.9991317,0.000040561354,0.000039432492,0.0006268165,0.00006130283,0.00010018579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001612081,0.00009673065,0.00010010603,0.00007055379,0.00013698774,0.00026064942,0.0007973654,0.000060479055,0.0004495457],"category_scores_gemma":[0.000017875622,0.000086978805,0.00003799055,0.0002649223,0.000013893794,0.0004883481,0.000064272805,0.000090935115,0.0001677942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038561507,0.00048272213,0.0002052597,0.000017452341,0.000022803453,0.00003700112,0.00096962234,0.034774143,0.0006923426,0.12025366,0.18328528,0.65925586],"study_design_scores_gemma":[0.00011712348,0.00015513661,0.000017236012,0.0000045916804,0.0000012087063,0.000010578492,0.000008590521,0.9751548,0.011451612,0.0018863828,0.011031725,0.00016098608],"about_ca_topic_score_codex":0.00007017067,"about_ca_topic_score_gemma":0.0000026993143,"teacher_disagreement_score":0.9403807,"about_ca_system_score_codex":0.000010881669,"about_ca_system_score_gemma":0.000008642018,"threshold_uncertainty_score":0.49222103},"labels":[],"label_agreement":null},{"id":"W1986033055","doi":"10.1145/1294325.1294348","title":"The potential of trace-level parallelism in Java programs","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"TRACE (psycholinguistics); Java; Computer science; Parallelism (grammar); Parallel computing; Task parallelism; Programming language","score_opus":0.024793863050915365,"score_gpt":0.27004110851731267,"score_spread":0.2452472454663973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986033055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071358806,0.00011065472,0.98552805,0.00045147288,0.00010050896,0.00013510887,9.047084e-8,0.00018762851,0.0063506253],"genre_scores_gemma":[0.70042324,0.000025254083,0.2989781,0.000044041513,0.000015476715,0.0000029217308,3.9273985e-7,0.0000027341057,0.0005078311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.000034761884,0.00028778915,0.00015793959,0.00018671459,0.00022850177],"domain_scores_gemma":[0.99946004,0.00006450898,0.000076552256,0.0002970584,0.00006662345,0.000035230903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009072631,0.000069377624,0.00008730785,0.00006938149,0.00007174034,0.00006297695,0.0006791315,0.0000469772,0.0000019693712],"category_scores_gemma":[0.000020772715,0.000046528265,0.00004273096,0.00033148835,0.00004826085,0.00010862228,0.0001177219,0.00008570627,0.0000036085933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001758382,0.00019284384,0.0011123643,0.0000066930347,0.000010164098,0.000016312426,0.0005115842,0.0040986324,0.0003233301,0.16985376,0.0011566984,0.8227],"study_design_scores_gemma":[0.0010848852,0.00031221905,0.058101773,0.000055490986,0.000004577688,0.000040163653,0.0002084618,0.888395,0.0108672315,0.028220575,0.012214438,0.0004951857],"about_ca_topic_score_codex":0.00007091531,"about_ca_topic_score_gemma":0.000059488386,"teacher_disagreement_score":0.88429636,"about_ca_system_score_codex":0.000012371544,"about_ca_system_score_gemma":0.000027203952,"threshold_uncertainty_score":0.18973675},"labels":[],"label_agreement":null},{"id":"W1986417753","doi":"10.1109/csmr-wcre.2014.6747175","title":"Mc2FOR: A tool for automatically translating MATLAB to FORTRAN 95","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fortran; MATLAB; Computer science; Programming language; Scripting language; Computational science; Python (programming language); Parallel computing","score_opus":0.015018513551622701,"score_gpt":0.2710995477661053,"score_spread":0.2560810342144826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986417753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007832789,0.000004705604,0.98682797,0.0022279802,0.00007130725,0.00038247945,7.769284e-7,0.0015359871,0.008165542],"genre_scores_gemma":[0.17695092,4.0140114e-7,0.82127035,0.0013768933,0.000036012134,0.000048747173,0.0000012455454,0.000008673632,0.00030678738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990052,0.000029984281,0.00026923433,0.00028026922,0.00014670224,0.00026861436],"domain_scores_gemma":[0.9992844,0.00015569478,0.00003938534,0.00035796198,0.000077667435,0.0000849294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048256112,0.00011050547,0.00015060721,0.000062563464,0.00012799074,0.00017722698,0.0005604653,0.000048194248,0.000009452362],"category_scores_gemma":[0.00009615905,0.00009601982,0.0000740203,0.00020262835,0.000009289866,0.00017950207,0.000060169656,0.000045253524,0.000022245413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008040998,0.000060214395,0.00008101679,0.00006162135,0.000013912259,5.0129205e-7,0.000987013,0.010113304,0.0006210398,0.6352775,0.014879977,0.33789587],"study_design_scores_gemma":[0.00020146195,0.00014655449,0.00008021256,0.000019646148,0.0000024385513,0.0000029331409,0.000002421306,0.97734606,0.0013224115,0.013046172,0.0076670917,0.00016260838],"about_ca_topic_score_codex":0.00000503613,"about_ca_topic_score_gemma":0.0000036478095,"teacher_disagreement_score":0.96723276,"about_ca_system_score_codex":0.0000127378,"about_ca_system_score_gemma":0.00002516186,"threshold_uncertainty_score":0.39155748},"labels":[],"label_agreement":null},{"id":"W1986491730","doi":"10.1145/1534909.1534910","title":"A mechanistic performance model for superscalar out-of-order processors","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Vlaamse regering; Universiteit Gent; Fonds Wetenschappelijk Onderzoek; Intel Corporation","keywords":"Computer science; Pipeline (software); Microarchitecture; Parallel computing; Cache; Interval (graph theory); Scaling; Superscalar; Branch predictor; Pipeline burst cache; Out-of-order execution; Instructions per cycle; Speculative execution; CPU cache; Cache algorithms; Operating system; Central processing unit","score_opus":0.033222980145080835,"score_gpt":0.26627283961380843,"score_spread":0.23304985946872758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986491730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054456067,0.00005002074,0.9969156,0.00031565156,0.0009561239,0.0005410148,0.000007041941,0.00057954964,0.00009045275],"genre_scores_gemma":[0.5438531,0.000013060216,0.4556935,0.00013608673,0.00005417927,0.000046765006,0.0000020884825,0.000009139941,0.00019203036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856514,0.000043584143,0.00041666572,0.0004307715,0.00026246396,0.00028135927],"domain_scores_gemma":[0.9985438,0.0001057507,0.00012810878,0.000803592,0.00033879647,0.00007993691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026717226,0.00020748003,0.0002986779,0.00021797152,0.00021904199,0.00011875929,0.001140191,0.00010342022,7.8087487e-7],"category_scores_gemma":[0.000010896829,0.00019488737,0.000108212196,0.00036223728,0.00001991652,0.0003256977,0.000013377305,0.00012874522,0.0000064995993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001644582,0.0001637279,0.0000018997465,0.00009501207,0.000022994842,5.745534e-7,0.0008600972,0.96019363,0.000054301832,0.0056407377,0.00034851668,0.03260206],"study_design_scores_gemma":[0.00036747288,0.0005022253,0.000008362674,0.00011590325,0.000012016571,0.000008023993,0.0000056166796,0.99623966,0.0013277726,0.00097558706,0.0002223082,0.00021506455],"about_ca_topic_score_codex":0.0000037727611,"about_ca_topic_score_gemma":8.57379e-7,"teacher_disagreement_score":0.54330856,"about_ca_system_score_codex":0.000045405854,"about_ca_system_score_gemma":0.00008395233,"threshold_uncertainty_score":0.7947276},"labels":[],"label_agreement":null},{"id":"W1986504530","doi":"10.1145/1836845.1836904","title":"ATI Stream Profiler","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Shader; Compiler; Graphics; Parallel computing; Stream processing; Implementation; Hardware acceleration; Bandwidth (computing); Computer architecture; Computer graphics (images); Software; Operating system","score_opus":0.010966450091624946,"score_gpt":0.25308441142918264,"score_spread":0.2421179613375577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986504530","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041614166,0.0000025673885,0.9042889,0.00048683106,0.00018133942,0.00005272932,1.2362605e-7,0.0009767913,0.0898493],"genre_scores_gemma":[0.38146365,9.33391e-7,0.61592335,0.00024822677,0.00002986981,0.000003921151,6.143221e-7,0.000002352569,0.0023271209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.00001008874,0.000078592566,0.00015600349,0.00008676488,0.00010645517],"domain_scores_gemma":[0.99951845,0.000019823901,0.0000240232,0.00034675116,0.000048855825,0.000042070664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010067566,0.00005117332,0.000046408786,0.00004020401,0.00005428113,0.00008429231,0.00046371281,0.000035996283,0.00008346114],"category_scores_gemma":[0.000019938905,0.000040957184,0.000019412206,0.00014103368,0.000014293648,0.00015724603,0.000115988216,0.0000974458,0.00008170224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.30712e-7,0.00008016445,0.0023685321,0.0000037546072,0.0000059904746,0.000003494881,0.00017963156,0.00030945268,0.0030162977,0.854786,0.05522852,0.084017366],"study_design_scores_gemma":[0.00021335344,0.000069686386,0.003890109,0.0000056009712,0.0000015677241,0.000020958732,0.0000041382004,0.86488813,0.06821105,0.016239636,0.046113495,0.00034227184],"about_ca_topic_score_codex":0.000009858051,"about_ca_topic_score_gemma":0.0000037803452,"teacher_disagreement_score":0.86457866,"about_ca_system_score_codex":0.0000025477834,"about_ca_system_score_gemma":0.000022578815,"threshold_uncertainty_score":0.16701855},"labels":[],"label_agreement":null},{"id":"W1986874495","doi":"10.1145/782814.782835","title":"Performance characteristics of openMP constructs, and application benchmarks on a large symmetric multiprocessor","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Spec#; Parallel computing; Scalability; Benchmark (surveying); Multiprocessing; Shared memory; Node (physics); Instruction set; Distributed memory; Distributed shared memory; Operating system; Programming language; Memory management; Uniform memory access","score_opus":0.007291244628089864,"score_gpt":0.23140862225202277,"score_spread":0.2241173776239329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986874495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109355494,0.000029749965,0.87314504,0.000037630547,0.000037847196,0.00016153249,0.0000017573676,0.00009999234,0.01713096],"genre_scores_gemma":[0.85548013,0.0000761933,0.1442542,0.000111039575,0.0000044264148,0.0000086301825,0.00000380966,0.000002897374,0.000058659596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932367,0.000028233999,0.00019315338,0.00021269995,0.00011663493,0.000125613],"domain_scores_gemma":[0.9994221,0.000061777784,0.00012438712,0.00024572312,0.00010482427,0.000041189312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024902375,0.00008176027,0.00012613693,0.00013542188,0.00007785932,0.000037531518,0.00023217993,0.000043472628,0.0000068541967],"category_scores_gemma":[0.00007743324,0.0000719235,0.000013121076,0.0004262491,0.000027696373,0.0001404002,0.000059935464,0.00006175643,0.0000033094461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011843855,0.00025858614,0.051498037,0.0001475788,0.000015982292,9.8946e-7,0.0003233028,0.00026181157,0.00040022857,0.77660173,0.00041281708,0.17006709],"study_design_scores_gemma":[0.00048625632,0.00016742575,0.023282142,0.000038232825,0.000004145543,0.000014050732,0.000013703723,0.9569655,0.016147362,0.0005569739,0.0021028596,0.00022131804],"about_ca_topic_score_codex":0.0000021663595,"about_ca_topic_score_gemma":2.403462e-7,"teacher_disagreement_score":0.9567037,"about_ca_system_score_codex":0.000009675598,"about_ca_system_score_gemma":0.000029170355,"threshold_uncertainty_score":0.29329553},"labels":[],"label_agreement":null},{"id":"W1987156915","doi":"10.4108/icst.iniscom.2015.258414","title":"A Dual-Issue Embedded Processor for Low Power Devices","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Superscalar; Embedded system; Efficient energy use; Dual (grammatical number); Power (physics); Low-power electronics; Battery (electricity); Power consumption; Computer architecture; Parallel computing; Electrical engineering; Engineering","score_opus":0.025759065841728206,"score_gpt":0.296784762946851,"score_spread":0.2710256971051228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987156915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008140416,0.00006596462,0.9769024,0.001184189,0.0001651616,0.00023995264,6.221836e-7,0.0010088639,0.019618798],"genre_scores_gemma":[0.26893124,0.0000014381711,0.7259468,0.001239715,0.00006188714,0.00004556273,0.000002322763,0.000008422232,0.0037626466],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991713,0.000021769347,0.0001647359,0.00027265077,0.00016696956,0.00020258452],"domain_scores_gemma":[0.9991606,0.000050584946,0.000068808724,0.00029533706,0.0003116542,0.000113036185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031313463,0.00009883239,0.00012101505,0.00007116331,0.00006501616,0.0001725873,0.00047247877,0.000050178063,0.000011923648],"category_scores_gemma":[0.000101311125,0.000082765604,0.000035795478,0.00024248575,0.000015366915,0.00033509906,0.00012562126,0.000039713595,0.00005592331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058029556,0.00051582087,0.00042021106,0.00015697436,0.00006353143,0.000015499718,0.008660439,0.013501426,0.00019890697,0.13069466,0.8185783,0.027136207],"study_design_scores_gemma":[0.00082661177,0.00036065603,0.000061542785,0.000039302504,0.000004844956,0.000018076555,0.000117296986,0.87308306,0.014074635,0.012212321,0.09876227,0.00043937837],"about_ca_topic_score_codex":0.000005645134,"about_ca_topic_score_gemma":0.000002694745,"teacher_disagreement_score":0.85958165,"about_ca_system_score_codex":0.000017352346,"about_ca_system_score_gemma":0.000104834915,"threshold_uncertainty_score":0.33750835},"labels":[],"label_agreement":null},{"id":"W1987274898","doi":"10.1145/2642769.2642773","title":"GPU-Aware Intranode MPI_Allreduce","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Speedup; Exploit; Parallel computing; CUDA; Reduction (mathematics); Multi-core processor; Shared memory; Computer architecture","score_opus":0.010639596411142507,"score_gpt":0.24030444018594704,"score_spread":0.22966484377480453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987274898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037300272,0.000011370987,0.9492313,0.0011543548,0.00013228458,0.000043165353,9.7746366e-8,0.0012798966,0.04777447],"genre_scores_gemma":[0.6135727,0.000006104244,0.3843454,0.0010332485,0.000048066337,0.0000034907757,9.079038e-7,0.000004463587,0.0009856044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993033,0.000050726278,0.00012412181,0.00023210653,0.00012413425,0.00016561634],"domain_scores_gemma":[0.99938667,0.00004851862,0.0000330775,0.00041101253,0.000057521633,0.00006318243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020967996,0.00008014196,0.00008683398,0.000060212016,0.000079474994,0.0001095463,0.00068165024,0.000038502338,0.00002594402],"category_scores_gemma":[0.000027581638,0.00006935013,0.000032206655,0.00019103233,0.000016577675,0.00018131573,0.00013594337,0.000065363885,0.000099817094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025743702,0.0000893593,0.0003690988,0.000013219634,0.00001323466,0.0000027626418,0.00040705278,0.0130836405,0.00032137695,0.7183768,0.066445425,0.20087545],"study_design_scores_gemma":[0.00010692415,0.000042208132,0.00021725867,0.0000074540562,9.924735e-7,0.0000071503173,0.0000025541017,0.9668568,0.0055751437,0.008315236,0.018716048,0.0001522625],"about_ca_topic_score_codex":0.000013942342,"about_ca_topic_score_gemma":0.0000014560679,"teacher_disagreement_score":0.95377314,"about_ca_system_score_codex":0.000010700092,"about_ca_system_score_gemma":0.000019322986,"threshold_uncertainty_score":0.2828016},"labels":[],"label_agreement":null},{"id":"W1987310458","doi":"10.1109/fpl.2014.6927469","title":"Using buffer-to-BRAM mapping approaches to trade-off throughput vs. memory use","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Throughput; Chip; Memory management; Physical address; Embedded system; Write buffer; Auxiliary memory; Interleaved memory; Parallel computing; Computer hardware; Semiconductor memory; Operating system","score_opus":0.1823433303480427,"score_gpt":0.2808381092267489,"score_spread":0.0984947788787062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987310458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101299565,0.00001558706,0.97869545,0.0027676632,0.00020106375,0.00030783532,4.3360222e-7,0.0012604998,0.0066214805],"genre_scores_gemma":[0.27726245,0.0000018126616,0.7187585,0.003466157,0.000089912195,0.000009138816,9.695626e-7,0.00001446647,0.00039657817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826264,0.0001399757,0.00030087205,0.0006155036,0.00027522037,0.000405799],"domain_scores_gemma":[0.9987756,0.00013474278,0.00006851648,0.0007691792,0.000035438603,0.00021654206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051671726,0.00021253584,0.00025399675,0.00023922832,0.00022010792,0.000459707,0.0009667813,0.000085063235,0.000006779455],"category_scores_gemma":[0.00010675078,0.00019637587,0.00007406544,0.0006821335,0.000024055355,0.00052521,0.000499263,0.00012665484,0.000044407858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017973896,0.00024845672,0.0011572636,0.000058457863,0.000053906715,0.000008463702,0.0076734424,0.5939261,0.0013515836,0.13358971,0.024746094,0.23716855],"study_design_scores_gemma":[0.00012182956,0.00007954404,0.00089269335,0.000040613126,0.000003189207,0.000012186793,0.00002344479,0.978544,0.003947865,0.00082443905,0.015158823,0.00035136566],"about_ca_topic_score_codex":0.00006432622,"about_ca_topic_score_gemma":0.0000040376103,"teacher_disagreement_score":0.38461792,"about_ca_system_score_codex":0.000057262194,"about_ca_system_score_gemma":0.000037980248,"threshold_uncertainty_score":0.8007976},"labels":[],"label_agreement":null},{"id":"W1987465195","doi":"10.1145/1148109.1148138","title":"Translating between itanium and sparc memory consistency models","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Parallel computing; Computation; Sequential consistency; Set (abstract data type); Instruction set; Consistency (knowledge bases); Consistency model; Semantics (computer science); Programming language; Artificial intelligence","score_opus":0.025813669637920797,"score_gpt":0.23910593522839327,"score_spread":0.21329226559047249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987465195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022873697,0.00015962882,0.88093984,0.00072232174,0.000024611008,0.000071177,5.8665404e-7,0.00061901886,0.115175456],"genre_scores_gemma":[0.6064825,0.0000034905993,0.3930725,0.00007467733,0.000029999468,0.0000016490827,0.0000010911804,0.0000035514088,0.0003305303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992214,0.00003625237,0.00020190685,0.00024911176,0.00012346583,0.00016789221],"domain_scores_gemma":[0.99958915,0.00006617343,0.00004453847,0.00021211935,0.00004493265,0.00004308174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019719376,0.000092761366,0.00012765054,0.00006499735,0.00012714551,0.00010660797,0.00024378899,0.000045850775,0.0000037907203],"category_scores_gemma":[0.0000041644007,0.000085373424,0.000029353252,0.00014828767,0.000035177167,0.00030461946,0.000073587296,0.000066823566,0.0000029666253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025648214,0.000063848194,0.0043012183,0.000041473937,0.00002460365,0.000013101117,0.0008248949,0.045037407,0.00049173785,0.84969294,0.0046657464,0.0948405],"study_design_scores_gemma":[0.00018749983,0.000028376737,0.00088045193,0.000013908683,0.000004917442,0.000008946778,0.0000109011335,0.9165852,0.0017306302,0.08018888,0.0001611731,0.00019913462],"about_ca_topic_score_codex":0.000113228925,"about_ca_topic_score_gemma":0.000007537647,"teacher_disagreement_score":0.87154776,"about_ca_system_score_codex":0.000008915759,"about_ca_system_score_gemma":0.00002517448,"threshold_uncertainty_score":0.34814274},"labels":[],"label_agreement":null},{"id":"W1987683357","doi":"10.1145/2669594.2669599","title":"BadgerTrap","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Translation lookaside buffer; Computer science; x86; TRACE (psycholinguistics); Instrumentation (computer programming); Computer architecture; Operating system; Physical address; Software","score_opus":0.011646856404069613,"score_gpt":0.2461383071206598,"score_spread":0.23449145071659017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987683357","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013812828,0.000047878864,0.986119,0.004994854,0.0004991878,0.00021588316,6.5403185e-7,0.0017109474,0.005030331],"genre_scores_gemma":[0.11785774,0.000010540204,0.8765405,0.0047472827,0.0006052017,0.000017371187,0.000006146636,0.000024623743,0.0001906256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750566,0.000343428,0.00036433255,0.00077417126,0.00044027224,0.0005721125],"domain_scores_gemma":[0.9968458,0.0006142037,0.000116039766,0.0020781911,0.00010812345,0.00023766786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004730195,0.00031368158,0.0003216856,0.0003075679,0.00023463192,0.00030828064,0.0035305396,0.00011107543,0.000012691326],"category_scores_gemma":[0.00016063041,0.00027215033,0.00016136274,0.0005503825,0.00007699434,0.00019766751,0.001497038,0.00043219453,0.00008355309],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005915469,0.00006552106,0.0003959157,0.000017675045,0.000024486491,0.000008968606,0.0007262579,0.025147779,0.00022394789,0.023075143,0.019027695,0.9312807],"study_design_scores_gemma":[0.0007090213,0.0005304807,0.0019485791,0.000061032548,0.000007330404,0.00012486252,0.0000014739452,0.6645515,0.0020763099,0.10663827,0.22264226,0.000708862],"about_ca_topic_score_codex":0.000026773274,"about_ca_topic_score_gemma":0.00000870154,"teacher_disagreement_score":0.93057185,"about_ca_system_score_codex":0.00002404345,"about_ca_system_score_gemma":0.000056621673,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W1987805948","doi":"10.1145/1210268.1210272","title":"The XTREM power and performance simulator for the Intel XScale core","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Microarchitecture; Computer architecture simulator; Embedded system; Java; Instruction set; Operating system; Cache; Pipeline (software); Energy consumption; Testbed; Compiler; Spec#; Parallel computing; Programming language","score_opus":0.026163182220848905,"score_gpt":0.2851834044729211,"score_spread":0.2590202222520722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987805948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016556425,0.00041599068,0.9800162,0.00041584353,0.0012489844,0.00060338987,0.000001829512,0.000531493,0.00020986387],"genre_scores_gemma":[0.9672269,0.000043339947,0.032087147,0.00018676432,0.00008702885,0.00002043891,6.09132e-7,0.000018442852,0.0003293085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984266,0.000059177277,0.00044062737,0.0003832446,0.00027296433,0.00041738414],"domain_scores_gemma":[0.9956043,0.0029135384,0.00017257105,0.0010328484,0.00019412008,0.00008264745],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001652948,0.00020134734,0.00018356252,0.00009484564,0.0017399724,0.00036663155,0.0012731357,0.00009236956,7.331835e-7],"category_scores_gemma":[0.00007736429,0.00012673593,0.00009827745,0.00037171636,0.00010454631,0.00013912583,0.0000445955,0.00027355264,0.000005565632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012353259,0.00012237974,0.00027512174,0.00007524525,0.00016248463,0.000002698796,0.0046087094,0.6506492,0.00007377057,0.011160582,0.0013761602,0.33137012],"study_design_scores_gemma":[0.00030136254,0.000187994,0.00035073992,0.00007807278,0.000011358951,0.00003761428,0.00034112792,0.99358124,0.0003523142,0.00019291218,0.004387491,0.0001777803],"about_ca_topic_score_codex":0.000012622555,"about_ca_topic_score_gemma":0.0000040351106,"teacher_disagreement_score":0.9506705,"about_ca_system_score_codex":0.000057552523,"about_ca_system_score_gemma":0.00003689772,"threshold_uncertainty_score":0.99955964},"labels":[],"label_agreement":null},{"id":"W1988220683","doi":"10.1145/2699682","title":"ISA Wars","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"x86; Computer science; ARM architecture; Embedded system; Efficient energy use; Operating system; Server; Reduced instruction set computing; Instruction set; Software; Computer hardware; Engineering","score_opus":0.0458146379857923,"score_gpt":0.2677970939450829,"score_spread":0.2219824559592906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988220683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002480819,0.00010504479,0.9917922,0.0006799175,0.004094768,0.00022029289,0.0000022196414,0.0016736638,0.0011838069],"genre_scores_gemma":[0.42649707,0.000013522342,0.5717185,0.0005076419,0.0003371836,0.000045976194,0.000002683376,0.000021122929,0.0008562493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984015,0.00016516609,0.00032639457,0.00044979368,0.00037787712,0.00027927093],"domain_scores_gemma":[0.998079,0.000115716175,0.00009143889,0.0013071655,0.00018854838,0.00021813833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038313214,0.00019475195,0.00022667093,0.00023642139,0.00016436439,0.0003320906,0.00154098,0.00009663028,0.0000026784398],"category_scores_gemma":[0.00001021182,0.00018319723,0.00009128486,0.0004885976,0.000027201146,0.0003806546,0.00004126056,0.0001910422,0.00020765507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013426539,0.00029286338,0.000049529346,0.000028787641,0.00008021391,0.000033207038,0.0014916903,0.821374,0.000010540493,0.009695349,0.048693735,0.118236676],"study_design_scores_gemma":[0.00046641807,0.0002934173,0.000032926604,0.000060883543,0.0000060443795,0.00010582537,0.000020339621,0.95976615,0.00031355253,0.0007586355,0.037865046,0.00031077518],"about_ca_topic_score_codex":0.000071078925,"about_ca_topic_score_gemma":0.0000017136771,"teacher_disagreement_score":0.426249,"about_ca_system_score_codex":0.000090569134,"about_ca_system_score_gemma":0.000086933265,"threshold_uncertainty_score":0.7470566},"labels":[],"label_agreement":null},{"id":"W198825238","doi":"","title":"UMPAL: An Unstructured Mesh Partitioner and Load Balancer on World Wide Web.","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Distributed computing; World Wide Web","score_opus":0.01540096247955141,"score_gpt":0.2623048491487285,"score_spread":0.24690388666917706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198825238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027149143,0.00006401189,0.9076924,0.0025691485,0.00020799096,0.00013989414,9.3291504e-7,0.0014826012,0.060693916],"genre_scores_gemma":[0.85923815,0.00006562646,0.13450797,0.003035758,0.000057518668,0.0000072898747,0.0000026363857,0.00000727541,0.003077784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990967,0.00004949442,0.00014233342,0.0003270098,0.00019377616,0.00019071464],"domain_scores_gemma":[0.9993721,0.00004148324,0.00004496775,0.00036975107,0.000066535984,0.00010514461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014998761,0.00011494157,0.000111517584,0.00009726516,0.00011119613,0.00016536929,0.00029837352,0.000038174785,0.000089386594],"category_scores_gemma":[0.000016770658,0.0000938738,0.000022337777,0.00032603496,0.000036020116,0.00030098885,0.000074716394,0.00008623649,0.000019387999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010009899,0.00037791548,0.051281955,0.000023195402,0.000063517204,0.00008747218,0.0012205963,0.02290221,0.00078224455,0.5490742,0.23649196,0.13759468],"study_design_scores_gemma":[0.0007766792,0.00021060518,0.01818609,0.000044147466,0.0000059648773,0.00003904748,0.000010148847,0.86686337,0.0030731733,0.022543555,0.087709524,0.00053766597],"about_ca_topic_score_codex":0.000020039759,"about_ca_topic_score_gemma":0.00006904857,"teacher_disagreement_score":0.8439612,"about_ca_system_score_codex":0.000029157467,"about_ca_system_score_gemma":0.000037349728,"threshold_uncertainty_score":0.38280624},"labels":[],"label_agreement":null},{"id":"W1989830920","doi":"10.1049/ip-cdt:20050170","title":"Embedded power-aware cycle by cycle variable speed processor","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Computers and Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Pipeline (software); Field-programmable gate array; Computer science; Embedded system; Stratix; Clock rate; Nios II; Energy (signal processing); Power (physics); Computer hardware; Chip","score_opus":0.004336998004645747,"score_gpt":0.2107668771485533,"score_spread":0.20642987914390756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989830920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016491307,0.00019705972,0.93847,0.0004584219,0.00010391441,0.0004907128,0.000019227024,0.0052582575,0.038511075],"genre_scores_gemma":[0.7581698,0.00002223997,0.2408077,0.000395756,0.000095358824,0.00002861701,0.000020014324,0.000037513077,0.0004230397],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977248,0.0000088334855,0.0004892979,0.00084802654,0.00037594326,0.000553152],"domain_scores_gemma":[0.9989286,0.000052399748,0.00026118144,0.00026110755,0.00032708867,0.00016959872],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00022768675,0.00040643598,0.00038701107,0.00023477517,0.0002798928,0.002156623,0.00096837943,0.00018495943,0.0000032331498],"category_scores_gemma":[0.000026494637,0.000394657,0.00008245231,0.00066910463,0.000121325174,0.0022351195,0.00055127277,0.00021460876,0.000006211874],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009046615,0.0017528766,0.0037873813,0.0005412233,0.00012048069,0.000044304004,0.001297789,0.0005766587,0.010823081,0.21873052,0.65582585,0.10640934],"study_design_scores_gemma":[0.0013711606,0.0014697541,0.00034168598,0.0007233715,0.000029222027,0.0003658986,0.00009611621,0.5446183,0.12813957,0.2507982,0.06891657,0.003130141],"about_ca_topic_score_codex":0.00003801859,"about_ca_topic_score_gemma":1.5829146e-7,"teacher_disagreement_score":0.7416785,"about_ca_system_score_codex":0.000058234433,"about_ca_system_score_gemma":0.000046878613,"threshold_uncertainty_score":0.9998505},"labels":[],"label_agreement":null},{"id":"W1989881690","doi":"10.1109/eeei.2010.5662163","title":"Parallel instruction set extension identification","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Instruction set; Compiler; Set (abstract data type); Extension (predicate logic); Application-specific instruction-set processor; Identification (biology); Programming language; Parallel computing; Computer architecture","score_opus":0.01871624307864853,"score_gpt":0.27097832661099336,"score_spread":0.2522620835323448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989881690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035846245,0.00000448651,0.9585609,0.00054762984,0.0005957439,0.00007702538,1.8417539e-7,0.0009795729,0.0033882563],"genre_scores_gemma":[0.5864642,0.000005911087,0.4128724,0.00012541647,0.000036988607,0.0000047932563,0.0000035879007,0.000003043118,0.00048362918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992836,0.000024162458,0.00017417014,0.0002647392,0.00014074934,0.000112593436],"domain_scores_gemma":[0.99923897,0.000017859573,0.00007543286,0.00050787313,0.00011382307,0.000046053276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523847,0.00006990406,0.000061339924,0.00009555936,0.00014412882,0.0001529927,0.00040951392,0.00006473614,0.000021167307],"category_scores_gemma":[0.0000409125,0.00006308054,0.00002873269,0.0002328186,0.000022218717,0.0004281193,0.00009859599,0.0001312337,0.00008319399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066582325,0.000084238054,0.00091384794,0.000008907247,0.000008715133,0.000003630105,0.00041862173,0.00391645,0.066417225,0.7279024,0.019702693,0.18061659],"study_design_scores_gemma":[0.0002697136,0.000027624294,0.013382842,0.000004760556,0.0000022662114,0.000059352493,0.000009142911,0.9236138,0.027484892,0.026917577,0.007994699,0.00023337081],"about_ca_topic_score_codex":0.000016950195,"about_ca_topic_score_gemma":0.0000061659744,"teacher_disagreement_score":0.9196973,"about_ca_system_score_codex":0.000007289732,"about_ca_system_score_gemma":0.000019031004,"threshold_uncertainty_score":0.25723496},"labels":[],"label_agreement":null},{"id":"W1989974920","doi":"10.1145/2446920.2446924","title":"Fast dynamic binary rewriting to support thread migration in shared-ISA asymmetric multicores","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Multi-core processor; Thread (computing); Parallel computing; Exploit; Computer architecture; Operating system","score_opus":0.015748254594112523,"score_gpt":0.27354029590726636,"score_spread":0.25779204131315386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989974920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06783446,0.00002573068,0.92313546,0.0013485921,0.00008264893,0.000373552,0.000001104388,0.00073481357,0.006463612],"genre_scores_gemma":[0.5592463,0.000008788043,0.4398929,0.0004212535,0.000008234705,0.000037705195,0.0000094085235,0.000006416984,0.00036898005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987065,0.00005232279,0.0003310718,0.000403306,0.00020535407,0.00030141763],"domain_scores_gemma":[0.999239,0.00009269061,0.00007041799,0.0003763403,0.00012342267,0.00009810066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024630013,0.00013846128,0.00014987412,0.00063440873,0.00007677268,0.00028833392,0.00062420306,0.00006499646,0.000046445646],"category_scores_gemma":[0.00011069774,0.00012902473,0.00003891447,0.0012854051,0.000012593205,0.00068199134,0.00028839306,0.00010969108,0.00026069768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014275931,0.0007487576,0.096335836,0.000087196764,0.000027288166,0.00006722771,0.0037216584,0.11381937,0.0051927427,0.027641574,0.06184238,0.6905017],"study_design_scores_gemma":[0.00014113131,0.00013912853,0.035447445,0.000029585835,8.3541823e-7,0.0000060631937,0.00004785725,0.96213675,0.0009453202,0.00079362316,0.000113081136,0.00019920844],"about_ca_topic_score_codex":0.0005338907,"about_ca_topic_score_gemma":0.00012623878,"teacher_disagreement_score":0.8483173,"about_ca_system_score_codex":0.000074832285,"about_ca_system_score_gemma":0.00003631854,"threshold_uncertainty_score":0.52614754},"labels":[],"label_agreement":null},{"id":"W1990025926","doi":"10.1023/b:supe.0000014804.20789.21","title":"Run-Time Support for the Automatic Parallelization of Java Programs","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Thread (computing); Parallel computing; Java; Speedup; Compiler; Multiprocessing; Asynchronous communication; Pointer (user interface); Just-in-time compilation; Runtime system; Automatic parallelization; Java concurrency; Operating system; Real time Java","score_opus":0.021248956082100916,"score_gpt":0.26366312515750134,"score_spread":0.24241416907540042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990025926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04054628,0.00021229574,0.95721877,0.0013615028,0.00016747382,0.00028827714,3.3465088e-7,0.000103353486,0.00010169931],"genre_scores_gemma":[0.7061565,0.000035124558,0.2935136,0.00014311186,0.00011452822,0.0000017479887,0.0000010716825,0.000010078295,0.00002427376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854934,0.000107456086,0.00068312546,0.00010051408,0.00033718496,0.0002223823],"domain_scores_gemma":[0.998306,0.00043441897,0.0004986867,0.00032879628,0.00038757783,0.000044543318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023386355,0.00012280897,0.00023247515,0.000092592265,0.00027607215,0.00009066599,0.0013372747,0.00004526969,0.0000039676524],"category_scores_gemma":[0.00012176675,0.000068063884,0.00014885367,0.00034510778,0.00007793333,0.0002887203,0.00015224803,0.00015635925,0.000003405963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003131797,0.00028668795,0.00051308586,0.00009974925,0.00018344408,0.0000049123155,0.010624652,0.7946919,0.0014911813,0.011470614,0.0014979058,0.17910454],"study_design_scores_gemma":[0.00075999874,0.00056333415,0.0007920889,0.00022081974,0.000057598805,0.00025199563,0.00015047978,0.9880169,0.0026255453,0.0059772898,0.00043639936,0.00014756122],"about_ca_topic_score_codex":0.0000148319505,"about_ca_topic_score_gemma":6.7797083e-7,"teacher_disagreement_score":0.6656102,"about_ca_system_score_codex":0.00004146849,"about_ca_system_score_gemma":0.00015475969,"threshold_uncertainty_score":0.27755648},"labels":[],"label_agreement":null},{"id":"W199059760","doi":"10.1142/s0129626401000646","title":"ON THE NECESSITY OF FORMAL MODELS FOR REAL-TIME PARALLEL COMPUTATIONS","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Turing machine; Computer science; Computation; Universal Turing machine; Super-recursive algorithm; Model of computation; Time hierarchy theorem; Turing machine examples; Probabilistic Turing machine; Theoretical computer science; Hierarchy; NSPACE; Description number; Real number; Time complexity; Theory of computation; Formal proof; Turing; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.029055490845501485,"score_gpt":0.26925065723311803,"score_spread":0.24019516638761654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199059760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911268,0.000045487115,0.9769579,0.008326756,0.000053532392,0.0004073197,0.0000027091014,0.00047493464,0.0028200774],"genre_scores_gemma":[0.52094877,0.000027477074,0.47594947,0.002775956,0.00004617549,0.000079101745,0.000011265586,0.000018660292,0.00014312615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829376,0.00010103097,0.00042681518,0.00040754446,0.0003274145,0.0004434549],"domain_scores_gemma":[0.9985077,0.00043579045,0.00034385282,0.00046392958,0.00017718613,0.00007153333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006013756,0.00022291146,0.00026894844,0.0001415946,0.0005787816,0.00020055275,0.0011130436,0.000069367925,0.0000052648784],"category_scores_gemma":[0.00004857805,0.00017027711,0.0001295794,0.00044031622,0.00011890738,0.0007680392,0.00014469991,0.0001469545,0.000010396326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005558913,0.00010650027,0.000036554073,0.000044830056,0.000021453758,0.000002260767,0.00095166237,0.940899,0.00047505752,0.039805323,0.011129949,0.00647178],"study_design_scores_gemma":[0.00040630088,0.00007220868,0.00011268577,0.00007522333,0.0000091067595,0.000008446719,0.000012516647,0.9727761,0.00015428991,0.025978483,0.00018002978,0.00021459324],"about_ca_topic_score_codex":0.00002459275,"about_ca_topic_score_gemma":9.645258e-7,"teacher_disagreement_score":0.51003754,"about_ca_system_score_codex":0.000037344307,"about_ca_system_score_gemma":0.00007473966,"threshold_uncertainty_score":0.6943699},"labels":[],"label_agreement":null},{"id":"W1990697421","doi":"10.1109/fpt.2014.7082760","title":"Approaching overhead-free execution on FPGA soft-processors","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stratix; Computer science; Field-programmable gate array; Parallel computing; Overhead (engineering); Soft error; Register file; Microarchitecture; Computation; Reduction (mathematics); Embedded system; Control flow; Interleaving; Clock rate; Computer hardware; Instruction set; Chip; Engineering; Operating system","score_opus":0.016711986332360505,"score_gpt":0.24268503054935267,"score_spread":0.22597304421699216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990697421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009141532,0.000011996397,0.91218525,0.00070667564,0.000117054005,0.00007504328,1.92391e-7,0.0013579018,0.08463174],"genre_scores_gemma":[0.63958937,0.0000044411863,0.35827938,0.0012043596,0.00006809216,0.000008497445,0.000002119896,0.000008280805,0.0008354715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989193,0.00007453404,0.00016927604,0.0003627816,0.00025073183,0.00022334179],"domain_scores_gemma":[0.99900955,0.00008967927,0.00007487179,0.0007032542,0.0000529219,0.00006970734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046193358,0.00012508135,0.000118527,0.000115008756,0.00017655116,0.00016297102,0.0010079434,0.0000636966,0.000006900062],"category_scores_gemma":[0.00017383239,0.00010734745,0.000045158802,0.00025058418,0.000020238536,0.000280482,0.00024194858,0.00012951574,0.000045166522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009323352,0.00013662822,0.00013992371,0.00002435611,0.000009799795,0.0000011788686,0.00044320323,0.05886536,0.0000857166,0.77877617,0.029477227,0.13203111],"study_design_scores_gemma":[0.00021344429,0.000109305394,0.00020194294,0.000021621616,0.0000014825782,0.0000039034057,0.000005137961,0.9678698,0.0037473137,0.02411035,0.0035284783,0.00018718925],"about_ca_topic_score_codex":0.000017081251,"about_ca_topic_score_gemma":0.0000011707729,"teacher_disagreement_score":0.90900445,"about_ca_system_score_codex":0.000029299435,"about_ca_system_score_gemma":0.00002034092,"threshold_uncertainty_score":0.4377502},"labels":[],"label_agreement":null},{"id":"W1990801199","doi":"10.1145/2047849.2047858","title":"Bootstrapping a self-hosted research virtual machine for JavaScript","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Rich Internet application; Programming language; Bootstrapping (finance); Bytecode; Virtual machine; Operating system; Interpreter; Web application","score_opus":0.13475835214702112,"score_gpt":0.3369940386027534,"score_spread":0.20223568645573228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990801199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052552857,0.000055177185,0.9592434,0.00019574515,0.00012633897,0.00030429155,8.673638e-7,0.0017183876,0.03783024],"genre_scores_gemma":[0.3924037,0.00001404526,0.605518,0.00023281189,0.000035074107,0.00004365917,0.0000020471755,0.000009988292,0.0017406949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987298,0.000102770275,0.00020493948,0.00035561185,0.00024061672,0.0003662399],"domain_scores_gemma":[0.99901587,0.0001225055,0.000040229475,0.00045565286,0.00027539386,0.0000903492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010515795,0.0000997769,0.00011600251,0.00023315247,0.00024740206,0.00010707646,0.0009157567,0.00006443773,0.000024361118],"category_scores_gemma":[0.000067023844,0.000088173765,0.000056959838,0.00045864304,0.000033141012,0.0002550965,0.00027157058,0.00014723022,0.000027942666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004231388,0.0004916488,0.0004923857,0.000039393075,0.00008210662,0.000013134282,0.006241352,0.00034218776,0.00067361456,0.8746591,0.063374,0.053548772],"study_design_scores_gemma":[0.00036574082,0.00046643792,0.00021492064,0.000016622773,0.0000025564927,0.0000087439885,0.000034344208,0.9683173,0.009223045,0.010303485,0.010842609,0.00020425193],"about_ca_topic_score_codex":0.00008697735,"about_ca_topic_score_gemma":0.00000500683,"teacher_disagreement_score":0.9679751,"about_ca_system_score_codex":0.000029512426,"about_ca_system_score_gemma":0.000066713605,"threshold_uncertainty_score":0.3595622},"labels":[],"label_agreement":null},{"id":"W1990926296","doi":"10.1145/1774088.1774587","title":"Using surface effect measures to model parallel performance","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Overhead (engineering); Decomposition; Idle; Block (permutation group theory); Implementation; Set (abstract data type); Domain decomposition methods; Distributed computing; Mathematics; Operating system; Programming language; Engineering","score_opus":0.034727128863179045,"score_gpt":0.2896582519912016,"score_spread":0.2549311231280226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990926296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23789842,0.0000058300902,0.7558836,0.00013595178,0.00012479252,0.00012565212,1.4097208e-7,0.00061071204,0.005214941],"genre_scores_gemma":[0.49249253,0.0000017084249,0.50704306,0.000186106,0.000013248672,0.000002048602,1.6028554e-7,0.000004818921,0.00025633327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903363,0.000035128633,0.00014889013,0.00030403762,0.00022685954,0.00025144202],"domain_scores_gemma":[0.99920034,0.000040289233,0.000037584392,0.00051224296,0.000092333226,0.000117221316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050059345,0.00013270094,0.00013496666,0.00006910883,0.00016288258,0.00014094349,0.00075737346,0.0000639813,0.0000047634658],"category_scores_gemma":[0.00003685576,0.000110065106,0.00004026411,0.00027170026,0.000017350925,0.0002968642,0.00022695032,0.00016844545,0.00003652708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037951052,0.000011172831,0.00076305546,0.0000041596572,0.0000028339018,4.9856686e-7,0.000086789245,0.9797193,0.009822631,0.0048319716,0.0007026072,0.0040511824],"study_design_scores_gemma":[0.000093619936,0.000050798306,0.00014121969,0.000007231962,0.000001578982,0.0000070309407,3.7106767e-7,0.9835857,0.015419768,0.0003189341,0.00021169792,0.00016205868],"about_ca_topic_score_codex":0.000022647022,"about_ca_topic_score_gemma":0.000004926946,"teacher_disagreement_score":0.2545941,"about_ca_system_score_codex":0.000015014515,"about_ca_system_score_gemma":0.000050969982,"threshold_uncertainty_score":0.44883248},"labels":[],"label_agreement":null},{"id":"W1990962327","doi":"10.1145/2541228.2541231","title":"Optimizing GPU energy efficiency with 3D die-stacking graphics memory and reconfigurable memory interface","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Computer science; Dram; Graphics; Registered memory; Embedded system; Computer hardware; Parallel computing; Graphics processing unit; Non-volatile random-access memory; Memory architecture; Efficient energy use; Semiconductor memory; Computer architecture; Computer memory; Memory refresh; Operating system","score_opus":0.009686664645152675,"score_gpt":0.21922189023539854,"score_spread":0.20953522559024587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990962327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010967805,0.0004372818,0.99465,0.0012531366,0.000081189086,0.00026844663,0.0000037331736,0.0005039334,0.0017054967],"genre_scores_gemma":[0.33794236,0.00082042726,0.6602015,0.0005958084,0.000018148867,0.00006459688,0.0000062029976,0.00002972027,0.00032124098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846494,0.000116783944,0.00027949765,0.0006045215,0.00022046512,0.00031381354],"domain_scores_gemma":[0.99881417,0.00018033932,0.00013245826,0.00059304025,0.00014108306,0.00013893346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016105197,0.00028683097,0.00023524012,0.00037732784,0.0005545664,0.00035956365,0.0004562097,0.0001222125,0.000029816705],"category_scores_gemma":[0.000020292056,0.0002441393,0.000043212618,0.0004657813,0.000120877805,0.000494249,0.000024520501,0.00030249314,0.0000016655227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016347876,0.000044411492,0.000003158627,0.00001448419,0.000022476239,0.0000016409475,0.0010073966,0.87253034,0.00009345201,0.00014396363,0.000019740959,0.12610258],"study_design_scores_gemma":[0.00048411766,0.00031017067,0.000015924992,0.00011711164,0.000024407973,0.0000626341,0.00008949497,0.99089843,0.0064178533,0.0008741725,0.00033148425,0.0003741968],"about_ca_topic_score_codex":0.000101680635,"about_ca_topic_score_gemma":0.000048409893,"teacher_disagreement_score":0.3368456,"about_ca_system_score_codex":0.000024818906,"about_ca_system_score_gemma":0.000040846688,"threshold_uncertainty_score":0.99557114},"labels":[],"label_agreement":null},{"id":"W1991357793","doi":"10.1145/1531793.1531803","title":"Enhancing operating system support for multicore processors by using hardware performance monitoring","year":2009,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Embedded system; Parallel computing; Cache coherence; Operating system; Performance improvement; Partition (number theory); Cache algorithms; CPU cache","score_opus":0.037296928558063436,"score_gpt":0.31606454697745173,"score_spread":0.2787676184193883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991357793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013163415,0.041332997,0.9393537,0.00022330516,0.00084672484,0.0030774088,0.000009092268,0.0016240986,0.00036927295],"genre_scores_gemma":[0.6538562,0.0013742172,0.34363312,0.00026451168,0.00030499243,0.00025222613,0.000019017645,0.00004321892,0.00025246854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652797,0.00021729234,0.0013411439,0.0008193522,0.00045708532,0.000637146],"domain_scores_gemma":[0.9974024,0.00017308467,0.0005453573,0.0010789126,0.0006439147,0.00015632123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001902494,0.00044008272,0.00086250977,0.00009527851,0.0009476612,0.00076236227,0.0016614344,0.00012838698,0.0000012762407],"category_scores_gemma":[0.0007895183,0.00039212874,0.00013607666,0.00055551674,0.000016660573,0.0010344401,0.00022944559,0.00024378712,0.000009924918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020284055,0.0006781659,0.0093946615,0.18101771,0.00042668646,0.00010243728,0.008224589,0.3379864,0.14095172,0.004788708,0.015878,0.3005306],"study_design_scores_gemma":[0.00035358372,0.00030980597,0.000016040525,0.038421948,0.000047486665,0.00015415829,0.00014560555,0.9387607,0.019405138,0.000001964055,0.0016116091,0.0007719588],"about_ca_topic_score_codex":0.00002937102,"about_ca_topic_score_gemma":2.0225504e-7,"teacher_disagreement_score":0.64069283,"about_ca_system_score_codex":0.00024442963,"about_ca_system_score_gemma":0.00019280009,"threshold_uncertainty_score":0.9998531},"labels":[],"label_agreement":null},{"id":"W1991592471","doi":"10.1007/s10766-014-0320-y","title":"pocl: A Performance-Portable OpenCL Implementation","year":2014,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Perimeter Institute","funders":"","keywords":"Software portability; Compiler; Porting; SIMD; Kernel (algebra); Data parallelism; Parallelism (grammar); Exploit; Stencil","score_opus":0.016002559263521565,"score_gpt":0.3110218934464314,"score_spread":0.2950193341829098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991592471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02007829,0.000047413116,0.9768229,0.00085718295,0.0006725403,0.00009214393,1.8766775e-7,0.000096287746,0.0013330553],"genre_scores_gemma":[0.5700089,0.000037489186,0.429519,0.0001793017,0.00017888365,0.000004345877,0.0000027711787,0.0000056592007,0.00006369633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843746,0.0000605942,0.0005721748,0.00015636985,0.0005712791,0.00020210531],"domain_scores_gemma":[0.9985302,0.00004293751,0.00057745015,0.00016313199,0.00060337165,0.00008289561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093487155,0.00011221386,0.0001589946,0.00024688535,0.000086097716,0.00036056712,0.0013330288,0.000037209094,0.000030738367],"category_scores_gemma":[0.000052933887,0.00010015638,0.000097594144,0.00016395189,0.00002177931,0.00096329354,0.00017040195,0.00015153707,0.000016282029],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002134831,0.00008551946,0.007355275,0.000006784499,0.00008255931,0.000017467379,0.00042040448,0.011426399,0.0000878421,0.012515245,0.0013640905,0.96661705],"study_design_scores_gemma":[0.0040087206,0.0014656883,0.011458082,0.00027153784,0.00003902355,0.0010506015,0.00021408297,0.53080684,0.004888523,0.007821762,0.43717006,0.0008050894],"about_ca_topic_score_codex":0.000018255569,"about_ca_topic_score_gemma":0.000002371691,"teacher_disagreement_score":0.96581197,"about_ca_system_score_codex":0.00006655973,"about_ca_system_score_gemma":0.00008354528,"threshold_uncertainty_score":0.40842584},"labels":[],"label_agreement":null},{"id":"W1991707635","doi":"10.1145/1088149.1088167","title":"Lightweight reference affinity analysis","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Profiling (computer programming); Parallel computing; Programming language; Spec#; Optimizing compiler; Locality; Static analysis; Fortran; Call graph; Operating system","score_opus":0.022810999599931884,"score_gpt":0.26942591249196124,"score_spread":0.24661491289202936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991707635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772608,0.000032111795,0.88708574,0.0011398584,0.00001903126,0.000027960148,2.5985364e-7,0.0009142211,0.10920354],"genre_scores_gemma":[0.5288489,0.000013465772,0.4690987,0.00038283068,0.000020203022,0.000001944626,0.0000015121607,0.0000014030526,0.0016310358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992549,0.000039015176,0.0001546079,0.0002557179,0.00014553033,0.00015025177],"domain_scores_gemma":[0.99928474,0.000039415376,0.000048974038,0.0004897835,0.00007373634,0.000063366446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017769652,0.00007806987,0.00012019935,0.00020299375,0.00008921047,0.00011318728,0.00068922836,0.00004219154,0.00011896967],"category_scores_gemma":[0.000014149248,0.00006382011,0.00006435489,0.0010390115,0.000012482462,0.0002818619,0.00015928262,0.00007219739,0.00015081384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003894008,0.0002613264,0.0047341287,0.0000044213166,0.00027913324,0.0000058714218,0.00052561477,0.058860123,0.00020633497,0.8049912,0.030173533,0.09995442],"study_design_scores_gemma":[0.0000869684,0.000021093301,0.0037753347,0.000002173915,0.000027259222,0.0000016518409,0.0000018132649,0.9417343,0.009047601,0.001208185,0.043872494,0.00022109496],"about_ca_topic_score_codex":0.000016478602,"about_ca_topic_score_gemma":0.000023034656,"teacher_disagreement_score":0.8828742,"about_ca_system_score_codex":0.000020042644,"about_ca_system_score_gemma":0.00002153443,"threshold_uncertainty_score":0.26025084},"labels":[],"label_agreement":null},{"id":"W1992072862","doi":"10.5555/2663638.2663640","title":"A redefinition of roles and collaboration under model-driven development","year":2012,"lang":"en","type":"article","venue":"Cooperative and Human Aspects of Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Graphene; Quasiparticle; Angstrom; Electron; Scattering; Physics; Graphite; Dirac equation; Effective mass (spring–mass system); Schrödinger equation; Charge carrier; Condensed matter physics; Nanotechnology; Materials science; Quantum mechanics; Chemistry","score_opus":0.01744475857771006,"score_gpt":0.24386235311710222,"score_spread":0.22641759453939217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992072862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12322379,0.00032454322,0.87609345,0.000012735186,0.000014646802,0.00006343274,0.0000010411072,0.00009274893,0.00017358984],"genre_scores_gemma":[0.7151631,0.000017486649,0.2847868,0.000008017898,0.000008072459,0.000003928784,0.0000029550865,0.0000037271966,0.0000058752244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995724,0.000010265609,0.0001503937,0.00010305537,0.000075564814,0.00008834224],"domain_scores_gemma":[0.99968415,0.000030749838,0.000055743214,0.00007812097,0.000113275535,0.000037956368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008677487,0.00007860615,0.00012067759,0.00008901273,0.000073063406,0.0000282245,0.000068000605,0.000030667234,0.0000011962095],"category_scores_gemma":[0.00002668595,0.00007743028,0.000008072169,0.000108390006,0.000023925028,0.00024940408,0.00006946455,0.000040991326,1.75845e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028148506,0.00006152566,0.0010201134,0.00008937838,0.000032965065,3.7549424e-7,0.0070852446,0.28925982,0.00936513,0.69169116,0.000042588123,0.0013488883],"study_design_scores_gemma":[0.00075160444,0.00025422455,0.023393214,0.00034969978,0.000018982942,0.000009306917,0.00020129378,0.7367076,0.23537058,0.0021978414,0.00014039357,0.00060521753],"about_ca_topic_score_codex":0.0000010071528,"about_ca_topic_score_gemma":0.0000018258789,"teacher_disagreement_score":0.6894933,"about_ca_system_score_codex":0.000015158686,"about_ca_system_score_gemma":0.000028840683,"threshold_uncertainty_score":0.31575155},"labels":[],"label_agreement":null},{"id":"W1992491248","doi":"10.1109/fpl.2012.6339185","title":"Polyblaze: From one to many bringing the microblaze into the multicore era with Linux SMP support","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx","keywords":"MicroBlaze; Multi-core processor; Scalability; Computer science; Field-programmable gate array; Embedded system; Operating system; Software; Computer architecture","score_opus":0.014458458733858046,"score_gpt":0.2405763814613359,"score_spread":0.22611792272747785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992491248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03882104,0.0001076852,0.9499465,0.0067192554,0.0001310377,0.0002565637,7.569966e-7,0.0005337981,0.003483315],"genre_scores_gemma":[0.6282683,0.000005776102,0.36747372,0.0030919649,0.00011657759,0.000014183147,0.0000017219395,0.0000104631745,0.0010172852],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882054,0.00006854104,0.00019732722,0.00028935392,0.0002365972,0.000387634],"domain_scores_gemma":[0.998733,0.0001538641,0.00007320942,0.0008430511,0.00007325453,0.00012363768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041165002,0.00015870685,0.00013390889,0.000057687394,0.00031902202,0.0002569902,0.0012863921,0.000044088716,0.00004995997],"category_scores_gemma":[0.000023612605,0.00008397884,0.000044142915,0.00034680506,0.0000528157,0.0002519009,0.0005302955,0.00019945447,0.0001189685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014980645,0.0012574992,0.04151536,0.0000484315,0.0005920084,0.000038119084,0.17099546,0.030311732,0.018210169,0.11635512,0.10228592,0.5182404],"study_design_scores_gemma":[0.0014687793,0.0005896583,0.09491963,0.00027924142,0.0000999348,0.000119109005,0.0010141964,0.65356356,0.15079416,0.0028118028,0.09218868,0.0021512667],"about_ca_topic_score_codex":0.00082499994,"about_ca_topic_score_gemma":0.000045788922,"teacher_disagreement_score":0.6232518,"about_ca_system_score_codex":0.000035704066,"about_ca_system_score_gemma":0.000042985394,"threshold_uncertainty_score":0.34245577},"labels":[],"label_agreement":null},{"id":"W1993079359","doi":"10.1021/jp9051215","title":"Performance Optimization of Tensor Contraction Expressions for Many-Body Methods in Quantum Chemistry","year":2009,"lang":"en","type":"article","venue":"The Journal of Physical Chemistry A","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tensor contraction; Contraction (grammar); Computer science; Tensor (intrinsic definition); Cartesian tensor; Associative property; Computation; Theoretical computer science; Algorithm; Algebra over a field; Mathematics; Tensor product; Pure mathematics; Tensor density; Mathematical analysis; Tensor field; Exact solutions in general relativity","score_opus":0.018071011665248365,"score_gpt":0.3311211006295135,"score_spread":0.3130500889642651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993079359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047994692,0.00003407132,0.9510485,0.00030514185,0.000014101227,0.00006549797,7.364557e-7,0.000025500196,0.0005117872],"genre_scores_gemma":[0.8702586,0.000022103393,0.12953077,0.000030500754,0.00011041239,0.0000020397902,9.3946886e-7,0.000003918561,0.0000407194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921566,0.000057775207,0.00035053154,0.000094826406,0.00015924382,0.00012194505],"domain_scores_gemma":[0.9987825,0.00026672467,0.00047436162,0.0002172488,0.0002154013,0.000043735883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613586,0.00009514118,0.00021912722,0.000021013462,0.000059612772,0.000018384097,0.0005259996,0.000051988627,0.000003036046],"category_scores_gemma":[0.00015600998,0.0000668552,0.00009467492,0.00018776672,0.000033314573,0.00021300379,0.00003342415,0.00021120957,1.1395983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004501164,0.00012705753,0.0000028469838,0.00002519654,0.0000052751075,3.406571e-7,0.000109607805,0.50823456,0.4902443,0.000092683316,0.00006241011,0.0010507368],"study_design_scores_gemma":[0.00020108614,0.000054992837,0.000068331814,0.00006117334,0.000007799147,0.000013437431,0.000010904663,0.5825583,0.41656446,0.00039631824,0.0000195692,0.000043619097],"about_ca_topic_score_codex":5.519515e-7,"about_ca_topic_score_gemma":1.8505971e-9,"teacher_disagreement_score":0.8222639,"about_ca_system_score_codex":0.000030912073,"about_ca_system_score_gemma":0.000049530943,"threshold_uncertainty_score":0.2726276},"labels":[],"label_agreement":null},{"id":"W1994089185","doi":"10.1109/fpt.2013.6718409","title":"Efficient methods for out-of-order load/store execution for high-performance soft processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queue; Stratix; Message queue; Overhead (engineering); Parallel computing; Field-programmable gate array; Out-of-order execution; Embedded system; Operating system; Computer network","score_opus":0.023526516304920593,"score_gpt":0.3200641794049805,"score_spread":0.2965376631000599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994089185","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009488525,0.00005313883,0.98797596,0.0003190052,0.00028277675,0.00093587703,9.832039e-7,0.0004400224,0.0005036976],"genre_scores_gemma":[0.20584872,0.0000034557193,0.792922,0.00013300206,0.000023759196,0.00028256976,0.00000292895,0.000008797367,0.0007747596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989611,0.00003204194,0.00029575938,0.00031584935,0.0001438451,0.0002513872],"domain_scores_gemma":[0.9984018,0.00019845167,0.00015984349,0.00031120563,0.00087952847,0.000049156883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006278697,0.00012989367,0.00018576976,0.0000843524,0.00013220643,0.00006490795,0.0005186957,0.000075402284,0.0000069222538],"category_scores_gemma":[0.00016579819,0.0001060206,0.00005215952,0.00025039716,0.00003441781,0.00016633763,0.000094282565,0.000045865905,0.0000067400097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041740685,0.0003450077,0.000118477656,0.000517173,0.0000496875,6.993617e-8,0.0018102587,0.44053176,0.0038663521,0.064752236,0.01498134,0.4729859],"study_design_scores_gemma":[0.0002744978,0.00015443805,0.00008978303,0.00002119683,0.0000046293476,4.2423758e-7,0.0000072964513,0.95044076,0.044756383,0.002695757,0.0014075815,0.00014725355],"about_ca_topic_score_codex":0.000019917326,"about_ca_topic_score_gemma":5.575835e-7,"teacher_disagreement_score":0.509909,"about_ca_system_score_codex":0.00004609843,"about_ca_system_score_gemma":0.00010761311,"threshold_uncertainty_score":0.43233943},"labels":[],"label_agreement":null},{"id":"W1994164933","doi":"10.1142/s0129626405002350","title":"A Genetic Algorithm for Energy Aware Task Scheduling in Heterogeneous Systems","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Genetic algorithm; Algorithm; Simulated annealing; Parallel computing; Distributed computing; Real-time computing; Mathematical optimization; Mathematics; Engineering","score_opus":0.013487425533249298,"score_gpt":0.24661113962341505,"score_spread":0.23312371409016575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994164933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00224722,0.001904149,0.9936564,0.001245947,0.00013819392,0.00021832404,0.0000015634076,0.0005474805,0.000040733823],"genre_scores_gemma":[0.3589839,0.000024092766,0.63892645,0.001686751,0.0001846305,0.00013003085,0.000004203212,0.000021630047,0.000038305723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813515,0.000071996954,0.0004519471,0.0005907413,0.0002345187,0.00051565736],"domain_scores_gemma":[0.99923944,0.000057096022,0.00018890787,0.00033631656,0.00008636542,0.00009187083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002292012,0.00023960613,0.0002684384,0.0002525895,0.00020002377,0.0004056258,0.00077898556,0.00009335118,7.411558e-7],"category_scores_gemma":[0.000010441194,0.00024783215,0.000077527744,0.00035249905,0.000038454564,0.00035387877,0.00011309906,0.00011980155,0.000005334908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029662865,0.000035414192,0.000043365435,0.000036540285,0.000007214525,0.000009994769,0.00023216674,0.80752933,0.00017291255,0.0000703578,0.00037300523,0.19148675],"study_design_scores_gemma":[0.00043266144,0.000028800587,0.000022826882,0.000109596534,0.000004184764,0.000051034953,0.0000073346696,0.9954214,0.00024948778,0.000100338046,0.0032605953,0.0003117536],"about_ca_topic_score_codex":0.000054375247,"about_ca_topic_score_gemma":0.00000471606,"teacher_disagreement_score":0.35673666,"about_ca_system_score_codex":0.000113459435,"about_ca_system_score_gemma":0.00007373724,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W1994287190","doi":"10.1109/fpt.2013.6718343","title":"Bitwidth-optimized hardware accelerators with software fallback","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Software; Hardware acceleration; Datapath; Profiling (computer programming); Computer hardware; Embedded system; Computer architecture; Operating system","score_opus":0.0127770392290973,"score_gpt":0.22362651900991862,"score_spread":0.2108494797808213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994287190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002266924,0.000032135376,0.9860385,0.0007490604,0.000074364776,0.00029130426,4.5770497e-7,0.0024996921,0.008047566],"genre_scores_gemma":[0.06407585,0.00001221042,0.9318907,0.0012073517,0.000028038956,0.00005635778,0.000003705486,0.000016081009,0.0027096602],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987486,0.0000495696,0.00020996771,0.00042211634,0.00025129796,0.00031847126],"domain_scores_gemma":[0.9988102,0.000065432614,0.00008328604,0.00063667865,0.00026233165,0.00014210737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010410473,0.00019165991,0.00019744798,0.00011918583,0.00015408818,0.0004982745,0.0009377862,0.000071099545,0.0002940567],"category_scores_gemma":[0.000029069533,0.00013623852,0.00005160583,0.00045857514,0.000038884784,0.00080544135,0.00024084414,0.0001256802,0.0003440735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052630705,0.0006242828,0.019639557,0.0001011338,0.00026860475,0.00006833257,0.0019725852,0.11349766,0.00035103693,0.049416833,0.59687537,0.21713199],"study_design_scores_gemma":[0.0029826371,0.0006709048,0.006220266,0.00013772503,0.000018766685,0.00008642791,0.00008506424,0.9471215,0.013713278,0.006812092,0.02009396,0.002057376],"about_ca_topic_score_codex":0.00008293755,"about_ca_topic_score_gemma":0.0000026080288,"teacher_disagreement_score":0.8336238,"about_ca_system_score_codex":0.00002600101,"about_ca_system_score_gemma":0.00006724367,"threshold_uncertainty_score":0.5555646},"labels":[],"label_agreement":null},{"id":"W1994805819","doi":"10.1145/1621960.1621964","title":"Temperature reduction analysis in Sentry Tag cache systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cache; Reduction (mathematics); Computer science; Processor design; Cost reduction; Embedded system; Power management; Thermal management of electronic devices and systems; Power (physics); Operating system; Engineering; Mechanical engineering","score_opus":0.008431627701438071,"score_gpt":0.2463295000009144,"score_spread":0.23789787229947632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994805819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026063519,0.00018267725,0.96548843,0.0010389118,0.00015079703,0.00010491495,2.5354402e-7,0.00066088967,0.0063095978],"genre_scores_gemma":[0.94439375,0.000014670798,0.054205947,0.00013244171,0.000040338546,0.0000023270964,0.0000040453197,0.0000016679816,0.0012047935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992161,0.000074231604,0.00018148457,0.00025579272,0.00013337897,0.00013901324],"domain_scores_gemma":[0.9995232,0.000010195688,0.00004845607,0.0003277633,0.000052350846,0.000038009035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022569558,0.00007895249,0.00014183219,0.000333885,0.0000508441,0.0001708286,0.0002978404,0.000073357616,0.0000035537203],"category_scores_gemma":[0.000009400099,0.000067775596,0.000051067247,0.001723458,0.0000064126143,0.00021107255,0.000028166574,0.00010568215,0.000005183484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004520179,0.00015740175,0.002048811,0.000007685363,0.000072844734,0.000018705676,0.0006653495,0.9109379,0.002199781,0.064226754,0.014006198,0.005654069],"study_design_scores_gemma":[0.00009680701,0.000030715873,0.0051068584,0.000011082746,0.000012341721,0.000014894719,0.000033785112,0.99225307,0.001571805,0.00047779674,0.0002443124,0.00014653342],"about_ca_topic_score_codex":0.00008659973,"about_ca_topic_score_gemma":0.000003742202,"teacher_disagreement_score":0.91833025,"about_ca_system_score_codex":0.000041042058,"about_ca_system_score_gemma":0.000020601268,"threshold_uncertainty_score":0.27638087},"labels":[],"label_agreement":null},{"id":"W1994845850","doi":"10.1145/1967677.1967692","title":"Lowering overhead in sampling-based execution monitoring and tracing","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Debugging; Computer science; Tracing; Algorithmic program debugging; Overhead (engineering); Embedded system; Software; Resource (disambiguation); Distributed computing; Real-time computing; Operating system; Computer network","score_opus":0.05549946211678855,"score_gpt":0.28235870627360515,"score_spread":0.2268592441568166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994845850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09350348,0.00004937932,0.9028322,0.000022282222,0.0000833983,0.00004707201,4.251799e-8,0.00035102156,0.0031110942],"genre_scores_gemma":[0.65161085,0.000005449302,0.34834072,0.000015592137,0.000008946542,0.0000025892728,9.359039e-8,0.0000024968253,0.000013294131],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994428,0.000015039787,0.00013343486,0.00019713551,0.000072860064,0.0001387233],"domain_scores_gemma":[0.9997257,0.000030728912,0.000031641237,0.00015630286,0.00002010997,0.000035529967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019868393,0.0000682936,0.00007330819,0.00012374666,0.000051996158,0.00005246456,0.0001665258,0.000035422418,0.0000026577702],"category_scores_gemma":[0.000016040818,0.000068432746,0.0000142282315,0.00017535868,0.000011172677,0.00023824314,0.00006299174,0.000068864894,0.0000014692421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000895864,0.00074191316,0.42859334,0.00022761119,0.000031750056,0.00009440378,0.018779054,0.12774643,0.0120755555,0.06173995,0.00018159457,0.3496988],"study_design_scores_gemma":[0.00039950106,0.00008739341,0.07701927,0.00018160956,0.0000017334542,0.0000070786546,0.0000392281,0.8129331,0.10622887,0.00275322,0.0000409665,0.00030806148],"about_ca_topic_score_codex":0.000103886894,"about_ca_topic_score_gemma":0.0000035331166,"teacher_disagreement_score":0.6851866,"about_ca_system_score_codex":0.000023596247,"about_ca_system_score_gemma":0.0000142903045,"threshold_uncertainty_score":0.27906063},"labels":[],"label_agreement":null},{"id":"W1995264632","doi":"10.1145/2818950.2818969","title":"S-L1","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Cache algorithms; Parallel computing; Cache invalidation; Smart Cache; Cache coloring; Cache pollution; Page cache; Operating system; General-purpose computing on graphics processing units; Software; CPU cache; Embedded system; Graphics","score_opus":0.04103998527171193,"score_gpt":0.2770128450005798,"score_spread":0.2359728597288679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995264632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013267006,0.000018345409,0.83571976,0.00056862435,0.00007152908,0.000015906087,1.5228544e-8,0.00076074473,0.1627124],"genre_scores_gemma":[0.22444452,0.0000013063352,0.77241886,0.00058819464,0.000017906521,0.0000012904082,2.035896e-7,0.0000014330147,0.002526301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996994,0.000013539579,0.000049900864,0.000088861445,0.00008085716,0.00006741123],"domain_scores_gemma":[0.99967897,0.000008106217,0.000012089172,0.0001920168,0.000049923117,0.000058876245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012975287,0.000028594222,0.000031632793,0.000028634324,0.00001737516,0.00005147861,0.00032454776,0.000013574716,0.0000039428946],"category_scores_gemma":[0.000019519695,0.000023422022,0.000010344257,0.00012579098,0.0000056838826,0.00013047327,0.0000997039,0.000021415022,0.00009996892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5243263e-7,0.000029680938,0.00040339434,9.063061e-7,0.0000028401766,0.000004711443,0.0003429547,0.003575204,0.000015882772,0.7181583,0.24798082,0.029484374],"study_design_scores_gemma":[0.00017356055,0.000058389654,0.00015283769,0.0000025414731,4.6630677e-7,0.000013190574,0.000008535975,0.88334763,0.0028292174,0.037031453,0.07624816,0.0001340425],"about_ca_topic_score_codex":0.0000071571217,"about_ca_topic_score_gemma":2.783251e-7,"teacher_disagreement_score":0.8797724,"about_ca_system_score_codex":0.0000082859315,"about_ca_system_score_gemma":0.000026578875,"threshold_uncertainty_score":0.12849316},"labels":[],"label_agreement":null},{"id":"W1995348478","doi":"10.1145/1117201.1117231","title":"Application-specific customization of soft processor microarchitecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Microarchitecture; Computer science; Pipeline (software); Benchmark (surveying); Field-programmable gate array; Processor design; Embedded system; Computer architecture; Software; Microprocessor; Instruction set; Personalization; Parallel computing; Operating system","score_opus":0.005113668899747408,"score_gpt":0.2132090757372074,"score_spread":0.20809540683746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995348478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000690246,0.00012661477,0.9912952,0.00031562382,0.000023955774,0.00014794964,6.2966586e-7,0.00050742744,0.0068923384],"genre_scores_gemma":[0.5646318,0.0000054754087,0.43484393,0.000060556307,0.000031729956,0.000012100398,0.000007203833,0.0000047942053,0.00040242047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993137,0.000019607318,0.00021106491,0.00021918213,0.00012929294,0.00010716949],"domain_scores_gemma":[0.9993863,0.00003047638,0.0001140568,0.0003051851,0.00014526036,0.00001871227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008113961,0.00007667261,0.00009400161,0.00010470567,0.000056918438,0.000041184012,0.0004562449,0.000045056047,0.0000058840214],"category_scores_gemma":[0.000005360335,0.000067297005,0.0000307454,0.00044595188,0.000029394374,0.00010678501,0.00006491114,0.000047378984,0.000010888661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001445225,0.00038627538,0.0023136686,0.00008160254,0.000012302086,0.0000011300448,0.00041948725,0.4196753,0.026572999,0.3281008,0.06756696,0.15485506],"study_design_scores_gemma":[0.00029645493,0.000034503097,0.002035995,0.000015300937,0.0000022979586,0.000008693121,0.000004236706,0.85099715,0.09752576,0.012466247,0.036361616,0.00025173466],"about_ca_topic_score_codex":0.000025730285,"about_ca_topic_score_gemma":0.0000023868952,"teacher_disagreement_score":0.56394154,"about_ca_system_score_codex":0.000011932026,"about_ca_system_score_gemma":0.000025126086,"threshold_uncertainty_score":0.27442923},"labels":[],"label_agreement":null},{"id":"W1996451519","doi":"10.1007/s10586-011-0188-1","title":"Energy cost evaluation of parallel algorithms for multiprocessor systems","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Parallel computing; Scalability; Energy consumption; Multiprocessing; CUDA; Matrix multiplication; Computation; Scheduling (production processes); Algorithm; Operating system","score_opus":0.10519926558241342,"score_gpt":0.31863618000184163,"score_spread":0.2134369144194282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996451519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012249332,0.00043291823,0.9954,0.000029455163,0.0005218187,0.0005839752,0.0000019691379,0.00034030946,0.0014646003],"genre_scores_gemma":[0.59020853,0.0000032955045,0.4095311,0.00006166056,0.000073577794,0.000048881135,0.000005850514,0.000011404263,0.00005570626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819636,0.00018615801,0.00051565986,0.0004161196,0.0003904371,0.00029523656],"domain_scores_gemma":[0.998002,0.00017727425,0.00040062817,0.00043723715,0.0009136452,0.00006921976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015968049,0.00016789942,0.00026217362,0.00016084523,0.00015683306,0.000074493844,0.00077552494,0.000091175694,0.0000021468488],"category_scores_gemma":[0.000091694834,0.00016318046,0.00008781497,0.0002856155,0.000037594775,0.00022720738,0.0002586889,0.00006527538,0.0000026757828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004358674,0.00032549808,0.00055237196,0.00022099142,0.00010648037,0.0000017636187,0.0056030042,0.5012004,0.00009731082,0.045100052,0.0024843847,0.4442642],"study_design_scores_gemma":[0.00086287543,0.00007770937,0.00013471792,0.00008579824,0.000019016172,0.00000890889,0.000038805378,0.99553126,0.0009602969,0.0016736276,0.0004168811,0.00019011977],"about_ca_topic_score_codex":0.000059706195,"about_ca_topic_score_gemma":0.0000015072701,"teacher_disagreement_score":0.5889836,"about_ca_system_score_codex":0.00005650003,"about_ca_system_score_gemma":0.00009708768,"threshold_uncertainty_score":0.6654306},"labels":[],"label_agreement":null},{"id":"W1997051250","doi":"10.1007/s10586-011-0165-8","title":"Exploiting application buffer reuse to improve MPI small message transfer protocols over RDMA-enabled networks","year":2011,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remote direct memory access; InfiniBand; Computer science; Communication source; Message passing; Computer network; Transfer (computing); Protocol (science); Latency (audio); Reuse; Message queue; Operating system; Distributed computing; Telecommunications","score_opus":0.033918410432737106,"score_gpt":0.2669658850689768,"score_spread":0.23304747463623968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997051250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013643004,0.000018234003,0.9745017,0.00016979754,0.00020090956,0.007009774,8.3320595e-7,0.001536243,0.002919466],"genre_scores_gemma":[0.5967961,0.0000013985581,0.39972863,0.0015806577,0.0002569723,0.0014407593,0.000004411291,0.00004817938,0.00014287891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970495,0.00021580386,0.0007224066,0.0009981766,0.00027717304,0.000736912],"domain_scores_gemma":[0.9976344,0.00015445371,0.00017930426,0.0015651082,0.00022623906,0.00024050084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010600555,0.00037329004,0.00038579266,0.00021189098,0.0003845766,0.000334773,0.002208202,0.00018571515,0.000012312875],"category_scores_gemma":[0.00008700582,0.00037142597,0.00013734815,0.00069402216,0.000036327903,0.0004042094,0.0012560559,0.00037603197,0.0000377967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039220008,0.0013679148,0.009384592,0.00061254384,0.00027228726,0.00008656366,0.044328798,0.43345225,0.0075438083,0.035425454,0.009883238,0.45725036],"study_design_scores_gemma":[0.00068119,0.00015971101,0.0010869992,0.0001961879,0.00000942513,0.000010471946,0.000024678904,0.990666,0.004707831,0.0008939435,0.0010376753,0.00052591343],"about_ca_topic_score_codex":0.000052643427,"about_ca_topic_score_gemma":0.0000048365937,"teacher_disagreement_score":0.5831531,"about_ca_system_score_codex":0.00009430362,"about_ca_system_score_gemma":0.00005313489,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W1997096491","doi":"10.1145/2048066.2048077","title":"Kind analysis for MATLAB","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Scripting language; Identifier; MATLAB; Compiler; Syntax; Language primitive; High-level programming language; Artificial intelligence; Programming paradigm","score_opus":0.05031425843389694,"score_gpt":0.26753573465989655,"score_spread":0.2172214762259996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997096491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031556998,0.000008629759,0.9709996,0.00007402932,0.000033831322,0.00006054974,3.0736314e-7,0.00046086818,0.028046602],"genre_scores_gemma":[0.31258833,0.0000014221032,0.68627656,0.00016824588,0.000006513173,0.0000070979913,9.3727425e-7,0.0000015779169,0.0009493559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995823,0.000011032793,0.000093104594,0.00015882151,0.00005289543,0.0001018706],"domain_scores_gemma":[0.99958533,0.000022536708,0.000032344844,0.00027118035,0.000057941295,0.00003068984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012806132,0.00004559488,0.00007896709,0.00013533427,0.000048476257,0.00003987104,0.00040680502,0.000023194123,0.000036696354],"category_scores_gemma":[0.000009109199,0.000037992657,0.000074387535,0.0004640117,0.000007684442,0.000107162356,0.00006541448,0.00001730936,0.000011501286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007998878,0.00014055638,0.0074694823,0.000008726422,0.00034657598,0.0000026290459,0.0014405434,0.0029006314,0.000051289506,0.94564277,0.014799439,0.027189381],"study_design_scores_gemma":[0.00011239692,0.000057435078,0.00449799,0.0000014368426,0.00003453655,0.0000010770832,0.000005484478,0.96922565,0.00765913,0.015130953,0.0031239563,0.00014995712],"about_ca_topic_score_codex":0.000025899637,"about_ca_topic_score_gemma":0.0000032521714,"teacher_disagreement_score":0.96632504,"about_ca_system_score_codex":0.0000051687653,"about_ca_system_score_gemma":0.000009216586,"threshold_uncertainty_score":0.15492956},"labels":[],"label_agreement":null},{"id":"W1997758669","doi":"10.5555/2485288.2485384","title":"Using synchronization stalls in power-aware accelerators","year":2013,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Register file; Power gating; Computer science; Idle; sync; Synchronization (alternating current); Leakage (economics); Embedded system; Efficient energy use; Power (physics); Operating system; Computer hardware; Parallel computing; Computer network; Instruction set; Engineering; Electrical engineering; Voltage; Channel (broadcasting)","score_opus":0.02726879970112108,"score_gpt":0.2574287279204236,"score_spread":0.2301599282193025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997758669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050691884,0.00007181451,0.9480854,0.00009319849,0.00005544043,0.00029663942,4.900898e-7,0.0003760411,0.00032904334],"genre_scores_gemma":[0.84918725,0.000042303018,0.15058231,0.00012508189,0.000009382639,0.000009831602,0.000003289981,0.000011173037,0.000029348443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892247,0.00016989348,0.00031222028,0.0002764193,0.00013140905,0.00018758865],"domain_scores_gemma":[0.9992447,0.00018828112,0.00010451934,0.00021306577,0.00020232951,0.000047123263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031452536,0.00012472039,0.00012782363,0.00028952118,0.000088967994,0.0003004129,0.00027015482,0.000053146265,0.000016697484],"category_scores_gemma":[0.0002265452,0.00012468403,0.000009450731,0.0011081526,0.000024808644,0.00086716766,0.00008381764,0.00008151119,0.000016437642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075883167,0.0010458352,0.34211925,0.00018956907,0.000025065148,0.00009616873,0.010653438,0.52441096,0.005394774,0.023929127,0.0046107243,0.0875175],"study_design_scores_gemma":[0.00018030999,0.000045640423,0.0498746,0.000054250057,8.213669e-7,0.000008045137,0.000008338725,0.9484774,0.00045944043,0.0006809951,0.000061119754,0.00014903561],"about_ca_topic_score_codex":0.00007387913,"about_ca_topic_score_gemma":0.0000031584048,"teacher_disagreement_score":0.7984954,"about_ca_system_score_codex":0.000049411043,"about_ca_system_score_gemma":0.00008709401,"threshold_uncertainty_score":0.5084467},"labels":[],"label_agreement":null},{"id":"W1997857295","doi":"10.1145/2742854.2742883","title":"Genesis","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Qualcomm","keywords":"Computer science; Preprocessor; Language model; Code (set theory); Artificial intelligence; Component (thermodynamics); Natural language processing; Range (aeronautics); Machine learning; Programming language; Set (abstract data type)","score_opus":0.04207017513109721,"score_gpt":0.27385460181807214,"score_spread":0.23178442668697494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997857295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003951074,0.00004103683,0.924725,0.00046831538,0.00006929416,0.000016957318,1.9155157e-8,0.00078367593,0.07350059],"genre_scores_gemma":[0.17939089,0.0000025610036,0.81857854,0.00047684176,0.000017510874,0.0000015885308,1.7666248e-7,0.0000015528276,0.001530306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996988,0.000014485629,0.000049819646,0.00009136741,0.000079765145,0.00006573489],"domain_scores_gemma":[0.9996774,0.000007884743,0.000011971654,0.00019244401,0.000052241812,0.0000580635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012196605,0.000029052535,0.00003236307,0.00003091953,0.00001834816,0.000047138597,0.00031695788,0.000013584222,0.0000037002494],"category_scores_gemma":[0.000015993533,0.000024053541,0.000011075238,0.00013471124,0.000004940142,0.00011579441,0.000095241536,0.000014649059,0.000083276645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015100024,0.00005128287,0.0015719287,0.0000017950333,0.0000065095796,0.000007985638,0.0006224456,0.009211053,0.00005359534,0.54361343,0.3628249,0.08203357],"study_design_scores_gemma":[0.00016083593,0.000049749327,0.00033894338,0.0000019924382,7.1659457e-7,0.000012610921,0.000011529997,0.92808515,0.0046694297,0.0186848,0.04783499,0.00014925767],"about_ca_topic_score_codex":0.000015573452,"about_ca_topic_score_gemma":2.8875954e-7,"teacher_disagreement_score":0.9188741,"about_ca_system_score_codex":0.000008320927,"about_ca_system_score_gemma":0.000026640646,"threshold_uncertainty_score":0.10703806},"labels":[],"label_agreement":null},{"id":"W1997922946","doi":"10.1109/iccd.2011.6081397","title":"A queueing theoretic approach for performance evaluation of low-power multi-core embedded systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Embedded system; Expediting; Multi-core processor; Queueing theory; Cache; Memory architecture; Computer architecture; Parallel computing; Computer network","score_opus":0.0881984513555236,"score_gpt":0.298869946291972,"score_spread":0.2106714949364484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997922946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021763483,0.00007142241,0.9625524,0.0000024294595,0.00009929481,0.0006492175,5.1172964e-7,0.00032263965,0.014538575],"genre_scores_gemma":[0.5707506,0.0000027682454,0.42906597,0.000011987016,0.0000062102613,0.000069100155,0.0000016269435,0.0000050061212,0.00008674176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891037,0.00009584688,0.00028141536,0.00026388204,0.00028073916,0.00016776561],"domain_scores_gemma":[0.99885666,0.000042412386,0.00016170376,0.00040549648,0.00049812696,0.00003560341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018745881,0.00010608207,0.00015268785,0.000106141,0.00007489196,0.000034950495,0.00046765423,0.000060956176,0.000008214768],"category_scores_gemma":[0.000056727415,0.00008614842,0.000051837185,0.00019879863,0.00003872201,0.00022682428,0.000081443206,0.00004847603,0.0000022018266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007594257,0.0010752646,0.0022910016,0.00073856435,0.000107958076,5.811481e-7,0.022530759,0.30589464,0.00088779087,0.6307291,0.000994055,0.034674387],"study_design_scores_gemma":[0.00038158402,0.00007880885,0.0003432364,0.00004355862,0.000008608858,0.0000025547704,0.00007159793,0.9936102,0.004906462,0.00043331474,0.000004577439,0.00011549674],"about_ca_topic_score_codex":0.000013377868,"about_ca_topic_score_gemma":1.9728934e-7,"teacher_disagreement_score":0.6877156,"about_ca_system_score_codex":0.000027621714,"about_ca_system_score_gemma":0.00006745563,"threshold_uncertainty_score":0.35130307},"labels":[],"label_agreement":null},{"id":"W1998017993","doi":"10.1007/s00453-002-1009-y","title":"Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Theory of computation; Out-of-core algorithm; Parallel computing","score_opus":0.013877336547200188,"score_gpt":0.25720421338987653,"score_spread":0.24332687684267634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998017993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012096257,0.00092986104,0.9911146,0.0002884387,0.00063792476,0.00041328644,0.000010543236,0.0013625026,0.0040331865],"genre_scores_gemma":[0.089079335,0.000021334321,0.90833026,0.0005422472,0.00014588008,0.000049173424,0.000013945917,0.00005165313,0.001766171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960804,0.0004344389,0.00072875497,0.0010656815,0.0007715835,0.00091915345],"domain_scores_gemma":[0.99770164,0.000364528,0.00031872428,0.001024833,0.00024697054,0.00034329895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001137319,0.0004902558,0.0004745583,0.00023088935,0.0005926801,0.0003434651,0.001360808,0.00020864939,0.000052522093],"category_scores_gemma":[0.00023444547,0.00048635103,0.00021326053,0.000794517,0.00012843788,0.00022111007,0.0002973258,0.00050982024,0.00010241427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019258,0.0010384702,0.00008490172,0.00004410114,0.00016022785,0.00019364723,0.0018950043,0.4983631,0.0018757207,0.028495722,0.019391472,0.44843742],"study_design_scores_gemma":[0.0009539353,0.00012432413,0.000017847447,0.00004098697,0.000012046531,0.0000776258,0.000040899566,0.98634106,0.0042737476,0.0022651602,0.005229751,0.0006226165],"about_ca_topic_score_codex":0.00005347248,"about_ca_topic_score_gemma":4.917991e-7,"teacher_disagreement_score":0.48797795,"about_ca_system_score_codex":0.00012847601,"about_ca_system_score_gemma":0.00013676357,"threshold_uncertainty_score":0.99975884},"labels":[],"label_agreement":null},{"id":"W1998618415","doi":"10.1109/71.914756","title":"Exploiting wavefront parallelism on large-scale shared-memory multiprocessors","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Information Technology Research Centre; University of Toronto; University of Michigan","keywords":"Computer science; Parallel computing; Locality; Scheduling (production processes); Task parallelism; Data parallelism; Wavefront; Locality of reference; Instruction-level parallelism; Shared memory; Distributed memory; Parallelism (grammar); Cache; Mathematics; Mathematical optimization","score_opus":0.019747412989845194,"score_gpt":0.24647045324170663,"score_spread":0.22672304025186144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998618415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073942444,0.00026376083,0.9884906,0.00040062756,0.0005858071,0.0004467155,0.00013701973,0.0011473261,0.0011339462],"genre_scores_gemma":[0.987021,0.00026236675,0.011133108,0.00025755135,0.00008170285,0.00019245366,0.000046025874,0.000026294554,0.0009794922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974564,0.00015996523,0.00056369917,0.00078182016,0.0004336897,0.0006044581],"domain_scores_gemma":[0.9985891,0.00015081014,0.00019305086,0.00063784915,0.00014985215,0.00027936298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036848692,0.00038333965,0.00041782326,0.00022125388,0.0006952809,0.00037035203,0.00057046034,0.00020587913,0.000016368662],"category_scores_gemma":[0.000011334781,0.00035352624,0.0001395728,0.00047926864,0.00005236338,0.00045865212,0.000010555943,0.0003654567,0.000074429416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007352577,0.0004141786,0.00006146638,0.0000463094,0.00004346008,0.000041903408,0.00084971834,0.9917982,0.000050694838,0.00062335544,0.002069325,0.003927835],"study_design_scores_gemma":[0.0013833886,0.00024427913,0.0001973569,0.00019739298,0.000016843154,0.00010159843,0.0004921084,0.9918982,0.00021669648,0.00015685442,0.0045524174,0.0005428636],"about_ca_topic_score_codex":0.00008889841,"about_ca_topic_score_gemma":0.000016357448,"teacher_disagreement_score":0.9796268,"about_ca_system_score_codex":0.00009235191,"about_ca_system_score_gemma":0.000045217104,"threshold_uncertainty_score":0.9998917},"labels":[],"label_agreement":null},{"id":"W1998791759","doi":"10.1145/2503210.2503243","title":"Low-power, low-storage-overhead chipkill correct via multi-line error correction","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Error detection and correction; Computer science; Overhead (engineering); Reliability (semiconductor); Reliability engineering; Line (geometry); Power (physics); Embedded system; Real-time computing; Algorithm; Engineering","score_opus":0.015229615019012314,"score_gpt":0.2597250739247018,"score_spread":0.24449545890568947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998791759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076160105,0.00004524938,0.9821074,0.0003519095,0.0027273262,0.00039853103,7.179867e-7,0.0021889573,0.0045638806],"genre_scores_gemma":[0.7318941,0.000016473481,0.25792003,0.0010549292,0.00007623988,0.00004151596,0.000008261929,0.000022893619,0.008965604],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982478,0.00010470376,0.00038774498,0.0005719171,0.00028245515,0.00040535908],"domain_scores_gemma":[0.9985901,0.0001019774,0.00016765385,0.00070043455,0.00027038064,0.00016945627],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025114027,0.00026088482,0.00025386215,0.0001954951,0.0002123323,0.0002446391,0.0007898317,0.0001390743,0.0003163671],"category_scores_gemma":[0.00009293036,0.0002312569,0.000108753724,0.00053012423,0.000048139063,0.00071030715,0.00026331618,0.00024607385,0.00080390007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043898715,0.002648444,0.0018025455,0.000080223865,0.00011506907,0.000037957652,0.00271368,0.17676188,0.008650196,0.002591285,0.47033715,0.33421767],"study_design_scores_gemma":[0.00036744366,0.00015714488,0.0013710362,0.00003881852,0.0000026330674,0.000027468219,0.0000130063845,0.985709,0.011084214,0.00018014517,0.0007217466,0.00032734996],"about_ca_topic_score_codex":0.0003447236,"about_ca_topic_score_gemma":0.000023967163,"teacher_disagreement_score":0.8089471,"about_ca_system_score_codex":0.000086585795,"about_ca_system_score_gemma":0.00005510895,"threshold_uncertainty_score":0.9999741},"labels":[],"label_agreement":null},{"id":"W1998922872","doi":"10.1109/fpl.2013.6645553","title":"TILT: A multithreaded VLIW soft processor family","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Very long instruction word; Thread (computing); Parallel computing; Field-programmable gate array; Compiler; Stratix; Latency (audio); Scheduling (production processes); Computer architecture; Embedded system; Operating system","score_opus":0.018617567004998902,"score_gpt":0.2460762391062148,"score_spread":0.2274586721012159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998922872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004186555,0.000051725096,0.97938913,0.00049550616,0.00007199837,0.00021524113,2.9149788e-7,0.0013942026,0.0141953435],"genre_scores_gemma":[0.47264838,0.000006739208,0.52260655,0.0013623118,0.000021459728,0.000045126373,0.0000019856536,0.0000073263545,0.0033001474],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991121,0.000032883596,0.00017285885,0.00029407334,0.0001648455,0.00022319969],"domain_scores_gemma":[0.9992279,0.00005796726,0.00005587136,0.00037914462,0.00019905472,0.00008006631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013115506,0.000110457615,0.00011289727,0.00007755403,0.000088594825,0.00023552038,0.0007563078,0.000053897922,0.000041433388],"category_scores_gemma":[0.000054019263,0.000088563706,0.000031186202,0.00032036533,0.000024160108,0.00045289926,0.00018606643,0.00007819936,0.000529049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013147157,0.0007388187,0.008597078,0.0000968245,0.00007863041,0.000013293805,0.0030324836,0.009217256,0.005648813,0.056314994,0.5267879,0.3894608],"study_design_scores_gemma":[0.00020555663,0.00004913551,0.010572075,0.000012956638,0.0000011408388,0.0000043161276,0.0000110796855,0.9796467,0.0033186518,0.0038412614,0.0021010877,0.00023605564],"about_ca_topic_score_codex":0.00025003927,"about_ca_topic_score_gemma":0.000004826873,"teacher_disagreement_score":0.9704294,"about_ca_system_score_codex":0.000013658699,"about_ca_system_score_gemma":0.00004475142,"threshold_uncertainty_score":0.68000317},"labels":[],"label_agreement":null},{"id":"W1998982496","doi":"10.1007/s10951-012-0276-y","title":"A computational study of heuristic and exact techniques for superblock instruction scheduling","year":2012,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign","keywords":"Computer science; Compiler; Heuristics; Scheduling (production processes); Parallel computing; Instruction scheduling; Heuristic; Two-level scheduling; Mathematical optimization; Programming language; Dynamic priority scheduling; Mathematics; Schedule; Artificial intelligence; Operating system","score_opus":0.02520914108074378,"score_gpt":0.2969409265940295,"score_spread":0.2717317855132857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998982496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.460135,0.00018731518,0.5393943,0.000041054962,0.000090646856,0.00010285211,2.6383816e-7,0.00003568909,0.000012829557],"genre_scores_gemma":[0.52511317,0.000010611309,0.47475475,0.000013827033,0.0000998016,0.0000019950787,2.2956296e-7,0.000004549262,0.0000010982436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988378,0.00006700304,0.00056168815,0.00011731765,0.00025588914,0.0001602689],"domain_scores_gemma":[0.9986912,0.00019627824,0.00049764005,0.00011367069,0.00041406555,0.00008714292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312855,0.00010486092,0.0002517877,0.0002809751,0.00012077462,0.00006548183,0.00026368085,0.00005180163,8.213849e-7],"category_scores_gemma":[0.0001880692,0.000094721,0.00006093265,0.00021662188,0.000026779133,0.0006403024,0.00008426344,0.00016150103,1.5101675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024276531,0.0025199421,0.10908353,0.0003527127,0.00038316817,0.000010057541,0.011616207,0.7466973,0.0035515542,0.020679224,0.0001267348,0.10473682],"study_design_scores_gemma":[0.0016710345,0.0014221653,0.007107578,0.00026869852,0.0000620754,0.0003782532,0.0008956828,0.9785492,0.0047771544,0.004480041,0.00010138875,0.0002867162],"about_ca_topic_score_codex":0.0000032982502,"about_ca_topic_score_gemma":1.8729406e-7,"teacher_disagreement_score":0.23185194,"about_ca_system_score_codex":0.00002980195,"about_ca_system_score_gemma":0.000054620028,"threshold_uncertainty_score":0.38626102},"labels":[],"label_agreement":null},{"id":"W1999567243","doi":"10.1145/968280.968340","title":"FPGA-based supercomputing","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Supercomputer; Scalability; Field-programmable gate array; Microprocessor; Multiprocessing; Speedup; Parallel computing; Computer architecture; Reconfigurable computing; Embedded system; Computation; Parallelizable manifold; Operating system","score_opus":0.016051392435945167,"score_gpt":0.25063432112490147,"score_spread":0.2345829286889563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999567243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002399201,0.000017632401,0.98150855,0.0013708647,0.000091874106,0.000054043634,1.00958204e-7,0.00174046,0.012817284],"genre_scores_gemma":[0.48418102,5.0920903e-7,0.51485,0.00089650095,0.000016470465,0.0000012811419,8.188322e-7,0.000002886198,0.0000504902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993053,0.000019084013,0.00013251633,0.00022713575,0.00013392897,0.00018201757],"domain_scores_gemma":[0.9995074,0.000030084857,0.000025429392,0.0003289307,0.00005194196,0.000056195655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016088705,0.00008108222,0.000077530036,0.00008474886,0.00011173186,0.00011338722,0.000559301,0.00003419128,0.000008859281],"category_scores_gemma":[0.000018923474,0.000072746356,0.000042444266,0.00029443513,0.00001636067,0.00016656694,0.00010346452,0.000066127766,0.00005812783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013267488,0.00010824058,0.0002493931,0.000007373025,0.000005492634,0.00001544498,0.00021160868,0.6277278,0.00019207917,0.3435565,0.001641245,0.026283478],"study_design_scores_gemma":[0.0006413051,0.000087829394,0.0004611624,0.00003160419,0.0000015071637,0.000014077637,0.0000052914966,0.93240654,0.04480781,0.01875668,0.0024724756,0.00031369453],"about_ca_topic_score_codex":0.00004112701,"about_ca_topic_score_gemma":0.0000018118932,"teacher_disagreement_score":0.4817818,"about_ca_system_score_codex":0.0000339974,"about_ca_system_score_gemma":0.000077049874,"threshold_uncertainty_score":0.29665104},"labels":[],"label_agreement":null},{"id":"W2001753130","doi":"10.1109/micro.2014.49","title":"Micro-Sliced Virtual Processors to Hide the Effect of Discontinuous CPU Availability for Consolidated Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Context switch; Computer science; Virtual machine; Interrupt; Operating system; Virtualization; Embedded system; Cache; Computer multitasking; Context (archaeology); Cloud computing; Distributed computing; Parallel computing; Microcontroller","score_opus":0.007526349251693389,"score_gpt":0.25093997739447393,"score_spread":0.24341362814278056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001753130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14679056,0.000017381151,0.8505142,0.0003525112,0.00014535665,0.0009384348,0.000003375702,0.00037280476,0.0008654153],"genre_scores_gemma":[0.96705484,6.9733244e-7,0.031812247,0.00014735587,0.0000324265,0.000118991964,0.0000030128592,0.0000085366955,0.00082186196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986661,0.00027060948,0.00034157108,0.00034599137,0.00015253293,0.00022316477],"domain_scores_gemma":[0.9981831,0.0008089172,0.00014823068,0.0006106975,0.00018305909,0.00006602854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013595187,0.00014372748,0.00028929225,0.0000620763,0.000118136515,0.0001333807,0.0009391413,0.000053656528,0.000002051808],"category_scores_gemma":[0.0004596314,0.0000851021,0.0000701493,0.00029136703,0.00005719711,0.000109069646,0.0001842051,0.00006188582,0.000011252785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016368425,0.0008937887,0.021787683,0.0028293433,0.00062565843,0.0000039864412,0.011726351,0.22847229,0.12292686,0.24268723,0.21700436,0.14940561],"study_design_scores_gemma":[0.0008831396,0.0018803685,0.0004040296,0.00009146738,0.000019488158,0.000007370062,0.00003365098,0.7283274,0.26137474,0.00018948774,0.006453984,0.0003348589],"about_ca_topic_score_codex":0.000062275634,"about_ca_topic_score_gemma":0.000003848055,"teacher_disagreement_score":0.82026434,"about_ca_system_score_codex":0.00001876227,"about_ca_system_score_gemma":0.000028656425,"threshold_uncertainty_score":0.3470363},"labels":[],"label_agreement":null},{"id":"W2002671355","doi":"10.1145/1531793.1531804","title":"HASS","year":2009,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":220,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Computer science; Profiling (computer programming); Scalability; Parallel computing; Oracle; Multi-core processor; Thread (computing); Scheduling (production processes); Workload; Distributed computing; Homogeneous; Operating system; Programming language; Mathematical optimization","score_opus":0.02937903326200061,"score_gpt":0.3051996701791999,"score_spread":0.2758206369171993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002671355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071097194,0.12520973,0.8564903,0.005426256,0.0003557657,0.0007436059,6.792042e-7,0.0013155733,0.010386974],"genre_scores_gemma":[0.32087824,0.023612486,0.6393645,0.013439678,0.0003868578,0.00012016656,0.000013757061,0.000031068128,0.002153286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828637,0.0002527237,0.0005453021,0.00039322418,0.00026350754,0.00025887188],"domain_scores_gemma":[0.99816453,0.00009191963,0.00017389201,0.0013068684,0.00017660583,0.00008615488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009576538,0.00018054119,0.00040200658,0.000051517643,0.00020898035,0.0003673348,0.0016698266,0.00005379541,0.000005630311],"category_scores_gemma":[0.00060700637,0.00014743351,0.00008068742,0.00047299688,0.000010611364,0.00035583889,0.00018331016,0.00013936326,0.00009182428],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011609857,0.0002534858,0.0003169847,0.0032787782,0.000059931965,0.000089853354,0.0005969579,0.010659568,0.0007992821,0.21972771,0.30372253,0.46049374],"study_design_scores_gemma":[0.00076204864,0.00094897125,0.0003695981,0.03770043,0.000062879226,0.0006002985,0.000020156385,0.5661737,0.0008893667,0.0024774524,0.38765576,0.0023393715],"about_ca_topic_score_codex":0.000017045078,"about_ca_topic_score_gemma":1.8190313e-7,"teacher_disagreement_score":0.5555141,"about_ca_system_score_codex":0.00003551715,"about_ca_system_score_gemma":0.000058249832,"threshold_uncertainty_score":0.60121644},"labels":[],"label_agreement":null},{"id":"W2002932832","doi":"10.1145/2682583","title":"Learning your limit","year":2014,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Advanced Micro Devices","keywords":"Computer science; Parallel computing; Cache; Thread (computing); CPU cache; Scheduling (production processes); Cache pollution; Massively parallel; Page cache; Embedded system; Cache algorithms; Operating system","score_opus":0.050528264524641,"score_gpt":0.30314577326093967,"score_spread":0.2526175087362987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002932832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005100403,0.00039436808,0.8747751,0.077121906,0.00013038953,0.00014978721,3.4221785e-7,0.00063257077,0.041695114],"genre_scores_gemma":[0.5127051,0.00004691736,0.4869253,0.00011388533,0.0000050320778,0.0000031913619,5.0492076e-7,0.0000023071632,0.00019774541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938667,0.0002377446,0.0001347092,0.000084225634,0.00008472577,0.000071907256],"domain_scores_gemma":[0.9782889,0.00025603053,0.00012538773,0.021225575,0.000087261724,0.000016881111],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00037557166,0.000044411336,0.00006750631,0.000038102593,0.00026787922,0.000034064065,0.03517789,0.000024296729,0.0000010771162],"category_scores_gemma":[0.0054363566,0.000034162204,0.000048288235,0.00025571563,0.00007423167,0.00008463982,0.021542156,0.00014735035,0.000010752621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030027843,0.00026654132,0.014036735,0.000022615715,0.000045447392,5.8850908e-8,0.00357114,0.040465847,0.0017092132,0.77484137,0.05679238,0.10824568],"study_design_scores_gemma":[0.0001528105,0.00005785138,0.0067885052,0.000058114794,0.0000076177093,0.000004039239,0.000027664619,0.6995076,0.003957008,0.21479556,0.07449048,0.00015275115],"about_ca_topic_score_codex":0.0000099329445,"about_ca_topic_score_gemma":0.0000012219728,"teacher_disagreement_score":0.65904176,"about_ca_system_score_codex":0.0000086004675,"about_ca_system_score_gemma":0.000016994087,"threshold_uncertainty_score":0.9863714},"labels":[],"label_agreement":null},{"id":"W2003820904","doi":"10.5555/2555692.2555702","title":"pvFPGA: accessing an FPGA-based hardware accelerator in a paravirtualized environment","year":2013,"lang":"en","type":"article","venue":"International Conference on Hardware/Software Codesign and System Synthesis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"PCI Express; Field-programmable gate array; Computer science; Virtualization; Porting; x86; Embedded system; Operating system; Hypervisor; Overhead (engineering); Computer hardware; Software; Cloud computing","score_opus":0.06104089821189448,"score_gpt":0.2829924440807985,"score_spread":0.221951545868904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003820904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013249042,0.00006955729,0.9826618,0.00088430196,0.000248337,0.0005809712,0.000029267907,0.00080397597,0.0014727836],"genre_scores_gemma":[0.90166014,0.000044655295,0.09727938,0.0003310372,0.000050110433,0.00045010186,0.000017322986,0.00002767507,0.00013954885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996817,0.000521145,0.0006821524,0.0009221273,0.0006691721,0.00038842898],"domain_scores_gemma":[0.99804854,0.00047365518,0.00030970742,0.00066419085,0.00027120629,0.00023267906],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061276567,0.00039637077,0.0004818586,0.00046395216,0.00021029492,0.0012462691,0.0015081231,0.00017566571,0.00026511116],"category_scores_gemma":[0.00022499997,0.00036673681,0.000093302726,0.00019444192,0.000073223055,0.0010156295,0.00019662414,0.00021944854,0.00012250245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005723582,0.0022887501,0.027498284,0.000709308,0.00045389668,0.00047094026,0.0036320752,0.029522123,0.007415745,0.17186713,0.004800709,0.75076866],"study_design_scores_gemma":[0.000938816,0.00020907375,0.004881543,0.0012519895,0.000015946162,0.000026157286,0.00024026172,0.9791315,0.010410474,0.0011482236,0.0008163979,0.00092957605],"about_ca_topic_score_codex":0.00017290282,"about_ca_topic_score_gemma":0.000006059001,"teacher_disagreement_score":0.9496094,"about_ca_system_score_codex":0.00026973328,"about_ca_system_score_gemma":0.00017439433,"threshold_uncertainty_score":0.99987847},"labels":[],"label_agreement":null},{"id":"W2004939608","doi":"10.1103/physreve.88.053309","title":"Efficient parallelization of short-range molecular dynamics simulations on many-core systems","year":2013,"lang":"en","type":"article","venue":"Physical Review E","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Parallel computing; Computer science; Thread (computing); Xeon; Xeon Phi; Multi-core processor; Coprocessor; Schedule; Benchmark (surveying); Molecular dynamics; Range (aeronautics); Computational science; Materials science","score_opus":0.024459061424486978,"score_gpt":0.3074856163723761,"score_spread":0.2830265549478891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004939608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018685702,0.0014560728,0.9770886,0.00031377815,0.000057912235,0.0006503129,0.0000028248774,0.00018088713,0.0015639507],"genre_scores_gemma":[0.9914935,0.0002693188,0.007895353,0.0002297506,0.000022547505,0.000044261767,0.000014034329,0.000008920569,0.000022286184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.00007670418,0.00028299927,0.00024265537,0.00028742623,0.0001424439],"domain_scores_gemma":[0.99904704,0.00009068798,0.00011454068,0.00049201294,0.00019626167,0.000059453265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009702277,0.00012351098,0.00027463556,0.000050315317,0.000045738874,0.00004049647,0.00040034263,0.000023691206,0.0000037284806],"category_scores_gemma":[0.000068425805,0.00010223868,0.00009666955,0.00039891395,0.000022513537,0.00006233261,0.00008425451,0.00007593592,0.00003985225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.295508e-7,0.00017537584,0.000043542957,0.00030967535,0.000008321639,7.735894e-7,0.000038589827,0.681452,0.00012842614,0.31160617,0.0002666936,0.0059700157],"study_design_scores_gemma":[0.00003865292,0.000055896715,0.0001364075,0.00061301986,0.000009984218,5.4643266e-7,6.271294e-7,0.996738,0.000070958056,0.002124968,0.00010533744,0.000105587314],"about_ca_topic_score_codex":0.000014226177,"about_ca_topic_score_gemma":1.974972e-7,"teacher_disagreement_score":0.9728078,"about_ca_system_score_codex":0.00004880443,"about_ca_system_score_gemma":0.000022195303,"threshold_uncertainty_score":0.41691723},"labels":[],"label_agreement":null},{"id":"W2005123879","doi":"10.1145/1610252.1610270","title":"Maximizing power efficiency with asymmetric multicore systems","year":2009,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-core processor; Computer science; Parallel computing; Power (physics); Physics","score_opus":0.029296498336550146,"score_gpt":0.27731797015254195,"score_spread":0.2480214718159918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005123879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005511501,0.0029191105,0.94188184,0.02567083,0.00014695383,0.00050890766,0.0000017114626,0.0005813384,0.022777805],"genre_scores_gemma":[0.5953852,0.00003513815,0.40444106,0.00009082842,0.0000022100414,0.0000038102642,4.9485726e-7,0.0000025061615,0.00003872972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992152,0.00013221269,0.00020973787,0.0001401511,0.00017836061,0.00012436697],"domain_scores_gemma":[0.97795063,0.00020172501,0.00019358809,0.021450402,0.00017572133,0.000027940967],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00029376827,0.00008119088,0.00011823631,0.00013427692,0.0002766139,0.00007567284,0.029164134,0.00003283094,3.3008266e-7],"category_scores_gemma":[0.0014121549,0.00005362684,0.000045795143,0.0010975475,0.000086706605,0.00013476056,0.005657886,0.00013685372,0.0000037654274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000240797,0.0019102916,0.0077013853,0.0000498532,0.000103938204,0.0000020826953,0.004847235,0.14790529,0.0013110103,0.7655726,0.033153526,0.03741871],"study_design_scores_gemma":[0.0007345929,0.00038741398,0.025857003,0.00039593113,0.000029695546,0.00005585084,0.00014185972,0.9355616,0.0030218924,0.02860161,0.0047067627,0.0005057917],"about_ca_topic_score_codex":0.000016386271,"about_ca_topic_score_gemma":6.134632e-7,"teacher_disagreement_score":0.7876563,"about_ca_system_score_codex":0.000025847126,"about_ca_system_score_gemma":0.000042765452,"threshold_uncertainty_score":0.9760885},"labels":[],"label_agreement":null},{"id":"W2005217673","doi":"10.1145/859670.859698","title":"Cold code decompression at runtime","year":2003,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Code (set theory); Decompression; Operating system; Software; Programming language; Embedded system","score_opus":0.0425590428700084,"score_gpt":0.30664058984977066,"score_spread":0.26408154697976227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005217673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034961216,0.0063173887,0.7663574,0.06332511,0.0007033547,0.0011856654,0.000014335305,0.0015156593,0.12561986],"genre_scores_gemma":[0.40296015,0.00010185276,0.5962512,0.00014371125,0.0000018229566,0.000008486362,8.5627556e-7,0.0000037204338,0.0005281876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992254,0.00025508882,0.00018778845,0.00011938152,0.00011626981,0.000096064156],"domain_scores_gemma":[0.9734697,0.00024980635,0.00015321751,0.02600619,0.000094703806,0.000026418456],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00029715517,0.0000635404,0.000090234724,0.000041322248,0.00039093586,0.000027620701,0.02786888,0.000035927027,0.00000675425],"category_scores_gemma":[0.0019690753,0.000048261667,0.000059719805,0.00030848588,0.00009939652,0.000095300085,0.019493537,0.0000962213,0.000016855602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035798475,0.000387762,0.009635867,0.000015890542,0.000039247432,2.0159362e-7,0.0008030216,0.0057699615,0.011913782,0.6706818,0.29903525,0.0017136692],"study_design_scores_gemma":[0.0006524341,0.00007210679,0.005050709,0.00019647571,0.000023975163,0.000021840055,0.000020321566,0.13413495,0.25392774,0.22568119,0.3797652,0.00045306367],"about_ca_topic_score_codex":0.0000060593106,"about_ca_topic_score_gemma":0.0000052731857,"teacher_disagreement_score":0.44500056,"about_ca_system_score_codex":0.00003187926,"about_ca_system_score_gemma":0.000035929428,"threshold_uncertainty_score":0.98843664},"labels":[],"label_agreement":null},{"id":"W2005656440","doi":"10.5555/2485288.2485311","title":"A dual grain hit-miss detector for large die-stacked DRAM caches","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dram; Static random-access memory; Cache; Computer science; Latency (audio); CAS latency; Embedded system; Computer hardware; CPU cache; Random access memory; Parallel computing; Operating system; Semiconductor memory; Memory controller; Telecommunications","score_opus":0.01890856430231396,"score_gpt":0.26024751644651056,"score_spread":0.2413389521441966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005656440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049902387,0.00005409614,0.98950285,0.0012169394,0.0001557638,0.00046088785,0.000003179214,0.0012478719,0.0023681899],"genre_scores_gemma":[0.46138105,0.000004984303,0.5338554,0.0006815242,0.00006818933,0.00013123799,0.0000056350295,0.000012478855,0.003859547],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884963,0.00004629789,0.00021801905,0.00035060846,0.0001493673,0.0003860935],"domain_scores_gemma":[0.99912745,0.000119775694,0.000070420596,0.00041563957,0.00015433422,0.00011240157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002670383,0.00014610912,0.00015935952,0.00009099319,0.000181133,0.00025762626,0.0005448508,0.000075244374,0.000048074562],"category_scores_gemma":[0.00009538031,0.00012221845,0.00008645738,0.00016806426,0.000019034336,0.00033272553,0.00021394828,0.00007464547,0.000069909715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003126766,0.00085394405,0.0010512853,0.00015614617,0.00015561374,0.000019385338,0.0049394434,0.0017636638,0.0052875974,0.284195,0.5345102,0.16703647],"study_design_scores_gemma":[0.0005394255,0.00016289929,0.00044542292,0.000011960721,0.0000038647154,0.000004976645,0.000033005083,0.9472759,0.011836252,0.008530091,0.03082477,0.0003314322],"about_ca_topic_score_codex":0.00007334499,"about_ca_topic_score_gemma":0.000019557654,"teacher_disagreement_score":0.94551224,"about_ca_system_score_codex":0.000025726647,"about_ca_system_score_gemma":0.000041047493,"threshold_uncertainty_score":0.4983924},"labels":[],"label_agreement":null},{"id":"W2005776078","doi":"10.1145/1519065.1519087","title":"Tralfamadore","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Representation (politics); Programming language; Software engineering; Software; Software development; Intermediate language; Compiler","score_opus":0.01301360196258386,"score_gpt":0.25373858381205,"score_spread":0.24072498184946614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005776078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027804403,0.000018881903,0.9081346,0.002102658,0.000027407543,0.000022099457,1.9410967e-8,0.00093110173,0.0884852],"genre_scores_gemma":[0.5056468,0.0000040103514,0.49188396,0.0015300132,0.000011482126,3.441686e-7,1.9167221e-7,6.498578e-7,0.00092251354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967706,0.000009047914,0.00006030448,0.00010711816,0.0000608558,0.00008559293],"domain_scores_gemma":[0.999739,0.000006677138,0.000012778475,0.00019403224,0.000019052737,0.00002844118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005799842,0.000036608024,0.0000385579,0.000034547887,0.000036816058,0.000055195578,0.00034454555,0.000017121096,0.00000925006],"category_scores_gemma":[0.0000052139353,0.000030202078,0.0000193885,0.00014494745,0.0000038578905,0.00013603522,0.000019507246,0.00002898334,0.000027397642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.8099076e-7,0.000032190474,0.000045090703,4.1473234e-7,0.0000010737538,0.0000035364837,0.00009269682,0.0008077812,0.00013159566,0.742868,0.03363092,0.22238621],"study_design_scores_gemma":[0.00023376885,0.00022963392,0.008003899,0.000008619486,0.0000011196687,0.000024888393,0.000003730344,0.82568985,0.012632771,0.12923908,0.02361888,0.0003137566],"about_ca_topic_score_codex":0.0000010185564,"about_ca_topic_score_gemma":8.221716e-8,"teacher_disagreement_score":0.8248821,"about_ca_system_score_codex":0.0000046346267,"about_ca_system_score_gemma":0.000008126415,"threshold_uncertainty_score":0.1231605},"labels":[],"label_agreement":null},{"id":"W2006432698","doi":"10.1145/2552999.2553002","title":"Parallelism in Ada","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Task parallelism; Parallelism (grammar); Concurrency; Parallel computing; Instruction-level parallelism; Implicit parallelism; Data parallelism; Task (project management); Divide and conquer algorithms; Syntax; sort; Programming language","score_opus":0.012020248883993438,"score_gpt":0.22552745749777062,"score_spread":0.21350720861377717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006432698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18719347,0.00012120617,0.7722168,0.03741035,0.0003262383,0.00034835612,3.7936766e-7,0.0008014766,0.0015817144],"genre_scores_gemma":[0.64229333,0.000016335804,0.34315386,0.014271283,0.000058160185,0.000053882515,0.0000026185305,0.000012327178,0.00013819733],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.00008113263,0.00027791125,0.0003860713,0.00024882055,0.0003698761],"domain_scores_gemma":[0.9987084,0.000162587,0.00008063873,0.0009231119,0.00004020695,0.00008504243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016640777,0.00016207031,0.00016920503,0.00016123678,0.00007038079,0.00019454987,0.001693446,0.00006015545,0.000041586078],"category_scores_gemma":[0.00009244365,0.00015619062,0.000052092215,0.00040118943,0.000036318812,0.00059098355,0.0004429642,0.00019378519,0.00016590783],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097296615,0.00022267252,0.013236843,0.000050089868,0.00005140909,0.00018757799,0.0030164164,0.04701595,0.015236194,0.012566596,0.8362955,0.07211103],"study_design_scores_gemma":[0.0040166867,0.00034788097,0.100241095,0.0004747403,0.00001748912,0.0001338543,0.00018251652,0.7258253,0.020560293,0.059817925,0.08419896,0.004183219],"about_ca_topic_score_codex":0.0006819274,"about_ca_topic_score_gemma":0.000014557711,"teacher_disagreement_score":0.75209653,"about_ca_system_score_codex":0.000049471862,"about_ca_system_score_gemma":0.000028004491,"threshold_uncertainty_score":0.6369269},"labels":[],"label_agreement":null},{"id":"W2006693269","doi":"10.1145/2627373.2627382","title":"Just-in-time shape inference for array-based languages","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Compiler; Computer science; Python (programming language); Programming language; Parallel computing; Inference; MATLAB; Overhead (engineering); Optimizing compiler; Just-in-time compilation; Artificial intelligence","score_opus":0.01830891773775952,"score_gpt":0.29349335873942733,"score_spread":0.27518444100166783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006693269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020658625,0.000009428941,0.9865498,0.00062684045,0.000033149656,0.00012446604,4.9933203e-7,0.00060730556,0.009982628],"genre_scores_gemma":[0.4385555,7.8444634e-7,0.55989575,0.0010444074,0.000023369388,0.000016822718,0.0000028779575,0.000004278694,0.00045616896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993029,0.00003937672,0.00013852477,0.0002321605,0.0001082141,0.0001787919],"domain_scores_gemma":[0.9992968,0.0002657156,0.000042178588,0.00029980877,0.00005462513,0.000040890834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034031196,0.00008376237,0.00011303138,0.00010315365,0.00004563002,0.000102221406,0.0006439603,0.000044113098,0.000026458096],"category_scores_gemma":[0.00013345378,0.00007374229,0.000035393423,0.00018175278,0.000014635703,0.000113527596,0.00005150841,0.000047863534,0.000038593986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005453264,0.0007180451,0.014811582,0.00020320233,0.000027733171,0.000007989482,0.0013231158,0.117626615,0.009657623,0.49029386,0.03537889,0.32989684],"study_design_scores_gemma":[0.00024182582,0.00006551468,0.00047177525,0.000016366126,8.578232e-7,3.606027e-7,0.0000020668974,0.98533523,0.009779455,0.0016448792,0.0023192232,0.00012246444],"about_ca_topic_score_codex":0.000012037463,"about_ca_topic_score_gemma":0.0000034317559,"teacher_disagreement_score":0.8677086,"about_ca_system_score_codex":0.000012319899,"about_ca_system_score_gemma":0.000030760857,"threshold_uncertainty_score":0.30071232},"labels":[],"label_agreement":null},{"id":"W2007053448","doi":"10.1109/tc.2012.52","title":"Designing a Physical Locality Aware Coherence Protocol for Chip-Multiprocessors","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Cambridge; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; MESI protocol; Efficient energy use; Exploit; Locality; Latency (audio); Cache; Multiprocessing; Energy consumption; Chip; Multi-core processor; Protocol (science); Bus sniffing; Parallel computing; CPU cache; Cache algorithms; Telecommunications","score_opus":0.04833595714627392,"score_gpt":0.32956462324425945,"score_spread":0.2812286660979855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007053448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016460061,0.0000012001624,0.97571695,0.00011847669,0.00032889258,0.02257797,0.000004287913,0.0010021282,0.00008551146],"genre_scores_gemma":[0.49069065,2.1781759e-7,0.46005857,0.00029682514,0.00011209605,0.048784878,8.978114e-7,0.000018843875,0.000037036465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848,0.00010736974,0.0002578168,0.00042203206,0.00025865494,0.0004741119],"domain_scores_gemma":[0.99882257,0.000310559,0.0001199512,0.0004276767,0.0001303284,0.00018893369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002937879,0.00024410036,0.00023196699,0.00013332348,0.00037387482,0.00013676276,0.0006833527,0.00008065002,0.0000038038177],"category_scores_gemma":[0.0000045027296,0.00023053135,0.0001596158,0.0003998972,0.00005905255,0.0005607512,0.0000070354004,0.00022139764,0.000019077408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017613925,0.0026340138,0.00011800213,0.0002808504,0.00011347114,0.0000028612474,0.0038815124,0.6786698,0.0007345967,0.0012447085,0.0045681396,0.30757588],"study_design_scores_gemma":[0.0007655494,0.00023341468,0.000025150945,0.000098069286,0.000007744343,0.00000758952,0.000013831818,0.931065,0.066526875,0.00027563053,0.0006629171,0.0003181867],"about_ca_topic_score_codex":0.000010030459,"about_ca_topic_score_gemma":7.798792e-7,"teacher_disagreement_score":0.5156584,"about_ca_system_score_codex":0.00006329325,"about_ca_system_score_gemma":0.000069715585,"threshold_uncertainty_score":0.94007957},"labels":[],"label_agreement":null},{"id":"W2007964763","doi":"10.1145/2492408.2492418","title":"A new perspective on processing-in-memory architecture design","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Memory hierarchy; Locality; Memory architecture; Computation; Memory management; Computer architecture; Energy consumption; Perspective (graphical); Interleaved memory; Cache-only memory architecture; Memory map; Architecture; Distributed computing; Parallel computing; Semiconductor memory; Shared memory; Computer hardware; Artificial intelligence; Cache; Engineering","score_opus":0.01617617750181198,"score_gpt":0.2599449380489604,"score_spread":0.2437687605471484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007964763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011140147,0.00006026927,0.9531142,0.003002246,0.000030682415,0.00023636188,2.1913229e-8,0.00060862384,0.042836178],"genre_scores_gemma":[0.16617893,0.0000021647274,0.829932,0.00097062375,0.000033135264,0.000016289507,1.068173e-7,0.0000059700164,0.002860831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992042,0.000056728073,0.000109262546,0.0003044014,0.00013820529,0.00018716296],"domain_scores_gemma":[0.9995186,0.000044050055,0.000037584505,0.00025141824,0.00007606035,0.000072323135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010782186,0.000104885665,0.000095843476,0.00016352402,0.000051813262,0.00016761478,0.00050085393,0.00004412246,0.000046459452],"category_scores_gemma":[0.000034384015,0.000082497514,0.000025306847,0.00035271008,0.0000129212785,0.00019525009,0.00007236623,0.00013869595,0.00009701152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013443268,0.00015816891,0.000061667386,0.000010147455,0.0000062869726,0.000013947695,0.0067017823,0.20154873,0.00027697856,0.075853705,0.061934263,0.65342087],"study_design_scores_gemma":[0.00043263403,0.00029353768,0.0011909064,0.00006823547,0.0000012310968,0.000015737456,0.00012123636,0.8561811,0.0046443962,0.13638146,0.0003107273,0.0003588288],"about_ca_topic_score_codex":0.0002635447,"about_ca_topic_score_gemma":0.0000040498758,"teacher_disagreement_score":0.65463233,"about_ca_system_score_codex":0.00006425484,"about_ca_system_score_gemma":0.00012077324,"threshold_uncertainty_score":0.3364151},"labels":[],"label_agreement":null},{"id":"W2008071279","doi":"10.5555/1874620.1874876","title":"Understanding multicore technologies","year":2009,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer architecture; Multi-core processor; Key (lock); Embedded system; Software; Class (philosophy); Interconnection; Architecture; Distributed computing; Parallel computing; Operating system; Computer network","score_opus":0.07197247383349321,"score_gpt":0.26407146720723546,"score_spread":0.19209899337374226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008071279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010204479,0.00012483669,0.9941842,0.00095139665,0.000034408757,0.00013583286,2.629778e-7,0.002203723,0.0013448732],"genre_scores_gemma":[0.7223655,0.00012125257,0.2773352,0.00012385925,0.000005832653,0.0000024612834,9.615952e-7,0.0000039570828,0.00004094355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925345,0.000060092967,0.00019143596,0.00023476349,0.00010325826,0.00015702401],"domain_scores_gemma":[0.9993633,0.00025236377,0.00006954505,0.00022706822,0.00006474438,0.00002299868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028906585,0.00010221898,0.00010390381,0.00022445952,0.00012747776,0.00016398741,0.00032053748,0.0000508264,8.3357236e-7],"category_scores_gemma":[0.00047313457,0.00009443657,0.000010074135,0.00075593096,0.000036368034,0.00031071153,0.00005197712,0.00008367545,0.0000052867645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848165,0.0005496956,0.020679126,0.000048926962,0.000014412246,0.0001243692,0.004249507,0.033329587,0.002554191,0.74781764,0.009094459,0.18152721],"study_design_scores_gemma":[0.00023290807,0.00014695173,0.014900187,0.000051005703,0.00000169125,0.000020645717,0.000028442695,0.9519074,0.0014173839,0.03078753,0.00032082613,0.00018505561],"about_ca_topic_score_codex":0.0000019516397,"about_ca_topic_score_gemma":4.398019e-7,"teacher_disagreement_score":0.9185778,"about_ca_system_score_codex":0.000033844313,"about_ca_system_score_gemma":0.000028111312,"threshold_uncertainty_score":0.38510117},"labels":[],"label_agreement":null},{"id":"W2008175241","doi":"10.1109/iiswc.2012.6402901","title":"Deconstructing the overhead in parallel applications","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Profiling (computer programming); Scalability; Debugging; Performance tuning; Thread (computing); Distributed computing; Scheduling (production processes); Limiting; Parallel computing; Computer architecture; Database; Operating system","score_opus":0.019244393036008035,"score_gpt":0.2749201540832576,"score_spread":0.25567576104724954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008175241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010561872,0.00014004538,0.96575797,0.0005751616,0.000048417816,0.00013081208,7.242825e-8,0.0002641407,0.032027192],"genre_scores_gemma":[0.5580835,0.000008843546,0.44135046,0.00033954447,0.000035758403,0.000039418897,2.8480707e-7,0.0000020846574,0.0001401027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945253,0.000037996484,0.00013320278,0.00010806626,0.0000746519,0.00019354517],"domain_scores_gemma":[0.9994917,0.00010044601,0.000039346396,0.0003148303,0.000017618162,0.00003607194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003339871,0.00005299606,0.000053120417,0.00004790276,0.00010304978,0.000054498796,0.000471857,0.000024636844,0.000009029431],"category_scores_gemma":[0.000013879965,0.000036488073,0.000020446854,0.00030090805,0.000022499342,0.00026472655,0.00013053518,0.00007931236,0.000032493594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7141756e-7,0.00004629111,0.033440784,0.000002351376,0.0000030379886,1.6144936e-7,0.0005503325,0.0024674353,0.000015594918,0.90283585,0.0013746237,0.05926307],"study_design_scores_gemma":[0.0006249809,0.000030280009,0.058478367,0.000029054201,0.000005334586,0.00012113359,0.00031425562,0.81209666,0.0017603597,0.050644092,0.07517109,0.0007244042],"about_ca_topic_score_codex":0.000021495249,"about_ca_topic_score_gemma":0.0000048534253,"teacher_disagreement_score":0.85219175,"about_ca_system_score_codex":0.000016487653,"about_ca_system_score_gemma":0.0000155565,"threshold_uncertainty_score":0.14879404},"labels":[],"label_agreement":null},{"id":"W2008180805","doi":"10.1145/2766449","title":"Architecture-Aware Real-Time Compression of Execution Traces","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; TRACE (psycholinguistics); Debugging; Redundancy (engineering); Byte; Parallel computing; Embedded system; Computer architecture; Computer hardware; Operating system","score_opus":0.027889239593737836,"score_gpt":0.2796661311825929,"score_spread":0.2517768915888551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008180805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013129472,0.00009538501,0.9825201,0.0001650569,0.00072684814,0.00036964135,0.0000065289087,0.0013875051,0.0015994577],"genre_scores_gemma":[0.84563154,0.000014155652,0.15398858,0.000029613164,0.00006840221,0.000011673244,0.000007526938,0.00002166494,0.00022685826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973853,0.00043304006,0.0006795421,0.0005534998,0.0005995392,0.000349072],"domain_scores_gemma":[0.9974611,0.00035469353,0.0003973866,0.0012602885,0.00033259354,0.00019398484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076439185,0.00028122126,0.00045399723,0.0003854541,0.0002524525,0.00014716623,0.0013796065,0.00016397588,0.0000033090541],"category_scores_gemma":[0.000048449037,0.00026131622,0.00014245587,0.00069520227,0.00006758826,0.00022709371,0.00005131601,0.00027993368,0.000030515253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033018645,0.0001949192,0.000015535932,0.000056999277,0.000041892243,0.000005049527,0.0026833764,0.9744415,0.0012874055,0.0007647996,0.0009169472,0.019558527],"study_design_scores_gemma":[0.000687975,0.00035051582,0.00003904749,0.00041311412,0.000017467075,0.000068521724,0.00023751306,0.9893232,0.0073291017,0.0008475469,0.0003410333,0.00034498298],"about_ca_topic_score_codex":0.00017166858,"about_ca_topic_score_gemma":0.0000011954517,"teacher_disagreement_score":0.83250207,"about_ca_system_score_codex":0.00010321912,"about_ca_system_score_gemma":0.000118239084,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W2008515572","doi":"10.1145/1141277.1141492","title":"Branchless cycle prediction for embedded processors","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Branch predictor; Exploit; Inefficiency; Parallel computing; Computer security","score_opus":0.008573037986458986,"score_gpt":0.2419555119555355,"score_spread":0.23338247396907652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008515572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020646157,0.000019602587,0.9793573,0.00035558754,0.00008560082,0.00017811972,0.000001472664,0.0012768499,0.01666086],"genre_scores_gemma":[0.49905378,0.0000019554889,0.49944696,0.00022593826,0.00004586531,0.000036846897,0.0000068477634,0.0000048443385,0.0011769508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942863,0.000016289741,0.00013514466,0.00019898321,0.00009339949,0.00012757798],"domain_scores_gemma":[0.9996399,0.000030202953,0.00004468963,0.00017549783,0.0000893597,0.00002034547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017218576,0.000063542546,0.000066173794,0.000054611428,0.000088220295,0.00009996304,0.0002728845,0.00003470901,0.0000026066252],"category_scores_gemma":[0.00001318178,0.000057102698,0.000032490683,0.00016995204,0.000009757235,0.00027775668,0.00004112839,0.000031879903,0.0000040690666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000982525,0.00019289038,0.0006346266,0.000044579785,0.0000086956015,7.919149e-7,0.00032435457,0.16336827,0.0005052319,0.77212954,0.049255937,0.013525276],"study_design_scores_gemma":[0.00021664068,0.000037436075,0.0006949061,0.0000073743236,0.0000013128732,0.0000025410347,0.0000029143657,0.95773655,0.008797638,0.03002509,0.0023913183,0.0000862852],"about_ca_topic_score_codex":0.000016747494,"about_ca_topic_score_gemma":0.0000040371165,"teacher_disagreement_score":0.79436827,"about_ca_system_score_codex":0.000011417337,"about_ca_system_score_gemma":0.000026530548,"threshold_uncertainty_score":0.23285805},"labels":[],"label_agreement":null},{"id":"W2008590694","doi":"10.1007/s001650200032","title":"A Refinement Calculus for Shared-Variable Parallel and Distributed Programming","year":2002,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Concurrency; Programming language; Process calculus; Software portability; Theoretical computer science; Communicating sequential processes; Operational semantics; Semantics (computer science)","score_opus":0.01856906399011817,"score_gpt":0.24645460133552305,"score_spread":0.22788553734540487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008590694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022094138,0.00024190357,0.9945876,0.00024439962,0.00008332812,0.0003598894,0.0000071017594,0.0004268461,0.0018395088],"genre_scores_gemma":[0.51222765,0.0000052552386,0.4876378,0.000045319972,0.00003551678,0.000009108047,0.0000099914205,0.000006145653,0.000023188442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986163,0.00002466044,0.00040371108,0.00031563014,0.00019163705,0.0004480541],"domain_scores_gemma":[0.9991227,0.00011112044,0.00023638392,0.00027253863,0.00016791321,0.00008933804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037019225,0.0001604783,0.00024848554,0.00009384277,0.00027384033,0.0001456451,0.00045324475,0.000058441285,0.000008397307],"category_scores_gemma":[0.000083624065,0.00015437318,0.00006251102,0.00033005228,0.000036595273,0.0003686034,0.00040113597,0.000095872565,0.0000019830609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022018745,0.00032754868,0.0004243309,0.00032615868,0.00008291712,0.000008513386,0.0016587191,0.07952551,0.000118655946,0.7185144,0.0035381697,0.19545309],"study_design_scores_gemma":[0.0005650658,0.00024797983,0.0003199154,0.00008952576,0.000007149067,0.000017431174,0.000016730488,0.9912839,0.00026227647,0.0026406678,0.004358026,0.00019132205],"about_ca_topic_score_codex":0.000015486505,"about_ca_topic_score_gemma":8.9899027e-7,"teacher_disagreement_score":0.9117584,"about_ca_system_score_codex":0.00003069422,"about_ca_system_score_gemma":0.000020006402,"threshold_uncertainty_score":0.6295155},"labels":[],"label_agreement":null},{"id":"W2008781896","doi":"10.1155/2011/514581","title":"The Potential for a GPU-Like Overlay Architecture for FPGAs","year":2011,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Parallel computing; Field-programmable gate array; Stratix; Pipeline (software); Multithreading; Computer architecture; Architecture; Thread (computing); Embedded system; Operating system","score_opus":0.021876579977143176,"score_gpt":0.2713674640430026,"score_spread":0.24949088406585943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008781896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017032117,0.00025057732,0.9914883,0.0014268953,0.0032326903,0.00021316456,0.0000035813516,0.00007604745,0.0016055622],"genre_scores_gemma":[0.447387,0.00004462619,0.5510388,0.00045966386,0.000693452,0.00000737461,0.000002491088,0.000016777272,0.00034983733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986005,0.000061374245,0.0005834128,0.00019337471,0.00030255117,0.00025883282],"domain_scores_gemma":[0.99721247,0.00054330175,0.0007321044,0.00018853658,0.0012520298,0.00007155026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386907,0.00013406941,0.00018347336,0.00016524032,0.00028843278,0.00030080654,0.0018695059,0.000057346082,0.0000063256],"category_scores_gemma":[0.00022754591,0.000098490746,0.0002746571,0.00009409805,0.000037975642,0.00022719131,0.00008261516,0.00018263786,0.0000017565102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046873928,0.00017316976,0.000086936874,0.00003108348,0.00061922526,0.000035181467,0.0021077706,0.08476006,0.00097204745,0.052643172,0.03329974,0.8248029],"study_design_scores_gemma":[0.001660001,0.0004672587,0.00025307326,0.00021486056,0.000025347532,0.00075077725,0.00006946523,0.8308161,0.008699356,0.064578034,0.092148826,0.0003168992],"about_ca_topic_score_codex":0.000005806863,"about_ca_topic_score_gemma":0.0000018964809,"teacher_disagreement_score":0.82448596,"about_ca_system_score_codex":0.000055507844,"about_ca_system_score_gemma":0.00012572722,"threshold_uncertainty_score":0.4016336},"labels":[],"label_agreement":null},{"id":"W2008794387","doi":"10.1109/cluster.2012.75","title":"Designing an Offloaded Nonblocking MPI_Allgather Collective Using CORE-Direct","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Innovation Trust","keywords":"Computer science; Core (optical fiber); Distributed computing; Multi-core processor; Computer network; Parallel computing; Telecommunications","score_opus":0.07789287315419005,"score_gpt":0.31087165712033277,"score_spread":0.23297878396614272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008794387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017300831,0.000079563855,0.9576006,0.000018514578,0.00018419063,0.00014421876,1.745515e-7,0.0010856749,0.023586258],"genre_scores_gemma":[0.4721884,0.0000011767379,0.5272598,0.00017900475,0.000060682338,0.000003572359,4.4026362e-7,0.000009480547,0.00029740113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880624,0.00012426938,0.00018795441,0.00028193946,0.00019381089,0.00040579546],"domain_scores_gemma":[0.9991865,0.00009784537,0.00009780535,0.00036712442,0.000107097316,0.00014360275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057959935,0.00014938523,0.00016528217,0.00015119422,0.000294582,0.00014746578,0.00049365254,0.000070706425,0.000023308292],"category_scores_gemma":[0.000044646924,0.00013777603,0.00004638924,0.0005472423,0.000025881322,0.0008117507,0.00016621966,0.00010088078,0.000013060455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014123289,0.0032410226,0.13016456,0.000093709175,0.0006255966,0.000060436338,0.07994018,0.2800309,0.25211528,0.13913858,0.0173929,0.09705561],"study_design_scores_gemma":[0.00016025011,0.00006158452,0.00045940423,0.00002160823,0.0000067799706,0.00002247782,0.000036589016,0.9369625,0.061073806,0.000663653,0.00024478743,0.00028657992],"about_ca_topic_score_codex":0.00005451406,"about_ca_topic_score_gemma":0.0000014158352,"teacher_disagreement_score":0.6569316,"about_ca_system_score_codex":0.00011315826,"about_ca_system_score_gemma":0.00009353866,"threshold_uncertainty_score":0.5618344},"labels":[],"label_agreement":null},{"id":"W2008830761","doi":"10.1002/spe.774","title":"<i>Ablego</i>: a function outlining and partial inlining framework","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Partial evaluation; Host (biology); Programming language; Function (biology); Code (set theory); Optimizing compiler; Program transformation; Heuristics; Transformation (genetics); Set (abstract data type); Syntax; Operating system; Artificial intelligence","score_opus":0.013066999549225349,"score_gpt":0.28133394778908777,"score_spread":0.2682669482398624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008830761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013195967,0.00080300524,0.9836921,0.00066714006,0.00025048686,0.00007030295,3.3279005e-7,0.00060697197,0.00071370194],"genre_scores_gemma":[0.52263886,0.00008033382,0.47624964,0.0008450188,0.00011761351,0.000018224604,0.0000010102741,0.000005885495,0.00004340844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892825,0.00007229527,0.00020560467,0.00040127544,0.00017626824,0.00021633085],"domain_scores_gemma":[0.998914,0.0005346158,0.00014670678,0.00024036915,0.00009759149,0.0000667316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031106736,0.00012294453,0.00011647939,0.00005795922,0.00039392975,0.0004837382,0.00018826064,0.00007518332,0.0000033428812],"category_scores_gemma":[0.0007712397,0.00012150023,0.000017209959,0.00019852392,0.0000793112,0.0015989036,0.0002015188,0.00019192856,0.0000046762784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019425504,0.0003696008,0.023261582,0.000073175506,0.000046619432,0.00009723774,0.064288065,0.0034899223,0.00020950989,0.59057283,0.0026777622,0.31471944],"study_design_scores_gemma":[0.001605018,0.001430775,0.004607493,0.00058123766,0.000110961395,0.00066392304,0.00868809,0.34505346,0.0027115121,0.074994415,0.5568926,0.0026605378],"about_ca_topic_score_codex":0.00010628932,"about_ca_topic_score_gemma":0.0000010700048,"teacher_disagreement_score":0.55421484,"about_ca_system_score_codex":0.000009145432,"about_ca_system_score_gemma":0.000031069645,"threshold_uncertainty_score":0.49546352},"labels":[],"label_agreement":null},{"id":"W2009035836","doi":"10.1109/tcsii.2007.892215","title":"Real-Time Dynamic Voltage Loop Scheduling for Multi-Core Embedded Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Dynamic voltage scaling; Dynamic priority scheduling; Scheduling (production processes); Real-time computing; Energy consumption; Voltage; Parallel computing; Embedded system; Engineering; Mathematical optimization; Schedule; Operating system; Electrical engineering; Mathematics","score_opus":0.03399654071696992,"score_gpt":0.28242117727539884,"score_spread":0.24842463655842892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009035836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015939415,0.0007453838,0.98169094,0.000008192932,0.00015480384,0.0004160276,0.000023206056,0.0004804533,0.00054155017],"genre_scores_gemma":[0.99455845,0.00003547462,0.004251106,0.000020561749,0.000045980923,0.000025805683,0.0000068875206,0.000024403082,0.0010313529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982383,0.000025505013,0.0005217513,0.0005661908,0.00024126635,0.00040693663],"domain_scores_gemma":[0.9990261,0.00017500606,0.00020359865,0.00017618612,0.00021411141,0.0002049769],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006901659,0.00026705308,0.00036362643,0.00027817523,0.00093856675,0.0011187585,0.00020957772,0.00015777965,5.2849083e-7],"category_scores_gemma":[0.0000075330154,0.00024282241,0.00007804057,0.00033329564,0.00007582493,0.00082314626,0.000006738653,0.00016190809,0.0000018184423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004633483,0.0004528737,0.00007545976,0.0011018945,0.00012375272,0.00003462277,0.001930256,0.14645518,0.013122775,0.0018683305,0.00003429036,0.8347542],"study_design_scores_gemma":[0.00047736012,0.00020275188,0.00001840905,0.00039477128,0.000017900795,0.00009009281,0.00020007195,0.9978422,0.00028973527,0.00009854247,0.000052153315,0.00031603646],"about_ca_topic_score_codex":0.00003150029,"about_ca_topic_score_gemma":0.0000028088568,"teacher_disagreement_score":0.97861904,"about_ca_system_score_codex":0.00005373554,"about_ca_system_score_gemma":0.0000721777,"threshold_uncertainty_score":0.99991816},"labels":[],"label_agreement":null},{"id":"W2009617869","doi":"10.1145/1356058.1356077","title":"Removing redundancy via exception check motion","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Redundancy (engineering); PowerPC; Compiler; Just-in-time compilation; Parallel computing; Pascal (unit); Programming language; IBM; Operating system; Software","score_opus":0.023215375489472508,"score_gpt":0.24292026379062753,"score_spread":0.21970488830115503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009617869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065114326,0.000028504748,0.97494745,0.00033490337,0.0001408019,0.000066547065,4.903656e-8,0.0013025451,0.016667739],"genre_scores_gemma":[0.6194239,0.000026995702,0.37888303,0.0001546137,0.000044437373,0.0000024592064,0.0000014346053,0.000003872023,0.0014592003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992465,0.000040201212,0.0001616694,0.0002459889,0.00015739087,0.00014825816],"domain_scores_gemma":[0.99947524,0.000014527154,0.00006085937,0.00033044047,0.00007281138,0.000046117326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015719725,0.000078953286,0.00007841733,0.000090093235,0.00020548093,0.00004219678,0.0003310649,0.000048940856,0.00002547426],"category_scores_gemma":[0.000021460008,0.00007554057,0.000039233033,0.00027901956,0.00002271228,0.0003964389,0.00010208077,0.00007053693,0.00007684745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014130776,0.00045054255,0.0072787474,0.00004410649,0.000032357664,0.0000839882,0.0040977043,0.028115503,0.014632195,0.090308055,0.061772168,0.7931705],"study_design_scores_gemma":[0.00019467491,0.00006104564,0.011671681,0.000016815255,0.0000014866481,0.00017223391,0.0000035553937,0.9655011,0.011921678,0.008395156,0.0017992002,0.00026136643],"about_ca_topic_score_codex":0.000025554342,"about_ca_topic_score_gemma":8.234516e-7,"teacher_disagreement_score":0.9373856,"about_ca_system_score_codex":0.00003439805,"about_ca_system_score_gemma":0.000020623647,"threshold_uncertainty_score":0.3080455},"labels":[],"label_agreement":null},{"id":"W2009777616","doi":"10.1145/1131322.1131333","title":"K42","year":2006,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Implementation; Modular design; Flexibility (engineering); Distributed computing; Resource (disambiguation); Computer architecture; Rapid prototyping; Embedded system; Operating system; Software engineering; Computer network; Engineering","score_opus":0.020228460159780772,"score_gpt":0.2788179462156452,"score_spread":0.25858948605586446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009777616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013625639,0.14913979,0.8297876,0.0016014229,0.0004305747,0.0007301687,0.0000012230691,0.0012955877,0.016877389],"genre_scores_gemma":[0.26704317,0.012766926,0.7093975,0.003494263,0.00076856033,0.0003545077,0.00003475323,0.00006262786,0.006077679],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982252,0.00025686692,0.00060415023,0.00039232563,0.0002645975,0.0002568677],"domain_scores_gemma":[0.9982587,0.00012146939,0.00018838586,0.0012013967,0.00017854196,0.00005152515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087266945,0.00017933614,0.0003767608,0.00005202672,0.00021164007,0.00034902088,0.0014327612,0.000052832867,0.000007725125],"category_scores_gemma":[0.00031369872,0.00014798615,0.000080517915,0.0004692143,0.00001606124,0.0003041013,0.00032597012,0.0001189334,0.00012165154],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1230147e-7,0.00022260769,0.0016931315,0.006733667,0.00005320884,0.00010135526,0.0001499717,0.02813052,0.00066528574,0.33851066,0.5644183,0.05932058],"study_design_scores_gemma":[0.0005896508,0.0002483304,0.0003164409,0.024270084,0.000052617,0.00043701084,0.000012098595,0.4297677,0.0008853121,0.002010133,0.5395395,0.0018711294],"about_ca_topic_score_codex":0.00019297136,"about_ca_topic_score_gemma":0.0000015046483,"teacher_disagreement_score":0.40163717,"about_ca_system_score_codex":0.00003739499,"about_ca_system_score_gemma":0.00005473385,"threshold_uncertainty_score":0.60346997},"labels":[],"label_agreement":null},{"id":"W2010556217","doi":"10.1142/s0129054111008556","title":"BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES","year":2011,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Speedup; Matrix multiplication; Computation; Computer science; Parallel computing; Univariate; Multiplication algorithm; Symbolic computation; Bivariate analysis; Polynomial; Fast Fourier transform; Mathematics; Arithmetic; Algorithm; Combinatorics; Multivariate statistics","score_opus":0.0428232199411026,"score_gpt":0.3180081989553516,"score_spread":0.275184979014249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010556217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03666643,0.000013124806,0.96078247,0.00036916297,0.0015281537,0.0000730032,0.0000015308638,0.000057002533,0.0005091396],"genre_scores_gemma":[0.5400647,0.000010428022,0.45970795,0.0001195984,0.00008284048,0.0000011312558,5.426343e-7,0.0000026180849,0.000010221302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981974,0.000047945687,0.00059249514,0.00024350274,0.00076425786,0.00015443616],"domain_scores_gemma":[0.99674636,0.00010829121,0.00074347726,0.00037288867,0.0019343871,0.000094570125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007333399,0.000111449284,0.00015811279,0.0007866977,0.00012481584,0.00018067707,0.0031388686,0.000033847762,0.000009153184],"category_scores_gemma":[0.00017280663,0.00009984373,0.00010100209,0.0005096654,0.00026274062,0.0012042559,0.00028165488,0.00012708716,0.000011042892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003899811,0.0038193366,0.0152182,0.00001914036,0.00033495546,0.00008275551,0.010820617,0.07210596,0.023968717,0.18710415,0.0045714527,0.68156475],"study_design_scores_gemma":[0.0013943373,0.0006304096,0.07519676,0.00015603169,0.000009154347,0.00020056096,0.000014686004,0.85345006,0.064898595,0.002927197,0.0008305003,0.0002917281],"about_ca_topic_score_codex":0.000018082332,"about_ca_topic_score_gemma":0.0000014299884,"teacher_disagreement_score":0.78134406,"about_ca_system_score_codex":0.00010221834,"about_ca_system_score_gemma":0.0003202995,"threshold_uncertainty_score":0.5832851},"labels":[],"label_agreement":null},{"id":"W2010899300","doi":"10.1145/514144.514743","title":"Using the Alfa-1 simulated processor for educational purposes","year":2001,"lang":"en","type":"article","venue":"Journal on Educational Resources in Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; DEVS; Hierarchy; Formalism (music); Architecture; Software engineering; Component (thermodynamics); Computer architecture; Programming language; Simulation; Modeling and simulation","score_opus":0.0540655201251681,"score_gpt":0.3714680068030576,"score_spread":0.3174024866778895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010899300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2777903,0.00050188776,0.6921844,0.026481688,0.0009965815,0.00040083608,0.0000011612763,0.00008801401,0.0015551316],"genre_scores_gemma":[0.85493,0.00002420238,0.14190346,0.0013773051,0.0012936037,0.0000073806823,0.0000037740685,0.00001740985,0.00044286047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981144,0.00015952441,0.00056910794,0.00032952658,0.00045598793,0.0003714675],"domain_scores_gemma":[0.99672484,0.0020027282,0.00045620117,0.00027036277,0.0004416081,0.000104281855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011518237,0.00018265353,0.00017908169,0.0003633052,0.00086914893,0.00052487786,0.0011716415,0.000069263195,0.00002501695],"category_scores_gemma":[0.00081063237,0.00014072732,0.0001056351,0.0007906329,0.00005593467,0.0002832346,0.00012137402,0.00039014808,0.0000065888707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029087363,0.00035316392,0.006972087,0.000013661882,0.000024901015,0.0000023365399,0.001803015,0.9579326,0.00004282851,0.021075407,0.0024273007,0.009323597],"study_design_scores_gemma":[0.00036173197,0.000078622186,0.0066415872,0.00020133109,0.000005798826,0.00029879546,0.00007436473,0.9401936,0.00005545137,0.0377711,0.01411225,0.00020540343],"about_ca_topic_score_codex":0.000008975093,"about_ca_topic_score_gemma":0.0000013025386,"teacher_disagreement_score":0.5771397,"about_ca_system_score_codex":0.0002445649,"about_ca_system_score_gemma":0.0005308016,"threshold_uncertainty_score":0.6684879},"labels":[],"label_agreement":null},{"id":"W2010948088","doi":"10.1145/2641361.2641377","title":"The Ultrasmall soft processor","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Computer science; Embedded system; Implementation; Key (lock); Multi-core processor; Processor design; Computer architecture; Computer hardware; Core (optical fiber); Parallel computing; Operating system; Telecommunications; Software engineering","score_opus":0.010437208614439171,"score_gpt":0.23601736829508338,"score_spread":0.2255801596806442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010948088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027463562,0.00017956198,0.97697675,0.016442385,0.00038015094,0.00064598146,6.3113646e-7,0.0012800538,0.001348129],"genre_scores_gemma":[0.12983887,0.00005189092,0.864713,0.004057652,0.0005457712,0.00017184793,0.000004898645,0.000034315006,0.0005817233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974302,0.00023710518,0.00042357584,0.0006852727,0.0004962897,0.000727566],"domain_scores_gemma":[0.9962885,0.0011748293,0.00015875473,0.0018986638,0.00025826975,0.00022099348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036767023,0.00032724775,0.0002487057,0.00014655486,0.00065370207,0.0010049407,0.0050711627,0.000100664736,0.0000130698845],"category_scores_gemma":[0.00023791207,0.00021133845,0.00014121828,0.00056503335,0.00014706748,0.00031800137,0.0014610144,0.0005310627,0.00017540794],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004782248,0.000053874464,0.00036728263,0.000017470651,0.00003467928,0.000005766184,0.0011680716,0.012014963,0.00022727769,0.0034114516,0.039698537,0.94299585],"study_design_scores_gemma":[0.0008119402,0.000557951,0.0051343846,0.00009194238,0.000010989557,0.00020807059,0.000018205223,0.6349939,0.0028799619,0.17069432,0.18356067,0.0010376216],"about_ca_topic_score_codex":0.00008509484,"about_ca_topic_score_gemma":0.000023760986,"teacher_disagreement_score":0.94195825,"about_ca_system_score_codex":0.00003312787,"about_ca_system_score_gemma":0.00011568987,"threshold_uncertainty_score":0.9690667},"labels":[],"label_agreement":null},{"id":"W2011153745","doi":"10.1145/1059579.1059591","title":"Catenation and specialization for Tcl virtual machine performance","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bytecode; Computer science; Parallel computing; Opcode; Operating system; Compiler; Virtual machine; Machine code; Just-in-time compilation; Cache; Overhead (engineering); Code (set theory); Context (archaeology); Compile time; Programming language","score_opus":0.012411038708327734,"score_gpt":0.23841569937668688,"score_spread":0.22600466066835914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011153745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009503586,0.000018859233,0.98775697,0.00062460307,0.00008020945,0.00012683141,4.7378563e-7,0.0003178208,0.0015706331],"genre_scores_gemma":[0.7056386,0.000032254662,0.29387528,0.00020307412,0.000031492673,0.000006707571,0.0000061385776,0.0000030551223,0.00020341594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958915,0.000006652055,0.0000990646,0.00014954495,0.000071240735,0.00008433028],"domain_scores_gemma":[0.9997551,0.000013807595,0.000036106187,0.0001037581,0.00006594239,0.000025280211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011754602,0.00005448976,0.00005221173,0.00006427475,0.00012254725,0.000075182004,0.00014125586,0.000026622489,0.0000018443257],"category_scores_gemma":[0.000017198769,0.000048186266,0.000011663565,0.0001264322,0.000013467456,0.00029580825,0.000046440233,0.000022258882,0.000002766552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011217702,0.00006455686,0.0009276272,0.000020044768,0.000007365563,4.810112e-7,0.0007215259,0.08822457,0.00043187072,0.8002788,0.0010382616,0.1082737],"study_design_scores_gemma":[0.00047403522,0.00016431088,0.002490139,0.000009677053,0.0000016466834,0.0000063573316,0.0000024808626,0.9752422,0.01325337,0.0067595337,0.001475664,0.00012056701],"about_ca_topic_score_codex":0.000010715518,"about_ca_topic_score_gemma":0.0000037768039,"teacher_disagreement_score":0.88701767,"about_ca_system_score_codex":0.000021191596,"about_ca_system_score_gemma":0.000021112151,"threshold_uncertainty_score":0.1964979},"labels":[],"label_agreement":null},{"id":"W2011384897","doi":"10.1145/1387673.1387677","title":"Two-dimensional bidirectional object layout","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Israel Science Foundation","keywords":"Computer science; Compiler; Scheme (mathematics); Programming language; Benchmark (surveying); Identifier; Bytecode; Inheritance (genetic algorithm); Field (mathematics); Parallel computing; Theoretical computer science; Virtual machine","score_opus":0.023561644945106923,"score_gpt":0.28563738714632797,"score_spread":0.26207574220122104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011384897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037423093,0.0010403043,0.95884377,0.00025883765,0.00042261012,0.00027192195,0.000004468902,0.0011410036,0.000593989],"genre_scores_gemma":[0.86379266,0.000028050468,0.13487512,0.00008026658,0.000059996695,0.000051690797,0.0000040813593,0.000010801915,0.0010973591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989111,0.000084191495,0.00020559457,0.00033181545,0.0002522496,0.0002150558],"domain_scores_gemma":[0.99925345,0.00012626454,0.00006345426,0.00039972126,0.00006918511,0.00008795105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021859279,0.0001411995,0.00016043209,0.00015671608,0.0004874867,0.00012789643,0.0003008251,0.000060905695,0.0000057706247],"category_scores_gemma":[0.000018500092,0.00012295177,0.00006550773,0.00027920073,0.000052258572,0.00016804309,0.000016368678,0.00015195883,0.000012358803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007395089,0.0010931327,0.0022694613,0.00016857297,0.00038433663,0.00040028643,0.007130543,0.30552202,0.00085484673,0.011154089,0.0023066008,0.66864216],"study_design_scores_gemma":[0.003762127,0.0016443281,0.0028308996,0.0005675415,0.00008360259,0.0071283765,0.0013028085,0.9376305,0.0054630754,0.0008042194,0.036326658,0.00245591],"about_ca_topic_score_codex":0.00028303865,"about_ca_topic_score_gemma":0.0000066579987,"teacher_disagreement_score":0.8263695,"about_ca_system_score_codex":0.00002501338,"about_ca_system_score_gemma":0.00003893624,"threshold_uncertainty_score":0.50138277},"labels":[],"label_agreement":null},{"id":"W2011658462","doi":"10.1145/367845.368026","title":"On the predictability of Java byte codes (abstract) (poster session)","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Predictability; Byte; Java; Control flow; Operating system; Code (set theory); Compiler; Programming language; Session (web analytics); Parallel computing; Java concurrency; Real time Java","score_opus":0.01594325946509372,"score_gpt":0.2530294503516643,"score_spread":0.23708619088657057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011658462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22604185,0.000026102962,0.5144154,0.002982439,0.00008998162,0.00027330464,0.0000031816903,0.00072305254,0.2554447],"genre_scores_gemma":[0.9742061,0.000010752188,0.023845188,0.0006932683,0.000011876548,0.0000046710543,8.10947e-7,0.0000030987103,0.0012242635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992083,0.000067684356,0.00020749142,0.00019881815,0.00019783959,0.00011990801],"domain_scores_gemma":[0.9990081,0.00028036875,0.000054536085,0.00056500314,0.000058009424,0.000033939963],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036950203,0.00008001608,0.00009737776,0.000027045704,0.00008764363,0.000048961483,0.000634582,0.00003991346,0.0009288638],"category_scores_gemma":[0.000040455096,0.000045613484,0.000046089932,0.00015582239,0.000056260844,0.00013936692,0.00007464658,0.00009118144,0.000046495923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001623836,0.0016137996,0.0072879633,0.00009024068,0.00009104752,0.000010368423,0.0036094135,0.057109535,0.0011693861,0.27483025,0.17589736,0.47812825],"study_design_scores_gemma":[0.0008517782,0.0007530934,0.096348435,0.00027643307,0.000013422154,0.000020031344,0.00004512457,0.70465505,0.13677579,0.0493243,0.010143856,0.0007927009],"about_ca_topic_score_codex":0.000022592125,"about_ca_topic_score_gemma":0.0000012967972,"teacher_disagreement_score":0.74816424,"about_ca_system_score_codex":0.000010524146,"about_ca_system_score_gemma":0.000026964115,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W2012031157","doi":"10.1109/mcsoc.2015.42","title":"Lighting the Dark-Silicon 3D Chip Multi-processors by Exploiting Heterogeneity in Cache Hierarchy","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Exploit; Memory hierarchy; Cache; Thread (computing); Multi-core processor; Parallel computing; Computer architecture; Embedded system; Multithreading; Microarchitecture; CPU cache; Chip; Instruction set; Memory architecture; Operating system","score_opus":0.056647010247817146,"score_gpt":0.29512765766489724,"score_spread":0.23848064741708008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012031157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055344447,0.00038758517,0.93628687,0.0013937223,0.00009130712,0.00016931754,6.106306e-7,0.0006762486,0.0056499126],"genre_scores_gemma":[0.7511134,0.000014631578,0.24740018,0.001253049,0.000032881602,0.00002301144,0.0000026196133,0.000010808737,0.00014942006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.00023400915,0.00032843204,0.00041719075,0.00027561604,0.00035311835],"domain_scores_gemma":[0.9990319,0.00014917586,0.000116999705,0.00046174566,0.00012604706,0.000114131726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309841,0.00016288196,0.00016525941,0.000096551004,0.00017042902,0.00022039501,0.0011062332,0.000069278714,0.0000012071341],"category_scores_gemma":[0.0003408619,0.000116149036,0.000040141425,0.0005123637,0.000046256246,0.00045870326,0.0004245219,0.00017654605,0.000012162769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001123221,0.0024518445,0.06928506,0.00018619603,0.00019232731,0.00014317836,0.07603605,0.27020463,0.009453308,0.035365455,0.08145666,0.45511296],"study_design_scores_gemma":[0.00048171848,0.000047759648,0.00018774146,0.000030267944,0.0000020968378,0.0000142239205,0.00023623771,0.97646195,0.019856099,0.00037537876,0.0020458242,0.00026069602],"about_ca_topic_score_codex":0.00017393168,"about_ca_topic_score_gemma":0.000030132465,"teacher_disagreement_score":0.7062573,"about_ca_system_score_codex":0.00006414602,"about_ca_system_score_gemma":0.00006793993,"threshold_uncertainty_score":0.47364202},"labels":[],"label_agreement":null},{"id":"W2012096613","doi":"10.1145/1985782.1985790","title":"Mind the gap!","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Representation (politics); Software; Commodity; Software engineering; Design pattern; Software design pattern; Theoretical computer science; Programming language","score_opus":0.060836190944475406,"score_gpt":0.2572811523513214,"score_spread":0.19644496140684597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012096613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002888611,0.00001452298,0.80051225,0.00026549725,0.000050518138,0.00002766532,2.2493253e-8,0.00017305763,0.19866759],"genre_scores_gemma":[0.40135366,0.0000036596955,0.59526354,0.00053809345,0.000012851409,0.000002386257,7.5483605e-8,0.0000015579523,0.0028241775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996853,0.000021379405,0.000059620324,0.00009581275,0.00005887438,0.00007903602],"domain_scores_gemma":[0.9996233,0.000018435372,0.000019088353,0.00029670293,0.00002397489,0.00001850729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013311546,0.000034517354,0.000028543578,0.00001919146,0.0000654201,0.000035099172,0.0006016118,0.00001417447,0.00007383178],"category_scores_gemma":[0.00000776374,0.000019600027,0.000018037244,0.00011751202,0.000017286786,0.00008527018,0.000112345246,0.00003380706,0.0000921817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016757382,0.000060421753,0.0006995745,0.000001341269,0.00000971415,0.00000517337,0.0035007384,0.00013071585,0.00003487166,0.7986718,0.039501492,0.15738247],"study_design_scores_gemma":[0.00026058592,0.00017228669,0.0069442843,0.000012595004,0.000005477075,0.00005350584,0.00006778749,0.7801731,0.04594535,0.07221049,0.09367482,0.00047968625],"about_ca_topic_score_codex":0.00001623719,"about_ca_topic_score_gemma":0.0000011477867,"teacher_disagreement_score":0.7800424,"about_ca_system_score_codex":0.0000028043266,"about_ca_system_score_gemma":0.000010190497,"threshold_uncertainty_score":0.118484},"labels":[],"label_agreement":null},{"id":"W2012591111","doi":"10.1109/icpp.2013.43","title":"Parallel Radix Sort on the AMD Fusion Accelerated Processing Unit","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ontario Centres of Excellence; Astellas Pharma US","keywords":"Computer science; Parallel computing; sort; Sorting algorithm; Sorting; Overhead (engineering); Copying; Variable (mathematics); Computer hardware; Algorithm; Operating system; Database","score_opus":0.04718662582813582,"score_gpt":0.2741070293370866,"score_spread":0.22692040350895076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012591111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01215757,0.000029371493,0.94663996,0.0051666703,0.00005833598,0.00028404468,9.973193e-8,0.001075503,0.034588464],"genre_scores_gemma":[0.81212324,0.000022417793,0.18093981,0.003127628,0.000041973366,0.000045883276,0.000002808189,0.000010491594,0.0036857554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903804,0.00007843135,0.00018081658,0.00026763938,0.00021029661,0.00022479973],"domain_scores_gemma":[0.99920505,0.00007506446,0.000077866935,0.0004259625,0.00015739768,0.0000586779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022029791,0.00012758322,0.000097687225,0.00007385707,0.00033664732,0.00049585314,0.0008888889,0.00005406605,0.00019486727],"category_scores_gemma":[0.000028463224,0.000075063384,0.00003212048,0.0004595324,0.000032053627,0.0003704092,0.00018393595,0.0001470463,0.00025794844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016944156,0.0004335057,0.0013296613,0.00003198765,0.000035964622,0.000010492648,0.0019614357,0.046456672,0.0023431845,0.25680515,0.27007243,0.42050257],"study_design_scores_gemma":[0.0001258875,0.000055733995,0.0013969047,0.000027308282,0.0000012011785,0.000004320641,0.0000200971,0.9873475,0.0027939596,0.004379687,0.003680794,0.00016662304],"about_ca_topic_score_codex":0.00005952531,"about_ca_topic_score_gemma":0.000001355909,"teacher_disagreement_score":0.9408908,"about_ca_system_score_codex":0.000014625552,"about_ca_system_score_gemma":0.00004937291,"threshold_uncertainty_score":0.47815233},"labels":[],"label_agreement":null},{"id":"W2012604995","doi":"10.1145/1958746.1958815","title":"In search for contention-descriptive metrics in HPC cluster environment","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster (spacecraft); Workload; Shared resource; Distributed computing; Resource (disambiguation); Supercomputer; Set (abstract data type); Point (geometry); Interconnection; Computer cluster; Computer network; Operating system","score_opus":0.07606289269586249,"score_gpt":0.27408278077096965,"score_spread":0.19801988807510718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012604995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033671397,0.000024542356,0.99012923,0.00023311531,0.00006362633,0.00030465075,4.6797086e-7,0.00006843114,0.0058088046],"genre_scores_gemma":[0.47806385,0.000021015298,0.52057123,0.00030393014,0.0000062204117,0.000036991893,8.005912e-7,0.0000039906395,0.000991965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921197,0.000057780257,0.00019375628,0.00023733867,0.000111713875,0.00018746733],"domain_scores_gemma":[0.99964714,0.00006592781,0.000028663922,0.0001969157,0.000028694603,0.00003268483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051901216,0.00006842193,0.00009918081,0.0003312307,0.000025062323,0.000028602532,0.00035906665,0.000044332344,0.000022222528],"category_scores_gemma":[0.000019241925,0.00006276995,0.00003164696,0.000310514,0.000018824365,0.0002567119,0.0001525122,0.00007223226,0.000016054704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017491826,0.0022112522,0.0587771,0.00007399551,0.000049100177,0.000045257137,0.027999569,0.017279299,0.0005470856,0.8358537,0.013408651,0.043580048],"study_design_scores_gemma":[0.0011186012,0.00021173131,0.008233463,0.000017760658,0.000001472884,0.0000024086762,0.00015794187,0.9678866,0.010996295,0.010014793,0.0011262976,0.00023258787],"about_ca_topic_score_codex":0.00017762619,"about_ca_topic_score_gemma":0.00001976551,"teacher_disagreement_score":0.95060736,"about_ca_system_score_codex":0.0000825537,"about_ca_system_score_gemma":0.000016707592,"threshold_uncertainty_score":0.25596842},"labels":[],"label_agreement":null},{"id":"W2012630996","doi":"10.1145/2458523.2458525","title":"Reducing divergence in GPGPU programs with loop merging","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benchmark (surveying); Loop (graph theory); General-purpose computing on graphics processing units; Computer science; Parallel computing; CUDA; Divergence (linguistics); Inner loop; Program optimization; Software; Execution time; Computational science; Graphics; Operating system; Mathematics","score_opus":0.01545719645327505,"score_gpt":0.2381647673747142,"score_spread":0.22270757092143914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012630996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0540892,0.000030025461,0.9371854,0.00044452416,0.000044586,0.00019565271,1.5513505e-8,0.000631375,0.007379197],"genre_scores_gemma":[0.57078904,0.0000062032427,0.42854708,0.00008161224,0.0000072329735,0.000023748406,3.8178715e-7,0.0000033772894,0.0005413072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991811,0.000029595569,0.0001433882,0.00027528676,0.00014416674,0.0002264905],"domain_scores_gemma":[0.9995269,0.000017936607,0.0000450779,0.00028932607,0.00006885857,0.000051880612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013866439,0.0000866897,0.00008889015,0.000093991264,0.00006327989,0.00016374215,0.00049125927,0.000025954025,0.000026336915],"category_scores_gemma":[0.000009605501,0.000065281936,0.000015023577,0.00053318887,0.000022940272,0.0004625743,0.00016586714,0.0000805936,0.000040544925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000581484,0.0003370103,0.109798744,0.000037471447,0.000023342012,0.000035975154,0.0031548846,0.08471715,0.00078366935,0.045349196,0.00491325,0.7508435],"study_design_scores_gemma":[0.0001467576,0.000088727895,0.00488561,0.0000761959,8.4158796e-7,0.000009831014,0.000037373266,0.9909597,0.0023284755,0.0010451516,0.00020461196,0.00021670865],"about_ca_topic_score_codex":0.00061140215,"about_ca_topic_score_gemma":0.000012149901,"teacher_disagreement_score":0.90624255,"about_ca_system_score_codex":0.000021099717,"about_ca_system_score_gemma":0.000025980566,"threshold_uncertainty_score":0.266212},"labels":[],"label_agreement":null},{"id":"W2012655764","doi":"10.1145/1929501.1929510","title":"A generative geometric kernel","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Kernel (algebra); Computer science; Code generation; Generator (circuit theory); Programming language; Abstraction; Affine transformation; Algebra over a field; Code (set theory); Type (biology); Theoretical computer science; Mathematics; Pure mathematics; Key (lock)","score_opus":0.04504086511259816,"score_gpt":0.2542387251897837,"score_spread":0.20919786007718552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012655764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042469957,0.000036957485,0.8713093,0.00006167177,0.000062876396,0.000038969396,8.154349e-8,0.00062605477,0.1274394],"genre_scores_gemma":[0.29798537,0.000008637135,0.7001158,0.0003714051,0.000012516366,0.0000039953825,2.281103e-7,0.0000022672461,0.0014997602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995001,0.000024549237,0.00009334631,0.00017625361,0.00008639099,0.00011935987],"domain_scores_gemma":[0.9995937,0.000016090322,0.00003145036,0.00025626336,0.00005857294,0.000043968874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116095696,0.000058597856,0.000060661183,0.00016867493,0.000054730193,0.00004136029,0.000471974,0.000025601023,0.0000697209],"category_scores_gemma":[0.000019276287,0.000047877562,0.000025880381,0.00061822415,0.000012652773,0.00017731742,0.00014134802,0.000041129042,0.000089549554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035523403,0.00021180756,0.0022154837,0.000004401092,0.00002900899,0.00002074307,0.002552784,0.0005378896,0.0001196533,0.8676935,0.039551232,0.08705996],"study_design_scores_gemma":[0.0003956482,0.00029779348,0.010169082,0.000009217342,0.0000045207685,0.000034354394,0.000023602786,0.8412083,0.0943779,0.047443237,0.0054289866,0.0006073797],"about_ca_topic_score_codex":0.000030900283,"about_ca_topic_score_gemma":6.8502595e-7,"teacher_disagreement_score":0.8406704,"about_ca_system_score_codex":0.00000983755,"about_ca_system_score_gemma":0.00001804707,"threshold_uncertainty_score":0.19523902},"labels":[],"label_agreement":null},{"id":"W2012799680","doi":"10.1145/1188966.1188974","title":"Utilizing field usage patterns for Java heap space optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Jilin University","keywords":"Heap (data structure); Computer science; Java; Overhead (engineering); Distributed computing; Parallel computing; Operating system; Programming language","score_opus":0.017326397863011562,"score_gpt":0.26419263338931775,"score_spread":0.24686623552630618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012799680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030058416,0.00002934644,0.9825182,0.0018459744,0.00013788963,0.00019962786,0.0000010881618,0.00080307486,0.014164222],"genre_scores_gemma":[0.24714549,0.000009064402,0.75072867,0.0005701218,0.000071066876,0.000016034239,0.000008355867,0.000007577431,0.0014436332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991742,0.000026480322,0.00018856986,0.0002810677,0.00011665457,0.00021307291],"domain_scores_gemma":[0.99937266,0.00013443867,0.00006850352,0.00030601278,0.00008375282,0.00003462088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791805,0.000104401704,0.000104380204,0.0000867804,0.00013842163,0.00017435008,0.00038818343,0.000062535495,0.000025119743],"category_scores_gemma":[0.000030420104,0.00009925182,0.000056300538,0.0001745054,0.000007235832,0.00026195642,0.00010173367,0.000050863226,0.0000040695904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007025095,0.0000945795,0.0016782841,0.000031546817,0.0000080658365,0.000004187321,0.00010903378,0.7492379,0.0001268039,0.1938997,0.044611555,0.010191327],"study_design_scores_gemma":[0.00016311278,0.000062631785,0.000097611824,0.000014906418,0.0000019616846,0.0000040180485,0.000006868281,0.9865535,0.0087855365,0.0015217031,0.002643097,0.00014503754],"about_ca_topic_score_codex":0.00014809433,"about_ca_topic_score_gemma":0.000012731888,"teacher_disagreement_score":0.24684492,"about_ca_system_score_codex":0.000019471807,"about_ca_system_score_gemma":0.000020486612,"threshold_uncertainty_score":0.40473714},"labels":[],"label_agreement":null},{"id":"W2013002675","doi":"10.1109/icpp.2012.15","title":"Added Concurrency to Improve MPI Performance on Multicore","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Concurrency; Multi-core processor; Context switch; Implementation; Cache; Message Passing Interface; Distributed computing; Scheduling (production processes); Message passing; Context (archaeology); Synchronization (alternating current); Operating system; Programming language; Computer network; Channel (broadcasting)","score_opus":0.02158592680802049,"score_gpt":0.274961348347367,"score_spread":0.25337542153934656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013002675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036975496,0.00002451539,0.93714726,0.00029373154,0.0005426131,0.00017809957,6.7116866e-7,0.0007850515,0.02405258],"genre_scores_gemma":[0.78420293,0.0000050354015,0.21375042,0.0010151137,0.00007604147,0.000014428428,8.391231e-7,0.000004493706,0.00093070365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991869,0.000022839946,0.0001384212,0.00020403032,0.00014982048,0.00029802075],"domain_scores_gemma":[0.9993148,0.000042488304,0.000038408896,0.00039266853,0.000058397305,0.00015325504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018742023,0.00010424109,0.00009256663,0.00008132348,0.00008683376,0.00005435124,0.00048976386,0.000037417412,0.000025489497],"category_scores_gemma":[0.000038342903,0.00008503657,0.000028178189,0.00021414197,0.000010821092,0.00030870608,0.00016848654,0.00008350738,0.00035493245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023242535,0.00055855385,0.011351334,0.000038716247,0.000021955288,0.0000017256615,0.0033223908,0.005018961,0.002154092,0.13982336,0.06444606,0.7732396],"study_design_scores_gemma":[0.000467721,0.0005967104,0.011971606,0.00005086505,0.000003512555,0.000006025783,0.000014366065,0.8712896,0.093210295,0.00015357054,0.021644967,0.0005907509],"about_ca_topic_score_codex":0.000005335589,"about_ca_topic_score_gemma":1.9102421e-7,"teacher_disagreement_score":0.86627066,"about_ca_system_score_codex":0.000024277151,"about_ca_system_score_gemma":0.00001783184,"threshold_uncertainty_score":0.45620567},"labels":[],"label_agreement":null},{"id":"W2013174799","doi":"10.1145/2451436.2451440","title":"KFusion","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Modularity (biology); Compromise; Leverage (statistics); Kernel (algebra); Programming language; Distributed computing; Software engineering; Artificial intelligence","score_opus":0.010261961534681433,"score_gpt":0.228819200915176,"score_spread":0.21855723938049457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013174799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011550403,0.000008026628,0.91455275,0.00078237645,0.000042798467,0.00004368515,6.810126e-9,0.0007387267,0.0826766],"genre_scores_gemma":[0.35012153,0.0000037057562,0.64669055,0.00065991597,0.000009802293,0.000005076745,1.6496371e-7,0.0000012639315,0.0025080307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971926,0.000009960678,0.000052930463,0.00009113124,0.00005627822,0.0000704289],"domain_scores_gemma":[0.9997276,0.000011789196,0.00001227599,0.00018354713,0.0000375354,0.000027227452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040007726,0.000029340026,0.000028302315,0.000029547291,0.0000374662,0.00008533806,0.00028959452,0.0000146213115,0.00013142396],"category_scores_gemma":[0.000005137511,0.000022539862,0.000012112398,0.00010457356,0.0000047743756,0.0002138531,0.00010944736,0.000021550777,0.00046619974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1939485e-7,0.00004984419,0.000536972,0.0000029190471,0.0000034039922,0.0000010564113,0.00025005173,0.0010156687,0.0014717005,0.3679265,0.30071703,0.32802463],"study_design_scores_gemma":[0.00005261453,0.000021733043,0.0015141033,0.0000028797685,1.8890788e-7,0.0000034721668,0.000002870267,0.96869886,0.0049208025,0.017419862,0.0072724023,0.00009018583],"about_ca_topic_score_codex":0.000042407348,"about_ca_topic_score_gemma":2.0396996e-7,"teacher_disagreement_score":0.9676832,"about_ca_system_score_codex":0.000003859199,"about_ca_system_score_gemma":0.0000054885804,"threshold_uncertainty_score":0.599221},"labels":[],"label_agreement":null},{"id":"W2013594929","doi":"10.1145/2684746.2689083","title":"Design Space Exploration of L1 Data Caches for FPGA-Based Multiprocessor Systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MicroBlaze; Multiprocessing; Field-programmable gate array; Embedded system; Multi-core processor; Cache; Design space exploration; Computer architecture; Cache coherence; Parallel computing; Operating system; CPU cache; Cache algorithms","score_opus":0.30588507062098147,"score_gpt":0.3427127872554296,"score_spread":0.036827716634448115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013594929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028138247,0.00013258067,0.99813217,0.00047394892,0.00012592299,0.00041878183,0.0000040558502,0.0004245422,0.0002598779],"genre_scores_gemma":[0.25043395,0.0000021689448,0.74925363,0.00004194915,0.000023918663,0.000032318017,0.000022246586,0.0000058644678,0.0001839549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991034,0.00007916199,0.00021650373,0.00028986117,0.00018639173,0.00012465088],"domain_scores_gemma":[0.9985352,0.00017347297,0.0001497101,0.00072896085,0.0003506191,0.00006201449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009098636,0.00008751855,0.00014070676,0.00008326335,0.000044400815,0.000098589575,0.000982221,0.00004570954,3.2967498e-7],"category_scores_gemma":[0.00022156502,0.000074685864,0.000015808264,0.00021368281,0.000018040302,0.00084106793,0.00013607758,0.000028596316,0.0000031229915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029094297,0.00008984173,0.000021779442,0.00007538387,0.0000113667,5.205502e-7,0.0005229459,0.96217203,0.00020788351,0.008444913,0.025792547,0.0026317106],"study_design_scores_gemma":[0.00033644878,0.00010783053,0.0000011127281,0.000022756107,0.000004202022,5.776228e-7,0.00004862054,0.97306937,0.024746386,0.0005818633,0.0009852746,0.00009556182],"about_ca_topic_score_codex":0.000056064888,"about_ca_topic_score_gemma":0.0000022170805,"teacher_disagreement_score":0.2504058,"about_ca_system_score_codex":0.00001741673,"about_ca_system_score_gemma":0.00018676453,"threshold_uncertainty_score":0.30456012},"labels":[],"label_agreement":null},{"id":"W2014176254","doi":"10.1109/fpl.2009.5272551","title":"Data parallel FPGA workloads: Software versus hardware","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Embedded system; Scalability; Computer hardware; Exploit; Software; Overhead (engineering); Hardware architecture; Parallel computing; Computer architecture; Operating system","score_opus":0.06155595718575696,"score_gpt":0.30669558665411034,"score_spread":0.24513962946835338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014176254","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003307068,0.00036927976,0.983048,0.0018277987,0.00025396523,0.0000988026,0.0000045907805,0.0023934392,0.011971036],"genre_scores_gemma":[0.021479985,0.00014662341,0.9755941,0.001354361,0.00008653146,0.0000028251568,0.00004645777,0.0000067615424,0.0012823503],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.000044326447,0.00021119825,0.0005595744,0.00024855917,0.00029369647],"domain_scores_gemma":[0.9978172,0.000090370406,0.00006808093,0.0018423413,0.00007719724,0.00010482091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022975863,0.00015176061,0.00014965665,0.00008255218,0.00015100192,0.00025134825,0.0029315408,0.00007237696,0.000035556408],"category_scores_gemma":[0.00012788671,0.00013646547,0.0000399461,0.00037526453,0.00002009431,0.00070748606,0.00060225284,0.00013127437,0.00010692153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047849633,0.00016594579,0.00013313214,0.000005915796,0.000029076658,0.000033677214,0.00017857822,0.013622104,0.0000066676917,0.029529074,0.52344656,0.43280143],"study_design_scores_gemma":[0.0019191739,0.00047158197,0.001841596,0.00007429726,0.000015330395,0.000022061578,0.000023056471,0.7945126,0.0004276502,0.012469606,0.1872227,0.0010002917],"about_ca_topic_score_codex":0.000008434038,"about_ca_topic_score_gemma":0.0000033127926,"teacher_disagreement_score":0.7808905,"about_ca_system_score_codex":0.000023472598,"about_ca_system_score_gemma":0.000060656082,"threshold_uncertainty_score":0.55649006},"labels":[],"label_agreement":null},{"id":"W2014468639","doi":"10.1145/2019608.2019609","title":"Hybrid analytical modeling of pending cache hits, data prefetching, and MSHRs","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Superscalar; Cache; Parallel computing; Dram; Latency (audio); CAS latency; CPU cache; Operating system; Computer hardware; Semiconductor memory; Memory controller","score_opus":0.06709639629547699,"score_gpt":0.27660955102403134,"score_spread":0.20951315472855436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014468639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019221494,0.00009596426,0.9967412,0.00024081662,0.000043515083,0.0001359633,0.000022308563,0.00019474748,0.000603376],"genre_scores_gemma":[0.51665807,0.00016767772,0.48307374,0.00005477107,0.000006471827,0.0000030201522,0.00001254136,0.000007880773,0.00001582471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889123,0.00007671374,0.00025917075,0.00045601767,0.00015666115,0.00016020877],"domain_scores_gemma":[0.9988766,0.00007386521,0.00008352111,0.0008283288,0.000054568518,0.00008314615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023568496,0.00015140064,0.00017431212,0.00023206987,0.00019939733,0.00005986991,0.00067037373,0.00005874596,0.000015046772],"category_scores_gemma":[0.00004073054,0.00013948904,0.00002934091,0.00019605293,0.00005183773,0.0003198899,0.000087457825,0.0002040758,3.9491405e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019575047,0.000052097672,0.000025936024,0.000015861113,0.000024521101,0.0000012271414,0.0009031393,0.941057,0.000008367498,0.0005490313,0.000008388798,0.057334855],"study_design_scores_gemma":[0.00019568554,0.00008814411,0.000021888325,0.000040624625,0.00003303466,0.000031780346,0.000021865482,0.99667495,0.00042371044,0.0022957786,0.000027872922,0.00014464707],"about_ca_topic_score_codex":0.000040694562,"about_ca_topic_score_gemma":0.000008245207,"teacher_disagreement_score":0.51473594,"about_ca_system_score_codex":0.000009679955,"about_ca_system_score_gemma":0.00002944338,"threshold_uncertainty_score":0.5688198},"labels":[],"label_agreement":null},{"id":"W2014724071","doi":"10.1145/2482767.2482794","title":"Load balancing in a changing world","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computer and Network Systems; National Science Foundation","keywords":"Computer science; Distributed computing; Work (physics); Real-time computing; Computer engineering; Parallel computing","score_opus":0.01042522217067907,"score_gpt":0.2339495241426458,"score_spread":0.22352430197196674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014724071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002805523,0.000028489922,0.9139876,0.0007149255,0.00005562855,0.00008069484,1.2826161e-8,0.00049095857,0.08183618],"genre_scores_gemma":[0.64777935,0.0000022936426,0.34474418,0.00071440183,0.000015952219,0.000013687365,1.2851261e-7,0.00000265157,0.00672736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941516,0.000018867931,0.00010954616,0.00015456551,0.00010083812,0.0002009973],"domain_scores_gemma":[0.99968404,0.000029071898,0.000023050867,0.00019295416,0.00003977823,0.000031102307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001918281,0.000053724005,0.000066137916,0.0005141448,0.000034576846,0.000110118126,0.00031949315,0.00001530991,0.000050387236],"category_scores_gemma":[0.000015023394,0.000047718513,0.00001576482,0.0013605597,0.0000053505632,0.00029244387,0.00015418915,0.000056743094,0.00011458784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001890182,0.00016257045,0.02434367,0.000032150114,0.000012391509,0.000027746668,0.0052449415,0.024369009,0.0011492795,0.59946465,0.047677875,0.2975138],"study_design_scores_gemma":[0.00008708399,0.0000069758357,0.001399087,0.000023246934,1.6011052e-7,0.0000021236015,0.000010603474,0.99224734,0.0011391997,0.003361759,0.001621945,0.000100493184],"about_ca_topic_score_codex":0.00009820923,"about_ca_topic_score_gemma":0.000020946625,"teacher_disagreement_score":0.96787834,"about_ca_system_score_codex":0.00004212592,"about_ca_system_score_gemma":0.000022555216,"threshold_uncertainty_score":0.19459045},"labels":[],"label_agreement":null},{"id":"W2015827499","doi":"10.1109/rtas.2014.6925999","title":"PALLOC: DRAM bank-aware memory allocator for performance isolation on multicore platforms","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":236,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Dram; Computer science; Multi-core processor; Embedded system; Exploit; Isolation (microbiology); Allocator; Partition (number theory); Operating system; Shared memory; Dynamic random-access memory; Computer hardware; Semiconductor memory; Computer security","score_opus":0.016400956424749417,"score_gpt":0.24584198084259573,"score_spread":0.2294410244178463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015827499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026161429,0.0000055418304,0.9684428,0.0002641686,0.00022045043,0.00031696394,7.345925e-7,0.00094015466,0.0036477344],"genre_scores_gemma":[0.73789525,0.000005829196,0.26039892,0.0008321878,0.00007568339,0.000035486108,0.000009630236,0.000010992576,0.00073602423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891394,0.000015548749,0.00023944901,0.00036728164,0.00019857431,0.000265183],"domain_scores_gemma":[0.9990486,0.00015207862,0.00009956128,0.00049036223,0.00012941816,0.00007996436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035441233,0.00016108561,0.00015266961,0.00011597011,0.00022830075,0.000114458155,0.0005987885,0.00009233389,0.00001002197],"category_scores_gemma":[0.00005720046,0.00012945596,0.000065139524,0.00016199249,0.000022562761,0.0003831763,0.00009594438,0.000096626565,0.000044025346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012561801,0.00040018174,0.002913806,0.00022264553,0.000053926633,0.000001268562,0.0018367858,0.27539688,0.0005820201,0.1627372,0.02482586,0.5309038],"study_design_scores_gemma":[0.00037490198,0.0003099727,0.00097472,0.000028886374,0.0000023289767,0.0000016764016,0.0000072556245,0.98978835,0.005307022,0.0009777548,0.0020228133,0.0002043139],"about_ca_topic_score_codex":0.000005660078,"about_ca_topic_score_gemma":0.0000022480112,"teacher_disagreement_score":0.71439147,"about_ca_system_score_codex":0.000037586804,"about_ca_system_score_gemma":0.000031156433,"threshold_uncertainty_score":0.52790606},"labels":[],"label_agreement":null},{"id":"W2016563136","doi":"10.1145/2207222.2207225","title":"A unified optimizing compiler framework for different GPGPU architectures","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computing and Communication Foundations","keywords":"Computer science; Compiler; Parallel computing; General-purpose computing on graphics processing units; CUDA; Optimizing compiler; Kernel (algebra); Graphics; Memory hierarchy; Interprocedural optimization; Loop optimization; Programming language; Operating system; Cache","score_opus":0.02322804625764478,"score_gpt":0.2749521265641031,"score_spread":0.2517240803064583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016563136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082949945,0.00018856012,0.9953216,0.001944408,0.00028866177,0.0005311551,0.000023624192,0.00066115067,0.00021136862],"genre_scores_gemma":[0.30454716,0.00007646749,0.6944449,0.0006594191,0.00007601978,0.000096569216,0.000015407244,0.000025140795,0.00005888403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984522,0.00012227616,0.00030059402,0.00044252834,0.00022138722,0.0004610156],"domain_scores_gemma":[0.9983318,0.00056181697,0.0001245386,0.0007061387,0.000077396624,0.00019832287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019434451,0.00031001566,0.00027032377,0.00031988992,0.00053752976,0.00017201243,0.00058943225,0.0001751059,0.000020058871],"category_scores_gemma":[0.00007214954,0.00026586666,0.00012631693,0.00034729255,0.000063267165,0.0001682841,0.000037796086,0.00036955616,0.0000019125687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005430176,0.00014493248,0.000025292782,0.000022472774,0.000037275364,2.608222e-7,0.0011916541,0.92624646,0.000035875226,0.0073838667,0.000043727043,0.064813904],"study_design_scores_gemma":[0.0008367918,0.0003682714,0.00024385772,0.00013543667,0.000063222986,0.000043436085,0.00004906194,0.959689,0.004522659,0.031847823,0.0015346046,0.00066579063],"about_ca_topic_score_codex":0.0000031830484,"about_ca_topic_score_gemma":0.0000037499076,"teacher_disagreement_score":0.30371767,"about_ca_system_score_codex":0.000034939698,"about_ca_system_score_gemma":0.00002212698,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W2016579022","doi":"10.5555/2485288.2485613","title":"On the use of GP-GPUs for accelerating compute-intensive EDA applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Netlist; Computer science; Parallel computing; Computer architecture; Graphics; Massively parallel; Abstraction; CUDA; General-purpose computing on graphics processing units; Computational science; Embedded system; Computer graphics (images)","score_opus":0.08938137952176238,"score_gpt":0.28571128880456664,"score_spread":0.19632990928280425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016579022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010239838,0.0000058732808,0.99392724,0.0027463885,0.000045771332,0.000796915,0.0000011791504,0.00026966468,0.0011829542],"genre_scores_gemma":[0.19752051,0.0000030711326,0.7981607,0.0036120147,0.000028503679,0.00025156824,0.0000026019304,0.0000062151075,0.000414847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932027,0.00003348132,0.00020468861,0.00020133225,0.00010499061,0.00013523235],"domain_scores_gemma":[0.99782646,0.00090508425,0.00011716823,0.00046412824,0.0006551657,0.000031985197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010733988,0.00008410245,0.00010708147,0.00005142245,0.00016795167,0.00019594053,0.000567416,0.00003193496,0.000014361505],"category_scores_gemma":[0.00012402666,0.00005481282,0.000054766657,0.0001971562,0.000031146763,0.00021298937,0.00013992684,0.000062685955,0.000021138474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014567981,0.00004438889,0.000028457625,0.000007134187,0.000013992186,7.122869e-8,0.00018851578,0.02607476,0.00024503793,0.83489573,0.114812784,0.023687683],"study_design_scores_gemma":[0.00007605044,0.00006285321,0.00006836119,0.000012162962,0.00000160057,0.0000012991859,0.000016463766,0.97800505,0.005945449,0.011831278,0.0038955938,0.00008382799],"about_ca_topic_score_codex":0.00005679285,"about_ca_topic_score_gemma":0.0000012380427,"teacher_disagreement_score":0.9519303,"about_ca_system_score_codex":0.000010762769,"about_ca_system_score_gemma":0.00002242015,"threshold_uncertainty_score":0.22352019},"labels":[],"label_agreement":null},{"id":"W2016671287","doi":"10.1145/1321631.1321678","title":"Testing concurrent programs using value schedules","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Debugging; Concurrency; Nondeterministic algorithm; Thread (computing); Programming language; Partial order reduction; Java; Model checking; Schedule; Parallel computing; Theoretical computer science; Operating system","score_opus":0.07409455849239938,"score_gpt":0.32319332009733753,"score_spread":0.24909876160493816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016671287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016805641,0.00006521107,0.97568667,0.000039725768,0.00016414684,0.00010679816,4.3238842e-8,0.0012781046,0.005853686],"genre_scores_gemma":[0.39643577,4.62168e-7,0.6034282,0.00007824918,0.00003257864,7.91958e-7,3.9086152e-7,0.0000034207196,0.000020140384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991024,0.000024408584,0.00020210071,0.00023452584,0.0001674318,0.00026912417],"domain_scores_gemma":[0.99941945,0.000082419174,0.00007325585,0.00022778881,0.000121368896,0.00007571041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005839719,0.00009237174,0.000087047316,0.000082111896,0.00013284304,0.00015091081,0.00042706382,0.00003881457,0.0000019217239],"category_scores_gemma":[0.00006818306,0.00008164384,0.000029616644,0.00047826403,0.00002994148,0.00018908628,0.00018620605,0.000080527614,0.000007833686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.6948527e-7,0.0000972005,0.006572638,0.000011222167,0.0000077855275,0.000011180732,0.000117214186,0.0076742806,0.0009837033,0.35635322,0.000058283564,0.6281125],"study_design_scores_gemma":[0.000088450135,0.000046180823,0.00085267,0.000037117396,0.0000017479005,0.000017965865,0.000008981119,0.99011624,0.0062642056,0.0019335649,0.0004840621,0.0001488363],"about_ca_topic_score_codex":0.000039134775,"about_ca_topic_score_gemma":0.0000010951369,"teacher_disagreement_score":0.98244196,"about_ca_system_score_codex":0.00003264024,"about_ca_system_score_gemma":0.000042637752,"threshold_uncertainty_score":0.33293393},"labels":[],"label_agreement":null},{"id":"W2016888570","doi":"10.1109/tpds.2010.62","title":"hiCUDA: High-Level GPGPU Programming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Porting; Compiler; General-purpose computing on graphics processing units; Parallel computing; Programmer; Graphics; Software portability; Code (set theory); Operating system; Programming language; Software","score_opus":0.021005041741563767,"score_gpt":0.2438634565018963,"score_spread":0.22285841476033255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016888570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004282939,0.000059139333,0.992535,0.00030075683,0.001272574,0.00035116586,0.000085388856,0.00095028407,0.00016278634],"genre_scores_gemma":[0.928921,0.000023692612,0.07043195,0.00005258453,0.000059407117,0.000114992334,0.000020106814,0.000013210191,0.00036308775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.00008221654,0.00037169116,0.0004938041,0.0002750698,0.00036272794],"domain_scores_gemma":[0.99888426,0.00010288057,0.00012304129,0.00054535375,0.00013785255,0.00020659782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029196494,0.00024295438,0.00027180507,0.00014513318,0.0004422016,0.00038631103,0.00047531683,0.00019392767,0.000008199556],"category_scores_gemma":[0.000008440235,0.00021807752,0.00008137873,0.00041297165,0.00007661355,0.00029917847,0.0000063864472,0.00043161566,0.000028724893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007463966,0.0009395067,0.00019088431,0.00015352665,0.00018607141,0.000055967826,0.0005672851,0.8595603,0.0021741001,0.05074704,0.0057052043,0.079645485],"study_design_scores_gemma":[0.0016587222,0.00036429614,0.0008098809,0.000111601476,0.000041406973,0.00027684876,0.00010174996,0.97643024,0.0014639178,0.00091319665,0.016816663,0.0010114824],"about_ca_topic_score_codex":0.00021950903,"about_ca_topic_score_gemma":0.00003247657,"teacher_disagreement_score":0.92463803,"about_ca_system_score_codex":0.000027182798,"about_ca_system_score_gemma":0.000054528544,"threshold_uncertainty_score":0.8892943},"labels":[],"label_agreement":null},{"id":"W2016889342","doi":"10.1145/1950413.1950419","title":"Comparing FPGA vs. custom cmos and the impact on processor microarchitecture","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada); University of Toronto","funders":"","keywords":"Microarchitecture; Field-programmable gate array; Computer science; CMOS; Block (permutation group theory); Computer architecture; Embedded system; Parallel computing; Computer hardware; Engineering; Electronic engineering","score_opus":0.02468996928017874,"score_gpt":0.2575760813783781,"score_spread":0.23288611209819937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016889342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03841877,0.000077749115,0.9228302,0.0006403512,0.00004139501,0.00023046914,2.8706262e-7,0.0006008357,0.037159897],"genre_scores_gemma":[0.91570127,0.000009454826,0.08333441,0.00070245937,0.00001824402,0.000008291361,3.4789173e-7,0.00000545693,0.00022007446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928653,0.000067432025,0.00012666018,0.00023535962,0.00010426271,0.00017973155],"domain_scores_gemma":[0.99942076,0.00007238,0.00006154504,0.0003330075,0.000057183912,0.000055093344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022136944,0.00012710162,0.00015282417,0.00006669753,0.00015258708,0.00012560394,0.0006172193,0.000036881323,0.000010642748],"category_scores_gemma":[0.00002542879,0.00006388818,0.00004735701,0.00018285378,0.000092175214,0.000098378,0.00019765373,0.00014985813,0.000011734643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023191625,0.0012404254,0.03255057,0.00018651831,0.00045583118,0.00005206211,0.0813043,0.065488756,0.00048227183,0.49341574,0.07766064,0.24484374],"study_design_scores_gemma":[0.0013611394,0.0002593423,0.01750054,0.000050315906,0.0000075764956,0.00006465869,0.000029386849,0.9528795,0.013124831,0.013905777,0.00045954558,0.00035739387],"about_ca_topic_score_codex":0.00015285682,"about_ca_topic_score_gemma":0.0000033828317,"teacher_disagreement_score":0.88739073,"about_ca_system_score_codex":0.000011719947,"about_ca_system_score_gemma":0.00002363265,"threshold_uncertainty_score":0.26052848},"labels":[],"label_agreement":null},{"id":"W2017264709","doi":"10.1007/s11265-006-0001-1","title":"Buffer and Register Allocation for Memory Space Optimization","year":2007,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Register allocation; Computer science; Translation lookaside buffer; Cache; Write buffer; Processor register; Parallel computing; CPU cache; Unix; Memory hierarchy; Operating system; Cache algorithms; Memory address; Physical address; Semiconductor memory","score_opus":0.015495876634167604,"score_gpt":0.27785053230130624,"score_spread":0.2623546556671386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017264709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017273559,0.0053285924,0.99015427,0.002072173,0.00008215024,0.00044631472,9.96656e-7,0.00013153136,0.00005660779],"genre_scores_gemma":[0.7304905,0.0001304366,0.26893806,0.00012089231,0.00014655702,0.000013633853,0.000001055236,0.000017810613,0.00014105947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986906,0.00007249855,0.00058779115,0.0002066363,0.0001800137,0.00026244303],"domain_scores_gemma":[0.99778074,0.00039081712,0.00077213586,0.00016908729,0.0008335762,0.00005362727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031236645,0.00016543429,0.00029839342,0.00039545883,0.00036269077,0.00022456038,0.00047707837,0.00016523509,4.9920317e-7],"category_scores_gemma":[0.00011150365,0.00011736718,0.000049601316,0.00032141423,0.0001804003,0.000595558,0.00008465056,0.00018684825,1.7302102e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015511255,0.00040638426,0.00025766835,0.0026837855,0.00040262015,0.00004375702,0.005481868,0.13034175,0.15658201,0.03466812,0.013962008,0.6536189],"study_design_scores_gemma":[0.0010193479,0.0009091093,0.000012092684,0.00042628733,0.00008264882,0.00094700727,0.000498776,0.9606548,0.027398597,0.006598897,0.00119919,0.0002532412],"about_ca_topic_score_codex":0.0000060855714,"about_ca_topic_score_gemma":8.2717594e-7,"teacher_disagreement_score":0.830313,"about_ca_system_score_codex":0.000035556473,"about_ca_system_score_gemma":0.00007674466,"threshold_uncertainty_score":0.47860947},"labels":[],"label_agreement":null},{"id":"W2017271079","doi":"10.1109/fpt.2012.6412140","title":"Pipeline frequency boosting: Hiding dual-ported block RAM latency using intentional clock skew","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Pipeline (software); Clock skew; Clock rate; Embedded system; Skew; Parallel computing; Digital clock manager; Computer hardware; Operating system; Clock signal; Jitter","score_opus":0.043992378894700784,"score_gpt":0.2917535822421825,"score_spread":0.24776120334748172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017271079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020550456,0.00034293818,0.9611081,0.00032214308,0.0005501868,0.00014892122,0.000001010247,0.0013297559,0.015646508],"genre_scores_gemma":[0.521454,0.000011981455,0.47675338,0.0002502413,0.00017871383,0.0000032937216,0.0000060909183,0.000011772708,0.0013305579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817,0.00008648646,0.00050894823,0.00036411994,0.00033277963,0.00053766184],"domain_scores_gemma":[0.99882567,0.000079930345,0.00021037899,0.0004302839,0.00026217618,0.00019157774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006282021,0.00021354499,0.00020888945,0.0002079373,0.0002828115,0.00014523613,0.00049097254,0.000108228414,0.00007185923],"category_scores_gemma":[0.00015342914,0.00019789029,0.00010360806,0.0005776541,0.000036897647,0.0007641468,0.0003479959,0.00020229127,0.00004927559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018983465,0.001612378,0.07038159,0.0001246012,0.00019514574,0.00006450253,0.0023117159,0.024329398,0.019807346,0.80347085,0.04503228,0.032651182],"study_design_scores_gemma":[0.00033220576,0.000044391367,0.0013965027,0.00009011144,0.000018695837,0.00023915239,0.000017568995,0.98351365,0.005919692,0.005634255,0.0022579418,0.0005358301],"about_ca_topic_score_codex":0.00010554825,"about_ca_topic_score_gemma":0.0000013398379,"teacher_disagreement_score":0.9591842,"about_ca_system_score_codex":0.00007792104,"about_ca_system_score_gemma":0.000084744046,"threshold_uncertainty_score":0.80697316},"labels":[],"label_agreement":null},{"id":"W2017680822","doi":"10.1109/fpl.2013.6645542","title":"Simulation-based HW/SW co-debugging for field-programmable systems-on-chip","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Debugging; Debugger; Embedded system; Microcontroller; Modular design; Field-programmable gate array; System on a chip; Nexus (standard); Background debug mode interface; Computer hardware; Chip; Computer architecture; Operating system","score_opus":0.027779771546246945,"score_gpt":0.29827866298628425,"score_spread":0.2704988914400373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017680822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004657287,0.000021542251,0.99099326,0.00082012825,0.00015696294,0.0007218576,5.907804e-7,0.0015536781,0.005266258],"genre_scores_gemma":[0.7322847,4.1301064e-7,0.2655797,0.0010408843,0.00004643469,0.00013771118,0.000005396396,0.000008739126,0.00089602877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897075,0.000045760455,0.00023764618,0.00030456125,0.00016836802,0.0002729068],"domain_scores_gemma":[0.9979653,0.0012416124,0.00008948089,0.0004333719,0.00019272756,0.00007754523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022722797,0.00012855715,0.00014769878,0.00011604858,0.00020056924,0.00044467868,0.00047339834,0.00007069561,0.000029359113],"category_scores_gemma":[0.00017172821,0.0001100542,0.00006745903,0.00018409204,0.000010890623,0.00021990214,0.00003600577,0.0000671907,0.00007509128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033299498,0.00003182992,0.00018288889,0.000020512784,0.000006738832,2.5987885e-7,0.000026922959,0.9717799,0.000016799371,0.011251058,0.008585184,0.008094587],"study_design_scores_gemma":[0.0002627619,0.00014593183,0.000026064115,0.000026865007,0.0000019026828,2.2891592e-7,0.0000038472217,0.99282414,0.0015464863,0.0010813008,0.003925442,0.00015501564],"about_ca_topic_score_codex":0.00011034414,"about_ca_topic_score_gemma":7.5903125e-7,"teacher_disagreement_score":0.731819,"about_ca_system_score_codex":0.000025270421,"about_ca_system_score_gemma":0.000048170405,"threshold_uncertainty_score":0.44878802},"labels":[],"label_agreement":null},{"id":"W2018195068","doi":"10.1145/1188966.1189007","title":"Hybrid vs. monolithic OS kernels","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Microkernel; Computer science; Benchmark (surveying); Embedded system; Operating system; Kernel (algebra); Software deployment; Workstation; Modularity (biology); Process (computing); Code (set theory); Computer architecture; Software","score_opus":0.009692814866021578,"score_gpt":0.22998149420291494,"score_spread":0.22028867933689336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018195068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033249666,0.000042776894,0.93530434,0.0006932616,0.00008300586,0.00006229651,2.7562513e-7,0.0014337748,0.059055272],"genre_scores_gemma":[0.6776436,0.0000048659185,0.31797346,0.00049527385,0.000050519313,0.0000047219078,0.0000015350979,0.000004519792,0.0038215164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924374,0.0000310119,0.0001600667,0.00024189777,0.00013768052,0.00018558501],"domain_scores_gemma":[0.9994602,0.00002977133,0.000044374385,0.00037403213,0.000055202163,0.000036389363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001475033,0.00008577513,0.00009035561,0.000072453135,0.00007956961,0.00013915183,0.00056382874,0.000027245667,0.00002234606],"category_scores_gemma":[0.0000090768835,0.00007591978,0.000039952018,0.00014346551,0.00001774507,0.00019796393,0.00014344501,0.00006700476,0.000108420194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037254815,0.00013978076,0.001823934,0.000009983259,0.000009219244,0.00003034654,0.000072002775,0.022875514,0.00022444969,0.75021124,0.20407952,0.02052027],"study_design_scores_gemma":[0.00017842678,0.000044901637,0.0024241398,0.000009236959,0.0000015920713,0.000029056604,7.878543e-7,0.8816693,0.028578427,0.06958997,0.01722495,0.00024922748],"about_ca_topic_score_codex":0.0001356467,"about_ca_topic_score_gemma":0.0000013982204,"teacher_disagreement_score":0.8587938,"about_ca_system_score_codex":0.000018045439,"about_ca_system_score_gemma":0.000026141288,"threshold_uncertainty_score":0.30959186},"labels":[],"label_agreement":null},{"id":"W2018427274","doi":"10.1109/ccece.2006.277459","title":"Reducing the Instruction Queue Leakage Power in Superscalar Processors","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Idle; CMOS; Dissipation; Embedded system; Branch predictor; Power gating; Comparator; Leakage (economics); Cache; Queue; Clock gating; Parallel computing; Instructions per cycle; Transistor; Chip; Out-of-order execution; Transmission gate; CPU cache; Computer hardware; Electronic engineering; Electrical engineering; Clock skew; Central processing unit; Engineering; Clock signal; Operating system; Telecommunications; Computer network","score_opus":0.0071593337751373375,"score_gpt":0.22302090215002263,"score_spread":0.2158615683748853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018427274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1280287,0.00004869717,0.84371644,0.0013947973,0.000112559064,0.000111652764,9.083229e-8,0.0004856286,0.026101422],"genre_scores_gemma":[0.9214797,0.000004278716,0.0777091,0.00015616139,0.000025405538,0.000007247597,7.2317283e-7,0.0000043427594,0.0006130278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992687,0.000049916398,0.00017385332,0.00022039247,0.00012996803,0.00015715536],"domain_scores_gemma":[0.9996156,0.000026323467,0.00003943144,0.00026031974,0.000043133063,0.000015211499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027579095,0.00007513693,0.000069702546,0.00009774329,0.000103709535,0.00011894879,0.00043713575,0.000042755244,0.000008584521],"category_scores_gemma":[0.00001979837,0.000052188898,0.000024370573,0.00050084933,0.00002852371,0.00030184787,0.00008457642,0.000110721696,0.000008385786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014234812,0.00031873386,0.014559044,0.000033268676,0.000012729807,0.000024089002,0.0045906627,0.29332688,0.0025069208,0.6261419,0.021874242,0.036597293],"study_design_scores_gemma":[0.00060141593,0.00008172439,0.023828974,0.00006333536,0.0000024916492,0.00008013253,0.00018780725,0.9267302,0.023889238,0.019071225,0.004993973,0.00046946068],"about_ca_topic_score_codex":0.00042503924,"about_ca_topic_score_gemma":0.000036341757,"teacher_disagreement_score":0.793451,"about_ca_system_score_codex":0.00003279802,"about_ca_system_score_gemma":0.00003051785,"threshold_uncertainty_score":0.21282016},"labels":[],"label_agreement":null},{"id":"W2018465888","doi":"10.1145/2039370.2039377","title":"A bursty multi-port memory controller with quality-of-service guarantees","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dram; Computer science; Latency (audio); Bandwidth (computing); Quality of service; Efficient energy use; Memory controller; Dynamic bandwidth allocation; Computer network; Embedded system; Computer hardware; Telecommunications; Semiconductor memory; Engineering; Electrical engineering","score_opus":0.07219520477421301,"score_gpt":0.290335904953926,"score_spread":0.21814070017971302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018465888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077523435,0.000046561505,0.971161,0.00016752043,0.000044090444,0.00016831221,5.8368164e-7,0.00058910897,0.02007049],"genre_scores_gemma":[0.4780812,0.0000036383021,0.5207117,0.0006767325,0.000006918977,0.00000822964,5.1855085e-7,0.000005277659,0.0005057527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989085,0.000083119034,0.0003290744,0.00028418112,0.00020449734,0.00019059882],"domain_scores_gemma":[0.99895847,0.000057769983,0.00018439464,0.00046544202,0.00027864176,0.000055310826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048444833,0.00012917936,0.00025449813,0.00008851592,0.00006120402,0.00002518229,0.0007061508,0.000051470284,0.000034961577],"category_scores_gemma":[0.000022069245,0.00009136862,0.00004921184,0.0002943459,0.00004295603,0.00022547519,0.00012840582,0.000076154975,0.000015448923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013632645,0.0056065717,0.07649745,0.000620727,0.0010680262,0.00011782,0.054242928,0.01196534,0.0067936247,0.76486886,0.006412938,0.070442475],"study_design_scores_gemma":[0.0071868515,0.0008106304,0.07517607,0.00018267529,0.00003724062,0.000055375403,0.0004590726,0.84727496,0.061916057,0.0048784018,0.0005602242,0.0014624756],"about_ca_topic_score_codex":0.0009095642,"about_ca_topic_score_gemma":0.00007263677,"teacher_disagreement_score":0.83530957,"about_ca_system_score_codex":0.000008407641,"about_ca_system_score_gemma":0.000051389336,"threshold_uncertainty_score":0.37259045},"labels":[],"label_agreement":null},{"id":"W2019507425","doi":"10.1145/2435227.2435243","title":"Parallel programming patterns for multi-processor SoC","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Scalability; Debugging; Programming paradigm; Reactive programming; Parallel computing; Task (project management); Parallel programming model; Set (abstract data type); Abstraction; Instruction set; Process (computing); Distributed computing; Programming language; Computer architecture; Inductive programming; Operating system","score_opus":0.04378443193900315,"score_gpt":0.3023593538533846,"score_spread":0.2585749219143814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019507425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023198577,0.0000917641,0.99233705,0.00038358025,0.0008760241,0.0016787441,0.0000059431454,0.0022349712,0.00007205077],"genre_scores_gemma":[0.4867276,0.0000061453798,0.51240927,0.00014131528,0.00007542558,0.00033281522,0.000005474481,0.000028502047,0.00027348122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738866,0.00014148455,0.0006677997,0.00079506554,0.00033952892,0.000667458],"domain_scores_gemma":[0.9975989,0.00035940958,0.0002984398,0.0011727647,0.00039337523,0.00017712014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046382818,0.00035725895,0.00039837358,0.00026952729,0.000684197,0.000767553,0.0017247611,0.00017656245,0.0000063024518],"category_scores_gemma":[0.000062015184,0.00034398344,0.00021378898,0.00045994954,0.000036864247,0.00045405977,0.000045078483,0.00028889196,0.00006541951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002052345,0.00086812006,0.00028064573,0.0005510073,0.00023235075,0.0000059243425,0.0045426884,0.6211291,0.00017725992,0.0033362445,0.0014493405,0.3674068],"study_design_scores_gemma":[0.00086568884,0.00019582207,0.00010861787,0.0002100345,0.000014864187,0.000027442025,0.000285157,0.99651647,0.00041393258,0.0002891915,0.0006313722,0.00044141308],"about_ca_topic_score_codex":0.00015724795,"about_ca_topic_score_gemma":0.0000041107405,"teacher_disagreement_score":0.48440772,"about_ca_system_score_codex":0.00009580619,"about_ca_system_score_gemma":0.000068151516,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W2019751792","doi":"10.1145/1356058.1356062","title":"Phase-based adaptive recompilation in a JVM","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Speedup; Compiler; Java; Profiling (computer programming); Code (set theory); Parallel computing; Just-in-time compilation; Source code; Distributed computing; Programming language; Set (abstract data type)","score_opus":0.048737636786220964,"score_gpt":0.28918840944830265,"score_spread":0.2404507726620817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019751792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008759827,0.000015570651,0.9780516,0.00031423348,0.000043376192,0.00008850135,2.2623077e-7,0.0005095446,0.012217122],"genre_scores_gemma":[0.58381224,0.000003271456,0.41576546,0.00024605,0.00000775147,0.0000051878224,0.0000014592023,0.000002093721,0.00015648086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938065,0.000050650317,0.00014819157,0.0001935732,0.00010679247,0.00012012005],"domain_scores_gemma":[0.9996287,0.000051856423,0.0000423644,0.00019986817,0.000046272246,0.000030932453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013354771,0.00006487341,0.0000822386,0.00015658034,0.00006354073,0.00001911231,0.0002622856,0.00003291952,0.000013335191],"category_scores_gemma":[0.000014790099,0.00006146474,0.000024683464,0.00040483303,0.000017810251,0.00019265921,0.000036254507,0.000062981075,0.000020952944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022983359,0.005401457,0.013240351,0.000023197883,0.000033209253,0.00028781273,0.004918592,0.35553652,0.0011086536,0.26510933,0.060300175,0.29381087],"study_design_scores_gemma":[0.0007073942,0.00014171477,0.00074605877,0.000007977801,2.6513328e-7,0.00000487538,0.0000017457228,0.9939131,0.0026985018,0.0011514688,0.00053704774,0.000089858906],"about_ca_topic_score_codex":0.00002845682,"about_ca_topic_score_gemma":0.000005010561,"teacher_disagreement_score":0.6383766,"about_ca_system_score_codex":0.00003288249,"about_ca_system_score_gemma":0.000060914997,"threshold_uncertainty_score":0.25064594},"labels":[],"label_agreement":null},{"id":"W2020404950","doi":"10.1109/asap.2014.6868645","title":"He-P2012: Architectural heterogeneity exploration on a scalable many-core platform","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Granularity; Speedup; Design space exploration; Scalability; Computer architecture; Interface (matter); Parallel computing; Set (abstract data type); Code (set theory); Distributed computing; Programming language; Embedded system; Operating system","score_opus":0.04637114369416795,"score_gpt":0.2766324576377287,"score_spread":0.23026131394356075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020404950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050770704,0.000006263068,0.936399,0.00068024633,0.00014358047,0.00012348781,3.3081554e-7,0.001028159,0.010848259],"genre_scores_gemma":[0.75970024,0.0000032631822,0.23866837,0.00094095425,0.0000653354,0.000013933766,0.000005006647,0.000007690516,0.0005952252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989338,0.000040380823,0.00019403259,0.0003511251,0.00022895765,0.00025169787],"domain_scores_gemma":[0.9991772,0.000068470385,0.00007318504,0.000535492,0.0000568829,0.000088744615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950279,0.00014535074,0.00013401557,0.000120016004,0.00017286146,0.00016944167,0.00056270644,0.000059778944,0.0000127392295],"category_scores_gemma":[0.000036341393,0.00011727461,0.000058359485,0.0002154835,0.000024454595,0.00043241956,0.00016176557,0.00011731312,0.00012579306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049894526,0.00025509304,0.0010933382,0.00003758638,0.000039816943,0.000005226357,0.0009437013,0.13398649,0.0011797296,0.5515538,0.017094167,0.29376116],"study_design_scores_gemma":[0.0002050295,0.00021605028,0.0005058539,0.000018008655,0.0000017581995,0.000010876784,0.0000029172138,0.9583809,0.022253938,0.01589402,0.0023075424,0.00020314394],"about_ca_topic_score_codex":0.000023340022,"about_ca_topic_score_gemma":0.000011791383,"teacher_disagreement_score":0.8243944,"about_ca_system_score_codex":0.00002819797,"about_ca_system_score_gemma":0.000014597179,"threshold_uncertainty_score":0.478232},"labels":[],"label_agreement":null},{"id":"W2020517863","doi":"10.1109/micro.2014.22","title":"Load Value Approximation","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Latency (audio); Parallel computing; Speedup; Approximation error; Range (aeronautics); Efficient energy use; Parsec; Value (mathematics); Energy (signal processing); Real-time computing; Algorithm; Electrical engineering","score_opus":0.011160372587117382,"score_gpt":0.23868361093318233,"score_spread":0.22752323834606494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020517863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017510177,0.0000058848855,0.8742124,0.00045930888,0.000060375158,0.000034896835,1.725433e-8,0.0008357517,0.12421625],"genre_scores_gemma":[0.29591447,0.0000015122853,0.7028116,0.00052303594,0.000023565563,0.0000026817454,4.104393e-7,0.0000019537924,0.00072076905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995124,0.00003981281,0.00008560381,0.00014179808,0.00013335246,0.000087030705],"domain_scores_gemma":[0.9995907,0.000030422856,0.00002953478,0.00026569836,0.000055416796,0.000028255923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039071,0.000045043846,0.00004887459,0.000032144275,0.00005275675,0.00007852576,0.00033840476,0.000023762319,0.000006154137],"category_scores_gemma":[0.0000444952,0.000038458613,0.000018573242,0.00013632474,0.0000078215835,0.00017004923,0.00007844631,0.000031618012,0.00006953083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.801053e-7,0.000012847797,0.000037642112,0.0000023584282,0.0000011907681,9.519348e-8,0.0000821675,0.005461138,0.00006700455,0.9479734,0.0046008774,0.041761],"study_design_scores_gemma":[0.00005642034,0.000018533505,0.000121888006,0.0000026969965,3.6968606e-7,0.0000017966141,5.9013036e-7,0.9654844,0.0030216337,0.02327644,0.007955168,0.000060092145],"about_ca_topic_score_codex":0.00000962972,"about_ca_topic_score_gemma":2.9975624e-7,"teacher_disagreement_score":0.9600232,"about_ca_system_score_codex":0.00001664547,"about_ca_system_score_gemma":0.000017391054,"threshold_uncertainty_score":0.15682967},"labels":[],"label_agreement":null},{"id":"W2020869910","doi":"10.1145/2774959.2774967","title":"Velociraptor: a compiler toolkit for array-based languages targeting CPUs and GPUs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Programming language; Parallel computing; Intermediate language; Code generation; Variety (cybernetics); Code (set theory); Computer architecture; Operating system; Key (lock)","score_opus":0.028291972362585266,"score_gpt":0.28432597431848633,"score_spread":0.2560340019559011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020869910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025251529,0.00024059846,0.99000204,0.00073222566,0.000109972185,0.00016662982,0.0000017833391,0.00071240397,0.0055092205],"genre_scores_gemma":[0.30528194,0.0000021541432,0.69369763,0.0007160163,0.000049883725,0.000016141707,0.000006155506,0.0000055831956,0.00022447591],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992444,0.00003576374,0.00014883882,0.0002549124,0.00012681376,0.0001892824],"domain_scores_gemma":[0.99938864,0.00010850403,0.000058480273,0.00020773204,0.00013313188,0.00010352941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038675632,0.000101649886,0.00012625357,0.000068892805,0.000089846515,0.00015519474,0.0003098022,0.000046090743,0.000003213886],"category_scores_gemma":[0.00009612819,0.0000886002,0.000032236934,0.00012642183,0.000026177702,0.00015332895,0.00006843009,0.000052204912,0.0000056026142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015279015,0.00052672764,0.010269329,0.00024355011,0.0001258031,0.00002970968,0.0100476155,0.043795545,0.0055409484,0.18471244,0.6209374,0.12361812],"study_design_scores_gemma":[0.0012347156,0.00025516268,0.0001590308,0.000027555485,0.0000062924782,0.0000072622015,0.00017671907,0.9223652,0.022923287,0.0031026066,0.049316466,0.00042572318],"about_ca_topic_score_codex":0.000020739446,"about_ca_topic_score_gemma":0.0000015777521,"teacher_disagreement_score":0.87856966,"about_ca_system_score_codex":0.00002081293,"about_ca_system_score_gemma":0.000065226486,"threshold_uncertainty_score":0.36130112},"labels":[],"label_agreement":null},{"id":"W2021001309","doi":"10.1115/fedsm2012-72176","title":"Using Graphics Processing Units to Accelerate Numerical Simulations of Interfacial Incompressible Flows","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; University of Massachusetts Dartmouth; Nvidia; National Science Foundation","keywords":"Solver; Computer science; CUDA; Computational science; Parallel computing; Linear algebra; Compressibility; Projection method; Convergence (economics); Linear system; Graphics; Algorithm; Mathematics; Computer graphics (images); Dykstra's projection algorithm; Geometry; Mathematical analysis; Mechanics; Physics","score_opus":0.10473173977638914,"score_gpt":0.3479663337256044,"score_spread":0.2432345939492153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021001309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07405738,0.00003139127,0.9243404,0.00006616786,0.00010296067,0.00009858765,9.718781e-7,0.00027381905,0.0010282999],"genre_scores_gemma":[0.6181199,5.337602e-7,0.38168785,0.00013770425,0.0000311185,0.0000012283707,7.7656495e-7,0.0000046019895,0.000016287053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910706,0.000058175203,0.00026694578,0.00015971404,0.00017395683,0.0002341165],"domain_scores_gemma":[0.99925953,0.000044234614,0.00009467939,0.00022470317,0.0002623942,0.00011443267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017989827,0.000100876685,0.0001421341,0.00021552197,0.00014385425,0.00008835861,0.00043912523,0.00004873875,0.000010469216],"category_scores_gemma":[0.00005282057,0.00009210242,0.000023963428,0.0013981521,0.000016111759,0.00063440175,0.00030083166,0.000085123866,0.000003212607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000111918525,0.00022064373,0.0055070957,0.000035340236,0.000016166203,5.631019e-7,0.0033860835,0.94494295,0.005438233,0.019968232,0.00044005382,0.020033456],"study_design_scores_gemma":[0.000067944,0.000021921407,0.00038743365,0.000031830128,0.000002933139,0.0000021129813,0.0000052675136,0.9874608,0.011112124,0.0003389828,0.0004487767,0.00011988641],"about_ca_topic_score_codex":0.000037194975,"about_ca_topic_score_gemma":0.0000014174512,"teacher_disagreement_score":0.54406255,"about_ca_system_score_codex":0.00001849313,"about_ca_system_score_gemma":0.00007142177,"threshold_uncertainty_score":0.37558278},"labels":[],"label_agreement":null},{"id":"W2021080349","doi":"10.1145/2451512.2451541","title":"A modular approach to on-stack replacement in LLVM","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Interrupt; Computer science; Compiler; Modular design; Operating system; Stack (abstract data type); Call stack; Virtual machine; Code (set theory); Embedded system; Function (biology); Parallel computing; Programming language; Point (geometry); Interrupt handler","score_opus":0.018961946415104635,"score_gpt":0.24611871654803044,"score_spread":0.22715677013292582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021080349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053570215,0.0000043417735,0.9010987,0.000941107,0.000032996293,0.00030825505,6.902949e-8,0.00034874573,0.09190873],"genre_scores_gemma":[0.36222127,0.0000016148082,0.6340638,0.0017413384,0.000009304541,0.00006536589,6.719353e-7,0.0000037933587,0.0018928768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991208,0.00003869563,0.0001585337,0.00033080994,0.00016081076,0.0001903812],"domain_scores_gemma":[0.99933106,0.000018558818,0.0000235078,0.0005115158,0.000041520914,0.00007380981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019770963,0.000084541745,0.00009254798,0.00014966715,0.000032460033,0.000118172386,0.0005196231,0.000030567695,0.000019714826],"category_scores_gemma":[0.000019382733,0.00007114806,0.00002080331,0.00035633714,0.000005852012,0.00014469089,0.00018861296,0.00006529581,0.00022849508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000120314835,0.0008640719,0.0009863636,0.000018072902,0.000013961259,0.000003402532,0.001953578,0.3942633,0.00043006174,0.4270895,0.15016808,0.024197586],"study_design_scores_gemma":[0.00012990394,0.000101046935,0.0012577502,0.000009182909,1.969616e-7,0.0000012003852,0.00001129128,0.99371004,0.0006917447,0.001945966,0.0020176547,0.00012403872],"about_ca_topic_score_codex":0.000093682705,"about_ca_topic_score_gemma":9.70915e-7,"teacher_disagreement_score":0.5994467,"about_ca_system_score_codex":0.000040545812,"about_ca_system_score_gemma":0.000014785213,"threshold_uncertainty_score":0.2936918},"labels":[],"label_agreement":null},{"id":"W2021192760","doi":"10.1109/dsd.2014.93","title":"Improving Power of Cache and Register File through Critical Path Instructions","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Register file; Cache; Computer science; Critical path method; Power (physics); Voltage; Parallel computing; Operating system; Processor register; Embedded system; Instruction set; Electrical engineering","score_opus":0.015641298323096468,"score_gpt":0.26365394902307754,"score_spread":0.24801265069998107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021192760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010485199,0.000017394972,0.9801942,0.0004096042,0.000082212486,0.00003169721,0.0000020136479,0.0001983065,0.018016063],"genre_scores_gemma":[0.39092034,0.0000019092406,0.60864043,0.00021504436,0.000011214876,0.0000013503883,7.561323e-7,0.0000024805595,0.00020645512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946517,0.00003784169,0.00013602305,0.00017628353,0.00008217254,0.000102497404],"domain_scores_gemma":[0.9994498,0.00013367858,0.000039422615,0.0002737518,0.00007157651,0.00003180063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011442697,0.00005711169,0.000087507186,0.000030188648,0.000071424416,0.000052776657,0.00018762068,0.00003873989,0.0000583482],"category_scores_gemma":[0.00019374191,0.000048200276,0.000021677639,0.000100007135,0.000071605944,0.00024315645,0.00015654962,0.00005753453,0.0000023720245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003727627,0.00007235521,0.00024470233,0.000044841523,0.000008325286,0.0000013877242,0.0013276453,0.00014803911,0.00055051985,0.94516695,0.028838733,0.023592757],"study_design_scores_gemma":[0.00035395223,0.0003385813,0.0017379352,0.00006866956,0.000007825853,0.00007542436,0.00008483672,0.9361418,0.0073821824,0.038230978,0.01518206,0.0003957917],"about_ca_topic_score_codex":0.0000458027,"about_ca_topic_score_gemma":9.884204e-7,"teacher_disagreement_score":0.93599373,"about_ca_system_score_codex":0.0000051611087,"about_ca_system_score_gemma":0.000014356345,"threshold_uncertainty_score":0.19655502},"labels":[],"label_agreement":null},{"id":"W2021539685","doi":"10.1016/s0304-3975(98)00226-6","title":"Generating irregular partitionable data structures","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McGill University","funders":"","keywords":"Computer science; Data structure; Theoretical computer science; Pointer (user interface); Formalism (music); Rule-based machine translation; Graph partition; Graph; Parallel computing; Algorithm; Distributed computing; Programming language; Artificial intelligence","score_opus":0.019400851168053863,"score_gpt":0.2738776741788165,"score_spread":0.25447682301076263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021539685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008957864,0.000051157534,0.9847085,0.0007093299,0.0002079421,0.000103283855,0.000002812986,0.000683151,0.004575988],"genre_scores_gemma":[0.46001297,0.0000072709813,0.53913456,0.00067622255,0.0001247282,0.0000021283984,0.000005250973,0.000004608098,0.000032249987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975317,0.00011150845,0.00027512808,0.0009426818,0.0006224109,0.0005165785],"domain_scores_gemma":[0.9975524,0.000096287346,0.000049272687,0.0019720555,0.00012627944,0.000203704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012723816,0.00016585014,0.00016178958,0.0001104003,0.00071938377,0.00079833897,0.0051796846,0.000046920683,0.00031524437],"category_scores_gemma":[0.00005393204,0.00014088445,0.00003111548,0.00092599663,0.0011815062,0.0011722357,0.0014090503,0.0001551583,0.00008390722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001677973,0.000022080887,0.000010803786,0.0000023119794,0.0000022173242,0.0000056658114,0.000080776,0.025476584,0.00010713424,0.86635447,0.0008138088,0.10712245],"study_design_scores_gemma":[0.0000825469,0.000046158297,0.00011667547,0.000010510549,0.0000018530282,0.00003468665,6.524367e-7,0.86723024,0.0014068285,0.12972175,0.0011708889,0.00017724388],"about_ca_topic_score_codex":0.0000040949935,"about_ca_topic_score_gemma":1.9584257e-7,"teacher_disagreement_score":0.8417536,"about_ca_system_score_codex":0.000028309807,"about_ca_system_score_gemma":0.00012256067,"threshold_uncertainty_score":0.9625229},"labels":[],"label_agreement":null},{"id":"W2021695989","doi":"10.1109/reconfig.2014.7032495","title":"Advanced branch predictors for soft processors","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Throughput; Parallel computing; Implementation; Branch predictor; Nios II; Soft computing; Computer architecture; Embedded system; Artificial neural network; Operating system; Artificial intelligence; Programming language","score_opus":0.009003908149652119,"score_gpt":0.24975805084443722,"score_spread":0.2407541426947851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021695989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012527088,0.000017567338,0.989293,0.00042298908,0.000137543,0.00018768267,3.6196062e-7,0.0013060841,0.007382082],"genre_scores_gemma":[0.49514878,0.0000024653325,0.5032474,0.00041711578,0.000041040836,0.00003541787,0.0000015880887,0.000005754322,0.0011004712],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993031,0.000018065286,0.00013719371,0.0002541767,0.000108603155,0.00017883177],"domain_scores_gemma":[0.9994064,0.000110474546,0.000053582327,0.00026879628,0.00010770275,0.00005306211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002184691,0.000082635444,0.000097809876,0.000054241074,0.00009836649,0.00006907543,0.00052726286,0.000038186685,0.0000038684457],"category_scores_gemma":[0.00013605198,0.00007020093,0.000038294078,0.00017176275,0.0000149793605,0.00023672624,0.0000702838,0.00003715875,0.0000074928703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022017117,0.0001415822,0.001473968,0.000115290866,0.0000234985,2.610684e-7,0.00074756553,0.058633775,0.00065690064,0.3371968,0.030954583,0.5700337],"study_design_scores_gemma":[0.00033002242,0.00014497164,0.00028585916,0.000013517512,0.0000016972508,0.0000014815112,0.0000017563647,0.9351174,0.007954014,0.020486513,0.035499692,0.00016303585],"about_ca_topic_score_codex":0.0000013329837,"about_ca_topic_score_gemma":8.2419496e-7,"teacher_disagreement_score":0.8764837,"about_ca_system_score_codex":0.000009711478,"about_ca_system_score_gemma":0.000024934274,"threshold_uncertainty_score":0.28627107},"labels":[],"label_agreement":null},{"id":"W2022345909","doi":"10.1109/reconfig.2012.6416731","title":"An implementation of a directory protocol for a cache coherent system on FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; MESI protocol; Cache coherence; Directory; Cache; Protocol (science); Cache algorithms; MESIF protocol; Bus sniffing; Pipeline (software); Embedded system; Field-programmable gate array; CPU cache; Operating system; Parallel computing","score_opus":0.05305366133446364,"score_gpt":0.3954385312810384,"score_spread":0.34238486994657474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022345909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008096912,0.0000011973445,0.9556151,0.00002235541,0.00004387301,0.041399736,0.0000013312052,0.00041095185,0.0016957327],"genre_scores_gemma":[0.6431889,4.590438e-8,0.24393259,0.000055587647,0.00004969011,0.11271768,0.0000024856713,0.0000063681696,0.000046681118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934494,0.00006637038,0.00018783603,0.00012994772,0.00012194726,0.00014896592],"domain_scores_gemma":[0.99946654,0.000037878686,0.00011395429,0.00025196784,0.00007442791,0.000055255805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035614395,0.00006941764,0.00009128023,0.00006275022,0.00004992477,0.000026917594,0.00024151537,0.000024185318,0.000008648569],"category_scores_gemma":[0.0000041100725,0.000055132157,0.000032849915,0.00009203953,0.0000069397183,0.0002042551,0.000029445366,0.00002280753,0.0000022715149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011317294,0.0014124602,0.013095915,0.00083802926,0.00007308167,5.771421e-7,0.004756812,0.005261498,0.0048101093,0.7753389,0.024634376,0.16966505],"study_design_scores_gemma":[0.0026101673,0.0019367553,0.008178629,0.00017108135,0.000011894661,0.0000065951303,0.00044244732,0.57741493,0.39527193,0.00032537358,0.013121227,0.0005089911],"about_ca_topic_score_codex":0.00004412372,"about_ca_topic_score_gemma":0.0000034235975,"teacher_disagreement_score":0.77501357,"about_ca_system_score_codex":0.000046903006,"about_ca_system_score_gemma":0.000029726054,"threshold_uncertainty_score":0.22482242},"labels":[],"label_agreement":null},{"id":"W2022711417","doi":"10.1145/1088149.1088172","title":"An integrated simdization framework using virtual vectors","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"SIMD; Computer science; Speedup; Compiler; Vectorization (mathematics); Parallel computing; Data structure; Novelty; Programming language","score_opus":0.018705262665249165,"score_gpt":0.2941981325904826,"score_spread":0.2754928699252334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022711417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018191835,0.000010696451,0.9795221,0.00015924689,0.00011092377,0.000057020145,2.5792622e-7,0.0013092544,0.0006386343],"genre_scores_gemma":[0.47925636,0.0000020731388,0.5203013,0.00033093998,0.00005288362,7.142425e-7,0.000002355497,0.0000043231116,0.00004905668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992344,0.00006807116,0.00016278874,0.00024416938,0.00013822,0.00015235088],"domain_scores_gemma":[0.9993919,0.000039601848,0.000053943455,0.00034746923,0.00009835528,0.00006874473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015814805,0.000095709904,0.00008391847,0.0001138061,0.00011758615,0.00018744233,0.0004882784,0.00008274125,0.000039141316],"category_scores_gemma":[0.000046327576,0.0000853289,0.000023847693,0.000504751,0.000017862885,0.0006245152,0.0000606726,0.00010674198,0.000019505407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024682884,0.00008703146,0.00047688565,9.837311e-7,0.000005595665,0.0000010137253,0.00053919153,0.80289847,0.0005223962,0.124047205,0.0005317647,0.07088699],"study_design_scores_gemma":[0.000044264645,0.000055491022,0.000089523,0.000011474878,0.0000012540071,0.0000028041911,0.000014709098,0.9924758,0.0049116276,0.00088537287,0.0013843382,0.0001233475],"about_ca_topic_score_codex":0.000024305577,"about_ca_topic_score_gemma":0.00000305591,"teacher_disagreement_score":0.46106452,"about_ca_system_score_codex":0.00005157788,"about_ca_system_score_gemma":0.00004746628,"threshold_uncertainty_score":0.34796116},"labels":[],"label_agreement":null},{"id":"W2023036890","doi":"10.1145/2751205.2751231","title":"DASX","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Interface (matter); Parallelism (grammar); Parallel computing; Abstraction; Memory management; Computer architecture; Efficient energy use; Software; Data structure; Data access; Operating system; Programming language; Embedded system; Semiconductor memory","score_opus":0.04257599188941773,"score_gpt":0.28078471639112346,"score_spread":0.23820872450170572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023036890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012276396,0.000017589453,0.843403,0.0005569365,0.00007113269,0.000015920174,1.7174822e-8,0.0007541981,0.15505843],"genre_scores_gemma":[0.22246072,0.0000012252267,0.77462053,0.0005494097,0.000017738046,0.0000012579255,2.4465828e-7,0.0000014292153,0.0023474486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997004,0.000013533446,0.00004944391,0.00008961622,0.00008052227,0.000066457585],"domain_scores_gemma":[0.9996749,0.000007943826,0.0000120048135,0.00019862206,0.00004815705,0.00005833256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013046982,0.000028383374,0.00003133515,0.000028134244,0.000017564753,0.00005230197,0.00033466087,0.000013266248,0.0000038125522],"category_scores_gemma":[0.00001947085,0.00002324117,0.0000096760505,0.00012482754,0.0000056301324,0.00013501135,0.00010436245,0.00002121298,0.00009197837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.0392914e-7,0.000028972336,0.000441213,8.7376185e-7,0.00000278307,0.0000046576074,0.00033789678,0.0035840597,0.000016524726,0.7172801,0.24844243,0.02985968],"study_design_scores_gemma":[0.0001664615,0.000054004006,0.00013665268,0.000002386029,4.4451377e-7,0.000012245564,0.000008180113,0.8878873,0.0026638457,0.032451764,0.076488495,0.00012819869],"about_ca_topic_score_codex":0.000007421795,"about_ca_topic_score_gemma":2.7770534e-7,"teacher_disagreement_score":0.8843033,"about_ca_system_score_codex":0.0000080196205,"about_ca_system_score_gemma":0.000026105792,"threshold_uncertainty_score":0.118222654},"labels":[],"label_agreement":null},{"id":"W2023816139","doi":"10.1109/jssc.2002.803023","title":"A 0.8-V 128-kb four-way set-associative two-level CMOS cache memory using two-stage wordline/bitline-oriented tag-compare (WLOTC/BLOTC) scheme","year":2002,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Taiwan Semiconductor Manufacturing Company","keywords":"Sense amplifier; Cache; CMOS; Content-addressable memory; Computer science; Transistor; Amplifier; Dissipation; Sense (electronics); Voltage; Electrical engineering; Set (abstract data type); Computer hardware; Electronic engineering; Engineering; Parallel computing; Physics; Artificial intelligence","score_opus":0.11359784115399177,"score_gpt":0.3253500378777145,"score_spread":0.21175219672372272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023816139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19783391,0.0004847748,0.7983868,0.00037988398,0.0012260542,0.00033921993,0.0000765889,0.00038455738,0.0008882035],"genre_scores_gemma":[0.89422387,0.00014797422,0.102691635,0.0007326369,0.0006733242,0.00000718756,0.000004690401,0.000084690124,0.0014340129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947759,0.00051518704,0.0017153717,0.0006813487,0.001276199,0.0010360054],"domain_scores_gemma":[0.99450856,0.00035542133,0.002218164,0.00071411335,0.0016784819,0.0005252342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016479322,0.00061129493,0.0010421552,0.0007167287,0.00050592126,0.00033178876,0.0017079124,0.00014780798,0.000061221726],"category_scores_gemma":[0.00031046823,0.0005941858,0.00042897646,0.0013920569,0.00014510356,0.0013523287,0.00023726316,0.0011017836,0.00004684482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011118949,0.001739797,0.006900219,0.0002405475,0.0014728892,0.0025770373,0.02977535,0.8597054,0.03595876,0.0011079828,0.021486688,0.038924184],"study_design_scores_gemma":[0.0039070603,0.00026322584,0.00063288765,0.0004840413,0.00007441541,0.0005689332,0.00027640368,0.9729507,0.017979572,0.0005905919,0.0012942306,0.0009779519],"about_ca_topic_score_codex":0.00008434053,"about_ca_topic_score_gemma":0.000029586909,"teacher_disagreement_score":0.6963899,"about_ca_system_score_codex":0.0006014428,"about_ca_system_score_gemma":0.00030685074,"threshold_uncertainty_score":0.99965096},"labels":[],"label_agreement":null},{"id":"W2024510148","doi":"10.1109/icpp.2013.101","title":"Relating Application Memory Activity to Processor Power","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; University of Victoria","keywords":"Computer science; Memory management; Power (physics); Memory footprint; Workload; Relation (database); Semiconductor memory; Interleaved memory; Parallel computing; Computer hardware; Operating system; Physics","score_opus":0.010483494764634702,"score_gpt":0.2534705185796403,"score_spread":0.24298702381500561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024510148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015796956,0.0000039710844,0.9358885,0.0017866769,0.000031060998,0.00030733956,4.959357e-8,0.0009218329,0.045263596],"genre_scores_gemma":[0.6747262,3.189675e-7,0.32348943,0.0005121566,0.000010120435,0.00006784998,1.8747129e-7,0.0000035077298,0.0011902689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993544,0.000022372658,0.00010284506,0.0002553373,0.00012452914,0.00014051616],"domain_scores_gemma":[0.9993885,0.00003523816,0.00005052167,0.0003408554,0.000114542614,0.000070318136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014380607,0.000069775895,0.00006822183,0.000063841704,0.000091457885,0.00012004956,0.00041222855,0.00003662269,0.000025690419],"category_scores_gemma":[0.000042720767,0.000061129846,0.000018517921,0.00032313523,0.0000069406406,0.00045069246,0.0001654683,0.000064625005,0.00034788784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005517128,0.00027515646,0.0010748757,0.00003340582,0.000019171699,0.0000011698882,0.0027486333,0.028093796,0.039927363,0.070495956,0.051146705,0.8061783],"study_design_scores_gemma":[0.000085675674,0.000058964913,0.003940418,0.000010570387,8.6472863e-7,0.0000032378466,0.000012923084,0.9519392,0.038276654,0.0040564053,0.0013854502,0.00022961042],"about_ca_topic_score_codex":0.00007431296,"about_ca_topic_score_gemma":0.0000012327534,"teacher_disagreement_score":0.9238454,"about_ca_system_score_codex":0.000021727281,"about_ca_system_score_gemma":0.00001994264,"threshold_uncertainty_score":0.447151},"labels":[],"label_agreement":null},{"id":"W2024959957","doi":"10.1016/s0010-4655(00)00189-2","title":"The HepMC C++ Monte Carlo event record for High Energy Physics","year":2001,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":291,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo method; Event (particle physics); Fortran; Computer science; Vertex (graph theory); Event generator; Computational science; Physics; Statistical physics; Graph; Theoretical computer science; Mathematics; Programming language; Statistics","score_opus":0.03606666580185056,"score_gpt":0.2834892053248282,"score_spread":0.24742253952297763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024959957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006329793,0.0003476853,0.99357855,0.0040440857,0.00039332808,0.00025468477,0.00000509445,0.0005975193,0.00071575254],"genre_scores_gemma":[0.23093072,0.0011584178,0.76604736,0.0007625816,0.00040905326,0.00020688573,0.000027812739,0.00002645819,0.0004307103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985307,0.00020477723,0.00037495035,0.0003522024,0.00019139322,0.0003459957],"domain_scores_gemma":[0.9949463,0.0007398262,0.00024341088,0.003601111,0.0003872071,0.00008211661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025935972,0.00021311385,0.0002122565,0.000033791475,0.0012837297,0.00037118222,0.004122984,0.000055831315,4.0985393e-7],"category_scores_gemma":[0.0000133399835,0.00018502676,0.00017005896,0.00053692056,0.00013122062,0.00033490607,0.001542761,0.00018737356,0.000008629296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027885692,0.00011726412,0.000034525285,0.0000022266133,0.000030727926,2.4904338e-7,0.00015727425,0.010568622,0.000004156581,0.64712167,0.008521221,0.33343926],"study_design_scores_gemma":[0.00018052993,0.000058283298,0.00006189724,0.000017725493,0.0000073594288,0.000002481661,0.000003300222,0.76073885,0.00005957373,0.1652246,0.0734629,0.00018247426],"about_ca_topic_score_codex":0.000121856516,"about_ca_topic_score_gemma":0.00003364978,"teacher_disagreement_score":0.75017023,"about_ca_system_score_codex":0.00006983379,"about_ca_system_score_gemma":0.0000804825,"threshold_uncertainty_score":0.98735404},"labels":[],"label_agreement":null},{"id":"W2025922761","doi":"10.1109/mm.2007.3","title":"A Top-Down Approach to Architecting CPI Component Performance Counters","year":2007,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"University of Illinois at Urbana-Champaign; Universiteit Gent; Advanced Micro Devices","keywords":"Computer science; Superscalar; Computation; Component (thermodynamics); Software; Branch predictor; Parallel computing; Event (particle physics); Out-of-order execution; Computer architecture; Component-based software engineering; Embedded system; Operating system; Software system; Programming language","score_opus":0.016239821527117473,"score_gpt":0.24783872814414148,"score_spread":0.231598906617024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025922761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25763044,0.000025869896,0.7342249,0.00010509726,0.00025067735,0.0001386996,4.9477876e-7,0.0004004115,0.0072233737],"genre_scores_gemma":[0.60337234,0.0000028017962,0.39570054,0.0006493497,0.000075733275,0.000004749654,0.0000010539019,0.0000072279036,0.00018618435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987569,0.000029431336,0.0002500461,0.00037280723,0.00019954328,0.0003912816],"domain_scores_gemma":[0.9992739,0.000054936456,0.00007405138,0.00041148404,0.00006784978,0.00011778966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069486455,0.00014093603,0.0001416864,0.00019825305,0.00018196942,0.00012538311,0.00079520926,0.000045052966,0.0000010067133],"category_scores_gemma":[0.000011284163,0.00013781618,0.00006204501,0.0004144294,0.000027199818,0.00012596004,0.00015217875,0.00016351868,0.00004187105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018288106,0.0011256924,0.0076516103,0.00027558947,0.00014856906,0.00005735798,0.027628632,0.35915852,0.22568402,0.004439949,0.047712468,0.3259347],"study_design_scores_gemma":[0.0006516626,0.00026740818,0.0040417253,0.00015136889,0.000008455394,0.00019746131,0.000094169984,0.52437425,0.44416368,0.00012829644,0.02496671,0.0009547972],"about_ca_topic_score_codex":0.000029265735,"about_ca_topic_score_gemma":0.0000014187563,"teacher_disagreement_score":0.34574193,"about_ca_system_score_codex":0.00007201846,"about_ca_system_score_gemma":0.00002663458,"threshold_uncertainty_score":0.56199807},"labels":[],"label_agreement":null},{"id":"W2025973479","doi":"10.5539/mas.v3n5p217","title":"VC++ Programming Implementation of Profile Processing for BMP Image File Extraction","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Font; Computer science; Artificial intelligence","score_opus":0.01746893136007107,"score_gpt":0.3303111926879345,"score_spread":0.31284226132786347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025973479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019735561,0.000012931151,0.99527454,0.00012591024,0.000029432691,0.0005940381,0.000005400717,0.000332495,0.0016517104],"genre_scores_gemma":[0.49644548,5.7326355e-7,0.5034129,0.000040532443,0.000012185547,0.00006140567,0.000005259879,0.000002684965,0.000018996843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866223,0.000008355532,0.00025248696,0.00042842497,0.00034649475,0.0003020147],"domain_scores_gemma":[0.9992088,0.000027556614,0.00023250395,0.00025899374,0.00021745946,0.000054702792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769093,0.000100512094,0.000113129565,0.00016260643,0.00034921966,0.0002500747,0.00064691895,0.000029555256,0.000010469715],"category_scores_gemma":[0.000021807711,0.00009810004,0.00003011852,0.0006713676,0.00009647605,0.00075457664,0.00006842582,0.00005834344,0.0000020747639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038400103,0.000040048973,0.0000056079616,0.000014316847,6.142563e-7,1.3964764e-7,0.0006458934,0.00028115962,0.18492118,0.002649656,0.0003197579,0.81111777],"study_design_scores_gemma":[0.00017429389,0.00008899811,0.0006790506,0.000014728223,0.0000022847123,0.0000025108618,0.00007239048,0.82241386,0.17096308,0.0052552614,0.00020011037,0.00013345889],"about_ca_topic_score_codex":0.000004952414,"about_ca_topic_score_gemma":8.584933e-7,"teacher_disagreement_score":0.8221327,"about_ca_system_score_codex":0.00005282742,"about_ca_system_score_gemma":0.00020342505,"threshold_uncertainty_score":0.40004036},"labels":[],"label_agreement":null},{"id":"W2027069801","doi":"10.1145/2145694.2145730","title":"Multi-ported memories for FPGAs via XOR","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Porting; Field-programmable gate array; Computer science; Logic block; Block (permutation group theory); XOR gate; Lookup table; Exploit; Parallel computing; Embedded system; Arithmetic; Computer hardware; Logic gate; Algorithm; Operating system; Mathematics","score_opus":0.03749762951035404,"score_gpt":0.2980741450194716,"score_spread":0.26057651550911753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027069801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002335396,0.00007118602,0.99586666,0.0003579852,0.0003047424,0.00017412254,5.3275636e-7,0.0009985372,0.0019927167],"genre_scores_gemma":[0.22289656,0.0000029170276,0.77512187,0.00034954032,0.00006667719,0.000022262397,0.000002440675,0.000005369588,0.0015323451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993323,0.000019836369,0.00014576424,0.00016087414,0.00008606976,0.0002551272],"domain_scores_gemma":[0.9994266,0.000058968886,0.000052111503,0.00029143627,0.00008966756,0.00008118662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002824065,0.00008541053,0.000095703384,0.000055373566,0.000107241685,0.0000574034,0.00037053213,0.00004281907,0.000012918548],"category_scores_gemma":[0.000043116757,0.00007165937,0.00004638785,0.00015217344,0.000017655064,0.00037075614,0.00010443752,0.000036835754,0.000022320224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044429376,0.0020228357,0.013878928,0.00017189494,0.00021882256,0.0000059622544,0.0075101815,0.007998516,0.008807676,0.3347753,0.25849274,0.3660727],"study_design_scores_gemma":[0.0003186738,0.000040920542,0.0012621185,0.000005798919,0.0000043653254,0.000008929684,0.000009037858,0.94067526,0.03708222,0.0012384941,0.01912986,0.00022434125],"about_ca_topic_score_codex":0.000008813137,"about_ca_topic_score_gemma":0.0000015518175,"teacher_disagreement_score":0.93267673,"about_ca_system_score_codex":0.000013035849,"about_ca_system_score_gemma":0.000015729196,"threshold_uncertainty_score":0.29221845},"labels":[],"label_agreement":null},{"id":"W2027453127","doi":"10.1109/xsw.2013.9","title":"Performance and Optimization Abstractions for Large Scale Heterogeneous Systems in the Cactus/Chemora Framework","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"California Institute of Technology","keywords":"Computer science; Stencil; Compiler; Parallel computing; Adaptive mesh refinement; SIMD; Vectorization (mathematics); Traverse; Block (permutation group theory); Code (set theory); Code generation; Implementation; Programming language; Runtime system; Set (abstract data type); Computational science; Operating system; Key (lock)","score_opus":0.013451185287979502,"score_gpt":0.2502812325992635,"score_spread":0.236830047311284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027453127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016313458,0.00006159925,0.9814993,0.00057939655,0.000116556934,0.0004765101,8.7303465e-7,0.0001812579,0.0007710115],"genre_scores_gemma":[0.6326188,0.00004312698,0.36684743,0.0002496252,0.000025014018,0.000119286015,0.0000023869068,0.000004099335,0.00009024975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993164,0.00003450221,0.00017384534,0.00019386964,0.00009915152,0.00018221705],"domain_scores_gemma":[0.9994202,0.00013795236,0.000059131264,0.00027471405,0.000077189674,0.000030806565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025797103,0.000082550505,0.00008863749,0.000065281194,0.00018341045,0.00030805185,0.00032157966,0.00006878787,0.000009258201],"category_scores_gemma":[0.00001948536,0.000059132348,0.000020448311,0.00016189314,0.000012478035,0.00035189933,0.00005017529,0.000089853,0.000009555793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013323906,0.0000558468,0.00067659543,0.000025602738,0.00000360968,3.4338527e-7,0.0006889304,0.9910365,0.0000071406935,0.003490115,0.0021163332,0.0018976883],"study_design_scores_gemma":[0.00009247567,0.000033566794,0.00065417844,0.000016972923,0.0000013736637,0.000018069686,0.00005947919,0.99818933,0.000086501735,0.000247774,0.0005177479,0.00008252843],"about_ca_topic_score_codex":0.00004811556,"about_ca_topic_score_gemma":0.0000029512944,"teacher_disagreement_score":0.61630535,"about_ca_system_score_codex":0.000015537336,"about_ca_system_score_gemma":0.000013004838,"threshold_uncertainty_score":0.2970551},"labels":[],"label_agreement":null},{"id":"W2027534015","doi":"10.1016/j.scico.2011.06.004","title":"Parallel execution of Java loops on Graphics Processing Units","year":2011,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Just-in-time compilation; Speedup; Parallel computing; Control flow; Java bytecode; Java; Compiler; Graphics; Bytecode; Optimizing compiler; Programming language; CUDA; General-purpose computing on graphics processing units; Operating system; Real time Java; Java annotation","score_opus":0.04446778688000051,"score_gpt":0.2719287597999689,"score_spread":0.22746097291996836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027534015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02046305,0.000057306635,0.9776225,0.00003862818,0.00018617496,0.00021541813,3.113101e-7,0.00031815632,0.0010984635],"genre_scores_gemma":[0.5126372,0.0000051223324,0.48729646,0.00003254042,0.000014549725,0.00000420602,4.7647873e-7,0.000004268928,0.000005194714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979582,0.000057971243,0.000454972,0.00048706273,0.00064717204,0.00039464515],"domain_scores_gemma":[0.99807703,0.000037171532,0.00042273506,0.00054313533,0.0008097311,0.000110176785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011130531,0.00016801561,0.00023564334,0.00056269695,0.00023554696,0.000116003655,0.0017607233,0.000061426996,0.0000012016205],"category_scores_gemma":[0.0000479762,0.00015287515,0.00005847271,0.0031222918,0.00061947864,0.0007690531,0.00037942853,0.0001409834,0.0000017648206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019470433,0.00037938938,0.0009659503,0.00010334904,0.000010776976,0.0000050882986,0.0049309894,0.004653145,0.0005179797,0.20941743,0.000085132946,0.7789113],"study_design_scores_gemma":[0.00043159167,0.0012258103,0.004384504,0.0005006205,0.000009863719,0.000022331918,0.000060701204,0.93925554,0.043814097,0.0094591575,0.0003652824,0.00047050646],"about_ca_topic_score_codex":0.000029946448,"about_ca_topic_score_gemma":6.915682e-7,"teacher_disagreement_score":0.9346024,"about_ca_system_score_codex":0.000024508929,"about_ca_system_score_gemma":0.0002813659,"threshold_uncertainty_score":0.62340677},"labels":[],"label_agreement":null},{"id":"W2028240990","doi":"10.1145/1854273.1854322","title":"The Paralax infrastructure","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Universiteit Gent; Queen's University; Queen's University Belfast","keywords":"Computer science; Pointer (user interface); Automatic parallelization; Parallel computing; Programming language; Artificial intelligence; Compiler","score_opus":0.004596364779982439,"score_gpt":0.23146623434433292,"score_spread":0.22686986956435048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028240990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016516962,0.000010364438,0.9651669,0.0026703419,0.00036777597,0.000039479437,5.3158345e-8,0.0005658529,0.029527506],"genre_scores_gemma":[0.4460441,0.000011320496,0.55137104,0.00076403405,0.000058259157,0.0000040808786,2.5573334e-7,0.000002810199,0.0017441197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960464,0.000013701927,0.00007383521,0.00010850343,0.00008470043,0.000114632916],"domain_scores_gemma":[0.9994216,0.000061512415,0.000025726067,0.00040539616,0.000039483584,0.000046271387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014511902,0.000046388293,0.00003280948,0.000016117965,0.00022169412,0.00019992393,0.00078987464,0.00003303918,0.000012835373],"category_scores_gemma":[0.00006247679,0.00002583327,0.00001995948,0.00012666405,0.000032552645,0.000103741666,0.00013626466,0.00014875684,0.000022221626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5757395e-7,0.0000038514568,0.00049733906,4.010715e-7,0.0000024277726,6.3535487e-7,0.000060408045,0.00043922442,0.00033628588,0.83843786,0.087152496,0.07306862],"study_design_scores_gemma":[0.0000852546,0.000020695112,0.0046149334,0.0000012880846,7.0446316e-7,0.000022756667,0.0000041190933,0.47109163,0.0048264675,0.08420306,0.43498322,0.00014587841],"about_ca_topic_score_codex":0.0000035034234,"about_ca_topic_score_gemma":0.0000048512748,"teacher_disagreement_score":0.7542348,"about_ca_system_score_codex":0.0000024611136,"about_ca_system_score_gemma":0.000031998574,"threshold_uncertainty_score":0.19278711},"labels":[],"label_agreement":null},{"id":"W2028429372","doi":"10.1145/1183401.1183409","title":"BranchTap","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speculation; Computer science; FIFO (computing and electronics); Instruction prefetch; Storage management; Preemption; Degradation (telecommunications); Key (lock); FIFO and LIFO accounting; Speculative execution; Parallel computing; Embedded system; Distributed computing; Operating system","score_opus":0.007570822388296432,"score_gpt":0.2239748011051881,"score_spread":0.21640397871689168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028429372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002973271,0.000022461465,0.8178923,0.0003741823,0.000040690476,0.000018084387,2.9364529e-8,0.00085507677,0.18049982],"genre_scores_gemma":[0.46136045,0.0000010287664,0.53493464,0.0002642052,0.000028773402,0.0000013018491,4.346215e-7,0.0000014836751,0.0034076918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967766,0.000009385423,0.00006601058,0.00010387328,0.000062824896,0.00008022315],"domain_scores_gemma":[0.9997612,0.0000117882455,0.000014728009,0.0001779158,0.00002152615,0.000012821443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055863566,0.000033697033,0.000033905762,0.00003286311,0.000039032686,0.000060476865,0.00027424702,0.00001502819,0.000012950005],"category_scores_gemma":[0.0000024558271,0.000028857063,0.000016656599,0.00013621782,0.000006535305,0.00011227309,0.00005427536,0.000021113858,0.0000523613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9933613e-7,0.000021750378,0.000466446,9.406165e-7,8.268719e-7,0.0000017986731,0.00001054717,0.003217907,0.00013386318,0.9210062,0.065640636,0.009498895],"study_design_scores_gemma":[0.00018933565,0.000030314586,0.0050689005,0.0000048759493,7.7557667e-7,0.000013894352,8.322443e-7,0.80476224,0.018309226,0.104855314,0.066528596,0.0002356899],"about_ca_topic_score_codex":0.00003729016,"about_ca_topic_score_gemma":0.0000016339945,"teacher_disagreement_score":0.8161509,"about_ca_system_score_codex":0.0000047873837,"about_ca_system_score_gemma":0.0000077142995,"threshold_uncertainty_score":0.11767569},"labels":[],"label_agreement":null},{"id":"W2028757486","doi":"10.1049/ip-cdt:20050084","title":"Improving energy-efficiency in high-performance processors by bypassing trivial instructions","year":2006,"lang":"en","type":"article","venue":"IEE Proceedings - Computers and Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computation; Computer science; Spec#; Efficient energy use; Energy consumption; Parallel computing; Energy (signal processing); Algorithm; Mathematics; Electrical engineering; Programming language","score_opus":0.004508871287032249,"score_gpt":0.1931490618463108,"score_spread":0.18864019055927855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028757486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19903958,0.000112470996,0.79544187,0.00017226947,0.00010472628,0.00017836766,0.0000033758413,0.0017977284,0.0031496256],"genre_scores_gemma":[0.8571682,0.000035669986,0.14245716,0.00009598388,0.00008646908,0.000039949482,0.0000073558876,0.00001864438,0.000090577814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981575,0.0000071511276,0.00048118638,0.0006477738,0.00027013652,0.00043625667],"domain_scores_gemma":[0.9993522,0.000032158594,0.0002367223,0.00014672666,0.00014942167,0.000082782484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00017955803,0.00029418722,0.00028121396,0.0004312728,0.0002599236,0.0013087126,0.00062677084,0.00013575102,3.2212515e-7],"category_scores_gemma":[0.000018822522,0.00029011385,0.000042687538,0.000871222,0.00012519551,0.002459201,0.0003414438,0.00019169837,5.360972e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025981177,0.0004843976,0.008699024,0.00017674909,0.000011601524,0.000008412781,0.00029316783,0.00033642072,0.004030863,0.06511519,0.010676372,0.9101418],"study_design_scores_gemma":[0.0009922234,0.00074981427,0.0015813017,0.0004932417,0.000009309619,0.00017476118,0.000029703866,0.8293618,0.13561802,0.022956686,0.0064757015,0.0015574328],"about_ca_topic_score_codex":0.00014853729,"about_ca_topic_score_gemma":0.0000012216528,"teacher_disagreement_score":0.90858436,"about_ca_system_score_codex":0.00008505578,"about_ca_system_score_gemma":0.000047687674,"threshold_uncertainty_score":0.9999551},"labels":[],"label_agreement":null},{"id":"W2028950884","doi":"10.5555/1071565.1071569","title":"A quantitative analysis of Java bytecode sequences","year":2004,"lang":"en","type":"article","venue":"Principles and Practice of Programming in Java","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Bytecode; Computer science; Java bytecode; Programming language; Just-in-time compilation; Java; Optimizing compiler; Compiler; Set (abstract data type); Interpreter; Theoretical computer science; Parallel computing; Java applet; Java annotation","score_opus":0.05524335860173798,"score_gpt":0.3493397641702837,"score_spread":0.2940964055685457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028950884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047270942,0.00090442004,0.9485899,0.0008377771,0.00002985717,0.00017804872,0.0000017883195,0.0000923165,0.0020949345],"genre_scores_gemma":[0.45395818,0.00019879667,0.54580206,0.000021863261,0.000002351972,0.0000056895014,0.0000014092371,0.0000024559085,0.0000071790246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876654,0.00014486614,0.00043754835,0.00027293022,0.00021220926,0.00016588534],"domain_scores_gemma":[0.99836075,0.00065033213,0.00048945006,0.00026289286,0.0001941111,0.000042475862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013550225,0.00010266108,0.0002889682,0.00038718124,0.000049622828,0.00006929896,0.00036303067,0.000053017873,0.0000016119598],"category_scores_gemma":[0.0009806056,0.0000950805,0.000066222914,0.0013799819,0.00010799665,0.000524041,0.00017130381,0.00010769236,5.235072e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011293672,0.0006596882,0.009364611,0.00015753885,0.0006350827,0.000028894277,0.011572526,0.24212652,0.0007759533,0.6475662,0.0000053719014,0.08699466],"study_design_scores_gemma":[0.0016893052,0.002280772,0.015428375,0.0005638383,0.0008471413,0.000073941526,0.0032454063,0.9341135,0.010977127,0.012722579,0.017046817,0.0010112171],"about_ca_topic_score_codex":0.0006082606,"about_ca_topic_score_gemma":0.000086638436,"teacher_disagreement_score":0.691987,"about_ca_system_score_codex":0.000023816667,"about_ca_system_score_gemma":0.000080619975,"threshold_uncertainty_score":0.38772702},"labels":[],"label_agreement":null},{"id":"W2029227733","doi":"10.1109/cjece.2005.1541732","title":"Design of embedded compute-intensive processing elements and their scheduling in a reconfigurable environment","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Control reconfiguration; Computer science; Scheduling (production processes); Graphics; Parallel computing; Distributed computing; Data-flow analysis; Data flow diagram; Compiler; Computer architecture; Computer engineering; Embedded system; Programming language; Database; Mathematical optimization","score_opus":0.011098897505626254,"score_gpt":0.19256735772123698,"score_spread":0.18146846021561072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029227733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03167504,0.0018262212,0.9662067,0.00016872336,0.000034146597,0.00006574637,1.7882752e-7,0.000014165541,0.000009021868],"genre_scores_gemma":[0.64190185,0.0000562862,0.3579119,0.00008635002,0.0000366107,6.7673284e-7,1.2795999e-7,0.000004494684,0.0000017182947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991498,0.00003068097,0.00036796095,0.00014206128,0.00007038594,0.00023909955],"domain_scores_gemma":[0.9994142,0.00008224636,0.00013127498,0.00007413416,0.00008966206,0.0002084675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027275833,0.00011593732,0.00023485937,0.0003607102,0.00004340057,0.00007663699,0.00022022528,0.000043382865,0.0000010769174],"category_scores_gemma":[0.000023725624,0.00010372619,0.000024364805,0.00020568435,0.000017192637,0.00020116486,0.000023039074,0.00018932547,1.6719973e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036135775,0.000011832917,0.0002815346,0.000014404267,0.00001643792,0.000017681556,0.0008252077,0.8502944,0.00042099468,0.0003346201,0.000038612423,0.14774066],"study_design_scores_gemma":[0.00024946567,0.00014843463,0.0005472696,0.00011805377,0.0000023333891,0.00013023477,0.000005917021,0.9971004,0.0012928993,0.00013367279,0.00016530242,0.00010599163],"about_ca_topic_score_codex":0.000025264964,"about_ca_topic_score_gemma":0.0000056988342,"teacher_disagreement_score":0.6102268,"about_ca_system_score_codex":0.00006703275,"about_ca_system_score_gemma":0.00013672985,"threshold_uncertainty_score":0.4229831},"labels":[],"label_agreement":null},{"id":"W2029783178","doi":"10.1016/j.parco.2012.03.002","title":"Criticality guided energy aware speculation for speculative multithreaded processors","year":2012,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Criticality; Computer science; Thread (computing); Energy consumption; Speculative execution; Computation; Embedded system; Execution model; Architecture; Efficient energy use; Speculation; Parallel computing; Computer architecture; Distributed computing; Operating system; Engineering","score_opus":0.055119393897003634,"score_gpt":0.33282130491433304,"score_spread":0.2777019110173294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029783178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027692325,0.00018009859,0.9923728,0.0005074986,0.0003401776,0.0003476223,0.0000024046087,0.0009940041,0.0024861246],"genre_scores_gemma":[0.56717855,0.0000033625704,0.43211833,0.00030194147,0.00025645585,0.000018239598,0.000017090433,0.00001561771,0.000090443704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767727,0.00015857644,0.00055885146,0.00053214544,0.00032590033,0.00074727513],"domain_scores_gemma":[0.9983093,0.00036062003,0.0002456107,0.0004800635,0.0003902908,0.00021407382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076712586,0.00028571064,0.00033212797,0.0001476794,0.00042267138,0.00017858943,0.00067625975,0.00012586548,0.000008598758],"category_scores_gemma":[0.00021033024,0.00028627634,0.00015397351,0.00043292678,0.00006064801,0.0006049773,0.00030859595,0.00013182433,0.000017558754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004833857,0.0007013424,0.010605168,0.00022482032,0.00014134195,0.0000058683872,0.0047339406,0.17026922,0.00040175032,0.7656099,0.00889927,0.038359027],"study_design_scores_gemma":[0.0005243667,0.000041235988,0.0024433506,0.00004886337,0.000011259047,0.000015244008,0.00002984352,0.9828248,0.0023450546,0.009084678,0.0022185186,0.000412792],"about_ca_topic_score_codex":0.00003264958,"about_ca_topic_score_gemma":0.0000015290793,"teacher_disagreement_score":0.81255555,"about_ca_system_score_codex":0.00010678196,"about_ca_system_score_gemma":0.000056027762,"threshold_uncertainty_score":0.99995893},"labels":[],"label_agreement":null},{"id":"W2030134136","doi":"10.1145/2552999.2553004","title":"Ada and many-core platforms","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Programmer; Computer science; Core (optical fiber); Distributed computing; Many core; Software engineering; Programming language; Parallel computing; Telecommunications","score_opus":0.017692085922585147,"score_gpt":0.22841984504719656,"score_spread":0.21072775912461142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030134136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4008055,0.00008212449,0.589713,0.007928815,0.00017168281,0.00019792475,4.7685506e-7,0.0006048234,0.00049567106],"genre_scores_gemma":[0.65649056,0.000020193165,0.33193272,0.011305132,0.00006327029,0.00002537689,0.000002942139,0.000012833442,0.00014700592],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891895,0.0000122698875,0.00019618697,0.00035416958,0.00021982632,0.0002986109],"domain_scores_gemma":[0.9989091,0.00012688302,0.00008105383,0.0007316883,0.000041421707,0.0001098079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011470242,0.00016058462,0.00014567771,0.00009429128,0.00014228435,0.00023612761,0.0010479919,0.000055040324,0.000023586374],"category_scores_gemma":[0.00005797472,0.00013769088,0.000037699243,0.0002045042,0.000055654567,0.0006572111,0.00053260353,0.00014804011,0.00006483755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013127668,0.00011876306,0.020535052,0.000113999355,0.00012346444,0.00012069413,0.003119362,0.004739953,0.023411883,0.039376155,0.7733424,0.13498516],"study_design_scores_gemma":[0.0030222842,0.00057177374,0.063110694,0.00041095904,0.000041274096,0.0003896894,0.00024685144,0.7488754,0.03580187,0.10239474,0.041200254,0.003934212],"about_ca_topic_score_codex":0.00017185928,"about_ca_topic_score_gemma":0.0000022278687,"teacher_disagreement_score":0.74413544,"about_ca_system_score_codex":0.000023973784,"about_ca_system_score_gemma":0.00001650216,"threshold_uncertainty_score":0.56148714},"labels":[],"label_agreement":null},{"id":"W2030183445","doi":"10.1109/pact.2007.23","title":"Component-Based Lock Allocation","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Thread (computing); Critical section; Allocator; Correctness; Lock (firearm); Distributed computing; Parallel computing; Component (thermodynamics); Java; Operating system; Programming language; Engineering","score_opus":0.015931559432325573,"score_gpt":0.26396500928285527,"score_spread":0.2480334498505297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030183445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007326328,0.000010493684,0.9646764,0.00062563235,0.000085533546,0.00005945706,4.933503e-8,0.0009797128,0.03283012],"genre_scores_gemma":[0.52705115,6.8548184e-7,0.4720097,0.00071600405,0.000014055946,9.055378e-7,0.0000018421695,0.0000022083784,0.00020344023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993889,0.000017645454,0.0001411704,0.00016435704,0.00013937353,0.00014855858],"domain_scores_gemma":[0.99949384,0.00005842166,0.00004126092,0.00028219167,0.00007205805,0.00005224076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003902719,0.000060017792,0.000054916607,0.00009793347,0.00006608716,0.000055390876,0.0003914655,0.000032376167,0.000013709507],"category_scores_gemma":[0.000012413986,0.000055296707,0.000025014027,0.00024668843,0.0000134028105,0.00011197243,0.000051330648,0.000044692388,0.000041759573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016230339,0.00034935627,0.002837939,0.000017631995,0.000015004599,0.000018292778,0.00021826471,0.04495579,0.003406999,0.73427385,0.020630902,0.19325973],"study_design_scores_gemma":[0.0001672865,0.0000350461,0.0015013369,0.000005122733,8.2106163e-7,0.000002774116,0.0000028847594,0.95427775,0.03573892,0.00086638966,0.0072742226,0.00012744316],"about_ca_topic_score_codex":0.000018406157,"about_ca_topic_score_gemma":0.0000029277837,"teacher_disagreement_score":0.90932196,"about_ca_system_score_codex":0.00002322415,"about_ca_system_score_gemma":0.000024194167,"threshold_uncertainty_score":0.22549343},"labels":[],"label_agreement":null},{"id":"W2030254671","doi":"10.1145/2145694.2145744","title":"EmPower","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MPSoC; Computer science; Embedded system; Emulation; Design space exploration; Frequency scaling; Computer architecture; System on a chip; Power management; Field-programmable gate array; Clock gating; Benchmarking; Software; Multi-core processor; Power gating; Power (physics); Operating system; Engineering; Jitter","score_opus":0.01755806943674281,"score_gpt":0.26978645225081327,"score_spread":0.25222838281407045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030254671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028454757,0.00008379375,0.87523955,0.00023356857,0.00012987766,0.000015366875,1.6566101e-8,0.00061280245,0.12340046],"genre_scores_gemma":[0.5495945,0.0000019393613,0.4485887,0.0004509144,0.000027592254,0.0000010724895,1.219785e-7,0.0000011819459,0.0013339717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997013,0.000012019542,0.00004805566,0.000057913174,0.000057056863,0.00012365787],"domain_scores_gemma":[0.99973387,0.000012567327,0.000011850688,0.00017999532,0.000015350908,0.000046378824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011914032,0.000030651758,0.00002918275,0.000027008698,0.000031482723,0.000029203859,0.00023446811,0.000014944164,0.00003475516],"category_scores_gemma":[0.000007446301,0.000024636998,0.000014282152,0.000102206424,0.0000048614365,0.00027870198,0.00008528667,0.00002334705,0.00013797838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.542186e-7,0.00006695165,0.0055467216,0.0000013179039,0.0000037689626,4.3245132e-7,0.00044523948,0.00007239627,0.000054791642,0.88086736,0.08144865,0.03149203],"study_design_scores_gemma":[0.0003502981,0.00008494358,0.019277351,0.000011950091,0.0000032594546,0.000055369837,0.000020421123,0.3162726,0.036923748,0.012514197,0.613717,0.0007688651],"about_ca_topic_score_codex":0.0000020640166,"about_ca_topic_score_gemma":4.5088274e-8,"teacher_disagreement_score":0.8683531,"about_ca_system_score_codex":0.000004865255,"about_ca_system_score_gemma":0.0000047682074,"threshold_uncertainty_score":0.17734788},"labels":[],"label_agreement":null},{"id":"W2030685115","doi":"10.1088/1742-6596/256/1/012007","title":"Accelerated Synchrotron X-ray Diffraction Data Analysis on a Heterogeneous High Performance Computing System","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Synchrotron; Software; Xeon Phi; Supercomputer; Computational science; Data analysis; Computer science; IBM; Diffraction; Computation; Operating system; Materials science; Optics; Data mining; Physics; Nanotechnology; Algorithm","score_opus":0.0343443754869152,"score_gpt":0.27376544310205025,"score_spread":0.23942106761513504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030685115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33681065,0.000006701054,0.6624228,0.00009608592,0.0003865621,0.000051548577,0.0000034803709,0.00012051626,0.000101672646],"genre_scores_gemma":[0.9284538,0.000024101408,0.07119296,0.00003527872,0.00025349515,8.430336e-7,0.000013255657,0.000008669993,0.000017607503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984401,0.0001238112,0.0004963495,0.00031095746,0.0004120185,0.0002167971],"domain_scores_gemma":[0.99751365,0.00009101546,0.0008323887,0.0008675443,0.0006080064,0.00008738895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465229,0.00018978972,0.00041025915,0.00020583207,0.0002812186,0.00045778544,0.0015838771,0.000074479765,0.000005462066],"category_scores_gemma":[0.000042385094,0.00016025805,0.000089820074,0.000702988,0.000054576012,0.0014472628,0.0002863012,0.00057843083,0.0000059500717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015117684,0.00041076154,0.002249782,0.0001454045,0.00107722,0.00006481387,0.0012008206,0.6353406,0.021259824,0.051786568,0.00025768316,0.28605536],"study_design_scores_gemma":[0.00021043411,0.00032669108,0.0056954036,0.00010107378,0.000101348734,0.00006629945,0.00003784187,0.9522361,0.04067591,0.00023357604,0.00009153416,0.00022376026],"about_ca_topic_score_codex":0.000016229607,"about_ca_topic_score_gemma":0.0000037426332,"teacher_disagreement_score":0.59164315,"about_ca_system_score_codex":0.00004342339,"about_ca_system_score_gemma":0.00014937886,"threshold_uncertainty_score":0.6535134},"labels":[],"label_agreement":null},{"id":"W2031043969","doi":"10.1109/mm.2014.4","title":"Cache Coherence for GPU Architectures","year":2014,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada); University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Game and Wildlife Conservation Trust; Nvidia","keywords":"Computer science; Parallel computing; Cache coherence; Multi-core processor; CUDA; Computer architecture; Java; Coherence (philosophical gambling strategy); Programming paradigm; General-purpose computing on graphics processing units; Cache; CPU cache; Operating system; Programming language; Graphics; Cache algorithms","score_opus":0.017083847244708256,"score_gpt":0.2612078740135595,"score_spread":0.24412402676885123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031043969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076993564,0.000049839287,0.98951817,0.0004050548,0.00023544364,0.0001388688,0.0000014507631,0.00043669727,0.001515129],"genre_scores_gemma":[0.4782219,0.0000014117649,0.5205542,0.000674978,0.00008919055,0.000018089544,0.0000011078631,0.0000061841365,0.00043297044],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993377,0.000043817123,0.0001175556,0.00024219579,0.00007284698,0.00018589351],"domain_scores_gemma":[0.99936986,0.00013820016,0.000054709828,0.00033522776,0.00005826676,0.000043758067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022220427,0.00008864484,0.00010001388,0.000054450255,0.00010207062,0.00008674681,0.0006427679,0.00004282225,0.0000022046231],"category_scores_gemma":[0.00004461404,0.00007912635,0.000048848695,0.000106535794,0.000027875638,0.000036830326,0.0000531391,0.000066947156,0.000015774123],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003677038,0.00021734551,0.00088168244,0.00012364166,0.00006237571,0.0000045452416,0.0026631716,0.09056077,0.17346857,0.02633999,0.24832317,0.45731798],"study_design_scores_gemma":[0.0004334357,0.00018131822,0.00032660642,0.00003304945,0.0000050030153,0.00001968242,0.0000021046997,0.4323138,0.4705459,0.020757917,0.07501256,0.00036863363],"about_ca_topic_score_codex":0.000012802212,"about_ca_topic_score_gemma":0.0000029003445,"teacher_disagreement_score":0.47052252,"about_ca_system_score_codex":0.000010958365,"about_ca_system_score_gemma":0.000022577642,"threshold_uncertainty_score":0.3226679},"labels":[],"label_agreement":null},{"id":"W2032609375","doi":"10.1145/367845.368011","title":"Multi-dispatch in the <i>Java Virtual Machine</i> (poster session)","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Alberta","funders":"","keywords":"Computer science; Java; Programming language; strictfp; Programmer; Java concurrency; Operating system; Real time Java; Java annotation; Generics in Java; Economic dispatch; Java Modeling Language; Virtual machine","score_opus":0.01498576016538766,"score_gpt":0.2623627013083266,"score_spread":0.24737694114293896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032609375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009173903,0.000050339877,0.96322465,0.0023296578,0.000070858376,0.0001520729,6.723345e-7,0.0004373523,0.024560466],"genre_scores_gemma":[0.74778646,0.000038347054,0.24109392,0.006410001,0.000026597876,0.000013183052,0.000002915716,0.000006561995,0.00462199],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902624,0.00015404113,0.00018910441,0.00025218946,0.00018416197,0.00019427904],"domain_scores_gemma":[0.9993764,0.00008047659,0.000026923657,0.00046106416,0.000020944828,0.000034195204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035042252,0.00010630057,0.00009275041,0.00005373999,0.00010004299,0.00014722801,0.0010236452,0.000046765646,0.00015901634],"category_scores_gemma":[0.000010087746,0.0000643701,0.000038736485,0.00034608092,0.00002165584,0.00025333342,0.000101899226,0.00014686161,0.00015307168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039406077,0.0012852282,0.013547993,0.000014888247,0.000019834655,0.0001172747,0.010167348,0.04464083,0.00028665463,0.019625045,0.07577837,0.8344771],"study_design_scores_gemma":[0.00048024586,0.000077477314,0.0054726806,0.00002094691,0.000001343382,0.00003159305,0.000024997044,0.97890884,0.00058349053,0.0003350285,0.0138384495,0.00022491961],"about_ca_topic_score_codex":0.00010495495,"about_ca_topic_score_gemma":0.000029943134,"teacher_disagreement_score":0.934268,"about_ca_system_score_codex":0.000011304974,"about_ca_system_score_gemma":0.000019610203,"threshold_uncertainty_score":0.26249367},"labels":[],"label_agreement":null},{"id":"W2033042165","doi":"10.1145/1576702.1576739","title":"Parallel sparse polynomial multiplication using heaps","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Heap (data structure); Computer science; Parallel computing; Speedup; Scalability; Cache; Multi-core processor; Multiplication (music); Cache-oblivious algorithm; Cache algorithms; CPU cache; Algorithm; Mathematics; Operating system; Combinatorics","score_opus":0.03312976878881403,"score_gpt":0.287731498095359,"score_spread":0.25460172930654495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033042165","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044260323,0.000035257635,0.9882359,0.0011524794,0.00007418721,0.000111691974,1.6462079e-7,0.00088541943,0.0050788866],"genre_scores_gemma":[0.41840598,0.000005729006,0.5806447,0.00072479405,0.000044443837,0.0000012222994,0.000001082253,0.0000023378773,0.00016971724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992061,0.00003415449,0.00018033748,0.00026947423,0.00012305238,0.00018683297],"domain_scores_gemma":[0.99938464,0.000019132427,0.00006606179,0.0004090271,0.000054716427,0.000066449305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014194455,0.00009590627,0.00009797183,0.000088272725,0.000121755045,0.00011415937,0.0004728451,0.000051789266,0.0000065029803],"category_scores_gemma":[0.000015804362,0.00009011097,0.000042142925,0.00024040874,0.0000129416185,0.0002989655,0.00006450841,0.00006509822,0.000024574949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004821423,0.0007060604,0.0013521214,0.000009911403,0.000028246717,0.000017971306,0.0013350795,0.3803559,0.018512351,0.20609601,0.057946753,0.3335914],"study_design_scores_gemma":[0.00018953344,0.00004394512,0.0013280254,0.000005532781,0.0000013758354,0.000011851295,0.0000023711416,0.99244744,0.0027749455,0.0015287744,0.001523239,0.00014295636],"about_ca_topic_score_codex":0.0000293122,"about_ca_topic_score_gemma":8.0013984e-7,"teacher_disagreement_score":0.61209154,"about_ca_system_score_codex":0.000034257173,"about_ca_system_score_gemma":0.00003536631,"threshold_uncertainty_score":0.36746186},"labels":[],"label_agreement":null},{"id":"W2033171136","doi":"10.1145/1923947.1924007","title":"Cache-oblivious algorithms, a key to better performance","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Cache; Central processing unit; CPU shielding; CPU cache; Parallel computing; Cache coloring; Operating system; Key (lock); Pipeline burst cache; Embedded system","score_opus":0.01009558704463037,"score_gpt":0.24132502068978062,"score_spread":0.23122943364515025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033171136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06422483,0.0000035017702,0.9144149,0.0021232213,0.00030184144,0.00010096704,2.894316e-7,0.00095553586,0.017874934],"genre_scores_gemma":[0.35950294,0.0000022027352,0.6365654,0.0023677228,0.00006930838,0.000010064259,6.2689617e-7,0.000005405312,0.0014763189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991427,0.000015846235,0.00014234484,0.00028885735,0.00017137325,0.00023886803],"domain_scores_gemma":[0.99922186,0.000024771687,0.000030171246,0.0005200808,0.00008452342,0.000118572934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022367827,0.0001042686,0.000093926865,0.00012126059,0.00011136158,0.00015383774,0.00081882114,0.000057367553,0.000038041188],"category_scores_gemma":[0.000020852027,0.00008903837,0.000029683488,0.00033009582,0.000016720232,0.00024834956,0.00027117427,0.00018205642,0.0002369177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006100703,0.00020641762,0.007245351,0.000019467567,0.000023158304,0.000019173605,0.0029152941,0.0036455032,0.0044456394,0.02754104,0.14226316,0.8116697],"study_design_scores_gemma":[0.00017072554,0.00013648703,0.005259792,0.000010302825,0.0000019496226,0.000039993472,0.0000031988336,0.91147995,0.019930188,0.0007948259,0.061785832,0.00038675178],"about_ca_topic_score_codex":0.000026693622,"about_ca_topic_score_gemma":0.000008928536,"teacher_disagreement_score":0.9078345,"about_ca_system_score_codex":0.000009566318,"about_ca_system_score_gemma":0.000030084382,"threshold_uncertainty_score":0.36308792},"labels":[],"label_agreement":null},{"id":"W2033647326","doi":"10.1007/s11227-014-1086-0","title":"An analytical study of resource division and its impact on power and performance of multi-core processors","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Benchmark (surveying); Computer science; Division (mathematics); Power consumption; Resource (disambiguation); Power (physics); Core (optical fiber); Multi-core processor; Chip; Architecture; Microarchitecture; Parallel computing; Distributed computing; Computer architecture; Embedded system; Computer engineering; Telecommunications; Computer network; Arithmetic","score_opus":0.028537090420772605,"score_gpt":0.3203201213855511,"score_spread":0.2917830309647785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033647326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93479323,0.00008926353,0.0649398,0.000032120883,0.000018122222,0.000082974024,1.8485382e-7,0.000018901026,0.000025407186],"genre_scores_gemma":[0.9935634,0.000013849639,0.006373143,0.000023503053,0.000017716795,9.467673e-8,8.251559e-8,0.000006265196,0.000001934523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879193,0.00021211404,0.0004379915,0.0001267815,0.0002971848,0.00013401863],"domain_scores_gemma":[0.9989136,0.0002795767,0.0003038481,0.00021391558,0.00021292621,0.00007615732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020640977,0.000114166214,0.00027651218,0.00016465594,0.00012434516,0.00003349268,0.0004761049,0.000034146346,6.2633865e-7],"category_scores_gemma":[0.00010309558,0.000066508044,0.00003413102,0.00022589455,0.000044911074,0.00024991797,0.00016446864,0.00020310617,1.14278436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004181004,0.0019106058,0.29580128,0.00015507435,0.00014651132,0.0000059762,0.052185312,0.5913647,0.0029205144,0.00053870876,0.000059610902,0.054493647],"study_design_scores_gemma":[0.00044556052,0.0035934532,0.123174846,0.00014268157,0.00001197161,0.000036192065,0.00025664756,0.871499,0.0007542005,0.000019104562,0.0000012163152,0.00006512306],"about_ca_topic_score_codex":0.000007172452,"about_ca_topic_score_gemma":2.7727276e-7,"teacher_disagreement_score":0.28013435,"about_ca_system_score_codex":0.000010461452,"about_ca_system_score_gemma":0.000019302233,"threshold_uncertainty_score":0.27121195},"labels":[],"label_agreement":null},{"id":"W2033682515","doi":"10.1145/1509288.1509289","title":"Reducing memory requirements of resource-constrained applications","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Locality; Cache; Optimizing compiler; Reuse; Computing with Memory; Parallel computing; Embedded system; Memory management; Computer architecture; Distributed computing; Uniform memory access; Overlay; Operating system","score_opus":0.024635704374377895,"score_gpt":0.28474315318789384,"score_spread":0.26010744881351594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033682515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017728881,0.00012274653,0.9885271,0.0003201516,0.00024365926,0.00058015354,0.0000037470777,0.0009062844,0.007523247],"genre_scores_gemma":[0.80825067,0.0000074264885,0.19121508,0.00014494012,0.00007018109,0.000012345993,0.0000037259967,0.000012854115,0.00028276554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763376,0.00020673838,0.00078423764,0.0005869188,0.0004288662,0.00035947398],"domain_scores_gemma":[0.9974467,0.00025721773,0.0003956704,0.0015934352,0.00018935351,0.000117595206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070920656,0.00024204147,0.00036457443,0.00039179047,0.00033562817,0.00014965009,0.0014918279,0.00012260812,0.0000055059163],"category_scores_gemma":[0.000036159716,0.00025484318,0.00014765936,0.0008984069,0.0000603809,0.00022366647,0.000024775263,0.00025850302,0.000022818833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016459351,0.00039865138,0.0000057874126,0.00006635114,0.00007323319,0.000004182575,0.0019969158,0.7772876,0.0021986694,0.010134176,0.000629047,0.2071889],"study_design_scores_gemma":[0.0010028824,0.0005068594,0.00007334388,0.0005960326,0.00003874492,0.000095724055,0.0004645265,0.9783988,0.014309233,0.0025264327,0.0013377981,0.0006496064],"about_ca_topic_score_codex":0.000018640178,"about_ca_topic_score_gemma":2.0757007e-7,"teacher_disagreement_score":0.8064778,"about_ca_system_score_codex":0.00009125773,"about_ca_system_score_gemma":0.0000838689,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W2034186798","doi":"10.1109/sbac-pad.2014.34","title":"Reducing Compiler-Inserted Instrumentation in Unified-Parallel-C Code Generation","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Partitioned global address space; Computer science; Compiler; Executor; Instrumentation (computer programming); Parallel computing; Supercomputer; Code (set theory); Programming language; Optimizing compiler; Synchronization (alternating current); Transformation (genetics); Runtime system; Operating system; Programming paradigm; Set (abstract data type)","score_opus":0.030390653138862144,"score_gpt":0.27185536294749874,"score_spread":0.2414647098086366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034186798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061671533,0.000007853359,0.9290294,0.0006849393,0.00016029812,0.00012694999,2.0449124e-7,0.0005210892,0.007797717],"genre_scores_gemma":[0.63059115,0.0000088434035,0.3687655,0.00041387687,0.00003584603,0.000007950452,0.000013761646,0.0000044740277,0.00015858097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988926,0.00015360868,0.00029598,0.00031963194,0.00015987335,0.0001782711],"domain_scores_gemma":[0.9994368,0.000039070575,0.00008859127,0.00032705802,0.000061809034,0.00004666903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004046927,0.00010635903,0.00012385346,0.00019209903,0.00009936641,0.00014665439,0.0003780212,0.000058262525,0.0000114394215],"category_scores_gemma":[0.000032860273,0.00010579343,0.000023993445,0.00040453297,0.000016263475,0.0003942955,0.00008719131,0.000092830844,0.000021745513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011264287,0.00016495748,0.003221923,0.000014827636,0.000011543369,0.0000029011826,0.0012988137,0.590278,0.00757994,0.26512876,0.009403017,0.12288405],"study_design_scores_gemma":[0.00034610738,0.000049636183,0.0025773814,0.000012586216,8.9113104e-7,0.000003232311,0.0000062857157,0.9889551,0.005753497,0.0015059585,0.0006529927,0.00013632697],"about_ca_topic_score_codex":0.000130517,"about_ca_topic_score_gemma":0.00006889414,"teacher_disagreement_score":0.56891966,"about_ca_system_score_codex":0.000053739383,"about_ca_system_score_gemma":0.000031262905,"threshold_uncertainty_score":0.43141308},"labels":[],"label_agreement":null},{"id":"W2034691640","doi":"10.1109/iccd.2014.6974694","title":"A Thread-Aware Adaptive Data Prefetcher","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Instruction prefetch; Computer science; Thread (computing); Shared memory; Parallel computing; Multi-core processor; Scalability; Cache coherence; Cache; Operating system; Distributed computing; Embedded system; CPU cache; Cache algorithms","score_opus":0.06301746729101097,"score_gpt":0.2886302116260703,"score_spread":0.2256127443350593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034691640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049706876,0.000017800297,0.9595234,0.0004976793,0.000066416746,0.00006290868,0.0000010151681,0.00095772254,0.038823374],"genre_scores_gemma":[0.207855,0.0000056272315,0.79011875,0.00066237384,0.000050007107,0.0000035462144,0.000008129114,0.0000055301207,0.0012910077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991836,0.000055543296,0.00011257209,0.0003674119,0.00013455252,0.00014631939],"domain_scores_gemma":[0.99848664,0.000055892175,0.00004279463,0.0013052612,0.00005847595,0.000050916566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031492492,0.000081184946,0.000088933964,0.000040193932,0.00006420136,0.000091160284,0.0017535696,0.000039223563,0.000019762694],"category_scores_gemma":[0.000033898938,0.0000658394,0.000016390713,0.00016526664,0.000017754226,0.00039595744,0.0008764135,0.00006829678,0.000077533456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048424877,0.00009132334,0.00038458686,0.0000069614302,0.00002282573,0.000002051314,0.0003128592,0.0026414394,0.000014411934,0.73982936,0.11365589,0.14303346],"study_design_scores_gemma":[0.00008661038,0.00004608971,0.00018892699,0.000007938659,0.000001498863,0.0000027871838,0.0000038098917,0.96414715,0.00029524605,0.016779179,0.01832347,0.00011727933],"about_ca_topic_score_codex":0.000027971735,"about_ca_topic_score_gemma":0.0000056027147,"teacher_disagreement_score":0.9615057,"about_ca_system_score_codex":0.000008551963,"about_ca_system_score_gemma":0.000025318775,"threshold_uncertainty_score":0.32585979},"labels":[],"label_agreement":null},{"id":"W2034886984","doi":"10.1145/2446920.2446921","title":"Automatic speculative parallelization of loops using polyhedral dependence analysis","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Speculative multithreading; Parallel computing; Computer science; Automatic parallelization; Heuristics; Speculative execution; Speedup; Heuristic; Dependence analysis; Speculation; IBM; Multiprocessing; Multithreading; Compiler; Programming language; Operating system; Physics","score_opus":0.020046500814283753,"score_gpt":0.2729445485301067,"score_spread":0.2528980477158229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034886984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12248092,0.000016106525,0.8758177,0.00007409392,0.000020662088,0.00012653459,1.778568e-7,0.0002928988,0.001170866],"genre_scores_gemma":[0.55824196,0.0000018954152,0.44163328,0.00005128484,0.000004772514,0.0000023636562,0.0000013349829,0.000002318519,0.000060769333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989853,0.00007655559,0.00031103622,0.00023610359,0.00023292418,0.0001580942],"domain_scores_gemma":[0.99911743,0.000052359872,0.00018710853,0.00037982408,0.00021057979,0.000052718846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013553689,0.00010194096,0.00020523794,0.00030361547,0.000065403554,0.000095175055,0.0004704129,0.000045971465,0.00018839606],"category_scores_gemma":[0.00003373259,0.00008899117,0.00009301583,0.0014017262,0.000033152475,0.0005474212,0.00014443047,0.000044400353,0.0000165905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015605673,0.00015357016,0.026418788,0.00003311918,0.0004183644,0.0000024825179,0.0012010955,0.8458882,0.0027330883,0.10654985,0.00043231997,0.016167559],"study_design_scores_gemma":[0.000060510323,0.000018029328,0.011813207,0.000010731093,0.000026976533,0.0000016450052,0.000012695973,0.98049843,0.0046247137,0.0028249214,0.0000016480936,0.00010647036],"about_ca_topic_score_codex":0.00043499452,"about_ca_topic_score_gemma":0.000004806136,"teacher_disagreement_score":0.43576103,"about_ca_system_score_codex":0.000027546748,"about_ca_system_score_gemma":0.0000375122,"threshold_uncertainty_score":0.36289546},"labels":[],"label_agreement":null},{"id":"W2035171729","doi":"10.1007/s11227-012-0748-z","title":"Online execution time prediction for computationally intensive applications with periodic progress updates","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Real-time computing","score_opus":0.015584401919121272,"score_gpt":0.263583593051369,"score_spread":0.24799919113224775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035171729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057501044,0.00053022295,0.94007623,0.001274109,0.00010789569,0.00033902112,0.0000065108366,0.0001369493,0.000028014369],"genre_scores_gemma":[0.6164096,0.000013313506,0.38289103,0.000237613,0.00039861217,0.0000064692886,0.000020997759,0.000010209445,0.000012144351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988224,0.00011109071,0.00043174432,0.00011247939,0.00027782068,0.00024449892],"domain_scores_gemma":[0.9978598,0.00031189574,0.00036034742,0.00019040138,0.0011937942,0.000083787345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001052219,0.00012949477,0.00018634617,0.00013840344,0.00037045145,0.000093181494,0.0005744035,0.000043337328,0.000001940862],"category_scores_gemma":[0.0000479641,0.000083950465,0.00006775653,0.00031210604,0.00009521438,0.0006162001,0.00010131468,0.00018507778,0.0000037474347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005372157,0.0028030665,0.044688255,0.00028124938,0.0009641158,0.000008302481,0.039371617,0.5864513,0.0029298514,0.033819232,0.023354823,0.26479095],"study_design_scores_gemma":[0.0007169011,0.0005067246,0.010497768,0.0001792897,0.00008086624,0.0008472888,0.0005489504,0.9822108,0.00061615603,0.0010387059,0.0025338682,0.00022264547],"about_ca_topic_score_codex":0.0000017406671,"about_ca_topic_score_gemma":1.9441269e-7,"teacher_disagreement_score":0.5589086,"about_ca_system_score_codex":0.000057085625,"about_ca_system_score_gemma":0.00008648312,"threshold_uncertainty_score":0.34234008},"labels":[],"label_agreement":null},{"id":"W2036861468","doi":"10.1109/ispass.2012.6189227","title":"Combined profiling: A methodology to capture varied program behavior across multiple inputs","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Spec#; Profiling (computer programming); Computer science; Source code; Data mining; Programming language","score_opus":0.08612125392150792,"score_gpt":0.37897302000535893,"score_spread":0.292851766083851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036861468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026070923,0.000022092403,0.96874,0.0005354428,0.00039264577,0.0009375254,0.0000018343144,0.0023864082,0.0009131351],"genre_scores_gemma":[0.41105208,5.5578977e-7,0.5875948,0.00072156946,0.000035237015,0.00022816526,0.0000054709376,0.000008752042,0.0003533861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982877,0.00022980013,0.0002742142,0.0003762188,0.0001882444,0.00064384943],"domain_scores_gemma":[0.99873435,0.00017882523,0.00008263283,0.0005815613,0.00015703205,0.0002656086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009446277,0.00018401079,0.00024050559,0.000086235515,0.00017348876,0.00014514507,0.0008177327,0.00015248952,0.000008341073],"category_scores_gemma":[0.00023717117,0.00015727962,0.000065560285,0.00053589494,0.00003740408,0.00030068314,0.0005673537,0.00017881418,0.000045113393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002199298,0.007654873,0.25288963,0.00011073418,0.00015851461,0.000051603583,0.035990145,0.004355266,0.017514208,0.2051472,0.019220265,0.4566876],"study_design_scores_gemma":[0.0035669368,0.0020866897,0.054612298,0.00005083066,0.000057704274,0.00015693021,0.00029173464,0.5736971,0.32634702,0.0015187768,0.034891956,0.002722031],"about_ca_topic_score_codex":0.000056698733,"about_ca_topic_score_gemma":0.0000070770716,"teacher_disagreement_score":0.56934184,"about_ca_system_score_codex":0.00003403948,"about_ca_system_score_gemma":0.000037562135,"threshold_uncertainty_score":0.6413677},"labels":[],"label_agreement":null},{"id":"W2037063497","doi":"10.5555/2555692.2555700","title":"Learning the optimal operating point for many-core systems with extended range voltage/frequency scaling","year":2013,"lang":"en","type":"article","venue":"International Conference on Hardware/Software Codesign and System Synthesis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Frequency scaling; Throughput; Operating point; Computer science; Energy consumption; Voltage; Scaling; Range (aeronautics); Efficient energy use; Power (physics); Reduction (mathematics); Energy (signal processing); Convexity; Electronic engineering; Electrical engineering; Engineering; Mathematics; Telecommunications; Physics","score_opus":0.04249642609851344,"score_gpt":0.2647283796838562,"score_spread":0.22223195358534276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037063497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040912414,0.00011142095,0.99142855,0.00062081247,0.00031622028,0.0010443393,0.000015941008,0.00081700215,0.0015544855],"genre_scores_gemma":[0.87553644,0.000026448504,0.12283821,0.00010016594,0.00011088127,0.0009013823,0.0000079137535,0.000030475197,0.00044811395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975996,0.0002504398,0.0005357688,0.00068492605,0.0005622703,0.0003669762],"domain_scores_gemma":[0.9969374,0.0011551478,0.0003447624,0.00044379974,0.0009930446,0.00012588043],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010119963,0.0003443262,0.0003975146,0.00018982646,0.00062140333,0.0015029303,0.0011772583,0.00011566379,0.00002721233],"category_scores_gemma":[0.0005661021,0.00023210944,0.00009566065,0.00015875515,0.00007931148,0.00056115096,0.00014625028,0.00024637935,0.00002754036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019978607,0.00023258914,0.005200771,0.0008459768,0.0007359145,0.00008802523,0.0048082224,0.07829448,0.0028228166,0.80902,0.0025504916,0.09520093],"study_design_scores_gemma":[0.0003278795,0.00022224753,0.00037162678,0.00122675,0.000021473774,0.00010116305,0.00094280695,0.9953057,0.0006033154,0.00037280988,0.000112766946,0.0003914535],"about_ca_topic_score_codex":0.00016440074,"about_ca_topic_score_gemma":0.0000014663813,"teacher_disagreement_score":0.9170112,"about_ca_system_score_codex":0.00013468781,"about_ca_system_score_gemma":0.00011357754,"threshold_uncertainty_score":0.9995336},"labels":[],"label_agreement":null},{"id":"W2037181413","doi":"10.1109/mdt.2007.151","title":"A Survey and Taxonomy of GALS Design Styles","year":2007,"lang":"en","type":"article","venue":"IEEE Design & Test of Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":177,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Waterloo","keywords":"Computer science; Asynchronous communication; Embedded system; Computer architecture; Asynchronous circuit; Block (permutation group theory); Reuse; Synchronous circuit; Computer hardware; Clock signal; Engineering; Computer network","score_opus":0.07293608293102576,"score_gpt":0.2720912248614472,"score_spread":0.19915514193042144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037181413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021672256,0.0002101855,0.9966029,0.00002454813,0.00017162673,0.0003852997,0.0000024402777,0.00021457102,0.0002211922],"genre_scores_gemma":[0.47788763,0.000020319603,0.5220044,0.000049996343,0.000019472984,0.0000037971902,6.2302524e-7,0.0000067101014,0.00000702653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828255,0.00029824345,0.0005364901,0.00034450338,0.00025624054,0.0002819699],"domain_scores_gemma":[0.99550885,0.003302069,0.0003688229,0.00044257363,0.00026931675,0.00010837613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027679338,0.00018897658,0.0003685759,0.00027689585,0.000060911527,0.00005467123,0.0007785738,0.00008101455,0.00000115623],"category_scores_gemma":[0.0001397785,0.00018881196,0.000054350723,0.0004964623,0.00014061529,0.00021769045,0.000112746995,0.000092550945,0.0000016463983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040420596,0.0020609968,0.06678372,0.00043160873,0.0004234823,0.0001247144,0.0023165664,0.46061057,0.03900013,0.015209147,0.08680807,0.3258268],"study_design_scores_gemma":[0.00088322366,0.0011940368,0.040201437,0.00020417897,0.000013495933,0.0000332549,0.000009421796,0.76314956,0.19239393,0.0009780459,0.00035892508,0.00058052223],"about_ca_topic_score_codex":0.000045449844,"about_ca_topic_score_gemma":0.0000014070592,"teacher_disagreement_score":0.4757204,"about_ca_system_score_codex":0.000020788082,"about_ca_system_score_gemma":0.00010124995,"threshold_uncertainty_score":0.76995283},"labels":[],"label_agreement":null},{"id":"W2037303555","doi":"10.1145/1369396.1369399","title":"Compiler and hardware support for reducing the synchronization of speculative threads","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Intel Corporation; National Aeronautics and Space Administration; National Science Foundation","keywords":"Computer science; Compiler; Speculative multithreading; Parallel computing; Exploit; Dataflow; Synchronizing; Speculation; Thread (computing); Synchronization (alternating current); Scheduling (production processes); Embedded system; Operating system; Multithreading; Computer network","score_opus":0.020862637840641293,"score_gpt":0.2550579337353402,"score_spread":0.2341952958946989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037303555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007452919,0.000068483714,0.9971066,0.0013095359,0.000055058328,0.0003611733,0.00001922965,0.00012809064,0.00020652276],"genre_scores_gemma":[0.4400754,0.00025334684,0.5593082,0.00019694488,0.000015946236,0.000026225849,0.000016835229,0.0000102425165,0.00009689263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992028,0.00005691656,0.0002072112,0.00027481688,0.00013429829,0.0001239694],"domain_scores_gemma":[0.9991256,0.00024181102,0.00010819241,0.00035016178,0.0001338352,0.00004039305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012779617,0.00012748134,0.00014543488,0.00013061216,0.00046402792,0.000039230777,0.00024828876,0.000060315517,0.0000081211465],"category_scores_gemma":[0.00004198088,0.00009823532,0.000043352153,0.0002788445,0.00011759428,0.00014449612,0.000017977643,0.000110423556,2.5266107e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021726937,0.00003362674,0.000033204098,0.00001620879,0.000019818666,3.9146926e-7,0.0017866115,0.9525648,0.000029523128,0.000871108,0.0000800847,0.044542894],"study_design_scores_gemma":[0.00040660158,0.00026076142,0.00032623328,0.000038651917,0.000022733162,0.000060568113,0.000028656084,0.9942608,0.002042216,0.0020316185,0.0003722719,0.00014889808],"about_ca_topic_score_codex":0.000006625885,"about_ca_topic_score_gemma":0.0000045625143,"teacher_disagreement_score":0.4393301,"about_ca_system_score_codex":0.000014008676,"about_ca_system_score_gemma":0.0000421671,"threshold_uncertainty_score":0.40059203},"labels":[],"label_agreement":null},{"id":"W2037462607","doi":"10.1145/1082469.1082471","title":"The STAMPede approach to thread-level speculation","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Multithreading; Thread (computing); Cache coherence; Multiprocessing; Parallel computing; Compiler; Simultaneous multithreading; Speculation; Speculative multithreading; Workload; Cache; Computer architecture; CPU cache; Embedded system; Operating system; Cache algorithms","score_opus":0.04490225370586334,"score_gpt":0.2656086758826906,"score_spread":0.22070642217682726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037462607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001808924,0.000073512456,0.9937114,0.0018868973,0.0011877383,0.00049777277,0.000003926165,0.0008022761,0.0016555979],"genre_scores_gemma":[0.31620944,0.000017878858,0.68204135,0.00038566475,0.00033840776,0.000079944075,0.0000027853412,0.000016038148,0.0009085274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823546,0.00016090358,0.00039369342,0.00048641628,0.0003957469,0.0003277764],"domain_scores_gemma":[0.9979879,0.0002258178,0.000098403165,0.0014139737,0.00014164217,0.00013221566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047561075,0.00020623412,0.00018429762,0.00017426089,0.0006461196,0.0006434257,0.0016824987,0.00007917854,0.0000012679011],"category_scores_gemma":[0.000008576817,0.00015694664,0.00009819295,0.00053239585,0.000025794858,0.00031692444,0.00004713088,0.00019397959,0.00011574975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006152043,0.00011649402,0.0000056304402,0.0000074948,0.00002997457,5.694765e-7,0.0005162331,0.8351641,0.000009948324,0.020481776,0.0048930882,0.13876851],"study_design_scores_gemma":[0.00019911419,0.00009963537,0.00027382583,0.000033748835,0.0000051467737,0.000033177217,0.000017584689,0.94925576,0.0002367277,0.00031983622,0.04928038,0.00024507722],"about_ca_topic_score_codex":0.000040828534,"about_ca_topic_score_gemma":0.000008877879,"teacher_disagreement_score":0.31602854,"about_ca_system_score_codex":0.00011276002,"about_ca_system_score_gemma":0.000043400734,"threshold_uncertainty_score":0.6400098},"labels":[],"label_agreement":null},{"id":"W2037854811","doi":"10.1109/pdp.2014.40","title":"A Portable and High-Performance General Matrix-Multiply (GEMM) Library for GPUs and Single-Chip CPU/GPU Systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Compiler; Parallel computing; CUDA; Central processing unit; Vendor; General-purpose computing on graphics processing units; Computer architecture; Computer hardware; Operating system; Graphics","score_opus":0.013302357527497786,"score_gpt":0.2165845142537306,"score_spread":0.20328215672623282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037854811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14258394,0.0003268829,0.85341513,0.00026644426,0.00021426854,0.00027536976,0.0000026255848,0.00086246105,0.0020528575],"genre_scores_gemma":[0.62460643,0.00004712667,0.372145,0.00020617277,0.00009948264,0.000021227084,0.0000058020573,0.000012896922,0.0028558744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989285,0.00004533866,0.0002527108,0.0003873417,0.00011712469,0.00026897233],"domain_scores_gemma":[0.99932194,0.00011509092,0.00010225699,0.00031067352,0.000043409407,0.00010660827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020514942,0.00015783448,0.00021321002,0.00010328308,0.00018531135,0.00047449875,0.00031570566,0.000076373966,0.0000020688074],"category_scores_gemma":[0.000015752259,0.00013419238,0.000022022326,0.00014994212,0.00003593526,0.000710659,0.00021472492,0.000063135325,0.0000025996428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013445865,0.00037357418,0.0371724,0.0012381779,0.00012426608,0.000010775353,0.00087379245,0.07072978,0.00487212,0.63810796,0.09306219,0.15330052],"study_design_scores_gemma":[0.00041291144,0.00020617324,0.0010793362,0.000035349545,0.0000043474683,0.000026957618,0.0000032636185,0.9860403,0.002995274,0.0007016473,0.008280014,0.00021444462],"about_ca_topic_score_codex":0.000038398663,"about_ca_topic_score_gemma":7.945139e-7,"teacher_disagreement_score":0.9153105,"about_ca_system_score_codex":0.000008058201,"about_ca_system_score_gemma":0.000021900105,"threshold_uncertainty_score":0.54722065},"labels":[],"label_agreement":null},{"id":"W2038247263","doi":"10.1109/ispass.2015.7095810","title":"QTrace: a framework for customizable full system instrumentation","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instrumentation (computer programming); Computer science; Systems engineering; Operating system; Engineering","score_opus":0.034004085558844696,"score_gpt":0.29592882473877696,"score_spread":0.26192473917993225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038247263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037406798,0.000032072836,0.9888347,0.0004020519,0.00033128148,0.00024840827,6.7623813e-7,0.0012659371,0.008510827],"genre_scores_gemma":[0.23145899,0.0000013703872,0.7679764,0.00015813456,0.000046697332,0.000038175865,0.000002408768,0.0000051643115,0.0003126848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992717,0.00003393729,0.00016932675,0.0002146981,0.00014852257,0.00016184962],"domain_scores_gemma":[0.99933296,0.00006600555,0.00007686072,0.0002786816,0.00015395442,0.000091530754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036170386,0.00007939729,0.00010212371,0.000071196504,0.00008051428,0.00016280767,0.0003911448,0.000067555615,0.000001878909],"category_scores_gemma":[0.00006293261,0.00007125582,0.000034228,0.00022841978,0.00000967308,0.0002965639,0.000077542296,0.000052483007,0.000033005712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012435308,0.00002318095,0.000042448308,0.000020523723,0.0000064441624,7.260643e-7,0.00030874062,0.012691473,0.000010212158,0.9673402,0.013515204,0.006028442],"study_design_scores_gemma":[0.00032210763,0.00011402791,0.0000062594195,0.00003088146,0.0000026938612,0.000010893495,0.000113068076,0.9754857,0.0012211992,0.018489052,0.004082684,0.00012142306],"about_ca_topic_score_codex":0.000012793035,"about_ca_topic_score_gemma":8.0123846e-7,"teacher_disagreement_score":0.96279424,"about_ca_system_score_codex":0.0000799867,"about_ca_system_score_gemma":0.00007044636,"threshold_uncertainty_score":0.2905728},"labels":[],"label_agreement":null},{"id":"W2038336488","doi":"10.1109/ipdpsw.2010.5470773","title":"FG-MPI: Fine-grain MPI for multicore and clusters","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Message Passing Interface; Parallel computing; Message passing; Multi-core processor; Programming paradigm; Implementation; Programming language","score_opus":0.014328709852725541,"score_gpt":0.2682950694887831,"score_spread":0.25396635963605757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038336488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00695852,0.000015204741,0.9886814,0.0014430187,0.00030774568,0.00019352199,0.0000011642186,0.0005237322,0.0018757144],"genre_scores_gemma":[0.2442376,0.0000030485712,0.7540494,0.0005402218,0.000050300958,0.000014217885,0.0000021782096,0.0000054518086,0.0010975567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936765,0.000013400965,0.00012942354,0.00024858624,0.0000761906,0.00016472975],"domain_scores_gemma":[0.9994311,0.000111275476,0.000040405557,0.00028409626,0.00006380243,0.00006937264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022008477,0.00008732833,0.00009095649,0.00006427899,0.00011028194,0.00012871892,0.00035892733,0.000061826184,0.000005199641],"category_scores_gemma":[0.000078620724,0.000073447736,0.000033201577,0.0000972241,0.00003623644,0.00014460129,0.00015152353,0.000091051756,0.000004600205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036086592,0.0002557759,0.0057209227,0.00008601252,0.000051211435,0.000009129319,0.002475841,0.0025507277,0.008677376,0.33232895,0.2968713,0.35093665],"study_design_scores_gemma":[0.00032657257,0.000052340314,0.0007010268,0.0000039535885,0.0000019273803,0.0000083045215,0.0000049368864,0.9807705,0.0028711006,0.0037510458,0.011364137,0.00014411038],"about_ca_topic_score_codex":0.00001919006,"about_ca_topic_score_gemma":0.000034047633,"teacher_disagreement_score":0.9782198,"about_ca_system_score_codex":0.0000042706556,"about_ca_system_score_gemma":0.000018846407,"threshold_uncertainty_score":0.29951116},"labels":[],"label_agreement":null},{"id":"W2038662769","doi":"10.1109/sbac-pad.2014.43","title":"Runtime Support for Adaptive Spatial Partitioning and Inter-Kernel Communication on GPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Directorate for Computer and Information Science and Engineering; National Science Foundation","keywords":"Computer science; Speedup; Kernel (algebra); Scheduling (production processes); Parallel computing; Distributed computing","score_opus":0.02000123290862036,"score_gpt":0.26428818321976044,"score_spread":0.2442869503111401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038662769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053473335,0.000006165999,0.98268723,0.00058574416,0.00004801593,0.00013678364,7.224989e-7,0.00031848167,0.015682118],"genre_scores_gemma":[0.67086816,0.000004833502,0.32818186,0.00053061574,0.000018247674,0.000019750669,0.000005996065,0.0000038494472,0.00036666007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994223,0.00005966396,0.00013880173,0.00019430145,0.000070973525,0.00011393409],"domain_scores_gemma":[0.99932855,0.00016359806,0.00006934193,0.0003234076,0.000076025186,0.000039068862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032720587,0.00007430358,0.00009056619,0.000053951735,0.00015653619,0.00011265767,0.00030211534,0.000034902707,0.0000114328495],"category_scores_gemma":[0.000043335727,0.000068553105,0.000025097921,0.000056563233,0.000030479698,0.00016161313,0.00014564623,0.00005635469,0.0000118464195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040008876,0.00011975331,0.0006711902,0.00001236883,0.000022655679,3.6064023e-7,0.00091596955,0.0034235183,0.000052503518,0.7426285,0.016114376,0.2359988],"study_design_scores_gemma":[0.0002484814,0.00035670566,0.00082147523,0.000018290877,0.0000025419256,0.00000229466,0.000007333255,0.9810951,0.0021202292,0.010575907,0.004640698,0.00011095648],"about_ca_topic_score_codex":0.000054549808,"about_ca_topic_score_gemma":0.000014304946,"teacher_disagreement_score":0.97767156,"about_ca_system_score_codex":0.000013792248,"about_ca_system_score_gemma":0.000011864327,"threshold_uncertainty_score":0.27955145},"labels":[],"label_agreement":null},{"id":"W2038666141","doi":"10.1109/hpca.2015.7056063","title":"GPGPU performance and power estimation using machine learning","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":213,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Memory bandwidth; Graphics; Kernel (algebra); Bandwidth (computing); General-purpose computing on graphics processing units; Frequency scaling; Multi-core processor; Graphics processing unit; Range (aeronautics); Scaling; Computer hardware; Power (physics); Parallel computing; Computer graphics (images)","score_opus":0.02982307307628912,"score_gpt":0.2702077411338378,"score_spread":0.24038466805754866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038666141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07987606,0.000058299567,0.9150819,0.000093053335,0.00004479836,0.000032813583,3.5150826e-8,0.0003988893,0.0044141235],"genre_scores_gemma":[0.544942,0.000004696881,0.4548,0.000053279877,0.0000038264398,3.9710844e-7,4.575959e-7,0.0000020263365,0.00019325197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995607,0.000027748412,0.000087015556,0.0001308143,0.00010224022,0.00009148729],"domain_scores_gemma":[0.9997255,0.000013700412,0.00003888201,0.000110836096,0.00005579688,0.000055245848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002481329,0.0000561346,0.000057320016,0.00005908405,0.00008672475,0.000096608775,0.0001341639,0.000023034912,0.000002895402],"category_scores_gemma":[0.000034492983,0.00004903218,0.000007569766,0.00013366599,0.000013208849,0.00037225525,0.00012407894,0.00006428528,0.000006472679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008066992,0.00003937459,0.02594538,0.00001556066,0.000009238943,0.000003856341,0.0019645698,0.8988465,0.00019790979,0.016131211,0.00092248176,0.05591582],"study_design_scores_gemma":[0.000093828305,0.00005020734,0.00033285675,0.0000073489996,7.470957e-7,0.000019005116,0.0000043983077,0.9980254,0.0005729402,0.00028858756,0.0005343217,0.00007035823],"about_ca_topic_score_codex":0.000024796882,"about_ca_topic_score_gemma":3.7413488e-7,"teacher_disagreement_score":0.465066,"about_ca_system_score_codex":0.000016891521,"about_ca_system_score_gemma":0.000022317157,"threshold_uncertainty_score":0.19994742},"labels":[],"label_agreement":null},{"id":"W2038724983","doi":"10.1145/373574.373578","title":"Multiprocessor enhancements of the SimpleScalar tool set","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Uniprocessor system; Computer science; Multiprocessing; Parallel computing; Thread (computing); Suite; Symmetric multiprocessor system; Cache; MESI protocol; Operating system; CPU cache; Cache coloring","score_opus":0.018544171035007627,"score_gpt":0.2712269902411761,"score_spread":0.2526828192061685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038724983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051865082,0.00006252346,0.94418544,0.0023970294,0.00031228506,0.00041390033,0.0000035039116,0.00035736914,0.00040287984],"genre_scores_gemma":[0.5248951,0.000031542924,0.4729848,0.0017294893,0.00018148503,0.000021247693,0.0000045628362,0.000017312697,0.00013446617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976617,0.0002370048,0.00048623953,0.0005775466,0.00057283527,0.0004646506],"domain_scores_gemma":[0.9972507,0.0003394782,0.0002375066,0.0019087209,0.00017061808,0.00009301178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031706062,0.00027479674,0.00030576528,0.00015774895,0.00022398241,0.00010880693,0.0041203345,0.00009225922,0.000012787408],"category_scores_gemma":[0.00016489429,0.0001920666,0.00018142692,0.00083651335,0.000109695546,0.00016693881,0.0021981164,0.0003585691,0.000011352747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004108698,0.00026606154,0.0129699875,0.00008679906,0.00010083055,0.000020716801,0.0040916447,0.082659565,0.0029033765,0.002058595,0.011160395,0.88364094],"study_design_scores_gemma":[0.0028518366,0.00083549204,0.028188903,0.0004580749,0.00003954492,0.00028930538,0.000019867744,0.7148607,0.054088816,0.052988686,0.14384708,0.0015317135],"about_ca_topic_score_codex":0.000040269904,"about_ca_topic_score_gemma":0.000016503123,"teacher_disagreement_score":0.8821092,"about_ca_system_score_codex":0.0000318273,"about_ca_system_score_gemma":0.000095526964,"threshold_uncertainty_score":0.7832249},"labels":[],"label_agreement":null},{"id":"W2038736729","doi":"10.1145/2749469.2750395","title":"C <scp>lean</scp>","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exploit; Synchronization (alternating current); Overhead (engineering); Semantics (computer science); Isolation (microbiology); Concurrency; Distributed computing; Parallel computing; Race (biology); Programming language; Theoretical computer science; Computer security; Computer network","score_opus":0.034122913474322496,"score_gpt":0.2656430568239672,"score_spread":0.2315201433496447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038736729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010063434,0.000050014703,0.799969,0.00018833742,0.00012913479,0.000035539397,7.4380736e-8,0.001155461,0.19746609],"genre_scores_gemma":[0.17273325,0.0000048517686,0.8129162,0.0010006595,0.00005722355,0.0000039748556,0.0000010013982,0.0000057935226,0.0132770315],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.000021637561,0.00010473135,0.00018280157,0.00016344062,0.00015558083],"domain_scores_gemma":[0.99935675,0.000053987624,0.000033473578,0.00033569353,0.000099175784,0.000120904806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025492895,0.000066394845,0.00007060659,0.00006255783,0.00004016475,0.00010039468,0.0005959488,0.00003458457,0.0000022216002],"category_scores_gemma":[0.00012242423,0.00005652809,0.000024497976,0.00024609923,0.000014169375,0.00020683765,0.00020344718,0.00005421702,0.00019972755],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.1601161e-7,0.000040744646,0.00043785936,0.0000019023519,0.00000526645,0.000007040424,0.0007032548,0.0031493471,0.000014426559,0.2936842,0.6931689,0.008786824],"study_design_scores_gemma":[0.00029768862,0.000113917435,0.00021332313,0.0000071985064,0.0000016381446,0.000024164085,0.000060971117,0.7794798,0.005729475,0.039107237,0.1748786,0.000085970045],"about_ca_topic_score_codex":0.000012013815,"about_ca_topic_score_gemma":6.9604397e-7,"teacher_disagreement_score":0.7763305,"about_ca_system_score_codex":0.0000165378,"about_ca_system_score_gemma":0.000051059484,"threshold_uncertainty_score":0.25671604},"labels":[],"label_agreement":null},{"id":"W2038886423","doi":"10.1145/2642769.2642779","title":"Intra-Epoch Message Scheduling To Exploit Unused or Residual Overlapping Potential","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Exploit; Latency (audio); Scheduling (production processes); Computation; Computer network; Node (physics); Residual; Distributed computing; Parallel computing; Algorithm; Computer security; Telecommunications","score_opus":0.021209674496450802,"score_gpt":0.2640696846455828,"score_spread":0.24286001014913197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038886423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010971537,0.0000114833465,0.9789829,0.0014257526,0.00020051445,0.00014647168,2.7169716e-7,0.0014160229,0.006845019],"genre_scores_gemma":[0.47077706,0.0000035042674,0.5271924,0.0010493387,0.00011123846,0.000007827519,0.0000010093904,0.000009164749,0.0008484237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.00011403753,0.00029727546,0.00047229367,0.0003136793,0.000348507],"domain_scores_gemma":[0.99904925,0.00007578212,0.0000745593,0.00053840526,0.00010651463,0.00015548967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058362196,0.00016198591,0.00019519652,0.00019760712,0.00020488909,0.00034000722,0.00090894295,0.000076867174,0.000052344112],"category_scores_gemma":[0.00015890006,0.00013564224,0.000047728052,0.0005119874,0.00001831013,0.00034861156,0.00042145152,0.00013355636,0.00009412488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109935376,0.00026149472,0.00020888771,0.00007164406,0.000068390174,0.00008991155,0.0027280708,0.43385637,0.013354737,0.2649591,0.036767133,0.2475243],"study_design_scores_gemma":[0.00033469283,0.00015388458,0.00019114582,0.000053005562,0.000004225859,0.000019844929,0.000031791933,0.9854927,0.008066297,0.0024191502,0.0028929126,0.00034031642],"about_ca_topic_score_codex":0.000028040828,"about_ca_topic_score_gemma":0.0000054259745,"teacher_disagreement_score":0.55163634,"about_ca_system_score_codex":0.000031284068,"about_ca_system_score_gemma":0.00006126525,"threshold_uncertainty_score":0.553133},"labels":[],"label_agreement":null},{"id":"W2039018000","doi":"10.1109/tvlsi.2009.2020727","title":"On the Power Management of Simultaneous Multithreading Processors","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multithreading; Simultaneous multithreading; Computer science; Power management; Power consumption; Leakage (economics); Embedded system; Dynamic demand; Leakage power; Parallel computing; Power (physics); Operating system; Thread (computing)","score_opus":0.011665948339817805,"score_gpt":0.24924212862663167,"score_spread":0.23757618028681388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039018000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081328275,0.000039824525,0.98648936,0.00030076806,0.0006652276,0.00058751815,0.000012192476,0.00046351796,0.0033087633],"genre_scores_gemma":[0.98919624,0.000030060299,0.009223986,0.00022173072,0.00001723889,0.000053665863,0.0000022485583,0.000012394295,0.0012424289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982198,0.00015403582,0.00047930153,0.00040229736,0.00047932682,0.00026523514],"domain_scores_gemma":[0.99866354,0.00023649503,0.00020288354,0.0006157703,0.00021821067,0.00006309537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045795995,0.00022891752,0.00023494758,0.00023141065,0.00033302768,0.00017198604,0.00061901216,0.000106374304,0.00001514305],"category_scores_gemma":[0.000009579663,0.00016484156,0.00013272482,0.00060254626,0.00003249094,0.00027229136,0.000002975675,0.00025912854,0.00004293995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007850531,0.00093539874,0.0000029980843,0.00006154085,0.00009127583,0.000017999766,0.0026625723,0.93275434,0.0007784279,0.040836558,0.0011248313,0.020655546],"study_design_scores_gemma":[0.00033980078,0.00036709727,0.000013011996,0.0005121955,0.000016124744,0.000012015707,0.00049577036,0.9709872,0.026273802,0.00042444962,0.00032216083,0.00023638559],"about_ca_topic_score_codex":0.000014365054,"about_ca_topic_score_gemma":0.0000074093105,"teacher_disagreement_score":0.9810634,"about_ca_system_score_codex":0.000102433325,"about_ca_system_score_gemma":0.000025159005,"threshold_uncertainty_score":0.6722044},"labels":[],"label_agreement":null},{"id":"W2039377922","doi":"10.1109/reconfig.2012.6416789","title":"Synchronized-transfer-level design methodology applied to hardware matrix multiplication","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Register-transfer level; High-level synthesis; Matrix multiplication; Synchronization (alternating current); Computer hardware; Multiplication (music); Computer architecture; Parallel computing; Programming language; Field-programmable gate array; Logic synthesis; Logic gate; Channel (broadcasting)","score_opus":0.1396015514889846,"score_gpt":0.3461099244189076,"score_spread":0.206508372929923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039377922","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000812785,0.00006146365,0.99514234,0.00054837944,0.00014228246,0.000445949,0.0000010610083,0.0011520433,0.0024252294],"genre_scores_gemma":[0.20568745,0.000006824031,0.7931836,0.00064847333,0.00006111425,0.00007912479,0.0000027303724,0.000010339551,0.0003202963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.00023076207,0.00024402226,0.00033538984,0.00016208651,0.00038524767],"domain_scores_gemma":[0.9988294,0.0003226517,0.00003311433,0.0005482996,0.00008822363,0.00017827634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011437794,0.00015031677,0.00019408262,0.00015846915,0.00012332451,0.00006673212,0.0007343771,0.000099691424,0.000042105192],"category_scores_gemma":[0.00007330532,0.00013687961,0.000045783065,0.0004095878,0.000016958686,0.00023192287,0.00016120839,0.00009226668,0.00018263546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051981217,0.00026759235,0.00026565098,0.000033122855,0.000054653243,0.0000012389651,0.0028655822,0.4338674,0.015365003,0.4060357,0.015368908,0.12582318],"study_design_scores_gemma":[0.00070669624,0.00013622502,0.0011597318,0.000016864362,0.000019138815,0.000030404552,0.000039480892,0.8124709,0.17471713,0.0021740086,0.0077247433,0.00080468546],"about_ca_topic_score_codex":0.000017299788,"about_ca_topic_score_gemma":6.596485e-7,"teacher_disagreement_score":0.40386167,"about_ca_system_score_codex":0.000054360542,"about_ca_system_score_gemma":0.00003848962,"threshold_uncertainty_score":0.55817884},"labels":[],"label_agreement":null},{"id":"W2039545941","doi":"10.1109/fpt.2010.5681442","title":"Design space exploration of instruction schedulers for out-of-order soft processors","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Field-programmable gate array; Stratix; Instruction scheduling; Out-of-order execution; Fixed-priority pre-emptive scheduling; Soft error; Parallel computing; Embedded system; Dynamic priority scheduling; Two-level scheduling; Computer network; Rate-monotonic scheduling; Engineering; Quality of service","score_opus":0.04753420746126913,"score_gpt":0.29218837229991484,"score_spread":0.24465416483864572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039545941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003536124,0.0000045876377,0.9949343,0.00031738903,0.0002977719,0.00025954645,2.577023e-7,0.00022081898,0.0004292066],"genre_scores_gemma":[0.27503344,0.0000027474564,0.7248134,0.000016412245,0.000015881462,0.000016985758,0.0000010854133,0.0000040801237,0.000095982155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.000021074538,0.00019995097,0.00016792242,0.00011996228,0.000094170704],"domain_scores_gemma":[0.99911004,0.00006256101,0.00017487368,0.00021686271,0.00041027693,0.000025378591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029856912,0.00007024581,0.00010600404,0.00010692835,0.000048394955,0.000026501682,0.00028366916,0.00006489453,0.0000034974798],"category_scores_gemma":[0.00013791739,0.000063507854,0.000027642734,0.00025972494,0.000036925183,0.0006089868,0.000038422386,0.000060449976,0.0000012115404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010688353,0.00034416807,0.00043343505,0.0002720576,0.000056786168,2.875764e-7,0.0067385393,0.28681967,0.083748676,0.46602002,0.002687875,0.15277159],"study_design_scores_gemma":[0.00023436526,0.00010188721,0.000017513825,0.0000102148115,0.0000028302898,5.718859e-7,0.000031525975,0.6905465,0.2964606,0.012272483,0.00023473031,0.00008676026],"about_ca_topic_score_codex":0.000004800737,"about_ca_topic_score_gemma":0.0000036294407,"teacher_disagreement_score":0.45374754,"about_ca_system_score_codex":0.0000049966343,"about_ca_system_score_gemma":0.00008160697,"threshold_uncertainty_score":0.2589775},"labels":[],"label_agreement":null},{"id":"W2039812465","doi":"10.1145/949344.949436","title":"Multicodes","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bytecode; Computer science; Java; Programming language; Process (computing); Java bytecode; Interpreter; Program optimization; Operating system; Java applet; Java annotation; Compiler","score_opus":0.017244501245495106,"score_gpt":0.2565199892921343,"score_spread":0.23927548804663923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039812465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021351861,0.000020257618,0.8678102,0.000095826384,0.00004520687,0.00002046367,1.3927473e-8,0.0005462646,0.13124825],"genre_scores_gemma":[0.36556718,0.0000028983404,0.6331552,0.00023048902,0.0000023786974,0.0000011874642,4.9684413e-8,0.0000010947813,0.0010394973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968696,0.00002612844,0.000054744036,0.00010120262,0.000052067713,0.000078873214],"domain_scores_gemma":[0.99973035,0.000021649406,0.000011953865,0.00018746757,0.0000232115,0.00002536503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010064016,0.00003328742,0.000033382432,0.000028521716,0.0000406729,0.000048557456,0.00020464242,0.000014102908,0.000020023916],"category_scores_gemma":[0.000034806555,0.000027635251,0.0000143635,0.00011227536,0.000006561975,0.00009830902,0.000025521496,0.00002247266,0.000046199835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.11128e-8,0.000014257522,0.00019867823,5.9051877e-7,0.0000011790834,8.661068e-7,0.00004409786,0.00083377655,0.000061226645,0.9915684,0.0028941575,0.004382691],"study_design_scores_gemma":[0.00026111925,0.000043607703,0.0004128471,0.0000058945952,0.0000010905406,0.000023099248,0.000009392572,0.80823046,0.06587706,0.04514388,0.0797046,0.00028698033],"about_ca_topic_score_codex":0.0000021459778,"about_ca_topic_score_gemma":2.1616351e-7,"teacher_disagreement_score":0.94642454,"about_ca_system_score_codex":0.0000045219995,"about_ca_system_score_gemma":0.00001142887,"threshold_uncertainty_score":0.11269328},"labels":[],"label_agreement":null},{"id":"W2039899416","doi":"10.1145/1344671.1344691","title":"Extreme parallel architectures for the masses","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallelism (grammar); Exploit; Marketing buzz; Multi-core processor; Parallel computing; Publicity; Multithreading; Task parallelism; Computer architecture; Computer security; Operating system; World Wide Web","score_opus":0.05808788137363146,"score_gpt":0.27097034202780673,"score_spread":0.21288246065417527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039899416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057571963,0.00020732015,0.9914616,0.002349057,0.00008163415,0.00018525608,3.3475763e-7,0.000626775,0.004512355],"genre_scores_gemma":[0.27492878,0.00004513425,0.72201556,0.00089337304,0.00005179307,0.000037110753,4.3219103e-7,0.000004458246,0.0020233844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994095,0.00002241958,0.00011102989,0.0001808997,0.00011330015,0.00016286057],"domain_scores_gemma":[0.99921936,0.0002953003,0.000035985347,0.00036943197,0.00004963856,0.000030278605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012687927,0.00007843498,0.00007224098,0.000039756826,0.0003274402,0.000049429935,0.00075457204,0.000024756571,0.0000074792815],"category_scores_gemma":[0.00004093644,0.000045851066,0.000061743434,0.00013188686,0.000045351677,0.00003357794,0.000106157284,0.000052197796,0.000007096742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029711691,0.00015288552,0.0026217934,0.000016733587,0.00007873864,0.000014449643,0.0020336516,0.31463918,0.00013466443,0.31441924,0.25534907,0.11050988],"study_design_scores_gemma":[0.00019716237,0.000057845264,0.0018133406,0.0000034084533,0.0000023623709,0.00005069465,0.0000057654515,0.9342258,0.0011038762,0.013327403,0.049060185,0.0001521819],"about_ca_topic_score_codex":0.000014661204,"about_ca_topic_score_gemma":0.0000030079132,"teacher_disagreement_score":0.6195866,"about_ca_system_score_codex":0.0000059595386,"about_ca_system_score_gemma":0.000032096454,"threshold_uncertainty_score":0.25184384},"labels":[],"label_agreement":null},{"id":"W2042253916","doi":"10.1155/2014/797348","title":"Collective Mind: Towards Practical and Collaborative Auto-Tuning","year":2014,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"Soochow University","keywords":"Computer science; Benchmarking; Modular design; Set (abstract data type); Distributed computing; Software; Code (set theory); Data science; Software engineering; Artificial intelligence; Machine learning","score_opus":0.02262732856723581,"score_gpt":0.30079375805038894,"score_spread":0.2781664294831531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042253916","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026157356,0.00008806219,0.9903268,0.00094509486,0.0004606298,0.00028706648,8.689286e-7,0.00046294,0.0048127756],"genre_scores_gemma":[0.22412331,0.0000015472041,0.7744756,0.000059220965,0.000034199085,0.00002821704,0.0000028807874,0.0000069167695,0.0012681278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819297,0.00019970068,0.00021496727,0.0006692522,0.00035316637,0.0003699311],"domain_scores_gemma":[0.9988112,0.00016354659,0.00013833589,0.00039176233,0.00034505295,0.00015009918],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017341886,0.00014391683,0.00016948511,0.00021548927,0.00077993766,0.0016840398,0.00038941595,0.000068786016,0.000004052974],"category_scores_gemma":[0.0005890346,0.00013452489,0.000032422377,0.0014578223,0.00026523022,0.00055236684,0.00035323948,0.00016286166,0.000013058354],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008130547,0.00011038021,0.00025253955,0.000016891052,0.000022333876,0.000009672611,0.008493067,0.0001746782,0.0005504805,0.042787462,0.0026295162,0.94494486],"study_design_scores_gemma":[0.00032894305,0.00021071815,0.00020342208,0.000049855644,0.000009957552,0.0000364245,0.00020271058,0.8155527,0.0045513404,0.0072694784,0.17123434,0.00035009408],"about_ca_topic_score_codex":0.0000064356755,"about_ca_topic_score_gemma":0.0000056672793,"teacher_disagreement_score":0.94459474,"about_ca_system_score_codex":0.000086451524,"about_ca_system_score_gemma":0.00069494155,"threshold_uncertainty_score":0.99935234},"labels":[],"label_agreement":null},{"id":"W2042627331","doi":"","title":"Performance Boosting under Reliability and Power Constraints","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Voltage droop; Bandwidth throttling; Voltage; Voltage reduction; Computer science; Power gating; Voltage regulator; Engineering; Electrical engineering; Transistor","score_opus":0.028166006564184,"score_gpt":0.26221866101272034,"score_spread":0.23405265444853635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042627331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09296363,0.000019545589,0.843621,0.00047173988,0.000070157475,0.00005003235,9.9544536e-8,0.00045346664,0.06235034],"genre_scores_gemma":[0.73452705,0.000003337234,0.2649408,0.00030852255,0.0000054044963,0.0000010348737,1.7907348e-7,0.0000017894464,0.00021187903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994216,0.000029941479,0.000113476315,0.00019991671,0.000111425004,0.00012365855],"domain_scores_gemma":[0.99950725,0.000042387066,0.000031799642,0.000229457,0.00009928971,0.00008983454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004487643,0.00006205815,0.00006809848,0.000030811763,0.000060665167,0.00007333745,0.00020585956,0.000030966345,0.000007264296],"category_scores_gemma":[0.00007003374,0.00005206035,0.0000100948955,0.00010817726,0.00007903253,0.0002564037,0.00017315835,0.0000590085,0.000011668346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000359217,0.000365588,0.16080123,0.00008082334,0.00004421553,0.000018792363,0.006568318,0.100802414,0.00027102092,0.42164692,0.04691586,0.2624489],"study_design_scores_gemma":[0.0002701552,0.000105511936,0.008347778,0.000016149654,0.0000011570618,0.00003551294,0.00005108252,0.98449844,0.00074832275,0.0047710193,0.0009659479,0.0001888934],"about_ca_topic_score_codex":0.0000057367474,"about_ca_topic_score_gemma":2.1161516e-7,"teacher_disagreement_score":0.8836961,"about_ca_system_score_codex":0.00001828562,"about_ca_system_score_gemma":0.00005014224,"threshold_uncertainty_score":0.21229593},"labels":[],"label_agreement":null},{"id":"W2042656244","doi":"10.1007/s00450-010-0125-1","title":"Adaptive estimation and prediction of power and performance in high performance computing","year":2010,"lang":"en","type":"article","venue":"Computer Science - Research and Development","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Kalman filter; Autoregressive model; Power (physics); Focus (optics); Autoregressive–moving-average model; Moving average; Electric power system; Artificial intelligence; Econometrics; Mathematics","score_opus":0.03667731026531436,"score_gpt":0.3006344713436258,"score_spread":0.26395716107831146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042656244","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5978715,0.000024513147,0.40175977,0.000043124262,0.000076014745,0.0001119466,1.8956905e-7,0.0000383263,0.00007464342],"genre_scores_gemma":[0.601762,0.000033787932,0.3981759,0.000010603461,0.000007723747,0.0000034894008,4.662587e-7,0.0000018790473,0.0000041794387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998368,0.00003840205,0.0002646375,0.0004660618,0.00051249185,0.0003503534],"domain_scores_gemma":[0.99919635,0.000100891455,0.00006616826,0.00020808562,0.0002957735,0.00013275021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023797143,0.00010334308,0.00013428608,0.000555412,0.00046717326,0.00022072167,0.00042331644,0.000046376612,7.055734e-7],"category_scores_gemma":[0.000035840538,0.00009308502,0.000004233497,0.00077491516,0.0006069623,0.0008253361,0.000920418,0.0002816465,0.0000010376742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019179992,0.00008133874,0.0758365,0.00006569843,0.000004109374,0.0000023505218,0.0043848874,0.0023239625,0.0005492132,0.005367786,0.0000281902,0.9113368],"study_design_scores_gemma":[0.00014197952,0.00021690424,0.39282137,0.000054730135,1.3337083e-7,0.000013285371,0.000008047761,0.60398054,0.0025037795,0.00018105199,0.000019075835,0.000059083504],"about_ca_topic_score_codex":0.000010300873,"about_ca_topic_score_gemma":0.0000019910049,"teacher_disagreement_score":0.9112777,"about_ca_system_score_codex":0.000034854253,"about_ca_system_score_gemma":0.00026792422,"threshold_uncertainty_score":0.3795897},"labels":[],"label_agreement":null},{"id":"W2043057288","doi":"10.1109/fpl.2013.6645536","title":"Low-cost, high-performance branch predictors for soft processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stratix; Branch predictor; Field-programmable gate array; Computer science; Parallel computing; Decoding methods; Implementation; Stack (abstract data type); Embedded system; Computer hardware; Computer architecture; Algorithm; Operating system","score_opus":0.010499503158960342,"score_gpt":0.23020506379917438,"score_spread":0.21970556064021404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043057288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062483463,0.000012964702,0.9331974,0.00048566313,0.00017235374,0.0006219736,8.4133853e-7,0.0012348747,0.0017904881],"genre_scores_gemma":[0.78317696,0.000010963149,0.21420316,0.00048120157,0.00005610363,0.00024095262,0.000004093433,0.000009587152,0.0018169584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989904,0.000013748674,0.00021585672,0.0003168786,0.00016371743,0.00029939634],"domain_scores_gemma":[0.99921614,0.000064578424,0.00007575142,0.00034608523,0.00021524423,0.00008219345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015144036,0.00013052448,0.00013040124,0.00008645718,0.00014874627,0.00018133565,0.0007610355,0.000064540574,0.000033144395],"category_scores_gemma":[0.00003613877,0.00010702077,0.000035414585,0.0002767883,0.000026767104,0.00075609836,0.000113121765,0.00006863194,0.00007955405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002237534,0.00044763222,0.010968709,0.00045939238,0.00006780732,8.93655e-7,0.0012264091,0.08916404,0.00076254824,0.03897196,0.21187024,0.646038],"study_design_scores_gemma":[0.0003307713,0.00010755693,0.0040730806,0.00003352391,0.0000022765896,0.00000250066,0.0000023777905,0.94997764,0.039492585,0.0034666304,0.0022625048,0.00024854505],"about_ca_topic_score_codex":0.000019542375,"about_ca_topic_score_gemma":7.233336e-7,"teacher_disagreement_score":0.8608136,"about_ca_system_score_codex":0.000020353074,"about_ca_system_score_gemma":0.000050444254,"threshold_uncertainty_score":0.43641803},"labels":[],"label_agreement":null},{"id":"W2043313946","doi":"10.1145/1449764.1449796","title":"Analyzing the performance of code-copying virtual machines","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bytecode; Computer science; Copying; Programming language; Virtual machine; Just-in-time compilation; PowerPC; Interpreter; Parallel computing; Operating system; Pentium; Garbage collection; Software","score_opus":0.01940626241243428,"score_gpt":0.2521876064140616,"score_spread":0.23278134400162734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043313946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23815899,0.000051778494,0.75845146,0.00016785809,0.000044667344,0.000032986252,1.3810616e-7,0.00020514667,0.0028869642],"genre_scores_gemma":[0.8810746,0.00008359514,0.11818668,0.00009052074,0.000016208096,0.0000016355614,3.0451758e-7,0.0000026261737,0.00054379867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994623,0.00003321259,0.00015942618,0.00012577165,0.00011361287,0.00010565326],"domain_scores_gemma":[0.999485,0.00006884213,0.00006994214,0.00029650118,0.000060534836,0.00001918092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020705731,0.00006199108,0.00008632527,0.00005677266,0.00021506971,0.000019645078,0.00062103954,0.00001909675,0.0000081134485],"category_scores_gemma":[0.000016631646,0.000038863687,0.00003469271,0.00030247474,0.000053028372,0.00018193004,0.00015063738,0.000065469234,0.000005847053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027894326,0.0002256308,0.20112716,0.000051017658,0.00009920101,0.000014328663,0.007027173,0.45226195,0.0034682131,0.1297662,0.016580876,0.18935037],"study_design_scores_gemma":[0.000053457592,0.000048144935,0.0027481162,0.00000826326,0.000001049729,0.000016381455,0.0000035624937,0.98843914,0.008342947,0.00005971577,0.00021751667,0.00006173082],"about_ca_topic_score_codex":0.000015952652,"about_ca_topic_score_gemma":8.1031857e-7,"teacher_disagreement_score":0.64291567,"about_ca_system_score_codex":0.000005860407,"about_ca_system_score_gemma":0.000024737326,"threshold_uncertainty_score":0.1654164},"labels":[],"label_agreement":null},{"id":"W2043362877","doi":"10.1109/ispdc.2006.33","title":"Mobile Parallel Computing","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bluetooth; Computation; Mobile device; Mobile computing; Message Passing Interface; Parallel computing; Message passing; Programming language; Computer network; Operating system; Wireless","score_opus":0.010241156268891619,"score_gpt":0.24873450762646898,"score_spread":0.23849335135757738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043362877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013915941,0.00009318308,0.9153407,0.000075482974,0.00007722544,0.000083977575,9.608009e-8,0.0015707806,0.08136696],"genre_scores_gemma":[0.45768744,0.000002911145,0.54035217,0.00017118924,0.000042940934,0.000003439492,0.0000014241785,0.0000033871686,0.0017351265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992298,0.000029128747,0.00017735045,0.00023671838,0.00012952164,0.0001974775],"domain_scores_gemma":[0.999517,0.000033620057,0.000051502728,0.00031506547,0.00005077545,0.000032035125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014921377,0.000086836546,0.000091664224,0.00006688308,0.000117031566,0.00013107838,0.0005319608,0.00003578519,0.000015484164],"category_scores_gemma":[0.000004178524,0.00007815655,0.000041641782,0.00024610982,0.000017660319,0.00016064702,0.00018155934,0.000059521655,0.000093829054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013981314,0.00013020157,0.0015235624,0.0000066113066,0.0000059959007,0.00001143259,0.00015229684,0.23878367,0.00016741136,0.6574903,0.069071695,0.03265539],"study_design_scores_gemma":[0.0001493348,0.00004959615,0.00066330587,0.000005525656,8.149377e-7,0.000011978654,0.000003559777,0.96860033,0.0011345466,0.013117191,0.016089821,0.0001739854],"about_ca_topic_score_codex":0.00004631009,"about_ca_topic_score_gemma":0.0000011628704,"teacher_disagreement_score":0.7298167,"about_ca_system_score_codex":0.000015121617,"about_ca_system_score_gemma":0.000017544762,"threshold_uncertainty_score":0.31871316},"labels":[],"label_agreement":null},{"id":"W2043526161","doi":"10.1145/2435264.2435301","title":"A remote memory access infrastructure for global address space programming models in FPGAs","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Partitioned global address space; Field-programmable gate array; Synchronization (alternating current); Programming paradigm; Interface (matter); Embedded system; Simple (philosophy); Distributed memory; Address space; Computer architecture; Shared memory; Parallel computing; Operating system; Computer network; Programming language","score_opus":0.025911746244546507,"score_gpt":0.30246648565413947,"score_spread":0.27655473940959296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043526161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027890902,0.00004525481,0.986529,0.0011905816,0.000102375736,0.0007805288,7.6169516e-7,0.0007104725,0.007851924],"genre_scores_gemma":[0.2286982,0.0000062903387,0.77054375,0.00037292895,0.00003104233,0.000044127355,0.0000023596067,0.000006927442,0.00029434208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882674,0.000039988092,0.0002280877,0.00039290756,0.00016479725,0.0003474684],"domain_scores_gemma":[0.9992548,0.000044527416,0.000062262145,0.00039865982,0.00015518321,0.00008457067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791921,0.00014862414,0.00016908163,0.0000859707,0.00007710032,0.00052740006,0.0011732954,0.00009620059,0.000008618564],"category_scores_gemma":[0.00003791772,0.00012943354,0.000051772364,0.0004894163,0.000025068079,0.0011262586,0.00042583526,0.00009582673,0.000003454458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008006714,0.000046836587,0.00042022037,0.000048723952,0.000012357417,0.0000035685575,0.00039805452,0.5060382,0.000020858297,0.056789756,0.017417165,0.4187963],"study_design_scores_gemma":[0.0002547861,0.000028749811,0.0005624723,0.00002678651,0.0000011898843,0.000006011056,0.000012021186,0.9222099,0.00038306366,0.07576931,0.00058591814,0.00015975237],"about_ca_topic_score_codex":0.00041614147,"about_ca_topic_score_gemma":0.000038320886,"teacher_disagreement_score":0.41863653,"about_ca_system_score_codex":0.00007307251,"about_ca_system_score_gemma":0.00006991796,"threshold_uncertainty_score":0.5278147},"labels":[],"label_agreement":null},{"id":"W2043647819","doi":"10.1587/transinf.e96.d.1457","title":"Revisiting Shared Cache Contention Problems: A Practical Hardware-Software Cooperative Approach","year":2013,"lang":"en","type":"article","venue":"IEICE Transactions on Information and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Evaluation Institute of Industrial Technology; Ministry of Knowledge Economy","keywords":"Computer science; Cache; Cache invalidation; Cache algorithms; Parallel computing; Smart Cache; Scheduling (production processes); Cache coloring; Cache pollution; Bus sniffing; Distributed computing; Embedded system; CPU cache","score_opus":0.03322111574118972,"score_gpt":0.26129554759572055,"score_spread":0.22807443185453083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043647819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002724655,0.000052261254,0.99420434,0.0005436363,0.00015098402,0.00083574373,0.000009031495,0.00065377395,0.0032777444],"genre_scores_gemma":[0.81968194,0.00006978095,0.17834827,0.00056734896,0.000043832923,0.0005939783,0.00005443077,0.000011364721,0.00062906486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998656,0.00015745034,0.00052673067,0.00020006734,0.0002700962,0.0001896671],"domain_scores_gemma":[0.9988152,0.00011507496,0.00022614568,0.00025613132,0.0004805355,0.00010693539],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004142887,0.00015756756,0.0001914914,0.00019923228,0.00039719936,0.0011745017,0.0001801351,0.00010437451,0.000018028028],"category_scores_gemma":[0.00006449853,0.00013657918,0.0000492624,0.00032863006,0.000029301022,0.004025374,0.000009532012,0.00022579366,0.00010159567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059595317,0.0005299099,0.00021092303,0.0019385547,0.00033201688,0.0000048497254,0.028591027,0.650571,0.0001816441,0.063623525,0.013108949,0.24084803],"study_design_scores_gemma":[0.00037881575,0.000076083605,0.00011714026,0.00014833131,0.0000080685595,0.000090376125,0.00082326453,0.9939505,0.00005494325,0.00003180311,0.004119141,0.00020154624],"about_ca_topic_score_codex":0.00014526943,"about_ca_topic_score_gemma":6.922853e-7,"teacher_disagreement_score":0.81940943,"about_ca_system_score_codex":0.000057424888,"about_ca_system_score_gemma":0.00005469883,"threshold_uncertainty_score":0.9998624},"labels":[],"label_agreement":null},{"id":"W2044274432","doi":"10.1145/1147349.1147358","title":"Hiding message delivery and reducing memory access latency by providing direct-to-cache transfer during receive operations in a message passing environment","year":2005,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Copying; Cache invalidation; Message passing; Latency (audio); Computer network; Thread (computing); Cache pollution; False sharing; Cache algorithms; Bus sniffing; CPU cache; Distributed computing; Parallel computing; Operating system; Telecommunications","score_opus":0.013718841968434082,"score_gpt":0.24614041599290093,"score_spread":0.23242157402446684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044274432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2769884,0.00036760292,0.7169858,0.004237403,0.000084047875,0.00064412755,0.000003913061,0.00034669854,0.000342027],"genre_scores_gemma":[0.63288057,0.00016806553,0.36591607,0.0006496515,0.00017074522,0.00005486244,0.000006987192,0.000035410325,0.00011762524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965651,0.0004442789,0.0006295884,0.0012143039,0.00043710048,0.00070961996],"domain_scores_gemma":[0.99834836,0.00034710902,0.00006653277,0.00092113065,0.000042209896,0.000274665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005819775,0.00044043432,0.00045729973,0.000577675,0.00047152909,0.00072076125,0.0017590414,0.00013621684,0.000012512568],"category_scores_gemma":[0.00007032014,0.0004274758,0.000093535076,0.00058875955,0.00006816315,0.0009071191,0.0015792818,0.00062441826,0.000008206647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024056342,0.00012898893,0.0005891035,0.00005887637,0.00003976247,0.000033793916,0.012246369,0.6785186,0.022030184,0.000051624138,0.0007096359,0.28556904],"study_design_scores_gemma":[0.0017636222,0.00025300382,0.0037793866,0.00079414324,0.00002972541,0.00010975253,0.00005190894,0.9088737,0.07910317,0.0003965293,0.003416731,0.0014283485],"about_ca_topic_score_codex":0.00017692815,"about_ca_topic_score_gemma":0.00007606439,"teacher_disagreement_score":0.35589218,"about_ca_system_score_codex":0.0002317151,"about_ca_system_score_gemma":0.00007847601,"threshold_uncertainty_score":0.9998177},"labels":[],"label_agreement":null},{"id":"W2045280800","doi":"10.1145/2491411.2494596","title":"RiTHM: a tool for enabling time-triggered runtime verification for C programs","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Runtime verification; Formal verification; Programming language","score_opus":0.019236451245378663,"score_gpt":0.2547115679564676,"score_spread":0.23547511671108895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045280800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082772743,0.000025203093,0.9946623,0.00070933194,0.00006756328,0.0017919703,9.86661e-7,0.0011246349,0.00079027744],"genre_scores_gemma":[0.028568601,0.0000041678913,0.9659093,0.00020891147,0.00006362673,0.0010103963,0.00002721218,0.000011951407,0.0041958285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990796,0.000018548244,0.00022764661,0.00032389312,0.00010389912,0.00024643526],"domain_scores_gemma":[0.99907464,0.000107600106,0.00008991352,0.00035569823,0.0003281585,0.00004399813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030491003,0.000105135965,0.00012708773,0.000081860315,0.0001599887,0.00037617222,0.0004856571,0.000062561885,0.0000151840095],"category_scores_gemma":[0.00007193954,0.0000924404,0.0000799107,0.00021443944,0.000014743917,0.00044109634,0.000061058156,0.000033452634,0.00007359873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019761832,0.0003468517,0.00006810195,0.00009083673,0.000050487753,2.7619313e-7,0.00042643418,0.0013361248,0.0052370233,0.0763262,0.06524063,0.85085726],"study_design_scores_gemma":[0.00033662672,0.00012991813,0.000039008246,0.000012344446,0.0000035100397,0.0000017121279,0.0000033130866,0.96885544,0.0055328705,0.0064345836,0.018482598,0.00016808201],"about_ca_topic_score_codex":0.000013348614,"about_ca_topic_score_gemma":1.8568481e-7,"teacher_disagreement_score":0.9675193,"about_ca_system_score_codex":0.000023403298,"about_ca_system_score_gemma":0.000037226015,"threshold_uncertainty_score":0.37696102},"labels":[],"label_agreement":null},{"id":"W2046643070","doi":"10.4028/www.scientific.net/amr.1049-1050.2126","title":"Speculative High Performance Computation on Heterogeneous Multi-Core","year":2014,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Speculative multithreading; Computer science; Speedup; Parallel computing; Many core; Computation; Homogeneous; Benchmark (surveying); Thread (computing); Multi-core processor; Speculation; Computer architecture; Multithreading; Operating system; Algorithm","score_opus":0.07708414911293841,"score_gpt":0.3795280697873424,"score_spread":0.30244392067440395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046643070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4178442,0.000008404839,0.58091295,0.00010635879,0.00020808278,0.0002305967,0.0000020825255,0.00030851748,0.0003787867],"genre_scores_gemma":[0.7909293,0.000033992543,0.20866165,0.000089438414,0.00006299375,0.000035474015,0.000012344847,0.000014788758,0.00015999834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979836,0.00033882982,0.00026266451,0.0004880881,0.0004938027,0.0004330417],"domain_scores_gemma":[0.9987953,0.00022548338,0.0000912269,0.00047686978,0.00032747767,0.00008369329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010045511,0.00015045208,0.00020358908,0.00022948477,0.00032109793,0.00019417901,0.0005968982,0.00006712336,0.000015845313],"category_scores_gemma":[0.00015110316,0.00013685183,0.00002270083,0.00036291778,0.00008700239,0.00027814612,0.00029320404,0.0001572578,0.00018493403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001375328,0.00023703897,0.00005249081,0.00008592301,0.000019086681,0.000014617737,0.00044449844,0.75310034,0.11993166,0.032635845,0.00033378156,0.09300717],"study_design_scores_gemma":[0.0005436067,0.0005551643,0.0011850772,0.00007539636,7.9534203e-7,0.000006931247,0.0000030790259,0.41323724,0.5786135,0.005100085,0.0004692209,0.00020986906],"about_ca_topic_score_codex":0.000016536937,"about_ca_topic_score_gemma":9.020891e-7,"teacher_disagreement_score":0.45868188,"about_ca_system_score_codex":0.000079178615,"about_ca_system_score_gemma":0.00002836721,"threshold_uncertainty_score":0.5580656},"labels":[],"label_agreement":null},{"id":"W2046736907","doi":"10.1145/2464996.2465006","title":"Improving communication in PGAS environments","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; IBM (Canada)","funders":"","keywords":"Partitioned global address space; Programmer; Computer science; Compiler; Parallel computing; Programming language; Code (set theory); Computer architecture; Programming paradigm","score_opus":0.009931401341644878,"score_gpt":0.2217394340242119,"score_spread":0.211808032682567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046736907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052894354,0.000034950273,0.9845657,0.0005496245,0.000014232458,0.00009936488,1.8308523e-8,0.00017078606,0.009275896],"genre_scores_gemma":[0.59426135,0.000014138846,0.40500477,0.00020935858,0.0000020427287,0.000013445904,6.18559e-7,0.0000017365693,0.0004925798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956906,0.000040551822,0.00011215361,0.00011623009,0.000065732784,0.000096268515],"domain_scores_gemma":[0.99951935,0.000025053112,0.00003480841,0.00039132708,0.000007148733,0.000022302469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011952801,0.00004274397,0.000044326276,0.000055706383,0.000038053153,0.000078991216,0.00051127566,0.000023901255,0.000027843795],"category_scores_gemma":[0.000010696467,0.00003952305,0.000010469954,0.000104254934,0.00001139076,0.00038216636,0.00023021805,0.000055451274,0.00011205996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016779776,0.00038434376,0.017851477,0.000014595955,0.000010204443,0.0000027203132,0.0017916854,0.018043173,0.008219248,0.15220642,0.012795358,0.7886791],"study_design_scores_gemma":[0.00010786815,0.0000120154455,0.01026315,0.000006038329,2.1432645e-7,0.0000010430142,0.000008175813,0.9818443,0.002615876,0.0044263643,0.00063084014,0.000084080246],"about_ca_topic_score_codex":0.00030857665,"about_ca_topic_score_gemma":0.000004155752,"teacher_disagreement_score":0.96380115,"about_ca_system_score_codex":0.000023337258,"about_ca_system_score_gemma":0.000005933997,"threshold_uncertainty_score":0.16117032},"labels":[],"label_agreement":null},{"id":"W2047060659","doi":"10.1109/micro.2012.16","title":"Cache-Conscious Wavefront Scheduling","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":419,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada); University of British Columbia","funders":"Yale University; Advanced Micro Devices","keywords":"Computer science; Cache; Parallel computing; Cache algorithms; Thrashing; Cache invalidation; Scheduling (production processes); Smart Cache; Page cache; Cache pollution; Cache coloring; CPU cache; Distributed computing","score_opus":0.019886702994642073,"score_gpt":0.25969499999057477,"score_spread":0.2398082969959327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047060659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028740694,0.00025014265,0.96451485,0.00038766212,0.00023994503,0.00005173739,8.233279e-8,0.000997112,0.0306844],"genre_scores_gemma":[0.5049955,0.0000047427457,0.4940328,0.00033735507,0.000051433988,0.000002479755,3.4408578e-7,0.000002791165,0.0005725258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993148,0.000032967582,0.00012084352,0.00014164484,0.00011584843,0.000273886],"domain_scores_gemma":[0.9994717,0.00003482029,0.000035749872,0.00031470394,0.000038369195,0.000104625426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030113343,0.00007636543,0.00007792413,0.000061679086,0.00009460752,0.00006960174,0.00040952777,0.000039165872,0.000022499371],"category_scores_gemma":[0.00002868256,0.00006549086,0.00003328546,0.00015213052,0.000015264617,0.0003854805,0.00017557415,0.00007136041,0.00012802857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003596019,0.00033545765,0.018150594,0.000017695147,0.000041268864,0.0000062596937,0.003083574,0.01165344,0.0010323167,0.82016635,0.025566632,0.11994282],"study_design_scores_gemma":[0.00024688197,0.000043186563,0.0023966613,0.000015254922,0.000004649949,0.00004783898,0.000029597864,0.96029913,0.015560875,0.0036506408,0.017253116,0.00045216936],"about_ca_topic_score_codex":0.000018576755,"about_ca_topic_score_gemma":8.5686423e-7,"teacher_disagreement_score":0.9486457,"about_ca_system_score_codex":0.000022727687,"about_ca_system_score_gemma":0.000020666621,"threshold_uncertainty_score":0.26706398},"labels":[],"label_agreement":null},{"id":"W2047172496","doi":"10.5555/2492708.2492874","title":"An instruction scratchpad memory allocation for the precision timed architecture","year":2012,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Register allocation; Architecture; Parallel computing; Control flow graph; Control flow; Scheme (mathematics); Distributed computing; Computer architecture; Operating system; Theoretical computer science; Programming language; Compiler","score_opus":0.01954755552634155,"score_gpt":0.2604474411216953,"score_spread":0.24089988559535377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047172496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007460009,0.000198119,0.9907356,0.0003831346,0.00017493282,0.00047765722,7.43417e-7,0.00041515497,0.00015467645],"genre_scores_gemma":[0.5909886,0.00006681034,0.40851748,0.00017679532,0.00010624044,0.000046125842,0.000010155707,0.000011235169,0.0000765998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907166,0.00020226973,0.00021782993,0.00020542886,0.00013349898,0.0001693034],"domain_scores_gemma":[0.99871385,0.0006446184,0.00010838266,0.00031483106,0.00016514031,0.00005319918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009794432,0.00010751429,0.00008761171,0.00013024609,0.00024369238,0.00014914745,0.00032452,0.00004886493,0.0000019696467],"category_scores_gemma":[0.00040174896,0.000079393176,0.000014439043,0.00048250775,0.000033979246,0.00062752154,0.000037643695,0.000085986045,0.0000040738873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034045603,0.00040842203,0.00497813,0.00005535252,0.00001732734,8.29163e-7,0.009185482,0.12681238,0.0034471746,0.021430278,0.003633813,0.82999676],"study_design_scores_gemma":[0.0003224595,0.00013012052,0.039794832,0.00002511043,0.0000057940947,0.00001862151,0.000014592465,0.95210695,0.002994064,0.0027229479,0.0017175728,0.00014690697],"about_ca_topic_score_codex":0.000009890566,"about_ca_topic_score_gemma":0.0000022062068,"teacher_disagreement_score":0.82984984,"about_ca_system_score_codex":0.00001733521,"about_ca_system_score_gemma":0.000041862688,"threshold_uncertainty_score":0.32375595},"labels":[],"label_agreement":null},{"id":"W2047390994","doi":"10.1109/hpca.2014.6835964","title":"Increasing TLB reach by exploiting clustering in page translations","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":154,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Translation lookaside buffer; Locality; Computer science; Bottleneck; Page; Virtual memory; Operating system; Cluster analysis; Parallel computing; Virtual machine; Memory management; Page fault; Set (abstract data type); Cluster (spacecraft); Embedded system; Physical address; Artificial intelligence; Programming language","score_opus":0.01730971472947552,"score_gpt":0.24963349488912945,"score_spread":0.23232378015965394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047390994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013410772,0.000025068293,0.9630298,0.00048588598,0.000036039037,0.00006454362,2.0733735e-7,0.00063762243,0.022310063],"genre_scores_gemma":[0.5975552,0.0000043896734,0.40214452,0.00020318967,0.00001284189,0.0000041299463,0.0000019634376,0.0000045154047,0.00006919643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911106,0.0001452164,0.00022087642,0.0002380949,0.00009323053,0.00019152099],"domain_scores_gemma":[0.99948645,0.00015635183,0.000045105593,0.00024450218,0.000023141705,0.000044430457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006807509,0.000084853134,0.0001044843,0.00011545127,0.000102983984,0.00012299571,0.00035518807,0.000041918775,0.000005069323],"category_scores_gemma":[0.00006412689,0.00008616771,0.000025165096,0.00032593613,0.000011622035,0.00033511006,0.00008666241,0.00009776064,0.000005762832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019492787,0.00035146863,0.01705054,0.00008537051,0.000022718457,0.000011657635,0.007772735,0.09946788,0.04101565,0.14401847,0.0077971574,0.6823869],"study_design_scores_gemma":[0.00014933843,0.000014957384,0.00040634634,0.000031383537,6.415343e-7,0.000006958376,0.000014200699,0.9957166,0.0012774414,0.0013375046,0.0009191028,0.00012557778],"about_ca_topic_score_codex":0.00015928858,"about_ca_topic_score_gemma":0.000027334137,"teacher_disagreement_score":0.89624864,"about_ca_system_score_codex":0.00002148442,"about_ca_system_score_gemma":0.000010202749,"threshold_uncertainty_score":0.35138175},"labels":[],"label_agreement":null},{"id":"W204746936","doi":"10.1007/978-3-642-21878-1_65","title":"Automatic MPI to AMPI Program Transformation Using Photran","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Message Passing Interface; Fortran; Parallel computing; Task (project management); Message passing; Programming language; Operating system","score_opus":0.032754610174247814,"score_gpt":0.2839519831186513,"score_spread":0.2511973729444035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204746936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015368301,0.00007919063,0.9906483,0.00027230993,0.0009686055,0.0007812873,0.0000021415653,0.0012834102,0.0058110305],"genre_scores_gemma":[0.054818947,0.00001310877,0.9439743,0.00087236316,0.00012722649,0.000019298544,0.000004280933,0.000033770124,0.00013666223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667835,0.00004215491,0.0006685486,0.0011460067,0.0007987529,0.0006661971],"domain_scores_gemma":[0.9980097,0.000098458564,0.00026500705,0.0011247939,0.00026647348,0.00023557367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007725259,0.0005200037,0.00050077937,0.0015298718,0.00030313848,0.00060290773,0.0028973704,0.00029959815,0.00004324288],"category_scores_gemma":[0.00003158747,0.00049638754,0.00014341902,0.001136364,0.00026156052,0.0007460616,0.0005129885,0.00052612706,0.000046480163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020877699,0.000036022357,0.0000030092908,0.000033609325,0.000006149477,0.000016127065,0.0019278256,0.043829124,0.000037139816,0.003806812,0.00002145011,0.95028067],"study_design_scores_gemma":[0.00013379307,0.00025206347,0.0000380313,0.00042819313,0.000007714741,0.0000540031,7.777984e-8,0.95546794,0.0013484431,0.04055434,0.0011021564,0.0006132213],"about_ca_topic_score_codex":0.00003772181,"about_ca_topic_score_gemma":0.000021349637,"teacher_disagreement_score":0.9496674,"about_ca_system_score_codex":0.00028631397,"about_ca_system_score_gemma":0.00035762566,"threshold_uncertainty_score":0.99974877},"labels":[],"label_agreement":null},{"id":"W2047472890","doi":"10.1145/1735997.1736011","title":"AASH","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypervisor; Computer science; Multi-core processor; Thread (computing); Instruction set; Virtual machine; Operating system; Architecture; Asymmetry; Virtualization; Parallel computing; Distributed computing; Embedded system; Cloud computing","score_opus":0.008948609307499944,"score_gpt":0.2466002590022306,"score_spread":0.23765164969473065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047472890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016473997,0.0000018390623,0.8860978,0.00055164314,0.00017211706,0.000017718414,2.261737e-8,0.00083378947,0.11067767],"genre_scores_gemma":[0.37856206,7.43524e-7,0.6198026,0.00034293428,0.000020032843,0.0000010229088,1.2012812e-7,0.0000011355816,0.0012693837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.000005471144,0.000048555583,0.000098647055,0.000054818993,0.000070824644],"domain_scores_gemma":[0.999662,0.000014454484,0.000012242482,0.00025532622,0.0000265874,0.000029394318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008722816,0.000029711007,0.000028393,0.000029364666,0.000038705402,0.00006325134,0.00040555885,0.000022187565,0.000041268275],"category_scores_gemma":[0.0000141872115,0.000024533514,0.000013797789,0.00010096424,0.000009035888,0.000110508416,0.000089574445,0.00007041604,0.00007917737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4915338e-7,0.000016258455,0.00034886817,6.1163735e-7,0.0000011981517,0.0000013428222,0.00004926826,0.00008226488,0.0018828415,0.93919367,0.020216148,0.0382074],"study_design_scores_gemma":[0.00013803446,0.000032536165,0.0021664193,0.0000020796886,6.7818576e-7,0.0000269088,0.0000015930896,0.8034351,0.038227804,0.038185794,0.11754995,0.00023311707],"about_ca_topic_score_codex":0.0000045101438,"about_ca_topic_score_gemma":0.0000023329108,"teacher_disagreement_score":0.90100783,"about_ca_system_score_codex":0.0000012334665,"about_ca_system_score_gemma":0.000011232649,"threshold_uncertainty_score":0.101769134},"labels":[],"label_agreement":null},{"id":"W2047709292","doi":"10.1016/j.ejor.2006.03.033","title":"Challenges of Continuous Optimization in Theory and Applications","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Mathematical optimization; Benchmark (surveying); Heuristic; Combinatorial optimization; Computer science; Mathematics; Regular polygon; Clique problem; Quadratic equation; Clique; Graph; Combinatorics","score_opus":0.0484715312907173,"score_gpt":0.34615689763662827,"score_spread":0.297685366345911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047709292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018577548,0.0016804447,0.9742981,0.0007509947,0.0000152319,0.00009945828,4.9677493e-7,0.000011502096,0.021285996],"genre_scores_gemma":[0.8456599,0.00050359534,0.15359457,0.0000189218,0.0000964885,0.0000024097044,0.0000011269163,0.0000061176092,0.000116886775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789536,0.0011504546,0.000372428,0.00011746157,0.0003606126,0.00010369753],"domain_scores_gemma":[0.99869555,0.00033698982,0.00011547782,0.00013013468,0.00068737345,0.000034454362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259612,0.000048008107,0.000102595935,0.00035083422,0.000074355594,0.0000759873,0.0003915035,0.00001394743,0.0000051434577],"category_scores_gemma":[0.00018277203,0.00004187574,0.000020274021,0.000272338,0.00007748756,0.00024267513,0.00010696533,0.00017334323,0.0000019426009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002165497,0.00012645753,0.0002682039,0.000010827175,0.000005804349,0.00001774616,0.00024297765,0.21813028,0.00035985702,0.75225824,0.0003828606,0.028175086],"study_design_scores_gemma":[0.0056744386,0.0030005977,0.1406069,0.0008721325,0.000015992046,0.0008257693,0.0008527473,0.68699193,0.008093385,0.13041341,0.021689788,0.00096293347],"about_ca_topic_score_codex":0.0000025148445,"about_ca_topic_score_gemma":9.2759103e-7,"teacher_disagreement_score":0.84380215,"about_ca_system_score_codex":0.000019130846,"about_ca_system_score_gemma":0.00008203415,"threshold_uncertainty_score":0.2169469},"labels":[],"label_agreement":null},{"id":"W2047771187","doi":"10.1145/1094855.1094902","title":"Scopira","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Porting; Computer science; Visualization; MATLAB; Software engineering; Open source; Software; Open source software; Data visualization; Programming language; Computer graphics (images); Computational science; Engineering drawing; Data mining; Engineering","score_opus":0.014660077274330602,"score_gpt":0.2607403526573387,"score_spread":0.24608027538300808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047771187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022496282,0.000029050008,0.8885472,0.0016554084,0.000027579696,0.000020429577,1.7319438e-8,0.00084113027,0.10865425],"genre_scores_gemma":[0.25171366,0.000004169423,0.7450094,0.0011534976,0.000033311393,0.0000012036331,1.1254993e-7,0.000001262879,0.0020833504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969,0.0000089179,0.000061162384,0.00010094035,0.00006063603,0.000078371086],"domain_scores_gemma":[0.99973476,0.000010228631,0.000012900148,0.00019597312,0.00002030711,0.00002581043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006850876,0.000031995925,0.000032122713,0.000033244844,0.00003631992,0.00005415253,0.0003317457,0.000014211436,0.00003083655],"category_scores_gemma":[0.000005529076,0.000027135477,0.000013966219,0.0001083573,0.000005714462,0.00018370172,0.000077972974,0.000025076082,0.00017324348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.8367068e-7,0.000037927293,0.00018564722,0.0000015002931,0.0000028811546,0.0000011424066,0.00013855741,0.0077540926,0.00009594389,0.61816764,0.05688071,0.3167336],"study_design_scores_gemma":[0.00008442061,0.00001930254,0.00020822225,0.0000040193167,3.3293693e-7,0.000005636003,8.2228036e-7,0.88395244,0.010195873,0.0024094523,0.103017256,0.00010224607],"about_ca_topic_score_codex":0.0000022714567,"about_ca_topic_score_gemma":7.873372e-7,"teacher_disagreement_score":0.87619835,"about_ca_system_score_codex":0.0000078096045,"about_ca_system_score_gemma":0.000011125786,"threshold_uncertainty_score":0.22267522},"labels":[],"label_agreement":null},{"id":"W2048166678","doi":"10.1109/ipdpsw.2010.5470679","title":"A GPU-inspired soft processor for high-throughput acceleration","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Parallel computing; Field-programmable gate array; Multithreading; Coprocessor; Pipeline (software); Thread (computing); Computer architecture; Hardware acceleration; Register file; Instruction set; Floating point; General-purpose computing on graphics processing units; Embedded system; Graphics; Operating system","score_opus":0.01949412070424403,"score_gpt":0.2755911484620504,"score_spread":0.25609702775780635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048166678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043194257,0.000006710841,0.989802,0.0017568023,0.00034233992,0.00032866636,0.0000010198881,0.0013684132,0.0020746184],"genre_scores_gemma":[0.4453094,0.0000015136707,0.55332434,0.00048993225,0.0000877733,0.0000585432,0.0000054777624,0.000006186429,0.00071681716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991283,0.000012517413,0.00019300172,0.00033270655,0.00013414842,0.0001993351],"domain_scores_gemma":[0.99921346,0.000066427914,0.000082402716,0.00036780557,0.00021713135,0.000052753574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022100439,0.00010792869,0.00011173179,0.00006865807,0.00018950416,0.0002585926,0.00060346554,0.000086301916,0.000017446057],"category_scores_gemma":[0.00009767226,0.00009381375,0.000038262882,0.00021680308,0.000021372618,0.0005173537,0.000100262325,0.00009965927,0.000017893804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001737181,0.00022181333,0.00022473226,0.00005235461,0.000020337693,0.0000015435775,0.0006166348,0.0021040256,0.014157985,0.81875324,0.03731282,0.12651713],"study_design_scores_gemma":[0.00054008607,0.00014819,0.0003751757,0.000008233677,0.0000042079423,0.0000067098517,0.0000036449023,0.8610895,0.08706492,0.03628042,0.014167705,0.000311199],"about_ca_topic_score_codex":0.000019982124,"about_ca_topic_score_gemma":0.000020934844,"teacher_disagreement_score":0.8589855,"about_ca_system_score_codex":0.000009953501,"about_ca_system_score_gemma":0.00007650601,"threshold_uncertainty_score":0.3825614},"labels":[],"label_agreement":null},{"id":"W2048907983","doi":"10.1145/1152649.1152652","title":"Controlling garbage collection and heap growth to reduce the execution time of Java applications","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Toronto; York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Garbage collection; Heap (data structure); Computer science; Manual memory management; Garbage; Memory leak; Java; Operating system; Memory footprint; Virtual machine; Database; Parallel computing; Programming language","score_opus":0.009267692778704437,"score_gpt":0.25828902054438296,"score_spread":0.24902132776567854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048907983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006000086,0.0007501767,0.9914381,0.0006088551,0.00004480453,0.00070911454,0.0000032331377,0.000235789,0.00020985141],"genre_scores_gemma":[0.9510024,0.00004094658,0.048195723,0.00003522382,0.000037316393,0.00021654996,0.0000029790544,0.0000074917157,0.00046134554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918973,0.00007836936,0.0002313587,0.00023393269,0.0001302901,0.00013634402],"domain_scores_gemma":[0.99932986,0.00014073201,0.00008933563,0.00030658636,0.000092790746,0.000040682862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033021838,0.00009777216,0.00014402001,0.00011903971,0.0003397,0.00017368341,0.00021299266,0.00005055343,6.6317335e-7],"category_scores_gemma":[0.000013742805,0.000075706404,0.000033124757,0.00038878355,0.00003872174,0.00008885862,0.000011212726,0.00007812267,0.0000016080628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017694257,0.001082569,0.000720803,0.00066695124,0.00029473956,0.000011302778,0.01005952,0.08191403,0.026842402,0.06668013,0.0025816408,0.80896896],"study_design_scores_gemma":[0.003638217,0.0022416497,0.0035954916,0.0009426584,0.00028274392,0.00053089834,0.003908659,0.90166384,0.043223206,0.004129475,0.033966817,0.0018763181],"about_ca_topic_score_codex":0.0006445773,"about_ca_topic_score_gemma":0.000010835792,"teacher_disagreement_score":0.9450023,"about_ca_system_score_codex":0.000019471894,"about_ca_system_score_gemma":0.0000144713495,"threshold_uncertainty_score":0.30872175},"labels":[],"label_agreement":null},{"id":"W2049461947","doi":"10.1145/1390841.1390849","title":"Towards a better collaboration of static and dynamic analyses for testing concurrent programs","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Static analysis; Computer science; Alias; Dynamic program analysis; Concurrency; Java; Dynamic testing; Static program analysis; Program analysis; Distributed computing; Programming language; Data mining; Software","score_opus":0.08933416078441131,"score_gpt":0.36149601671473425,"score_spread":0.27216185593032294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049461947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0515362,0.00005803078,0.94750905,0.00025371305,0.00002836005,0.00023125837,0.0000012710178,0.00018464736,0.00019749037],"genre_scores_gemma":[0.49641618,0.0000056187405,0.50348413,0.000046893325,0.0000031244767,0.000013852804,0.000003095149,0.0000018528021,0.000025265874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944454,0.000023474351,0.00018211686,0.00015655541,0.00009817458,0.00009515366],"domain_scores_gemma":[0.9994259,0.000076385106,0.00009700721,0.00011295141,0.00026013175,0.000027651557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010344028,0.00006243408,0.00011509284,0.00006619209,0.0000738187,0.000042609194,0.00013303777,0.000020024901,5.196933e-7],"category_scores_gemma":[0.000069282396,0.000053273827,0.00001785469,0.00035498443,0.000042017262,0.00014432128,0.000049100123,0.00002236821,2.0732139e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011060587,0.00035599072,0.009390045,0.0002763304,0.000089497276,0.0000072717194,0.0038886834,0.009440282,0.0041915197,0.010765972,0.0026744714,0.95890886],"study_design_scores_gemma":[0.00017549959,0.00019437165,0.0011039247,0.000019081577,0.0000047603357,0.0000072056278,0.00001543087,0.9952474,0.0021154212,0.000968937,0.000072673916,0.00007527183],"about_ca_topic_score_codex":0.00001750045,"about_ca_topic_score_gemma":0.000003422309,"teacher_disagreement_score":0.9858071,"about_ca_system_score_codex":0.000012113173,"about_ca_system_score_gemma":0.00006649583,"threshold_uncertainty_score":0.21724437},"labels":[],"label_agreement":null},{"id":"W2049492770","doi":"10.1109/hpcs.2007.23","title":"On the Programming Impact ofMulti-Core,Multi-Processor Nodes inMPI Clusters","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multi-core processor; Parallel computing; Core (optical fiber); Cluster (spacecraft); Code (set theory); Cache; Process (computing); Dual (grammatical number); Computer cluster; Distributed computing; Computer network; Operating system; Set (abstract data type); Telecommunications","score_opus":0.04430508278412269,"score_gpt":0.3315388588854897,"score_spread":0.28723377610136697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049492770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009464628,0.00002571612,0.98105574,0.0004323493,0.000066754714,0.00025099312,2.5675897e-7,0.0009766727,0.0077268723],"genre_scores_gemma":[0.5990106,0.0000019607892,0.398283,0.0009916725,0.00002297488,0.0000072212442,9.112055e-7,0.000009718587,0.0016719421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987646,0.00002861585,0.0002537458,0.00031963616,0.00025591115,0.00037749615],"domain_scores_gemma":[0.9988962,0.00030883626,0.000109917695,0.00048510561,0.00010783601,0.000092147806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092746946,0.0001730995,0.00012367479,0.00012565455,0.00023269904,0.00023036446,0.0009528971,0.00006845137,0.0000127286885],"category_scores_gemma":[0.00012567683,0.00010100281,0.00009159566,0.00041079763,0.00005413735,0.0001968492,0.0001846137,0.00017491647,0.000044119286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017446533,0.001308691,0.005532942,0.000061438455,0.00019983653,0.00006744494,0.008093626,0.05212754,0.0009229528,0.33256555,0.02678172,0.57216376],"study_design_scores_gemma":[0.0004531147,0.00019930917,0.002145305,0.000041279294,0.0000043594905,0.000015025304,0.000049314134,0.9886672,0.0051418617,0.0021314942,0.00078899536,0.0003627769],"about_ca_topic_score_codex":0.0000341568,"about_ca_topic_score_gemma":0.000011027657,"teacher_disagreement_score":0.93653965,"about_ca_system_score_codex":0.00006996413,"about_ca_system_score_gemma":0.00004813253,"threshold_uncertainty_score":0.4118775},"labels":[],"label_agreement":null},{"id":"W2049554599","doi":"10.1016/j.compeleceng.2013.05.013","title":"Recalling instructions from idling threads to maximize resource utilization for simultaneous multi-threading processors","year":2013,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Threading (protein sequence); Computer science; Resource (disambiguation); Parallel computing; Chemistry; Computer network","score_opus":0.027027446369157493,"score_gpt":0.25456088252085723,"score_spread":0.22753343615169974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049554599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008097218,0.00016424627,0.9886602,0.000274696,0.00029102588,0.000671274,0.0000016404515,0.0018153612,0.000024332849],"genre_scores_gemma":[0.27555564,0.000009457452,0.72390693,0.00021896907,0.0001365927,0.000094034745,0.000013565639,0.00003380165,0.000031024087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980781,0.000029761108,0.00044068415,0.00065513083,0.0002289807,0.0005673609],"domain_scores_gemma":[0.9983259,0.00071778445,0.00010144453,0.00038214753,0.00022750616,0.00024520524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016324481,0.00028180526,0.00031948742,0.0003817578,0.00024321614,0.00039200688,0.00084655505,0.0001378015,0.0000023010145],"category_scores_gemma":[0.0004562383,0.00030511845,0.00009807671,0.0012151201,0.000011877048,0.00037001132,0.00019067377,0.00024915114,0.000013362485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000575623,0.000032473465,0.000023000113,0.000013915744,0.000019883328,0.0000019626104,0.00029108292,0.9079895,0.0011141083,0.0011991442,0.00029280185,0.089016385],"study_design_scores_gemma":[0.0003284926,0.00009877451,0.00006552292,0.000089524816,0.000007832019,0.0000081437975,0.000003693306,0.99337137,0.003768538,0.00047931945,0.0014180759,0.00036074355],"about_ca_topic_score_codex":0.00003399263,"about_ca_topic_score_gemma":7.8207376e-7,"teacher_disagreement_score":0.2674584,"about_ca_system_score_codex":0.00015999106,"about_ca_system_score_gemma":0.000039822316,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W2050103724","doi":"10.1109/dsn.2012.6263959","title":"BLOCKWATCH: Leveraging similarity in parallel programs for error detection","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Leverage (statistics); Overhead (engineering); Software; Error detection and correction; Parallel computing; Multithreading; Similarity (geometry); Thread (computing); Programming language; Algorithm; Artificial intelligence","score_opus":0.05688332873098964,"score_gpt":0.29576869377495024,"score_spread":0.2388853650439606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050103724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008405714,0.000056172023,0.9886361,0.00038087092,0.00018094853,0.0003617419,1.3268377e-7,0.00071213586,0.0012661908],"genre_scores_gemma":[0.60339785,0.0000021690785,0.39623585,0.0001411663,0.00003705191,0.000057424295,0.0000012518531,0.0000045496618,0.00012267723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990588,0.000044293185,0.00019354126,0.00022072361,0.000112056245,0.00037062925],"domain_scores_gemma":[0.99952257,0.000050798695,0.000054634333,0.0002472838,0.000052452902,0.00007228532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054616656,0.000104168656,0.000114887254,0.000102473765,0.00009893952,0.0000827293,0.000324988,0.00006695302,0.0000025318714],"category_scores_gemma":[0.000033465287,0.000096732496,0.00005139711,0.0002882252,0.000013292301,0.0004372843,0.00010531001,0.00009496188,0.0000050563685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004826135,0.0011979967,0.05438845,0.000094554074,0.000034950328,0.0000028973957,0.004867417,0.020949125,0.00054355664,0.029222235,0.0031809087,0.8854697],"study_design_scores_gemma":[0.00039043574,0.000062227395,0.003922146,0.000014105196,0.000002420839,0.000007390868,0.000024959016,0.9842588,0.0033912887,0.0031128773,0.0045817294,0.00023165034],"about_ca_topic_score_codex":0.000048480415,"about_ca_topic_score_gemma":0.000023059793,"teacher_disagreement_score":0.96330965,"about_ca_system_score_codex":0.000045499364,"about_ca_system_score_gemma":0.000016700285,"threshold_uncertainty_score":0.3944637},"labels":[],"label_agreement":null},{"id":"W2050229180","doi":"10.1115/imece2010-40232","title":"Thermal-Aware Power Migration in Many-Core Processors","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Multi-core processor; Workload; Power demand; Junction temperature; Many core; Chip; Computer science; Drop (telecommunication); Core (optical fiber); Reliability (semiconductor); Power (physics); Single-core; Thermal; Embedded system; Parallel computing; Power consumption; Telecommunications; Physics; Operating system","score_opus":0.012491903558406299,"score_gpt":0.25804273269809286,"score_spread":0.24555082913968657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050229180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26243767,0.000006357796,0.72427285,0.00091576274,0.00013143233,0.000102194776,1.4955877e-7,0.00055160595,0.011581962],"genre_scores_gemma":[0.8822802,0.0000023391558,0.11673647,0.000313329,0.000014551668,0.000009408232,0.0000012782508,0.000004369191,0.00063810765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999379,0.000013207775,0.0001391043,0.00021331773,0.000114760536,0.00014064813],"domain_scores_gemma":[0.9995565,0.000020637191,0.000043668166,0.0002789915,0.000065827866,0.00003437502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017554838,0.00007772295,0.000070260496,0.000110822504,0.000045138866,0.000085876745,0.00047668556,0.00006456711,0.000043964636],"category_scores_gemma":[0.00002275864,0.0000646301,0.00002090309,0.00029321923,0.000015379295,0.0002964921,0.00008278421,0.00014951058,0.00002850875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002900878,0.00094466447,0.10639028,0.00007651608,0.000025862344,0.00007258134,0.015069128,0.039486174,0.031454388,0.6945599,0.030550567,0.08134096],"study_design_scores_gemma":[0.00018763299,0.000044115564,0.01604632,0.000013629826,6.605407e-7,0.000005297602,0.00002261667,0.9680715,0.010119226,0.0029162022,0.0023452432,0.00022752033],"about_ca_topic_score_codex":0.000037846108,"about_ca_topic_score_gemma":0.000094573246,"teacher_disagreement_score":0.92858535,"about_ca_system_score_codex":0.000008189732,"about_ca_system_score_gemma":0.000032750355,"threshold_uncertainty_score":0.2635539},"labels":[],"label_agreement":null},{"id":"W2050388183","doi":"10.1007/s10009-014-0326-1","title":"On piggyback runtime monitoring of object-oriented programs","year":2014,"lang":"en","type":"article","venue":"International Journal on Software Tools for Technology Transfer","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; State (computer science); Object (grammar); Process (computing); Task (project management); Overhead (engineering); Code (set theory); Programming language; Theory of computation; Sequence (biology); Distributed computing; Operating system; Set (abstract data type); Artificial intelligence","score_opus":0.01863011222700764,"score_gpt":0.27914662900727993,"score_spread":0.2605165167802723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050388183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07445711,0.000022313296,0.92238134,0.0010277105,0.0009936328,0.00019830448,0.0000048276347,0.0007259834,0.00018875152],"genre_scores_gemma":[0.73174536,0.000026712354,0.26782852,0.00015602348,0.00011768665,0.000034169076,0.0000054126517,0.000017388758,0.00006871774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846095,0.000041966556,0.0004574678,0.00030870945,0.0004706919,0.00026022055],"domain_scores_gemma":[0.9985701,0.00027720953,0.00012478181,0.00031379567,0.00065471797,0.000059433536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760948,0.00018540715,0.00024408994,0.00060176797,0.000124559,0.00015359482,0.0014614336,0.00019276998,0.000006199301],"category_scores_gemma":[0.00044519795,0.0001643225,0.00018242444,0.0003152849,0.0000803331,0.00031844547,0.000058085945,0.00038569488,0.000012292605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019831443,0.0005387139,0.0046576606,0.000014271096,0.00022470766,0.00001607542,0.00014265862,0.0043255137,0.00056337606,0.36018926,0.00039519698,0.62873423],"study_design_scores_gemma":[0.016115306,0.020700332,0.0065484936,0.003794731,0.00013440268,0.0010319529,0.00012973156,0.068120085,0.46728927,0.2954797,0.11766593,0.0029900668],"about_ca_topic_score_codex":7.548536e-7,"about_ca_topic_score_gemma":1.9855902e-7,"teacher_disagreement_score":0.65728825,"about_ca_system_score_codex":0.00007949202,"about_ca_system_score_gemma":0.00004482971,"threshold_uncertainty_score":0.6700877},"labels":[],"label_agreement":null},{"id":"W2050419810","doi":"10.1145/2541228.2541233","title":"The design and implementation of heterogeneous multicore systems for energy-efficient speculative thread execution","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; Semiconductor Research Corporation; International Business Machines Corporation; National Science Foundation","keywords":"Computer science; Uniprocessor system; Multi-core processor; Thread (computing); Parallel computing; Context switch; Efficient energy use; Spec#; Energy consumption; Speculative multithreading; Exploit; Embedded system; Simultaneous multithreading; Multithreading; Instruction set; Microarchitecture; Control reconfiguration; Multiprocessing; Operating system","score_opus":0.015645659846109647,"score_gpt":0.2602533367090387,"score_spread":0.24460767686292906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050419810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001140209,0.0002610664,0.9970756,0.0005496408,0.000073769654,0.00078049465,0.0000088149545,0.00009986948,0.000010491417],"genre_scores_gemma":[0.5483377,0.00035953082,0.45100042,0.00004899658,0.000009422854,0.0002041208,0.000007472884,0.000009301106,0.00002305994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912566,0.000111329995,0.00023826434,0.00025154615,0.00012774227,0.00014543362],"domain_scores_gemma":[0.99905914,0.00032934357,0.00013513879,0.00027910864,0.00015167275,0.00004558007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015513164,0.00012864145,0.000117598145,0.00010564951,0.00039932513,0.00014665931,0.00019959598,0.000052268973,0.0000020451278],"category_scores_gemma":[0.000012797499,0.00009503698,0.00003693319,0.0001584643,0.0000570245,0.0000923938,0.000013648953,0.00005653921,1.9871824e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001399442,0.000020175681,0.0000026206399,0.0000085798765,0.000018936733,7.3534416e-8,0.0004314681,0.92692673,0.00006937826,0.0019460889,0.000015116238,0.07054681],"study_design_scores_gemma":[0.00031648378,0.0002101823,0.00004126902,0.000019417841,0.000015549034,0.00001094865,0.00007954689,0.99291074,0.003776714,0.0024409334,0.00007563077,0.000102584105],"about_ca_topic_score_codex":0.00006295735,"about_ca_topic_score_gemma":0.000010286775,"teacher_disagreement_score":0.54719746,"about_ca_system_score_codex":0.000020129124,"about_ca_system_score_gemma":0.000021439424,"threshold_uncertainty_score":0.38754955},"labels":[],"label_agreement":null},{"id":"W2050432237","doi":"10.1109/mm.2004.1","title":"A multilevel computing architecture for embedded multimedia applications","year":2004,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture; Architecture; Compiler; Dataflow architecture; Exploit; Synchronizing; Space-based architecture; Reference architecture; Parallel computing; Programming language; Dataflow; Software architecture; Software","score_opus":0.017767866733695743,"score_gpt":0.282713120694547,"score_spread":0.2649452539608513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050432237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001287526,0.000059294456,0.9961594,0.0006848043,0.00014806814,0.00058983057,0.000009247227,0.0008008244,0.0002610461],"genre_scores_gemma":[0.1281166,0.000003337803,0.8707524,0.00084712764,0.00009437112,0.00007113398,0.000008619234,0.000013384366,0.0000930149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990412,0.000026152335,0.00021087428,0.00036887973,0.00009793385,0.0002549715],"domain_scores_gemma":[0.9991783,0.00014511608,0.00009939956,0.00039401508,0.00011205888,0.00007113293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019207582,0.00014001748,0.00014045555,0.00010785296,0.00018667184,0.000107129155,0.0006558999,0.000067925335,8.1108755e-7],"category_scores_gemma":[0.000026155321,0.00013784137,0.00008426468,0.0001864101,0.000035157416,0.000089585075,0.00008621396,0.00013025563,0.000019482515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016953509,0.0004610952,0.00003551628,0.00009446035,0.000059621714,0.0000059491713,0.008539838,0.5081633,0.12758952,0.020979544,0.005123189,0.32893103],"study_design_scores_gemma":[0.002238653,0.00010302356,0.00015091719,0.00009143754,0.000011571036,0.000056294368,0.000020358815,0.6678201,0.2826313,0.02643348,0.019776687,0.00066618546],"about_ca_topic_score_codex":0.00001279472,"about_ca_topic_score_gemma":0.0000036989752,"teacher_disagreement_score":0.32826483,"about_ca_system_score_codex":0.000040643456,"about_ca_system_score_gemma":0.00008504292,"threshold_uncertainty_score":0.56210077},"labels":[],"label_agreement":null},{"id":"W2051109012","doi":"10.1088/1742-6596/256/1/012002","title":"CellPilot: Seamless communication within Cell BE and heterogeneous clusters","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Node (physics); Channel (broadcasting); Process (computing); Computer architecture; Broadband; Cluster (spacecraft); Operating system; Computer network; Telecommunications; Engineering","score_opus":0.01992366227000747,"score_gpt":0.24682541993911047,"score_spread":0.226901757669103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051109012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13618754,0.0000848505,0.8612663,0.0010571416,0.00025625445,0.000063087486,0.0000012707908,0.00006884714,0.001014708],"genre_scores_gemma":[0.80151564,0.00010367987,0.19814956,0.00012907627,0.00004082065,8.678639e-7,8.162713e-7,0.0000054160964,0.000054118576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992174,0.00007448503,0.0002864685,0.00011733765,0.00018909613,0.00011521175],"domain_scores_gemma":[0.9986986,0.000055155277,0.00044252243,0.00034960898,0.00037267542,0.000081458384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028905994,0.000111615394,0.00017788765,0.000050872626,0.00014173686,0.0002803366,0.00071984786,0.000051003917,0.000002999824],"category_scores_gemma":[0.000016681453,0.000098860866,0.00004392269,0.00011246755,0.00012270694,0.00074117834,0.00020926143,0.00034017704,9.726187e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001562276,0.0006911106,0.0013851081,0.0002131275,0.000138625,0.000057046895,0.039020166,0.02038922,0.11998289,0.6658558,0.0022615883,0.14984904],"study_design_scores_gemma":[0.0006047595,0.00053326477,0.0002399024,0.000092625254,0.00002346334,0.0002541957,0.00025647372,0.07511273,0.83816415,0.08286373,0.0014189954,0.0004357206],"about_ca_topic_score_codex":0.0000066475272,"about_ca_topic_score_gemma":0.0000109093,"teacher_disagreement_score":0.71818125,"about_ca_system_score_codex":0.000008543576,"about_ca_system_score_gemma":0.00011389419,"threshold_uncertainty_score":0.4031429},"labels":[],"label_agreement":null},{"id":"W2051112938","doi":"10.1109/icpads.2013.46","title":"Cost Minimization for Scheduling Parallel, Single-Threaded, Heterogeneous, Speed-Scalable Processors","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Computation; Schedule; Minification; Parallel computing; Distributed computing; Response time; Task (project management); Mathematical optimization; Algorithm","score_opus":0.06971284231747757,"score_gpt":0.29290124570008036,"score_spread":0.2231884033826028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051112938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030067393,0.0001956149,0.9903783,0.0024300471,0.00054189836,0.0011931112,0.00009114969,0.00040647664,0.0017566439],"genre_scores_gemma":[0.9350634,0.00017332225,0.062411394,0.00025823535,0.00014526966,0.0004247864,0.0005522441,0.000021317986,0.0009500137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978616,0.00008040571,0.00057998876,0.00066036626,0.00040654832,0.0004110755],"domain_scores_gemma":[0.9980369,0.00011644108,0.000355987,0.00035098827,0.0009353339,0.00020435643],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021370035,0.00031605733,0.0003344067,0.00017056435,0.00023711534,0.0011752597,0.0008385541,0.00015503606,0.000051377832],"category_scores_gemma":[0.00010000277,0.0002875345,0.00008020172,0.0001899407,0.00007059208,0.0006814194,0.0001496701,0.00013974612,0.00008532536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000780994,0.00032195353,0.0006331536,0.000098495344,0.000121138975,0.0000045775346,0.00022677085,0.82676095,0.00039559545,0.1508433,0.018059196,0.00245675],"study_design_scores_gemma":[0.0007727236,0.00017054424,0.00009331956,0.00014018042,0.000007234452,0.000029886967,0.00009115169,0.98992056,0.00012098937,0.0036763786,0.0046206447,0.00035638714],"about_ca_topic_score_codex":0.0001522022,"about_ca_topic_score_gemma":0.00000571625,"teacher_disagreement_score":0.93205667,"about_ca_system_score_codex":0.00009220456,"about_ca_system_score_gemma":0.00007427558,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W2051427249","doi":"10.1002/cpe.729","title":"Implementation of the EARTH programming model on SMP clusters: a multi‐threaded language and runtime system","year":2003,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Université du Québec à Montréal","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; POSIX Threads; Software portability; Runtime system; Parallel computing; Programming paradigm; Scheduling (production processes); Synchronization (alternating current); Distributed computing; Operating system; Programming language; Thread (computing); Computer network","score_opus":0.027611399581877184,"score_gpt":0.34294523777026137,"score_spread":0.3153338381883842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051427249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19633548,0.0004724855,0.80245614,0.00012538744,0.0000737512,0.0002358648,9.622995e-7,0.000075897115,0.0002240486],"genre_scores_gemma":[0.9126905,0.00004641256,0.08708436,0.0001370227,0.000004548608,0.000021233065,9.283099e-7,0.0000032671107,0.000011693376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910307,0.00015360425,0.00021476661,0.0002634469,0.0001458018,0.0001192905],"domain_scores_gemma":[0.9993735,0.00013913785,0.00021634129,0.00013745323,0.00008816809,0.000045374836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025867904,0.0001025882,0.0001088333,0.000047568294,0.00022790863,0.00014101868,0.000118424534,0.00003262709,5.166416e-7],"category_scores_gemma":[0.000076548815,0.000081621285,0.00001637353,0.00017483914,0.000078742414,0.00056083966,0.00007831807,0.00008151509,3.8229484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040123014,0.00024930362,0.0027038218,0.00029029493,0.0000481444,0.000008678455,0.20537649,0.013148611,0.0008412478,0.16367616,0.00007367114,0.61354345],"study_design_scores_gemma":[0.00067069003,0.0001393181,0.0006489112,0.000096166754,0.000014051402,0.000058913396,0.01717138,0.9775326,0.003158931,0.00012908647,0.00021049228,0.00016946197],"about_ca_topic_score_codex":0.000036355737,"about_ca_topic_score_gemma":0.0000022110078,"teacher_disagreement_score":0.96438396,"about_ca_system_score_codex":0.000008102099,"about_ca_system_score_gemma":0.000041506053,"threshold_uncertainty_score":0.33284193},"labels":[],"label_agreement":null},{"id":"W2052113320","doi":"10.1109/asap.2014.6868644","title":"A case against small data types in GPGPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Menzies School of Health Research; University of Victoria","keywords":"Computer science; Stencil; Cache; Parallel computing; Latency (audio); Cache pollution; Data access; Distributed computing; CPU cache; Cache algorithms; Database; Computational science","score_opus":0.06468676438864937,"score_gpt":0.2754711283403823,"score_spread":0.21078436395173292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052113320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006296554,0.000021591908,0.9669247,0.00028882097,0.00006727633,0.000049519705,5.2173993e-7,0.00041975942,0.02593122],"genre_scores_gemma":[0.5353721,0.0000069117195,0.46372223,0.0006029984,0.00002037794,0.0000015579799,0.000004357887,0.0000030986337,0.00026641035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993372,0.000061756284,0.000127993,0.00028209473,0.00005770521,0.00013327911],"domain_scores_gemma":[0.9989395,0.00006668572,0.000029621695,0.0009012664,0.000024317467,0.00003860238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041788194,0.000062935505,0.00007975437,0.00008361016,0.000039865947,0.00008590781,0.00097048545,0.000031698146,0.0000036379563],"category_scores_gemma":[0.00007960567,0.000054908633,0.000010022224,0.00022275474,0.00001140272,0.00017549614,0.0005772954,0.00006430229,0.000027694761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006286619,0.0002612821,0.0028356705,0.00003156465,0.000017270484,0.0013453116,0.0008207997,0.032204952,0.000103236904,0.179972,0.024776986,0.7576246],"study_design_scores_gemma":[0.000103013335,0.00001539117,0.00005520811,0.000006566253,5.2064115e-7,0.00011760821,0.0000023592881,0.9931592,0.00014915594,0.00087503163,0.0054274946,0.00008850309],"about_ca_topic_score_codex":0.0001005694,"about_ca_topic_score_gemma":0.00012517114,"teacher_disagreement_score":0.9609542,"about_ca_system_score_codex":0.000008967584,"about_ca_system_score_gemma":0.000020055659,"threshold_uncertainty_score":0.2239109},"labels":[],"label_agreement":null},{"id":"W2052129173","doi":"","title":"A high-performance simd floating point unit for bluegene/l: Architecture, compilation, and algorithm design","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Parallel computing; PowerPC; Compiler; SIMD; Memory bandwidth; Floating point; Computer architecture; Software; Algorithm; Programming language","score_opus":0.022586796320068683,"score_gpt":0.24634222608783743,"score_spread":0.22375542976776874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052129173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002289221,0.000045158475,0.99580455,0.00047357628,0.000072035764,0.0003547223,0.0000030030687,0.000685472,0.0002722731],"genre_scores_gemma":[0.16122393,0.000019321138,0.8382372,0.00039297558,0.00004316854,0.000014693489,0.0000071734685,0.0000093452945,0.000052161275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907196,0.00003746073,0.00022792302,0.0003044845,0.00013188281,0.00022630366],"domain_scores_gemma":[0.9993402,0.0001290509,0.00008364818,0.0002514271,0.00012695517,0.00006871696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003645254,0.00013871788,0.00014168456,0.00012149776,0.00026618663,0.00013620035,0.00033025825,0.000049473612,0.0000015449806],"category_scores_gemma":[0.000030096086,0.00012309673,0.000024086874,0.00026313233,0.00003420258,0.00023809163,0.00011562033,0.00007993385,0.000003157805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054513207,0.000028838671,0.000045659006,0.00001567656,0.000010280425,6.363605e-7,0.00036157767,0.86000806,0.00019995542,0.026403528,0.00022267093,0.112697676],"study_design_scores_gemma":[0.0005821496,0.00023031444,0.00034743574,0.000030639927,0.0000033865722,0.000016989083,0.0000053868284,0.93350357,0.031316966,0.033571616,0.00019399954,0.00019754084],"about_ca_topic_score_codex":0.00002292998,"about_ca_topic_score_gemma":0.0000015936732,"teacher_disagreement_score":0.15893471,"about_ca_system_score_codex":0.000023271426,"about_ca_system_score_gemma":0.000059489495,"threshold_uncertainty_score":0.5019739},"labels":[],"label_agreement":null},{"id":"W2053962247","doi":"10.1145/1508128.1508178","title":"Soft vector processors vs FPGA custom hardware","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datapath; Computer science; Field-programmable gate array; Scalability; Embedded system; Computer hardware; Pipeline (software); Parallel computing; Operating system","score_opus":0.013662797206490409,"score_gpt":0.25595906416142183,"score_spread":0.24229626695493142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053962247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004553891,0.000054989905,0.9745298,0.003115551,0.00008602131,0.00009529108,3.0295075e-7,0.0020733436,0.019589303],"genre_scores_gemma":[0.65417296,0.000010501545,0.33952343,0.0024282257,0.00005924195,0.0000049191867,0.0000018485164,0.0000055926953,0.0037933087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.000024951356,0.00015762754,0.0003041534,0.00019101064,0.0002251304],"domain_scores_gemma":[0.9993671,0.000024393148,0.000054893968,0.00036394125,0.00011053769,0.000079122976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013184139,0.00011498337,0.0001215106,0.00008556731,0.0001169193,0.00016855425,0.0007620529,0.00005462947,0.00002616086],"category_scores_gemma":[0.00004140721,0.00009786385,0.000044830576,0.00036651082,0.0000139586655,0.00032043626,0.00007899938,0.00009150832,0.000083339204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003257928,0.00051642366,0.0007169134,0.000047132762,0.000029938725,0.00005007187,0.0021881463,0.026398381,0.0004434622,0.20312907,0.32385442,0.4425935],"study_design_scores_gemma":[0.0005109272,0.00050805014,0.0050414545,0.000064924294,0.000006509862,0.00003621663,0.000014000096,0.88554424,0.027147073,0.015775222,0.064548135,0.00080326176],"about_ca_topic_score_codex":0.000005479116,"about_ca_topic_score_gemma":8.53131e-7,"teacher_disagreement_score":0.8591458,"about_ca_system_score_codex":0.000021932387,"about_ca_system_score_gemma":0.00005372566,"threshold_uncertainty_score":0.3990772},"labels":[],"label_agreement":null},{"id":"W2054951389","doi":"10.1109/fpt.2014.7082748","title":"Comparing performance, productivity and scalability of the TILT overlay processor to OpenCL HLS","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Field-programmable gate array; Overlay; Compiler; Throughput; Embedded system; Parallel computing; High-level synthesis; Computer architecture; Computer hardware; Operating system","score_opus":0.016689239599542684,"score_gpt":0.24253211027810306,"score_spread":0.22584287067856038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054951389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5553477,0.0000042373526,0.43593374,0.0005138591,0.00004678233,0.00018367117,8.827556e-8,0.00011338065,0.007856586],"genre_scores_gemma":[0.92841285,9.130165e-7,0.07115606,0.00010407571,0.000014098687,0.000006970905,7.1428275e-8,0.000002439556,0.0003025207],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999238,0.00006372797,0.00015310472,0.00026955316,0.00015467327,0.00012090838],"domain_scores_gemma":[0.9992469,0.000039228824,0.000065357584,0.0004987652,0.00010777888,0.000041973646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066224945,0.000073228686,0.00013419853,0.000034533987,0.00011683853,0.000058228397,0.0006008236,0.000021103157,0.0000017098823],"category_scores_gemma":[0.00012615808,0.000047205518,0.000017874743,0.0003220925,0.00004782018,0.00023876182,0.0005806359,0.00006350026,0.000002064337],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027158418,0.00032446548,0.80998504,0.00035014184,0.00001693605,8.790749e-8,0.0020171434,0.032701466,0.0023636045,0.033369817,0.003925357,0.11491878],"study_design_scores_gemma":[0.00010503627,0.00007480602,0.34596574,0.00003799717,0.0000018595704,0.000002747388,0.0000023668022,0.5984783,0.053255532,0.0006893062,0.001268504,0.00011774402],"about_ca_topic_score_codex":0.000022275859,"about_ca_topic_score_gemma":0.000008193265,"teacher_disagreement_score":0.5657769,"about_ca_system_score_codex":0.000010850385,"about_ca_system_score_gemma":0.000026042699,"threshold_uncertainty_score":0.19249852},"labels":[],"label_agreement":null},{"id":"W2055077640","doi":"10.1145/1923947.1924022","title":"Developing scalable Java applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Java; Computer science; Scalability; Programming language; Operating system; Computer architecture","score_opus":0.017273335731764414,"score_gpt":0.2744293462971069,"score_spread":0.2571560105653425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055077640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019786278,0.0000061679702,0.94748485,0.0011664906,0.000078160985,0.00008447059,8.175866e-8,0.0009755114,0.050006412],"genre_scores_gemma":[0.0853795,0.0000038540393,0.9129037,0.0004893184,0.000033535176,0.000027534457,8.6084015e-7,0.0000029823623,0.0011586747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952495,0.0000077753975,0.000098334494,0.00017339157,0.00007689161,0.00011866533],"domain_scores_gemma":[0.99948263,0.00002811978,0.000027273833,0.0003505736,0.00007185175,0.000039535407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013482434,0.00005071189,0.000048169444,0.000054170236,0.00012968261,0.0001092727,0.0005696507,0.000036403108,0.000021124772],"category_scores_gemma":[0.000011707281,0.00004567749,0.000016355298,0.0002851175,0.000016262262,0.00016203278,0.00014337813,0.00009033767,0.000119171375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.402117e-8,0.000008412229,0.00014983647,0.000001454561,0.0000012028083,1.7614035e-7,0.000017677587,0.00008908977,0.00047600947,0.9700563,0.002123138,0.027076619],"study_design_scores_gemma":[0.00014507628,0.000014789884,0.00096548104,0.0000067323817,0.0000015827583,0.000025160954,0.0000048928987,0.39304247,0.043657977,0.08544153,0.47631603,0.00037826446],"about_ca_topic_score_codex":0.000009874404,"about_ca_topic_score_gemma":0.0000047656576,"teacher_disagreement_score":0.88461477,"about_ca_system_score_codex":0.0000074797767,"about_ca_system_score_gemma":0.00006301201,"threshold_uncertainty_score":0.18626739},"labels":[],"label_agreement":null},{"id":"W2055098550","doi":"10.1145/2430536.2430538","title":"Views","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Computing and Communication Foundations","keywords":"Computer science; Concurrency; Programming language; Compiler; Debugging; Distributed computing","score_opus":0.08723794299725363,"score_gpt":0.3124842067430095,"score_spread":0.22524626374575585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055098550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013670071,0.00014754264,0.99666834,0.00035777807,0.00027522558,0.00009906063,5.343601e-7,0.0010561221,0.000028387287],"genre_scores_gemma":[0.017838197,0.000088173576,0.9814885,0.00029204928,0.000016875389,0.000053161166,5.321209e-7,0.000009642838,0.00021285417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992627,0.000108375025,0.00014351886,0.00024392486,0.00006032991,0.00018118379],"domain_scores_gemma":[0.998614,0.0008027624,0.000025835092,0.00043944866,0.000040420688,0.00007751895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030110378,0.00011484713,0.00015956175,0.00015466817,0.000084974046,0.00004608794,0.00035155605,0.00008386768,0.000023038532],"category_scores_gemma":[0.0002986062,0.0001074523,0.00004232034,0.00018832409,0.000017709117,0.0001563485,0.000016500406,0.00017487495,0.000027232601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030667313,0.000053413216,0.000065255655,0.000035419074,0.000045944616,0.000003448207,0.00062238413,0.11154244,0.0007720319,0.0044894563,0.00075610686,0.88161105],"study_design_scores_gemma":[0.0015811287,0.001098037,0.008995376,0.00018918845,0.00006552847,0.00055458804,0.000064496984,0.83609986,0.041504424,0.030566052,0.07713283,0.0021484667],"about_ca_topic_score_codex":0.000020049947,"about_ca_topic_score_gemma":4.1079485e-7,"teacher_disagreement_score":0.87946254,"about_ca_system_score_codex":0.000011485405,"about_ca_system_score_gemma":0.000010526854,"threshold_uncertainty_score":0.43817776},"labels":[],"label_agreement":null},{"id":"W2055200990","doi":"10.5555/2523721.2523775","title":"Do inputs matter?: using data-dependence profiling to evaluate thread level speculation in BG/Q","year":2013,"lang":"en","type":"article","venue":"International Conference on Parallel Architectures and Compilation Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Speculative multithreading; Parallel computing; Computer science; Speedup; Thread (computing); Profiling (computer programming); Speculative execution; Cache; Speculation; Overhead (engineering); Spec#; Multithreading; Algorithm; Operating system; Programming language","score_opus":0.1236446365299072,"score_gpt":0.36533135360697594,"score_spread":0.24168671707706874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055200990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05426901,0.00002272994,0.93680483,0.0029944468,0.00010598973,0.00076016475,0.000025434965,0.0003685761,0.004648835],"genre_scores_gemma":[0.6102225,0.00001696507,0.38890424,0.00065010355,0.000041548214,0.000058417856,0.000046051508,0.000010640278,0.000049499708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768907,0.00014880334,0.0005163079,0.0008073058,0.00055626634,0.00028224362],"domain_scores_gemma":[0.9985864,0.0000831841,0.00021246534,0.0006985686,0.00031132973,0.000108037915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047804794,0.00027673735,0.00024157419,0.0007442162,0.00012943782,0.00069499126,0.0014519636,0.00010115376,0.000094562834],"category_scores_gemma":[0.00006175477,0.00025684893,0.000036741432,0.00034305014,0.00005170865,0.0005361527,0.00076148956,0.0002791323,0.00004125256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022026322,0.00047096665,0.066447504,0.00007411318,0.00011154613,0.000025586276,0.0023162162,0.23174322,0.021045068,0.38594863,0.0017927662,0.28980413],"study_design_scores_gemma":[0.00022775453,0.00009974324,0.031413883,0.0002143547,0.0000034432774,0.000027505148,0.0000138326695,0.86804026,0.0032635408,0.09617113,0.0001367683,0.00038779248],"about_ca_topic_score_codex":0.00021275092,"about_ca_topic_score_gemma":0.00002213545,"teacher_disagreement_score":0.63629705,"about_ca_system_score_codex":0.00008436936,"about_ca_system_score_gemma":0.0000716881,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W2055534506","doi":"10.1109/hpcs.2006.48","title":"Toward a Software Infrastructure for the Cyclops-64 Cellular Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Manitoba","keywords":"Cyclops; Computer science; Software; Architecture; Software architecture; Computer architecture; Operating system; Geology; Geography; Oceanography","score_opus":0.009282512787451376,"score_gpt":0.21987870127112552,"score_spread":0.21059618848367415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055534506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020757137,0.00020488986,0.99430627,0.0021711325,0.00016792388,0.0002892804,0.0000026384205,0.0009658377,0.001684443],"genre_scores_gemma":[0.13644838,0.000005147154,0.86141074,0.00077961426,0.00018211495,0.000033732777,0.0000072209264,0.000010553446,0.0011224737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991224,0.000028079525,0.00016801992,0.0002816619,0.0001604819,0.00023940009],"domain_scores_gemma":[0.99915665,0.00019678586,0.00006517855,0.0004646754,0.00008393649,0.000032756758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014959944,0.00013784801,0.00011223712,0.000057702997,0.00022311087,0.00018366224,0.0009752034,0.0000731833,0.000013384099],"category_scores_gemma":[0.000038306,0.00008458526,0.00009430359,0.00024289372,0.000036863104,0.00008444499,0.00017914888,0.00012791393,0.0000044895924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013447962,0.00005284457,0.0006636453,0.000047238223,0.000035393714,0.0000073856654,0.0006933737,0.47523412,0.0004217954,0.18824081,0.19273125,0.1418587],"study_design_scores_gemma":[0.00050834613,0.00010040321,0.0018244744,0.000018551942,0.000014623453,0.00003497145,0.000016235224,0.54665905,0.0106336195,0.20772278,0.23198205,0.0004848925],"about_ca_topic_score_codex":0.00003727734,"about_ca_topic_score_gemma":0.000004517382,"teacher_disagreement_score":0.14137381,"about_ca_system_score_codex":0.000017581575,"about_ca_system_score_gemma":0.000042837753,"threshold_uncertainty_score":0.3449287},"labels":[],"label_agreement":null},{"id":"W2055648319","doi":"10.1109/icpads.2012.70","title":"An Efficient MPI Message Queue Mechanism for Large-scale Jobs","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Innovation Trust","keywords":"Computer science; Scalability; Queue; Message queue; Parallel computing; Memory footprint; Message Passing Interface; Overhead (engineering); Tree traversal; Node (physics); Distributed computing; Message passing; Computer network; Operating system; Algorithm","score_opus":0.015633206916645884,"score_gpt":0.27831903051935625,"score_spread":0.26268582360271037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055648319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032769588,0.000034167115,0.99054193,0.0002614421,0.00031256734,0.00024007035,0.0000028766558,0.0011159605,0.0042139995],"genre_scores_gemma":[0.4840023,0.0000022286547,0.5149543,0.0005561766,0.00006297314,0.000024238963,0.0000032838152,0.000007430559,0.0003870727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988933,0.00005650667,0.00017504233,0.00027057502,0.00016764826,0.0004369092],"domain_scores_gemma":[0.99909776,0.00004912515,0.000059723177,0.000516039,0.000114333016,0.00016302262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066017295,0.000120444,0.00012744778,0.00008020234,0.00019565497,0.000111793255,0.00063484727,0.00007108831,0.000020389314],"category_scores_gemma":[0.000020523556,0.00010349327,0.00006233693,0.00017790089,0.000008534699,0.00029857628,0.00013722613,0.00006123509,0.000025048794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023174455,0.00026252313,0.00012384444,0.000007129516,0.0000048738375,2.9441998e-7,0.00086753396,0.0028581426,0.00038908317,0.991607,0.0027211322,0.0011561417],"study_design_scores_gemma":[0.00021016916,0.00007572355,0.00014533993,0.000005505277,0.0000032894427,0.000003899683,0.000034710876,0.96883994,0.024090301,0.00401413,0.0023933172,0.00018366352],"about_ca_topic_score_codex":0.000009308969,"about_ca_topic_score_gemma":0.0000033377642,"teacher_disagreement_score":0.9875929,"about_ca_system_score_codex":0.000025263367,"about_ca_system_score_gemma":0.000022665436,"threshold_uncertainty_score":0.4220333},"labels":[],"label_agreement":null},{"id":"W2055897498","doi":"10.1145/2304576.2304615","title":"Locality &amp; utility co-optimization for practical capacity management of shared last level caches","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Leukemia and Lymphoma Society of Canada; University of Nebraska-Lincoln; National Science Foundation","keywords":"Locality; Computer science; Cache; Overhead (engineering); CPU cache; Locality of reference; Parallel computing; False sharing; Distributed computing; Bridging (networking); Cache algorithms; Computer network; Operating system","score_opus":0.18300453486532103,"score_gpt":0.3583982554487268,"score_spread":0.17539372058340574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055897498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008947892,0.000013209338,0.9932122,0.00035961138,0.0000924665,0.00034415317,0.000017408562,0.00031434014,0.0047518252],"genre_scores_gemma":[0.32550582,0.000005268128,0.67420346,0.000076253345,0.000017593047,0.000018595018,0.00001919209,0.0000042589813,0.00014955061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988254,0.00009681657,0.00031616096,0.00025997998,0.00022794299,0.00027373998],"domain_scores_gemma":[0.9989573,0.00013738737,0.00015127983,0.0004780529,0.00017365853,0.00010235034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619428,0.00012045782,0.000169711,0.000054931723,0.00010449398,0.00005396474,0.00032555667,0.000074404365,0.00005544331],"category_scores_gemma":[0.000083802006,0.00011049543,0.000069196685,0.00019725648,0.000059781964,0.000572242,0.00016051608,0.00006936761,0.0000075933795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015182848,0.0036453817,0.031092005,0.0011784772,0.00036793525,0.0000015334165,0.0029299844,0.10690035,0.00010666785,0.73240125,0.08754565,0.033678956],"study_design_scores_gemma":[0.00041514295,0.00004444656,0.0092680175,0.0000283969,0.000021373127,0.0000053141803,0.00003843552,0.979644,0.0030515261,0.0017502898,0.0054661543,0.00026688358],"about_ca_topic_score_codex":0.000027390375,"about_ca_topic_score_gemma":0.0000048951833,"teacher_disagreement_score":0.87274367,"about_ca_system_score_codex":0.000040252125,"about_ca_system_score_gemma":0.00003333275,"threshold_uncertainty_score":0.45058727},"labels":[],"label_agreement":null},{"id":"W2057283003","doi":"10.1016/j.compeleceng.2008.04.008","title":"Power-aware BTB for modern processors","year":2008,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Inefficiency; Control flow; Simple (philosophy); Power (physics)","score_opus":0.011268432456263062,"score_gpt":0.21918149819520805,"score_spread":0.207913065738945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057283003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019547653,0.00028510136,0.99519324,0.0001865115,0.00022074384,0.0002320843,6.333364e-7,0.0018079429,0.00011896666],"genre_scores_gemma":[0.6015275,0.000016374215,0.39810613,0.00017664192,0.00006598482,0.00003151329,0.0000026933672,0.000020428975,0.00005272626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986278,0.00001359537,0.0002495777,0.00043005554,0.00020677538,0.000472235],"domain_scores_gemma":[0.99918735,0.0001688725,0.000058755384,0.00032319844,0.000121624056,0.00014020971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110676294,0.00020621305,0.0002456599,0.00021886833,0.00016564145,0.00007439355,0.00085044466,0.00008867038,9.267362e-7],"category_scores_gemma":[0.00006116817,0.00021422823,0.000108942324,0.0006615,0.000014987027,0.00023995883,0.00013447697,0.00018107088,0.0000047604717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015000094,0.00016113454,0.00011619847,0.000065162814,0.000059119502,0.000046480764,0.0008556109,0.93291616,0.0006603734,0.019634847,0.014920048,0.030549869],"study_design_scores_gemma":[0.00024511528,0.0001396314,0.00012613398,0.000018991268,0.0000019944937,0.00006226656,1.987104e-7,0.995261,0.0014762654,0.0005153543,0.001883508,0.00026951867],"about_ca_topic_score_codex":0.0000011929759,"about_ca_topic_score_gemma":2.5552064e-8,"teacher_disagreement_score":0.5995727,"about_ca_system_score_codex":0.00007494585,"about_ca_system_score_gemma":0.00006904872,"threshold_uncertainty_score":0.8735974},"labels":[],"label_agreement":null},{"id":"W2057608154","doi":"10.1145/1056018.1056037","title":"Adding parallelism to visual data flow programs","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compiler; Debugging; Parallelism (grammar); Data parallelism; Implicit parallelism; Visual programming language; Programming paradigm; Task (project management); Shared memory; Data flow diagram; Parallel computing; Task parallelism; Database","score_opus":0.04624958948990547,"score_gpt":0.32373690774051767,"score_spread":0.2774873182506122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057608154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002719321,0.00003360179,0.98690903,0.0024743846,0.00008688136,0.00017055101,6.301748e-7,0.001521152,0.008531808],"genre_scores_gemma":[0.10572301,0.000006977297,0.89150536,0.0014875402,0.00015099913,0.000010968676,0.000023320858,0.000007042611,0.0010847723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988138,0.00003290674,0.00019172247,0.00047777506,0.00020960996,0.00027418847],"domain_scores_gemma":[0.99882156,0.000027023028,0.00003493069,0.0009273346,0.000056387504,0.00013278835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031077315,0.000111300855,0.00010936157,0.000087696695,0.0001072019,0.00028576804,0.0018910932,0.000041918945,0.000024257133],"category_scores_gemma":[0.000034757093,0.00009844657,0.000023474553,0.00035937913,0.000011272772,0.0005910675,0.0012005701,0.00007665383,0.00022345611],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020744992,0.000094691095,0.0000710688,0.0000023337477,0.000007629525,0.0000028031427,0.00024009784,0.020866206,0.000023652501,0.010409303,0.054224476,0.91405565],"study_design_scores_gemma":[0.00007553288,0.000046978257,0.000038376733,0.00001021309,0.000001074494,0.000005412867,0.000003361652,0.8705257,0.00024359609,0.00010954909,0.12879941,0.00014076396],"about_ca_topic_score_codex":0.000014130278,"about_ca_topic_score_gemma":0.000012221795,"teacher_disagreement_score":0.9139149,"about_ca_system_score_codex":0.00002193234,"about_ca_system_score_gemma":0.000032950466,"threshold_uncertainty_score":0.4014535},"labels":[],"label_agreement":null},{"id":"W2057939088","doi":"10.1109/fpl.2009.5272544","title":"Towards a viable out-of-order soft core: Copy-Free, checkpointed register renaming","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register (sociolinguistics); Field-programmable gate array; Register file; Processor register; Parallel computing; Out-of-order execution; Multi-core processor; Embedded system; Operating system; Instruction set","score_opus":0.029278923785406377,"score_gpt":0.2857535694963192,"score_spread":0.25647464571091283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057939088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002517361,0.000063784675,0.9264018,0.0015186775,0.0001759573,0.00012479031,6.829104e-7,0.0008479716,0.07061459],"genre_scores_gemma":[0.13649786,0.000016312586,0.8560326,0.0016021596,0.00004105406,0.000003932528,0.0000035336698,0.000009135891,0.005793404],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867415,0.000034830893,0.00037057564,0.00036470362,0.00027516505,0.00028058473],"domain_scores_gemma":[0.99845487,0.00004137144,0.0001675036,0.0009787129,0.0002788188,0.00007873593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003453904,0.00015972469,0.000242004,0.00013272197,0.00008353492,0.00009787983,0.0012021436,0.00008622124,0.000032474007],"category_scores_gemma":[0.00018683706,0.00013918485,0.00007462653,0.00052122574,0.000042754335,0.0002814382,0.00026656364,0.00012424991,0.000016847049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010037732,0.0009012914,0.0008348484,0.00011237668,0.00010963775,0.000061112965,0.004325756,0.014736364,0.0060792253,0.37101597,0.3985955,0.20312752],"study_design_scores_gemma":[0.00078470696,0.0003943843,0.0004143728,0.00012249559,0.000009177629,0.000017379194,0.000019551426,0.92951864,0.022859294,0.030869516,0.014502032,0.0004884413],"about_ca_topic_score_codex":0.00003867874,"about_ca_topic_score_gemma":0.0000046499317,"teacher_disagreement_score":0.9147823,"about_ca_system_score_codex":0.000031153864,"about_ca_system_score_gemma":0.000086836204,"threshold_uncertainty_score":0.5675793},"labels":[],"label_agreement":null},{"id":"W2058063214","doi":"10.1007/s00450-010-0113-5","title":"Multi-core scalability-impacting compiler optimizations","year":2010,"lang":"en","type":"article","venue":"Computer Science - Research and Development","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Compiler; Multi-core processor; Benchmark (surveying); Parallel computing; Scalability; Spec#; Suite; Throughput; Operating system; Computer architecture; Programming language","score_opus":0.12814629330216795,"score_gpt":0.39449592880541623,"score_spread":0.2663496355032483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058063214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050354082,0.00002394757,0.9476896,0.00042940275,0.00039910723,0.00027961854,4.978447e-7,0.0003925977,0.0004311714],"genre_scores_gemma":[0.31181633,0.0000076146234,0.68793386,0.00009921263,0.00004849761,0.000017683984,0.0000018326707,0.0000057456655,0.00006925201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684894,0.00006988198,0.00034754138,0.00090349047,0.0009774927,0.0008526822],"domain_scores_gemma":[0.99742776,0.0002424693,0.000069787544,0.0007581323,0.0009806169,0.0005212464],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038988986,0.00017730321,0.0001746299,0.0006877582,0.002031632,0.0012570571,0.0018247616,0.00007470159,0.000012963396],"category_scores_gemma":[0.00025125724,0.0001549459,0.000022073107,0.0018908324,0.0009962517,0.0009240869,0.0022123617,0.0006119329,0.00003872917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023050186,0.0018220408,0.03238623,0.00011083855,0.000046073048,0.00005799258,0.016148454,0.018742826,0.0134961475,0.05163449,0.006675408,0.85885644],"study_design_scores_gemma":[0.00027112436,0.00009115151,0.023555128,0.000027241305,3.5835407e-7,0.000034702305,0.000019146186,0.9680526,0.003928702,0.0007996485,0.0029584358,0.00026174722],"about_ca_topic_score_codex":0.000014334433,"about_ca_topic_score_gemma":0.0000110099245,"teacher_disagreement_score":0.94930977,"about_ca_system_score_codex":0.000086945154,"about_ca_system_score_gemma":0.0010419479,"threshold_uncertainty_score":0.99977976},"labels":[],"label_agreement":null},{"id":"W2058906553","doi":"10.1007/s11390-011-1149-0","title":"Energy Efficiency of a Multi-Core Processor by Tag Reduction","year":2011,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hangzhou Dianzi University","keywords":"Computer science; Reduction (mathematics); Multi-core processor; Parallel computing; Core (optical fiber); Heuristics; Memory hierarchy; Single-core; Processor design; Efficient energy use; Energy (signal processing); Set (abstract data type); Many core; Embedded system; Operating system; Cache; Telecommunications","score_opus":0.020164666802462042,"score_gpt":0.2512085389561881,"score_spread":0.23104387215372607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058906553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046039104,0.00043850363,0.95271516,0.00032209628,0.00025193443,0.000040629682,2.1949857e-7,0.000104194136,0.00008818804],"genre_scores_gemma":[0.6359483,0.00007332008,0.36390874,0.00003865086,0.000016498183,9.838792e-7,4.242469e-8,0.000002456367,0.000010990452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874246,0.000017409873,0.00042264946,0.00025635035,0.00034174524,0.00021938169],"domain_scores_gemma":[0.99807215,0.000014042403,0.0005370988,0.00027664803,0.0010256937,0.00007439894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070050446,0.0001051166,0.00022499957,0.0009202587,0.00013190467,0.00004381105,0.0013579444,0.00008961492,9.882102e-7],"category_scores_gemma":[0.000047689726,0.000084338724,0.000032279844,0.0019257119,0.0006227186,0.00058250024,0.00033149065,0.00014635602,3.5686736e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027254771,0.0010777633,0.0013026067,0.00004489489,0.00003993572,0.000037323298,0.002721705,0.00026285808,0.06113055,0.094181426,0.003561238,0.8356124],"study_design_scores_gemma":[0.00078890356,0.0020917647,0.00027413535,0.00012586825,0.000012037698,0.001500783,0.000053614967,0.5499245,0.424436,0.019303856,0.0011749394,0.00031361656],"about_ca_topic_score_codex":0.000007047089,"about_ca_topic_score_gemma":2.3428701e-7,"teacher_disagreement_score":0.83529884,"about_ca_system_score_codex":0.000025269615,"about_ca_system_score_gemma":0.00023413745,"threshold_uncertainty_score":0.34392336},"labels":[],"label_agreement":null},{"id":"W2059044266","doi":"10.1145/1723028.1723078","title":"Challenges for parallel computing","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Exploit; Computer science; Parallelism (grammar); Task parallelism; Commodity; Software; Node (physics); Parallel computing; Parallel processing; Data parallelism; Computer architecture; Embedded system; Operating system; Computer security","score_opus":0.048774853943261275,"score_gpt":0.30426862173706437,"score_spread":0.2554937677938031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059044266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000064359796,0.0003511884,0.9540833,0.005396454,0.00007273778,0.00015092774,9.877133e-8,0.0012455302,0.038635362],"genre_scores_gemma":[0.30578056,0.00006161383,0.6929159,0.0009402305,0.000049497783,0.0000026168373,7.847904e-7,0.000002756762,0.00024605307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992322,0.000020884747,0.00015403116,0.00028241935,0.00009475003,0.000215725],"domain_scores_gemma":[0.9994278,0.000080868165,0.000051454317,0.00031401622,0.00007473007,0.000051122828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563707,0.00009277075,0.00011475796,0.00006513765,0.00011495602,0.00008203626,0.0005674382,0.00004278976,0.000001840763],"category_scores_gemma":[0.000027556003,0.00008274056,0.000056608224,0.00010438783,0.000008143626,0.00016060063,0.000056544817,0.000045055553,0.000011641363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019644388,0.00003748973,0.0000054537322,0.000003667556,0.0000032086632,7.1039096e-7,0.00018998697,0.004151261,0.000020399697,0.62896174,0.0034482558,0.36317584],"study_design_scores_gemma":[0.00028221385,0.00020689036,0.0010692095,0.000013014437,0.0000013870688,0.00000837956,0.000009164383,0.92872727,0.000528166,0.06023065,0.008728177,0.00019550262],"about_ca_topic_score_codex":6.540786e-7,"about_ca_topic_score_gemma":3.326266e-7,"teacher_disagreement_score":0.924576,"about_ca_system_score_codex":0.000011074176,"about_ca_system_score_gemma":0.000016015265,"threshold_uncertainty_score":0.33740622},"labels":[],"label_agreement":null},{"id":"W2059059410","doi":"10.1109/reconfig.2014.7032565","title":"What limits the operating frequency of a soft processor design","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Stratix; Processor design; Clock rate; Field-programmable gate array; Throughput; Embedded system; Modularity (biology); Parallel computing; Computer architecture; Operating system","score_opus":0.031400996644561904,"score_gpt":0.2665581803462546,"score_spread":0.2351571837016927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059059410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047271923,0.00011578958,0.9948287,0.0011567365,0.00009542672,0.00013467587,3.154744e-8,0.00030849967,0.0028874394],"genre_scores_gemma":[0.4370565,0.000013758837,0.56210625,0.00055231835,0.00002061133,0.000010182399,1.5163009e-7,0.0000035501744,0.00023668628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921703,0.00013028267,0.00018876437,0.00018163006,0.00014992167,0.00013237128],"domain_scores_gemma":[0.999144,0.00023252261,0.0000870705,0.0003581423,0.0001510516,0.000027222342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006868006,0.00007669654,0.000097175645,0.000036881167,0.0001284399,0.0002626317,0.0008388531,0.00003186701,0.000005244422],"category_scores_gemma":[0.00017557597,0.000046770405,0.000026856225,0.00024857724,0.000030833064,0.00055855216,0.00009015659,0.00006447204,0.0000073798496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000391468,0.00019861766,0.0008124049,0.000084662825,0.000040735402,0.0000019278166,0.007163975,0.20151572,0.00593732,0.47885603,0.0075887325,0.29779595],"study_design_scores_gemma":[0.000067901514,0.000072278526,0.000063183536,0.000042913965,0.0000016027582,0.000003906821,0.000024400772,0.9657265,0.025416875,0.008371873,0.00012261952,0.000085958],"about_ca_topic_score_codex":0.000010329386,"about_ca_topic_score_gemma":0.0000013661726,"teacher_disagreement_score":0.76421076,"about_ca_system_score_codex":0.000005908252,"about_ca_system_score_gemma":0.000046808607,"threshold_uncertainty_score":0.25325635},"labels":[],"label_agreement":null},{"id":"W2059530893","doi":"10.1145/2166879.2166880","title":"Leveraging Core Specialization via OS Scheduling to Improve Performance on Asymmetric Multicore Systems","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Speedup; Multi-core processor; Thread (computing); Scheduling (production processes); Workload; Parallel computing; Single-core; Clock rate; Efficient energy use; Energy consumption; Distributed computing; Embedded system; Operating system","score_opus":0.038779818646449464,"score_gpt":0.2666494681676953,"score_spread":0.22786964952124583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059530893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010837048,0.00012929694,0.976136,0.00011070634,0.010486072,0.0009078265,0.0000041330795,0.0010960189,0.00029285325],"genre_scores_gemma":[0.8332344,0.000017134009,0.16512503,0.0002595218,0.001052374,0.00010584847,0.0000056515173,0.000036530826,0.00016350517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728656,0.00017093653,0.0006362088,0.00066668604,0.0006010011,0.0006386319],"domain_scores_gemma":[0.9975983,0.0002610907,0.0002362865,0.0013474632,0.00024928918,0.00030756812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066110893,0.00038030822,0.00040457112,0.0008896215,0.0005417271,0.0004770502,0.0012640894,0.00016376175,0.0000026434518],"category_scores_gemma":[0.000025353758,0.00037128208,0.00011672044,0.0014319465,0.00002023731,0.0007026809,0.000062782805,0.00033849338,0.00021192215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013916269,0.0002060971,0.0003916531,0.00009795539,0.000043062148,0.0000022703853,0.0008488452,0.92457324,0.000085627966,0.0009918017,0.00037661727,0.07236889],"study_design_scores_gemma":[0.0003733923,0.0003374887,0.00071474724,0.00031807565,0.000013017351,0.000044439606,0.000024046178,0.9946347,0.0011231019,0.0000089131945,0.0019666855,0.00044140307],"about_ca_topic_score_codex":0.000083844105,"about_ca_topic_score_gemma":5.639714e-7,"teacher_disagreement_score":0.82239735,"about_ca_system_score_codex":0.00029320814,"about_ca_system_score_gemma":0.00004538617,"threshold_uncertainty_score":0.99987394},"labels":[],"label_agreement":null},{"id":"W2059560826","doi":"10.1109/bsc.2010.5473006","title":"On Holant theorem and its proof","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Tensor (intrinsic definition); Range (aeronautics); Proof of concept; Computer science; Component (thermodynamics); Holography; Analytic proof; Mathematics; Algebra over a field; Theoretical computer science; Calculus (dental); Pure mathematics; Mathematical proof; Physics; Quantum mechanics","score_opus":0.010614805440493317,"score_gpt":0.24672064087636866,"score_spread":0.23610583543587535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059560826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036117066,0.000012543675,0.919584,0.0006903157,0.00011366987,0.00008181905,1.6307986e-7,0.0004616428,0.042938795],"genre_scores_gemma":[0.89772713,0.0000029889613,0.10117091,0.0004207676,0.000015428646,0.0000026571095,1.9684697e-7,0.0000022810275,0.00065764406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996223,0.000013450629,0.000056518504,0.0001524585,0.00007199742,0.000083264305],"domain_scores_gemma":[0.9996874,0.000042187206,0.00001905177,0.00018389898,0.000029172537,0.00003830692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015189045,0.000049167313,0.00004483159,0.00003934236,0.000055944212,0.00007378645,0.00024941636,0.000029761195,0.000012424755],"category_scores_gemma":[0.00003417703,0.000035279252,0.000009838933,0.000071784656,0.000010859191,0.000090402136,0.00009137411,0.000096173695,0.000015025766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.164292e-7,0.000014518906,0.00001830783,0.0000012344244,9.569063e-7,0.0000011031242,0.000054216525,0.000057364283,0.0007523178,0.98945457,0.0009843493,0.008660262],"study_design_scores_gemma":[0.00015041544,0.000117072705,0.0005507605,0.000008546092,8.1198965e-7,0.000022435435,0.0000013023626,0.8404055,0.081168726,0.075281434,0.0021287482,0.00016421419],"about_ca_topic_score_codex":0.0000011872482,"about_ca_topic_score_gemma":9.745918e-7,"teacher_disagreement_score":0.9141731,"about_ca_system_score_codex":0.0000016217912,"about_ca_system_score_gemma":0.0000097752145,"threshold_uncertainty_score":0.1438646},"labels":[],"label_agreement":null},{"id":"W2060118880","doi":"10.1109/imtc.2005.1604540","title":"Modeling Software Driven Power Consumption","year":2006,"lang":"en","type":"article","venue":"2005 IEEE Instrumentationand Measurement Technology Conference Proceedings","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Custom Security Industries (Canada)","funders":"","keywords":"Computer science; Software; Power consumption; Dissipation; Power (physics); Embedded system; Embedded software; Software design; Reliability engineering; Software development; Engineering; Operating system","score_opus":0.03534438453538729,"score_gpt":0.2501608303024436,"score_spread":0.21481644576705633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060118880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13792609,0.00009380054,0.8574051,0.0011451086,0.00021026908,0.00033275562,0.0000017884964,0.0018721119,0.0010129792],"genre_scores_gemma":[0.7889024,0.000045932033,0.21073285,0.00010652615,0.000027258475,0.000090810005,0.0000049466476,0.0000122282245,0.00007703601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782586,0.000011719206,0.0004684526,0.0005881253,0.00064820354,0.00045766225],"domain_scores_gemma":[0.9986003,0.0000075431567,0.00019371619,0.00022294164,0.0009089542,0.00006656594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003751703,0.00025908698,0.00022149913,0.00053567166,0.00031666338,0.00025393788,0.00077763293,0.00022122887,0.000026120564],"category_scores_gemma":[0.00004826017,0.00026871279,0.000054077285,0.00041404474,0.00011009721,0.00076389866,0.00011607456,0.00023288646,0.00004575482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597485,0.0009818997,0.10081901,0.00019854204,0.00021743933,0.000015680671,0.0011852728,0.035504635,0.093163915,0.6930381,0.019598514,0.05521102],"study_design_scores_gemma":[0.0021319746,0.00023041766,0.0013549791,0.00035644058,0.000039193415,0.000088122215,0.00018562083,0.8187764,0.075598165,0.09875915,0.0013317501,0.0011477558],"about_ca_topic_score_codex":0.000020153619,"about_ca_topic_score_gemma":0.000013932463,"teacher_disagreement_score":0.7832718,"about_ca_system_score_codex":0.0002377819,"about_ca_system_score_gemma":0.00016879383,"threshold_uncertainty_score":0.9999765},"labels":[],"label_agreement":null},{"id":"W2062257037","doi":"10.1109/icsamos.2006.300806","title":"Modified Hotspot Cache Architecture: A Low Energy Fast Cache for Embedded Processors","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cache coloring; Cache algorithms; Cache; Cache pollution; Computer science; Cache invalidation; Smart Cache; Page cache; Parallel computing; MESI protocol; Embedded system; Pipeline burst cache; CPU cache","score_opus":0.011124358855056658,"score_gpt":0.23562426132991984,"score_spread":0.22449990247486318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062257037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007653678,0.00006300299,0.9835557,0.001121792,0.00009285098,0.00019976971,0.0000024693,0.001185012,0.013014058],"genre_scores_gemma":[0.5854616,0.0000033133458,0.4093464,0.0007865522,0.00006669663,0.00008216575,0.000014507617,0.00001516223,0.0042236056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864614,0.00006322617,0.0002659523,0.00046697893,0.00020811764,0.00034958994],"domain_scores_gemma":[0.99913156,0.00012624654,0.000108551394,0.00042361752,0.00014181019,0.0000682105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024492902,0.00019885496,0.00019237514,0.00015628856,0.00014440466,0.00019388647,0.00076263846,0.000094564086,0.0000044669437],"category_scores_gemma":[0.00003713284,0.00016663368,0.000098008786,0.00039712436,0.000033858607,0.00016721014,0.00013242447,0.00009705091,0.00000268619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024490693,0.00021858886,0.000017565186,0.000042624324,0.000020002219,0.0000045563106,0.00053899497,0.64775,0.0008156509,0.2995521,0.021928433,0.029086953],"study_design_scores_gemma":[0.00045205007,0.000077630044,0.00006146819,0.000018318036,0.0000046058676,0.000012505247,0.000006794648,0.9445013,0.02189743,0.029106472,0.0035454603,0.00031599056],"about_ca_topic_score_codex":0.00022699952,"about_ca_topic_score_gemma":0.00007063361,"teacher_disagreement_score":0.58469623,"about_ca_system_score_codex":0.000028780603,"about_ca_system_score_gemma":0.00010166024,"threshold_uncertainty_score":0.6795124},"labels":[],"label_agreement":null},{"id":"W2062405277","doi":"10.1145/2508168.2508174","title":"Optimizing MATLAB feval with dynamic techniques","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MATLAB; Computer science; Solver; Function (biology); Interpreter; Argument (complex analysis); Programming language; Computer engineering; Computational science; Feature (linguistics); Algorithm","score_opus":0.007093568675823372,"score_gpt":0.23236309319471918,"score_spread":0.22526952451889581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062405277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012618677,0.00002777684,0.96246445,0.000963335,0.00002789946,0.00023184762,1.0796904e-7,0.0030177063,0.032005016],"genre_scores_gemma":[0.21524857,0.000011590736,0.78285956,0.00043740342,0.000009497489,0.000039129907,0.0000010859123,0.000009211573,0.0013839261],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.0000325101,0.00015709965,0.00030072068,0.00017810201,0.00024186938],"domain_scores_gemma":[0.99924606,0.00003065506,0.000062183644,0.00045874738,0.00013175281,0.00007059637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012246228,0.00013423721,0.00012404409,0.000118815056,0.0001094376,0.00033345466,0.0006803761,0.00005132285,0.00005998943],"category_scores_gemma":[0.0000066665853,0.00009761065,0.0000291962,0.0003032533,0.000034149125,0.0005996051,0.00019332429,0.000100998775,0.00009215338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002155538,0.00050958217,0.0011187013,0.00009695497,0.00013739271,0.000063184765,0.002189079,0.017614186,0.008864972,0.22307608,0.06522998,0.6810783],"study_design_scores_gemma":[0.00014475982,0.00017817221,0.00033031558,0.00004269872,0.0000028457869,0.000051502535,0.000020019703,0.9781143,0.015562673,0.003469472,0.0017165198,0.00036672904],"about_ca_topic_score_codex":0.00006227409,"about_ca_topic_score_gemma":0.0000026332516,"teacher_disagreement_score":0.9605001,"about_ca_system_score_codex":0.000033653127,"about_ca_system_score_gemma":0.000032807744,"threshold_uncertainty_score":0.3980447},"labels":[],"label_agreement":null},{"id":"W2062447544","doi":"10.1145/367845.368004","title":"Decompile Java class files with soot! (poster session)","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Session (web analytics); Java; Computer science; Class (philosophy); Soot; Operating system; Programming language; World Wide Web; Artificial intelligence; Chemistry","score_opus":0.010392995917964443,"score_gpt":0.24142264025216045,"score_spread":0.231029644334196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062447544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007920203,0.000026910297,0.8285624,0.0009299917,0.00004471722,0.000095985495,7.233786e-7,0.0011135916,0.16130549],"genre_scores_gemma":[0.43138948,0.00002318844,0.55011714,0.002005677,0.000045653735,0.000011777399,0.0000052671553,0.00001187202,0.01638992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990916,0.00004690119,0.00015580402,0.00030770028,0.00018034592,0.00021765102],"domain_scores_gemma":[0.99933255,0.000050786453,0.00003768803,0.00044221216,0.000056839894,0.000079913276],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009945214,0.00012278598,0.000119402626,0.00006130061,0.00013846038,0.00017202031,0.0005773155,0.000048742986,0.0010126028],"category_scores_gemma":[0.000003573626,0.0000849756,0.00003301081,0.0002546627,0.000031616648,0.0003372441,0.00008909627,0.00008740001,0.00027599753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062888066,0.00039084186,0.00427167,0.00002556887,0.000052898802,0.000067399524,0.0010599677,0.035129305,0.00011494657,0.029166555,0.31024504,0.6194129],"study_design_scores_gemma":[0.00096882373,0.00047214582,0.0052364273,0.00012818411,0.000008360154,0.00014694418,0.000022128494,0.76182467,0.010893939,0.0028204308,0.21657318,0.000904736],"about_ca_topic_score_codex":0.000016289747,"about_ca_topic_score_gemma":0.0000059862705,"teacher_disagreement_score":0.7266954,"about_ca_system_score_codex":0.000014632392,"about_ca_system_score_gemma":0.000040979285,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W2062507172","doi":"10.1155/2001/195437","title":"Parallel Programming Environment for OpenMP","year":2001,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Intel Corporation; National Science Foundation","keywords":"Computer science; Directive; Visualization; Set (abstract data type); Parallel programming model; Programming paradigm; Parallel computing; Interactive programming; Programming language; Computer architecture; Artificial intelligence","score_opus":0.030291477370156677,"score_gpt":0.2744801121986326,"score_spread":0.24418863482847594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062507172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008013774,0.0003248772,0.99515903,0.0005426713,0.0005909009,0.0011010012,0.0000010585611,0.0010462449,0.00043281683],"genre_scores_gemma":[0.039761003,0.000016695743,0.95653415,0.00007705453,0.00007509405,0.00039719886,0.000023002796,0.000018545863,0.0030972732],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99752086,0.000051985506,0.00036634188,0.00090108014,0.00041831628,0.0007414141],"domain_scores_gemma":[0.99865246,0.00006536818,0.0001633942,0.0008380759,0.000104469116,0.0001762123],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014057711,0.00020843979,0.00019372518,0.00020777628,0.0008779655,0.0016742138,0.0013808613,0.00007636504,0.000011205444],"category_scores_gemma":[0.000065662054,0.00019993713,0.00013825201,0.00067031017,0.00016494312,0.0005714543,0.0004004807,0.00011531937,0.000060700742],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007413945,0.00016085847,0.00030479892,0.000016767844,0.000013045985,0.0000085673155,0.0004140628,0.0021098782,0.00009846012,0.011104968,0.001921525,0.98383963],"study_design_scores_gemma":[0.0003479608,0.00010714154,0.000043857028,0.00002556938,0.0000065370486,0.000022952583,0.00003323319,0.10264383,0.00044522726,0.0019382886,0.89408207,0.00030332655],"about_ca_topic_score_codex":0.000009151825,"about_ca_topic_score_gemma":0.0000034803977,"teacher_disagreement_score":0.9835363,"about_ca_system_score_codex":0.00007215664,"about_ca_system_score_gemma":0.00006940724,"threshold_uncertainty_score":0.9993622},"labels":[],"label_agreement":null},{"id":"W2062972627","doi":"10.1142/s1469026806002039","title":"A MEMETIC ALGORITHM FOR PERFORMING MEMORY ASSIGNMENT IN DUAL-BANK DSPS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Memetic algorithm; Digital signal processing; Compiler; Memory bandwidth; Digital signal processor; Interleaved memory; Computer memory; Semiconductor memory; Algorithm; Computer hardware; Local search (optimization); Programming language","score_opus":0.01913398475210874,"score_gpt":0.30741256709045095,"score_spread":0.2882785823383422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062972627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007212806,0.00027415782,0.9970271,0.0011642037,0.00014947135,0.00022918159,0.0000066255757,0.00003358709,0.00039437183],"genre_scores_gemma":[0.46969378,0.000053005853,0.5296625,0.00018767593,0.00025514295,0.000057566987,0.000013494899,0.0000062385125,0.00007060946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985678,0.0000322513,0.00065267674,0.00019787993,0.00041481375,0.00013453947],"domain_scores_gemma":[0.9984037,0.0003772958,0.0003489853,0.00009717296,0.0007229509,0.00004988847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051299174,0.00011263226,0.00015457645,0.00038533699,0.00008973962,0.0001530955,0.00046142662,0.00004367614,0.000006255248],"category_scores_gemma":[0.000025004429,0.00010973485,0.000079325444,0.00023380698,0.000052733183,0.0003587442,0.00008402054,0.00012205035,0.0000033678161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069298776,0.00019243968,0.00010584271,0.000005532167,0.000029275092,0.000008737379,0.00012669318,0.5015359,0.00003947881,0.11137165,0.00033320163,0.3862443],"study_design_scores_gemma":[0.00023497274,0.00006925826,0.0004588329,0.000045891593,0.000006239246,0.00018397724,0.000046042467,0.7528172,0.0014218867,0.24160136,0.0029832614,0.00013104221],"about_ca_topic_score_codex":0.000017354763,"about_ca_topic_score_gemma":0.0000023577434,"teacher_disagreement_score":0.4689725,"about_ca_system_score_codex":0.000087744884,"about_ca_system_score_gemma":0.00011431076,"threshold_uncertainty_score":0.44748572},"labels":[],"label_agreement":null},{"id":"W2063358347","doi":"10.1145/2818950.2818970","title":"Architecture Exploration for Data Intensive Applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Compass; Flexibility (engineering); Architecture; Computer architecture; Software; Software architecture; Embedded system; Computer architecture simulator; Distributed computing; Operating system","score_opus":0.14826485596497185,"score_gpt":0.34321896334786967,"score_spread":0.1949541073828978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063358347","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031687678,0.00003433783,0.99259156,0.0039377515,0.00005610641,0.00032496869,0.0000034072764,0.00057634624,0.002472355],"genre_scores_gemma":[0.008895665,0.0000036992926,0.9894349,0.001001477,0.000066589935,0.00010110905,0.00009717831,0.000004210677,0.0003951794],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994588,0.000017048069,0.00010090892,0.00025216784,0.00008385067,0.00008721972],"domain_scores_gemma":[0.9986757,0.000047989422,0.000041416126,0.00078946573,0.00038794414,0.000057492234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020674196,0.00005309449,0.00005789653,0.000051790194,0.000055481145,0.00008609471,0.00094672263,0.000025395419,6.33492e-7],"category_scores_gemma":[0.00011639128,0.00004508858,0.000012373957,0.00016829149,0.0000127268995,0.00038964386,0.0003194693,0.00003663888,0.000013512981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088848155,0.000053891676,0.0000232951,0.000010373954,0.000014905497,4.769774e-7,0.0012785024,0.021693481,0.000058203503,0.34545177,0.36611584,0.26529038],"study_design_scores_gemma":[0.00012513685,0.000035274905,0.0000015791037,0.000002434193,0.0000017455918,0.0000032333219,0.00004698077,0.7941155,0.0005030331,0.066357136,0.13872893,0.000079001664],"about_ca_topic_score_codex":0.0000064490127,"about_ca_topic_score_gemma":0.000003310183,"teacher_disagreement_score":0.772422,"about_ca_system_score_codex":0.000010822769,"about_ca_system_score_gemma":0.00005508683,"threshold_uncertainty_score":0.18386589},"labels":[],"label_agreement":null},{"id":"W2064736474","doi":"10.1109/ipdpsw.2010.5470772","title":"The pilot approach to cluster programming in C","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Software portability; Computer science; Programmer; Deadlock; Interface (matter); Message Passing Interface; Message passing; Debugging; Programming paradigm; Programming language; Computation; Distributed computing; Operating system","score_opus":0.01840824089322068,"score_gpt":0.2613476683821655,"score_spread":0.24293942748894481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064736474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016692985,0.000004488709,0.96033525,0.0013923957,0.00011485684,0.00020342116,1.7228013e-8,0.00034462608,0.035935618],"genre_scores_gemma":[0.34278548,6.9568387e-7,0.65611446,0.0004277011,0.000019432342,0.000029656483,1.4183566e-7,0.0000025793609,0.00061987236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939287,0.000028022752,0.000114999886,0.00018092066,0.00010143539,0.00018173603],"domain_scores_gemma":[0.999488,0.000057360994,0.000018930488,0.0003590818,0.000031693995,0.000044947516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050635176,0.000055325603,0.000047904457,0.000054279968,0.000109116474,0.00024279849,0.00075920264,0.000021334676,7.0786507e-7],"category_scores_gemma":[0.000044821772,0.000034704648,0.000013331365,0.00032092317,0.000016827624,0.00009624009,0.00023358353,0.00014199557,0.000015000157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009861491,0.00028525235,0.0012696042,0.000005576591,0.0000044058092,0.0000011272883,0.0010757707,0.0064992467,0.000295352,0.5908495,0.012045699,0.3876586],"study_design_scores_gemma":[0.00018570098,0.00009917581,0.0013482296,0.0000043724667,4.3944289e-7,0.000009256528,0.000016275588,0.92769307,0.00074155105,0.0025425307,0.06717818,0.00018124399],"about_ca_topic_score_codex":0.000028770419,"about_ca_topic_score_gemma":0.000045491022,"teacher_disagreement_score":0.9211938,"about_ca_system_score_codex":0.0000064597816,"about_ca_system_score_gemma":0.000016867389,"threshold_uncertainty_score":0.23413113},"labels":[],"label_agreement":null},{"id":"W2065045809","doi":"10.1145/1989622.1989629","title":"EASE","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Set (abstract data type); Architecture; Software engineering; Subject (documents); Course (navigation); Human–computer interaction; Programming language; World Wide Web; Engineering","score_opus":0.039999029405283125,"score_gpt":0.24141865436459545,"score_spread":0.20141962495931232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065045809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019363471,0.000006715361,0.7614452,0.00004429904,0.000035542107,0.000014768142,1.6803924e-8,0.0006398838,0.2376199],"genre_scores_gemma":[0.34377715,0.0000016678777,0.6549688,0.00032904415,0.0000050776994,0.0000012007237,6.986606e-8,0.0000010502388,0.00091596507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997406,0.000010108531,0.00004936934,0.00009161503,0.000041779214,0.00006654],"domain_scores_gemma":[0.999724,0.000005531848,0.000012591124,0.00020556885,0.000021008102,0.00003131081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059313978,0.000028886237,0.000027196033,0.000029838786,0.000027212014,0.000018215787,0.00033723217,0.000012239342,0.00006026712],"category_scores_gemma":[0.000006521053,0.00002380242,0.00001381168,0.00009658949,0.00000671633,0.000118842305,0.00008008009,0.000019757597,0.00008789015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.144303e-7,0.00004881023,0.0006603436,0.0000011963459,0.0000029144628,0.0000072529133,0.0005339115,0.000034106233,0.000024926412,0.9569796,0.013462024,0.028244046],"study_design_scores_gemma":[0.0003237777,0.00017993644,0.0076937857,0.000011167362,0.0000026711994,0.000032120573,0.00001431586,0.780957,0.056082413,0.13711028,0.017073091,0.0005194885],"about_ca_topic_score_codex":0.000015567144,"about_ca_topic_score_gemma":3.0788567e-7,"teacher_disagreement_score":0.8198693,"about_ca_system_score_codex":0.000002687499,"about_ca_system_score_gemma":0.000008665458,"threshold_uncertainty_score":0.11296793},"labels":[],"label_agreement":null},{"id":"W206636664","doi":"10.1007/978-3-642-39038-8_16","title":"Averroes: Whole-Program Analysis without the Whole Program","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Call graph; Programming language; Java; Bytecode; Graph; Reflection (computer programming); Construct (python library); Factor (programming language); Theoretical computer science","score_opus":0.016689303761848795,"score_gpt":0.27751539794085317,"score_spread":0.2608260941790044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206636664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049269736,0.0003842924,0.9889086,0.0016410245,0.000671412,0.0014437884,0.0000042923093,0.0017293941,0.00516791],"genre_scores_gemma":[0.050123725,0.00004321408,0.9457577,0.0015292559,0.00036359756,0.00015100202,0.000022989416,0.00004686139,0.0019616531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994815,0.00010900873,0.00078173267,0.0019793601,0.0013507076,0.0009641695],"domain_scores_gemma":[0.9955276,0.0003485657,0.00056838954,0.0027833194,0.00053468265,0.00023738864],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012134276,0.0007557176,0.0008343361,0.0012707403,0.00062574894,0.0018212409,0.0066216285,0.00041254555,0.000029850948],"category_scores_gemma":[0.000083564446,0.00053608214,0.00041600247,0.0026590256,0.0011475561,0.00066246744,0.001967289,0.0011436315,0.00015953102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000204004,0.00008678451,0.00017544586,0.000016753937,0.000094611445,0.000016988566,0.00052238745,0.12751777,0.000007782371,0.003129008,0.00031191108,0.8681185],"study_design_scores_gemma":[0.00014217389,0.00027488905,0.0002715523,0.00013736585,0.00006700085,0.000021888152,2.6096478e-7,0.95264375,0.00011513648,0.024865681,0.020773271,0.0006870255],"about_ca_topic_score_codex":0.00006090125,"about_ca_topic_score_gemma":0.00007116176,"teacher_disagreement_score":0.86743146,"about_ca_system_score_codex":0.00021927005,"about_ca_system_score_gemma":0.0003943668,"threshold_uncertainty_score":0.99970907},"labels":[],"label_agreement":null},{"id":"W2067618990","doi":"10.1145/2535932","title":"Exploiting Task- and Data-Level Parallelism in Streaming Applications Implemented in FPGAs","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; CMC Microsystems","keywords":"Computer science; Field-programmable gate array; Benchmark (surveying); Compiler; Suite; Computer architecture; Design flow; Replication (statistics); Embedded system; Implementation; Operating system; Programming language","score_opus":0.04862525721537313,"score_gpt":0.28942786179561497,"score_spread":0.24080260458024183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067618990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028707474,0.00059193146,0.96710074,0.0018259446,0.000059215043,0.000782187,0.000015675432,0.00048297583,0.00043388203],"genre_scores_gemma":[0.9652293,0.0003568045,0.033599503,0.000052594303,0.0000064999995,0.0006105246,0.000011381942,0.000008937889,0.00012450888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985491,0.00007326545,0.000438578,0.00056533486,0.000080678175,0.00029303326],"domain_scores_gemma":[0.99864274,0.00016703579,0.00010547187,0.0009893174,0.00004769319,0.000047728965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039793062,0.00015311598,0.00024667854,0.00086612767,0.00019498297,0.00012823752,0.00083093613,0.00018370761,0.000008054404],"category_scores_gemma":[0.000029445593,0.00015503599,0.0000126155155,0.00079044636,0.000064217245,0.0004842524,0.000042072166,0.00032043026,0.000009421671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008091565,0.00030452834,0.005967621,0.00015445809,0.00006817274,0.000015097131,0.00074611994,0.009230142,0.0016103985,0.034623045,0.0003347659,0.94693756],"study_design_scores_gemma":[0.0021896237,0.0002358396,0.0054712296,0.00057645014,0.000018257917,0.0002848945,0.0033727814,0.9468109,0.002210343,0.032543167,0.005304652,0.000981867],"about_ca_topic_score_codex":0.0006512744,"about_ca_topic_score_gemma":0.00014678453,"teacher_disagreement_score":0.9459557,"about_ca_system_score_codex":0.000033879605,"about_ca_system_score_gemma":0.000028115983,"threshold_uncertainty_score":0.6322184},"labels":[],"label_agreement":null},{"id":"W2067749416","doi":"10.1145/2616498.2616565","title":"Once you SCOOP, no need to fork","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"SCOOP; Computer science; Spawn (biology); Python (programming language); Fork (system call); Programming language; Distributed computing; Operating system","score_opus":0.011290956869973738,"score_gpt":0.24854759133212273,"score_spread":0.23725663446214898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067749416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041370647,0.0000046192627,0.88938934,0.0012957198,0.00016686127,0.000074081254,7.5833036e-8,0.0009115659,0.10774403],"genre_scores_gemma":[0.1783121,0.0000015175145,0.81389844,0.0033159803,0.000073211,0.0000056643066,4.4253397e-7,0.0000048774336,0.004387745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992828,0.000033468004,0.00012538295,0.00024153132,0.00013202318,0.00018484639],"domain_scores_gemma":[0.9992892,0.000046773213,0.000029632287,0.00044261303,0.00009673934,0.00009502551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002563135,0.00007828419,0.000090514484,0.00007258452,0.00008524085,0.00012738263,0.00070132356,0.000031551586,0.000016436581],"category_scores_gemma":[0.00009304779,0.000068404355,0.000028519282,0.0003088756,0.000008861561,0.00015143293,0.00023476375,0.000049523733,0.00037533796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007976473,0.00007496074,0.00055685267,0.000012642713,0.000010020551,0.000001986553,0.0005644203,0.01995095,0.000949836,0.6461465,0.21952511,0.112198785],"study_design_scores_gemma":[0.00011744458,0.00013123434,0.00022216183,0.000018950162,8.505389e-7,0.0000025598363,0.0000025774268,0.85630023,0.0035610315,0.002697823,0.13674727,0.00019785637],"about_ca_topic_score_codex":0.000025057248,"about_ca_topic_score_gemma":0.000001669088,"teacher_disagreement_score":0.8363493,"about_ca_system_score_codex":0.000013626091,"about_ca_system_score_gemma":0.000016716493,"threshold_uncertainty_score":0.48243353},"labels":[],"label_agreement":null},{"id":"W2068573906","doi":"10.1109/fccm.2013.36","title":"A Multithreaded VLIW Soft Processor Family","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Datapath; Field-programmable gate array; Pipeline (software); Compiler; Very long instruction word; Parallel computing; Throughput; Computer architecture; Adder; Embedded system; Simple (philosophy); ANSI C; Stratix; Computer hardware; Programming language","score_opus":0.01843334106777658,"score_gpt":0.24587688101280858,"score_spread":0.227443539945032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068573906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039973394,0.00004291612,0.9837379,0.00038778773,0.0000619096,0.00018902723,2.0907893e-7,0.0013260874,0.010256836],"genre_scores_gemma":[0.36453944,0.0000054882285,0.6316009,0.0013077051,0.000017671748,0.000040846302,0.0000015386217,0.000005915271,0.0024804915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921995,0.000029371718,0.00015122542,0.00025889234,0.00014341834,0.00019713271],"domain_scores_gemma":[0.9993174,0.000052477724,0.00004767323,0.00033131568,0.00018132517,0.000069801485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001181662,0.00009490538,0.00009738354,0.00006857396,0.000078752484,0.00021427893,0.0006737384,0.000045311765,0.00003378345],"category_scores_gemma":[0.000049164042,0.000075620585,0.000026804379,0.00029546476,0.000020613366,0.00042481194,0.00015947524,0.00006646592,0.00043638548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009384662,0.00061097316,0.008731142,0.00007322646,0.000063385945,0.000009791025,0.002288307,0.008425822,0.005110802,0.050457187,0.45005557,0.4741644],"study_design_scores_gemma":[0.00015984575,0.000037935926,0.010282456,0.000009046881,7.6778366e-7,0.0000031597351,0.00000874926,0.98309004,0.0020916667,0.0027437364,0.0013882644,0.00018433087],"about_ca_topic_score_codex":0.00024161517,"about_ca_topic_score_gemma":0.0000037132313,"teacher_disagreement_score":0.9746642,"about_ca_system_score_codex":0.000011505352,"about_ca_system_score_gemma":0.00003845019,"threshold_uncertainty_score":0.5608998},"labels":[],"label_agreement":null},{"id":"W2068820234","doi":"10.5555/776816.776834","title":"Computer-assisted assume/guarantee reasoning with VeriSoft","year":2003,"lang":"en","type":"article","venue":"International Conference on Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Correctness; Computer science; Complement (music); Counterexample; Program analysis; Visualization; Programming language; Pencil (optics); Theoretical computer science; Static analysis; Artificial intelligence; Mathematics","score_opus":0.018837688425932628,"score_gpt":0.2467797912585454,"score_spread":0.2279421028326128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068820234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052112974,0.000020671496,0.99048805,0.00009633244,0.00054589147,0.00008518689,0.0000023137677,0.0011829529,0.0023672972],"genre_scores_gemma":[0.47792923,0.000010391506,0.5218033,0.00009529224,0.00003584221,0.0000123994,0.000005367556,0.000013065888,0.00009509275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872017,0.000034656987,0.0002169038,0.00039858674,0.00038641007,0.0002432455],"domain_scores_gemma":[0.99915266,0.000097862765,0.00009504049,0.00033467403,0.00025332283,0.00006641275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017292063,0.00021292621,0.00017010387,0.00020619009,0.00008025877,0.00029224769,0.00072982116,0.00006491723,0.000029605395],"category_scores_gemma":[0.00016346447,0.0002004581,0.000049495626,0.00024977996,0.000018203482,0.00031143308,0.000077936485,0.00022543798,0.000026610795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020647185,0.00013312607,0.0023136274,0.000017378432,0.00012555569,0.0000972971,0.00039972982,0.24014665,0.00013527441,0.73271215,0.0006287576,0.023269804],"study_design_scores_gemma":[0.0004393459,0.00017026268,0.0021763674,0.00029584853,0.000004174514,0.00011307983,0.0000091955835,0.9898091,0.0014175088,0.00030880232,0.0048349584,0.00042133956],"about_ca_topic_score_codex":0.0000060390125,"about_ca_topic_score_gemma":9.626327e-7,"teacher_disagreement_score":0.74966246,"about_ca_system_score_codex":0.000082930004,"about_ca_system_score_gemma":0.000077729506,"threshold_uncertainty_score":0.81744444},"labels":[],"label_agreement":null},{"id":"W2068876600","doi":"10.1145/1723028.1723056","title":"Cache line reservation","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McGill University","funders":"McGill University; International Business Machines Corporation","keywords":"Computer science; Cache; Compiler; Operating system; Java; Reservation; Parallel computing; Cache algorithms; IBM; Cache pollution; Just-in-time compilation; Overhead (engineering); Cache invalidation; Optimizing compiler; CPU cache; Programming language; Computer network","score_opus":0.031119869988841097,"score_gpt":0.2875333064443132,"score_spread":0.2564134364554721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068876600","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007956849,0.000021125743,0.95944035,0.0054579824,0.000031731382,0.000035140863,3.395441e-8,0.0008302902,0.033387642],"genre_scores_gemma":[0.4312837,0.000007145101,0.56510895,0.0018436086,0.000027143964,7.05536e-7,0.0000011599559,0.0000010385899,0.0017265201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995961,0.000018313493,0.00008884098,0.0001232544,0.00008912124,0.00008433142],"domain_scores_gemma":[0.9996388,0.00001425666,0.00002419394,0.00024149215,0.000055290435,0.000025995803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014738333,0.000040050785,0.000044285473,0.000046814024,0.000048448164,0.00006227149,0.00033509522,0.000024574147,0.0000069811717],"category_scores_gemma":[0.000026064674,0.00003394769,0.000015651849,0.00023458742,0.0000038161447,0.00020747008,0.000035740075,0.00004021393,0.000019840245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030293813,0.00009846463,0.00028762178,0.0000019542952,0.0000033794279,0.0000044190615,0.00024424528,0.014045623,0.00078239525,0.7599176,0.06350564,0.1611056],"study_design_scores_gemma":[0.00008899362,0.00010159968,0.0023809446,0.0000044540902,4.9394674e-7,0.0000028897214,0.0000011557063,0.95678246,0.005910367,0.02840783,0.0062265233,0.00009230164],"about_ca_topic_score_codex":0.0000063882608,"about_ca_topic_score_gemma":6.0541396e-7,"teacher_disagreement_score":0.9427368,"about_ca_system_score_codex":0.000009105189,"about_ca_system_score_gemma":0.0000126578025,"threshold_uncertainty_score":0.13843466},"labels":[],"label_agreement":null},{"id":"W2068916399","doi":"10.1109/ccece.2008.4564571","title":"Power aware design of superscalar architecture for high performance DSP operations","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Superscalar; Computer science; Very long instruction word; Digital signal processing; Computer architecture; Power (physics); Microarchitecture; Architecture; Software; Pipeline burst cache; Embedded system; Parallel computing; Computer hardware; Operating system; CPU cache; Cache; Cache algorithms","score_opus":0.01746222034452253,"score_gpt":0.19769375377006332,"score_spread":0.1802315334255408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068916399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036462784,0.000034512606,0.9620824,0.00058614556,0.000083808074,0.0003645764,0.00000547447,0.00022087987,0.00015940763],"genre_scores_gemma":[0.833674,0.0000763665,0.16591644,0.00018605926,0.00004239781,0.000051614184,0.0000039702163,0.000014055536,0.00003509555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985035,0.0000112875305,0.00028922004,0.0004894483,0.0001913209,0.0005152007],"domain_scores_gemma":[0.99888456,0.000068863395,0.00005128303,0.00016711798,0.0004931333,0.00033504644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013657172,0.0002728516,0.0003207379,0.0004190297,0.00026320186,0.00017284433,0.0006378617,0.00013727932,0.000007714891],"category_scores_gemma":[0.00003944228,0.00026441083,0.00004288188,0.00044937799,0.000058516605,0.00027571627,0.00006589857,0.00027756137,0.0000019383383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000546753,0.00014605973,0.0012361471,0.00020313001,0.00011244995,0.000019966574,0.0036233577,0.15316524,0.0024037084,0.79735744,0.0021211032,0.039556712],"study_design_scores_gemma":[0.00024558938,0.0006453029,0.0013471522,0.000087196495,0.000004432318,0.00005156121,0.000003903934,0.9946453,0.0019026223,0.00058470067,0.00015476653,0.00032745863],"about_ca_topic_score_codex":0.0002973501,"about_ca_topic_score_gemma":0.000021689406,"teacher_disagreement_score":0.8414801,"about_ca_system_score_codex":0.00006705549,"about_ca_system_score_gemma":0.00047228942,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W2070063476","doi":"10.1109/smartcomp-w.2014.7046671","title":"A deeply embedded processor for smart devices","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Reduced instruction set computing; Field-programmable gate array; Power consumption; Energy consumption; Instructions per cycle; Efficient energy use; Instruction set; Power (physics); Computer architecture; Computer hardware; Central processing unit; Engineering; Electrical engineering","score_opus":0.015329454813342138,"score_gpt":0.268015658129799,"score_spread":0.25268620331645686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070063476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047487114,0.00001656815,0.9805577,0.00076324615,0.00007348523,0.00016243459,1.8107596e-7,0.0009680687,0.016983453],"genre_scores_gemma":[0.2945094,0.0000010698697,0.70318353,0.0013127057,0.00003548727,0.00003718659,0.0000012241271,0.00000484729,0.0009145707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993334,0.000024385487,0.00013553422,0.00024152269,0.000095154974,0.00017004108],"domain_scores_gemma":[0.9993909,0.00010675056,0.000056949197,0.00026836753,0.00012807698,0.000048967682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029468705,0.000077038276,0.00009789135,0.00005712582,0.00010511905,0.00013852588,0.0005641829,0.000034930563,0.0000047584313],"category_scores_gemma":[0.000084233754,0.00006527465,0.000038198377,0.00016585941,0.000011573085,0.00020567265,0.000082559396,0.000031260373,0.000017651539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016956441,0.0001731558,0.0013113949,0.00015888871,0.000031809028,7.097264e-7,0.0010562658,0.0040730387,0.00024631765,0.7487902,0.05422089,0.18992038],"study_design_scores_gemma":[0.00019061049,0.00009345818,0.00016280041,0.000010457838,0.0000020796779,0.0000023558543,0.0000042081033,0.95186466,0.0045023295,0.014116836,0.028912675,0.00013750122],"about_ca_topic_score_codex":0.000004824667,"about_ca_topic_score_gemma":0.0000060677376,"teacher_disagreement_score":0.94779164,"about_ca_system_score_codex":0.000006943222,"about_ca_system_score_gemma":0.00002619812,"threshold_uncertainty_score":0.2661823},"labels":[],"label_agreement":null},{"id":"W2070292256","doi":"10.1007/s10586-006-9738-3","title":"Finding a suitable system scale to optimize program performance on software DSM systems","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Overhead (engineering); Distributed computing; Software; Interface (matter); Embedded system; Parallel computing; Operating system","score_opus":0.013565794297711252,"score_gpt":0.24879841619857646,"score_spread":0.2352326219008652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070292256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574707,0.00007122116,0.90416473,0.00009468727,0.0008100297,0.00089387374,0.0000014019887,0.004023197,0.0041938033],"genre_scores_gemma":[0.5811343,5.5248734e-7,0.4179293,0.00013099654,0.00022819953,0.00004021147,0.000005082777,0.00002385404,0.00050748605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972657,0.00015538419,0.00059706526,0.0007667105,0.00044941792,0.00076571153],"domain_scores_gemma":[0.99847054,0.00017641917,0.00024036222,0.0007616093,0.00019645884,0.00015462906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082043925,0.00032618264,0.00039224586,0.00032055593,0.0006436259,0.00085167197,0.001179277,0.00013442288,9.2563715e-7],"category_scores_gemma":[0.000032738935,0.00031671516,0.00009741308,0.00083425426,0.000026541418,0.00030383686,0.000690651,0.00026707165,0.00012911319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447523,0.000086016415,0.0017460667,0.0001739573,0.000008261884,0.000008586194,0.00027390086,0.9783294,0.000010354116,0.0016267967,0.004061279,0.013666886],"study_design_scores_gemma":[0.00034725064,0.00022317682,0.00086554035,0.00081835483,0.0000052034366,0.00006068665,0.00003420012,0.9954723,0.00033906344,0.000011085722,0.0014291765,0.0003939712],"about_ca_topic_score_codex":0.00005724876,"about_ca_topic_score_gemma":0.0000011488788,"teacher_disagreement_score":0.49538726,"about_ca_system_score_codex":0.00026662348,"about_ca_system_score_gemma":0.000054854023,"threshold_uncertainty_score":0.9999285},"labels":[],"label_agreement":null},{"id":"W2070314387","doi":"10.1145/2628071.2628099","title":"What is the cost of weak determinism?","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Determinism; Computer science; Thread (computing); Synchronization (alternating current); Parsec; Distributed computing; Overhead (engineering); Slowdown; Interfacing; Real-time computing; Operating system; Computer hardware; Computer network","score_opus":0.01689830447602623,"score_gpt":0.2675944807524119,"score_spread":0.25069617627638563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070314387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030269942,0.000034949768,0.9783479,0.0023456074,0.00015975352,0.00006885139,7.4676684e-8,0.00016896194,0.018571205],"genre_scores_gemma":[0.7823164,0.000092234855,0.21199676,0.003287534,0.000030514879,0.000006727549,2.7695683e-7,0.000004226314,0.0022653216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994996,0.0000488426,0.00012233625,0.00012617128,0.00011241093,0.00009064378],"domain_scores_gemma":[0.99929786,0.00010941754,0.0000587436,0.0004580055,0.00005318686,0.000022791457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027365194,0.00005056817,0.00007036134,0.00002822083,0.00005855184,0.00013179655,0.0007060176,0.000023458113,0.000013885401],"category_scores_gemma":[0.000015497668,0.000031175096,0.000034325974,0.00012792894,0.00003382209,0.00024804036,0.00015868303,0.00003822738,0.000018709832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022285708,0.00005407314,0.0003702658,0.0000115180155,0.000012513061,4.0528514e-7,0.0017479892,0.0017461141,0.00019528944,0.280238,0.04296873,0.6726529],"study_design_scores_gemma":[0.00008968416,0.00005578168,0.00034878316,0.000020558235,0.0000016383208,0.000004398133,0.000029426696,0.9237359,0.022637252,0.006026296,0.04696147,0.00008878257],"about_ca_topic_score_codex":0.000006656705,"about_ca_topic_score_gemma":9.290476e-7,"teacher_disagreement_score":0.9219898,"about_ca_system_score_codex":0.000003451223,"about_ca_system_score_gemma":0.000011316841,"threshold_uncertainty_score":0.13119681},"labels":[],"label_agreement":null},{"id":"W2070464029","doi":"10.1088/1742-6596/540/1/012006","title":"Efficient parallelization of molecular dynamics simulations with short-ranged forces","year":2014,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Speedup; Parallel computing; Benchmark (surveying); Computer science; Molecular dynamics; Decomposition; Automatic parallelization; Work (physics); Core (optical fiber); Dynamics (music); Multi-core processor; Computational science; Algorithm; Physics; Chemistry; Computational chemistry","score_opus":0.01263633697231611,"score_gpt":0.24323710750435068,"score_spread":0.23060077053203457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070464029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072135285,0.000015722504,0.92707264,0.00018318917,0.000048061793,0.00005793102,0.0000014218075,0.000036102203,0.0004496165],"genre_scores_gemma":[0.8504437,0.000007008877,0.14948095,0.000021498807,0.000023950537,6.747621e-7,0.0000026361392,0.0000054292464,0.000014128808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990875,0.00007229027,0.0003208778,0.00010876445,0.00030154246,0.000109041786],"domain_scores_gemma":[0.9984913,0.00005671306,0.00037098816,0.00021771449,0.0008183998,0.00004488241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001695521,0.00010460539,0.00022170747,0.00007868079,0.00006743369,0.0000805388,0.00039916026,0.000033065488,0.0000016168686],"category_scores_gemma":[0.00003762895,0.00008343527,0.00005585352,0.00027448617,0.000072966446,0.00026535086,0.000051987277,0.00009445795,2.699851e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013925293,0.000045577275,0.00036974333,0.000013511217,0.000019802224,0.0000010727089,0.0004786123,0.8025056,0.0015402947,0.18244931,0.0000056096437,0.012556918],"study_design_scores_gemma":[0.00016848979,0.00035347222,0.0003169674,0.000083227205,0.000015104334,0.000009041046,0.00003511788,0.9234775,0.060602546,0.014801554,0.000024313129,0.00011268029],"about_ca_topic_score_codex":0.000002447231,"about_ca_topic_score_gemma":0.0000040483365,"teacher_disagreement_score":0.77830845,"about_ca_system_score_codex":0.000024722505,"about_ca_system_score_gemma":0.00013475897,"threshold_uncertainty_score":0.34023914},"labels":[],"label_agreement":null},{"id":"W2070638479","doi":"10.1145/1321211.1321241","title":"Support for OpenMP tasks in Nanos v4","year":2007,"lang":"en","type":"article","venue":"Proceedings of CASCON","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Computer architecture","score_opus":0.018296444195058978,"score_gpt":0.287610183182274,"score_spread":0.269313738987215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070638479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09242746,0.00006118337,0.8707007,0.00032211962,0.00015009072,0.0005710957,0.0000013444997,0.00030120878,0.035464764],"genre_scores_gemma":[0.7591119,0.00000728403,0.24039058,0.00013802967,0.000026438975,0.000012944235,8.417541e-7,0.000006478234,0.00030548303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990809,0.0000014517897,0.00030426067,0.00023529289,0.00013972669,0.00023834873],"domain_scores_gemma":[0.99944,0.000048116355,0.00014677132,0.00007879532,0.00023861545,0.000047661957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009329093,0.00008660337,0.0001581091,0.00019833799,0.000034985027,0.000056725024,0.00052982033,0.00006494194,0.0000028662027],"category_scores_gemma":[0.00009889361,0.000087363245,0.000043256678,0.00030462779,0.00002338587,0.00036524894,0.000117027244,0.000066289685,0.0000022309905],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002774883,0.0006465688,0.037313193,0.0007695807,0.000052697877,0.000018604353,0.007547849,0.000355475,0.07673117,0.6253852,0.056392223,0.19450994],"study_design_scores_gemma":[0.0017172319,0.0008563538,0.0070144464,0.00019471916,0.000009118597,0.00004612935,0.0001386532,0.054666225,0.89633137,0.015026312,0.023394901,0.0006045345],"about_ca_topic_score_codex":0.000013832349,"about_ca_topic_score_gemma":0.0000021319001,"teacher_disagreement_score":0.8196002,"about_ca_system_score_codex":0.000026636924,"about_ca_system_score_gemma":0.000032915388,"threshold_uncertainty_score":0.35625696},"labels":[],"label_agreement":null},{"id":"W2070648266","doi":"10.1109/soccon.2009.5398024","title":"DDR3 based lookup circuit for high-performance network processing","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast","keywords":"Computer science; Lookup table; Memory controller; Registered memory; Physical address; Computer hardware; Memory map; Embedded system; Semiconductor memory; Parallel computing; Operating system","score_opus":0.018973214422384768,"score_gpt":0.2461202582684112,"score_spread":0.2271470438460264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070648266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010837858,0.000063647625,0.99132645,0.00069885247,0.00009153957,0.00018530677,1.7774718e-7,0.0011342829,0.005415954],"genre_scores_gemma":[0.5554039,0.0000026312525,0.442534,0.0016996923,0.00007596277,0.000008245206,0.0000019328768,0.0000035967282,0.000270048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908984,0.000016200862,0.00018532755,0.00027958298,0.00013325181,0.00029579274],"domain_scores_gemma":[0.99942833,0.00004017109,0.00007815295,0.0002914304,0.000110664514,0.0000512564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000274637,0.000110274006,0.00012302797,0.0000571247,0.00022763127,0.00016913564,0.000557137,0.0000514213,0.000004990015],"category_scores_gemma":[0.000013139195,0.000098701734,0.000030703424,0.00034653934,0.0000130374665,0.0003106583,0.000029817436,0.00006133171,0.0000064828214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001041437,0.00008272454,0.0002839702,0.000035040102,0.0000042077627,0.0000013881541,0.00007826552,0.30787683,0.00008885889,0.08243393,0.016373795,0.5927306],"study_design_scores_gemma":[0.00022431723,0.00015688266,0.0009861878,0.000040478248,0.0000020526663,0.0000015916776,4.6520054e-7,0.98472345,0.0032382538,0.009201533,0.0012608705,0.00016389746],"about_ca_topic_score_codex":0.0000016435276,"about_ca_topic_score_gemma":2.5039273e-7,"teacher_disagreement_score":0.6768466,"about_ca_system_score_codex":0.000022210885,"about_ca_system_score_gemma":0.000075346936,"threshold_uncertainty_score":0.402494},"labels":[],"label_agreement":null},{"id":"W2071117912","doi":"10.1109/micro.2014.40","title":"Wormhole: Wisely Predicting Multidimensional Branches","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Branch predictor; Exploit; Construct (python library); Concurrency; Wormhole; Parallel computing; Distributed computing","score_opus":0.011429306684738091,"score_gpt":0.23307952138745067,"score_spread":0.22165021470271257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071117912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041776667,0.000016499036,0.9725304,0.00058009307,0.00013535199,0.00005055964,1.3727934e-7,0.0013214798,0.02118778],"genre_scores_gemma":[0.50382686,0.0000017890436,0.4951096,0.00051096844,0.000043981578,0.0000026073692,8.116959e-7,0.000003561593,0.0004998331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.000053303138,0.00015654098,0.0002537643,0.00017742086,0.00017313163],"domain_scores_gemma":[0.99937207,0.0001254443,0.00005310829,0.00030676505,0.00007699562,0.00006562427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498274,0.000086824504,0.00009148119,0.0000645839,0.0001317627,0.000067835135,0.0003819376,0.000040909752,0.000012126406],"category_scores_gemma":[0.00009687709,0.000074248295,0.000034838,0.000189275,0.000021547607,0.00023142387,0.00018379619,0.00008043731,0.00005363159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009292233,0.00019157134,0.016800346,0.000023051884,0.000031462947,0.000004591662,0.00090262963,0.04026011,0.0012510569,0.6088318,0.043885313,0.28780872],"study_design_scores_gemma":[0.00015503741,0.000032776097,0.0023209862,0.000014375199,9.879424e-7,0.000006795356,0.0000021002277,0.9794468,0.0030575867,0.0022554721,0.01258905,0.00011798569],"about_ca_topic_score_codex":0.000011751304,"about_ca_topic_score_gemma":6.0813306e-7,"teacher_disagreement_score":0.93918675,"about_ca_system_score_codex":0.000009959301,"about_ca_system_score_gemma":0.00001928782,"threshold_uncertainty_score":0.30277577},"labels":[],"label_agreement":null},{"id":"W2071120472","doi":"10.1002/cae.20243","title":"PerfPred: A web‐based tool for exploring computer architecture design space","year":2009,"lang":"en","type":"article","venue":"Computer Applications in Engineering Education","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer architecture; Benchmark (surveying); Microarchitecture; Architecture; Software; Software engineering; Hierarchy; Memory hierarchy; Operating system","score_opus":0.021672918640815584,"score_gpt":0.256488957556673,"score_spread":0.23481603891585742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071120472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013874717,0.00008611459,0.9952588,0.0008255741,0.00035317708,0.0010681563,0.0000012361887,0.0009879512,0.000031534364],"genre_scores_gemma":[0.15779965,0.000007939152,0.84059864,0.00026552792,0.0003429886,0.00092947204,0.00002278998,0.000016587375,0.000016396494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987116,0.00003842039,0.0003101007,0.0005095125,0.0001375818,0.00029280238],"domain_scores_gemma":[0.9988141,0.00023987348,0.000083287865,0.000661844,0.00012863631,0.00007225591],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002867096,0.00022440907,0.00018878204,0.00047714377,0.00011222316,0.00018673723,0.0007479637,0.00007789834,8.2471394e-7],"category_scores_gemma":[0.000015977099,0.00024813353,0.00007272417,0.0007250956,0.000010761841,0.00026485202,0.000057374757,0.00017212157,0.0000039553415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022854542,0.00016059628,0.000049611193,0.00003646432,0.000003400476,1.4015723e-7,0.00023844028,0.85917544,0.00016203798,0.015741264,0.0012739174,0.123156376],"study_design_scores_gemma":[0.00023417636,0.00008469781,0.0015662952,0.000082725084,0.0000037671164,0.0000041606786,0.0000019560885,0.9878668,0.00091408985,0.0014808899,0.0074804476,0.00027999803],"about_ca_topic_score_codex":0.0000017010302,"about_ca_topic_score_gemma":1.4994816e-7,"teacher_disagreement_score":0.15641217,"about_ca_system_score_codex":0.0001359078,"about_ca_system_score_gemma":0.00020536353,"threshold_uncertainty_score":0.9999971},"labels":[],"label_agreement":null},{"id":"W2071391180","doi":"10.1177/0037549709346279","title":"A Component-based Simulator for MIPS32 Processors","year":2009,"lang":"en","type":"article","venue":"SIMULATION","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Norges Teknisk-Naturvitenskapelige Universitet; University of Ottawa","keywords":"Computer science; Computer architecture simulator; DEVS; Pipeline (software); Computer architecture; Suite; Microprocessor; Animation; Formalism (music); Component (thermodynamics); Parallel computing; Embedded system; Simulation; Modeling and simulation; Programming language; Computer graphics (images)","score_opus":0.02424301623228133,"score_gpt":0.30791411185103823,"score_spread":0.2836710956187569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071391180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00839255,0.00002593976,0.9895345,0.00065164507,0.00006649358,0.00034304278,0.0000010963273,0.000759087,0.00022563651],"genre_scores_gemma":[0.79688364,2.9936294e-7,0.2024131,0.00059947436,0.000037626058,0.0000071621694,0.000011807894,0.000004579818,0.00004233316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992239,0.000026133039,0.00018626504,0.00024603392,0.00015197622,0.00016568044],"domain_scores_gemma":[0.9992784,0.00015996597,0.00009670629,0.0002489526,0.00016862983,0.000047300375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017241624,0.0000984924,0.00010638689,0.000107834305,0.00013494607,0.00009373156,0.00029195484,0.000055304772,0.0000019754088],"category_scores_gemma":[0.000077747245,0.00009760428,0.000055886718,0.00024678372,0.000008958085,0.00023342599,0.000015089852,0.000042412885,0.0000058099004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011619105,0.000044225515,0.000052278425,0.0000062756717,0.0000015670794,2.3320914e-7,0.000060489194,0.9834593,0.000104816776,0.0037415747,0.00014380887,0.012373805],"study_design_scores_gemma":[0.00044747136,0.00012002691,0.0006586711,0.000014849691,0.0000026335656,1.8355534e-7,8.4026766e-7,0.989124,0.0019616452,0.005931333,0.0016132176,0.00012510747],"about_ca_topic_score_codex":0.0000010497137,"about_ca_topic_score_gemma":1.7732755e-7,"teacher_disagreement_score":0.7884911,"about_ca_system_score_codex":0.000030038933,"about_ca_system_score_gemma":0.000039604154,"threshold_uncertainty_score":0.3980187},"labels":[],"label_agreement":null},{"id":"W2071505862","doi":"10.1145/1723028.1723033","title":"Parallel catastrophe modelling on a cell processor","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Computer science; Speedup; Parallel computing; Computation; Code (set theory); Vectorization (mathematics); Algorithm; Programming language","score_opus":0.019967496434616552,"score_gpt":0.2439750325551649,"score_spread":0.22400753612054836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071505862","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045907585,0.00003414839,0.9649194,0.00068577094,0.000029086872,0.000091533475,2.2160486e-7,0.00085415656,0.03292664],"genre_scores_gemma":[0.37565526,0.000011133249,0.6223441,0.0009720022,0.000019369278,0.0000030114975,0.0000011858506,0.0000028151117,0.0009911672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000019811005,0.00014270928,0.00029209864,0.00016738052,0.00020578784],"domain_scores_gemma":[0.99945945,0.000018872382,0.000050372764,0.00035276834,0.00005412028,0.000064409855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010240201,0.00010788791,0.00009475945,0.000074482814,0.00009623115,0.000114429626,0.0005984088,0.000038021346,0.000005006755],"category_scores_gemma":[0.0000035492471,0.00008957609,0.000035121913,0.00021813325,0.0000075164457,0.00017584028,0.00004064088,0.00009401983,0.0000557548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004289641,0.00008928014,0.0000032604655,0.000002436759,9.5174204e-7,0.0000031594784,0.000097915785,0.9538611,0.000025895079,0.034910683,0.0037674455,0.007233551],"study_design_scores_gemma":[0.00013211071,0.00016147186,0.000007543307,0.000008480424,7.95662e-7,0.0000021359065,0.0000020191715,0.9896174,0.0029302668,0.006122216,0.0008941473,0.00012140353],"about_ca_topic_score_codex":0.000005244199,"about_ca_topic_score_gemma":1.2112953e-7,"teacher_disagreement_score":0.3751962,"about_ca_system_score_codex":0.000015625388,"about_ca_system_score_gemma":0.000030201103,"threshold_uncertainty_score":0.3652807},"labels":[],"label_agreement":null},{"id":"W2071586420","doi":"10.1109/hpca.2013.6522309","title":"RECAP: A region-based cure for the common cold (cache)","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Parallel computing","score_opus":0.02607506148204409,"score_gpt":0.26328003018119456,"score_spread":0.23720496869915048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071586420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014634756,0.00006787489,0.9791771,0.016533962,0.000094950396,0.00050507335,2.5611817e-7,0.0006592996,0.0028151465],"genre_scores_gemma":[0.5860147,0.000012290162,0.40543973,0.005386167,0.000054106255,0.00023232609,0.0000018349192,0.000009693732,0.0028491775],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.00003967152,0.0001393022,0.00019114191,0.00010279063,0.00016655026],"domain_scores_gemma":[0.9988095,0.00042071202,0.00006355039,0.00053766876,0.0001271789,0.00004139791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018219999,0.00008478921,0.00008856459,0.000039349674,0.00019951054,0.00019619854,0.0008236538,0.000047888672,0.000013274185],"category_scores_gemma":[0.00002734134,0.000053384312,0.000060545386,0.00020291677,0.000029789937,0.00013971036,0.00007915838,0.00007126358,0.000025570036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039524634,0.00007069325,0.000435735,0.000012819791,0.0000144067435,9.226414e-7,0.00015093925,0.012185704,0.00011808423,0.14651988,0.8135317,0.026955182],"study_design_scores_gemma":[0.00015701182,0.000051965828,0.00011367766,0.000009290881,0.0000022117013,0.0000015937417,0.000005044256,0.9581221,0.0034763103,0.0036500213,0.03431387,0.000096915006],"about_ca_topic_score_codex":0.0001196455,"about_ca_topic_score_gemma":0.000006555259,"teacher_disagreement_score":0.9459364,"about_ca_system_score_codex":0.000016269893,"about_ca_system_score_gemma":0.000038119073,"threshold_uncertainty_score":0.2176949},"labels":[],"label_agreement":null},{"id":"W2071761886","doi":"10.1145/2465351.2465366","title":"Whose cache line is it anyway?","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cache; Cache coloring; Cache pollution; Parallel computing; Cache algorithms; Operating system; CPU cache; Page cache; Smart Cache; Parallelism (grammar); Central processing unit; Software; Embedded system","score_opus":0.028538467859027472,"score_gpt":0.27613379800080545,"score_spread":0.24759533014177798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071761886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009617885,0.00003805031,0.9447442,0.010426219,0.000072220224,0.00009820701,1.8754594e-7,0.00067289517,0.042986173],"genre_scores_gemma":[0.30266938,0.000026782875,0.668562,0.008766589,0.00005212447,0.000014551213,0.0000010914846,0.0000060332195,0.019901473],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993066,0.000025348752,0.0001454979,0.00022529264,0.00012676897,0.00017046748],"domain_scores_gemma":[0.99932253,0.000032872667,0.00003831182,0.00042439674,0.0001096532,0.00007223894],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001170004,0.0000836626,0.000084782216,0.000060364608,0.00007087007,0.0001874179,0.0005986828,0.000045874065,0.00042083164],"category_scores_gemma":[0.000018758703,0.000067610876,0.000035377336,0.00022574925,0.000015891063,0.0003407002,0.00020385148,0.000070730355,0.0007824396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.89622e-7,0.00006856214,0.00027295583,0.0000052749024,0.000009817955,0.000002299291,0.0007847679,0.0010125745,0.0002667495,0.020590676,0.9287169,0.04826896],"study_design_scores_gemma":[0.00011165546,0.000054987435,0.00033930264,0.000008495228,0.0000011324029,0.000005657825,0.000012009443,0.9593852,0.010074253,0.004653783,0.025176866,0.00017665622],"about_ca_topic_score_codex":0.00012221451,"about_ca_topic_score_gemma":0.0000014969133,"teacher_disagreement_score":0.95837265,"about_ca_system_score_codex":0.000011562719,"about_ca_system_score_gemma":0.000022295857,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W2071868606","doi":"10.1145/966809.966810","title":"Aliasing and anti-aliasing in branch history table prediction","year":2003,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Aliasing; Computer science; Table (database); Algorithm; Branch predictor; Lookup table; Parallel computing; Artificial intelligence; Data mining; Programming language","score_opus":0.016755893335476606,"score_gpt":0.23465371928432877,"score_spread":0.21789782594885215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071868606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035979174,0.00072910875,0.9598989,0.0005666414,0.0006318732,0.0002799881,0.0000011618189,0.0005593847,0.0013537694],"genre_scores_gemma":[0.3830012,0.00006355223,0.6156743,0.001002947,0.00013738613,0.000011917658,0.000004667683,0.000023087188,0.00008092154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975599,0.0004186313,0.00041921125,0.000760433,0.00032617638,0.0005156169],"domain_scores_gemma":[0.99846184,0.00028763418,0.00012331373,0.000902855,0.000072701805,0.00015163142],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061418815,0.00028145645,0.00034006778,0.00046476696,0.00015620775,0.00016728726,0.0008673716,0.00012390956,0.000007349566],"category_scores_gemma":[0.0001651385,0.00028125691,0.000057137087,0.0005236849,0.00008992264,0.00034773286,0.00047580164,0.00046047187,0.0000036152119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030757266,0.00040217204,0.04482674,0.00020206989,0.00008269556,0.0001270674,0.015713263,0.22332644,0.005039065,0.0152314855,0.02723198,0.66778624],"study_design_scores_gemma":[0.003407208,0.000563014,0.028702354,0.00064500683,0.000024986215,0.00089237187,0.000027163727,0.64142376,0.005763269,0.04759204,0.26924303,0.0017157841],"about_ca_topic_score_codex":0.000114501985,"about_ca_topic_score_gemma":0.00002360121,"teacher_disagreement_score":0.66607046,"about_ca_system_score_codex":0.00017889125,"about_ca_system_score_gemma":0.00015250372,"threshold_uncertainty_score":0.99996394},"labels":[],"label_agreement":null},{"id":"W2072076019","doi":"10.1145/1294313.1294319","title":"Custom code generation for soft processors","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Field-programmable gate array; Suite; Embedded system; Computer architecture; Personalization; Code (set theory); Software; Parallel computing; Operating system; Programming language","score_opus":0.027673142010535876,"score_gpt":0.2944678403683487,"score_spread":0.26679469835781283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072076019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038706656,0.000093094335,0.9905469,0.0026647865,0.0005499628,0.0007207269,0.0000042945794,0.0011867658,0.00036284796],"genre_scores_gemma":[0.1118576,0.000007720822,0.88422483,0.0025078242,0.0011438961,0.00004596837,0.000030951585,0.000031197254,0.00014999417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974901,0.000091698406,0.0004911034,0.0008321755,0.0004187759,0.0006761451],"domain_scores_gemma":[0.9975451,0.00060541515,0.00018027356,0.0011779652,0.00028122714,0.00020997573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009167449,0.00031481913,0.00029328183,0.00036212342,0.0003540592,0.0002864856,0.0022537783,0.00014694383,0.0000032948776],"category_scores_gemma":[0.00020805017,0.00028387844,0.00015420462,0.000546819,0.00006416329,0.00024240259,0.0006834716,0.0003137676,0.000012181419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003401348,0.000116296214,0.0002759513,0.000053923413,0.000040331368,0.00001280609,0.0023915945,0.07709023,0.0021708068,0.005425131,0.025837455,0.88655144],"study_design_scores_gemma":[0.00083260424,0.00045794217,0.00035773945,0.000041754854,0.000010844678,0.00006760695,0.000004917984,0.884877,0.013689313,0.019773502,0.07930667,0.00058006134],"about_ca_topic_score_codex":0.000015713971,"about_ca_topic_score_gemma":0.000072445575,"teacher_disagreement_score":0.88597137,"about_ca_system_score_codex":0.000060995924,"about_ca_system_score_gemma":0.00012358736,"threshold_uncertainty_score":0.9999613},"labels":[],"label_agreement":null},{"id":"W2072190555","doi":"10.1109/fpl.2012.6339239","title":"EmPower: FPGA based rapid prototyping of dynamic power management algorithms for multi-processor systems on chip","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MPSoC; Computer science; Embedded system; Field-programmable gate array; Power management; System on a chip; Clock gating; Design space exploration; Frequency scaling; Computer architecture; Software; Benchmarking; Multi-core processor; Software prototyping; Power (physics); Software development; Parallel computing; Operating system","score_opus":0.03771964595199999,"score_gpt":0.31120465306955497,"score_spread":0.27348500711755497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072190555","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027378305,0.00027960876,0.9936746,0.00009946161,0.0003305807,0.0017399081,0.0000029422124,0.0005328187,0.0030663498],"genre_scores_gemma":[0.3611227,0.000010429953,0.6379134,0.00015552333,0.000016528898,0.00030553094,0.0000042494685,0.000013300444,0.00045832215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875355,0.000053417025,0.00032353654,0.00030530005,0.00022314583,0.00034103854],"domain_scores_gemma":[0.99910563,0.000060061495,0.00017153002,0.00046571987,0.00011705776,0.00007999808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062420894,0.00016456867,0.00020296325,0.0002046069,0.000100002755,0.00006702298,0.00058541424,0.00006239994,0.0000073499978],"category_scores_gemma":[0.000018910014,0.00013821892,0.00008186532,0.00028270567,0.000020497577,0.00021712904,0.00009681195,0.00006355131,0.000008024783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003892615,0.006768188,0.0008758387,0.005266694,0.0006150442,0.000010789111,0.004239939,0.056735598,0.00064370583,0.26113734,0.00973969,0.6535779],"study_design_scores_gemma":[0.0006052362,0.00018771604,0.00035484784,0.00012807432,0.0000056865147,0.0000012887376,0.00002727586,0.99272275,0.0029430739,0.0000399436,0.002785857,0.00019823114],"about_ca_topic_score_codex":0.000004852606,"about_ca_topic_score_gemma":1.8721161e-7,"teacher_disagreement_score":0.9359872,"about_ca_system_score_codex":0.000045715828,"about_ca_system_score_gemma":0.000021150194,"threshold_uncertainty_score":0.5636404},"labels":[],"label_agreement":null},{"id":"W2072283196","doi":"10.1145/563647.563649","title":"Adapting Tomasulo's algorithm for bytecode folding based Java processors","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Bytecode; Java; Java bytecode; Java concurrency; Programming language; Java annotation; Parallel computing; Real time Java; Java applet; Java Modeling Language; Generics in Java; Scala; strictfp; Algorithm","score_opus":0.02199764078528948,"score_gpt":0.27439504145387844,"score_spread":0.25239740066858896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072283196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012790061,0.00014152526,0.9913944,0.0034871544,0.00042757316,0.00085066864,0.0000055405394,0.001945589,0.0004685599],"genre_scores_gemma":[0.031749118,0.000015512911,0.9646499,0.002539141,0.0007124901,0.00013376142,0.00002176096,0.00005549062,0.00012281098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965789,0.00019604102,0.00059566536,0.0011280617,0.00054845534,0.0009529254],"domain_scores_gemma":[0.9966901,0.0010266089,0.0002602948,0.0014590912,0.00029170985,0.00027222058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006971452,0.0004779767,0.0004681757,0.0004906057,0.0005101974,0.00045541456,0.0032810073,0.00016889272,0.000008756569],"category_scores_gemma":[0.0002300038,0.0004457011,0.00026603794,0.00093080476,0.00006941574,0.0003218134,0.0009802022,0.0004454434,0.000010022193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014554682,0.00007938201,0.0001432803,0.000034139925,0.000030096882,0.000022957502,0.00055956905,0.083986655,0.00015240998,0.0004313172,0.0030492323,0.9114964],"study_design_scores_gemma":[0.0008828834,0.000369253,0.00009112921,0.000111321584,0.000010426076,0.00007744633,0.000005207569,0.95192164,0.002099354,0.007864375,0.036058992,0.00050798256],"about_ca_topic_score_codex":0.000039391805,"about_ca_topic_score_gemma":0.000018624036,"teacher_disagreement_score":0.9109884,"about_ca_system_score_codex":0.00008338914,"about_ca_system_score_gemma":0.00019352994,"threshold_uncertainty_score":0.9997995},"labels":[],"label_agreement":null},{"id":"W2072649780","doi":"10.1049/ip-cdt:20045117","title":"Power-aware branch predictor update","year":2005,"lang":"en","type":"article","venue":"IEE Proceedings - Computers and Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Branch predictor; Computer science; Exploit; Key (lock); Power (physics); Predictive power; Power consumption; Energy consumption; Speculative execution; Integer (computer science); Simple (philosophy); Energy (signal processing); Reliability engineering; Parallel computing; Statistics; Computer security; Engineering; Mathematics","score_opus":0.006911291261733892,"score_gpt":0.22314199934842366,"score_spread":0.21623070808668976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072649780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012959849,0.00019842702,0.96566296,0.0019707356,0.00010992526,0.00033286106,0.000008497688,0.0052287723,0.013527952],"genre_scores_gemma":[0.7566801,0.00008776772,0.24196546,0.0009421561,0.00014621422,0.000024335011,0.0000047382164,0.00002212524,0.00012712281],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981981,0.000006681968,0.00039220825,0.00067401363,0.00030783872,0.00042118077],"domain_scores_gemma":[0.99909943,0.000036216374,0.00017381369,0.00025024152,0.00023133092,0.00020899285],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00019482641,0.0003232095,0.00029556913,0.00026138846,0.00019739161,0.0016044412,0.000934095,0.00014138818,0.0000039696884],"category_scores_gemma":[0.00002252517,0.00030477095,0.00008951176,0.0003893648,0.00010571461,0.0026147573,0.00064652105,0.00020528982,0.000013420322],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031071926,0.00034769636,0.0031024276,0.000109739725,0.00006517755,0.000012374517,0.001167611,0.00004544929,0.00049427035,0.12321228,0.15915121,0.7122607],"study_design_scores_gemma":[0.001174089,0.0015131099,0.001505876,0.0007167996,0.000020213083,0.00058875285,0.000042219217,0.29255196,0.057398982,0.06631642,0.5753821,0.0027894715],"about_ca_topic_score_codex":0.0000019735392,"about_ca_topic_score_gemma":1.0768212e-7,"teacher_disagreement_score":0.74372023,"about_ca_system_score_codex":0.000050610623,"about_ca_system_score_gemma":0.000031918476,"threshold_uncertainty_score":0.99994045},"labels":[],"label_agreement":null},{"id":"W2072837011","doi":"10.1007/s11227-014-1331-6","title":"Power-efficient prefetching on GPGPUs","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Instruction prefetch; Computer science; Graphics processing unit; Graphics; Efficient energy use; Energy consumption; General-purpose computing on graphics processing units; Parallel computing; Latency (audio); CUDA; Operating system; Telecommunications","score_opus":0.012106152293516767,"score_gpt":0.2412229570264522,"score_spread":0.22911680473293541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072837011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24680537,0.00003607332,0.7467671,0.0009534034,0.0003985759,0.000047815938,8.106546e-8,0.00010523122,0.0048863096],"genre_scores_gemma":[0.95386636,0.0000053310773,0.044935636,0.0009774955,0.00018705541,1.7226603e-7,7.641939e-8,0.000009695682,0.000018164767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983804,0.00036826116,0.00042421275,0.00013983886,0.0004453614,0.00024192304],"domain_scores_gemma":[0.99834824,0.00075390947,0.00026238075,0.00041568378,0.00014236777,0.00007740543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002812071,0.00013815584,0.00019566005,0.00017781144,0.00030999372,0.00012192798,0.0013092408,0.000039118422,0.0000035167393],"category_scores_gemma":[0.00021672236,0.000085158754,0.000100049125,0.00025154755,0.000030742354,0.00010769341,0.00018157292,0.00042037826,0.000019740119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018945335,0.000096590295,0.000072369614,0.0000040359514,0.000016309894,0.000004716988,0.0023812703,0.94643736,0.00027318957,0.024388006,0.0011293553,0.02517784],"study_design_scores_gemma":[0.00035178315,0.0007856864,0.0009342473,0.00023244788,0.0000064196092,0.00017303499,0.00006237042,0.99156827,0.0024237027,0.0018218774,0.0014674194,0.00017276604],"about_ca_topic_score_codex":0.0000029823689,"about_ca_topic_score_gemma":6.687878e-8,"teacher_disagreement_score":0.707061,"about_ca_system_score_codex":0.000045598827,"about_ca_system_score_gemma":0.00003169321,"threshold_uncertainty_score":0.34726733},"labels":[],"label_agreement":null},{"id":"W2072873664","doi":"10.1145/2818374","title":"Reuse Distance-Based Probabilistic Cache Replacement","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency","keywords":"Computer science; Cache; Overhead (engineering); Reuse; Probabilistic logic; Spec#; CPU cache; Dram; Parallel computing; Cache algorithms; Operating system; Computer hardware; Programming language; Artificial intelligence","score_opus":0.025274851090280555,"score_gpt":0.25576089299935606,"score_spread":0.2304860419090755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072873664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019189922,0.00006438932,0.99398965,0.004233802,0.00011175625,0.00030165343,0.000009362329,0.00057473767,0.0005227565],"genre_scores_gemma":[0.20048562,0.000027375756,0.79855853,0.0006173129,0.00001768845,0.00005885995,0.000016234377,0.000014867654,0.00020351903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00012257173,0.0002301495,0.00043811018,0.00025868378,0.00019481097],"domain_scores_gemma":[0.9984189,0.000108465516,0.000086188345,0.0011031516,0.00013033487,0.00015296045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025100724,0.000179111,0.00014638058,0.00017623312,0.00021421944,0.00014212796,0.0006415807,0.00007790705,0.000008594051],"category_scores_gemma":[0.00014481497,0.00016101054,0.000043995507,0.00041811398,0.000053950534,0.000149747,0.000028365794,0.00018701411,0.0000033564547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000584473,0.00008593331,0.000012743853,0.000009810593,0.000008539714,0.0000013989388,0.00042582353,0.98194736,0.0000041482003,0.0005128215,0.00024323104,0.016689714],"study_design_scores_gemma":[0.00066610734,0.0003333464,0.000013434028,0.000038256854,0.000015577094,0.00001090168,0.000013072742,0.9896565,0.0005194224,0.00577818,0.0027373554,0.0002178613],"about_ca_topic_score_codex":0.00000877176,"about_ca_topic_score_gemma":0.000016625952,"teacher_disagreement_score":0.20029372,"about_ca_system_score_codex":0.00006989957,"about_ca_system_score_gemma":0.000107249776,"threshold_uncertainty_score":0.65658194},"labels":[],"label_agreement":null},{"id":"W2073148582","doi":"10.1145/350391.350400","title":"Optimizing software performance for IP frame reassembly in an integrated architecture","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University","keywords":"Citation; Queen (butterfly); Architecture; Computer science; Frame (networking); Library science; Software; World Wide Web; Telecommunications; Archaeology; History; Operating system","score_opus":0.015705443786451657,"score_gpt":0.260902229381288,"score_spread":0.24519678559483632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073148582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694709,0.000029570023,0.9505913,0.00021157904,0.00003932602,0.00021489234,0.0000010888742,0.0010308845,0.00093427044],"genre_scores_gemma":[0.20113873,0.00001745262,0.7977719,0.0004442947,0.000022036553,0.000029998879,0.00000977248,0.0000100077095,0.0005558482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895215,0.000049882998,0.00022111087,0.00037043242,0.00011645336,0.0002899988],"domain_scores_gemma":[0.99933356,0.00006789455,0.00003950483,0.00040889336,0.00007804171,0.000072115676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002430569,0.00014411489,0.00015399753,0.00015174139,0.00010801539,0.0001596851,0.00073418807,0.00009295302,0.000029881066],"category_scores_gemma":[0.000029066243,0.00012297674,0.000040482766,0.0004252574,0.000019037412,0.00042809045,0.000048956186,0.00017588132,0.000008436204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025888794,0.000067311594,0.0005005864,0.000013586674,0.0000033536269,0.0000019900103,0.00077696476,0.3708955,0.00003651533,0.0009815965,0.00035626712,0.62634045],"study_design_scores_gemma":[0.00026859238,0.00019606898,0.0007553945,0.00005421181,0.0000012027158,0.000008160941,0.0000088999295,0.99220544,0.0012710402,0.0013002381,0.0037086185,0.00022211642],"about_ca_topic_score_codex":0.000029157703,"about_ca_topic_score_gemma":0.000017083086,"teacher_disagreement_score":0.6261183,"about_ca_system_score_codex":0.00003321573,"about_ca_system_score_gemma":0.000055594635,"threshold_uncertainty_score":0.5014846},"labels":[],"label_agreement":null},{"id":"W2073600756","doi":"10.1145/2423636.2423642","title":"Thermal-aware task scheduling in 3D chip multiprocessor with real-time constrained workloads","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Multiprocessing; Scheduling (production processes); Parallel computing; Computation; Chip; Dynamic priority scheduling; Fair-share scheduling; Distributed computing; Architecture; Multiprocessor scheduling; Embedded system; Two-level scheduling; Real-time computing; Algorithm; Computer network; Quality of service","score_opus":0.01219602355206222,"score_gpt":0.24110957793381363,"score_spread":0.2289135543817514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073600756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054069217,0.000062160245,0.9411585,0.0003617304,0.00024824546,0.0008104433,0.0000027099866,0.0017226633,0.0015643263],"genre_scores_gemma":[0.6886196,0.000011162878,0.31096074,0.000131067,0.000051954205,0.0000685024,0.0000037963027,0.000032057058,0.00012108087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699587,0.00032613412,0.0007287847,0.00083613815,0.00046531274,0.00064776925],"domain_scores_gemma":[0.99735564,0.00062104187,0.0003066618,0.0011886792,0.0003557381,0.00017221189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006216327,0.0004165533,0.0005061471,0.00045945626,0.0003986297,0.00051580375,0.0014412856,0.00019632744,0.00001559766],"category_scores_gemma":[0.000054155873,0.00037050954,0.00009363216,0.0011669707,0.000096847805,0.0005715526,0.000042380707,0.00048206205,0.00012819954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001648007,0.0001666696,0.00007295457,0.000042878553,0.000048851598,0.000016960876,0.0015012053,0.9766902,0.0006072977,0.00014942962,0.000029364985,0.020657705],"study_design_scores_gemma":[0.00094412797,0.00017556493,0.00016155858,0.0006821894,0.000011172434,0.000056663648,0.0003636073,0.99654055,0.0005257123,0.00004712224,0.000023188652,0.00046854906],"about_ca_topic_score_codex":0.00040921703,"about_ca_topic_score_gemma":0.0000040906334,"teacher_disagreement_score":0.6345504,"about_ca_system_score_codex":0.00014016149,"about_ca_system_score_gemma":0.00014692922,"threshold_uncertainty_score":0.9998747},"labels":[],"label_agreement":null},{"id":"W2074053393","doi":"10.1109/scam.2010.20","title":"Effective Static Analysis to Find Concurrency Bugs in Java","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Concurrency; Programming language; Static analysis; Java; Control flow; Debugging; False positive paradox; Parallel computing","score_opus":0.00575402126802529,"score_gpt":0.27716417252479997,"score_spread":0.2714101512567747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074053393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085113846,0.000004853076,0.9095103,0.00036290687,0.00010540139,0.00018173167,6.548563e-7,0.00023738007,0.004482895],"genre_scores_gemma":[0.7237181,0.0000010161898,0.275676,0.00028844064,0.000009192416,0.000018693352,0.0000012558793,0.0000022391562,0.00028500546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991719,0.000058581118,0.00017102514,0.0002947011,0.00012932294,0.0001744473],"domain_scores_gemma":[0.99928737,0.00015926616,0.000039381786,0.00036279616,0.00007159471,0.000079575286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032654815,0.000087589964,0.00016105825,0.00043097162,0.000039236158,0.00009005678,0.0004928563,0.000040771203,0.000045679513],"category_scores_gemma":[0.00010490214,0.00007730677,0.00004936559,0.0016823049,0.000014776839,0.00013918085,0.00014464525,0.00014638505,0.0000524495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020539728,0.0006965903,0.090976536,0.000034073168,0.00043830197,0.00004592719,0.010642105,0.14246131,0.006519552,0.21705309,0.018029433,0.5130825],"study_design_scores_gemma":[0.00019613022,0.00008707133,0.072244525,0.0000059327785,0.000015768144,0.0000012772877,0.000007664238,0.9202488,0.0038248114,0.0025345078,0.0006130335,0.0002204788],"about_ca_topic_score_codex":0.00014523194,"about_ca_topic_score_gemma":0.00012479775,"teacher_disagreement_score":0.7777875,"about_ca_system_score_codex":0.000016012473,"about_ca_system_score_gemma":0.000027840422,"threshold_uncertainty_score":0.31524786},"labels":[],"label_agreement":null},{"id":"W2074297515","doi":"10.1145/1739025.1739031","title":"Investigating the impact of code generation on performance characteristics of integer programs","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Compiler; Computer science; Benchmark (surveying); Parallel computing; Computer architecture; Workload; Optimizing compiler; Spec#; Cache; Very long instruction word; Software; Multi-core processor; Operating system; Programming language","score_opus":0.033636837043709775,"score_gpt":0.289603023303811,"score_spread":0.2559661862601012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074297515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.684932,0.00000105405,0.31403565,0.000060903658,0.000058708316,0.000076955424,5.1517407e-7,0.000070317634,0.00076387875],"genre_scores_gemma":[0.8944916,0.000003005597,0.1053808,0.00003902514,0.000034950077,0.0000040772893,0.0000035021471,0.0000030355393,0.000039967723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.000027395703,0.00021569118,0.00010508493,0.00012063976,0.00008546249],"domain_scores_gemma":[0.99928445,0.000035353274,0.00018662756,0.00032079645,0.00014799795,0.00002477746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031065333,0.00006687228,0.00009381195,0.000040097817,0.000055628432,0.000039903207,0.00039017448,0.000035543897,0.0000041526355],"category_scores_gemma":[0.00006607635,0.000038333532,0.000041196985,0.00017765378,0.000067534325,0.00011002072,0.00006630629,0.00013205937,0.0000015321265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001018607,0.00047253407,0.14062616,0.000065503504,0.000063619475,4.6981208e-7,0.0038345156,0.025284316,0.16578397,0.10352752,0.0023295828,0.55800164],"study_design_scores_gemma":[0.000040025167,0.00018703309,0.016457967,0.000016271484,9.975855e-7,0.0000017370277,0.0000018427602,0.93737173,0.045748953,0.00010718512,0.000018378098,0.000047884627],"about_ca_topic_score_codex":0.000031593143,"about_ca_topic_score_gemma":0.0000024793121,"teacher_disagreement_score":0.9120874,"about_ca_system_score_codex":0.0000068606823,"about_ca_system_score_gemma":0.000050082777,"threshold_uncertainty_score":0.1563196},"labels":[],"label_agreement":null},{"id":"W2074688378","doi":"10.1007/s11227-009-0294-5","title":"Analyzing and enhancing the parallel sort operation on multithreaded architectures","year":2009,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Multithreading; Parallel computing; Quicksort; sort; Simultaneous multithreading; Parallelism (grammar); Sorting algorithm; Computer architecture; Thread (computing); Operating system","score_opus":0.015821519187792784,"score_gpt":0.26317924726198616,"score_spread":0.24735772807419337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074688378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29809636,0.00033080272,0.6983079,0.0029653693,0.00006924264,0.0000677748,6.621535e-8,0.000051213086,0.00011132438],"genre_scores_gemma":[0.90348923,0.000056575303,0.09541252,0.0008475059,0.00018084323,2.0464643e-7,1.7518846e-7,0.0000045975053,0.000008369735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987582,0.00026174716,0.00042035177,0.00012530874,0.00024124916,0.00019314435],"domain_scores_gemma":[0.99896276,0.00043709294,0.00019744401,0.00025384314,0.00009982006,0.000049065893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018886634,0.00012829066,0.00017670407,0.000119360084,0.0005178781,0.00020164363,0.0007361689,0.00003468032,0.0000010758292],"category_scores_gemma":[0.000106893116,0.00006646084,0.00006250413,0.00019824489,0.000043411652,0.0001623955,0.00009336206,0.0003830954,0.0000012222268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036329235,0.000056392746,0.00045334667,0.000005956921,0.0000395265,0.000010459891,0.009849861,0.8472196,0.0063090795,0.0045157834,0.00030901947,0.13119465],"study_design_scores_gemma":[0.0005064513,0.0005059135,0.012143731,0.0002160378,0.000027520942,0.0005245126,0.0002615167,0.97144246,0.009015399,0.005014994,0.00011074786,0.0002307153],"about_ca_topic_score_codex":0.000011789067,"about_ca_topic_score_gemma":0.000002726436,"teacher_disagreement_score":0.6053929,"about_ca_system_score_codex":0.000023448449,"about_ca_system_score_gemma":0.000037097758,"threshold_uncertainty_score":0.3983152},"labels":[],"label_agreement":null},{"id":"W2075160498","doi":"10.1109/fpt.2013.6718365","title":"From software threads to parallel hardware in high-level synthesis for FPGAs","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"POSIX Threads; Computer science; Parallel computing; Semaphore; Thread (computing); Software; Field-programmable gate array; Task parallelism; Automatic parallelization; Data parallelism; Parallelism (grammar); Embedded system; Operating system","score_opus":0.03140508862409133,"score_gpt":0.2608867193519302,"score_spread":0.22948163072783886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075160498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051266234,0.000021918297,0.98980474,0.0031066171,0.00012525002,0.00053455075,0.000014175759,0.0007979928,0.00046810394],"genre_scores_gemma":[0.1183366,0.0000044666153,0.8790646,0.0010245907,0.000054695312,0.0004204336,0.0000075415214,0.000013246864,0.0010738274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987108,0.00004337034,0.0002707883,0.00048346975,0.0001687602,0.00032279344],"domain_scores_gemma":[0.9986775,0.00044414293,0.00005422476,0.00055270374,0.00014938659,0.00012204916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016891856,0.00016382184,0.00023240014,0.00016529483,0.00007879724,0.00021480973,0.0009732719,0.00008871998,0.00010350486],"category_scores_gemma":[0.00026896328,0.00014447272,0.00006144653,0.00030081812,0.000012943669,0.0003562442,0.00026073368,0.00006894484,0.00018222253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003272553,0.00038329235,0.00622243,0.00005205992,0.00007192996,0.000009958343,0.002244364,0.089102864,0.0002826727,0.046567157,0.38388234,0.47114822],"study_design_scores_gemma":[0.0012168718,0.00023119777,0.048751384,0.00029742753,0.000014517257,0.000004000567,0.00009272774,0.74099106,0.01645509,0.18319523,0.0071771936,0.0015732775],"about_ca_topic_score_codex":0.0017658044,"about_ca_topic_score_gemma":0.000071854156,"teacher_disagreement_score":0.65188825,"about_ca_system_score_codex":0.000046064077,"about_ca_system_score_gemma":0.000040955107,"threshold_uncertainty_score":0.5891427},"labels":[],"label_agreement":null},{"id":"W2075413878","doi":"10.1109/fpt.2010.5681447","title":"A configurable framework for investigating workload execution","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx; CMC Microsystems","keywords":"Computer science; Software; Field-programmable gate array; Embedded system; Workload; Interface (matter); Block (permutation group theory); Computer architecture; Operating system; Computer hardware","score_opus":0.022746315642642442,"score_gpt":0.29002009659766925,"score_spread":0.2672737809550268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075413878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002062031,0.000017830544,0.9865424,0.0012507329,0.00032593837,0.00017131232,3.0475397e-7,0.0009774322,0.00865199],"genre_scores_gemma":[0.21782984,0.0000023170714,0.7810336,0.0007253673,0.00006487476,0.000028360248,9.889071e-7,0.000004563296,0.0003101086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993127,0.000016261425,0.00015104104,0.00023384788,0.00009584504,0.00019029611],"domain_scores_gemma":[0.9992081,0.00020579678,0.00007135528,0.0003389295,0.00010289532,0.00007293593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029669525,0.00008089518,0.000086255444,0.00005378931,0.00017854618,0.00018574118,0.000462847,0.00010119962,0.000015680587],"category_scores_gemma":[0.00034248532,0.000074182484,0.000039507588,0.00022924611,0.0000332458,0.00020868258,0.0000645688,0.00018817386,0.000013443814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.0511254e-7,0.000012277194,0.00011347846,0.000004615133,0.0000026915925,1.8748352e-7,0.00012695974,0.0003705172,0.0021517377,0.97666967,0.0028421483,0.017705],"study_design_scores_gemma":[0.000117172036,0.00003907634,0.00011567372,0.000040627892,0.0000017171659,0.0000049319133,0.000008259665,0.57267356,0.031927686,0.3894044,0.0054941056,0.00017279897],"about_ca_topic_score_codex":0.000011428388,"about_ca_topic_score_gemma":0.0000024215906,"teacher_disagreement_score":0.5872653,"about_ca_system_score_codex":0.0000067728583,"about_ca_system_score_gemma":0.0000443166,"threshold_uncertainty_score":0.3025074},"labels":[],"label_agreement":null},{"id":"W2075815517","doi":"10.1142/s0129626401000506","title":"DYNAMIC LOAD BALANCERS FOR A MULTITHREADED MULTIPROCESSOR SYSTEM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Load balancing (electrical power); Multiprocessing; Synchronization (alternating current); Compiler; Compile time; Distributed computing; Runtime system; Operating system; Grid; Computer network","score_opus":0.016301869036382956,"score_gpt":0.2668241556119236,"score_spread":0.2505222865755406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075815517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005143325,0.0005116219,0.98793334,0.0029024428,0.00022683837,0.0005191013,0.0000022173435,0.0021478073,0.00061330455],"genre_scores_gemma":[0.49986145,0.00001746222,0.49828896,0.0013783947,0.000052577427,0.00017231521,0.000007190212,0.000027717897,0.00019393055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977028,0.000051435727,0.00044181867,0.00076647254,0.0004011576,0.0006363649],"domain_scores_gemma":[0.99873376,0.000091763635,0.00030113975,0.00048146702,0.00025934688,0.00013250932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004189235,0.00032260187,0.00034479657,0.00016789616,0.00044272366,0.00041033287,0.0011457521,0.00011027829,0.0000016059091],"category_scores_gemma":[0.000064259504,0.0003088197,0.00012492567,0.00053464563,0.00008048406,0.00064355694,0.000118292606,0.00017118918,0.000026363972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064094097,0.0006517097,0.0034440055,0.0037377644,0.00027144043,0.00020273612,0.011570903,0.6616376,0.019557659,0.0037867958,0.025939146,0.26855928],"study_design_scores_gemma":[0.0011208785,0.000040669034,0.0001705212,0.00022874663,0.000012381444,0.000058014146,0.0000603694,0.99437547,0.00024381491,0.00011381391,0.0031388951,0.00043643903],"about_ca_topic_score_codex":0.000031916778,"about_ca_topic_score_gemma":0.0000058219443,"teacher_disagreement_score":0.49471813,"about_ca_system_score_codex":0.0003456721,"about_ca_system_score_gemma":0.00016142592,"threshold_uncertainty_score":0.9999364},"labels":[],"label_agreement":null},{"id":"W2075843361","doi":"10.1109/mm.2014.3","title":"Kabini: An AMD Accelerated Processing Unit System on A Chip","year":2014,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Embedded system; x86; Central processing unit; Multi-core processor; Computer hardware; Chip; Efficient energy use; Operating system; Software; Electrical engineering; Telecommunications; Engineering","score_opus":0.03830314710420459,"score_gpt":0.2811050205506671,"score_spread":0.2428018734464625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075843361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11888394,0.000022584863,0.8735784,0.00011780159,0.00022961985,0.00011260614,6.5507305e-7,0.0016139941,0.00544038],"genre_scores_gemma":[0.920071,0.0000011849397,0.07914454,0.00043850392,0.00011219203,0.000007789617,0.0000031717855,0.000013832403,0.00020777681],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989128,0.00014589158,0.00019845301,0.00036495045,0.00014273415,0.00023514435],"domain_scores_gemma":[0.99918497,0.000032955566,0.00011029671,0.000465005,0.00012127462,0.00008552429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033024373,0.00014278777,0.00015224042,0.00012722013,0.00021478887,0.00034407125,0.0007777236,0.000073386545,0.0000017386284],"category_scores_gemma":[0.000013443828,0.00012976225,0.000029978393,0.00037817133,0.000022721426,0.0002547842,0.00005090398,0.00013257685,0.00005938209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120369135,0.0012153337,0.0018062802,0.0007375768,0.00008012072,0.00007259777,0.007427151,0.09150457,0.23158324,0.0566617,0.024190908,0.58460015],"study_design_scores_gemma":[0.0003102169,0.00021485,0.00037154663,0.00018737467,0.0000036910758,0.00002612742,0.000014830334,0.85692036,0.13811626,0.00020476773,0.0033341923,0.00029581267],"about_ca_topic_score_codex":0.000015569718,"about_ca_topic_score_gemma":0.0000015120418,"teacher_disagreement_score":0.8011871,"about_ca_system_score_codex":0.000034335197,"about_ca_system_score_gemma":0.000049561848,"threshold_uncertainty_score":0.52915514},"labels":[],"label_agreement":null},{"id":"W2076675157","doi":"10.1145/2540708.2540735","title":"The reuse cache","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"FP7 Information and Communication Technologies; European Social Fund; European Regional Development Fund; Seventh Framework Programme; Leukemia and Lymphoma Society of Canada","keywords":"Cache; Reuse; Computer science; Cache pollution; Cache algorithms; Cache invalidation; Cache coloring; Parallel computing; CPU cache; Engineering","score_opus":0.011872644776595168,"score_gpt":0.23270416970323124,"score_spread":0.22083152492663607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076675157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041123043,0.000036525995,0.94183785,0.0074246726,0.00006685742,0.00006490195,1.2104334e-8,0.00055926613,0.049598712],"genre_scores_gemma":[0.4161037,0.00003349876,0.5768287,0.0010233885,0.000025587033,0.00002035353,1.7331111e-7,0.0000030301176,0.0059615267],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962497,0.000027049831,0.0000723641,0.00009430068,0.000073263276,0.00010806414],"domain_scores_gemma":[0.99917126,0.00010803106,0.000019975067,0.0006363791,0.0000361227,0.000028260727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010214292,0.000036227906,0.000028045217,0.000013663025,0.00016572498,0.00025884598,0.0011530073,0.000015668782,0.000013336894],"category_scores_gemma":[0.00008954947,0.000019927453,0.000016351782,0.00011445994,0.000016816542,0.00016365714,0.00028581882,0.000040982213,0.00017189806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.973193e-7,0.000018029592,0.00020317982,7.965393e-7,0.000006529986,7.3463826e-7,0.0002782281,0.00062818517,0.00019566665,0.3599448,0.49319646,0.1455271],"study_design_scores_gemma":[0.00007418377,0.000030060424,0.0015142444,0.000004215806,5.9998814e-7,0.00000613116,0.000012992422,0.9020523,0.006465066,0.04729315,0.04240984,0.00013724012],"about_ca_topic_score_codex":0.000050173912,"about_ca_topic_score_gemma":8.5673884e-7,"teacher_disagreement_score":0.9014241,"about_ca_system_score_codex":0.000004090347,"about_ca_system_score_gemma":0.000011521021,"threshold_uncertainty_score":0.24960576},"labels":[],"label_agreement":null},{"id":"W2077845927","doi":"10.1145/2775052.2661090","title":"Using JavaScript and WebCL for numerical computations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Computation; Code (set theory); Web application; Variety (cybernetics); Rich Internet application; World Wide Web; Artificial intelligence","score_opus":0.05326982129687474,"score_gpt":0.31206418318978846,"score_spread":0.2587943618929137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077845927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006494258,0.000070434624,0.9917233,0.00061246386,0.0001511299,0.00011401314,0.0000018077526,0.00031387483,0.0005187039],"genre_scores_gemma":[0.44913694,0.0000017664337,0.55047864,0.00030662003,0.000046187877,0.0000033010904,0.000002851598,0.0000044733447,0.000019218329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927586,0.000055098455,0.00014891333,0.00025435197,0.00009823257,0.00016756322],"domain_scores_gemma":[0.99897546,0.0004917689,0.00008398781,0.00031808988,0.00006644712,0.00006425843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022331566,0.000092067254,0.00012841937,0.000072149516,0.00021134222,0.0001858416,0.0005195422,0.00004070136,0.0000015252541],"category_scores_gemma":[0.00025889254,0.00008674201,0.000028070626,0.00013608756,0.000030392386,0.00022570684,0.00018690692,0.000051112966,0.0000040331097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039310362,0.00031032,0.011679666,0.00026901645,0.00013436448,0.0000071002983,0.004219708,0.38793066,0.0012845896,0.36726707,0.020234607,0.20662357],"study_design_scores_gemma":[0.00017442381,0.00006606953,0.00066164974,0.000014511659,0.000007870836,0.000006340837,0.000007213819,0.9863313,0.00025376343,0.00721518,0.0051363856,0.000125291],"about_ca_topic_score_codex":0.000023754628,"about_ca_topic_score_gemma":0.0000014383957,"teacher_disagreement_score":0.59840065,"about_ca_system_score_codex":0.000009251882,"about_ca_system_score_gemma":0.000018323974,"threshold_uncertainty_score":0.35372365},"labels":[],"label_agreement":null},{"id":"W2078536718","doi":"10.1016/j.jpdc.2014.09.014","title":"Hybrid parallel task placement in irregular applications","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Locality; Computer science; Speedup; Scheduling (production processes); Asynchronous communication; Parallel computing; Load balancing (electrical power); Distributed computing; Computer network","score_opus":0.009939898745951825,"score_gpt":0.2466919551668542,"score_spread":0.23675205642090236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078536718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011449442,0.00044723216,0.9867349,0.0006650407,0.00009309819,0.00015325293,0.0000026505213,0.000095668634,0.0003586726],"genre_scores_gemma":[0.7603792,0.000059230886,0.23924804,0.000167022,0.00011035845,0.000004149372,0.000009250511,0.000006734517,0.000016050446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815065,0.00016435258,0.0007743952,0.00028391377,0.00030069333,0.00032597498],"domain_scores_gemma":[0.99858457,0.00020297607,0.0005581328,0.0002967539,0.00018789437,0.00016968687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301957,0.00018915659,0.00037062346,0.00022394604,0.00017337891,0.00017870429,0.0006906918,0.000058589394,0.0000027953586],"category_scores_gemma":[0.000076227676,0.00017239597,0.00009302495,0.0003265735,0.000049249225,0.00024920513,0.00025813203,0.00028319412,0.000004450199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004206783,0.00031170115,0.00460522,0.000050270028,0.000053244534,0.00004329904,0.0003102172,0.8990212,0.000099384524,0.049880523,0.0047363164,0.040846538],"study_design_scores_gemma":[0.0013837036,0.00018996852,0.004965505,0.00010456602,0.000011915403,0.00025129959,0.00003338341,0.9672162,0.00005444798,0.013538163,0.011969476,0.00028136006],"about_ca_topic_score_codex":0.0000056413123,"about_ca_topic_score_gemma":6.065672e-7,"teacher_disagreement_score":0.74892974,"about_ca_system_score_codex":0.000060842583,"about_ca_system_score_gemma":0.00006198596,"threshold_uncertainty_score":0.7030104},"labels":[],"label_agreement":null},{"id":"W2078646778","doi":"10.1145/2697394","title":"Towards Write-Activity-Aware Page Table Management for Non-volatile Main Memories","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; Hong Kong Polytechnic University; National Natural Science Foundation of China","keywords":"Computer science; Dram; Phase-change memory; Embedded system; Android (operating system); Power consumption; Operating system; Table (database); Computer hardware; Database; Power (physics); Phase change","score_opus":0.03562411689031396,"score_gpt":0.2885269962013684,"score_spread":0.25290287931105443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078646778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017053221,0.000054007116,0.99094176,0.0003157588,0.0018790324,0.0011064728,0.00002558403,0.001447323,0.0025247382],"genre_scores_gemma":[0.6878132,0.00000796691,0.31063488,0.00010110491,0.00011624266,0.0001239038,0.000008931695,0.000034646,0.0011591349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973534,0.00018695678,0.0005271419,0.00079157366,0.0005391331,0.0006018224],"domain_scores_gemma":[0.99750775,0.00026135278,0.0002509349,0.0014552674,0.00029244562,0.00023226292],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010905457,0.00037330677,0.0004729735,0.00034952472,0.00058000704,0.000549669,0.001526555,0.00015625198,0.0000028358345],"category_scores_gemma":[0.000036408477,0.0003803728,0.00016036126,0.00085619884,0.000044990633,0.0004444134,0.0000897825,0.0002661859,0.0000237801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011184432,0.00055108615,0.000023576324,0.0004655819,0.00029923386,0.00003734119,0.004166148,0.88227654,0.00015149741,0.005399965,0.014597037,0.091920145],"study_design_scores_gemma":[0.0010327302,0.0003025624,0.000018980092,0.00020595963,0.000028320826,0.00003458636,0.0005088668,0.9910018,0.0019670795,0.001237788,0.003196188,0.00046512802],"about_ca_topic_score_codex":0.00010315539,"about_ca_topic_score_gemma":0.0000041995645,"teacher_disagreement_score":0.6861079,"about_ca_system_score_codex":0.0002700517,"about_ca_system_score_gemma":0.00016568245,"threshold_uncertainty_score":0.9998648},"labels":[],"label_agreement":null},{"id":"W2078994750","doi":"10.1109/iiswc.2010.5650274","title":"A characterization of the Rodinia benchmark suite with comparison to contemporary CMP workloads","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":296,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; George Mason University; Nvidia; National Science Foundation","keywords":"Rodinia; Benchmark (surveying); Parsec; Suite; Computer science; Parallel computing","score_opus":0.01421237094159148,"score_gpt":0.24614613091641613,"score_spread":0.23193375997482465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078994750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24976355,0.0000033687263,0.74219,0.0010779271,0.00017594482,0.00022736263,0.0000010415438,0.00020320066,0.006357591],"genre_scores_gemma":[0.8979097,6.0840176e-7,0.1011417,0.000473669,0.000024284782,0.000009265413,0.000003486942,0.000005232992,0.00043202774],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916196,0.000046797,0.00023540195,0.00022097208,0.00020879185,0.00012608289],"domain_scores_gemma":[0.99903905,0.00003797581,0.00015566284,0.0005718778,0.00013415387,0.00006128228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022085084,0.00010016929,0.00015034481,0.00007596863,0.00009001377,0.0000860385,0.0008054355,0.000049579765,0.0000143413745],"category_scores_gemma":[0.000023983486,0.00006221854,0.00003256155,0.0005855313,0.00004015415,0.0002004363,0.00021537794,0.00014372326,0.00000559224],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013461159,0.0007038887,0.37588954,0.00005960228,0.000080441416,0.000004595504,0.0065081175,0.004381895,0.44600186,0.11299049,0.017917888,0.03532706],"study_design_scores_gemma":[0.0007253305,0.00045040852,0.31837967,0.00018864543,0.0000091948195,0.000016275351,0.000028849077,0.29712462,0.3608527,0.0005282926,0.021028504,0.00066750817],"about_ca_topic_score_codex":0.000025453566,"about_ca_topic_score_gemma":0.000019186313,"teacher_disagreement_score":0.64814615,"about_ca_system_score_codex":0.0000062302684,"about_ca_system_score_gemma":0.000076106015,"threshold_uncertainty_score":0.25371984},"labels":[],"label_agreement":null},{"id":"W2079248286","doi":"10.1109/micro.2014.62","title":"Managing GPU Concurrency in Heterogeneous Architectures","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Computer science; Parallel computing; Central processing unit; Concurrency; Multi-core processor; CUDA; Thread (computing); Performance improvement; Shared memory; Symmetric multiprocessor system; CPU shielding; Computer architecture; Embedded system; Distributed computing; Operating system","score_opus":0.011417590745866813,"score_gpt":0.25096388773620676,"score_spread":0.23954629699033994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079248286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052734567,0.00005171605,0.9711633,0.00055325596,0.00008559949,0.000054374075,5.8728364e-8,0.0005334894,0.022284761],"genre_scores_gemma":[0.8373462,0.000008323603,0.16192578,0.0005932139,0.000019189265,0.000003975378,3.92869e-7,0.000003441432,0.000099482386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992881,0.00007024412,0.00014035622,0.00023105994,0.000095514966,0.00017472453],"domain_scores_gemma":[0.9995659,0.00005614273,0.00003189893,0.0002913173,0.000016555492,0.00003819863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015793486,0.000078727506,0.00009214325,0.00014024696,0.000039422695,0.00007220073,0.0005126828,0.000025331996,0.00000782649],"category_scores_gemma":[0.000023800856,0.00006944357,0.000026940861,0.00019184947,0.000015056572,0.000045075478,0.00015207121,0.00007716585,0.000015876569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026597204,0.000056606477,0.0034949703,0.000016451215,0.0000059330496,0.000012976311,0.0005465541,0.2398456,0.00007908254,0.10595983,0.0011195351,0.6488598],"study_design_scores_gemma":[0.00012588633,0.00003664442,0.00039099192,0.000013438269,4.0230867e-7,0.00001246772,0.0000012492002,0.96578175,0.0018507551,0.030147206,0.0015124355,0.00012676971],"about_ca_topic_score_codex":0.000040828567,"about_ca_topic_score_gemma":0.000017327102,"teacher_disagreement_score":0.83207273,"about_ca_system_score_codex":0.000010827778,"about_ca_system_score_gemma":0.000008730796,"threshold_uncertainty_score":0.28318268},"labels":[],"label_agreement":null},{"id":"W2079432487","doi":"10.1109/icsamos.2009.5289240","title":"A physical-level study of the compacted matrix instruction scheduler for dynamically-scheduled superscalar processors","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Latency (audio); Parallel computing; Energy (signal processing); Embedded system; Operating system","score_opus":0.021319642758641674,"score_gpt":0.29674540728133864,"score_spread":0.27542576452269696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079432487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48279485,0.0000023779958,0.51575696,0.00053847855,0.00004422957,0.00047479768,0.0000010272402,0.00023472866,0.0001525428],"genre_scores_gemma":[0.8194689,4.4470735e-7,0.18027008,0.0000929117,0.00002855296,0.000015269225,0.0000013533379,0.0000054104676,0.000117055315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988875,0.00007342062,0.00027176968,0.00030473238,0.00027154788,0.00019102509],"domain_scores_gemma":[0.9989759,0.00006979253,0.000141,0.00048392493,0.00028232613,0.00004710105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016792434,0.00014305291,0.00022560028,0.00008695439,0.00015716732,0.00006959124,0.0008468241,0.000051789964,0.0000017104445],"category_scores_gemma":[0.000094145675,0.000095363015,0.00009620949,0.00064624334,0.000033140357,0.00023900485,0.00010140869,0.00011413995,0.0000012417715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005196373,0.023542775,0.010156473,0.00029453213,0.000533448,0.0000035413457,0.029649507,0.31891462,0.037773054,0.48556983,0.004946621,0.08809597],"study_design_scores_gemma":[0.0011358884,0.00048748002,0.010477673,0.000018196197,0.000013853915,0.0000029843648,0.00015277784,0.9759782,0.0071707848,0.0043856036,0.00002195841,0.00015458085],"about_ca_topic_score_codex":0.000015823702,"about_ca_topic_score_gemma":0.0000032997143,"teacher_disagreement_score":0.6570636,"about_ca_system_score_codex":0.00002980108,"about_ca_system_score_gemma":0.000051740753,"threshold_uncertainty_score":0.3888791},"labels":[],"label_agreement":null},{"id":"W2079621909","doi":"10.1109/fpl.2013.6645537","title":"TputCache: High-frequency, multi-way cache for high-throughput FPGA applications","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Throughput; Cache; Bandwidth (computing); Field-programmable gate array; Parallel computing; Latency (audio); Memory bandwidth; Embedded system; High memory; Computer architecture; Computer network; Operating system; Wireless","score_opus":0.02504517517679481,"score_gpt":0.27242243760195256,"score_spread":0.24737726242515776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079621909","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004166472,0.00009426993,0.992539,0.0026843776,0.00015089166,0.0012015667,0.000006344964,0.0016494875,0.00125743],"genre_scores_gemma":[0.27485067,0.000018517372,0.7217536,0.000730369,0.00008437856,0.00090138207,0.00002581686,0.000015574535,0.00161969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842954,0.000053287287,0.00035856353,0.000587182,0.0001831063,0.0003883507],"domain_scores_gemma":[0.9983454,0.00015996605,0.00013347018,0.00092073035,0.00031276353,0.00012766565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002531887,0.00020792593,0.00021539477,0.000115019306,0.00028633562,0.0002690959,0.0012231682,0.0001288147,0.0000658141],"category_scores_gemma":[0.0000405527,0.00018267322,0.00007998588,0.00040887194,0.000057442187,0.0005423222,0.0002429622,0.00012246956,0.0002834577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019256727,0.00041853116,0.0003238373,0.00004803901,0.000058837617,0.0000011094594,0.00038075141,0.004071527,0.0019791385,0.83561677,0.07132703,0.08577249],"study_design_scores_gemma":[0.0023589707,0.00029983206,0.0067784395,0.00003737615,0.000034196277,0.000021398206,0.000054697506,0.72675395,0.04923343,0.19455671,0.018204628,0.0016663616],"about_ca_topic_score_codex":0.0010587977,"about_ca_topic_score_gemma":0.000017466145,"teacher_disagreement_score":0.7226824,"about_ca_system_score_codex":0.000061954444,"about_ca_system_score_gemma":0.00007033459,"threshold_uncertainty_score":0.7449198},"labels":[],"label_agreement":null},{"id":"W2080019118","doi":"10.1145/2509136.2509543","title":"Interacting with dead objects","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Snapshot (computer storage); Debugging; Java; Programming language; Operating system; Architecture; Virtual machine; Memory leak; Code (set theory); Program code; Garbage collection","score_opus":0.010235053589780175,"score_gpt":0.23332366346398023,"score_spread":0.22308860987420007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080019118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049337326,0.0000064385717,0.92532116,0.0003759051,0.000049833434,0.00007246874,1.0872508e-8,0.00075301365,0.068487436],"genre_scores_gemma":[0.5415987,7.1328367e-7,0.45738974,0.00027671014,0.000008611368,0.0000060781476,1.4238124e-7,0.0000021482326,0.0007171633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955046,0.000017199673,0.00007659414,0.00015083674,0.000081694576,0.00012318623],"domain_scores_gemma":[0.99956787,0.00006361528,0.000035895468,0.00021856102,0.00007512036,0.000038918304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005494602,0.000057491874,0.000053595853,0.00004753933,0.000056833196,0.00019584334,0.00032580833,0.000015913447,0.00004433932],"category_scores_gemma":[0.000019210856,0.00003982571,0.000012080926,0.00016204303,0.000008707185,0.0004642606,0.00010058972,0.000056020064,0.0001400555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011633703,0.0003567568,0.015541887,0.000051474737,0.000100787816,0.000046852667,0.0069418116,0.027127739,0.0026539583,0.23534818,0.14351876,0.5683001],"study_design_scores_gemma":[0.00014913517,0.00011352024,0.0012828489,0.00004093544,0.0000010959693,0.000037865517,0.000050682665,0.98453254,0.010605393,0.0019628133,0.001005927,0.00021724359],"about_ca_topic_score_codex":0.000080012665,"about_ca_topic_score_gemma":0.0000034740108,"teacher_disagreement_score":0.9574048,"about_ca_system_score_codex":0.00000936442,"about_ca_system_score_gemma":0.000016207166,"threshold_uncertainty_score":0.18885218},"labels":[],"label_agreement":null},{"id":"W2080100638","doi":"10.1109/co-hpc.2014.8","title":"Toward Efficient Programmer-Managed Two-Level Memory Hierarchies in Exascale Computers","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Programmer; Computer architecture; Memory bandwidth; Memory management; Uniform memory access; Operating system; Parallel computing; Embedded system; Semiconductor memory","score_opus":0.02961016245181658,"score_gpt":0.2589172911774811,"score_spread":0.2293071287256645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080100638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076520024,0.000028619974,0.9755573,0.0009321698,0.00024531042,0.0002614354,2.9336493e-7,0.0010932076,0.014229624],"genre_scores_gemma":[0.52039415,0.0000027506082,0.47882116,0.00044147726,0.000029239522,0.000014777085,0.0000017955671,0.000006981147,0.00028764858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982827,0.00021173638,0.00031856057,0.00049753377,0.00028278166,0.00040670153],"domain_scores_gemma":[0.99904555,0.00016663392,0.00007663967,0.0005458705,0.000057385365,0.00010792798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075487065,0.00018306638,0.00023155531,0.0003300373,0.00010394971,0.00020499543,0.0010575139,0.000049627914,0.0000057788866],"category_scores_gemma":[0.000045041026,0.0001644289,0.00007148842,0.00063752395,0.000076584525,0.00014118488,0.000456612,0.00017735665,0.000032358606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009682725,0.00035300403,0.0007111621,0.000044939774,0.000015101502,0.000016722306,0.0023840114,0.33896127,0.000059615926,0.10760082,0.00278844,0.5470552],"study_design_scores_gemma":[0.0005307638,0.000074558644,0.0017091638,0.00003150478,0.0000014913179,0.000007117736,0.000019169991,0.9935221,0.00091306434,0.0017545067,0.001190159,0.0002463777],"about_ca_topic_score_codex":0.00012600428,"about_ca_topic_score_gemma":0.000019460436,"teacher_disagreement_score":0.65456086,"about_ca_system_score_codex":0.000041494543,"about_ca_system_score_gemma":0.000029561139,"threshold_uncertainty_score":0.6705216},"labels":[],"label_agreement":null},{"id":"W2080393180","doi":"10.1147/sj.451.0059","title":"Using advanced compiler technology to exploit the performance of the Cell Broadband Engine™ architecture","year":2006,"lang":"en","type":"article","venue":"IBM Systems Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Computer architecture; Exploit; Parallel computing; Microarchitecture; Embedded system; Operating system","score_opus":0.010876011009922708,"score_gpt":0.23935437513883662,"score_spread":0.2284783641289139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080393180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33842728,0.00036068825,0.6597579,0.00034886252,0.00045127844,0.00015992021,6.995386e-7,0.000079782985,0.0004135385],"genre_scores_gemma":[0.95078325,0.000008261362,0.04884083,0.000055100605,0.00013910036,0.0000050232857,1.1983295e-7,0.000008521472,0.00015979378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890304,0.00010738616,0.00036437137,0.00015184717,0.00024189218,0.00023148902],"domain_scores_gemma":[0.99905366,0.000040944804,0.00029705747,0.0004091014,0.00016292777,0.000036311045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036764215,0.000120546145,0.00017162766,0.00017020066,0.00034766115,0.000116669966,0.0011429044,0.000061259154,0.000001435646],"category_scores_gemma":[0.000012329062,0.00006722194,0.00006399303,0.0006228875,0.000048473194,0.00011274796,0.00019243115,0.00032723197,0.0000022247189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003476945,0.000018240044,0.0015487557,0.000016523298,0.000005055508,0.0000013610992,0.00017417707,0.9894493,0.004104175,0.00039191873,0.0006204342,0.0036665339],"study_design_scores_gemma":[0.0004810503,0.00016376593,0.0013227956,0.00039471904,0.000010855506,0.0011686747,0.00007832766,0.945609,0.038064558,0.00040717213,0.012017704,0.0002814117],"about_ca_topic_score_codex":0.000015266636,"about_ca_topic_score_gemma":0.0000011500503,"teacher_disagreement_score":0.61235595,"about_ca_system_score_codex":0.000045281744,"about_ca_system_score_gemma":0.00006181099,"threshold_uncertainty_score":0.2741231},"labels":[],"label_agreement":null},{"id":"W2080696000","doi":"10.1145/1925805.1925818","title":"Soot","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":939,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bytecode; Java bytecode; Computer science; Programming language; Java; Representation (politics); Compiler; Intermediate language; Interpreter; Java annotation; Real time Java","score_opus":0.00963409680639174,"score_gpt":0.24904400895761786,"score_spread":0.23940991215122612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080696000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015601533,0.0000019173817,0.89633197,0.0005889677,0.00016879331,0.000017557866,2.1337874e-8,0.0008197431,0.10051086],"genre_scores_gemma":[0.4001338,6.036748e-7,0.5984114,0.00031016677,0.00001980683,0.0000010384831,1.1220626e-7,0.0000011047317,0.0011219827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972296,0.0000053707995,0.000048366834,0.000097822,0.000053958807,0.00007155191],"domain_scores_gemma":[0.99966925,0.000014243017,0.00001219754,0.00024949707,0.000025742474,0.00002904089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008662203,0.000029744968,0.000028241882,0.000029212793,0.000040617204,0.00006194642,0.00039492664,0.000021798056,0.000038531743],"category_scores_gemma":[0.000013747665,0.000024412007,0.0000137873985,0.00009650482,0.000009237885,0.0001061315,0.00008488899,0.000070231414,0.00007232624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.5671361e-7,0.000015587259,0.00028711883,5.697028e-7,0.0000011235879,0.0000011980748,0.00004656363,0.00008357841,0.0019682832,0.94630283,0.015593586,0.03569939],"study_design_scores_gemma":[0.00012935913,0.00003219787,0.0017494754,0.0000018488042,6.268347e-7,0.000023984665,0.0000016019909,0.82103026,0.041332517,0.03840244,0.09707722,0.00021846964],"about_ca_topic_score_codex":0.0000049581695,"about_ca_topic_score_gemma":0.0000025258653,"teacher_disagreement_score":0.9079004,"about_ca_system_score_codex":0.0000012066936,"about_ca_system_score_gemma":0.0000119233855,"threshold_uncertainty_score":0.09954928},"labels":[],"label_agreement":null},{"id":"W2081252282","doi":"10.1145/1940475.1940483","title":"Cache complexity and multicore implementation for univariate real root isolation","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Isolation (microbiology); Multi-core processor; Univariate; Parallel computing; Cache; Root (linguistics); Theoretical computer science; CPU cache; Computer architecture; Multivariate statistics; Machine learning","score_opus":0.13294683543674232,"score_gpt":0.36146923933304537,"score_spread":0.22852240389630304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081252282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019382901,0.00007350778,0.9780314,0.0010594066,0.00009557295,0.00053270016,0.0000058605992,0.00037962347,0.00043900678],"genre_scores_gemma":[0.4441233,0.00007057793,0.55557966,0.00010615309,0.000015149365,0.000049856062,0.000043524073,0.000007728471,0.00000406312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986272,0.00023971584,0.00043814682,0.00035616622,0.0001037225,0.000235076],"domain_scores_gemma":[0.99703836,0.00037436414,0.00018601623,0.0021790469,0.00016016938,0.000062019746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005569773,0.00015892203,0.00018655315,0.0002257181,0.00031643242,0.00011789493,0.0023173115,0.000075635355,0.0000048526613],"category_scores_gemma":[0.00003617738,0.00017439316,0.000044469074,0.00037339045,0.00011607104,0.0004957825,0.0017222461,0.00015890064,0.000003081183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020956206,0.0003484895,0.032976206,0.000031082163,0.00004958093,0.0000012776278,0.011032082,0.00035935492,0.0000815745,0.75849646,0.0009038562,0.19569908],"study_design_scores_gemma":[0.0006798606,0.00010726044,0.10232141,0.000022090207,0.000008062805,0.0000061173973,0.00003660823,0.7972436,0.00014787208,0.09889022,0.0003178346,0.00021907357],"about_ca_topic_score_codex":0.0006226527,"about_ca_topic_score_gemma":0.00050286885,"teacher_disagreement_score":0.79688424,"about_ca_system_score_codex":0.000067470115,"about_ca_system_score_gemma":0.000051462008,"threshold_uncertainty_score":0.7111547},"labels":[],"label_agreement":null},{"id":"W2081286217","doi":"10.1109/tvlsi.2011.2160463","title":"Portable, Flexible, and Scalable Soft Vector Processors","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Software portability; Scalability; Embedded system; Microprocessor; Computer hardware; Computer architecture; Design space exploration; Flexibility (engineering); Reconfigurable computing; Parallel computing; Vector processor","score_opus":0.021797232362556943,"score_gpt":0.23814884198078648,"score_spread":0.21635160961822952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081286217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032587394,0.00018407687,0.98971,0.000081988954,0.0012587209,0.0004914586,0.000026051972,0.0012893293,0.0036996529],"genre_scores_gemma":[0.96401316,0.000075539785,0.031058205,0.00014723823,0.00005929021,0.0001690224,0.0000069178873,0.000031204472,0.004439416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777544,0.00015895549,0.0005766134,0.00065557373,0.00040175222,0.00043166874],"domain_scores_gemma":[0.99861914,0.000074025935,0.00020961702,0.0005880593,0.00032079898,0.0001883552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055503554,0.0003165542,0.00034705282,0.00038692047,0.00048606945,0.00033053383,0.00051498157,0.00021195934,0.000049549806],"category_scores_gemma":[0.000012466421,0.00028613396,0.00010816023,0.0007654297,0.000064812564,0.0010750986,0.0000069409202,0.0003357885,0.000075234515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017011822,0.017052244,0.005066138,0.0034840088,0.0019316758,0.0002783343,0.090493634,0.35875314,0.01737001,0.16184133,0.07752264,0.26450565],"study_design_scores_gemma":[0.00081909,0.00046899205,0.0003488377,0.00043337507,0.00004347264,0.000110442656,0.00050172163,0.92295474,0.07003299,0.00059777906,0.0029004584,0.0007880782],"about_ca_topic_score_codex":0.00021497549,"about_ca_topic_score_gemma":0.00007978033,"teacher_disagreement_score":0.96075445,"about_ca_system_score_codex":0.000088161294,"about_ca_system_score_gemma":0.00010889369,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W2081373884","doi":"10.1145/1543753.1543756","title":"Dynamic warp formation","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; Parallel computing; Thread (computing); Instruction set; Control flow; Massively parallel; Operating system; Programming language","score_opus":0.008459880391551905,"score_gpt":0.24081069080865528,"score_spread":0.23235081041710337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081373884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021359629,0.00006017276,0.9930213,0.0050516427,0.000063344385,0.00017752824,0.0000042469887,0.00065021677,0.0007579398],"genre_scores_gemma":[0.32508615,0.00019907636,0.6735979,0.00095762336,0.0000070994615,0.000008934488,0.000012369567,0.0000064531077,0.00012440396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912167,0.00005645851,0.00019857104,0.00028789617,0.00016173691,0.00017368571],"domain_scores_gemma":[0.99927837,0.000050581188,0.000070982474,0.00047185272,0.000058542704,0.00006966626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010290638,0.00015117842,0.0001177479,0.00024870195,0.00030255973,0.000138221,0.00038793887,0.000081007296,0.000009747547],"category_scores_gemma":[0.000016490008,0.00014056938,0.00004791833,0.00038139257,0.000021049767,0.00038558815,0.000008739476,0.00017587615,0.000004478177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000085625325,0.000035237103,3.9155648e-7,0.0000028796658,0.0000033851018,6.675683e-7,0.00027642184,0.74043787,0.000048971942,0.0004957302,0.000030035511,0.25865987],"study_design_scores_gemma":[0.00025531242,0.0002146274,0.00006315645,0.00002379803,0.0000082325105,0.00003716673,0.0000075130947,0.98863125,0.0009174798,0.009163249,0.00050518394,0.00017304622],"about_ca_topic_score_codex":0.0000014137189,"about_ca_topic_score_gemma":0.00000510537,"teacher_disagreement_score":0.32487255,"about_ca_system_score_codex":0.000029321282,"about_ca_system_score_gemma":0.00001779506,"threshold_uncertainty_score":0.57322526},"labels":[],"label_agreement":null},{"id":"W2081517533","doi":"10.1145/2660193.2660218","title":"MIX10","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; MATLAB; Programming language; Set (abstract data type); Software engineering; Computation; Computational science","score_opus":0.009822714643625987,"score_gpt":0.23506778449109678,"score_spread":0.22524506984747078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081517533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001322076,0.0000040878263,0.84445995,0.00050931313,0.00005055167,0.000013173213,8.451094e-9,0.00072665256,0.15410408],"genre_scores_gemma":[0.36831132,0.0000011702554,0.62958926,0.0007543107,0.000017647108,9.1219925e-7,1.3487241e-7,0.000001243428,0.0013239874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970174,0.000020339987,0.000051224433,0.000100562786,0.000055421333,0.00007070007],"domain_scores_gemma":[0.9996938,0.000024447876,0.000013189259,0.00022283784,0.000020386457,0.000025302315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125029,0.000030325726,0.00003458973,0.000028122648,0.000034977453,0.000049619197,0.00033763656,0.000013988412,0.000013853447],"category_scores_gemma":[0.000017709668,0.000024850755,0.000014016027,0.000094865645,0.000005628872,0.00008360017,0.00007467046,0.000022531067,0.00007973654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7475726e-7,0.000011136404,0.00015267594,0.0000010525978,0.0000012025201,2.573037e-7,0.000041491465,0.00086829445,0.00005424056,0.88608104,0.021138174,0.09165026],"study_design_scores_gemma":[0.000051135674,0.000022977782,0.00028978652,0.0000017424119,2.3653845e-7,0.0000026234916,4.977316e-7,0.9350548,0.0029484092,0.016040238,0.045520775,0.00006681071],"about_ca_topic_score_codex":0.000003401142,"about_ca_topic_score_gemma":2.6069705e-7,"teacher_disagreement_score":0.93418646,"about_ca_system_score_codex":0.0000028973843,"about_ca_system_score_gemma":0.000004631906,"threshold_uncertainty_score":0.102487855},"labels":[],"label_agreement":null},{"id":"W2081664133","doi":"10.1109/nas.2014.43","title":"iCHAT: Inter-cache Hardware-Assistant Data Transfer for Heterogeneous Chip Multiprocessors","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Cache; Speedup; Parallel computing; Central processing unit; Cache coherence; CPU cache; Cache algorithms; Operating system","score_opus":0.04800564095555751,"score_gpt":0.28832370899812854,"score_spread":0.24031806804257103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081664133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009154448,0.000055557113,0.9956045,0.0007000083,0.0001740266,0.0002466525,0.000013564748,0.0009486012,0.001341624],"genre_scores_gemma":[0.60758585,0.000009702717,0.3911581,0.00067911245,0.000054193464,0.00002431326,0.00003293612,0.000014581121,0.0004412123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985203,0.000063891406,0.0002905484,0.00065333094,0.00016722555,0.00030471614],"domain_scores_gemma":[0.9983485,0.00014261517,0.0000427596,0.0012556976,0.00010947686,0.00010094706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054451916,0.00017785263,0.00020372053,0.0000880832,0.00015125274,0.00021905247,0.0023123783,0.00007559031,0.000011053441],"category_scores_gemma":[0.00010406765,0.00014836452,0.00007015192,0.00016881853,0.00003166055,0.0003455618,0.0003551517,0.00008761475,0.000014833908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015501017,0.0009094534,0.00075027783,0.00039994053,0.00026362776,0.000012979144,0.003172425,0.028802916,0.0020215488,0.098444454,0.041818466,0.8232489],"study_design_scores_gemma":[0.00036802198,0.00011414617,0.0000252401,0.000021445145,0.0000068482364,0.000008779195,0.000003968406,0.94960463,0.010384032,0.0009872578,0.03824244,0.00023320441],"about_ca_topic_score_codex":0.000017616258,"about_ca_topic_score_gemma":0.00002382591,"teacher_disagreement_score":0.9208017,"about_ca_system_score_codex":0.000017252458,"about_ca_system_score_gemma":0.000032959964,"threshold_uncertainty_score":0.60501295},"labels":[],"label_agreement":null},{"id":"W2081744702","doi":"10.1016/s1383-7621(01)00026-1","title":"A robust stack folding approach for Java processors: an operand extraction-based algorithm","year":2001,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Operand; Folding (DSP implementation); Algorithm; Java; Stack (abstract data type); Parallel computing; Bytecode; Call stack; Code (set theory); Benchmarking; Java bytecode; Programming language; Operating system; Java applet","score_opus":0.03553081575273185,"score_gpt":0.28182379707432703,"score_spread":0.2462929813215952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081744702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002018235,0.0007251179,0.99602157,0.00021471253,0.00029346618,0.0003836277,0.0000031763493,0.00014030705,0.00019976478],"genre_scores_gemma":[0.15881285,0.000018027378,0.84041804,0.000080447055,0.0005243336,0.000019280787,0.0000033199333,0.00001842201,0.00010530391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837446,0.00014297398,0.0005623719,0.00026690765,0.00038880945,0.0002644539],"domain_scores_gemma":[0.99836236,0.00011991969,0.00057134277,0.00028862662,0.000498048,0.00015972459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015297,0.00018237988,0.00033881943,0.00033269607,0.00021322671,0.00039791258,0.00077179977,0.00010679624,0.0000013611318],"category_scores_gemma":[0.0000461926,0.00013831208,0.00013470338,0.0003756078,0.000022905848,0.00045904767,0.00003062462,0.00030314087,3.3391902e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037429865,0.00013360089,0.00006772523,0.000090838876,0.000029561821,0.000016057626,0.0005382327,0.9609384,0.00022723818,0.00011853534,0.0004998948,0.037302475],"study_design_scores_gemma":[0.00074856833,0.00039144888,0.000023725894,0.00015917292,0.00001256917,0.00084363244,0.00007871838,0.9931374,0.00035457255,0.0001690757,0.0038992576,0.00018181207],"about_ca_topic_score_codex":0.000013598554,"about_ca_topic_score_gemma":7.809874e-7,"teacher_disagreement_score":0.15679461,"about_ca_system_score_codex":0.00006322044,"about_ca_system_score_gemma":0.00017348,"threshold_uncertainty_score":0.56402034},"labels":[],"label_agreement":null},{"id":"W2082328357","doi":"10.1109/ccece.2010.5575173","title":"Instruction set extension in the NIOS II: A floating point divider for complex numbers","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Instruction set; Speedup; Parallel computing; Set (abstract data type); Constraint (computer-aided design); Chip; Division (mathematics); Bandwidth (computing); Nios II; Computer hardware; Arithmetic; Field-programmable gate array; Programming language; Mathematics","score_opus":0.0375842336133652,"score_gpt":0.2970915276621604,"score_spread":0.2595072940487952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082328357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07482948,0.000002043551,0.91992104,0.0023502673,0.0002194094,0.00027912797,6.4526984e-7,0.00029655683,0.002101444],"genre_scores_gemma":[0.557232,7.653229e-7,0.4418989,0.0007748277,0.000035825728,0.000010652815,0.0000035060662,0.0000032350365,0.000040214814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991946,0.000052179385,0.0001979893,0.00024067545,0.00014355987,0.00017097213],"domain_scores_gemma":[0.99933285,0.00012754214,0.000070782604,0.00036360635,0.00007978367,0.00002542435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062889315,0.000086791464,0.00009001204,0.000075310054,0.00028153657,0.00011996353,0.00049241044,0.000051741994,0.000011623798],"category_scores_gemma":[0.00010899407,0.000060791102,0.00004260189,0.0002537349,0.000026480044,0.00025418994,0.0001606155,0.00015639869,0.000003204575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004316916,0.0004290649,0.0048010135,0.00006764741,0.000028690716,0.000009911861,0.023305843,0.01943989,0.030296197,0.5421459,0.13214208,0.24729055],"study_design_scores_gemma":[0.0003719341,0.00005845135,0.0034591602,0.000011095553,0.0000015403263,0.000037895978,0.00011784964,0.9776236,0.0012209263,0.012168741,0.004791442,0.00013736606],"about_ca_topic_score_codex":0.00010938307,"about_ca_topic_score_gemma":0.000087007764,"teacher_disagreement_score":0.9581837,"about_ca_system_score_codex":0.00001144847,"about_ca_system_score_gemma":0.000019587093,"threshold_uncertainty_score":0.24789892},"labels":[],"label_agreement":null},{"id":"W2082982763","doi":"10.1109/micro.2012.30","title":"Fundamental Latency Trade-off in Architecting DRAM Caches: Outperforming Impractical SRAM-Tags with a Simple and Practical Design","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":238,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"NetApp","keywords":"Computer science; Cache; Dram; Latency (audio); Static random-access memory; CAS latency; Embedded system; Cache pollution; CPU cache; Parallel computing; Cache algorithms; Operating system; Computer hardware; Memory controller; Semiconductor memory","score_opus":0.04375466281009928,"score_gpt":0.30905923402453495,"score_spread":0.2653045712144357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082982763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0904112,0.00006215261,0.90629995,0.0010223704,0.000039019043,0.00023040766,1.9996544e-7,0.0003448562,0.0015898255],"genre_scores_gemma":[0.5638237,0.0000059754384,0.43593213,0.00017527079,0.000027930442,0.000006869385,5.751056e-7,0.000008014067,0.000019538333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983977,0.00018910583,0.00028030312,0.00034349575,0.00024276867,0.00054662005],"domain_scores_gemma":[0.99883115,0.00060926424,0.00009721972,0.0002446253,0.00001907885,0.00019863933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010275042,0.00018195935,0.0001954952,0.00014653424,0.00017625697,0.0002092738,0.00017560742,0.000082889084,0.0000097895445],"category_scores_gemma":[0.00017546612,0.00014353351,0.000025974514,0.00032021917,0.00006439178,0.0012293739,0.00019141601,0.00038175244,0.0000053678145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005725034,0.0038371286,0.37820667,0.00019086814,0.00021546363,0.00038801646,0.050282326,0.01687846,0.0019683752,0.07636197,0.0024856403,0.46861258],"study_design_scores_gemma":[0.00073547417,0.0005331437,0.009060367,0.000044971708,0.000013742792,0.0011045262,0.00063043286,0.98350054,0.0022230567,0.00060196983,0.0010555183,0.0004962267],"about_ca_topic_score_codex":0.000066956265,"about_ca_topic_score_gemma":0.000008559532,"teacher_disagreement_score":0.9666221,"about_ca_system_score_codex":0.00006293949,"about_ca_system_score_gemma":0.000085056075,"threshold_uncertainty_score":0.5853127},"labels":[],"label_agreement":null},{"id":"W2083230971","doi":"10.1109/iccd.2014.6974692","title":"BarTLB: Barren page resistant TLB for managed runtime languages","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Translation lookaside buffer; Computer science; Cache; Thrashing; Operating system; Parallel computing; Virtual memory; Java; Memory management; Physical address","score_opus":0.010154462393540642,"score_gpt":0.25495308896048,"score_spread":0.24479862656693938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083230971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025920832,0.000044737415,0.94714147,0.0012857529,0.00006539378,0.00016686875,0.0000011307953,0.0010733887,0.049962033],"genre_scores_gemma":[0.37509698,0.00000650247,0.6177097,0.00079989876,0.000092098155,0.00002117312,0.000005282255,0.000009808434,0.006258567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909973,0.00006871405,0.00016777146,0.00030169153,0.00013673764,0.00022536366],"domain_scores_gemma":[0.99916565,0.00015044735,0.000054984313,0.0005013542,0.00006408388,0.000063494816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005241454,0.00010730252,0.0001341078,0.000121445875,0.00015550561,0.00015835752,0.00068023684,0.00004564374,0.00001604353],"category_scores_gemma":[0.00013769821,0.00009110065,0.000063017855,0.00023961949,0.000019068688,0.00015085061,0.00016785358,0.00005368471,0.000030530504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018419842,0.00006488665,0.00011732075,0.000048463608,0.000027382153,0.0000046326736,0.00034113097,0.0015684091,0.0016792879,0.8429833,0.093816645,0.059330147],"study_design_scores_gemma":[0.00059709087,0.00021035018,0.0009260289,0.000029860272,0.0000070938427,0.0000034303782,0.000025576392,0.8782952,0.009759775,0.017140605,0.09258556,0.00041943093],"about_ca_topic_score_codex":0.000022175262,"about_ca_topic_score_gemma":0.0000058352193,"teacher_disagreement_score":0.8767268,"about_ca_system_score_codex":0.000017717823,"about_ca_system_score_gemma":0.000022411386,"threshold_uncertainty_score":0.3714977},"labels":[],"label_agreement":null},{"id":"W2083469609","doi":"10.5555/2133429.2133470","title":"Credit borrow and repay: sharing DRAM with minimum latency and bandwidth guarantees","year":2010,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dram; Latency (audio); Computer network; Cache; Quality of service; Scheduling (production processes); Bandwidth (computing); CAS latency; Distributed computing; Operating system; Computer hardware; Memory controller; Telecommunications","score_opus":0.03214478053717342,"score_gpt":0.26951379680928306,"score_spread":0.23736901627210963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083469609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026155299,0.000017645003,0.9685434,0.0015515366,0.0005306341,0.00018900794,0.0000022065776,0.00041570424,0.0025945508],"genre_scores_gemma":[0.6151122,0.000032302636,0.38415956,0.00036966335,0.00012826872,0.0000124615435,0.0000034151574,0.00001007709,0.00017207288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984197,0.000047576614,0.00027166962,0.0006909748,0.0003415868,0.0002284877],"domain_scores_gemma":[0.99885905,0.0001749124,0.00014218554,0.00040820864,0.00029694528,0.000118699085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000362339,0.00023499309,0.0002076529,0.00022309941,0.00016051902,0.000768179,0.0008860177,0.000092639275,0.000024233608],"category_scores_gemma":[0.000033421376,0.00019726703,0.000028884546,0.0001316599,0.00011714207,0.0005003001,0.00033935704,0.00031615494,0.000008267501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040645,0.0003369725,0.0065562585,0.00004193114,0.00022885128,0.0002468429,0.0021734072,0.0045138905,0.005910852,0.8220335,0.006122801,0.15153058],"study_design_scores_gemma":[0.0005433527,0.00039186716,0.0026174604,0.00011077454,0.000005108202,0.00014725275,0.0000046129794,0.9752821,0.0013920049,0.018796401,0.000411529,0.00029756906],"about_ca_topic_score_codex":0.000022783037,"about_ca_topic_score_gemma":0.0000061303504,"teacher_disagreement_score":0.97076815,"about_ca_system_score_codex":0.000015370379,"about_ca_system_score_gemma":0.00007439272,"threshold_uncertainty_score":0.8044316},"labels":[],"label_agreement":null},{"id":"W2083474035","doi":"10.1109/mm.2008.29","title":"Northbridge Architecture of AMD's Griffin Microprocessor Family","year":2008,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Software portability; Microprocessor; Computer science; Griffin; Graphics; Embedded system; Architecture; Operating system; Computer architecture; Power management; Mobile device; Power (physics)","score_opus":0.01747882429169115,"score_gpt":0.22981836177494114,"score_spread":0.21233953748325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083474035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3302984,0.00029076802,0.6679433,0.00013269714,0.00014845672,0.00007879409,0.000004298108,0.0002734439,0.00082984945],"genre_scores_gemma":[0.6549834,0.000074535616,0.3439195,0.000474061,0.0000629679,0.000004922461,0.0000028313732,0.000011949187,0.0004658832],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989907,0.000039970568,0.00026416837,0.00031253675,0.00016265205,0.00022995472],"domain_scores_gemma":[0.99918044,0.000041239713,0.00013653844,0.0004478416,0.00013653266,0.000057418572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100127494,0.0001444153,0.00020266016,0.00014554849,0.00011664437,0.0000258702,0.0008641869,0.0000710424,0.0000028917182],"category_scores_gemma":[0.000014670042,0.00013406156,0.000084600426,0.00040608027,0.0000877811,0.00009885831,0.00010263095,0.00014977582,0.000022356537],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003597197,0.0003917379,0.0034747645,0.000118694334,0.000064099695,0.00012117972,0.0039281347,0.013124363,0.85360223,0.00072610716,0.09097377,0.033438947],"study_design_scores_gemma":[0.0004621733,0.00012022314,0.006109042,0.000056130433,0.0000055032588,0.00022145419,0.0000061243845,0.0065548206,0.97364056,0.0005150655,0.01190015,0.0004087781],"about_ca_topic_score_codex":0.00005321425,"about_ca_topic_score_gemma":0.0000025906595,"teacher_disagreement_score":0.32468498,"about_ca_system_score_codex":0.000015547357,"about_ca_system_score_gemma":0.00009123034,"threshold_uncertainty_score":0.5466872},"labels":[],"label_agreement":null},{"id":"W2083795695","doi":"10.1016/j.sysarc.2008.09.004","title":"An embedded implementation of the Common Language Infrastructure","year":2008,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Compiler; VHDL; Programming language; Virtual machine; Host (biology); Instruction set; Set (abstract data type); High-level programming language; Java; Computer architecture; Operating system; Programming paradigm; Field-programmable gate array","score_opus":0.008038182146830416,"score_gpt":0.2787490379404097,"score_spread":0.2707108557935793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083795695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5603545,0.00020060233,0.4388143,0.00013463291,0.00027101327,0.000101240075,0.000002342666,0.0000315522,0.00008985661],"genre_scores_gemma":[0.9681028,0.000007956226,0.03167367,0.000067821806,0.00012534652,8.0754904e-7,5.9174005e-7,0.0000054126726,0.000015573212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99883187,0.00021601583,0.00042643762,0.000084954365,0.00033652113,0.000104189705],"domain_scores_gemma":[0.99874747,0.000033398836,0.00067607535,0.00035118847,0.00014167276,0.000050200568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027709067,0.000087424414,0.00020067881,0.000121062854,0.00010573502,0.00003497043,0.00085575215,0.00004748385,0.000003031824],"category_scores_gemma":[0.000012372693,0.0000519296,0.00008934147,0.00025297108,0.000034859415,0.00015440432,0.0000679373,0.00022696832,2.0707029e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041926487,0.0001348933,0.04312153,0.00017083975,0.0001551831,0.000097929034,0.083539374,0.77107465,0.037571263,0.0038981603,0.010035571,0.05015867],"study_design_scores_gemma":[0.0058606835,0.003534094,0.567444,0.0013457219,0.0001227644,0.023826936,0.0094676595,0.19949113,0.17213625,0.0072532967,0.007963111,0.00155435],"about_ca_topic_score_codex":0.000044705856,"about_ca_topic_score_gemma":0.0000059093127,"teacher_disagreement_score":0.5715835,"about_ca_system_score_codex":0.000024491968,"about_ca_system_score_gemma":0.000097366225,"threshold_uncertainty_score":0.21176276},"labels":[],"label_agreement":null},{"id":"W2083963764","doi":"10.1109/pact.2011.10","title":"SPATL: Honey, I Shrunk the Coherence Directory","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bloom filter; Computer science; Directory; Cache; Exploit; Scalability; MESI protocol; Overhead (engineering); Cache coherence; Associative property; Computer network; Distributed computing; Database; Operating system; CPU cache; Cache algorithms; Computer security","score_opus":0.04421569246308,"score_gpt":0.24798613887106416,"score_spread":0.20377044640798417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083963764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007336556,0.00007209059,0.8497249,0.00023555638,0.00015201716,0.00007540393,1.2254263e-7,0.00089160126,0.14811464],"genre_scores_gemma":[0.7149853,0.000016878226,0.2821865,0.00079712877,0.00002524274,0.0000107960195,2.4475264e-7,0.000004599678,0.0019733051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993368,0.000059927952,0.00011569071,0.0002027757,0.00012744703,0.00015735677],"domain_scores_gemma":[0.9992722,0.0000518945,0.000046661484,0.00053133426,0.000054049277,0.000043859887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023801017,0.00007970941,0.00006996412,0.000035876696,0.00012518832,0.00006356504,0.0010730971,0.000029614097,0.00009370639],"category_scores_gemma":[0.000021402182,0.000049528775,0.000034771245,0.00021981714,0.000051529805,0.00016437065,0.0002262524,0.000082534134,0.00009440985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009056506,0.00023207738,0.006980284,0.000010654018,0.00003894808,0.000022694961,0.005743783,0.00034635252,0.000633218,0.73632604,0.122195534,0.12746134],"study_design_scores_gemma":[0.0006494215,0.00045126217,0.067925036,0.000085314634,0.000019589921,0.000087586275,0.00011638219,0.62096614,0.15389283,0.07691828,0.07726753,0.0016206199],"about_ca_topic_score_codex":0.00013360211,"about_ca_topic_score_gemma":0.0000068643103,"teacher_disagreement_score":0.71425164,"about_ca_system_score_codex":0.000009486477,"about_ca_system_score_gemma":0.000029859342,"threshold_uncertainty_score":0.20197248},"labels":[],"label_agreement":null},{"id":"W2084278425","doi":"10.1145/1973009.1973075","title":"Real-time address trace compression for emulated and real system-on-chip processor core debugging","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Debugging; Emulation; Embedded system; TRACE (psycholinguistics); Multi-core processor; Redundancy (engineering); Software; System on a chip; Data compression; Computer architecture; Computer hardware; Parallel computing; Operating system","score_opus":0.0482926067856019,"score_gpt":0.2837548499306252,"score_spread":0.23546224314502331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084278425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04821375,0.000040539213,0.90519977,0.00006983446,0.0001137847,0.0007453339,0.000004503674,0.0035690712,0.04204343],"genre_scores_gemma":[0.7256483,0.000019758678,0.27349362,0.0000393985,0.000026558779,0.00003783745,0.000005268684,0.000015508173,0.00071378174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988563,0.000047746216,0.00025907092,0.00042988363,0.00015397115,0.00025303752],"domain_scores_gemma":[0.9991271,0.00013415355,0.00014240251,0.0003467813,0.00014427477,0.00010532481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026868941,0.00016622094,0.00021813321,0.000109840395,0.00023962799,0.00009039561,0.00046970544,0.000094028044,0.000006207595],"category_scores_gemma":[0.000022727554,0.0001330768,0.00003820712,0.00017327482,0.000030117733,0.00020494444,0.00012789333,0.00007147935,0.000007634031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018905605,0.0021695995,0.007122884,0.0038060856,0.00044599737,0.00016399332,0.033716153,0.019023223,0.048498813,0.6766285,0.08595853,0.12057567],"study_design_scores_gemma":[0.00044065202,0.00020690857,0.0011384523,0.00025455156,0.000008476401,0.0000167031,0.000022674805,0.9873583,0.009593083,0.00066906196,0.00006419114,0.00022697587],"about_ca_topic_score_codex":0.00010812631,"about_ca_topic_score_gemma":0.0000018887945,"teacher_disagreement_score":0.96833503,"about_ca_system_score_codex":0.000024409252,"about_ca_system_score_gemma":0.000033335808,"threshold_uncertainty_score":0.54267144},"labels":[],"label_agreement":null},{"id":"W2084429969","doi":"10.1145/2676723.2677299","title":"MiniOS","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Curriculum; Engineering management; Software engineering; Engineering","score_opus":0.04282691821600027,"score_gpt":0.27821920447080956,"score_spread":0.2353922862548093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084429969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017618941,0.00001751172,0.8695755,0.00061699713,0.00007943124,0.000018625653,2.004574e-8,0.0006918021,0.12882392],"genre_scores_gemma":[0.20885378,0.0000010467485,0.7881387,0.0005547267,0.000018262055,0.0000015216292,2.2459074e-7,0.000001424352,0.0024303023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996949,0.000013871562,0.000052237992,0.00009062356,0.000080831036,0.00006752536],"domain_scores_gemma":[0.99967617,0.00000957341,0.000012694017,0.00019211177,0.000048974132,0.00006047161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012306265,0.000029361978,0.000032521286,0.000029400228,0.000015958612,0.00004768286,0.00032512733,0.000014050665,0.0000038354246],"category_scores_gemma":[0.00002164108,0.000024190535,0.000010451847,0.00012135787,0.0000056891254,0.00012188012,0.00009377044,0.000019637548,0.00009438992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011786922,0.000042340962,0.0005305018,0.0000012633761,0.0000038569337,0.000006295678,0.0005685982,0.0026988816,0.000022055754,0.5364758,0.42193842,0.037710823],"study_design_scores_gemma":[0.00021215924,0.00007087033,0.00014728338,0.000003060118,5.3596716e-7,0.00001575825,0.000013313164,0.881033,0.003497723,0.023203822,0.09164971,0.00015276215],"about_ca_topic_score_codex":0.0000052195137,"about_ca_topic_score_gemma":2.4220662e-7,"teacher_disagreement_score":0.8783341,"about_ca_system_score_codex":0.000007444463,"about_ca_system_score_gemma":0.000027762035,"threshold_uncertainty_score":0.1213223},"labels":[],"label_agreement":null},{"id":"W2084817819","doi":"10.1109/icpp.2013.79","title":"Mixed Model Universal Software Thread-Level Speculation","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Parallel computing; Speedup; Programming language; POSIX Threads; Thread (computing); Runtime system; Fortran; Software; Distributed computing; Theoretical computer science","score_opus":0.04758061787510246,"score_gpt":0.24054546066051988,"score_spread":0.19296484278541742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084817819","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024214564,0.000007690024,0.9885889,0.00044035647,0.00006023253,0.00011600403,5.0143865e-7,0.001109129,0.007255723],"genre_scores_gemma":[0.25176457,0.0000027906442,0.74559104,0.00020147911,0.000011898858,0.0000038601424,0.000003358505,0.000004325923,0.0024166922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934644,0.00002128985,0.00011810294,0.00022161771,0.00014243521,0.00015011986],"domain_scores_gemma":[0.99937683,0.000027594777,0.00004400568,0.00032223098,0.0001719743,0.000057364636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070982336,0.00008568358,0.00007736319,0.00007613695,0.000081914935,0.00012637251,0.00044079765,0.00004903879,0.00004035495],"category_scores_gemma":[0.000022067332,0.000077034434,0.00003071127,0.00022886248,0.00001610762,0.0005699156,0.00016008725,0.00005571771,0.00013560375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001317268,0.000056707224,0.0007789116,0.0000055395976,0.000011722858,0.0000017707956,0.00027464944,0.42339978,0.00017117668,0.48435187,0.052697938,0.03824863],"study_design_scores_gemma":[0.000089697045,0.00001192901,0.0013340982,0.0000040355685,9.68788e-7,0.0000016886448,0.0000044324615,0.95995826,0.0008199646,0.037572235,0.00009240856,0.00011028381],"about_ca_topic_score_codex":0.0000788728,"about_ca_topic_score_gemma":0.000003742133,"teacher_disagreement_score":0.5365585,"about_ca_system_score_codex":0.000029853802,"about_ca_system_score_gemma":0.000043273656,"threshold_uncertainty_score":0.3141373},"labels":[],"label_agreement":null},{"id":"W2085387225","doi":"10.1145/1297846.1297950","title":"Software speculative multithreading for Java","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Speculative multithreading; Java bytecode; Java; Multithreading; Parallel computing; Programming language; Operating system; Speedup; Real time Java; Java annotation; Thread (computing)","score_opus":0.025368721557090648,"score_gpt":0.30262672335670704,"score_spread":0.2772580017996164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085387225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003468913,0.00001785875,0.9912201,0.000106016465,0.00010848161,0.00015162061,3.561301e-7,0.00090865954,0.0071399817],"genre_scores_gemma":[0.10879883,0.0000011917373,0.8898303,0.00026646772,0.00004006043,0.0000036352758,0.000001353097,0.000004671427,0.0010534676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993839,0.000007429269,0.00013286782,0.00020070854,0.000085034226,0.00019003612],"domain_scores_gemma":[0.9994295,0.00018239097,0.000043757005,0.0001955771,0.00010047647,0.00004828558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035513588,0.00006874825,0.000074480304,0.000079044985,0.00010233045,0.000056540823,0.0003153904,0.000034750585,0.000005525643],"category_scores_gemma":[0.00008345253,0.000060839946,0.00004284699,0.00016649725,0.000013414479,0.00016393619,0.00007976958,0.000036513233,0.000011249478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018376975,0.00010764922,0.0031993908,0.000022235576,0.000033264474,0.000010759127,0.0015853613,0.0076626907,0.00045617658,0.66075987,0.016310684,0.30983356],"study_design_scores_gemma":[0.00066719897,0.00015777824,0.003101611,0.000033303837,0.000004289104,0.000012920474,0.000039643444,0.8868527,0.058040377,0.03324226,0.017359044,0.00048888003],"about_ca_topic_score_codex":0.000008295835,"about_ca_topic_score_gemma":0.000004426583,"teacher_disagreement_score":0.87919,"about_ca_system_score_codex":0.000025401923,"about_ca_system_score_gemma":0.000014161687,"threshold_uncertainty_score":0.2480981},"labels":[],"label_agreement":null},{"id":"W2086181716","doi":"10.1145/1989622.1989630","title":"If a picture is worth a thousand words, what would an animation be worth?","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Animation; Simple (philosophy); Software; Paradigm shift; Multi-core processor; Software engineering; Programming paradigm; Human–computer interaction; Programming language; Computer graphics (images); Operating system","score_opus":0.03514849090996993,"score_gpt":0.26776631787975286,"score_spread":0.23261782696978292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086181716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008680909,0.00014077712,0.9749876,0.0006730778,0.00016483919,0.0001815201,6.9470167e-7,0.0013289946,0.01384159],"genre_scores_gemma":[0.42196277,0.00014750758,0.57173675,0.0043138685,0.00006631974,0.000014635149,0.00000625728,0.000014682456,0.0017372377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987009,0.00006935553,0.00024525452,0.00046274878,0.00024829776,0.00027340412],"domain_scores_gemma":[0.9989316,0.00001943457,0.000115610215,0.0006959784,0.00010682901,0.00013053941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024189663,0.00018172043,0.00016227216,0.00014788068,0.00015937342,0.00051288604,0.00079213484,0.00018653218,0.00017513105],"category_scores_gemma":[0.000011728759,0.00015231177,0.000058786238,0.00047968433,0.000031705746,0.0019879285,0.000187229,0.0002370172,0.000021131604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102060476,0.0011952644,0.014748972,0.000070522365,0.00013788762,0.000071386465,0.116142735,0.0022198057,0.0002371646,0.14549531,0.060039625,0.6595393],"study_design_scores_gemma":[0.0009622552,0.0008219674,0.011445329,0.00020365836,0.000030273115,0.000062132975,0.0010896361,0.90855074,0.013156901,0.025356593,0.03672757,0.0015929396],"about_ca_topic_score_codex":0.00003685641,"about_ca_topic_score_gemma":0.000017392815,"teacher_disagreement_score":0.90633094,"about_ca_system_score_codex":0.00002020567,"about_ca_system_score_gemma":0.000043989156,"threshold_uncertainty_score":0.62110937},"labels":[],"label_agreement":null},{"id":"W2086821151","doi":"10.1145/2370816.2370832","title":"Pointy","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software; Pointer (user interface); Garbage collection; Metadata; Java; Profiling (computer programming); Exploit; Operating system; Embedded system; Computer hardware; Garbage; Programming language","score_opus":0.018061955573154858,"score_gpt":0.2603508378965282,"score_spread":0.24228888232337334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086821151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037612027,0.000042160045,0.89525384,0.0002888697,0.00010071755,0.000016747535,2.0370868e-8,0.0006692246,0.10325232],"genre_scores_gemma":[0.50436705,0.0000020147447,0.49439105,0.00042726155,0.000028455685,9.3484607e-7,1.2753239e-7,0.0000010327809,0.000782072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970293,0.000013591495,0.000048764694,0.000057211837,0.00005470982,0.00012282071],"domain_scores_gemma":[0.9997354,0.00001351095,0.000012536447,0.00017632445,0.00001495784,0.000047277827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013549556,0.000029881627,0.000029571172,0.000025751131,0.00003297978,0.000027692495,0.00023255205,0.000013871179,0.00002431417],"category_scores_gemma":[0.000008732742,0.000024113247,0.000014412773,0.00010168981,0.000004883114,0.00027223394,0.00008866186,0.000023822682,0.00011698724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4459837e-7,0.00004283594,0.0030715438,0.0000011652091,0.0000023697414,2.623157e-7,0.0002137481,0.00012494379,0.000054106345,0.9355377,0.036147237,0.024803858],"study_design_scores_gemma":[0.00037477192,0.00008696586,0.023756064,0.000012735293,0.0000034660904,0.000073907555,0.000018779148,0.6479505,0.044800296,0.025333026,0.25683975,0.00074979506],"about_ca_topic_score_codex":0.0000032927878,"about_ca_topic_score_gemma":5.693071e-8,"teacher_disagreement_score":0.91020465,"about_ca_system_score_codex":0.000005600196,"about_ca_system_score_gemma":0.000004838781,"threshold_uncertainty_score":0.15036733},"labels":[],"label_agreement":null},{"id":"W2086823905","doi":"10.1145/1622123.1622152","title":"Dynamic ADTs","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Programmer; Profiling (computer programming); Lisp; Programming language; Data type; Data structure; Abstract data type; Algorithm; Parallel computing; Theoretical computer science","score_opus":0.009298217044485229,"score_gpt":0.26979119976354377,"score_spread":0.2604929827190585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086823905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086988235,0.000022669708,0.92839193,0.00022035128,0.0000811544,0.000027561855,2.6962569e-8,0.0009223933,0.06946403],"genre_scores_gemma":[0.43307385,0.0000027346414,0.56523126,0.00032443335,0.0000044753137,3.3063924e-7,2.4748059e-7,0.0000015319167,0.0013611631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956685,0.000006948653,0.000088389206,0.00012463401,0.000082135375,0.00013104585],"domain_scores_gemma":[0.99966246,0.000028993334,0.000020090794,0.00021922447,0.000030254985,0.000038966908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668955,0.000040876752,0.000038996917,0.000063908694,0.000043658652,0.000039216528,0.00036206466,0.00002293897,0.000010371162],"category_scores_gemma":[0.000009894899,0.000035515248,0.000018142144,0.00019263542,0.000008352901,0.00010958566,0.00008734222,0.000036564805,0.000053132113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003607534,0.0000910809,0.0007988996,0.0000058242827,0.000009885731,0.000032709617,0.00037168516,0.002355633,0.00073860586,0.60096675,0.014967351,0.37965795],"study_design_scores_gemma":[0.00011925131,0.000042269636,0.004536185,0.0000056602385,6.722457e-7,0.000018287452,0.0000053637427,0.9689137,0.0054065464,0.0097396,0.011036049,0.0001764145],"about_ca_topic_score_codex":0.000004562919,"about_ca_topic_score_gemma":0.000004041919,"teacher_disagreement_score":0.96655804,"about_ca_system_score_codex":0.000013536142,"about_ca_system_score_gemma":0.000009945175,"threshold_uncertainty_score":0.14482698},"labels":[],"label_agreement":null},{"id":"W2088001805","doi":"10.1145/2479871.2479892","title":"DataMill","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade Federal de Santa Catarina; University of Waterloo","keywords":"Dilemma; Computer science; Compiler; Empirical research; Binary number; Process (computing); Theoretical computer science; Programming language; Arithmetic; Statistics; Mathematics","score_opus":0.01398133687577318,"score_gpt":0.2370749968658815,"score_spread":0.2230936599901083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088001805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027139028,0.000010308711,0.9155612,0.0007028031,0.000041133924,0.000043071,3.9752003e-8,0.0007356609,0.08263437],"genre_scores_gemma":[0.20110159,0.000004540647,0.7953273,0.0011285181,0.000011504654,0.0000062129197,7.3353493e-7,0.0000016175854,0.002417975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968684,0.000010286074,0.000057581874,0.00010880625,0.000055782926,0.0000807343],"domain_scores_gemma":[0.9996199,0.000014104664,0.000012752406,0.0002879386,0.000035235193,0.0000300893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044450822,0.000032459186,0.00003182546,0.000028526896,0.00003210599,0.000107569176,0.0004535795,0.000013288412,0.000098569275],"category_scores_gemma":[0.000008112493,0.000025481948,0.000010460579,0.00010686128,0.0000064289525,0.00033126125,0.00014343292,0.000023901119,0.0005740892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.04908544e-7,0.000029620836,0.00044871384,0.000002141356,0.0000040928417,0.00000110376,0.000089961126,0.0005434894,0.00026477923,0.4446884,0.4427885,0.11113906],"study_design_scores_gemma":[0.00005996683,0.000018830247,0.0019643416,0.0000024399367,2.821159e-7,0.000004760498,0.0000026248695,0.9541126,0.0026758532,0.018212667,0.022829214,0.00011642413],"about_ca_topic_score_codex":0.00004258756,"about_ca_topic_score_gemma":2.3588855e-7,"teacher_disagreement_score":0.9535691,"about_ca_system_score_codex":0.0000036711995,"about_ca_system_score_gemma":0.0000065239487,"threshold_uncertainty_score":0.7378946},"labels":[],"label_agreement":null},{"id":"W2088059652","doi":"10.1109/fpt.2012.6412109","title":"Managing mutex variables in a cache-coherent shared-memory system for FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Semaphore; Computer science; Cache; Synchronization (alternating current); Field-programmable gate array; Embedded system; Vendor; Shared memory; Operating system; Multiprocessing; Parallel computing; Computer network","score_opus":0.022113754531249554,"score_gpt":0.25937804220905425,"score_spread":0.2372642876778047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088059652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006104759,0.0002034719,0.9765539,0.0002374635,0.00031312704,0.000324746,0.0000010869888,0.00081879203,0.02093691],"genre_scores_gemma":[0.57406366,0.0000036067393,0.42487398,0.00013327807,0.00006857038,0.00007660525,0.000003298674,0.000008687762,0.0007682989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989573,0.000055121967,0.00023766847,0.0002492614,0.0001244339,0.00037622184],"domain_scores_gemma":[0.99935186,0.00009611264,0.0000695259,0.00035187398,0.00004893118,0.000081671766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006644865,0.00011921637,0.00015594599,0.00015452622,0.000080968704,0.00011472558,0.0005357153,0.000054421216,0.000009653267],"category_scores_gemma":[0.000021546086,0.00010822216,0.00004807153,0.00025798983,0.000008880929,0.00042350628,0.0001969454,0.0000668592,0.000016069625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002920244,0.000598296,0.0074584526,0.0010481004,0.000086213964,0.000016886846,0.0063857236,0.09004336,0.0005486878,0.754906,0.042239215,0.09663984],"study_design_scores_gemma":[0.00034844567,0.000022207638,0.00053095043,0.00012791896,0.000004054101,0.0000136914205,0.00009075376,0.99315965,0.0028570911,0.0010060339,0.0016115535,0.00022764129],"about_ca_topic_score_codex":0.00009050301,"about_ca_topic_score_gemma":0.00000597964,"teacher_disagreement_score":0.9031163,"about_ca_system_score_codex":0.00010354155,"about_ca_system_score_gemma":0.000026203132,"threshold_uncertainty_score":0.44131714},"labels":[],"label_agreement":null},{"id":"W2088092680","doi":"10.1016/j.jpdc.2014.07.001","title":"A survey of high level frameworks in block-structured adaptive mesh refinement packages","year":2014,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Guelph","funders":"Lawrence Berkeley National Laboratory; Deutsche Forschungsgemeinschaft; National Energy Research Scientific Computing Center; National Science Foundation; Compute Canada; Office of Science; National Aeronautics and Space Administration; Argonne National Laboratory; National Energy Technology Laboratory; U.S. Department of Energy; Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Louisiana State University","keywords":"Computer science; Block (permutation group theory); Set (abstract data type); Range (aeronautics); Architecture; Adaptive mesh refinement; Domain (mathematical analysis); Cover (algebra); Programming language; Computational science; Archaeology","score_opus":0.026614568773559888,"score_gpt":0.266046701316634,"score_spread":0.2394321325430741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088092680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14893883,0.00024580496,0.8502659,0.00025275076,0.00014083098,0.000067650704,0.000014271103,0.000034407625,0.000039506605],"genre_scores_gemma":[0.8016086,0.00003359308,0.19822091,0.000073177864,0.00004471106,4.565537e-7,0.000008936224,0.0000058007067,0.0000038287303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978347,0.00038962564,0.0009058207,0.00025060045,0.00033973632,0.0002795304],"domain_scores_gemma":[0.9976834,0.0005089406,0.0009330242,0.0002577279,0.0004972261,0.00011967801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016162624,0.00019647778,0.00055640476,0.00022006052,0.00009255742,0.000086219625,0.0006070362,0.00017853771,0.0000022688757],"category_scores_gemma":[0.00044330012,0.00016704388,0.000077251316,0.00055163057,0.00006235387,0.00015354344,0.00027628083,0.0005292589,4.014693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002749989,0.0004390362,0.06700125,0.00008514509,0.00022072473,0.000057915124,0.0012995168,0.81975055,0.00016618296,0.033776157,0.0036412561,0.073287256],"study_design_scores_gemma":[0.0011913306,0.00036652453,0.4283053,0.00023577863,0.000010880451,0.00005375504,0.000031708954,0.56371933,0.00018913305,0.005625192,0.000050383685,0.0002206781],"about_ca_topic_score_codex":0.00017202208,"about_ca_topic_score_gemma":0.000026626298,"teacher_disagreement_score":0.6526698,"about_ca_system_score_codex":0.000043227326,"about_ca_system_score_gemma":0.00007910935,"threshold_uncertainty_score":0.6811852},"labels":[],"label_agreement":null},{"id":"W2088723365","doi":"10.1145/1275517.1275518","title":"Experience distributing objects in an SMMP OS","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Locality; Scalability; Distributed computing; Lock (firearm); Concurrency; Implementation; Replication (statistics); Concurrency control; Locality of reference; Code (set theory); Object (grammar); Object-oriented programming; Parallel computing; Programming language; Operating system; Set (abstract data type); Cache; Database transaction","score_opus":0.027368318494113992,"score_gpt":0.291977313327682,"score_spread":0.26460899483356803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088723365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027130304,0.00004260946,0.96962833,0.00007104906,0.0017170819,0.00028007987,0.0000021167468,0.0008865404,0.000241905],"genre_scores_gemma":[0.8248696,0.000004348726,0.17478347,0.0001247966,0.0001408271,0.000024691963,0.0000031234783,0.000011929534,0.00003725432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979132,0.00014790714,0.0005329585,0.00060305535,0.00032399295,0.00047888237],"domain_scores_gemma":[0.9981756,0.00024353464,0.00012141425,0.0011921041,0.00010740056,0.0001599371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007152272,0.00021850312,0.00024678372,0.00034924908,0.00025430592,0.00032803515,0.0015121702,0.0001178516,0.00000292796],"category_scores_gemma":[0.000013180123,0.00022194999,0.00006853063,0.0008494957,0.0000351168,0.00062663475,0.000040748324,0.00027064962,0.000018787143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056976853,0.0012601246,0.0040066657,0.00010189234,0.00004752186,0.00027378983,0.01751684,0.64316344,0.00058837165,0.007486933,0.00045272094,0.3250447],"study_design_scores_gemma":[0.0005427437,0.000348096,0.003267602,0.00019780108,0.000003203779,0.00009466883,0.00020860658,0.98950917,0.0041871993,0.00017566384,0.0009410117,0.00052421034],"about_ca_topic_score_codex":0.0001340419,"about_ca_topic_score_gemma":0.000048814283,"teacher_disagreement_score":0.79773927,"about_ca_system_score_codex":0.00013327865,"about_ca_system_score_gemma":0.000041674975,"threshold_uncertainty_score":0.90508574},"labels":[],"label_agreement":null},{"id":"W2088808707","doi":"10.1145/502175.502180","title":"Optimal design of synchronous circuits using software pipelining techniques","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Retiming; Computer science; Software pipelining; Parallel computing; Combinational logic; Clock skew; Electronic circuit; Scheduling (production processes); Algorithm; Software; Clock signal; Logic gate; Mathematical optimization; Mathematics","score_opus":0.03766661338923844,"score_gpt":0.2763364236044197,"score_spread":0.23866981021518124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088808707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096777093,0.00034758303,0.9965647,0.00003057488,0.00012298662,0.0007538057,0.0000017935131,0.0011639526,0.000046850175],"genre_scores_gemma":[0.52415097,0.00007256472,0.47565666,0.0000099813,0.000013939952,0.000041741398,0.0000011548253,0.000015891817,0.000037080805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975162,0.0004665284,0.0007954118,0.00039148162,0.000421168,0.00040919168],"domain_scores_gemma":[0.9976561,0.0005397318,0.00056215463,0.0008412472,0.00034063263,0.00006010728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011407505,0.00023613931,0.00040774434,0.00056914205,0.0002054305,0.000072074814,0.0009612057,0.00017378794,0.000011814652],"category_scores_gemma":[0.00009872107,0.00025078352,0.00011104234,0.00091145985,0.000055552635,0.00046601729,0.000013622068,0.00020723199,0.0000051700204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014439397,0.00011307148,0.0000064987667,0.00003959696,0.00005005916,0.0000017449269,0.0002349486,0.96048087,0.004345665,0.00046390333,0.000038166756,0.034211036],"study_design_scores_gemma":[0.00023071187,0.0006375705,0.000008647316,0.00026284772,0.00002687893,0.0001193,0.00002433201,0.937924,0.060052674,0.00045327123,0.000037786394,0.00022193178],"about_ca_topic_score_codex":0.00004388825,"about_ca_topic_score_gemma":3.278344e-7,"teacher_disagreement_score":0.5231832,"about_ca_system_score_codex":0.00027486862,"about_ca_system_score_gemma":0.00040083323,"threshold_uncertainty_score":0.99999446},"labels":[],"label_agreement":null},{"id":"W2089081526","doi":"10.1145/2676870.2676885","title":"A Heterogeneous GASNet Implementation for FPGA-accelerated Computing","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Software; Reconfigurable computing; Computer architecture; Symmetric multiprocessor system; Embedded system; Distributed computing; Parallel computing; Operating system","score_opus":0.03293106706064999,"score_gpt":0.32284219826192523,"score_spread":0.2899111312012752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089081526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066815233,0.0000087173785,0.99048007,0.00026294772,0.000114657254,0.00024486837,7.5991403e-7,0.00092442514,0.001282027],"genre_scores_gemma":[0.59190345,0.0000011698119,0.40737048,0.00059149275,0.000041918833,0.000009688303,0.000010955973,0.0000058037854,0.00006504451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909425,0.000056892157,0.00023003286,0.0002826565,0.000104482766,0.00023166918],"domain_scores_gemma":[0.9993879,0.00009170429,0.00009286372,0.0002534789,0.00012157566,0.000052430474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366692,0.0001021921,0.00011659359,0.00007453655,0.00017093736,0.00019173662,0.0004069569,0.000033241282,0.000018588978],"category_scores_gemma":[0.000019458024,0.000096349075,0.00004825901,0.0001767394,0.000009585925,0.00013866274,0.000110587076,0.00003522878,0.000012962956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133234735,0.000101887024,0.0006284705,0.000040481267,0.00004894609,0.0000017139137,0.00079176406,0.091976695,0.0016618957,0.11164997,0.02334662,0.76973826],"study_design_scores_gemma":[0.000340932,0.00013316207,0.00012589492,0.000004245392,0.000002115194,0.000007491248,0.0000057822867,0.97124183,0.020968093,0.0021693225,0.00486106,0.00014009826],"about_ca_topic_score_codex":0.00001670907,"about_ca_topic_score_gemma":0.000004520278,"teacher_disagreement_score":0.8792651,"about_ca_system_score_codex":0.000019957097,"about_ca_system_score_gemma":0.000019470674,"threshold_uncertainty_score":0.3929001},"labels":[],"label_agreement":null},{"id":"W2089275169","doi":"10.1145/2002951.2002960","title":"Retroactive aspects","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Hindsight bias; Source code; Programming language; Context (archaeology); Semantics (computer science); Program analysis; Code (set theory); Software engineering","score_opus":0.03564321207383253,"score_gpt":0.24127826839529182,"score_spread":0.2056350563214593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089275169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017118563,0.0000062654444,0.60371524,0.000038110844,0.00004018904,0.00001964312,2.2238783e-8,0.0005420443,0.3954673],"genre_scores_gemma":[0.5136677,0.0000022125973,0.48563412,0.00017167881,0.0000072332705,0.0000013738385,8.025063e-8,0.0000015173217,0.0005140761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962044,0.000017566661,0.00006075278,0.00014144044,0.0000658166,0.00009396628],"domain_scores_gemma":[0.9996468,0.000010204963,0.000024156274,0.00024803044,0.000037568723,0.000033243283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007466431,0.000043409913,0.00004464657,0.00004635809,0.00003912608,0.000023911853,0.00038069545,0.000020955262,0.000049890838],"category_scores_gemma":[0.000010945682,0.00003652089,0.000019227999,0.0001575876,0.000010810849,0.00018524911,0.00009980185,0.000040453942,0.000065256456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011217929,0.000031249587,0.00019489357,6.4037226e-7,0.000004816166,0.0000053805893,0.00060329627,0.00001388715,0.000028195402,0.9874932,0.0040517505,0.007571554],"study_design_scores_gemma":[0.00041951833,0.00043360522,0.018438943,0.00001779935,0.0000050946514,0.00005074991,0.000046680812,0.37941238,0.1877493,0.4072108,0.005501972,0.0007131806],"about_ca_topic_score_codex":0.000021292171,"about_ca_topic_score_gemma":7.274056e-7,"teacher_disagreement_score":0.58028245,"about_ca_system_score_codex":0.000009676602,"about_ca_system_score_gemma":0.000014703561,"threshold_uncertainty_score":0.14892787},"labels":[],"label_agreement":null},{"id":"W2090209978","doi":"10.1007/s10766-009-0094-9","title":"A Speculative and Adaptive MPI Rendezvous Protocol Over RDMA-enabled Interconnects","year":2009,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; InfiniBand; Rendezvous; Message passing; Computer network; Message Passing Interface; Latency (audio); Protocol (science); Distributed computing; Overhead (engineering); Parallel computing; Operating system","score_opus":0.020135539022872986,"score_gpt":0.31639754854423197,"score_spread":0.296262009521359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090209978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020083154,0.00005667757,0.9915174,0.0011273287,0.0002133575,0.0035891943,5.021566e-7,0.00012977587,0.0013573975],"genre_scores_gemma":[0.47865918,0.000009238586,0.5203756,0.00034019398,0.00020567057,0.0003155883,7.30731e-7,0.000007891999,0.00008592808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827605,0.00010267948,0.0005740048,0.00025850892,0.0005550493,0.00023371492],"domain_scores_gemma":[0.9983338,0.00008814267,0.0006450443,0.000163336,0.0006448529,0.00012479938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021599,0.00018518702,0.00025047507,0.00032625732,0.00007664068,0.00040574122,0.0009439045,0.00006909328,0.000009920126],"category_scores_gemma":[0.00013731772,0.00015743922,0.00012439312,0.0001968588,0.000049601436,0.00087254,0.00017638026,0.00028384078,0.0000025921508],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083654537,0.0008115558,0.0012823595,0.000019410676,0.0004974028,0.0010259908,0.004522214,0.011076711,0.0005804415,0.124718264,0.0029128822,0.8517162],"study_design_scores_gemma":[0.015708946,0.00915749,0.019325735,0.0019873295,0.000083805695,0.004673509,0.0005023158,0.6658526,0.004805865,0.18325597,0.09242371,0.0022226921],"about_ca_topic_score_codex":0.000008973088,"about_ca_topic_score_gemma":0.0000020681514,"teacher_disagreement_score":0.8494935,"about_ca_system_score_codex":0.00010725682,"about_ca_system_score_gemma":0.00009698631,"threshold_uncertainty_score":0.6420185},"labels":[],"label_agreement":null},{"id":"W2091270106","doi":"10.1145/2043662.2043664","title":"Demand Paging Techniques for Flash Memory Using Compiler Post-Pass Optimizations","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"National Research Foundation of Korea","keywords":"Demand paging; Computer science; Paging; Page fault; Embedded system; Executable; Virtual memory; Flat memory model; Compiler; Operating system; Overhead (engineering); Code (set theory); Page; Memory management; Memory map; Computer hardware; Semiconductor memory","score_opus":0.04810123023841485,"score_gpt":0.2834237127626531,"score_spread":0.23532248252423826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091270106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016705297,0.00009242731,0.9917773,0.00010630308,0.0010284216,0.0011276242,0.00001733126,0.0028103194,0.0013697654],"genre_scores_gemma":[0.4026919,0.000008248017,0.5967735,0.00020159445,0.000086260676,0.000058703197,0.000008122735,0.000042828528,0.00012883848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971066,0.00027682696,0.0008216217,0.00083106477,0.00035423282,0.0006096602],"domain_scores_gemma":[0.99698865,0.00042247478,0.00038930014,0.0014373726,0.0005889374,0.00017325857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084328046,0.0004162257,0.00049281126,0.00059237255,0.0010561853,0.00034477786,0.0016727627,0.00021783219,0.000009051746],"category_scores_gemma":[0.000067905195,0.00043344998,0.00024334803,0.000743584,0.000079729136,0.0005035416,0.00007425798,0.0003238088,0.000013656913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044724005,0.0004501114,0.000047457943,0.00017130133,0.00020871634,0.0000109068005,0.005885852,0.9595007,0.0009491736,0.0046542906,0.00071445585,0.02736233],"study_design_scores_gemma":[0.0004409998,0.0002164224,0.000026422955,0.0002937746,0.00004726718,0.00009098251,0.00025777638,0.9890534,0.008199605,0.00054890756,0.00028755818,0.00053686457],"about_ca_topic_score_codex":0.0001061413,"about_ca_topic_score_gemma":0.0000029260375,"teacher_disagreement_score":0.40102136,"about_ca_system_score_codex":0.00016032913,"about_ca_system_score_gemma":0.00013594898,"threshold_uncertainty_score":0.9998117},"labels":[],"label_agreement":null},{"id":"W2091496722","doi":"10.1117/12.759454","title":"A CAD tool for the automatic generation of synthesizable parallel prefix adders in VHDL","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"VHDL; Adder; Computer science; Parallel computing; Prefix; Computer architecture; Very-large-scale integration; Hardware description language; Electronic design automation; Logic synthesis; Computer hardware; Arithmetic; Field-programmable gate array; Embedded system; Logic gate; Algorithm; Telecommunications; Mathematics","score_opus":0.01751938504465536,"score_gpt":0.24511011181338938,"score_spread":0.22759072676873401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091496722","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90376014,0.00012298046,0.0928879,0.0015376533,0.00016383849,0.0008736928,0.000008748164,0.00013114665,0.0005138833],"genre_scores_gemma":[0.35026127,0.00005916233,0.64916146,0.00009095277,0.00015358986,0.00016397912,0.0000028249099,0.000025060343,0.000081736085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795675,3.470873e-8,0.00082173245,0.0003336713,0.00052636256,0.00036142577],"domain_scores_gemma":[0.99782145,0.0004741494,0.00045557672,0.00009659306,0.0010981492,0.00005409865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017361472,0.00022645175,0.00032734498,0.00013705324,0.00009558559,0.00011036337,0.0014369187,0.00015057,0.0000022348156],"category_scores_gemma":[0.0007432536,0.0001706835,0.0003860132,0.0004272446,0.00013096868,0.000527122,0.0001734497,0.00018667948,3.137674e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051527146,0.00017999788,0.00036634353,0.00049523485,0.00025678624,7.207229e-8,0.0007715455,0.010283803,0.12501524,0.85445833,0.0053054993,0.002815635],"study_design_scores_gemma":[0.00059093925,0.00018014052,0.00060624944,0.00019814634,0.000041865715,0.0000055187675,0.00026197138,0.9027557,0.09286073,0.0017265308,0.0005631694,0.00020904005],"about_ca_topic_score_codex":0.000014855784,"about_ca_topic_score_gemma":5.015907e-7,"teacher_disagreement_score":0.8924719,"about_ca_system_score_codex":0.000115283285,"about_ca_system_score_gemma":0.000048468955,"threshold_uncertainty_score":0.6960271},"labels":[],"label_agreement":null},{"id":"W2091873788","doi":"10.1145/2686034","title":"Optimizing Memory Translation Emulation in Full System Emulators","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Emulation; Computer science; Translation lookaside buffer; Embedded system; Hardware emulation; Operating system; Software; Parallel computing; Speedup; Performance improvement; Physical address; Semiconductor memory","score_opus":0.026389964046619124,"score_gpt":0.25443037039220945,"score_spread":0.22804040634559034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091873788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019318195,0.00015495696,0.9949887,0.00079013867,0.00018291555,0.00035970224,0.00000468651,0.0006954118,0.00089171395],"genre_scores_gemma":[0.49605197,0.000025905818,0.50374776,0.0000835921,0.000018336888,0.000023388739,0.000011026491,0.000014531256,0.000023468503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841857,0.00018554012,0.00038425557,0.00047709665,0.00029491787,0.00023959664],"domain_scores_gemma":[0.99899924,0.00011465816,0.00011504223,0.000527179,0.00010271119,0.00014118208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036693396,0.00022448479,0.00021962919,0.00056021946,0.0001904761,0.00014894402,0.00038639703,0.00015096659,0.0000036131137],"category_scores_gemma":[0.000027491787,0.00022565007,0.000056935645,0.0007482938,0.000032657983,0.0004518122,0.000016038672,0.00025759634,0.0000035682679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045235927,0.000042346608,0.000012449709,0.000016055314,0.000008031022,0.0000026519895,0.002040047,0.9456595,0.000021960805,0.00032662632,0.0000069670305,0.05181811],"study_design_scores_gemma":[0.00080830423,0.0001466022,0.000035660814,0.00007976542,0.000012241897,0.00003167824,0.00013246258,0.99736077,0.0004356827,0.00063226203,0.000083945386,0.00024065163],"about_ca_topic_score_codex":0.000022642504,"about_ca_topic_score_gemma":0.000044371525,"teacher_disagreement_score":0.49412015,"about_ca_system_score_codex":0.00011226797,"about_ca_system_score_gemma":0.00006406895,"threshold_uncertainty_score":0.9201743},"labels":[],"label_agreement":null},{"id":"W2091907331","doi":"10.1145/2818950.2818974","title":"HpMC","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"European Commission; Lawrence Livermore National Laboratory; U.S. Department of Energy; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Dram; Embedded system; Memory controller; Energy consumption; Efficient energy use; Memory management; Distributed computing; Computer architecture; Semiconductor memory; Computer hardware; Electrical engineering","score_opus":0.041371706156604446,"score_gpt":0.27655642880342163,"score_spread":0.23518472264681717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091907331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012760365,0.000018267121,0.8456141,0.0005665956,0.000072763316,0.000016083392,1.5825966e-8,0.0007699365,0.15281464],"genre_scores_gemma":[0.21825664,0.0000012471112,0.77867395,0.00054572703,0.000017910917,0.0000012833515,2.0459424e-7,0.0000014247665,0.0025016072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996996,0.000013670857,0.000049776343,0.00008891285,0.00008067843,0.00006738572],"domain_scores_gemma":[0.99967945,0.000008225658,0.00001207496,0.00019150117,0.000049904003,0.00005885895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012989892,0.000028615577,0.00003163754,0.000028757877,0.000017251132,0.00005233075,0.00033315996,0.000013563101,0.0000040873215],"category_scores_gemma":[0.000019623712,0.000023435421,0.000010196053,0.00012608862,0.000005621114,0.00013220354,0.000103549304,0.000021318261,0.00010122483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.6582276e-7,0.000030198074,0.00045877547,9.354589e-7,0.0000028672666,0.0000046120904,0.00036039308,0.0038641866,0.000015786594,0.7020036,0.26123267,0.03202511],"study_design_scores_gemma":[0.00016876783,0.000055543707,0.00013559508,0.0000023933785,4.4608274e-7,0.000012344142,0.0000082947145,0.8909536,0.0027185662,0.03514138,0.07067346,0.00012962778],"about_ca_topic_score_codex":0.0000076408205,"about_ca_topic_score_gemma":3.150492e-7,"teacher_disagreement_score":0.8870894,"about_ca_system_score_codex":0.00000836187,"about_ca_system_score_gemma":0.000027269583,"threshold_uncertainty_score":0.13010742},"labels":[],"label_agreement":null},{"id":"W2091991691","doi":"10.1109/ic3i.2014.7019696","title":"Power cognizant algorithms using slack reclamation method","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Scheduling (production processes); Processor scheduling; Context switch; FIFO (computing and electronics); Task (project management); Parallel computing; Algorithm; Embedded system; Computer hardware; Computer network; Engineering","score_opus":0.02688733425209716,"score_gpt":0.3156889674372153,"score_spread":0.28880163318511815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091991691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024405618,0.000010400395,0.97595096,0.0003037779,0.00017284052,0.000076494325,1.4634868e-7,0.0007573341,0.022484004],"genre_scores_gemma":[0.052030418,0.0000024430872,0.9469619,0.000571006,0.00003292005,0.0000018362318,0.0000011781913,0.000006651292,0.0003916907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990457,0.00016399639,0.0001884954,0.00026880484,0.00016808505,0.00016491843],"domain_scores_gemma":[0.9992965,0.000095922966,0.00008273049,0.00034629938,0.00012556842,0.000052962718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073561183,0.000093693074,0.000116047086,0.000096891075,0.00011046807,0.00013943009,0.0003925217,0.000055758926,0.000027913398],"category_scores_gemma":[0.00007230435,0.0000816152,0.000037704594,0.00030098544,0.000011884082,0.00027484924,0.00014506317,0.00006849343,0.00003276092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000676958,0.00016417901,0.0003223255,0.00002334444,0.00004237467,0.0000047016897,0.0014425952,0.09801952,0.0033733153,0.5268173,0.012668839,0.3571147],"study_design_scores_gemma":[0.000099761724,0.000033941913,0.00006236628,0.000009839864,0.000001694346,0.0000117350855,0.0000036752274,0.9835495,0.0066701844,0.00627857,0.0031532191,0.00012553246],"about_ca_topic_score_codex":0.000016119418,"about_ca_topic_score_gemma":2.7175287e-7,"teacher_disagreement_score":0.88552994,"about_ca_system_score_codex":0.000021030533,"about_ca_system_score_gemma":0.000022471446,"threshold_uncertainty_score":0.33281714},"labels":[],"label_agreement":null},{"id":"W2092137580","doi":"10.1145/2506164.2506174","title":"Multi-core systems modeling for formal verification of parallel algorithms","year":2013,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Polytechnique Montréal","keywords":"Computer science; Compiler; Scheduling (production processes); Synchronization (alternating current); Parallel computing; Architecture; Model checking; Distributed computing; Programming language","score_opus":0.0831146336243668,"score_gpt":0.32309030121161286,"score_spread":0.23997566758724606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092137580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030796108,0.057481546,0.9383319,0.0001640394,0.00037277886,0.0029171265,0.0000048282163,0.00033946638,0.000080330974],"genre_scores_gemma":[0.17895414,0.00397449,0.814926,0.00012355628,0.00011382535,0.0015766275,0.000034654862,0.000030472624,0.0002662083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746263,0.00017486137,0.0012282368,0.00047638355,0.00029138295,0.0003665215],"domain_scores_gemma":[0.9972368,0.00016071928,0.00049692095,0.0012284444,0.00078527606,0.000091859256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014154557,0.0002484379,0.0006556718,0.00008403591,0.0002489661,0.0002948361,0.0013154371,0.00010574936,0.0000019145007],"category_scores_gemma":[0.00054037047,0.00020679337,0.00013707102,0.00032790474,0.000019147526,0.0008804783,0.00024360184,0.00011930578,0.000020432999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021493763,0.00017819555,0.00015594753,0.015454431,0.000102341095,0.000001415232,0.0006477341,0.9174212,0.0013424848,0.027913054,0.0059355833,0.030845417],"study_design_scores_gemma":[0.0002460468,0.000077244214,0.000005534688,0.004129166,0.000014872377,0.000016464122,0.00003622765,0.994381,0.000026160109,0.000035758167,0.00079137296,0.00024015206],"about_ca_topic_score_codex":0.0003759459,"about_ca_topic_score_gemma":4.8712667e-7,"teacher_disagreement_score":0.17864618,"about_ca_system_score_codex":0.000049521455,"about_ca_system_score_gemma":0.000081768216,"threshold_uncertainty_score":0.8432789},"labels":[],"label_agreement":null},{"id":"W2092212481","doi":"10.1109/hpca.2015.7056027","title":"Heterogeneous memory architectures: A HW/SW approach for mixing die-stacked and off-package memories","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Dram; Embedded system; Leverage (statistics); Computer architecture; Software; Overlay; Memory management; Interleaved memory; Computer hardware; Operating system","score_opus":0.03267026224982563,"score_gpt":0.26469360956720533,"score_spread":0.2320233473173797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092212481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010914513,0.00061998836,0.98286366,0.0002225166,0.000098896824,0.0003888469,0.00000258799,0.0008634389,0.004025549],"genre_scores_gemma":[0.3040202,0.000013132039,0.6949145,0.0003649876,0.00006358274,0.00004210915,0.0000070745295,0.0000139999875,0.00056037074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987129,0.00007897131,0.00022752243,0.0004678021,0.0002050544,0.0003077792],"domain_scores_gemma":[0.99903023,0.00011656653,0.00008410904,0.00046272273,0.00012855092,0.00017779788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042484887,0.0001894321,0.00023177739,0.00012703318,0.00016072854,0.00022906021,0.000545571,0.00007240249,0.0000010833273],"category_scores_gemma":[0.00012840987,0.00015718649,0.00006328222,0.0001503418,0.00007445725,0.00012112802,0.0003082332,0.00008948391,0.0000015824849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049735216,0.0010038896,0.000706794,0.0007829602,0.0004810773,0.00010813026,0.054981373,0.4069724,0.0021672845,0.025687674,0.038912416,0.46769863],"study_design_scores_gemma":[0.0007100723,0.00021402971,0.00001520052,0.000013795681,0.000008467782,0.00006178228,0.00012187157,0.97203,0.019115508,0.005624791,0.0017437586,0.00034072695],"about_ca_topic_score_codex":0.000016118654,"about_ca_topic_score_gemma":0.0000058925402,"teacher_disagreement_score":0.5650576,"about_ca_system_score_codex":0.000026011849,"about_ca_system_score_gemma":0.00006147121,"threshold_uncertainty_score":0.6409879},"labels":[],"label_agreement":null},{"id":"W2092299033","doi":"10.1109/reconfig.2012.6416786","title":"SPREX: A soft processor with Runahead execution","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pipeline (software); Field-programmable gate array; Computer architecture; Architecture; Embedded system; Microarchitecture; Key (lock); Reconfigurable computing; Simple (philosophy); ARM architecture; Parallel computing; Operating system","score_opus":0.013705570811622613,"score_gpt":0.24528468194379097,"score_spread":0.23157911113216836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092299033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002416093,0.00007947787,0.97535044,0.00033335137,0.000054710465,0.00009563223,1.0280957e-7,0.001044678,0.020625534],"genre_scores_gemma":[0.62260264,0.0000026758257,0.37630734,0.0002647374,0.00003688024,0.000010288341,7.3750095e-7,0.000003840943,0.00077088707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933916,0.00002092289,0.00009518394,0.00015489085,0.0001526264,0.00023722842],"domain_scores_gemma":[0.9995359,0.00002002288,0.00004585892,0.00024795067,0.000069492664,0.000080752376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017735493,0.000082417646,0.00007376596,0.0000576313,0.000085554995,0.00007294797,0.00031494797,0.0000336481,0.00001143925],"category_scores_gemma":[0.000012655791,0.000059068116,0.000016670965,0.00027185856,0.000018632476,0.000603516,0.00007813045,0.00005655923,0.000044191154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006108123,0.0011496233,0.03985172,0.00012901177,0.00007309147,0.000009421941,0.0062749726,0.008171094,0.0009633459,0.7364983,0.05534801,0.15147033],"study_design_scores_gemma":[0.0012221109,0.0006405627,0.015228869,0.00014986096,0.00002189751,0.0002301793,0.00008500927,0.8648468,0.056069124,0.006228985,0.053831797,0.001444788],"about_ca_topic_score_codex":0.000010351666,"about_ca_topic_score_gemma":0.0000011102413,"teacher_disagreement_score":0.85667574,"about_ca_system_score_codex":0.000016574573,"about_ca_system_score_gemma":0.000031017393,"threshold_uncertainty_score":0.24087279},"labels":[],"label_agreement":null},{"id":"W2092515100","doi":"10.1023/b:supe.0000022101.41799.cc","title":"A Group-Based Load Balance Scheme for Software Distributed Shared Memory Systems","year":2004,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheme (mathematics); Distributed computing; Balance (ability); Shared memory; Software; Group (periodic table); Distributed memory; Parallel computing; Operating system","score_opus":0.019612961401985887,"score_gpt":0.24928739543048312,"score_spread":0.22967443402849724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092515100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027945828,0.00085459877,0.96950155,0.00074498606,0.00042413015,0.00024133082,0.000008464509,0.0002629325,0.000016181099],"genre_scores_gemma":[0.5521161,0.0000078635485,0.4474545,0.00020135137,0.00019541766,0.0000026766706,0.000004801787,0.000012391833,0.000004906673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982508,0.00013671449,0.0006325715,0.00018500822,0.00045115128,0.0003437846],"domain_scores_gemma":[0.9979809,0.0004853206,0.0004177534,0.00038770036,0.00062694494,0.00010141199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021380712,0.00018246938,0.00032059828,0.00010125844,0.0003584058,0.00022477962,0.0014705034,0.000072382005,0.000001060177],"category_scores_gemma":[0.000341857,0.00013086727,0.00016091943,0.00039166986,0.000049124515,0.00040310263,0.00015321605,0.0002756928,0.0000026823554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000619616,0.00014024944,0.00043141085,0.00011158895,0.00006253711,0.00002001826,0.0011135361,0.9895706,0.0012715232,0.0018699294,0.0023397487,0.0030068906],"study_design_scores_gemma":[0.0022293616,0.0003489176,0.0003637007,0.0007059075,0.000026065849,0.00030104513,0.000117007025,0.9915572,0.0016096896,0.0016870096,0.0007437187,0.00031040094],"about_ca_topic_score_codex":0.00003706498,"about_ca_topic_score_gemma":0.0000010156889,"teacher_disagreement_score":0.5241702,"about_ca_system_score_codex":0.00023195903,"about_ca_system_score_gemma":0.00028555162,"threshold_uncertainty_score":0.5336612},"labels":[],"label_agreement":null},{"id":"W2092522707","doi":"10.1109/ase.2011.6100154","title":"Identifying future field accesses in exhaustive state space traversal","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Thread (computing); Pathfinder; Tree traversal; Java; Programming language; Scheduling (production processes); Distributed computing; Parallel computing; World Wide Web","score_opus":0.035666575040745364,"score_gpt":0.27753270272101,"score_spread":0.24186612768026464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092522707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037780427,0.000030122406,0.96292025,0.00027281634,0.0002050462,0.00007421175,1.5181011e-7,0.0003803364,0.032338995],"genre_scores_gemma":[0.64737254,0.00007626462,0.35151398,0.0003059698,0.000029807745,0.0000043572586,3.7484355e-7,0.0000042653674,0.0006924731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929684,0.000027161643,0.00014149316,0.00024262173,0.000109262815,0.00018263403],"domain_scores_gemma":[0.999596,0.00003345599,0.000050620587,0.00023201584,0.0000450594,0.000042867356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013880014,0.00009034585,0.000096236814,0.0001362343,0.00004769703,0.00009454771,0.000577581,0.000046153003,0.000053545755],"category_scores_gemma":[0.000013077863,0.000080959595,0.00002682317,0.00034852486,0.0000114292325,0.00049260934,0.00017764882,0.00011988509,0.00001678924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015067075,0.0007970063,0.049818408,0.00016626909,0.00008834217,0.00071454543,0.093519725,0.004302947,0.0006397427,0.5550261,0.05436164,0.24041459],"study_design_scores_gemma":[0.0023438013,0.0008156672,0.09380917,0.0003003354,0.000017788729,0.000080471975,0.002557404,0.2834945,0.45901835,0.1490659,0.00604603,0.0024505784],"about_ca_topic_score_codex":0.00020404012,"about_ca_topic_score_gemma":0.000048321075,"teacher_disagreement_score":0.64359444,"about_ca_system_score_codex":0.00001597738,"about_ca_system_score_gemma":0.000028525765,"threshold_uncertainty_score":0.33014363},"labels":[],"label_agreement":null},{"id":"W2092935629","doi":"10.1080/10637199808947384","title":"RANDOMIZED OPTIMAL LIST RANKING ON COARSE-GRAINED PARALLEL COMPUTERS WITH O(log p) COMMUNICATION PHASES","year":2000,"lang":"en","type":"article","venue":"International Journal of Parallel Emergent and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Ranking (information retrieval); Computation; Parallel algorithm; Cost efficiency; Parallel computing; Randomized algorithm; Theoretical computer science; Algorithm; Information retrieval","score_opus":0.01786713948870236,"score_gpt":0.27578252609001097,"score_spread":0.25791538660130864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092935629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019132081,0.0010482266,0.97613734,0.0018390386,0.00055057555,0.0003318774,0.00002165812,0.00012574786,0.00081348047],"genre_scores_gemma":[0.9362836,0.0012684052,0.061693575,0.0002008605,0.00018017238,0.00002148294,0.00010897301,0.000013655885,0.0002292851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971645,0.00053162035,0.001018441,0.00027518757,0.00077257963,0.00023767186],"domain_scores_gemma":[0.9976591,0.0004173642,0.00077670603,0.00032501257,0.0006565595,0.00016528422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012069999,0.00026694743,0.0006059601,0.0002477624,0.00021563699,0.00043020444,0.0012700662,0.000081938364,0.000051426578],"category_scores_gemma":[0.000090924324,0.00020076119,0.00019956894,0.00021714593,0.00014089118,0.00046083445,0.000094429175,0.000278155,0.0000055537057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013260153,0.00033736802,0.0002411457,0.000013454508,0.0006601302,0.00009732426,0.00068479957,0.9482094,0.000017415272,0.019811105,0.012519749,0.00414796],"study_design_scores_gemma":[0.055859536,0.00035098125,0.00008699256,0.00047922813,0.00005489156,0.00042885196,0.000101218626,0.9284383,0.000029135717,0.0005285919,0.0132575,0.00038473774],"about_ca_topic_score_codex":0.00008590682,"about_ca_topic_score_gemma":0.0000030874462,"teacher_disagreement_score":0.9171515,"about_ca_system_score_codex":0.00008135348,"about_ca_system_score_gemma":0.00007179468,"threshold_uncertainty_score":0.8186804},"labels":[],"label_agreement":null},{"id":"W2093043622","doi":"10.1145/2485922.2485964","title":"GPUWattch","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":498,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Computer and Network Systems; Advanced Micro Devices; Division of Computing and Communication Foundations; Intel Corporation","keywords":"Computer science; Frequency scaling; General-purpose computing on graphics processing units; Kernel (algebra); Energy consumption; Parallel computing; Clock gating; Efficient energy use; CUDA; Dynamic demand; Metric (unit); Performance metric; Embedded system; Power (physics); Graphics; Operating system; Clock skew; Clock signal","score_opus":0.011621040433114673,"score_gpt":0.2333242383252962,"score_spread":0.2217031978921815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093043622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006226597,0.000009126593,0.8999899,0.0013278268,0.00004349774,0.00004650567,1.0240708e-8,0.00083364535,0.09712683],"genre_scores_gemma":[0.3553827,0.000002631258,0.6403761,0.00078768213,0.000011511359,0.00000769763,1.6363335e-7,0.000001564769,0.0034299127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996698,0.000011135167,0.00006183269,0.00010575772,0.000061161016,0.000090295114],"domain_scores_gemma":[0.9996728,0.000014949999,0.000013227846,0.00022150877,0.00004458617,0.00003295766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045263856,0.00003503253,0.000034982615,0.000030948668,0.000035824527,0.00011305788,0.00037269684,0.000016080729,0.00013548452],"category_scores_gemma":[0.0000067725323,0.000027555607,0.000014557141,0.0001215453,0.0000064850756,0.00025054454,0.0000987388,0.00002664905,0.00066716335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4520283e-7,0.000042169806,0.0008605497,0.0000027342303,0.000005323705,0.0000013091482,0.00016893841,0.00090698595,0.00043824143,0.5098858,0.34058937,0.14709844],"study_design_scores_gemma":[0.00007560816,0.000027044896,0.0023987517,0.0000030313192,3.3476167e-7,0.0000063612724,0.0000035939663,0.9446083,0.005930644,0.03475029,0.012051138,0.0001449029],"about_ca_topic_score_codex":0.00003645936,"about_ca_topic_score_gemma":1.943221e-7,"teacher_disagreement_score":0.9437013,"about_ca_system_score_codex":0.000004539612,"about_ca_system_score_gemma":0.000007502975,"threshold_uncertainty_score":0.85752577},"labels":[],"label_agreement":null},{"id":"W2093383161","doi":"10.1155/2014/712085","title":"A Low-Power Scalable Stream Compute Accelerator for General Matrix Multiply (GEMM)","year":2014,"lang":"en","type":"article","venue":"VLSI design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scalability; Computation; Xeon; Xeon Phi; Block (permutation group theory); Parallel computing; Matrix multiplication; Hardware acceleration; Power (physics); Embedded system; Power budget; Matrix (chemical analysis); Computer hardware; Field-programmable gate array; Computer engineering; Algorithm; Electric power system; Operating system","score_opus":0.024231851145745446,"score_gpt":0.27244286873594153,"score_spread":0.2482110175901961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093383161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025688293,0.000041440653,0.9945384,0.00023614534,0.00033597916,0.00052164425,0.000002912092,0.0010710302,0.00068356795],"genre_scores_gemma":[0.19041233,0.000005429913,0.8079222,0.0004919075,0.00014387579,0.000060283288,0.0000049158743,0.000022777134,0.0009362678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998305,0.00016852737,0.00031482513,0.0005397129,0.0002252084,0.00044673172],"domain_scores_gemma":[0.99862146,0.000268839,0.00013558066,0.0006229316,0.00020475186,0.00014642873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389392,0.00022962494,0.00026879937,0.00014922241,0.00024845984,0.00027833527,0.0010177257,0.00011515443,0.000010597098],"category_scores_gemma":[0.00007367733,0.00021503831,0.00011009998,0.0003316239,0.000034585704,0.00032228214,0.00018703612,0.00010649397,0.000061010578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118801516,0.00092357607,0.0005946296,0.00013788312,0.00014853927,0.00001689485,0.0010496626,0.411139,0.012021702,0.13479683,0.32514647,0.11390598],"study_design_scores_gemma":[0.00063346856,0.00026028848,0.0001152621,0.000024266847,0.0000050502213,0.0000053011695,0.0000014168634,0.96017194,0.026204618,0.0018980517,0.010385815,0.00029455032],"about_ca_topic_score_codex":0.000011032485,"about_ca_topic_score_gemma":5.602477e-7,"teacher_disagreement_score":0.54903287,"about_ca_system_score_codex":0.00004173248,"about_ca_system_score_gemma":0.00007765119,"threshold_uncertainty_score":0.87690073},"labels":[],"label_agreement":null},{"id":"W2093498840","doi":"10.1049/iet-cdt.2012.0088","title":"Customised soft processor design: a compromise between architecture description languages and parameterisable processors","year":2013,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Datapath; Computer science; Computer architecture; Flexibility (engineering); Microarchitecture; Instruction set; Processor design; Process (computing); Set (abstract data type); Architecture; Design space exploration; Embedded system; Parallel computing; Operating system; Programming language","score_opus":0.017170812662659483,"score_gpt":0.2531135861739861,"score_spread":0.23594277351132661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093498840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018372381,0.00014569885,0.97415787,0.0006376623,0.00003660198,0.0014010489,0.000006464233,0.004353942,0.0008883588],"genre_scores_gemma":[0.51003736,0.0000127780295,0.48932567,0.00023962292,0.000050802155,0.00018331267,0.000014694124,0.000026677819,0.00010904346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997773,0.000100136676,0.0004722006,0.00078944647,0.00033962267,0.0005256144],"domain_scores_gemma":[0.99852866,0.00022895705,0.00025498902,0.00054660847,0.00021240077,0.00022837879],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00025816637,0.00043161842,0.00046113672,0.00030751943,0.0002262078,0.00211781,0.0011134862,0.00019193592,0.0000035374478],"category_scores_gemma":[0.00007521323,0.0003874471,0.00009216317,0.0005058385,0.00016920872,0.0020140451,0.0005070138,0.00029878554,0.000019283947],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000371917,0.0002711788,0.0022402513,0.00029603165,0.0001049038,0.000024567651,0.0017336273,0.0015436341,0.0015711826,0.00076314365,0.020878516,0.97053576],"study_design_scores_gemma":[0.00246485,0.0033751808,0.005330129,0.0017396215,0.0000925268,0.00054516474,0.00019637105,0.69907016,0.13443974,0.13189135,0.015677253,0.005177661],"about_ca_topic_score_codex":0.000032555687,"about_ca_topic_score_gemma":3.350995e-7,"teacher_disagreement_score":0.96535814,"about_ca_system_score_codex":0.0000570684,"about_ca_system_score_gemma":0.000060898143,"threshold_uncertainty_score":0.9998577},"labels":[],"label_agreement":null},{"id":"W2094079707","doi":"10.1049/ip-cdt:20020449","title":"Current dynamics-based macro-model for power simulation in a complex VLIW DSP processor","year":2002,"lang":"en","type":"article","venue":"IEE Proceedings - Computers and Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Very long instruction word; Digital signal processing; Very-large-scale integration; Macro; Compiler; Embedded system; Power (physics); Software; Computer hardware; Computer architecture","score_opus":0.03516083783231008,"score_gpt":0.2871920378065482,"score_spread":0.25203119997423806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094079707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004788708,0.00012352354,0.9907027,0.0005656739,0.00004905513,0.00082363735,0.000017258775,0.0016736166,0.0012558523],"genre_scores_gemma":[0.72441465,0.000023587545,0.27513978,0.00024642015,0.00002487499,0.00009106165,0.000014211736,0.000020793654,0.000024638945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998195,0.0000060862776,0.00046271787,0.00067472464,0.00024862704,0.00041284267],"domain_scores_gemma":[0.9990756,0.00009321622,0.0002174707,0.00017583239,0.00031796293,0.000119930395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020362876,0.00031540598,0.00032347473,0.0004095303,0.00015370405,0.00097569684,0.0006221162,0.000115862815,0.0000011483525],"category_scores_gemma":[0.000054097494,0.00031457757,0.00009249926,0.0004711395,0.00008119643,0.0012326209,0.00022839586,0.00016736628,0.0000012878111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012951819,0.0017609276,0.006049193,0.0009963604,0.00003944879,0.000008617455,0.0032007366,0.05523661,0.00023320755,0.10608794,0.026457144,0.7998003],"study_design_scores_gemma":[0.00037839395,0.00021817847,0.00010083684,0.00016378649,0.0000029862813,0.000005355487,0.0000051589573,0.98318946,0.00033148643,0.013523359,0.0016892966,0.0003916905],"about_ca_topic_score_codex":0.0000018279584,"about_ca_topic_score_gemma":7.050114e-7,"teacher_disagreement_score":0.9279529,"about_ca_system_score_codex":0.00011475308,"about_ca_system_score_gemma":0.000025450545,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W2094341653","doi":"10.1145/2489068.2491624","title":"AutoPilot","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Google (Canada)","funders":"","keywords":"Computer science; SIMD; Multi-core processor; Parallel computing; Interface (matter); Message passing; Cache; VMEbus; Autopilot; Message Passing Interface; Operating system; Embedded system; Computer architecture; Software","score_opus":0.013617439269315941,"score_gpt":0.23495107726575257,"score_spread":0.22133363799643663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094341653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047493368,0.000007807474,0.88830537,0.0011632352,0.000047324324,0.000044818706,9.279024e-9,0.0010253239,0.108931206],"genre_scores_gemma":[0.3059319,0.0000020518908,0.6884635,0.0008679059,0.000011977443,0.000007660473,1.4207504e-7,0.0000014867911,0.0047133365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969447,0.0000104697365,0.000058701196,0.00009828007,0.00005515004,0.000082910505],"domain_scores_gemma":[0.9997017,0.000013146194,0.000012703291,0.00020593194,0.00003623124,0.000030302945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003981104,0.000032792912,0.00003285414,0.000029516958,0.00003413615,0.000105664214,0.00034464488,0.000013437948,0.00012959272],"category_scores_gemma":[0.0000067679302,0.000025987492,0.000012874805,0.00010387787,0.000006152492,0.0002304806,0.00009072819,0.000024373003,0.0005466354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.479525e-8,0.000027169986,0.00032144858,0.0000016370147,0.0000029637883,7.318674e-7,0.000084065956,0.00050975964,0.00022098969,0.7768504,0.1294875,0.09249322],"study_design_scores_gemma":[0.00006123875,0.00003073519,0.0029804648,0.0000023810444,2.4586225e-7,0.0000043260197,0.000001616533,0.94874257,0.0033334254,0.033237293,0.011496658,0.000109028784],"about_ca_topic_score_codex":0.0000356041,"about_ca_topic_score_gemma":1.7488168e-7,"teacher_disagreement_score":0.9482328,"about_ca_system_score_codex":0.0000046491828,"about_ca_system_score_gemma":0.000008065095,"threshold_uncertainty_score":0.7026075},"labels":[],"label_agreement":null},{"id":"W2094539119","doi":"10.1145/1062455.1062618","title":"Third international workshop on dynamic analysis(WODA 2005)","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science","score_opus":0.011854979283798441,"score_gpt":0.2850344649332761,"score_spread":0.2731794856494777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094539119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005312646,0.000026154265,0.92514,0.0051497393,0.00013098211,0.00004249897,5.0325815e-7,0.0007224044,0.068256415],"genre_scores_gemma":[0.55452,0.00004081235,0.4311049,0.0018185314,0.000059145143,0.0000044603635,0.000007885744,0.0000041173807,0.012440139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990384,0.000030424211,0.00018775821,0.00030612593,0.00024977687,0.00018752195],"domain_scores_gemma":[0.99933463,0.00006424184,0.00006411784,0.00041440633,0.000059288184,0.00006330817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022177,0.00009951339,0.000115016766,0.0003540269,0.000069435984,0.000170105,0.00091977295,0.000048957667,0.00013455073],"category_scores_gemma":[0.000023292509,0.000086565226,0.000101809004,0.00054538244,0.000014345289,0.0002462805,0.0001572707,0.00010745089,0.00017325762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099997305,0.00023833793,0.0006721215,0.0000013208427,0.00033189965,0.000006375903,0.00024902177,0.73414105,0.000059613627,0.08919398,0.04437449,0.1307218],"study_design_scores_gemma":[0.00008400039,0.000009139085,0.0008043504,0.0000048238016,0.00000877217,0.000001511329,0.0000032064477,0.9790941,0.00022444093,0.00049678196,0.01915398,0.000114910654],"about_ca_topic_score_codex":0.0000054900424,"about_ca_topic_score_gemma":0.000036301553,"teacher_disagreement_score":0.55398875,"about_ca_system_score_codex":0.00007444034,"about_ca_system_score_gemma":0.00002129967,"threshold_uncertainty_score":0.35300273},"labels":[],"label_agreement":null},{"id":"W2094660491","doi":"10.1145/2070336.2070351","title":"Stack safe parallel recursion with paraffin","year":2011,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Stack (abstract data type); Call stack; Recursion (computer science); Computer science; Subroutine; Parallel computing; Parallelism (grammar); Feature (linguistics); Algorithm; Programming language; Distributed computing","score_opus":0.028880662582924443,"score_gpt":0.22369745894182513,"score_spread":0.1948167963589007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094660491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037088607,0.00006057974,0.9552073,0.004019258,0.00015647602,0.00019618006,8.4625555e-7,0.0007769904,0.0024937738],"genre_scores_gemma":[0.2543473,0.000022560313,0.7404276,0.004967555,0.00003970309,0.000017706283,0.0000038161365,0.00001748921,0.0001562456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843806,0.00009469804,0.00024585993,0.00049676304,0.00033499178,0.0003896467],"domain_scores_gemma":[0.9983332,0.00012325453,0.00014910183,0.0012095763,0.00006389982,0.00012096319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021460053,0.00021932788,0.0001934289,0.000117692616,0.00015735859,0.00009581616,0.0017219739,0.00006402549,0.000035538924],"category_scores_gemma":[0.00005840958,0.0001820786,0.000055142304,0.00037749516,0.00007193453,0.00046118564,0.00035778608,0.00019057575,0.00006578206],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007206202,0.0010578234,0.016894497,0.00016990298,0.00041243676,0.0011395559,0.020258214,0.043478217,0.007190565,0.053688914,0.75277454,0.10221472],"study_design_scores_gemma":[0.01561709,0.00726477,0.06386962,0.0022572787,0.0002560141,0.0010670904,0.0007984747,0.29803872,0.17422582,0.04810448,0.37344638,0.015054244],"about_ca_topic_score_codex":0.00010982081,"about_ca_topic_score_gemma":0.000009170442,"teacher_disagreement_score":0.37932816,"about_ca_system_score_codex":0.00004103746,"about_ca_system_score_gemma":0.000046620644,"threshold_uncertainty_score":0.74249494},"labels":[],"label_agreement":null},{"id":"W2094908973","doi":"10.1145/1378533.1378568","title":"Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Speedup; Parallel computing; Abstraction; Parallelism (grammar); Multi-core processor; Microprocessor; Degree (music); Architecture; Simple (philosophy); Parallel algorithm; Core (optical fiber); Embedded system","score_opus":0.06627844902667336,"score_gpt":0.2821045407237509,"score_spread":0.21582609169707756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094908973","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014432306,0.00004130086,0.97261393,0.0010830216,0.00014645212,0.00021280342,0.0000011009606,0.0015878412,0.00988122],"genre_scores_gemma":[0.14605546,0.00003001669,0.84819686,0.0012716136,0.000075329226,0.000012665121,0.0000040116647,0.000016398,0.0043376703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998371,0.000053630614,0.00023972966,0.0005769367,0.00034651865,0.0004122084],"domain_scores_gemma":[0.9987942,0.00008346258,0.00009459342,0.0007756453,0.00009226429,0.0001598646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015589426,0.0002587333,0.00023016626,0.00019661627,0.0002754915,0.000083440245,0.0010375082,0.0001197132,0.00003172596],"category_scores_gemma":[0.000054285094,0.00021123009,0.00012362713,0.00040178082,0.00008798003,0.00016136271,0.0002804546,0.00031145377,0.0001953361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007168541,0.00087747216,0.0008998918,0.000026178652,0.000058676294,0.00037314356,0.0027881972,0.8709303,0.00030458564,0.03619434,0.053897034,0.033578504],"study_design_scores_gemma":[0.0010792607,0.0003435146,0.003240952,0.000050696675,0.0000033620051,0.00024955673,0.000011470281,0.9849039,0.0023350907,0.00064075243,0.006522354,0.0006191047],"about_ca_topic_score_codex":0.00002378114,"about_ca_topic_score_gemma":0.000003123765,"teacher_disagreement_score":0.13162315,"about_ca_system_score_codex":0.000034085326,"about_ca_system_score_gemma":0.000079476755,"threshold_uncertainty_score":0.86137134},"labels":[],"label_agreement":null},{"id":"W2095027279","doi":"10.1109/ised.2013.34","title":"Efficient Data Encoding for Improving Fault Simulation Performance on GPUs","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"","keywords":"Computer science; Parallel computing; Graphics; Encoding (memory); Computer architecture; Key (lock); Data deduplication; Computation; Computer engineering; Computer graphics (images); Algorithm; Operating system","score_opus":0.04232949338615005,"score_gpt":0.29431288294057595,"score_spread":0.2519833895544259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095027279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025593879,0.0000075911453,0.97028714,0.00017162462,0.00013964878,0.0003436901,9.830943e-7,0.00052836846,0.0029270605],"genre_scores_gemma":[0.71560633,8.9047484e-7,0.2839386,0.00018928957,0.00003365488,0.000014743517,0.000006512439,0.0000042852125,0.00020567347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991333,0.00001564319,0.00016723968,0.00035162974,0.00014417194,0.00018801338],"domain_scores_gemma":[0.99890876,0.00016444574,0.00007309644,0.0007040243,0.00010915667,0.00004049316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027702565,0.00008737863,0.0000764953,0.00007882947,0.00018168044,0.00019470934,0.00087049295,0.000035580717,0.00000792392],"category_scores_gemma":[0.0000882999,0.000072742885,0.000018958732,0.00014357005,0.000009333121,0.0002970318,0.00031118488,0.000054067725,0.000039446615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001293765,0.00001905238,0.00003146658,0.0000099156905,0.0000013252428,5.4611167e-8,0.00005217726,0.9239219,0.0001783256,0.0016668242,0.00050373154,0.07361392],"study_design_scores_gemma":[0.000121628895,0.00007141542,0.00017079816,0.000011356182,0.000001124368,4.8766003e-7,0.000003574633,0.9970101,0.0020730917,0.00008594552,0.0003438649,0.00010661432],"about_ca_topic_score_codex":0.000018321265,"about_ca_topic_score_gemma":2.8162745e-7,"teacher_disagreement_score":0.69001245,"about_ca_system_score_codex":0.000026012456,"about_ca_system_score_gemma":0.000021473566,"threshold_uncertainty_score":0.29663688},"labels":[],"label_agreement":null},{"id":"W2095232189","doi":"10.1109/ispass.2013.6557159","title":"QTrace: An interface for customizable full system instrumentation","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"x86; Instrumentation (computer programming); Computer science; Operating system; Embedded system; Interface (matter); Source code; Architecture; Open source; Code (set theory); Computer architecture; Software; Programming language","score_opus":0.01481652300712677,"score_gpt":0.27097833764408963,"score_spread":0.25616181463696286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095232189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009007176,0.000012539334,0.984011,0.00026397294,0.00017283713,0.00042693497,4.818477e-7,0.0012257549,0.004879311],"genre_scores_gemma":[0.5095068,9.760022e-7,0.4897291,0.00007703208,0.000018142928,0.00006148304,0.000002415333,0.000004519517,0.0005995301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992778,0.000037748752,0.00018272927,0.00024330572,0.000092503564,0.0001659655],"domain_scores_gemma":[0.9993953,0.000031225674,0.00007016976,0.00029948264,0.00013811221,0.00006572057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017762363,0.00008531161,0.000093784554,0.00007059741,0.00010974807,0.0002996011,0.00046633204,0.000044048527,0.00001937017],"category_scores_gemma":[0.000008786873,0.0000747865,0.00002814119,0.00013450481,0.000010266344,0.00094657484,0.00007356199,0.000038557737,0.00008221722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003946291,0.00035159008,0.0002713759,0.0002809633,0.00005923486,0.0000014020444,0.0025274546,0.14148377,0.009687329,0.5192252,0.10101424,0.22505799],"study_design_scores_gemma":[0.00020595873,0.00013219671,0.00003535094,0.000013588,0.0000014858746,0.0000063958787,0.000101717545,0.98782676,0.010112506,0.0006514715,0.0008042458,0.000108322936],"about_ca_topic_score_codex":0.00007180372,"about_ca_topic_score_gemma":0.0000025721272,"teacher_disagreement_score":0.846343,"about_ca_system_score_codex":0.000049879196,"about_ca_system_score_gemma":0.000022378006,"threshold_uncertainty_score":0.30497047},"labels":[],"label_agreement":null},{"id":"W2095319311","doi":"10.1145/2663345","title":"Revisiting the Complexity of Hardware Cache Coherence and Some Implications","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Illinois at Urbana-Champaign; Defense Advanced Research Projects Agency; National Science Foundation; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Microelectronics Advanced Research Corporation; Qualcomm; Division of Computing and Communication Foundations; Semiconductor Research Corporation","keywords":"Computer science; Cache coherence; Correctness; Protocol (science); Model checking; Exploit; Software; Formal verification; Coherence (philosophical gambling strategy); Embedded system; Programming complexity; Cache; Theoretical computer science; Distributed computing; Parallel computing; Programming language; CPU cache; Software development; Cache algorithms; Computer security","score_opus":0.029602047206979152,"score_gpt":0.2612191057671024,"score_spread":0.23161705856012324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095319311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005008171,0.00009973741,0.988579,0.0101445485,0.000026231197,0.00017583676,0.000012078199,0.00016385621,0.00029789837],"genre_scores_gemma":[0.5407024,0.0001335759,0.4586446,0.00043106364,0.000024867959,0.000019567122,0.000006014667,0.000007120313,0.000030775125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914944,0.00013838924,0.00020565433,0.00027184037,0.00011124189,0.0001234228],"domain_scores_gemma":[0.9989612,0.00023505308,0.00011611784,0.0005518304,0.000085369735,0.000050389808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023004871,0.000119137345,0.00013926746,0.0000930314,0.000425736,0.00008635976,0.00041631327,0.000051165793,0.000004889396],"category_scores_gemma":[0.00005936716,0.00009095575,0.000034707897,0.0002584616,0.00019567789,0.00014375818,0.000032232736,0.00016773253,4.979621e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006216876,0.000018418328,0.000055161414,0.000022053251,0.000013118012,6.956203e-8,0.00048165864,0.73695475,0.00010082034,0.021348285,0.000015141403,0.24098429],"study_design_scores_gemma":[0.0002724532,0.00010080576,0.0018832312,0.00007272534,0.00002607593,0.000026749343,0.000022941345,0.9529589,0.0013072041,0.042493034,0.00063850626,0.00019740236],"about_ca_topic_score_codex":0.000013624851,"about_ca_topic_score_gemma":0.000006200214,"teacher_disagreement_score":0.5402016,"about_ca_system_score_codex":0.000008441675,"about_ca_system_score_gemma":0.000018083456,"threshold_uncertainty_score":0.3709068},"labels":[],"label_agreement":null},{"id":"W2096191533","doi":"10.5555/2555754.2555779","title":"DIME: time-aware dynamic binary instrumentation using rate-based resource allocation","year":2013,"lang":"en","type":"article","venue":"Embedded Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instrumentation (computer programming); Computer science; Overhead (engineering); Scalability; Process (computing); Program analysis; Source code; Embedded system; Dead code; Microcontroller; Code (set theory); Real-time computing; Computer hardware; Code generation; Operating system; Redundant code; Programming language; Set (abstract data type)","score_opus":0.011071592510818688,"score_gpt":0.2541536997458317,"score_spread":0.243082107235013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096191533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046195857,0.00002647259,0.9493973,0.0022198083,0.000079587575,0.00035760147,0.0000014963731,0.0016234384,0.00009839891],"genre_scores_gemma":[0.4722643,0.0000014704776,0.52300715,0.004261493,0.000034816687,0.00004192629,0.00009471319,0.000027040587,0.00026712948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849856,0.00022413337,0.00029654143,0.00043640757,0.0002497007,0.0002946538],"domain_scores_gemma":[0.99883515,0.00013271067,0.00018384749,0.000568451,0.00019732738,0.00008252475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002253825,0.0001962709,0.000161911,0.00020688683,0.00028078177,0.000268919,0.0005930906,0.00012978718,0.00009108861],"category_scores_gemma":[0.000074127616,0.0002039313,0.00006322707,0.0005451408,0.000034593344,0.0006882602,0.0001394983,0.00017727715,0.00019380945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027386068,0.00030106277,0.0012722738,0.00013717599,0.00006682257,0.000034496323,0.0018685589,0.80573934,0.011520151,0.00038118905,0.05756867,0.12108287],"study_design_scores_gemma":[0.00027085203,0.00006362358,0.00085561885,0.000042747644,0.0000057509596,0.000005261627,0.000019901363,0.9944319,0.002949539,0.0007584966,0.00034149495,0.00025481614],"about_ca_topic_score_codex":0.0000408646,"about_ca_topic_score_gemma":5.6283045e-7,"teacher_disagreement_score":0.4263902,"about_ca_system_score_codex":0.00014430482,"about_ca_system_score_gemma":0.00012334493,"threshold_uncertainty_score":0.8316077},"labels":[],"label_agreement":null},{"id":"W2096281944","doi":"10.1109/fccm.2008.8","title":"Scaling Soft Processor Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multithreading; Multiprocessing; Thread (computing); Parallel computing; Field-programmable gate array; Scaling; Computer architecture; Processor design; Embedded system; Operating system","score_opus":0.02633990191473098,"score_gpt":0.247047144560097,"score_spread":0.220707242645366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096281944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016505872,0.00014400498,0.9817849,0.00014014404,0.00012123536,0.00007247277,8.0217774e-8,0.0014604859,0.014626116],"genre_scores_gemma":[0.7386618,0.000018588877,0.25879866,0.00017664237,0.00004018173,0.00000807019,4.2980957e-7,0.0000041241565,0.0022915006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936664,0.000021012487,0.00013519636,0.00018947216,0.00014628941,0.00014141285],"domain_scores_gemma":[0.9995526,0.000036894755,0.000042054115,0.00023520358,0.000086501925,0.00004674065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012105968,0.00006452966,0.00008307668,0.000057175897,0.0001603345,0.00007392494,0.00045827864,0.00003209802,0.0000029627272],"category_scores_gemma":[0.000030521955,0.000053759195,0.000022353443,0.00023525652,0.000018242672,0.00021154486,0.00009134036,0.000048200694,0.000044758817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009975028,0.00038889708,0.0061237593,0.00018064598,0.000056978934,0.00015668324,0.004517468,0.39406532,0.00051519054,0.4222878,0.12817748,0.04351981],"study_design_scores_gemma":[0.000068423884,0.000015447433,0.00010783694,0.000012748222,4.971551e-7,0.00007834322,0.000004953158,0.9940243,0.0010893883,0.0002875253,0.0042009735,0.000109608794],"about_ca_topic_score_codex":0.00001847954,"about_ca_topic_score_gemma":1.3184136e-7,"teacher_disagreement_score":0.7370112,"about_ca_system_score_codex":0.000011488282,"about_ca_system_score_gemma":0.000041748335,"threshold_uncertainty_score":0.21922363},"labels":[],"label_agreement":null},{"id":"W2096737383","doi":"10.1109/pdse.1997.596845","title":"Non-stop monitoring and debugging on shared-memory multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Debugging; Computer science; Shared memory; Multiprocessing; Audit; Algorithmic program debugging; Embedded system; Parallel computing; Operating system","score_opus":0.02376068336943462,"score_gpt":0.25344211386746984,"score_spread":0.22968143049803522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096737383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034831945,0.00025498212,0.9293686,0.0005996411,0.00020852333,0.00012359365,2.5725177e-7,0.0016656297,0.032946836],"genre_scores_gemma":[0.80446887,0.000044382807,0.19402978,0.0001627939,0.000048547754,0.0000062782524,1.7160473e-7,0.000006239768,0.001232961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926883,0.0000111883555,0.00011843081,0.0002879927,0.00013562679,0.00017792099],"domain_scores_gemma":[0.9995619,0.000048580263,0.000039675564,0.00024377495,0.000038132737,0.00006794777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096269636,0.00010241329,0.000090408306,0.00010451696,0.00015336549,0.00015858648,0.0003414468,0.000039932227,0.00001487726],"category_scores_gemma":[0.000021491789,0.00009232781,0.000020229745,0.00018247234,0.00001511728,0.00027539345,0.0001355317,0.000092807066,0.000036247373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010295787,0.00038691686,0.015346912,0.00012228392,0.000051105217,0.000077430785,0.012557198,0.05494252,0.0014074447,0.0061176443,0.026257155,0.8827231],"study_design_scores_gemma":[0.00017330993,0.000045673656,0.0015468752,0.000052905798,0.000001243299,0.0000068382215,0.00001733288,0.9865285,0.010985732,0.00014134111,0.00033084207,0.00016940196],"about_ca_topic_score_codex":0.000010477553,"about_ca_topic_score_gemma":1.7636947e-7,"teacher_disagreement_score":0.93158597,"about_ca_system_score_codex":0.000016816786,"about_ca_system_score_gemma":0.000004482836,"threshold_uncertainty_score":0.37650192},"labels":[],"label_agreement":null},{"id":"W2096904092","doi":"10.1109/shpcc.1994.296698","title":"Efficiency and scalability of two parallel QR factorization algorithms","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; QR decomposition; Computer science; Algorithm; Matrix decomposition; Factorization; Parallel algorithm; Representation (politics); Matrix (chemical analysis); Theoretical computer science; Parallel computing; Eigenvalues and eigenvectors","score_opus":0.023378334713486878,"score_gpt":0.2614897545465199,"score_spread":0.23811141983303302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096904092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042496664,0.00009435481,0.99015445,0.0001823144,0.000059584585,0.000096604985,5.065731e-7,0.0003191391,0.0048433756],"genre_scores_gemma":[0.645342,0.00003046481,0.35439363,0.00003904976,0.0000088619345,0.0000018609463,5.02562e-7,0.0000022107558,0.00018141848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921054,0.000048743495,0.00020725877,0.00025021922,0.00015738391,0.00012583588],"domain_scores_gemma":[0.9994309,0.00006028955,0.000072531926,0.00029409764,0.00009155857,0.00005062375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018391428,0.00008105167,0.000116822266,0.00006807759,0.00006585751,0.000046738714,0.00029385017,0.00003446201,0.000030029836],"category_scores_gemma":[0.000040547715,0.00006916121,0.00002522993,0.00030437708,0.000053637486,0.00020598936,0.00012381912,0.000047694342,0.000004990497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007369648,0.0013308387,0.051545244,0.00012078022,0.00004175156,0.000005417814,0.004752276,0.07571307,0.0013602587,0.41696024,0.004228275,0.44393447],"study_design_scores_gemma":[0.00018924887,0.0000563923,0.0016499333,0.0000052445903,0.0000013142491,0.000002727279,0.0000030126323,0.99322474,0.0013927912,0.0032773751,0.00010603917,0.00009120257],"about_ca_topic_score_codex":0.000026235768,"about_ca_topic_score_gemma":8.1552577e-7,"teacher_disagreement_score":0.91751164,"about_ca_system_score_codex":0.000011107025,"about_ca_system_score_gemma":0.000006950971,"threshold_uncertainty_score":0.28203124},"labels":[],"label_agreement":null},{"id":"W2097145414","doi":"10.1109/iccl.1994.288377","title":"Taming control flow: a structured approach to eliminating goto statements","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Goto; Compiler; Programming language; Abstract syntax tree; Control flow; Testbed; Theoretical computer science; Parsing; World Wide Web","score_opus":0.023225140189293676,"score_gpt":0.271920122659508,"score_spread":0.24869498247021432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097145414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060748326,0.000026286907,0.9647426,0.00026815463,0.000083935905,0.00028697564,0.0000012353498,0.0007498293,0.0332335],"genre_scores_gemma":[0.46041393,0.0000015597228,0.5381402,0.00076647656,0.000019411515,0.00001761164,9.129208e-7,0.0000054987395,0.00063442835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874836,0.000063429674,0.0002518594,0.00037559867,0.00026206372,0.00029870265],"domain_scores_gemma":[0.9993124,0.000042133015,0.0000691229,0.00037440314,0.000088432396,0.0001134817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023097233,0.00013645817,0.00015064926,0.0001321545,0.0001575225,0.0002099834,0.0006675687,0.000040855415,0.00002807121],"category_scores_gemma":[0.0000474586,0.00012148152,0.00003849088,0.0003697091,0.000010136997,0.00032171153,0.00017034386,0.00008542792,0.000034703724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009070464,0.00032015922,0.00032768026,0.000047302732,0.00007398222,0.000008724558,0.0097362045,0.3831171,0.0007040215,0.037860915,0.03448466,0.5333102],"study_design_scores_gemma":[0.00034030707,0.00004516192,0.00008795212,0.000008703342,0.000002104082,0.000003565784,0.000027937811,0.99740005,0.00053495454,0.00031013283,0.0010747097,0.00016444258],"about_ca_topic_score_codex":0.0000115420025,"about_ca_topic_score_gemma":4.497462e-7,"teacher_disagreement_score":0.6142829,"about_ca_system_score_codex":0.0000403032,"about_ca_system_score_gemma":0.0000070408923,"threshold_uncertainty_score":0.49538726},"labels":[],"label_agreement":null},{"id":"W2097697106","doi":"","title":"Tough2_MP: A parallel version of TOUGH2","year":2003,"lang":"en","type":"paratext","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Lawrence Berkeley National Laboratory; Laboratory Directed Research and Development; U.S. Department of Energy","keywords":"Computer science; Algorithm","score_opus":0.010204086954225743,"score_gpt":0.1820242617473551,"score_spread":0.17182017479312933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097697106","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16083962,0.0010906709,0.47103477,0.0006829806,0.0011260468,0.0017115785,0.0059653264,0.000895056,0.35665393],"genre_scores_gemma":[0.21109527,0.004908353,0.23751326,0.00022037995,0.00012247612,1.1367679e-7,0.0052195643,0.00014827661,0.5407723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99698246,0.00018072678,0.0005054515,0.0010323537,0.00074437086,0.0005546311],"domain_scores_gemma":[0.9963372,0.00018866634,0.0014677258,0.0013217403,0.0003614893,0.00032319565],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000091070426,0.0006119611,0.0012472334,0.0009753631,0.00029051414,0.00008691651,0.0043091364,0.00040972477,0.0011659293],"category_scores_gemma":[0.00001942811,0.0008353376,0.0007240551,0.0016314539,0.000665038,0.003722479,0.002183081,0.0005336541,0.0008941665],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036320766,0.00085184176,0.330081,0.0006833391,0.0004982222,0.00016863394,0.000182064,0.010597384,1.5064715e-7,0.0009086217,0.6459728,0.009692761],"study_design_scores_gemma":[0.002128932,0.00086890504,0.22787915,0.0005289201,0.00016121639,0.00002012607,0.000041485215,0.0034380788,0.00004626908,0.00014319379,0.7632872,0.0014565253],"about_ca_topic_score_codex":0.00023808301,"about_ca_topic_score_gemma":0.00008819135,"teacher_disagreement_score":0.23352152,"about_ca_system_score_codex":0.00009722688,"about_ca_system_score_gemma":0.00070397684,"threshold_uncertainty_score":0.9998838},"labels":[],"label_agreement":null},{"id":"W2097971372","doi":"10.1109/cgo.2005.14","title":"Context Threading: A Flexible and Efficient Dispatch Technique for Virtual Machine Interpreters","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pentium; PowerPC; Threading (protein sequence); Operating system; Context switch; Branch predictor; Virtual machine; Java; Parallel computing; Control flow; Embedded Java; Java concurrency; Bytecode; Context (archaeology); Multithreading; Programming language; Thread (computing); Real time Java; Software","score_opus":0.012186649777086951,"score_gpt":0.26476810187101973,"score_spread":0.2525814520939328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097971372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012745291,0.00010559514,0.99437016,0.0012443952,0.0000661115,0.00044390152,0.0000024823835,0.0008040621,0.0016887694],"genre_scores_gemma":[0.6045116,0.0000067184887,0.39446878,0.00047686868,0.00001748485,0.00005999685,0.0000015529058,0.000006620185,0.00045034778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.000025605212,0.00020198288,0.00034324935,0.00010204896,0.00021803936],"domain_scores_gemma":[0.9994059,0.00011383371,0.00005895737,0.00028317852,0.00005680105,0.00008129205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030233397,0.00013651352,0.00015127657,0.00011799833,0.00011991676,0.00013350946,0.00041947415,0.0000567824,0.0000065252757],"category_scores_gemma":[0.00003211514,0.000114484275,0.000051170846,0.0001443237,0.00004389942,0.00014799235,0.00022863902,0.000078815145,0.000004718276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012516878,0.00034115,0.0006152808,0.000049894297,0.000054674554,0.0000030359986,0.0029610759,0.03320718,0.005099806,0.60546726,0.013711322,0.33836415],"study_design_scores_gemma":[0.00027001923,0.0002502773,0.000023409033,0.00003228597,0.0000027089895,0.000015888512,0.000014040839,0.95249933,0.04268486,0.0008044862,0.0032212262,0.00018144137],"about_ca_topic_score_codex":0.000020916144,"about_ca_topic_score_gemma":0.0000069933662,"teacher_disagreement_score":0.91929215,"about_ca_system_score_codex":0.00003730391,"about_ca_system_score_gemma":0.000021082007,"threshold_uncertainty_score":0.46685335},"labels":[],"label_agreement":null},{"id":"W2098010876","doi":"10.1109/icpp.2007.21","title":"Automatic Trace-Based Parallelization of Java Programs","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Automatic parallelization; Java; TRACE (psycholinguistics); Parallel computing; Suite; Benchmark (surveying); Parallelism (grammar); Programming language; Compiler","score_opus":0.041380483445933,"score_gpt":0.29546463940185963,"score_spread":0.25408415595592665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098010876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089561604,0.000061911895,0.8806256,0.0022102497,0.0002086041,0.00041468427,0.0000011421531,0.00037198703,0.026544202],"genre_scores_gemma":[0.8314986,0.000007054255,0.16817883,0.0001292591,0.000027382051,0.000013064743,0.0000018861471,0.000010483098,0.00013344108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997971,0.000010208955,0.0006439909,0.00033542723,0.00079911674,0.00024023524],"domain_scores_gemma":[0.9976166,0.00004614146,0.0008974285,0.00017427145,0.0012087933,0.00005677051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079429266,0.000189627,0.0002287947,0.0002408057,0.00012028501,0.00019484156,0.0020058306,0.00009252974,0.000013783215],"category_scores_gemma":[0.00015591236,0.00014652888,0.00011014617,0.0005298175,0.00012976713,0.00047420943,0.00018233963,0.00017296536,0.000002208926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019822361,0.0011255763,0.013074828,0.0006592541,0.00009390747,0.0000019563183,0.00211116,0.01047776,0.020081077,0.6093707,0.0007713171,0.34203422],"study_design_scores_gemma":[0.00046700813,0.00014337095,0.0020892827,0.0007917974,0.000010069543,0.0000069039284,0.00008942277,0.9432609,0.039013598,0.013741056,0.00017259666,0.00021397092],"about_ca_topic_score_codex":0.000009060111,"about_ca_topic_score_gemma":0.0000017176109,"teacher_disagreement_score":0.9327832,"about_ca_system_score_codex":0.000063136664,"about_ca_system_score_gemma":0.00016525209,"threshold_uncertainty_score":0.59752744},"labels":[],"label_agreement":null},{"id":"W2098161986","doi":"10.1109/fccm.2006.65","title":"Sparse Matrix-Vector Multiplication for Finite Element Method Matrices on FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Parallel computing; Stratix; Field-programmable gate array; Pipeline (software); Sparse matrix; FLOPS; Scalability; Vector processor; Matrix multiplication; Computational science; Computer hardware","score_opus":0.023805332830764057,"score_gpt":0.3181352119325712,"score_spread":0.29432987910180713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098161986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013745355,0.00004629143,0.99393755,0.0011572173,0.000088742665,0.0004242274,0.0000035706603,0.00085681357,0.0033481594],"genre_scores_gemma":[0.0579727,0.00001010954,0.9395619,0.00029737994,0.00009594961,0.000093466384,0.000015221999,0.0000093032095,0.0019439659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891573,0.000056250206,0.0002712594,0.00037070626,0.00017257157,0.00021350398],"domain_scores_gemma":[0.9989436,0.0003606954,0.00013665744,0.00041072196,0.00011016956,0.00003815747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004233727,0.00012718886,0.00012534295,0.00014682185,0.00013207481,0.00013981799,0.0004828767,0.00005181477,0.000011639795],"category_scores_gemma":[0.00003678077,0.000110166315,0.00007159539,0.00027978985,0.000007758714,0.00014835836,0.00008001198,0.00004950369,0.00003797781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022713968,0.0002643994,0.00015591472,0.000028820847,0.000014602022,0.0000011328361,0.00008082854,0.40358755,0.0006815302,0.51463646,0.0440595,0.036466587],"study_design_scores_gemma":[0.0002804828,0.000105293766,0.0002751664,0.000008531639,0.0000040759023,0.000001162411,0.0000021367134,0.95287097,0.01850541,0.006697074,0.021095393,0.00015431408],"about_ca_topic_score_codex":0.00007225397,"about_ca_topic_score_gemma":0.000005394057,"teacher_disagreement_score":0.54928344,"about_ca_system_score_codex":0.000042251824,"about_ca_system_score_gemma":0.000022163378,"threshold_uncertainty_score":0.44924518},"labels":[],"label_agreement":null},{"id":"W2098214931","doi":"10.1002/spe.565","title":"The design and implementation of a modular and extensible Java Virtual Machine","year":2004,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operating system; Java; Modular design; Scalability; Virtual machine; Real time Java","score_opus":0.013676508410170783,"score_gpt":0.30438655216779303,"score_spread":0.29071004375762227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098214931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041024014,0.0016600654,0.95630145,0.00075398176,0.00003114839,0.00013271712,4.138712e-7,0.000083249724,0.000012949744],"genre_scores_gemma":[0.55249476,0.0012979396,0.44596848,0.00021176584,0.000005103079,0.000012055801,3.0331427e-7,0.0000027837757,0.0000068038516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.00007203121,0.0001440094,0.00021335547,0.00012835156,0.00011898623],"domain_scores_gemma":[0.99922186,0.0003531963,0.00011313676,0.00017760407,0.000087749235,0.000046463585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038283237,0.00007670658,0.00007748171,0.000030766187,0.00029052453,0.00014999982,0.00014847323,0.000023975756,6.090468e-7],"category_scores_gemma":[0.00022765154,0.000057865007,0.000008259951,0.00012634444,0.00011206102,0.000768776,0.00016479308,0.000059545666,3.2386492e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013161574,0.00013191058,0.0022225552,0.000043642733,0.00005298624,0.000032719254,0.07894207,0.009813962,0.002683263,0.10113701,0.0002255436,0.8045827],"study_design_scores_gemma":[0.008741699,0.007234491,0.01806539,0.0004614262,0.00016715105,0.0027471725,0.053488318,0.5876663,0.18679123,0.10386534,0.027856061,0.0029154723],"about_ca_topic_score_codex":0.00016940458,"about_ca_topic_score_gemma":0.0000037607297,"teacher_disagreement_score":0.8016673,"about_ca_system_score_codex":0.00000798093,"about_ca_system_score_gemma":0.00004025056,"threshold_uncertainty_score":0.23596665},"labels":[],"label_agreement":null},{"id":"W2098278566","doi":"10.1145/1735970.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":511,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Thread (computing); Gang scheduling; Shared memory; Cache; Fair-share scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Computer network","score_opus":0.035836779006964116,"score_gpt":0.2961899832905564,"score_spread":0.26035320428359227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098278566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07983054,0.00005629673,0.91602284,0.002070299,0.00034174236,0.0004443374,0.0000013618496,0.0008999381,0.00033265806],"genre_scores_gemma":[0.41729048,0.0000022557672,0.5817139,0.0006830686,0.0002249908,0.000025700258,0.000013118537,0.00002187723,0.000024609784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971997,0.00022242077,0.0005568389,0.0009120731,0.00047287092,0.00063609675],"domain_scores_gemma":[0.9976546,0.0004256958,0.00021961285,0.0013358592,0.00016322352,0.00020099487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005965667,0.00034835134,0.00036714954,0.0005634263,0.0002544684,0.00045685284,0.0026713389,0.00020564704,0.0000094697625],"category_scores_gemma":[0.00035703843,0.00032388102,0.00012812113,0.00081063434,0.00010419993,0.0003825691,0.0012911463,0.0012646661,0.000013623778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004434001,0.00023155562,0.0056155557,0.00009795051,0.000028885079,0.00007257369,0.0055598137,0.12534478,0.011921461,0.00087949325,0.00077776477,0.8494258],"study_design_scores_gemma":[0.000978102,0.00012213674,0.0050401604,0.0002361143,0.0000048983397,0.00009334418,0.000011756944,0.9791233,0.0028149497,0.007675485,0.0034132448,0.00048651602],"about_ca_topic_score_codex":0.000087021865,"about_ca_topic_score_gemma":0.00016423262,"teacher_disagreement_score":0.8537785,"about_ca_system_score_codex":0.000039610353,"about_ca_system_score_gemma":0.00009370051,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W2098310622","doi":"10.1145/1128022.1128066","title":"Lazy direct-to-cache transfer during receive operations in a message passing environment","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Computer science; Cache; Message passing; Cache coherence; Latency (audio); Copying; Cache invalidation; Parallel computing; Thread (computing); Computer network; Distributed computing; Cache algorithms; CPU cache; Operating system; Telecommunications","score_opus":0.00924542125217983,"score_gpt":0.2178331078656996,"score_spread":0.20858768661351976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098310622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044884514,0.000033748565,0.9341213,0.0010709523,0.00003043082,0.0001694576,6.878942e-7,0.00035450092,0.019334374],"genre_scores_gemma":[0.77842605,0.000012256341,0.21989977,0.00013790086,0.00002039737,0.000028524879,0.000001878866,0.0000064286,0.0014667687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.000072410025,0.0002230949,0.00032463914,0.00014483098,0.00021027724],"domain_scores_gemma":[0.99963284,0.000026032822,0.000009117529,0.00027252897,0.000012910378,0.00004654793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017567548,0.00010712247,0.00011705154,0.00015100274,0.00013739914,0.00014065887,0.00030693685,0.000042869367,0.000028468836],"category_scores_gemma":[0.0000066581006,0.00010086017,0.000032319553,0.00028404777,0.000013813304,0.00022617927,0.00008283982,0.00008388938,0.00002861771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004098702,0.00018335358,0.0011617285,0.000006621619,0.0000059309496,0.000017818233,0.001035726,0.9707925,0.008400546,0.014053127,0.0006451934,0.0036934044],"study_design_scores_gemma":[0.00083597144,0.00007777486,0.034183744,0.00008516009,0.0000057874454,0.000011473979,0.000035124183,0.8402067,0.11869574,0.0008606593,0.0042836443,0.0007182396],"about_ca_topic_score_codex":0.00020184458,"about_ca_topic_score_gemma":0.00009669679,"teacher_disagreement_score":0.73354155,"about_ca_system_score_codex":0.0000812266,"about_ca_system_score_gemma":0.000017732833,"threshold_uncertainty_score":0.41129583},"labels":[],"label_agreement":null},{"id":"W2098337892","doi":"10.1007/3-540-45401-2_10","title":"Correcting Errors in Message Passing Systems","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Debugger; Message passing; Debugging; Abstraction; Programming language; Distributed computing; Parallel computing; Theoretical computer science","score_opus":0.02131431841208247,"score_gpt":0.26051443355630816,"score_spread":0.23920011514422568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098337892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009278089,0.00073190336,0.98120505,0.0002511996,0.002431078,0.00038252465,9.960072e-7,0.00056723907,0.014337209],"genre_scores_gemma":[0.39865935,0.000089721885,0.5989788,0.0007378953,0.0004867992,0.00001778829,0.0000051914094,0.000067479574,0.00095693977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958142,0.00009123038,0.00079737947,0.0015956663,0.00088659755,0.00081494305],"domain_scores_gemma":[0.99747396,0.0005005185,0.00046069917,0.0012125483,0.00020302084,0.00014925083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016264849,0.0005546703,0.00066678924,0.0015663757,0.00029342438,0.0009138363,0.0031130265,0.00039871025,0.0000076882525],"category_scores_gemma":[0.00013964334,0.00055124774,0.00010832323,0.0012751512,0.00033572598,0.0006273218,0.0011675302,0.0010961063,0.000017176137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002417382,0.00002246872,0.00025322946,0.00003375907,0.000004501205,0.00019652053,0.0006631273,0.6139554,0.000013072925,0.00505081,0.000040375107,0.37976435],"study_design_scores_gemma":[0.00018389543,0.00006856222,0.00006326767,0.0011328106,0.0000028965017,0.00023638345,4.76933e-7,0.9790432,0.00023785316,0.01753241,0.0008367608,0.000661482],"about_ca_topic_score_codex":0.00012901473,"about_ca_topic_score_gemma":0.00007355832,"teacher_disagreement_score":0.39856657,"about_ca_system_score_codex":0.0005447517,"about_ca_system_score_gemma":0.00044332765,"threshold_uncertainty_score":0.99969393},"labels":[],"label_agreement":null},{"id":"W2098412892","doi":"10.1109/mascot.1995.378646","title":"Interval-based performance analysis of computing systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Interval arithmetic; Interval (graph theory); Context (archaeology); Computer science; Key (lock); Affine arithmetic; Arithmetic; Algorithm; Theoretical computer science; Mathematics","score_opus":0.027294432020086083,"score_gpt":0.2481102568552471,"score_spread":0.22081582483516102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098412892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030031977,0.00006578335,0.96144915,0.000069712536,0.000077781275,0.00005160184,3.609994e-7,0.00042652132,0.007827139],"genre_scores_gemma":[0.87042654,0.000006200162,0.12920332,0.00010971343,0.000007787284,0.0000011330205,0.0000011270378,0.0000027002823,0.000241505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999147,0.000051836683,0.00029256922,0.00019761341,0.00017433455,0.00013663823],"domain_scores_gemma":[0.9992321,0.00007591332,0.00014118664,0.0004014027,0.00011333002,0.0000360432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025300187,0.00008010506,0.00022712129,0.00039624824,0.00005812927,0.00006437397,0.00056470855,0.00003174412,0.000025020014],"category_scores_gemma":[0.000012769248,0.00006951435,0.00009681598,0.001417563,0.00002158817,0.00012353974,0.00009449622,0.00005042836,0.000009664103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.0081356e-7,0.000055042106,0.006395004,0.000024251944,0.00010608528,7.605848e-7,0.00026541908,0.98080593,0.000022198728,0.004304606,0.0010770233,0.0069430657],"study_design_scores_gemma":[0.00006846484,0.000041230014,0.0018591618,0.0000225978,0.000025902355,6.794259e-7,0.000004001123,0.9970107,0.00074320036,0.0000027545968,0.00013771668,0.000083581006],"about_ca_topic_score_codex":0.000027021668,"about_ca_topic_score_gemma":6.200979e-7,"teacher_disagreement_score":0.84039456,"about_ca_system_score_codex":0.00001991988,"about_ca_system_score_gemma":0.00000662264,"threshold_uncertainty_score":0.28347132},"labels":[],"label_agreement":null},{"id":"W2098683262","doi":"10.1109/ccece.2007.135","title":"EP32 - a 32-bit Foth Micorprocessor","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Goddard Space Flight Center","keywords":"Computer science; Reduced instruction set computing; Microprocessor; Instruction set; VHDL; 32-bit; Stack (abstract data type); 16-bit; Computer architecture; Bit (key); Computer hardware; Embedded system; Operating system; Field-programmable gate array","score_opus":0.01332214587791826,"score_gpt":0.26454729409025707,"score_spread":0.2512251482123388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098683262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015402186,0.000053197164,0.92482555,0.00038893163,0.00009530751,0.000061188286,1.2144027e-7,0.0011461667,0.07188933],"genre_scores_gemma":[0.34273568,0.0000061588453,0.6530461,0.0010759146,0.000041660573,0.0000021348405,6.705727e-7,0.0000051734964,0.0030864964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991817,0.000011699518,0.00017006042,0.00024315996,0.00015373563,0.00023966249],"domain_scores_gemma":[0.9994219,0.00005714942,0.000052482974,0.00031607534,0.00007599745,0.000076425305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040061114,0.0000852513,0.00008579332,0.00010753737,0.000084707426,0.00009584368,0.00063311536,0.00004623247,0.000024591225],"category_scores_gemma":[0.000027499173,0.000073597665,0.000035557096,0.00037126621,0.000018240251,0.00020931463,0.00014287388,0.00007035115,0.00007461437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021984577,0.00033841518,0.0036489705,0.000039887575,0.000033761982,0.00007319716,0.0013905407,0.002024409,0.0015918529,0.6751707,0.083874464,0.23179176],"study_design_scores_gemma":[0.00092467945,0.00032585027,0.004489389,0.000059737104,0.000007792365,0.00012352964,0.000044651697,0.71595055,0.12090777,0.04716883,0.108860575,0.0011366803],"about_ca_topic_score_codex":0.000013732923,"about_ca_topic_score_gemma":0.000005598846,"teacher_disagreement_score":0.71392614,"about_ca_system_score_codex":0.000018220278,"about_ca_system_score_gemma":0.00002973971,"threshold_uncertainty_score":0.30012256},"labels":[],"label_agreement":null},{"id":"W2099051446","doi":"10.1557/opl.2015.113","title":"Parallelization of Molecular-Dynamics Simulations Using Tasks","year":2015,"lang":"en","type":"article","venue":"MRS Proceedings","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Xeon Phi; Parallel computing; Vectorization (mathematics); Molecular dynamics; Coprocessor; SIMD; Computer science; Task (project management); Computational science; Scheme (mathematics); Computational chemistry; Mathematics; Chemistry","score_opus":0.03525838561823606,"score_gpt":0.28893014854426063,"score_spread":0.25367176292602456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099051446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09781945,0.000033511307,0.89905375,0.00015303698,0.00005604802,0.00010380614,0.0000010936184,0.00026661908,0.002512704],"genre_scores_gemma":[0.6873169,0.0000013326891,0.3125589,0.00005929232,0.000011653878,0.0000014979933,0.000003678923,0.0000065190675,0.00004027218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991846,0.000008993494,0.00022503597,0.00020223115,0.0002353575,0.00014377068],"domain_scores_gemma":[0.9990987,0.0000118600365,0.00015843459,0.00013044085,0.0005265799,0.000073984564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871896,0.00009209136,0.00012048019,0.00014604612,0.000056084566,0.00008177185,0.00038660024,0.000061484345,0.0000011290257],"category_scores_gemma":[0.00010462429,0.00009667012,0.000031638618,0.0005710636,0.000029083354,0.00038355505,0.00014420801,0.00006118093,0.0000016804389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000922003,0.000113846516,0.007271741,0.000044466844,0.000024030416,0.0000023481923,0.00270399,0.6538211,0.0052809264,0.3262747,0.0009858257,0.0034678068],"study_design_scores_gemma":[0.00014785922,0.0000378101,0.000064843,0.000019741527,0.000004834456,0.000004941467,0.00002429455,0.98321,0.00607922,0.010174136,0.0001250818,0.00010722717],"about_ca_topic_score_codex":0.000018620889,"about_ca_topic_score_gemma":6.108391e-7,"teacher_disagreement_score":0.58949745,"about_ca_system_score_codex":0.00009347227,"about_ca_system_score_gemma":0.000102132704,"threshold_uncertainty_score":0.3942093},"labels":[],"label_agreement":null},{"id":"W2099063269","doi":"10.1109/tc.2008.223","title":"An Optimized Cell BE Special Function Library Generated by Coconut","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Computer science; Digital subscriber line; Haskell; Programming language; Compiler; Domain-specific language; Functional programming; Parallel computing","score_opus":0.011188650917468863,"score_gpt":0.22342114674334304,"score_spread":0.21223249582587417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099063269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013094923,0.000024703902,0.99184805,0.0010870757,0.0015461273,0.00025605728,0.000012863314,0.002141579,0.0017740565],"genre_scores_gemma":[0.44095358,0.00008228171,0.550811,0.0067743226,0.00046375443,0.000017507708,0.000045207846,0.0000331623,0.0008191943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824977,0.00018129981,0.0003389557,0.00061769213,0.00027720016,0.00033509993],"domain_scores_gemma":[0.9989371,0.00006460065,0.00010993799,0.0006138253,0.000060129238,0.00021440684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117570475,0.00027994,0.00024443242,0.00027319262,0.00035263956,0.00044029567,0.0008249035,0.00014425787,0.00007376666],"category_scores_gemma":[5.5933435e-7,0.0002954164,0.00013050057,0.0006163957,0.000037191854,0.0011350625,0.0000034567038,0.0002896232,0.000030726438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376098,0.00066171074,9.68306e-7,0.0000033049268,0.000021105898,0.000008744553,0.00020464206,0.8092146,0.0020977007,0.0003257614,0.09970864,0.08765907],"study_design_scores_gemma":[0.0010125155,0.00088387873,0.000013882389,0.000015616513,0.000013624724,0.000008377252,0.0000053695408,0.92973316,0.061776616,0.00022394446,0.0059143994,0.00039859404],"about_ca_topic_score_codex":0.000006023598,"about_ca_topic_score_gemma":3.7608345e-7,"teacher_disagreement_score":0.44103706,"about_ca_system_score_codex":0.000044813572,"about_ca_system_score_gemma":0.00007255529,"threshold_uncertainty_score":0.9999498},"labels":[],"label_agreement":null},{"id":"W2099063684","doi":"10.1109/hpcs.2006.25","title":"Fortran 90 Code For Molecular Numerical Integration","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fortran; Computer science; Numerical integration; Code (set theory); Scheme (mathematics); Programming language; Computational science; Parallel computing; Numerical analysis; Theoretical computer science; Mathematics","score_opus":0.011824765909611309,"score_gpt":0.26311310180492675,"score_spread":0.25128833589531546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099063684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038084842,0.000020063608,0.9896274,0.0007508178,0.00005410489,0.00014366432,0.0000010048527,0.0006433003,0.008378783],"genre_scores_gemma":[0.42691973,5.0295796e-7,0.572517,0.0002442448,0.000017951206,0.000015084815,0.000005140566,0.0000033877213,0.000277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.000015631318,0.00013752845,0.00018266126,0.00008847903,0.00012591943],"domain_scores_gemma":[0.99965674,0.00003079454,0.000034710763,0.00018547552,0.00006880642,0.000023472752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009828097,0.00006641856,0.00007225439,0.000045648176,0.000060391765,0.00008446757,0.00027328418,0.000035156147,0.0000034412747],"category_scores_gemma":[0.000012524618,0.00005713679,0.000051422427,0.00014423685,0.000009167968,0.00012878247,0.000030647185,0.000033463537,0.000004647788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030969807,0.000056359448,0.00004976771,0.000003409407,0.0000033381455,0.0000015561322,0.000029927087,0.017758016,0.0015290936,0.9387152,0.016621014,0.025229193],"study_design_scores_gemma":[0.000120418066,0.00004961763,0.0000968342,0.0000034677819,0.0000014699233,0.0000028494387,0.0000012281688,0.9237795,0.038784053,0.031424265,0.0056429245,0.000093399154],"about_ca_topic_score_codex":0.000024035551,"about_ca_topic_score_gemma":0.0000048065685,"teacher_disagreement_score":0.90729094,"about_ca_system_score_codex":0.000014484963,"about_ca_system_score_gemma":0.000016783943,"threshold_uncertainty_score":0.23299706},"labels":[],"label_agreement":null},{"id":"W2099336824","doi":"10.1145/1028176.1006715","title":"Power Awareness through Selective Dynamically Optimized Traces","year":2004,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Microarchitecture; Power (physics); Performance improvement; Key (lock); Energy (signal processing); Power budget; Constraint (computer-aided design); Resource (disambiguation); Path (computing); Real-time computing; Embedded system; Distributed computing; Operating system; Power control; Computer network; Operations management; Engineering","score_opus":0.01216643267776838,"score_gpt":0.27179582899665694,"score_spread":0.25962939631888854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099336824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008816339,0.00012646287,0.97988033,0.0061291293,0.00050563045,0.0005506732,0.000004114454,0.0019525876,0.0020347014],"genre_scores_gemma":[0.23647527,0.000026358712,0.76106054,0.002132814,0.00017761423,0.000039422615,0.00001152945,0.00003611584,0.000040318977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964282,0.000307623,0.0005712112,0.0012116958,0.0006530648,0.0008282314],"domain_scores_gemma":[0.99701446,0.00049503054,0.0002139974,0.0017752068,0.0002725425,0.00022876234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032280775,0.00053291256,0.0005768419,0.00029075207,0.0004211146,0.00042712459,0.0038576894,0.0002109495,0.0000125097495],"category_scores_gemma":[0.00014855733,0.0004633352,0.0002676012,0.0010296433,0.00016474565,0.0005127068,0.0015375179,0.0007405799,0.000035910216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006768106,0.00034478185,0.00018277952,0.000026011798,0.00013154784,0.0000896542,0.008004428,0.9232807,0.0003949462,0.014984343,0.00218237,0.050310746],"study_design_scores_gemma":[0.00839819,0.0026668159,0.0037671935,0.00045120594,0.000049594793,0.0008214979,0.00004738277,0.3641308,0.014641776,0.58396596,0.017799852,0.0032597561],"about_ca_topic_score_codex":0.0001567673,"about_ca_topic_score_gemma":0.0000294368,"teacher_disagreement_score":0.5689816,"about_ca_system_score_codex":0.00016098116,"about_ca_system_score_gemma":0.0003767767,"threshold_uncertainty_score":0.99978185},"labels":[],"label_agreement":null},{"id":"W2099445129","doi":"10.1109/wcre.2001.957809","title":"Towards a standard schema for C/C++","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Computer science; Schema (genetic algorithms); Programming language; Conceptual schema; Abstract syntax tree; Schema migration; Document Structure Description; Abstract syntax; Database schema; Software engineering; Natural language processing; Information retrieval; Semantics (computer science); Linguistics; World Wide Web; Semi-structured model; XML; Database design; Parsing","score_opus":0.0345314102800552,"score_gpt":0.27704706385332717,"score_spread":0.24251565357327198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099445129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068573834,0.000070539536,0.94900584,0.0016776393,0.000066968976,0.00010613758,8.630302e-7,0.00083041785,0.04817301],"genre_scores_gemma":[0.07189721,0.000015343394,0.92492646,0.0005213668,0.00002867256,0.000016900289,4.4328385e-7,0.0000040451264,0.0025895622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947155,0.000009686018,0.000099795456,0.00017272068,0.00010620695,0.0001400712],"domain_scores_gemma":[0.9995768,0.000026381802,0.000025940839,0.00024490064,0.00008410893,0.000041832907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012852439,0.000059136728,0.00007739964,0.000047300637,0.00007577859,0.000095011805,0.00038306875,0.000029457804,0.0000611167],"category_scores_gemma":[0.000037348353,0.00005055166,0.000042838805,0.00014714859,0.000010885058,0.00014449692,0.00007732451,0.000029288914,0.000020848127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037615891,0.00004595923,0.000029535484,0.0000118941925,0.0000106124035,0.0000016737523,0.0002941633,0.00053614855,0.000059537164,0.5057493,0.24163279,0.2516246],"study_design_scores_gemma":[0.00023680885,0.000113157024,0.0000104850615,0.0000056842923,0.0000010906233,0.0000042611873,0.0000023275993,0.8804401,0.009074613,0.009094997,0.10089458,0.000121901336],"about_ca_topic_score_codex":0.0000020699179,"about_ca_topic_score_gemma":3.2119647e-7,"teacher_disagreement_score":0.879904,"about_ca_system_score_codex":0.000015483572,"about_ca_system_score_gemma":0.000010826836,"threshold_uncertainty_score":0.20614368},"labels":[],"label_agreement":null},{"id":"W2099611798","doi":"10.1109/spdp.1992.242766","title":"SMALL: a scalable multithreaded architecture to exploit large locality","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Locality; Exploit; Computer science; Scalability; Speedup; Parallel computing; Architecture; Synchronization (alternating current); Multithreading; Cache coherence; Yarn; Distributed computing; Computer architecture; Operating system; CPU cache; Cache; Computer network; Cache algorithms; Thread (computing)","score_opus":0.03028608793114877,"score_gpt":0.25786289649159105,"score_spread":0.2275768085604423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099611798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018582739,0.00002678939,0.9778386,0.00068413944,0.00009347526,0.00019734204,8.0348065e-7,0.0011147183,0.0181859],"genre_scores_gemma":[0.25293037,0.00000206666,0.7433102,0.001985492,0.000013016971,0.000018582456,9.0267326e-7,0.000007715348,0.0017316219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987537,0.00011347459,0.0001874996,0.00041384774,0.00016246273,0.0003689743],"domain_scores_gemma":[0.9990525,0.00005066999,0.000035857756,0.0006015456,0.000086102424,0.00017330871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043621776,0.00013827934,0.00014905563,0.00010904257,0.0001354099,0.00013347967,0.00060365564,0.000061968894,0.00004667288],"category_scores_gemma":[0.00012311552,0.00011824707,0.00005252771,0.00053367217,0.000014028265,0.00010079244,0.00017972944,0.00012245239,0.00011938406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019474566,0.0008030642,0.0034634657,0.00004944259,0.00004736828,0.00003421427,0.0030732916,0.07630674,0.0007676371,0.82319903,0.030895028,0.061341234],"study_design_scores_gemma":[0.0017273005,0.00037567946,0.00095686485,0.000095067895,0.000009734493,0.00007070294,0.00011508669,0.552593,0.09902934,0.045179073,0.29828084,0.0015673112],"about_ca_topic_score_codex":0.000035945082,"about_ca_topic_score_gemma":0.00003127512,"teacher_disagreement_score":0.77801996,"about_ca_system_score_codex":0.000028185237,"about_ca_system_score_gemma":0.000047823705,"threshold_uncertainty_score":0.48219755},"labels":[],"label_agreement":null},{"id":"W2099821833","doi":"10.1109/icassp.1994.389627","title":"Application-driven design of DSP architectures and compilers","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Compiler; Computer science; Digital signal processing; Kernel (algebra); Computer architecture; Very long instruction word; Instruction set; Parallelism (grammar); Assembly language; Parallel computing; Code (set theory); Architecture; Code generation; Exploit; Flexibility (engineering); Embedded system; Programming language; Computer hardware; Operating system; Software; Key (lock)","score_opus":0.023608848835972515,"score_gpt":0.23723556919519123,"score_spread":0.2136267203592187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099821833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044332308,0.00008052544,0.9956801,0.0002927222,0.0000103168995,0.000107563734,2.1453856e-7,0.00023829982,0.0031469152],"genre_scores_gemma":[0.5146638,0.000015843418,0.48514873,0.00009439681,0.000004223311,0.0000039616184,1.5351092e-7,0.0000016170347,0.0000672696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955064,0.000035226352,0.0001092316,0.00014910894,0.00007947884,0.00007629034],"domain_scores_gemma":[0.999609,0.0000817119,0.000048189515,0.00019755983,0.000031385764,0.000032145323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069766465,0.000053530563,0.00007777237,0.00006429684,0.000042958316,0.00002294699,0.00028984688,0.000022129,0.000009598633],"category_scores_gemma":[0.000008908773,0.000045750498,0.000013823983,0.00013915462,0.000040577066,0.00003481074,0.00007673594,0.000036121186,0.00000480565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004255758,0.00013881663,0.0020061552,0.000026926024,0.000027353222,0.0000014820641,0.0017102932,0.7331821,0.0024718058,0.09492341,0.013297491,0.15220994],"study_design_scores_gemma":[0.000067089015,0.000032745167,0.00039408117,0.00000368494,9.177085e-7,0.000004010488,0.000001778031,0.99485946,0.002138337,0.0021903235,0.0002504372,0.00005711919],"about_ca_topic_score_codex":0.0000071149093,"about_ca_topic_score_gemma":2.5155725e-7,"teacher_disagreement_score":0.5142205,"about_ca_system_score_codex":0.0000036285514,"about_ca_system_score_gemma":0.0000037910024,"threshold_uncertainty_score":0.18656512},"labels":[],"label_agreement":null},{"id":"W2099952704","doi":"10.1109/mcom.2005.1509971","title":"Accelerating embedded Java for mobile devices","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Porting; Java; Embedded Java; Operating system; Embedded system; Software deployment; Compiler; Virtual machine; Mobile device; Real time Java; strictfp; Software","score_opus":0.05438513489809935,"score_gpt":0.33360518062939426,"score_spread":0.2792200457312949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099952704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009569418,0.0007228793,0.98213834,0.0027673552,0.00011513569,0.00044338522,0.0000040953246,0.0008894701,0.011962427],"genre_scores_gemma":[0.29084212,0.00011257451,0.707409,0.0005719789,0.00009085762,0.00022803042,0.000016433189,0.0000107326805,0.000718244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899733,0.00008715486,0.00034034462,0.00024471802,0.000113826594,0.00021663384],"domain_scores_gemma":[0.9971016,0.00030720953,0.00015970336,0.002111307,0.00025943218,0.00006074124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037707138,0.0001288657,0.00015065471,0.0001194057,0.00044892592,0.00022118945,0.0027175047,0.000055747736,0.000009756421],"category_scores_gemma":[0.000053066033,0.00013198673,0.00006910242,0.0003597005,0.00005382627,0.00051134144,0.00039921014,0.00013268257,0.000100353354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013416069,0.0009995387,0.00037222754,0.00006672644,0.000090004614,8.412034e-7,0.0033787831,0.08600138,0.006559176,0.10486296,0.1773635,0.6202915],"study_design_scores_gemma":[0.00021873118,0.000048591788,0.00008381383,0.000018981716,0.0000050680137,0.0000049298633,0.000010423797,0.77930534,0.0021509193,0.0006280468,0.21735887,0.00016628698],"about_ca_topic_score_codex":0.0000031507486,"about_ca_topic_score_gemma":0.00003053275,"teacher_disagreement_score":0.69330394,"about_ca_system_score_codex":0.000043590288,"about_ca_system_score_gemma":0.000054968932,"threshold_uncertainty_score":0.53822625},"labels":[],"label_agreement":null},{"id":"W2100263618","doi":"10.1109/ipdps.2014.89","title":"BigKernel -- High Performance CPU-GPU Communication Pipelining for Big Data-Style Applications","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Speedup; Parallel computing; Kernel (algebra); Compiler; Memory bandwidth; CUDA; General-purpose computing on graphics processing units; Pipeline (software); Big data; Graphics; Operating system","score_opus":0.05721399631980195,"score_gpt":0.28798371541277457,"score_spread":0.2307697190929726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100263618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046010612,0.000044760192,0.99250615,0.00072316895,0.00010996539,0.00030129415,0.0000048052652,0.0008890829,0.0049606506],"genre_scores_gemma":[0.4689236,0.00006891176,0.52983725,0.00036640558,0.00011346631,0.00009892642,0.00009672819,0.000007933038,0.00048677163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894613,0.000059378992,0.00027329416,0.0003912771,0.00013347452,0.0001964509],"domain_scores_gemma":[0.99714553,0.00028160666,0.00014249519,0.0022171487,0.0001569654,0.000056222078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007790248,0.00011158229,0.00013166814,0.00009354683,0.00037220627,0.0001667102,0.0024651147,0.000057602025,0.0000026842179],"category_scores_gemma":[0.000058472662,0.000105319465,0.000024401339,0.00029567094,0.000039121795,0.00039394345,0.0006952195,0.00009023815,0.00003926605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062665067,0.00012767393,0.00046070293,0.00005860443,0.000017772547,4.0253063e-8,0.00024589963,0.01106073,0.00014029542,0.15870883,0.023613248,0.80555993],"study_design_scores_gemma":[0.00018805325,0.000035960777,0.00032866636,0.000015114284,0.000004230962,0.0000015552215,0.000004816913,0.9054457,0.000762038,0.0023619002,0.09070324,0.00014871739],"about_ca_topic_score_codex":0.000036635764,"about_ca_topic_score_gemma":0.000007616436,"teacher_disagreement_score":0.894385,"about_ca_system_score_codex":0.000017851762,"about_ca_system_score_gemma":0.000045773962,"threshold_uncertainty_score":0.45808372},"labels":[],"label_agreement":null},{"id":"W2100297149","doi":"10.1145/339647.339680","title":"Performance analysis of the Alpha 21264-based Compaq ES40 system","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Microprocessor; Profiling (computer programming); Memory bandwidth; Operating system; Embedded system; Cache; x86; Benchmark (surveying); CPU cache; Multiprocessing; Computer architecture; Parallel computing; Software","score_opus":0.009807210409860259,"score_gpt":0.22141102824372208,"score_spread":0.2116038178338618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100297149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105261356,0.000020346008,0.85256755,0.00023960514,0.00006060626,0.00009602913,0.0000011120349,0.00052156724,0.041231852],"genre_scores_gemma":[0.9445235,0.0000033320741,0.054299023,0.00018744681,0.000007086215,0.0000034705624,0.0000012349701,0.0000026999098,0.00097218936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917275,0.00006976903,0.00022805986,0.00018235524,0.00021933856,0.00012772945],"domain_scores_gemma":[0.99911565,0.00004464921,0.00008362967,0.00065494614,0.00007071104,0.00003040016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021879443,0.00008027095,0.0001803858,0.00013317578,0.00011598681,0.000040791932,0.0009343329,0.000030765004,0.00006758407],"category_scores_gemma":[0.0000033328752,0.000052142685,0.00013069015,0.0015874531,0.000035172503,0.000093643364,0.000057561887,0.000051730312,0.000013338537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004112284,0.000051002717,0.010268234,0.000025024288,0.000105410654,4.6158272e-7,0.0001249254,0.96263534,0.000023816589,0.0063006044,0.00074225385,0.019718837],"study_design_scores_gemma":[0.00007565464,0.00001770585,0.01229225,0.000019336867,0.000038210106,7.312833e-7,0.0000035475155,0.98406565,0.0026441817,0.000004293546,0.0007695849,0.00006886428],"about_ca_topic_score_codex":0.000055418408,"about_ca_topic_score_gemma":0.00000399455,"teacher_disagreement_score":0.8392622,"about_ca_system_score_codex":0.000024996385,"about_ca_system_score_gemma":0.00003623444,"threshold_uncertainty_score":0.2126317},"labels":[],"label_agreement":null},{"id":"W2100320630","doi":"10.29007/8xbv","title":"Beagle as a HOL4 external ATP method","year":2018,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Australian Research Council; Austrian Science Fund; Australian Government","keywords":"Beagle; Computer science; NIST; Theoretical computer science; Algorithm; Speech recognition","score_opus":0.020750352089263596,"score_gpt":0.3285817336613172,"score_spread":0.3078313815720536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100320630","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022183262,0.00011215644,0.96393186,0.00060693355,0.0006724193,0.00011200379,2.1010554e-7,0.000734942,0.011646189],"genre_scores_gemma":[0.36158252,0.0000053322365,0.63713145,0.00068888505,0.00026910502,0.0000025619947,5.009849e-7,0.000009802472,0.0003098417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.00019752239,0.0003942061,0.0005082682,0.00024158735,0.00040941656],"domain_scores_gemma":[0.9988731,0.00022397091,0.00015374496,0.0005552901,0.00011763324,0.00007624378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417741,0.00017706475,0.00023458156,0.00018705091,0.0002581355,0.00021172829,0.0010846729,0.00008238565,0.000041950974],"category_scores_gemma":[0.00019118203,0.00018264103,0.00005868741,0.00065266085,0.0000997358,0.00038390304,0.0007468494,0.0002128612,0.00008926322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006210321,0.00024100074,0.01134093,0.00005964229,0.000048007983,0.00020925429,0.022890653,0.026330395,0.0011871043,0.25520694,0.0036032286,0.6788207],"study_design_scores_gemma":[0.00041801936,0.00035894642,0.0033756848,0.00019016204,0.0000030551294,0.00024836755,0.000064810134,0.9366058,0.013900538,0.03289667,0.011480776,0.00045718095],"about_ca_topic_score_codex":0.00008343315,"about_ca_topic_score_gemma":0.0000052622067,"teacher_disagreement_score":0.9102754,"about_ca_system_score_codex":0.000057994148,"about_ca_system_score_gemma":0.000070441594,"threshold_uncertainty_score":0.7447885},"labels":[],"label_agreement":null},{"id":"W2100525661","doi":"10.1109/hpcs.2007.19","title":"High Performance RDMA-based Multi-port All-gather on Multi-rail QsNet II","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remote direct memory access; Computer science; Scalability; Point (geometry); Port (circuit theory); Data striping; Operating system; Programming language; Mathematics","score_opus":0.03168929631872731,"score_gpt":0.28147435319827735,"score_spread":0.24978505687955005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100525661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04617348,0.000015963076,0.948578,0.00038390807,0.00026341563,0.00018308281,7.3936127e-7,0.0014394798,0.002961904],"genre_scores_gemma":[0.50653934,0.00000513598,0.4886428,0.0018835217,0.000030714524,0.0000052911673,0.0000040743253,0.000011230952,0.0028778529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983822,0.00003447495,0.00034337793,0.00048667856,0.00031266126,0.00044057917],"domain_scores_gemma":[0.99889225,0.00005735746,0.00012451553,0.0006801109,0.00011353077,0.0001322326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737776,0.00022199434,0.00018544853,0.00019804918,0.00023731554,0.00007786613,0.0008526397,0.00011470822,0.000050229693],"category_scores_gemma":[0.000027694523,0.00018890502,0.000065701286,0.00032831327,0.000044989134,0.00021934918,0.00018597778,0.00018996395,0.00011968218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020426551,0.005420882,0.020244872,0.00010774322,0.00016638426,0.00017166095,0.0028358914,0.58338654,0.003193476,0.041495763,0.042676624,0.30009592],"study_design_scores_gemma":[0.00084828836,0.00027528746,0.010274172,0.000027820157,0.0000030435183,0.0000039942433,0.0000040426066,0.9505341,0.031433,0.000027465972,0.0062381844,0.0003305755],"about_ca_topic_score_codex":0.00006704435,"about_ca_topic_score_gemma":0.00001569877,"teacher_disagreement_score":0.4603659,"about_ca_system_score_codex":0.00006118855,"about_ca_system_score_gemma":0.000055285098,"threshold_uncertainty_score":0.77033234},"labels":[],"label_agreement":null},{"id":"W2102472666","doi":"10.1002/cpe.697","title":"Efficient communication using message prediction for clusters of multiprocessors","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Uniprocessor system; Computer science; Message passing; Overhead (engineering); Cache; User space; Multiprocessing; Message broker; Computer network; Locality; Copying; Parallel computing; Distributed computing; Operating system","score_opus":0.046672020603157484,"score_gpt":0.33415638955241295,"score_spread":0.28748436894925544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102472666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07896263,0.0017001071,0.9184812,0.00023701138,0.000084010644,0.00019462712,0.000002235405,0.00008661901,0.0002516134],"genre_scores_gemma":[0.8191488,0.0002875715,0.18043458,0.000090767135,0.0000072245844,0.00001889154,0.0000023957102,0.0000030696056,0.000006704934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917823,0.00008690997,0.0002649768,0.000239235,0.00012494516,0.000105706684],"domain_scores_gemma":[0.99892116,0.00038738814,0.00026366912,0.00014937957,0.00023329411,0.00004510821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002609999,0.0000890241,0.00011363695,0.000075418466,0.0002647847,0.00008566549,0.00016781535,0.000042727486,0.0000013518536],"category_scores_gemma":[0.00021609971,0.0000904993,0.000018833523,0.00020368352,0.00010319456,0.00052570435,0.00009118761,0.00006327682,2.9256324e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008939429,0.00068809616,0.0008917374,0.0003524569,0.000059544236,0.0000022711145,0.1411818,0.35697773,0.0013532896,0.037025634,0.00060033373,0.46077773],"study_design_scores_gemma":[0.0003354551,0.00007825545,0.00007804922,0.000050678365,0.000009849524,0.000017816197,0.0008098665,0.9974717,0.00041172653,0.00027405575,0.00036976414,0.0000927849],"about_ca_topic_score_codex":0.0000111835125,"about_ca_topic_score_gemma":1.4194984e-7,"teacher_disagreement_score":0.74018615,"about_ca_system_score_codex":0.000011134186,"about_ca_system_score_gemma":0.000012773352,"threshold_uncertainty_score":0.36904544},"labels":[],"label_agreement":null},{"id":"W2102650736","doi":"10.1109/ipdpsw.2013.200","title":"Toward a Generic Hybrid CPU-GPU Parallelization of Divide-and-Conquer Algorithms","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Speedup; Divide and conquer algorithms; General-purpose computing on graphics processing units; CUDA; Multi-core processor; Parallel algorithm; Supercomputer; Software pipelining; Algorithm; Graphics; Compiler","score_opus":0.0254333470374885,"score_gpt":0.24125320858411337,"score_spread":0.21581986154662486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102650736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046025272,0.00016725445,0.99102443,0.000749946,0.00007764978,0.00018350058,4.127035e-7,0.00041133558,0.0027829353],"genre_scores_gemma":[0.5979697,0.000094516785,0.40104288,0.00036568314,0.000023599141,0.000020256924,0.0000033298422,0.0000060389275,0.00047397715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990472,0.00005154496,0.00027031102,0.00027953746,0.00017470794,0.00017669857],"domain_scores_gemma":[0.9992887,0.000042980282,0.00010729491,0.00031274767,0.00017343315,0.00007487863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014337423,0.00011697854,0.00016487874,0.00010696769,0.000054395012,0.00010994503,0.00040944375,0.000038971124,0.000056200657],"category_scores_gemma":[0.000022067698,0.000098691555,0.00003895982,0.00022033467,0.000042888216,0.0003950777,0.00024481924,0.00005317397,0.000029345027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070435117,0.0003557984,0.0056494554,0.00014529827,0.000126128,0.000014253635,0.0022048277,0.034810714,0.00259431,0.14663805,0.0947937,0.71266043],"study_design_scores_gemma":[0.00017689289,0.00006616507,0.0018042695,0.000011945965,0.000003417743,0.000017276941,0.000005844302,0.9795795,0.0067268135,0.010346321,0.0010805265,0.00018100599],"about_ca_topic_score_codex":0.00017462748,"about_ca_topic_score_gemma":7.387512e-7,"teacher_disagreement_score":0.9447688,"about_ca_system_score_codex":0.000011664247,"about_ca_system_score_gemma":0.000026915339,"threshold_uncertainty_score":0.40245247},"labels":[],"label_agreement":null},{"id":"W2103060283","doi":"10.1109/arith.2013.24","title":"The Floating-Point Unit of the Jaguar x86 Core","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Floating point; x86; Parallel computing; Floating-point unit; Arithmetic logic unit; Integer (computer science); Operand; Coprocessor; Computer hardware; Operating system","score_opus":0.02245954493839374,"score_gpt":0.24854160468713238,"score_spread":0.22608205974873863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103060283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011753159,0.000050457427,0.9523775,0.0035364719,0.00018025459,0.0002249631,1.737189e-7,0.00030259145,0.031574436],"genre_scores_gemma":[0.86194235,0.000013709158,0.13368757,0.00060441816,0.000021709939,0.000007769799,1.9516766e-7,0.0000046034297,0.0037176518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993719,0.00005390382,0.0001721066,0.00011544028,0.00015620433,0.00013047548],"domain_scores_gemma":[0.99897015,0.00014773874,0.00009738298,0.0006115803,0.00014862824,0.000024510997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024206055,0.00006253798,0.00006338031,0.00001825787,0.00023374855,0.00010008686,0.0012124428,0.000025871075,0.000024285384],"category_scores_gemma":[0.0000740025,0.000029308909,0.00004583022,0.00026690715,0.000068181966,0.000111470355,0.00035664483,0.000080270074,0.000030549058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018878891,0.00007208449,0.004490702,0.000013070847,0.000027759823,4.942202e-7,0.0014963107,0.009011098,0.0012974789,0.7862877,0.12761398,0.06968738],"study_design_scores_gemma":[0.00011519996,0.00005000689,0.0064924676,0.000024889603,0.0000021578835,0.000005290771,0.000076104014,0.9378562,0.016282916,0.03310965,0.0058549633,0.00013018053],"about_ca_topic_score_codex":0.00014075574,"about_ca_topic_score_gemma":0.000006418158,"teacher_disagreement_score":0.92884505,"about_ca_system_score_codex":0.000006589252,"about_ca_system_score_gemma":0.000032110973,"threshold_uncertainty_score":0.22530405},"labels":[],"label_agreement":null},{"id":"W2103280741","doi":"10.1109/mwscas.2007.4488826","title":"A new scheduling algorithm for processor-based logic emulation systems","year":2007,"lang":"en","type":"article","venue":"Conference proceedings","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Emulation; Computer science; Hardware emulation; Parallel computing; Logic synthesis; Scheduling (production processes); Computer architecture; Embedded system; Logic gate; Algorithm; Field-programmable gate array; Engineering","score_opus":0.04212994273911894,"score_gpt":0.2971300574243182,"score_spread":0.25500011468519923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103280741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006974915,0.00010259493,0.99567926,0.00031743862,0.0001867855,0.0005177875,7.2201203e-7,0.0010081334,0.0014897896],"genre_scores_gemma":[0.39402384,0.0000023120388,0.60554475,0.00011203226,0.00010400723,0.000024270195,0.0000030125339,0.000008188835,0.00017760004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859834,0.0000046040213,0.00032894895,0.00044966408,0.00024645793,0.0003720099],"domain_scores_gemma":[0.99854654,0.00007180343,0.00022999641,0.00013188778,0.0008744836,0.00014531084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069010496,0.00017403114,0.00019152106,0.00020045087,0.00018373338,0.0005278073,0.00066299894,0.000123252,0.0000025032987],"category_scores_gemma":[0.00012326716,0.00016803245,0.00005073098,0.00046559813,0.00002165237,0.00045773239,0.00007116967,0.00011565352,0.0000064853875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036794794,0.000119337696,0.0013758461,0.00037368582,0.000028164508,0.000003333922,0.001996426,0.006810027,0.0023009935,0.5134033,0.0017861042,0.47176597],"study_design_scores_gemma":[0.00035692632,0.00011282266,0.00008579993,0.000117059535,0.00000517087,0.0000052402747,0.000051201594,0.9827655,0.0049423124,0.010714031,0.00061906216,0.00022486977],"about_ca_topic_score_codex":0.000013872815,"about_ca_topic_score_gemma":4.1420557e-7,"teacher_disagreement_score":0.9759555,"about_ca_system_score_codex":0.00005587353,"about_ca_system_score_gemma":0.00023039703,"threshold_uncertainty_score":0.6852164},"labels":[],"label_agreement":null},{"id":"W2103437490","doi":"10.14778/2733085.2733095","title":"ADDICT","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Locality; Latency (audio); CAS latency; Database transaction; Transaction processing; Memory footprint; Parallel computing; Software; Operating system; Multi-core processor; Distributed computing; Embedded system; Database; Memory controller","score_opus":0.007883670614523518,"score_gpt":0.21113710324098256,"score_spread":0.20325343262645904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103437490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025619077,0.000121534766,0.7666963,0.00549152,0.0005731408,0.00055791455,0.0000011399221,0.0010708973,0.19986852],"genre_scores_gemma":[0.89991593,0.000009393855,0.09933964,0.00030554528,0.00003514065,0.000011946571,9.781622e-8,0.0000043978375,0.00037787965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993102,0.0000062748068,0.0001574276,0.00016830122,0.00022094116,0.00013683921],"domain_scores_gemma":[0.99952644,0.000024722653,0.00014483026,0.00015990832,0.00011076253,0.0000333092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003091462,0.000076316646,0.000096641925,0.00004674288,0.00008295618,0.000055247183,0.0010864477,0.00002419624,0.0000037946038],"category_scores_gemma":[0.00007789163,0.00005076637,0.000059910475,0.00022886961,0.00003044579,0.00013297942,0.00040163234,0.000063966094,0.0000060216917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059260306,0.00012662396,0.0026038657,0.000054916523,0.000028455499,1.0903359e-7,0.0007901781,0.00062567415,0.00954284,0.90154576,0.040749397,0.04392623],"study_design_scores_gemma":[0.00075992674,0.00029381792,0.0043234196,0.00021126005,0.00001934589,0.00002846539,0.00003017492,0.26127774,0.5778818,0.08290684,0.071825385,0.00044181896],"about_ca_topic_score_codex":0.0000068054255,"about_ca_topic_score_gemma":1.07561e-7,"teacher_disagreement_score":0.8742969,"about_ca_system_score_codex":0.000019151843,"about_ca_system_score_gemma":0.000009527864,"threshold_uncertainty_score":0.20701927},"labels":[],"label_agreement":null},{"id":"W2103584928","doi":"10.1109/synasc.2005.56","title":"Performance analysis of generics in scientific computing","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Benchmark (surveying); Compiler; Computer science; Suite; Implementation; Java; Programming language; Template; Test suite; Generic programming; Software engineering; Theoretical computer science; Test case; Machine learning","score_opus":0.018400722687772483,"score_gpt":0.26236742353913584,"score_spread":0.24396670085136335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103584928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34219489,0.000021954496,0.654801,0.00007864612,0.000030905227,0.000023272596,1.1889943e-7,0.00010810823,0.0027411124],"genre_scores_gemma":[0.64021695,0.0000044713565,0.35957965,0.00006226317,0.0000057701554,3.495794e-7,0.0000012303058,0.0000011699858,0.00012813047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991998,0.000026225081,0.00025180483,0.0002194275,0.00016160398,0.00014115951],"domain_scores_gemma":[0.9994564,0.000030995165,0.00008114838,0.00032727586,0.000079085614,0.000025114003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000494666,0.000056876932,0.00014542232,0.0006822767,0.00006319194,0.0000674096,0.0005154773,0.000024199131,0.0000105131885],"category_scores_gemma":[0.000010841694,0.000052945976,0.00004846633,0.0032772012,0.000034687055,0.00020423841,0.00015618648,0.000045524408,0.0000061276796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3725487e-7,0.000038536233,0.02741637,0.0000030232918,0.000016875223,2.3821939e-7,0.0003531949,0.9200137,0.00013659967,0.0018895727,0.00025117482,0.049880233],"study_design_scores_gemma":[0.000046805355,0.000008876331,0.022246577,0.000004592725,0.0000068990157,3.6941114e-7,0.0000028741706,0.9743323,0.0029291285,0.000013614894,0.0003454234,0.00006255178],"about_ca_topic_score_codex":0.000006562513,"about_ca_topic_score_gemma":0.000013177625,"teacher_disagreement_score":0.29802206,"about_ca_system_score_codex":0.000024811226,"about_ca_system_score_gemma":0.000028526674,"threshold_uncertainty_score":0.21590742},"labels":[],"label_agreement":null},{"id":"W2103744327","doi":"10.1109/tvlsi.2008.2012128","title":"On the Latency and Energy of Checkpointed Superscalar Register Alias Tables","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Latency (audio); Computer science; Alias; Implementation; Register file; Microarchitecture; Parallel computing; Efficient energy use; Energy (signal processing); Embedded system; Instruction set; Engineering; Telecommunications","score_opus":0.013763231229930421,"score_gpt":0.22881053133140883,"score_spread":0.2150473001014784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103744327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047418433,0.000113746595,0.99096775,0.0011339489,0.0005265552,0.0001927975,0.000022562252,0.00028512406,0.0020156447],"genre_scores_gemma":[0.9940135,0.00011962906,0.002863756,0.0004707886,0.000032705724,0.000034645633,0.0000060450466,0.000012201218,0.002446719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982169,0.00027209436,0.0005026986,0.00040492226,0.00035750697,0.0002458489],"domain_scores_gemma":[0.99872416,0.00018120163,0.00017487125,0.00062483177,0.00021788769,0.00007702431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049295987,0.00023129667,0.00028270832,0.0002423481,0.0002942462,0.00018483397,0.00043717283,0.00014880282,0.000019218418],"category_scores_gemma":[0.000016564913,0.00016376545,0.00013045064,0.0004673451,0.00006157143,0.0003606143,0.00000336032,0.00022846337,0.000009195215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051159825,0.0037837145,0.00009917259,0.00021848924,0.00041077923,0.00003505822,0.011735284,0.16595346,0.027606396,0.6538145,0.042858645,0.092972904],"study_design_scores_gemma":[0.0006029397,0.0007037637,0.000095998344,0.0005032403,0.000028180517,0.00004753101,0.00036796086,0.8995312,0.09303694,0.001750052,0.0029180127,0.00041422222],"about_ca_topic_score_codex":0.00014628039,"about_ca_topic_score_gemma":0.00004948532,"teacher_disagreement_score":0.98927164,"about_ca_system_score_codex":0.00005847409,"about_ca_system_score_gemma":0.000039309318,"threshold_uncertainty_score":0.6678161},"labels":[],"label_agreement":null},{"id":"W2104024519","doi":"10.1109/fmpc.1995.380461","title":"A multi-cache coherence scheme for shuffle-exchange network based multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Cache coherence; Multiprocessing; Directory; Interconnection; Shared memory; Cache; Parallel computing; MESI protocol; Computer network; Node (physics); Distributed shared memory; Distributed computing; Cache algorithms; CPU cache; Uniform memory access; Overlay; Memory management; Operating system","score_opus":0.06606104878485408,"score_gpt":0.2809493479768603,"score_spread":0.2148882991920062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104024519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015629789,0.00033562808,0.9943696,0.00069280394,0.00012618984,0.00041561353,0.0000015863341,0.0013638079,0.0025384265],"genre_scores_gemma":[0.08556926,0.000014585276,0.9102615,0.0014302938,0.00007949052,0.00013224976,0.00000346013,0.000013773286,0.0024953755],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986542,0.000045070523,0.00023923465,0.0004668875,0.00017418122,0.00042045873],"domain_scores_gemma":[0.9989538,0.00018362595,0.000110674744,0.00046977235,0.00017381726,0.000108276356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032409618,0.0001798183,0.00018119626,0.00007648744,0.00021829738,0.00014563836,0.0008996633,0.000097703734,0.00009726544],"category_scores_gemma":[0.00009886114,0.00016249924,0.00008509645,0.00048413867,0.000034896875,0.00024199195,0.00013437928,0.000102591686,0.00004708752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055333618,0.0020445224,0.0062507275,0.0004945366,0.00012252839,0.000022419732,0.0026108315,0.23324075,0.0010493845,0.020485133,0.566943,0.16668083],"study_design_scores_gemma":[0.0006436488,0.00007385802,0.00008967003,0.000027057682,0.0000025138813,0.0000013867631,0.0000036140852,0.9871557,0.0012978872,0.000147312,0.010325548,0.00023183592],"about_ca_topic_score_codex":0.000013835728,"about_ca_topic_score_gemma":0.000008654962,"teacher_disagreement_score":0.7539149,"about_ca_system_score_codex":0.000026883105,"about_ca_system_score_gemma":0.000022854143,"threshold_uncertainty_score":0.6626527},"labels":[],"label_agreement":null},{"id":"W2104306032","doi":"10.1109/cgo.2009.23","title":"Workload Reduction for Multi-input Feedback-Directed Optimization","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Workload; Computer science; Compiler; Benchmark (surveying); Metric (unit); Cluster analysis; Code (set theory); Reduction (mathematics); Transformation (genetics); Parallel computing; Programming language; Artificial intelligence; Set (abstract data type); Operating system","score_opus":0.029244690733709944,"score_gpt":0.2877497931540207,"score_spread":0.2585051024203108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104306032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099030614,0.00007530424,0.9924995,0.0010352959,0.0002270626,0.00031476124,4.049759e-7,0.0031083296,0.0026403689],"genre_scores_gemma":[0.035866033,0.000042672647,0.9618566,0.0003281087,0.00007323528,0.000016451773,0.000008248755,0.0000066177136,0.0018020481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906963,0.0000377629,0.00021943294,0.00034530342,0.000116664676,0.00021122003],"domain_scores_gemma":[0.9992869,0.000023335015,0.000091786795,0.00032120367,0.00021514857,0.000061646875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018827103,0.00012202315,0.00012271349,0.00013652863,0.00017298629,0.00015843518,0.00038837944,0.00008185163,0.000012009116],"category_scores_gemma":[0.00005386301,0.00011681714,0.000060834023,0.00047131543,0.000013255779,0.0003844809,0.000035599187,0.000061005852,0.000007497592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024368126,0.00025379704,0.000016353202,0.0000065698737,0.000013644378,8.7318585e-7,0.00026426258,0.7613305,0.0007907708,0.014335775,0.026237607,0.19672549],"study_design_scores_gemma":[0.00035912244,0.00009327808,0.00015655314,0.00001779875,0.0000029017235,0.0000075403,0.0000040456753,0.9934663,0.004614449,0.0006378525,0.00047854762,0.0001616209],"about_ca_topic_score_codex":0.000004160946,"about_ca_topic_score_gemma":2.9271604e-7,"teacher_disagreement_score":0.2321358,"about_ca_system_score_codex":0.00003954616,"about_ca_system_score_gemma":0.000032571003,"threshold_uncertainty_score":0.47636646},"labels":[],"label_agreement":null},{"id":"W2104329541","doi":"10.1155/2015/843851","title":"A Domain-Specific Architecture for Elementary Function Evaluation","year":2015,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"SIMD; Computer science; Parallel computing; Lookup table; Elementary function; Throughput; Coprocessor; Computation; Floating point; Table (database); Arithmetic; Algorithm; Mathematics; Programming language; Operating system","score_opus":0.0648069778221249,"score_gpt":0.33814292708657684,"score_spread":0.2733359492644519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104329541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010420669,0.00022277472,0.98506445,0.0023067452,0.00033155447,0.00016923068,0.0000010656323,0.000025025725,0.0014584599],"genre_scores_gemma":[0.041196574,0.00002620669,0.9584651,0.00015329268,0.00013355134,0.000008714945,7.6558155e-7,0.0000036342353,0.000012139218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983499,0.000035868758,0.00043680292,0.00013311797,0.00092835526,0.00011597724],"domain_scores_gemma":[0.9985249,0.0002557578,0.00034364033,0.000093278104,0.00068491534,0.00009750182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031923468,0.000087024724,0.00015424899,0.00017869665,0.00007534208,0.0002619378,0.00066394097,0.000031017025,0.0000111439085],"category_scores_gemma":[0.0001430051,0.0000601314,0.00006380919,0.00012881498,0.000087424305,0.00031862193,0.000105627565,0.000065634325,0.0000023548196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132053065,0.00017183617,0.000012704089,0.000017430131,0.00004109577,0.000002085793,0.001482128,0.0012591291,0.00017016639,0.9509652,0.0028129003,0.043052107],"study_design_scores_gemma":[0.00049723353,0.00029151526,0.000008385356,0.00007558285,0.000010943587,0.0001460616,0.00034824185,0.08213664,0.00020891785,0.9061704,0.0100291,0.000076927216],"about_ca_topic_score_codex":5.064663e-7,"about_ca_topic_score_gemma":3.633844e-7,"teacher_disagreement_score":0.08087751,"about_ca_system_score_codex":0.000044411456,"about_ca_system_score_gemma":0.00010057612,"threshold_uncertainty_score":0.2525872},"labels":[],"label_agreement":null},{"id":"W2104942569","doi":"10.1145/2629470","title":"Benefits of Adding Hardware Support for Broadcast and Reduce Operations in MPSoC Applications","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Aeronautical Science Foundation of China","keywords":"Computer science; MPSoC; Scalability; Computation; Multiprocessing; Efficient energy use; Embedded system; Parallel computing; Computer hardware; Distributed computing; Computer architecture; Operating system","score_opus":0.021781347306305127,"score_gpt":0.2623712390499694,"score_spread":0.24058989174366427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104942569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052889152,0.0003859229,0.9919451,0.00075856637,0.00008107897,0.0005691595,0.000021230637,0.00028704968,0.0006630063],"genre_scores_gemma":[0.9361513,0.00021892985,0.06263043,0.000032994,0.000009859029,0.0005485148,0.000005573605,0.000008478214,0.00039387165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990702,0.00004024595,0.00032733765,0.00033700254,0.000058045658,0.0001671579],"domain_scores_gemma":[0.99912566,0.00016266774,0.000074873285,0.00049108226,0.00010811955,0.000037594073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034648378,0.00011207466,0.00023382442,0.0005719581,0.0002476185,0.000052466847,0.00037118982,0.00018258793,0.0000029215967],"category_scores_gemma":[0.00004304723,0.000114931296,0.000026095007,0.00049332087,0.000070505506,0.00015475192,0.000009109731,0.00014568177,0.0000016796926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015827069,0.00017196793,0.00032671698,0.00020608531,0.000048936,3.395264e-7,0.0005068948,0.09215579,0.0012719325,0.28809956,0.00015237877,0.61704355],"study_design_scores_gemma":[0.0031081873,0.001592048,0.00084315933,0.00086068775,0.00007046008,0.00036492097,0.0011747772,0.87809515,0.06196907,0.016935201,0.03379688,0.001189436],"about_ca_topic_score_codex":0.000024309544,"about_ca_topic_score_gemma":0.000022216009,"teacher_disagreement_score":0.9308624,"about_ca_system_score_codex":0.000016152013,"about_ca_system_score_gemma":0.000029052577,"threshold_uncertainty_score":0.4686762},"labels":[],"label_agreement":null},{"id":"W2105104837","doi":"10.1109/ispass.2007.363730","title":"Performance Modeling and Analysis for AMD's High Performance Microprocessors","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"x86; Computer science; Benchmark (surveying); Computer architecture; Workload; Parallel computing; Embedded system; Operating system; Software","score_opus":0.016376842052374146,"score_gpt":0.25083667641234986,"score_spread":0.23445983435997572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105104837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4151395,0.00003098125,0.5839764,0.00004964158,0.000023346585,0.000059746482,2.5676232e-7,0.00022197425,0.00049814227],"genre_scores_gemma":[0.603658,0.00005836787,0.39595348,0.00010947817,0.000014885784,0.0000038824833,0.0000022428678,0.0000035577102,0.00019609604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908644,0.0000062122435,0.00022262549,0.0003062277,0.000119520155,0.00025899013],"domain_scores_gemma":[0.9994455,0.000041802658,0.000060137867,0.00024407705,0.0001474019,0.00006107007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655805,0.00010863167,0.00015420065,0.00027803547,0.0002125793,0.00009242263,0.00036267214,0.000049930073,0.0000022268366],"category_scores_gemma":[0.00001046523,0.00009550239,0.00004158631,0.0007044158,0.000019729812,0.00035596432,0.00010287659,0.000058218113,0.0000018698221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027775111,0.0000432092,0.03178719,0.000081466496,0.00011567756,7.379314e-7,0.00048189427,0.8743281,0.00021973744,0.004841375,0.000106394924,0.08796645],"study_design_scores_gemma":[0.0001294413,0.000055049903,0.0038396234,0.000007231263,0.000020153064,0.000002429785,0.000005922998,0.99009985,0.0055074343,0.000120967365,0.00006695588,0.00014492213],"about_ca_topic_score_codex":0.000016648335,"about_ca_topic_score_gemma":0.0000032747805,"teacher_disagreement_score":0.18851851,"about_ca_system_score_codex":0.00001744311,"about_ca_system_score_gemma":0.00001714917,"threshold_uncertainty_score":0.38944745},"labels":[],"label_agreement":null},{"id":"W2105130730","doi":"10.1109/ccece.1993.332372","title":"An efficient distributed cycle/knot detection algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Knot (papermaking); Computation; Computer science; Algorithm; Node (physics); Running time; Graph; Theoretical computer science","score_opus":0.011516953089681847,"score_gpt":0.2359243284979647,"score_spread":0.22440737540828287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105130730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017213544,0.000026075197,0.99405164,0.00015503302,0.00014748328,0.00007982206,0.0000016703791,0.0018172096,0.0019997146],"genre_scores_gemma":[0.64738214,0.0000049535392,0.35237333,0.00010932832,0.000031203646,0.000005006549,0.00000285728,0.000004114999,0.000087081666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.00005644621,0.0001504322,0.0002944611,0.00017038337,0.00019573861],"domain_scores_gemma":[0.99933934,0.00002132353,0.00004558853,0.00042874587,0.00007319479,0.0000918142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013843425,0.00009545891,0.000082489154,0.000082567625,0.00016634104,0.0001568447,0.0004692389,0.000050690895,0.000042473126],"category_scores_gemma":[0.000012669052,0.00008655888,0.000035347926,0.00039869666,0.000018198547,0.00017261178,0.00007465576,0.00007721966,0.00007457442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.2779385e-7,0.00029617167,0.000022014925,0.0000024183041,0.000006927037,0.0000072449598,0.00023547128,0.21214932,0.00032420928,0.0038831972,0.0013973166,0.7816748],"study_design_scores_gemma":[0.00010312926,0.00007727968,0.00018846913,0.0000025089382,0.0000012185723,0.000011096308,0.0000034670772,0.9912064,0.0071169115,0.00029118705,0.00087270397,0.00012562943],"about_ca_topic_score_codex":0.000019654639,"about_ca_topic_score_gemma":0.0000012611556,"teacher_disagreement_score":0.78154916,"about_ca_system_score_codex":0.00003559848,"about_ca_system_score_gemma":0.0000045004954,"threshold_uncertainty_score":0.3529769},"labels":[],"label_agreement":null},{"id":"W2105331599","doi":"10.1109/sbac-pad.2006.11","title":"Characterizing the Performance of Data Management Systems on Hyper-Threaded Architectures","year":2006,"lang":"en","type":"article","venue":"Proceedings","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pentium; Multithreading; Benchmark (surveying); Operating system; Computer architecture; Performance improvement; Simultaneous multithreading; Memory management; Embedded system; Parallel computing","score_opus":0.027807071805052732,"score_gpt":0.24904242663021767,"score_spread":0.22123535482516493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105331599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8127603,0.00029247004,0.13622363,0.0015460257,0.0002940248,0.00075084897,0.000005384251,0.0010009905,0.047126334],"genre_scores_gemma":[0.96998125,0.00002421162,0.029558426,0.000118468684,0.000078652585,0.000014854503,0.0000040653786,0.0000066314324,0.00021346181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991079,0.0000073912124,0.00019929306,0.00028446922,0.00023839288,0.0001625733],"domain_scores_gemma":[0.99938023,0.00002264238,0.00014650029,0.00037730794,0.00005664789,0.00001669165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034846645,0.00009910468,0.00010834816,0.00008915238,0.00012435079,0.00014195888,0.0015828952,0.000024369629,5.2069487e-7],"category_scores_gemma":[0.000005865443,0.00006721448,0.000017780289,0.00024529343,0.000032473316,0.00019603803,0.00044530403,0.000090478316,0.0000046528276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013474199,0.0007137918,0.01914246,0.0023372052,0.00018261412,0.000008810301,0.0038520917,0.025917664,0.018585458,0.65232736,0.036188684,0.24060912],"study_design_scores_gemma":[0.00020926788,0.00013426488,0.00931024,0.00028627546,0.000011300191,0.000023558096,0.000036589212,0.958294,0.018254586,0.0005225366,0.012676451,0.00024094048],"about_ca_topic_score_codex":0.000016102837,"about_ca_topic_score_gemma":9.634255e-8,"teacher_disagreement_score":0.9323763,"about_ca_system_score_codex":0.000012249887,"about_ca_system_score_gemma":0.0000064336036,"threshold_uncertainty_score":0.29414394},"labels":[],"label_agreement":null},{"id":"W2105529490","doi":"10.1109/ipccc.2001.918670","title":"An efficient instruction cache scheme for object-oriented languages","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cache; Computer science; Scheme (mathematics); Selection (genetic algorithm); Parallel computing; Cache invalidation; CPU cache; Smart Cache; Cache algorithms; Artificial intelligence; Mathematics","score_opus":0.01656685851556113,"score_gpt":0.2729027893227099,"score_spread":0.2563359308071488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105529490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024285454,0.00005073651,0.9691112,0.00019459364,0.00013067729,0.00015847318,8.496561e-7,0.0011072801,0.004960722],"genre_scores_gemma":[0.4463032,0.0000032004605,0.5530753,0.0001349435,0.000044687975,0.000013362523,0.0000031700852,0.0000045713014,0.00041757716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929553,0.000028427768,0.0001296596,0.00026216908,0.00011840989,0.00016578873],"domain_scores_gemma":[0.99943924,0.000025939626,0.000047137648,0.00034074372,0.00009112309,0.000055837692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013388331,0.00008305775,0.00007895595,0.0000927022,0.00013208037,0.00008081961,0.00032054022,0.00004632194,0.000023807968],"category_scores_gemma":[0.00002893684,0.000073369396,0.00003640961,0.00025646202,0.000016620634,0.00015279533,0.000046854126,0.00004947724,0.000013703868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023685518,0.001150736,0.0012913606,0.00006278637,0.00005679107,0.000009337335,0.005654767,0.12721829,0.0062065395,0.54669005,0.03529492,0.27634072],"study_design_scores_gemma":[0.0002541881,0.00010614619,0.00009012613,0.00000418701,0.0000012496782,0.000006438328,0.00003422503,0.9901367,0.007010613,0.00009324541,0.0021552248,0.000107702035],"about_ca_topic_score_codex":0.000014840804,"about_ca_topic_score_gemma":0.000001715127,"teacher_disagreement_score":0.8629184,"about_ca_system_score_codex":0.000023707491,"about_ca_system_score_gemma":0.0000073083306,"threshold_uncertainty_score":0.2991917},"labels":[],"label_agreement":null},{"id":"W2107216395","doi":"10.1109/isqed.2007.158","title":"Thermal vs Energy Optimization for DVFS-Enabled Processors in Embedded Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Frequency scaling; Computer science; Energy consumption; Minification; Energy (signal processing); Thermal; Energy minimization; Optimization problem; Nonlinear programming; Nonlinear system; Embedded system; Real-time computing; Electrical engineering; Engineering; Algorithm","score_opus":0.01244012609550503,"score_gpt":0.2544930065094757,"score_spread":0.24205288041397066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107216395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086897844,0.000070434915,0.9907622,0.00010971261,0.00016480168,0.00025204394,3.1084065e-7,0.0006368288,0.0071347114],"genre_scores_gemma":[0.5234903,0.000009432669,0.47506398,0.00023300423,0.0000527031,0.00004512414,0.000006239968,0.000011467194,0.0010877235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881715,0.00004910723,0.0003420831,0.00031211294,0.00015866182,0.00032086662],"domain_scores_gemma":[0.99926,0.00013168427,0.000112845424,0.00026284595,0.00017354073,0.000059103993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009149317,0.00012378034,0.00016348762,0.00023714651,0.000085421874,0.00015008802,0.0005069076,0.0000937365,0.0000050179033],"category_scores_gemma":[0.000055398847,0.00010992778,0.00003634194,0.0005378007,0.000014490809,0.00034259108,0.000074389936,0.000050711573,0.0000014270266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018811706,0.000043990523,0.00006573385,0.000018972374,0.000003913606,0.0000020484388,0.00021222387,0.95651805,0.000057255318,0.039704323,0.0005381071,0.0028165453],"study_design_scores_gemma":[0.00034854695,0.000058866484,0.0000348084,0.000023664517,0.0000013139249,0.0000023748316,0.000026160895,0.9947061,0.003769182,0.00024399275,0.0006305656,0.0001544443],"about_ca_topic_score_codex":0.00006859533,"about_ca_topic_score_gemma":0.000012161947,"teacher_disagreement_score":0.52262133,"about_ca_system_score_codex":0.000049903792,"about_ca_system_score_gemma":0.000055761953,"threshold_uncertainty_score":0.44827247},"labels":[],"label_agreement":null},{"id":"W2107236296","doi":"10.1109/tmag.2010.2048421","title":"The Solution of Electromagnetic Field Problems Using a Sliding Window Gauss-Seidel Algorithm on a Multicore Processor","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Scalability; Thread (computing); Cache; CPU cache; Cache coherence; Algorithm; Embedded system; Cache algorithms; Operating system","score_opus":0.0176750566480541,"score_gpt":0.25828468591192466,"score_spread":0.24060962926387056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107236296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011677925,0.000043605,0.98651165,0.0004993256,0.00044667418,0.0003599488,0.0000028603263,0.00023974293,0.00021827714],"genre_scores_gemma":[0.6752874,0.000058341073,0.3242614,0.000104347,0.000031771593,0.000027428761,3.8026042e-7,0.000013939246,0.00021493313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986408,0.00006310757,0.00034291358,0.0003138188,0.00031516133,0.00032422342],"domain_scores_gemma":[0.99877954,0.00029216288,0.0001564409,0.0005096196,0.00019383934,0.000068422094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027137704,0.00018010494,0.00015343096,0.0001577017,0.00046654788,0.00012899215,0.0005808216,0.0001319814,0.0000092356395],"category_scores_gemma":[0.000028322636,0.00014788126,0.00008801048,0.0004559146,0.0000643808,0.00012455098,0.0000058338383,0.00050522346,0.0000046722957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058297737,0.0006926221,0.000014664616,0.00007339715,0.000042437994,0.000005059148,0.0010932956,0.12904827,0.19913687,0.00128531,0.0002229519,0.6683268],"study_design_scores_gemma":[0.00026195263,0.0008645174,0.00003173282,0.000045137083,0.000016044343,0.000018155122,0.000007646016,0.8255413,0.17235032,0.0005792698,0.00012843024,0.0001554956],"about_ca_topic_score_codex":0.000045238245,"about_ca_topic_score_gemma":0.000032461783,"teacher_disagreement_score":0.696493,"about_ca_system_score_codex":0.000027232598,"about_ca_system_score_gemma":0.0000959505,"threshold_uncertainty_score":0.6030423},"labels":[],"label_agreement":null},{"id":"W2107303919","doi":"10.1109/hpcs.2008.16","title":"Performance Driven Partial Checkpoint/Migrate for LAM-MPI","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings (International Symposium on High Performance Computing Systems and Applications)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Distributed computing; Overhead (engineering); Latency (audio); Idle; Set (abstract data type); Parallel computing; Computer network; Operating system","score_opus":0.015041899700578369,"score_gpt":0.2406980225614946,"score_spread":0.22565612286091624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107303919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86939555,0.00007742851,0.11981061,0.0011807621,0.0006286404,0.0015474677,0.000011459388,0.0012908318,0.006057249],"genre_scores_gemma":[0.97088575,0.00047472015,0.025825772,0.00021833528,0.0012401709,0.00067080127,0.000022353477,0.000047110054,0.00061497925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968184,0.000006325393,0.0008458234,0.0010991027,0.00064263254,0.0005876748],"domain_scores_gemma":[0.9978164,0.00007647748,0.0006558865,0.00021437564,0.0010384198,0.00019842986],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006336862,0.0004545464,0.00043500672,0.0002898957,0.0013137177,0.0006028374,0.0013201761,0.00017828372,0.0000020162527],"category_scores_gemma":[0.000029315574,0.00044500417,0.00010453226,0.00054346403,0.00013471406,0.0010287069,0.00034215755,0.0002977655,0.000030071395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005137205,0.0014355212,0.21839951,0.0031474542,0.00057421025,0.000005058528,0.0067099878,0.10223782,0.029072404,0.5843484,0.02378602,0.029769916],"study_design_scores_gemma":[0.0008282616,0.00032345872,0.004498022,0.00028632168,0.000014798976,0.00018756122,0.00004279065,0.96116495,0.008464689,0.00008441744,0.023528192,0.0005765098],"about_ca_topic_score_codex":0.000019509695,"about_ca_topic_score_gemma":9.980374e-8,"teacher_disagreement_score":0.85892713,"about_ca_system_score_codex":0.00018434665,"about_ca_system_score_gemma":0.000048274844,"threshold_uncertainty_score":0.9999864},"labels":[],"label_agreement":null},{"id":"W2107333973","doi":"10.1145/1669112.1669119","title":"Complexity effective memory access scheduling for many-core accelerator architectures","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer architecture; Scheduling (production processes); Many core; Parallel computing; Engineering","score_opus":0.06026639894381161,"score_gpt":0.34328527206491394,"score_spread":0.2830188731211023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107333973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03042764,0.000048860416,0.96215934,0.00098256,0.00012032009,0.00065562065,0.0000015175449,0.0013089598,0.0042951596],"genre_scores_gemma":[0.58562416,0.000001925347,0.4128815,0.0013265131,0.00007330185,0.00002744315,0.0000022546333,0.000005177114,0.000057709287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885917,0.000047840065,0.00020020832,0.00043781166,0.00015994276,0.00029505076],"domain_scores_gemma":[0.9990906,0.00016721082,0.000091370035,0.00042125417,0.00013863754,0.00009093799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022821866,0.00017404994,0.00021902293,0.00014389188,0.00024920623,0.0003588724,0.0012389747,0.000065649445,0.000005955188],"category_scores_gemma":[0.000074019714,0.00014809212,0.000097710945,0.0002946186,0.00003754577,0.0002516577,0.00020266145,0.00013425581,0.00000461337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012628449,0.00043668319,0.0009853885,0.00010616105,0.00008281713,0.0000138357045,0.0014381234,0.15599822,0.0019027878,0.38002256,0.0075333132,0.45135385],"study_design_scores_gemma":[0.0005534674,0.0002737373,0.0072474536,0.000033046843,0.0000057424086,0.000008570824,0.000011665323,0.8564646,0.03529481,0.09947694,0.00025790976,0.00037203447],"about_ca_topic_score_codex":0.000017357861,"about_ca_topic_score_gemma":0.0000057297643,"teacher_disagreement_score":0.7004664,"about_ca_system_score_codex":0.000032984946,"about_ca_system_score_gemma":0.000036804428,"threshold_uncertainty_score":0.6039021},"labels":[],"label_agreement":null},{"id":"W2107539453","doi":"10.1109/ccece.2004.1345275","title":"Performance analysis of clustered processors","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cluster analysis; Cluster (spacecraft); Bandwidth (computing); Set (abstract data type); Factor (programming language); Parallel computing; Cluster size; Distributed computing; Computer network; Artificial intelligence","score_opus":0.01403328940782221,"score_gpt":0.25171349136285237,"score_spread":0.23768020195503017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107539453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10733706,0.000009829391,0.8845594,0.00012898706,0.000015217903,0.00003274267,1.4841295e-7,0.00023946512,0.0076771406],"genre_scores_gemma":[0.7376556,0.000009232581,0.26212627,0.00007443047,0.0000023797863,0.0000015366246,8.128676e-7,0.0000011869802,0.00012856297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995014,0.000007907705,0.00014790111,0.00013754894,0.00011821486,0.00008701929],"domain_scores_gemma":[0.9995671,0.000009836984,0.00006645831,0.00025026503,0.00008243881,0.000023919809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010988823,0.000048535338,0.00011722872,0.00024132367,0.000034556357,0.000020544436,0.00041904554,0.000022220542,0.0000061034634],"category_scores_gemma":[0.000008743511,0.000040409323,0.000048932347,0.0014222917,0.000015792775,0.00017259427,0.00007926624,0.000026987056,0.0000035366877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002283983,0.000060575327,0.004423503,0.000014496217,0.000112315975,5.129748e-7,0.00059333135,0.97225314,0.00007503756,0.015483498,0.000067650064,0.0069136317],"study_design_scores_gemma":[0.000110624394,0.000042291562,0.007639002,0.000007280074,0.00002512457,7.1269477e-7,0.0000036197212,0.9810967,0.010618146,0.00034612033,0.000039180894,0.00007118734],"about_ca_topic_score_codex":0.00001674757,"about_ca_topic_score_gemma":0.0000033358735,"teacher_disagreement_score":0.6303185,"about_ca_system_score_codex":0.000013007667,"about_ca_system_score_gemma":0.000032163833,"threshold_uncertainty_score":0.16478443},"labels":[],"label_agreement":null},{"id":"W2107607064","doi":"10.1109/ccece.1998.682534","title":"Cache performance of chronological garbage collection","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Garbage collection; Computer science; Cache; Garbage; Cache algorithms; Parallel computing; Cache-oblivious algorithm; Cache pollution; Manual memory management; Virtual memory; Cache coloring; Cache invalidation; Block (permutation group theory); Operating system; CPU cache; Memory management; Programming language","score_opus":0.026494129317238744,"score_gpt":0.226787453154399,"score_spread":0.20029332383716025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107607064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05628459,0.000064119224,0.88871926,0.00020840522,0.00005583392,0.00005286647,5.995441e-8,0.0004325835,0.05418227],"genre_scores_gemma":[0.83694375,0.00006786658,0.16072781,0.00006817494,0.0000088100005,0.000002597906,1.5548596e-7,0.0000014064294,0.002179409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995539,0.000022735292,0.00011804406,0.00012738518,0.00008541966,0.00009249047],"domain_scores_gemma":[0.99968624,0.000020876154,0.000043254397,0.00018754537,0.000041342486,0.000020718964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008936665,0.00004713752,0.000071461414,0.00005688962,0.000058268164,0.000017675482,0.00027652274,0.000038742644,0.00011333694],"category_scores_gemma":[0.000013386425,0.000038129558,0.000022481134,0.00028545357,0.000023635894,0.0001192446,0.00007210787,0.0000499816,0.000024368783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036279318,0.0017281354,0.042823464,0.00016339814,0.0000967839,0.000017533315,0.003675338,0.076860525,0.0059086136,0.15642588,0.29125476,0.42100927],"study_design_scores_gemma":[0.00007856554,0.00014703078,0.0020241246,0.000004205866,6.263713e-7,0.0000059048452,0.000001240175,0.9857647,0.01103033,0.000074886084,0.0008127195,0.00005568224],"about_ca_topic_score_codex":0.0000054674883,"about_ca_topic_score_gemma":3.8202384e-7,"teacher_disagreement_score":0.90890414,"about_ca_system_score_codex":0.0000161812,"about_ca_system_score_gemma":0.000005710658,"threshold_uncertainty_score":0.15548784},"labels":[],"label_agreement":null},{"id":"W2108027150","doi":"10.1109/hpca.2002.995716","title":"CableS : thread control and memory management extensions for shared virtual memory clusters","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"POSIX Threads; Computer science; Thread (computing); Shared memory; Distributed shared memory; Runtime system; Scalability; Operating system; Compiler; Virtual memory; Myrinet; Distributed computing; Parallel computing; Server; Message passing; Memory management; Uniform memory access","score_opus":0.014051052557434352,"score_gpt":0.24594888414601737,"score_spread":0.23189783158858301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108027150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080655725,0.00011378647,0.99125797,0.0018830436,0.00013711034,0.00052005623,0.000003460043,0.0006219571,0.0046560876],"genre_scores_gemma":[0.28887177,0.000046954512,0.706545,0.0023576343,0.000031944102,0.00007049833,0.000004854704,0.00001121903,0.002060118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990422,0.000023850003,0.0001959216,0.00036573017,0.00014044094,0.00023185529],"domain_scores_gemma":[0.99935216,0.00008432444,0.000056082736,0.00034587499,0.00007495337,0.000086617794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002450916,0.00013117724,0.00015731354,0.00011264751,0.00021125245,0.0001410767,0.00037876362,0.000047343503,0.000005403403],"category_scores_gemma":[0.000018114202,0.00011408923,0.000050704843,0.00012354621,0.000042147778,0.0002455527,0.00019713728,0.000049508104,0.000005990981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008855119,0.00030311852,0.00004441371,0.00010085726,0.00020272881,0.00005282906,0.0017897206,0.323743,0.00032290828,0.5034784,0.04004177,0.12983169],"study_design_scores_gemma":[0.0071077165,0.0004942444,0.0009997241,0.00014392837,0.000055997272,0.00004709662,0.00039494602,0.9469356,0.001884864,0.038824026,0.0023336932,0.0007781495],"about_ca_topic_score_codex":0.00003646221,"about_ca_topic_score_gemma":0.000010730346,"teacher_disagreement_score":0.6231926,"about_ca_system_score_codex":0.000034149587,"about_ca_system_score_gemma":0.000026868176,"threshold_uncertainty_score":0.4652424},"labels":[],"label_agreement":null},{"id":"W2108391026","doi":"10.1109/vdat.2006.258123","title":"Hazard-Aware Performance Prediction for Automatic Instruction-Set Selection","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Instruction set; Selection (genetic algorithm); Schedule; Set (abstract data type); Hazard; Fraction (chemistry); Machine learning; Parallel computing; Operating system; Programming language","score_opus":0.011144076452100329,"score_gpt":0.2332421749460821,"score_spread":0.22209809849398177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108391026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04370686,0.0000069260886,0.9518324,0.00012154005,0.0002591147,0.00022137407,0.0000018878322,0.002104512,0.00174536],"genre_scores_gemma":[0.66444886,0.0000043573955,0.33455345,0.000051671414,0.000106716354,0.000048724287,0.000015819045,0.0000060893867,0.00076432794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999232,0.000019843286,0.00021779342,0.00023266404,0.00013361461,0.00016411544],"domain_scores_gemma":[0.99956244,0.000026331832,0.00008024352,0.00017181966,0.0001342975,0.00002487491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015720469,0.00009329825,0.00008717642,0.00012511184,0.0002528432,0.00012982357,0.00022157858,0.000059704875,0.000010471346],"category_scores_gemma":[0.00000849664,0.0000880952,0.00004032446,0.00033017324,0.000014006989,0.0005521543,0.000035534867,0.000054384775,0.000009581154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025286767,0.00026423208,0.047251765,0.0003047347,0.000051550036,8.2003174e-7,0.00033857286,0.40267798,0.0006230727,0.10754926,0.18905894,0.2518538],"study_design_scores_gemma":[0.00024630173,0.00009522456,0.0082873,0.000012672318,0.0000028531363,0.00001821042,0.0000024392714,0.98357564,0.004254933,0.0015428454,0.0018633861,0.000098184486],"about_ca_topic_score_codex":0.000022745351,"about_ca_topic_score_gemma":0.0000046524156,"teacher_disagreement_score":0.620742,"about_ca_system_score_codex":0.00005693828,"about_ca_system_score_gemma":0.000040745967,"threshold_uncertainty_score":0.35924178},"labels":[],"label_agreement":null},{"id":"W2108414598","doi":"10.1109/cicc.1998.694978","title":"Implementing logic in FPGA embedded memory arrays: architectural implications","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Field-programmable gate array; Flexibility (engineering); Programmable logic device; Computer architecture; Programmable logic array; Programmable Array Logic; Logic synthesis; Logic gate; Embedded system; Logic family; Computer hardware; Algorithm; Mathematics","score_opus":0.04110547703797258,"score_gpt":0.28743259809426236,"score_spread":0.2463271210562898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108414598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035098647,0.000051606505,0.94328666,0.0026319511,0.000041053107,0.00014888844,5.7822706e-7,0.0007342174,0.049595162],"genre_scores_gemma":[0.59623206,0.000007778579,0.40238914,0.0006852606,0.000023031662,0.000022103932,0.0000021751964,0.0000047019976,0.00063378323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988476,0.00006192905,0.00027633633,0.00031813927,0.00010924702,0.0003867207],"domain_scores_gemma":[0.9993034,0.00007144161,0.00007284873,0.00045677213,0.000041365623,0.00005419053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002651299,0.000108961,0.0001165713,0.00018891237,0.0001473936,0.000110768546,0.00067624723,0.000034528588,0.000118062475],"category_scores_gemma":[0.000034508164,0.000097763725,0.00004642189,0.0005073196,0.000021368784,0.00018342787,0.00026600127,0.00011898402,0.00005859322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031715774,0.0004142562,0.003899187,0.000030747564,0.000032185424,0.000019184838,0.0070531527,0.061275743,0.0025311569,0.2222132,0.024348274,0.67817974],"study_design_scores_gemma":[0.00036226658,0.000050145183,0.0031670528,0.0000150288715,0.0000020778227,0.000045947505,0.000058916088,0.9717728,0.0030774185,0.019602736,0.0014993815,0.00034625275],"about_ca_topic_score_codex":0.000030434352,"about_ca_topic_score_gemma":0.000028154915,"teacher_disagreement_score":0.910497,"about_ca_system_score_codex":0.000031109743,"about_ca_system_score_gemma":0.000010237611,"threshold_uncertainty_score":0.39866892},"labels":[],"label_agreement":null},{"id":"W2108458683","doi":"10.1109/hpcsa.2002.1019156","title":"Numerical applications and sub-word parallelism: the NAS benchmarks on a Pentium 4","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pentium; Computer science; Parallel computing; SIMD; Compiler; Vectorization (mathematics); Parallelism (grammar); Fortran; Data parallelism; Programming language","score_opus":0.011627619758539733,"score_gpt":0.24740546234505997,"score_spread":0.23577784258652024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108458683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004465386,0.000104356746,0.95499927,0.0017457822,0.000044517154,0.00021389162,1.6704207e-7,0.00023524562,0.042210244],"genre_scores_gemma":[0.8373417,0.0000825456,0.16023862,0.0016281506,0.00002660656,0.00009166937,0.000002360611,0.0000058031933,0.00058253406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991852,0.00009087662,0.00013616717,0.0002797806,0.0001419794,0.00016599026],"domain_scores_gemma":[0.9992756,0.0001282084,0.00004527314,0.00044735637,0.000041229414,0.000062309235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023411079,0.00009697543,0.00008604638,0.00004298194,0.0002479167,0.00015888625,0.00041946882,0.000039021168,0.00002578316],"category_scores_gemma":[0.000025251398,0.000064562926,0.000032595628,0.00028456264,0.00004203154,0.00008972364,0.00006780969,0.00011637535,0.000023376413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024752262,0.00008769898,0.00020035173,0.0000036604285,0.000009407811,0.000001374658,0.0001618301,0.002395689,0.000023688388,0.96214485,0.022032367,0.0129365865],"study_design_scores_gemma":[0.00066359056,0.00025428072,0.004881223,0.000025836636,0.00001484071,0.00010894366,0.000059761547,0.461051,0.0070812553,0.0759972,0.44901833,0.0008437458],"about_ca_topic_score_codex":0.000009485598,"about_ca_topic_score_gemma":0.0000010127405,"teacher_disagreement_score":0.8861477,"about_ca_system_score_codex":0.000010841126,"about_ca_system_score_gemma":0.000026182968,"threshold_uncertainty_score":0.26327997},"labels":[],"label_agreement":null},{"id":"W2108473479","doi":"","title":"Using Machines to Learn Method-Specific Compilation Strategies","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Compiler; Just-in-time compilation; Java; Support vector machine; Process (computing); IBM; Programming language; Code (set theory); Throughput; Artificial intelligence; Machine learning; Software engineering; Operating system","score_opus":0.09083039751757144,"score_gpt":0.36943406621509334,"score_spread":0.2786036686975219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108473479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019267305,0.0000925285,0.9803249,0.00020897356,0.00020214773,0.00009036682,3.2658718e-7,0.00067208917,0.016481927],"genre_scores_gemma":[0.24282677,0.0000031634577,0.7566882,0.00019080608,0.000079029414,0.0000017411294,0.0000011969485,0.0000049394416,0.0002041895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992087,0.000100388854,0.0001518994,0.00017444747,0.00014224592,0.00022234645],"domain_scores_gemma":[0.99947363,0.000057115387,0.000045339853,0.00026724467,0.0000652684,0.00009138037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043275804,0.00009427959,0.000100846795,0.00026197723,0.00012947043,0.00022391517,0.00033368223,0.000035256773,0.000021702712],"category_scores_gemma":[0.000008912448,0.000082280036,0.000029737204,0.0007567221,0.000008578127,0.000738739,0.00015251292,0.00006410567,0.000044902805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037359227,0.000074343225,0.0030088285,0.000007639149,0.000009721257,7.4712744e-7,0.0016632355,0.2266206,0.005656195,0.6772806,0.0062386324,0.07943571],"study_design_scores_gemma":[0.000063179396,0.000023592687,0.0037866125,0.000008433843,0.000001585618,0.000012293986,0.000034752455,0.9753628,0.005084801,0.00298196,0.012437402,0.00020260726],"about_ca_topic_score_codex":0.000028997925,"about_ca_topic_score_gemma":9.950011e-7,"teacher_disagreement_score":0.74874216,"about_ca_system_score_codex":0.000025792688,"about_ca_system_score_gemma":0.000018557606,"threshold_uncertainty_score":0.33552825},"labels":[],"label_agreement":null},{"id":"W2108580877","doi":"10.1109/pacrim.1995.519414","title":"Architecture tradeoffs in in reduced instruction set computers: a case study","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Saskatchewan; University of Victoria","funders":"","keywords":"Computer science; Computer architecture; Instruction set; Benchmark (surveying); Suite; Architecture; Reduced instruction set computing; Addressing mode; Microarchitecture; Set (abstract data type); Reference architecture; Parallel computing; Operating system; Software architecture; Programming language; Central processing unit; Software; Instructions per cycle","score_opus":0.036087857499023344,"score_gpt":0.27290600235921814,"score_spread":0.23681814486019478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108580877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5081046,0.000027365752,0.48908275,0.00061961537,0.0001251055,0.0003137676,2.8376837e-7,0.00040993188,0.0013165382],"genre_scores_gemma":[0.81761783,0.000003909588,0.18211861,0.00019387326,0.000018678336,0.000011477661,5.420306e-7,0.000004686369,0.000030377749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987588,0.00020552624,0.00030094598,0.00037846583,0.00014882669,0.0002074412],"domain_scores_gemma":[0.9994614,0.00006591106,0.000050605984,0.00034931384,0.000025188934,0.00004759582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026277945,0.00012627445,0.00015967965,0.00043222404,0.000050065526,0.00009835562,0.00038311147,0.000055176988,0.000009588306],"category_scores_gemma":[0.00002279649,0.00011881327,0.000027005759,0.00093121047,0.00001730941,0.0002516672,0.00012541898,0.00021753949,0.000004487394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021782342,0.0025652733,0.00645077,0.00002484864,0.00003078102,0.011870778,0.097233586,0.26223218,0.000051343322,0.0045953244,0.0035862373,0.61133707],"study_design_scores_gemma":[0.0012428073,0.00023621101,0.00080152706,0.000024702917,0.0000013766513,0.0028248234,0.00085533527,0.99292153,0.00010690307,0.0005837493,0.00017513894,0.00022588244],"about_ca_topic_score_codex":0.0005914459,"about_ca_topic_score_gemma":0.00025219945,"teacher_disagreement_score":0.73068935,"about_ca_system_score_codex":0.00005718537,"about_ca_system_score_gemma":0.000010798858,"threshold_uncertainty_score":0.48450646},"labels":[],"label_agreement":null},{"id":"W2108801243","doi":"10.1109/tpds.2008.105","title":"The Design of OpenMP Tasks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":387,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Scalability; Flexibility (engineering); Exploit; Human multitasking; Parallelism (grammar); Key (lock); Computer architecture; Set (abstract data type); Parallel computing; Distributed computing; Programming language; Operating system","score_opus":0.02456869289260105,"score_gpt":0.25362157293917215,"score_spread":0.2290528800465711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108801243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010325521,0.000382062,0.9980537,0.0004570878,0.00022955982,0.00030892275,0.00001781829,0.00021918227,0.00022836193],"genre_scores_gemma":[0.9861876,0.00023429704,0.013272752,0.000053833286,0.000012085875,0.00002632135,0.000002641878,0.0000038998683,0.00020657878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886304,0.00017276985,0.00032997425,0.00023467223,0.00019680957,0.00020273036],"domain_scores_gemma":[0.99908066,0.00020520875,0.00012300108,0.00041318376,0.00009862542,0.00007934017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038507397,0.00013683148,0.00018986514,0.000059462283,0.00039550444,0.00018429523,0.00047278852,0.0000727998,8.298766e-7],"category_scores_gemma":[0.0000065318145,0.000095621515,0.000054970707,0.00029488956,0.00005367794,0.00015119484,0.000002257048,0.00012262618,0.0000050684916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028419929,0.00007420064,0.0000023500634,0.0000056434865,0.00001836387,0.00000206904,0.00007139816,0.9853373,0.00012599445,0.005499585,0.0016783287,0.007156303],"study_design_scores_gemma":[0.00042496918,0.00035701942,0.00010776113,0.000048671536,0.000010952351,0.000032327585,0.00004100341,0.99559087,0.00070187304,0.0010444756,0.0014549454,0.00018512961],"about_ca_topic_score_codex":0.000021300588,"about_ca_topic_score_gemma":8.530575e-7,"teacher_disagreement_score":0.98608434,"about_ca_system_score_codex":0.000020387159,"about_ca_system_score_gemma":0.000039513652,"threshold_uncertainty_score":0.38993323},"labels":[],"label_agreement":null},{"id":"W2109371939","doi":"10.1109/newcas.2004.1359084","title":"Cache coherence support in a split-transaction bus for prototyping of system-on-chip multiprocessors","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Cache coherence; Bus sniffing; MESI protocol; System bus; Embedded system; Cache; VHDL; Control bus; Back-side bus; Address bus; Local bus; Computer hardware; Cache algorithms; Operating system; CPU cache; Field-programmable gate array","score_opus":0.03652958269455215,"score_gpt":0.2806579422214046,"score_spread":0.24412835952685247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109371939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13236505,0.0014299477,0.8574442,0.0005263633,0.0010127305,0.0051549505,0.000101454454,0.0006193148,0.0013459593],"genre_scores_gemma":[0.9980266,0.00003591176,0.0009305484,0.000110271925,0.00017269085,0.000368572,0.000008669129,0.000036568123,0.00031017806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708056,0.00020583611,0.00090281526,0.0007255072,0.00049748115,0.00058781885],"domain_scores_gemma":[0.9981071,0.0002867982,0.00045835256,0.0006616834,0.00032745497,0.00015861665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00133664,0.00040441536,0.0006127867,0.00029739883,0.00034814363,0.00018380988,0.0007625878,0.00022395224,0.0000015555288],"category_scores_gemma":[0.000049785478,0.00030658089,0.00012087404,0.0007622664,0.00011679448,0.00032886735,0.000029589386,0.00036734063,0.000009612107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002610386,0.00061655894,0.0006287881,0.0015386175,0.00009550213,0.00003947558,0.010048765,0.9219112,0.00016751183,0.013730762,0.00037793798,0.05058386],"study_design_scores_gemma":[0.022616955,0.0066587296,0.00707575,0.033795025,0.0002748226,0.0016920327,0.020591367,0.8824855,0.007239481,0.0031697378,0.008083629,0.006316973],"about_ca_topic_score_codex":0.00043729192,"about_ca_topic_score_gemma":0.0000887216,"teacher_disagreement_score":0.86566156,"about_ca_system_score_codex":0.00017780306,"about_ca_system_score_gemma":0.00023431698,"threshold_uncertainty_score":0.9999386},"labels":[],"label_agreement":null},{"id":"W2109473415","doi":"10.1109/eurmic.1998.711814","title":"Revolver: a high-performance MIMD architecture for collision free computing","year":2002,"lang":"en","type":"article","venue":"Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Parallel computing; Pipeline (software); Very long instruction word; MIMD; Computer architecture; Instruction-level parallelism; Compiler; Instruction set; Register file; Parallelism (grammar); Microarchitecture; Multi-core processor; SIMD; Architecture; Operating system","score_opus":0.026415921965191668,"score_gpt":0.22755286078764464,"score_spread":0.20113693882245298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109473415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27317673,0.000092970105,0.7143204,0.0016720481,0.0007972424,0.0012635232,0.000029285779,0.0020134114,0.006634377],"genre_scores_gemma":[0.42011607,0.0002590191,0.57745814,0.0006843587,0.0002983099,0.000051320378,0.000014179544,0.000053563686,0.0010650663],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961573,0.00004308552,0.0008227313,0.0014034156,0.00053077674,0.0010426869],"domain_scores_gemma":[0.99679434,0.00017005076,0.00060695753,0.0008210676,0.0013275851,0.0002799698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006662208,0.00063689204,0.000665217,0.00038327073,0.0007637981,0.00088577095,0.0033027083,0.0002701634,0.000042398195],"category_scores_gemma":[0.00047797087,0.000620318,0.0001740557,0.0008747314,0.00016231994,0.00083840196,0.0010870463,0.00040941997,0.00014767483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004744356,0.0016876889,0.006054817,0.002827076,0.00035875494,0.000041250147,0.015479596,0.010493453,0.15250225,0.08990395,0.47993022,0.2402465],"study_design_scores_gemma":[0.0012631316,0.0005484401,0.00068508065,0.0004264774,0.000025305335,0.000061670915,0.000021139662,0.96443355,0.01767266,0.0016393322,0.012352297,0.00087090075],"about_ca_topic_score_codex":0.000028906215,"about_ca_topic_score_gemma":0.0000020786888,"teacher_disagreement_score":0.9539401,"about_ca_system_score_codex":0.00014766077,"about_ca_system_score_gemma":0.00011263548,"threshold_uncertainty_score":0.9996248},"labels":[],"label_agreement":null},{"id":"W2109763887","doi":"10.1145/2628071.2628118","title":"SQRL","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Exploit; Parallel computing; Data structure; Locality; Kernel (algebra); Cache; Fetch; Software; Computation; Embedded system; Computer architecture; Operating system; Algorithm","score_opus":0.010140220017303907,"score_gpt":0.23638273024376033,"score_spread":0.22624251022645642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109763887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010148631,0.0000037898053,0.82700264,0.0004787993,0.000048060392,0.00001263284,7.581938e-9,0.00074341515,0.17160918],"genre_scores_gemma":[0.38773632,0.0000012077005,0.6100855,0.00073093653,0.000018376168,9.771518e-7,1.2519699e-7,0.0000012341121,0.0014253223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999706,0.000019875486,0.00005049357,0.00009905385,0.000054933353,0.00006969153],"domain_scores_gemma":[0.9996956,0.000023527424,0.000012995849,0.00022207851,0.000021006548,0.000024762921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001265866,0.000029570514,0.000033816104,0.000027690432,0.000035480567,0.00004979894,0.00033455563,0.000013634976,0.000011096821],"category_scores_gemma":[0.00001797366,0.000024291207,0.000013399822,0.00009521122,0.0000056686495,0.00008532048,0.000077206314,0.000021999878,0.00008443829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2310919e-7,0.0000082998085,0.000120340366,7.9470186e-7,8.6413644e-7,1.7901449e-7,0.000032083608,0.0008249121,0.000032801967,0.9214329,0.016651914,0.060894802],"study_design_scores_gemma":[0.000045151563,0.000021472408,0.00027417764,0.0000016150855,2.0591217e-7,0.000002203737,3.638955e-7,0.9292247,0.0023564424,0.016885195,0.051126875,0.00006156967],"about_ca_topic_score_codex":0.0000033015292,"about_ca_topic_score_gemma":2.5818494e-7,"teacher_disagreement_score":0.9283998,"about_ca_system_score_codex":0.0000030010788,"about_ca_system_score_gemma":0.00000471321,"threshold_uncertainty_score":0.10853115},"labels":[],"label_agreement":null},{"id":"W2110014487","doi":"10.5555/2492708.2492783","title":"Run-time power-gating in caches of GPUs for leakage energy savings","year":2012,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Sleep mode; Cache; Computer science; Power gating; Parallel computing; Latency (audio); CPU cache; Embedded system; CUDA; IBM; Instruction set; CAS latency; Cache algorithms; Microarchitecture; Leakage (economics); Operating system; Power (physics); Transistor; Power consumption; Memory controller; Engineering; Electrical engineering; Semiconductor memory","score_opus":0.017082013571012883,"score_gpt":0.23701819330895155,"score_spread":0.21993617973793866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110014487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03411763,0.00025024757,0.9641761,0.00008168104,0.00005176583,0.00015552789,0.0000014187049,0.0002498648,0.00091572024],"genre_scores_gemma":[0.7740923,0.000022525863,0.22566728,0.00007455309,0.000016589582,0.000012132537,0.0000031720851,0.000010034344,0.00010136806],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990279,0.00012558137,0.000342186,0.0001850733,0.000102666985,0.00021657799],"domain_scores_gemma":[0.9988157,0.00068755884,0.00016039723,0.00018046655,0.00011249385,0.000043357573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080242974,0.00010938187,0.00016713234,0.00021214588,0.00006351043,0.00005310254,0.00025167016,0.000046414312,0.0000025120137],"category_scores_gemma":[0.0005757045,0.0001085868,0.000017929035,0.0005384293,0.00002955095,0.00042415923,0.000069149064,0.000048161794,0.0000021547478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060797265,0.0027761515,0.36103788,0.0005680394,0.00006712482,0.000023182114,0.048130084,0.05660119,0.05816189,0.2881762,0.009922627,0.17447482],"study_design_scores_gemma":[0.0005157708,0.00019155341,0.073658615,0.0001324575,0.000003891736,0.00001177313,0.000016381638,0.90609896,0.01630397,0.0015625074,0.0012139045,0.00029021237],"about_ca_topic_score_codex":0.00004291071,"about_ca_topic_score_gemma":0.0000026202079,"teacher_disagreement_score":0.8494978,"about_ca_system_score_codex":0.000019296129,"about_ca_system_score_gemma":0.000039792747,"threshold_uncertainty_score":0.44280413},"labels":[],"label_agreement":null},{"id":"W2110019232","doi":"10.1109/icpp.2009.9","title":"On the Scalability of Parallel Verilog Simulation","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Verilog; Electronic circuit; Scalability; Bottleneck; Hardware description language; Parallel computing; Computer hardware; Embedded system; Field-programmable gate array; Electrical engineering; Engineering","score_opus":0.02184983870908339,"score_gpt":0.2792098056389564,"score_spread":0.257359966929873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110019232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010235879,0.0000057713182,0.9730505,0.0018469489,0.000024812829,0.00008831489,1.0800602e-7,0.00022382868,0.014523881],"genre_scores_gemma":[0.90386486,0.0000013626184,0.09524486,0.0007981349,0.0000063194784,8.890325e-7,2.6985632e-7,9.201582e-7,0.00008238789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947727,0.00005659056,0.0001325337,0.0001309645,0.00012721783,0.0000754411],"domain_scores_gemma":[0.99923986,0.00023539386,0.000051124167,0.00039697983,0.00005966206,0.000016963842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026203223,0.000050326427,0.00006508526,0.000027897904,0.00005472319,0.000025021942,0.00038132875,0.000025114106,0.00001518052],"category_scores_gemma":[0.00009438954,0.00003092844,0.00003263073,0.0001789798,0.000020085396,0.00007976625,0.000033313252,0.000045397763,0.000007940018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005027026,0.000055904547,0.00006942794,8.2513026e-7,0.0000014238784,1.2221342e-7,0.000070675706,0.4928416,0.000030451974,0.4947253,0.00107176,0.0111275045],"study_design_scores_gemma":[0.00005084201,0.00010265229,0.0045509334,0.0000040278783,4.7098334e-7,1.6812389e-7,9.943194e-7,0.90856785,0.0009599153,0.08560835,0.000112688176,0.000041095667],"about_ca_topic_score_codex":0.0000032229111,"about_ca_topic_score_gemma":1.7404327e-7,"teacher_disagreement_score":0.89362895,"about_ca_system_score_codex":0.000009467587,"about_ca_system_score_gemma":0.000011808116,"threshold_uncertainty_score":0.12612252},"labels":[],"label_agreement":null},{"id":"W2110192022","doi":"10.1109/ccece.2005.1557051","title":"A parameterizable SIMD stream processor","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; SIMD; Stream processing; Computer hardware; Embedded system","score_opus":0.009844911956501048,"score_gpt":0.233663078751485,"score_spread":0.22381816679498395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110192022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022591366,0.000028175478,0.91072744,0.00024071516,0.000037790036,0.00007272895,2.624984e-7,0.0012337646,0.08539999],"genre_scores_gemma":[0.50020546,0.0000022334077,0.49588898,0.00019680706,0.000024726707,0.000009350425,0.0000019160677,0.0000037958491,0.0036667304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933255,0.000017695002,0.00013531728,0.00022250004,0.00011793508,0.00017401169],"domain_scores_gemma":[0.99956596,0.000027428003,0.00004374659,0.00027850294,0.000054793953,0.00002959021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008841093,0.00007851584,0.000080796635,0.00005791501,0.00007258469,0.00016348729,0.00044949492,0.000033216664,0.000011832265],"category_scores_gemma":[0.000010745573,0.000066283916,0.000027385717,0.00028626667,0.000014575666,0.00023500451,0.00009827674,0.000041405274,0.00003804285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010327257,0.0007391004,0.003371247,0.000057678903,0.0000228725,0.000022431546,0.00021378374,0.08189263,0.002425962,0.61150193,0.23778448,0.06195758],"study_design_scores_gemma":[0.00020720859,0.00009993248,0.00043113742,0.000011478652,0.0000019047238,0.000011381685,0.0000027661408,0.9265352,0.02514904,0.03217418,0.01511485,0.0002609024],"about_ca_topic_score_codex":0.00009438175,"about_ca_topic_score_gemma":0.000004141211,"teacher_disagreement_score":0.8446426,"about_ca_system_score_codex":0.000010872391,"about_ca_system_score_gemma":0.000028001252,"threshold_uncertainty_score":0.27029797},"labels":[],"label_agreement":null},{"id":"W2110195531","doi":"10.1109/ispass.2010.5452013","title":"Demystifying GPU microarchitecture through microbenchmarking","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":447,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"CUDA; Computer science; Speedup; Parallel computing; Suite; Graphics; Microarchitecture; General-purpose computing on graphics processing units; Architecture; Abstraction; Correctness; Computer architecture; Coprocessor; Computation; Computer graphics (images); Programming language","score_opus":0.012315776220132786,"score_gpt":0.25687363845923544,"score_spread":0.24455786223910267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110195531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069446554,0.000045681547,0.96137977,0.0013989644,0.00038580914,0.000081892154,2.6745377e-7,0.0010698547,0.028693084],"genre_scores_gemma":[0.33596548,0.000004635727,0.6628664,0.00080652727,0.000060857503,0.0000029682296,0.0000011386569,0.000006046568,0.0002859462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990802,0.000030514924,0.00017137598,0.00033917648,0.00011926239,0.0002594901],"domain_scores_gemma":[0.99927187,0.00006891047,0.0000617001,0.00048973935,0.000056765213,0.0000510186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000197972,0.00012787888,0.000109884975,0.00007234953,0.00020849741,0.0002120491,0.0009147834,0.000090660644,0.0000479472],"category_scores_gemma":[0.00003737633,0.0001097891,0.000056726705,0.00029481782,0.000040019648,0.00024937035,0.0002983424,0.00033862196,0.00003161083],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057439674,0.00012909077,0.0017521437,0.0000376095,0.000035918794,0.000028420774,0.0031867665,0.0029986678,0.38354784,0.43558106,0.02649738,0.14619938],"study_design_scores_gemma":[0.0006213055,0.0000825271,0.0014209455,0.00006718053,0.000009441254,0.0004409812,0.000025950714,0.28869674,0.41165757,0.08778209,0.2079394,0.0012558711],"about_ca_topic_score_codex":0.000035589055,"about_ca_topic_score_gemma":0.000014590656,"teacher_disagreement_score":0.34779894,"about_ca_system_score_codex":0.00000861892,"about_ca_system_score_gemma":0.000036156514,"threshold_uncertainty_score":0.44770697},"labels":[],"label_agreement":null},{"id":"W2110209678","doi":"10.1109/iwsoc.2005.90","title":"Performance improvement of configurable processor architectures using a variable clock period","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Speedup; Clock rate; Digital clock manager; Field-programmable gate array; Variable (mathematics); Task (project management); Quantization (signal processing); Acceleration; CPU multiplier; Parallel computing; Embedded system; Computer hardware; Clock skew; Clock signal; Jitter; Algorithm; Chip; Engineering; Telecommunications","score_opus":0.012708858759075733,"score_gpt":0.24457651022874627,"score_spread":0.23186765146967053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110209678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098922156,0.00005985566,0.887475,0.00019203863,0.000035412133,0.00015569359,5.3291996e-7,0.00028053604,0.012878783],"genre_scores_gemma":[0.53044635,0.0000037766536,0.46898344,0.00012885038,0.000020126807,0.0000048347893,3.2638246e-7,0.0000035739547,0.00040873745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991107,0.000014150863,0.0002490822,0.00022891173,0.00018139582,0.00021575819],"domain_scores_gemma":[0.9993898,0.000015730819,0.00011637463,0.00030462747,0.00012907668,0.000044391894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021320685,0.00010666709,0.00014328722,0.000092155096,0.00011005546,0.000061779254,0.000500776,0.000038003705,0.000035772056],"category_scores_gemma":[0.000014091537,0.000089195455,0.000029015127,0.00027800628,0.000028065642,0.00016173166,0.00012051498,0.00007489722,0.000003489408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001591468,0.000188475,0.0005198695,0.00014950133,0.000028822995,7.005297e-7,0.0010332034,0.8710963,0.0355515,0.02208119,0.00056753674,0.068766974],"study_design_scores_gemma":[0.0001487475,0.000100485486,0.00004892722,0.000027784346,0.0000025313266,0.000009712731,0.0000058915534,0.8653052,0.13281845,0.00028879204,0.0011333312,0.0001101684],"about_ca_topic_score_codex":0.000031276046,"about_ca_topic_score_gemma":0.0000012293507,"teacher_disagreement_score":0.4315242,"about_ca_system_score_codex":0.000028906854,"about_ca_system_score_gemma":0.000147551,"threshold_uncertainty_score":0.36372852},"labels":[],"label_agreement":null},{"id":"W2110655873","doi":"10.1109/pacrim.1995.519535","title":"Parallelization of sequential programs for net-based execution","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Pascal (unit); Dependency (UML); Net (polyhedron); Programming language; Parallel computing; Parallelism (grammar); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.04446353114638934,"score_gpt":0.26980424139784626,"score_spread":0.2253407102514569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110655873","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035852613,0.000040614377,0.99616724,0.00031385705,0.000075425145,0.00028607974,4.4379502e-7,0.00048528024,0.0022725568],"genre_scores_gemma":[0.45936754,0.0000052520877,0.5402124,0.00009335762,0.000017020226,0.000025608419,0.000010107235,0.0000035551911,0.00026517457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936175,0.000027602036,0.00019017568,0.00017427787,0.00012027163,0.00012593337],"domain_scores_gemma":[0.99949324,0.0000248767,0.00009436439,0.00021699951,0.00014116669,0.000029358653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012677557,0.000067578345,0.000087568966,0.00007152328,0.0000553262,0.00004894373,0.00027318252,0.00004606127,0.000016251242],"category_scores_gemma":[0.000017914239,0.00006257185,0.00005565288,0.00023039433,0.000021390257,0.00014652062,0.000029122188,0.000023148275,0.0000035902572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029579822,0.0009131947,0.0009817845,0.00015171667,0.000037543436,0.0000017041483,0.00056505634,0.17831765,0.0016758153,0.3517739,0.045580782,0.4199713],"study_design_scores_gemma":[0.00026782148,0.00012327931,0.000027154894,0.000010981205,0.0000024971434,7.277439e-7,0.0000013483868,0.98757666,0.008002096,0.001237178,0.002671729,0.000078537814],"about_ca_topic_score_codex":0.000009179939,"about_ca_topic_score_gemma":0.000001267517,"teacher_disagreement_score":0.809259,"about_ca_system_score_codex":0.000013671703,"about_ca_system_score_gemma":0.000013312939,"threshold_uncertainty_score":0.2551606},"labels":[],"label_agreement":null},{"id":"W2110723369","doi":"10.5555/1898953.1898966","title":"Improving cache locality for thread-level speculation","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Uniprocessor system; Cache; Speculative multithreading; Parallel computing; Cache algorithms; Cache invalidation; Bus sniffing; Cache coloring; Cache pollution; Smart Cache; Locality; Scalability; Page cache; Thread (computing); Operating system; CPU cache; Multithreading; Multiprocessing","score_opus":0.033362146682569455,"score_gpt":0.26758230893849067,"score_spread":0.2342201622559212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110723369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000676377,0.000018878744,0.9919549,0.0003250968,0.00007322672,0.00016274254,0.0000012343622,0.00063351693,0.006154019],"genre_scores_gemma":[0.35661075,3.6048996e-7,0.6423769,0.00011646627,0.000056587065,0.000008017629,0.0000064246283,0.0000034504296,0.00082103634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933815,0.000018584362,0.00016548256,0.00022762643,0.000101129524,0.00014903299],"domain_scores_gemma":[0.99950796,0.00005209311,0.00006423612,0.00025613196,0.000096682605,0.00002290251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025753974,0.00007292345,0.000075602045,0.000043976615,0.00010260909,0.000107153865,0.00027565708,0.00004367996,0.0000036250397],"category_scores_gemma":[0.00002233151,0.000065030785,0.00004422231,0.00013683898,0.000013079294,0.00019768957,0.00007355623,0.000035071986,0.00000534129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040579116,0.00007562255,0.0013228153,0.000020860572,0.0000049679666,8.5643785e-7,0.000043309326,0.031871032,0.00072573574,0.89396805,0.009957791,0.062004924],"study_design_scores_gemma":[0.00014531401,0.000021400923,0.0022723991,0.000003151262,0.0000016687083,0.0000017138765,0.0000014986612,0.94522816,0.009528186,0.04168617,0.0009964622,0.000113849994],"about_ca_topic_score_codex":0.00032980688,"about_ca_topic_score_gemma":0.000024850462,"teacher_disagreement_score":0.91335714,"about_ca_system_score_codex":0.00003154356,"about_ca_system_score_gemma":0.000027653137,"threshold_uncertainty_score":0.26518783},"labels":[],"label_agreement":null},{"id":"W2110809263","doi":"10.1145/1393921.1393982","title":"A physical level study and optimization of CAM-based checkpointed register alias table","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Alias; Computer science; Energy (signal processing); Function (biology); Parallel computing; Mathematics; Database; Statistics","score_opus":0.05289234616347949,"score_gpt":0.2820053804581091,"score_spread":0.2291130342946296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110809263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03380201,0.000009115394,0.9640046,0.00018325407,0.000022428158,0.00018691854,7.7260836e-7,0.0002607281,0.0015302064],"genre_scores_gemma":[0.62811285,0.0000021173541,0.37112534,0.0000810576,0.00001134588,0.000005668182,0.0000015006922,0.0000044969834,0.0006556559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.00006045128,0.00018508457,0.00025792536,0.00017901411,0.00011864966],"domain_scores_gemma":[0.9993293,0.000044827935,0.00009560817,0.00033762978,0.00014836341,0.00004426938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000135257,0.00009775455,0.00016974396,0.000089750065,0.00008925929,0.00002973951,0.00026382107,0.000027553759,0.0000057155007],"category_scores_gemma":[0.00003387834,0.000084094725,0.000027453718,0.0003472573,0.0000537327,0.0001819415,0.00010988144,0.000052232223,0.0000013989816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027819473,0.0014110905,0.0045595565,0.000027383292,0.00003302338,0.000013317299,0.003267267,0.98027,0.00032129596,0.002113715,0.006812623,0.0011428767],"study_design_scores_gemma":[0.00047034043,0.00020461313,0.0006781719,0.000008655447,0.000003817976,0.0000070229885,0.000021223697,0.9940315,0.0043842336,0.000049777413,0.000037733946,0.00010292463],"about_ca_topic_score_codex":0.00013403689,"about_ca_topic_score_gemma":0.0000021676738,"teacher_disagreement_score":0.5943108,"about_ca_system_score_codex":0.000012094222,"about_ca_system_score_gemma":0.000053313506,"threshold_uncertainty_score":0.34292832},"labels":[],"label_agreement":null},{"id":"W2111115220","doi":"10.1109/wwos.1989.109260","title":"Efficient shared memory for testing parallel algorithms on distributed systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Unix; Ethernet; Workstation; Shared memory; Parallel computing; Distributed memory; Local area network; Computation; Node (physics); Parallel algorithm; Distributed computing; Distributed shared memory; Memory management; Algorithm; Operating system; Uniform memory access; Software","score_opus":0.0404168501566716,"score_gpt":0.2698427811513909,"score_spread":0.22942593099471928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111115220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026192685,0.00008690519,0.9912023,0.00010389135,0.00032335924,0.00048571872,0.000010255991,0.0011696644,0.006355954],"genre_scores_gemma":[0.1955749,8.474317e-7,0.80333036,0.00012901975,0.000037216298,0.000097094,0.000013357695,0.000011819442,0.00080535386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986338,0.00008102455,0.00027879703,0.00042360506,0.00021390391,0.00036884076],"domain_scores_gemma":[0.99877614,0.00036371898,0.00011053942,0.0004425003,0.0002121809,0.00009495001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005598939,0.0001583249,0.0001776024,0.000087862114,0.00025107825,0.00023169356,0.00049071125,0.00006339881,0.0000033344363],"category_scores_gemma":[0.00038996764,0.00013525714,0.000058679863,0.00041365583,0.000016914779,0.00005421431,0.00006909912,0.000077402736,0.000017292303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024522058,0.00007749469,0.000021814143,0.0000141450955,0.0000074475374,0.0000024410235,0.000044342145,0.91917884,0.000024876033,0.07401851,0.0049317232,0.0016758973],"study_design_scores_gemma":[0.000344811,0.00012251607,0.000048298385,0.00003635122,0.0000024709104,0.000010397731,0.000014639578,0.9966665,0.00036056497,0.00040094188,0.0017999988,0.00019254282],"about_ca_topic_score_codex":0.0000142690305,"about_ca_topic_score_gemma":1.6945748e-7,"teacher_disagreement_score":0.19531298,"about_ca_system_score_codex":0.000058870108,"about_ca_system_score_gemma":0.000058099442,"threshold_uncertainty_score":0.5515626},"labels":[],"label_agreement":null},{"id":"W2111309786","doi":"10.1109/shpcc.1994.296690","title":"Distributed array data management on NUMA multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Compiler; Partition (number theory); Shared memory; Multiprocessing; Exploit; Distributed shared memory; Cache coherence; Distributed memory; Operating system; Memory management; Cache; Uniform memory access; CPU cache; Overlay","score_opus":0.05480020716243681,"score_gpt":0.274758230514401,"score_spread":0.2199580233519642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111309786","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007023322,0.000024642199,0.9427325,0.0010707162,0.000077357035,0.00009596655,0.0000058235187,0.0010195135,0.054903258],"genre_scores_gemma":[0.37940753,0.000067063556,0.61674124,0.0008098039,0.000027011369,0.000007731314,0.000043855645,0.000006996321,0.0028887982],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990185,0.000024902653,0.00014318107,0.00043214724,0.00019926985,0.00018200831],"domain_scores_gemma":[0.9986088,0.0000308523,0.000046118137,0.0012289908,0.000030297662,0.00005490952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013623651,0.000100580924,0.00008235284,0.000068791705,0.00010503942,0.00013321092,0.0018542039,0.000028724853,0.00006177564],"category_scores_gemma":[0.00001881283,0.00008489048,0.000017612341,0.0003282326,0.000014757886,0.00027021166,0.00039134824,0.00006552883,0.00021552296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069128578,0.0007725307,0.0003063667,0.000047837893,0.000074764896,0.00004974176,0.00037396347,0.021882795,0.00003108705,0.15306498,0.5937191,0.22966987],"study_design_scores_gemma":[0.00019684777,0.00003251772,0.00015801516,0.000016882055,0.0000022323536,0.0000024509652,0.000006698285,0.9586402,0.0008349862,0.00066544826,0.03928171,0.0001619957],"about_ca_topic_score_codex":0.000004017015,"about_ca_topic_score_gemma":5.82802e-7,"teacher_disagreement_score":0.93675745,"about_ca_system_score_codex":0.000017529273,"about_ca_system_score_gemma":0.0000022700442,"threshold_uncertainty_score":0.34617332},"labels":[],"label_agreement":null},{"id":"W2111683449","doi":"10.1109/fpl.2007.4380649","title":"Improving Pipelined Soft Processors with Multithreading","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multithreading; Computer science; Field-programmable gate array; Parallel computing; Processor design; Clock rate; Computer architecture; Simultaneous multithreading; Embedded system; Thread (computing); Operating system","score_opus":0.010572466115980984,"score_gpt":0.24839818023401525,"score_spread":0.23782571411803427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111683449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002244393,0.000020476204,0.98645115,0.00011623717,0.00004333963,0.000098525445,5.511652e-8,0.0014206925,0.009605109],"genre_scores_gemma":[0.4373008,7.13571e-7,0.5619172,0.00018703208,0.000022774162,0.0000018204197,3.7143155e-7,0.000005221343,0.0005641059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991225,0.000009097983,0.00016485463,0.00027272833,0.00016994918,0.0002608455],"domain_scores_gemma":[0.99940485,0.00006199586,0.00007890952,0.00025306662,0.00012788046,0.00007327396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044419098,0.00010168254,0.000090501686,0.00011505821,0.00011924662,0.00011408056,0.00044297747,0.000038581442,0.0000039912393],"category_scores_gemma":[0.000042394215,0.00007545655,0.000019017949,0.0003835231,0.000021057653,0.00032315005,0.00009947901,0.00008259199,0.000011436946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078041376,0.00029640947,0.01067909,0.00010902713,0.00004232888,0.00010077847,0.0029018563,0.028453015,0.004282716,0.08907717,0.0020916553,0.86188793],"study_design_scores_gemma":[0.0003149007,0.000097510754,0.00038297666,0.000026198455,0.0000025049128,0.000024247121,0.00003197921,0.9643539,0.033534326,0.00036316316,0.00061216974,0.0002560792],"about_ca_topic_score_codex":0.000047047273,"about_ca_topic_score_gemma":0.000022490283,"teacher_disagreement_score":0.9359009,"about_ca_system_score_codex":0.000023172244,"about_ca_system_score_gemma":0.000056610992,"threshold_uncertainty_score":0.30770287},"labels":[],"label_agreement":null},{"id":"W2112239176","doi":"10.1109/icnsc.2015.7116095","title":"Energy efficient dual-issue processor for embedded applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Very long instruction word; Efficient energy use; Instruction scheduling; Energy consumption; Instructions per cycle; Reduced instruction set computing; Scheduling (production processes); Field-programmable gate array; Instruction set; Superscalar; Computer architecture; Parallel computing; Computer hardware; Central processing unit; Operating system; Dynamic priority scheduling; Schedule; Electrical engineering; Engineering","score_opus":0.024303039094349443,"score_gpt":0.2877494078357431,"score_spread":0.26344636874139366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112239176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020112926,0.000050266335,0.9770196,0.0011657645,0.000059998583,0.0002178446,8.145405e-7,0.0008775173,0.020588046],"genre_scores_gemma":[0.08775614,0.0000036297172,0.9057018,0.0014534227,0.000079129975,0.00043721363,0.000007956588,0.000008660903,0.00455202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929607,0.000021841237,0.00014316912,0.00025249596,0.00013757692,0.00014886222],"domain_scores_gemma":[0.99920624,0.00005244511,0.00005610977,0.00031945112,0.00026853156,0.00009719281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026009275,0.00007861811,0.000085150175,0.00006947747,0.00007201714,0.000100832345,0.00037189733,0.000034949193,0.0000025290128],"category_scores_gemma":[0.000026711486,0.00006794002,0.000029447472,0.00028032894,0.000014191642,0.00008539607,0.00011136518,0.000026007774,0.000018219633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049207206,0.00017332367,0.000005601009,0.000012693167,0.0000077499835,4.648113e-7,0.0005139832,0.10567177,0.000052854542,0.8032039,0.06833784,0.022014901],"study_design_scores_gemma":[0.00018138225,0.000037898255,0.0000018157497,0.0000029673888,0.0000014771367,0.0000032941036,0.000012535341,0.8146772,0.004564451,0.006826902,0.17358793,0.00010216129],"about_ca_topic_score_codex":0.00001090197,"about_ca_topic_score_gemma":0.0000015271899,"teacher_disagreement_score":0.796377,"about_ca_system_score_codex":0.000017794586,"about_ca_system_score_gemma":0.00010570227,"threshold_uncertainty_score":0.27705136},"labels":[],"label_agreement":null},{"id":"W2112266133","doi":"10.1109/pacrim.2009.5291238","title":"Teaching old caches new tricks: RegionTracker and predictor virtualization","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Virtualization; Metadata; Exploit; Operating system; Granularity; Bus sniffing; Cache pollution; Cache algorithms; CPU cache; Parallel computing","score_opus":0.015427074444149383,"score_gpt":0.2523479555796985,"score_spread":0.23692088113554916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112266133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012931722,0.000113471404,0.98955154,0.0030750358,0.000047680758,0.00009051699,8.551034e-8,0.0014568699,0.00437162],"genre_scores_gemma":[0.50385207,0.00005228414,0.48669067,0.0024540008,0.0001289355,0.0000014538832,0.0000017003124,0.0000073170427,0.0068115867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927264,0.000052581647,0.00015848702,0.00024887512,0.00013310125,0.00013429142],"domain_scores_gemma":[0.9995453,0.000039310995,0.000057857396,0.0002364465,0.000028928322,0.00009219228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019904561,0.000092492715,0.000095293406,0.00009765978,0.00012476336,0.00016463076,0.00026509142,0.000053506763,0.0000029823832],"category_scores_gemma":[0.000058711907,0.000079730875,0.000021959075,0.00015737559,0.000010420196,0.00043704544,0.00005027493,0.00008626561,0.0000044409003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058879464,0.00007348706,0.0013255028,0.0000046637,0.0000090506965,0.0000041825983,0.0022029337,0.0012414544,0.00015473206,0.6272817,0.050145417,0.31755093],"study_design_scores_gemma":[0.00052151375,0.00024561698,0.006020983,0.00003886624,0.000007067147,0.000030956235,0.000021722259,0.94117373,0.0007200988,0.036864836,0.01403454,0.00032008742],"about_ca_topic_score_codex":0.000099319135,"about_ca_topic_score_gemma":0.0000025355066,"teacher_disagreement_score":0.9399322,"about_ca_system_score_codex":0.000015871348,"about_ca_system_score_gemma":0.000028393582,"threshold_uncertainty_score":0.3251331},"labels":[],"label_agreement":null},{"id":"W2112357522","doi":"10.1109/clustr.2002.1137731","title":"Supporting MPI collective communication on network processors","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Myrinet; Computer science; Message Passing Interface; Message passing; Latency (audio); InfiniBand; Operating system; Parallel computing; Telecommunications","score_opus":0.01914783233043472,"score_gpt":0.29374955888091664,"score_spread":0.27460172655048193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112357522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046719296,0.00004305208,0.75924766,0.00023677877,0.000039594222,0.000115044015,5.7319436e-8,0.0005360774,0.23931451],"genre_scores_gemma":[0.5260088,0.000012325907,0.4694699,0.001075182,0.00001070298,0.000016984968,0.0000011773062,0.0000055706664,0.003399358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912405,0.00014729581,0.00017853394,0.00020658247,0.00012811073,0.00021542306],"domain_scores_gemma":[0.9991783,0.00013039073,0.000114315306,0.00042841752,0.00010688226,0.000041728912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055297796,0.00008303056,0.000091387614,0.000052353815,0.00028320967,0.00010549558,0.00048107695,0.000040613857,0.000020474894],"category_scores_gemma":[0.00012262785,0.00007526037,0.000026688846,0.0005735707,0.000017836583,0.00015530619,0.00007123577,0.000104082974,0.00002156938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004868318,0.00010440018,0.001407798,0.0000062229424,0.000014345872,0.0000017338429,0.00094268704,0.089740716,0.000008483314,0.8243545,0.07928229,0.0041319174],"study_design_scores_gemma":[0.0006409461,0.00038234104,0.0009449505,0.000111726964,0.000006806714,0.000023432025,0.00009470323,0.7647401,0.015210766,0.1706514,0.046459768,0.0007330507],"about_ca_topic_score_codex":0.000004457292,"about_ca_topic_score_gemma":0.0000021062683,"teacher_disagreement_score":0.67499936,"about_ca_system_score_codex":0.00004735287,"about_ca_system_score_gemma":0.00012257606,"threshold_uncertainty_score":0.30690286},"labels":[],"label_agreement":null},{"id":"W2112914170","doi":"10.1109/pacrim.1991.160770","title":"Processing overhead of the RISC state-swapping operation in the ISDN software processing","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Integrated Services Digital Network; Computer science; Overhead (engineering); Software; Reduced instruction set computing; Embedded system; State (computer science); Task (project management); Interface (matter); Set (abstract data type); Instruction set; Parallel computing; Operating system; Computer network; Algorithm; Engineering; Programming language","score_opus":0.025961379825481936,"score_gpt":0.2542423676505518,"score_spread":0.22828098782506986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112914170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006360991,0.00026945918,0.98837143,0.0008062981,0.000034568155,0.00018992099,1.937996e-7,0.00018693466,0.0037801976],"genre_scores_gemma":[0.86769605,0.000010666388,0.13141946,0.00046381087,0.000014318952,0.000006862309,3.137406e-7,0.0000048305333,0.00038366122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989722,0.00009342615,0.0002887757,0.00020197793,0.0002675867,0.00017605138],"domain_scores_gemma":[0.9993979,0.00005822401,0.00014190073,0.00029807957,0.000088560635,0.00001535115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057282374,0.00009170045,0.00009684245,0.00006418414,0.00023560425,0.00022944239,0.0008424612,0.000033758504,0.000009397447],"category_scores_gemma":[0.00006787873,0.000051442912,0.000030571984,0.0006115648,0.000039321807,0.00046161492,0.00013129662,0.00013538585,0.0000036987467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007551475,0.00043776876,0.01207955,0.00026674938,0.000009944915,0.000007172268,0.04884825,0.13493362,0.0008581803,0.0028172482,0.0077663246,0.79196763],"study_design_scores_gemma":[0.00013247704,0.00002109972,0.0033564882,0.00013775629,0.00000165272,0.000007673295,0.00011872161,0.991763,0.0029666834,0.000970879,0.00040816556,0.00011540195],"about_ca_topic_score_codex":0.00002639476,"about_ca_topic_score_gemma":0.000021564374,"teacher_disagreement_score":0.8613351,"about_ca_system_score_codex":0.000025879752,"about_ca_system_score_gemma":0.000041511263,"threshold_uncertainty_score":0.22125182},"labels":[],"label_agreement":null},{"id":"W2113050667","doi":"10.1109/ipdps.2007.370565","title":"iC2mpi: A Platform for Parallel Execution of Graph-Structured Iterative Computations","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Parallel computing; Graph; Computation; Distributed computing; Load balancing (electrical power); Network topology; Theoretical computer science; Programming language; Operating system","score_opus":0.023280183871935322,"score_gpt":0.29271974811507534,"score_spread":0.26943956424314003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113050667","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024675992,0.0000324768,0.99366456,0.00014819793,0.000121461715,0.00033748467,0.0000040265845,0.00037035186,0.0028538255],"genre_scores_gemma":[0.42237645,0.0000028119237,0.57735974,0.00011756266,0.000015930184,0.000007682736,0.000011931092,0.0000035716012,0.0001043527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990557,0.000014423126,0.0003418358,0.00023125952,0.00015184397,0.00020497586],"domain_scores_gemma":[0.99908346,0.00019494492,0.00015953921,0.00023294397,0.00027157873,0.00005751117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033713994,0.00011188983,0.00015684262,0.00022166457,0.00013656297,0.000052277,0.00036429774,0.00006726515,0.000004216013],"category_scores_gemma":[0.000034351044,0.000098745724,0.00008974512,0.00041872117,0.000044759498,0.00028544557,0.000065611894,0.00005840846,0.0000013161806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045978402,0.0000956355,0.0002284221,0.000029528122,0.00004186102,0.0000015976617,0.0020798412,0.04010602,0.00076885853,0.9283387,0.0043535195,0.023910051],"study_design_scores_gemma":[0.00096533494,0.00030964616,0.0029626281,0.000031965814,0.00000922386,0.00001460713,0.00008264953,0.81866515,0.024671005,0.15071541,0.0012597824,0.00031262863],"about_ca_topic_score_codex":0.000012495417,"about_ca_topic_score_gemma":0.00001221009,"teacher_disagreement_score":0.7785591,"about_ca_system_score_codex":0.000022416521,"about_ca_system_score_gemma":0.000035769317,"threshold_uncertainty_score":0.40267336},"labels":[],"label_agreement":null},{"id":"W2113124751","doi":"10.1145/356989.357009","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Computer architecture; Exploit; Parallelism (grammar); Architecture; Addressing mode; Parallel computing; Programming language; Operating system; Instructions per cycle","score_opus":0.028591066831945428,"score_gpt":0.26507831811897303,"score_spread":0.2364872512870276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113124751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14397192,0.0008142382,0.82902783,0.017662754,0.00015183858,0.0010465021,0.000009034813,0.00028450091,0.007031404],"genre_scores_gemma":[0.88306427,0.000011114134,0.115807,0.0010556326,0.00001447281,0.000005944333,5.6847256e-7,0.0000024127228,0.000038574333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992073,0.00026952123,0.00014737344,0.00014192646,0.00013100354,0.0001028739],"domain_scores_gemma":[0.99841666,0.0009928736,0.000058400958,0.00049590174,0.000021135143,0.000015014766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030797475,0.00007193659,0.000087375556,0.00003857928,0.00013783973,0.00009576026,0.00074224797,0.000032270156,0.00002352312],"category_scores_gemma":[0.00012305392,0.00004006762,0.000018298404,0.00018355469,0.000081107886,0.00008319954,0.00008808642,0.000120019715,0.0000027563028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002131554,0.00020040816,0.008322731,0.000040046907,0.000034695957,0.000017788569,0.024733495,0.8714036,0.00040283773,0.033105593,0.017865153,0.04385235],"study_design_scores_gemma":[0.0012294139,0.00034954463,0.1224148,0.00024020142,0.000041197338,0.00018796406,0.00023246133,0.7193373,0.004808769,0.14284171,0.0076210885,0.00069558003],"about_ca_topic_score_codex":0.00003658132,"about_ca_topic_score_gemma":0.000022787828,"teacher_disagreement_score":0.73909235,"about_ca_system_score_codex":0.0000033414544,"about_ca_system_score_gemma":0.000027744578,"threshold_uncertainty_score":0.16339102},"labels":[],"label_agreement":null},{"id":"W2113203238","doi":"10.1145/1073884.1073899","title":"A BLAS based C library for exact linear algebra on integer matrices","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear algebra; Integer (computer science); Implementation; Computer science; Numerical linear algebra; Algebra over a field; Matrix algebra; Linear system; Parallel computing; Mathematics; Programming language; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.01515887522823849,"score_gpt":0.26037824915521435,"score_spread":0.24521937392697585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113203238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045745226,0.000040755604,0.9795519,0.0060386797,0.000063744956,0.00017519003,0.000001774056,0.0017369955,0.011933515],"genre_scores_gemma":[0.11021075,0.000009923234,0.88071495,0.006436099,0.00015045117,0.00002100965,0.0000065509325,0.000013407038,0.0024368481],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992062,0.000030557934,0.00017256397,0.00028419367,0.00012261381,0.00018391418],"domain_scores_gemma":[0.99929065,0.0002091323,0.00005923521,0.0003424559,0.00003408357,0.000064459455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013331792,0.000113965696,0.00010820468,0.00015663364,0.00007961699,0.00015276489,0.00062881166,0.00005543739,0.00008103086],"category_scores_gemma":[0.000025855074,0.00009126611,0.00007539118,0.00025744352,0.000013132547,0.0005759053,0.000092247494,0.00007315259,0.00008158725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007257761,0.0004944189,0.00020927034,0.00004412418,0.000028782884,0.000005247499,0.00022490765,0.10156849,0.000072432056,0.26916057,0.48462242,0.14349677],"study_design_scores_gemma":[0.000196551,0.00013305111,0.000026991587,0.000016495214,0.0000014788751,9.301497e-7,0.0000012248447,0.8794387,0.024473842,0.00090029364,0.094683364,0.00012707428],"about_ca_topic_score_codex":0.0000022145864,"about_ca_topic_score_gemma":3.3806603e-7,"teacher_disagreement_score":0.77787024,"about_ca_system_score_codex":0.000012555975,"about_ca_system_score_gemma":0.00005359377,"threshold_uncertainty_score":0.37217242},"labels":[],"label_agreement":null},{"id":"W2113584830","doi":"10.1109/tcsi.2006.885995","title":"Using Stacked Bitlines and Hybrid ROM Cells to Form ROM and SRAM-ROM With Increased Storage Density","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"CMC Microsystems","keywords":"Read-only memory; Computer science; Static random-access memory; Computer hardware; CD-ROM; Embedded system; Operating system","score_opus":0.01845620160970925,"score_gpt":0.242800160988149,"score_spread":0.22434395937843973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113584830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40310365,0.00012022246,0.596078,0.00002062647,0.000032717624,0.00042206538,0.000044623026,0.00010703215,0.00007107348],"genre_scores_gemma":[0.9943682,0.000036451973,0.0052578845,0.0000879376,0.000037945305,0.000085033214,0.0000049364207,0.000013753792,0.000107865584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988864,0.0001125698,0.00023511115,0.0004522433,0.00013262875,0.00018103706],"domain_scores_gemma":[0.9993,0.00014861255,0.00008977493,0.00025565308,0.000054170436,0.00015175734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033960104,0.00019179315,0.00022077198,0.00014015242,0.00074319704,0.00034977333,0.00011508722,0.00005176277,0.0000014006368],"category_scores_gemma":[9.753287e-7,0.00016911747,0.000021915355,0.0002031673,0.000120300785,0.00023009583,0.000009333742,0.00010632823,0.0000011703332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041591364,0.0025551436,0.0022835785,0.0011114449,0.00056882255,0.000057819543,0.005786455,0.121477656,0.27641088,0.4462931,0.00036822187,0.14267097],"study_design_scores_gemma":[0.010166348,0.0032052014,0.024461707,0.0019371781,0.0008299274,0.003224047,0.004807244,0.7459377,0.12945122,0.05843433,0.011101445,0.0064436384],"about_ca_topic_score_codex":0.00029403565,"about_ca_topic_score_gemma":0.00005328497,"teacher_disagreement_score":0.62446004,"about_ca_system_score_codex":0.00003604208,"about_ca_system_score_gemma":0.000024306539,"threshold_uncertainty_score":0.68964106},"labels":[],"label_agreement":null},{"id":"W2113840705","doi":"10.1109/tc.2008.171","title":"On Spatial Orders and Location Codes","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Base (topology); Rendering (computer graphics); Matrix multiplication; Cartesian coordinate system; Encryption; Theoretical computer science; Mathematics; Computer graphics (images); Geometry","score_opus":0.01643944536887114,"score_gpt":0.2349374601688255,"score_spread":0.21849801479995434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113840705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066673453,0.000011248193,0.99128085,0.00044236446,0.00055820966,0.00013404658,0.0000013589804,0.0006483641,0.00025622567],"genre_scores_gemma":[0.8950011,0.000045767232,0.1041222,0.00072942383,0.000021591255,0.000009883584,0.0000010173936,0.000009000977,0.000060027956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990335,0.00006588858,0.00016825744,0.00035713424,0.00020216052,0.00017304497],"domain_scores_gemma":[0.99928373,0.00016487231,0.000053177097,0.00031982697,0.00009414383,0.000084264415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008576477,0.00015030864,0.00013323821,0.00021514863,0.00036668888,0.00006510019,0.00029958488,0.000060946626,0.000003990743],"category_scores_gemma":[0.0000039125657,0.00015193822,0.00003879284,0.0003969692,0.00007977613,0.00017885587,0.0000033221247,0.00015949701,0.000024739515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024572935,0.0001876133,0.000014204949,0.000008326985,0.000025783022,0.000012356386,0.0005623693,0.8951662,0.00003578318,0.0021872886,0.0025123227,0.09926316],"study_design_scores_gemma":[0.00040856062,0.00032429057,0.00024318547,0.000044077362,0.0000041294547,0.000049417526,0.0000032153914,0.9939374,0.0041797888,0.0003259929,0.0002603416,0.0002196471],"about_ca_topic_score_codex":0.000085360174,"about_ca_topic_score_gemma":0.000008210609,"teacher_disagreement_score":0.88833374,"about_ca_system_score_codex":0.000039991344,"about_ca_system_score_gemma":0.000052246167,"threshold_uncertainty_score":0.6195861},"labels":[],"label_agreement":null},{"id":"W2113910576","doi":"10.1109/newcas.2007.4488017","title":"Performance enhancement and high-level specification of a pipelined processor in programmable logic","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Computer science; VHDL; Field-programmable gate array; Embedded system; Computer architecture; Overhead (engineering); Stratix; Parallel computing; Computer hardware; Operating system","score_opus":0.03379428534329857,"score_gpt":0.2727182524362175,"score_spread":0.23892396709291894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113910576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06806595,0.00004662259,0.92908114,0.00011739112,0.000024213576,0.00018987912,8.1192034e-8,0.00010780006,0.0023669044],"genre_scores_gemma":[0.55540687,0.00003983642,0.4442321,0.000034454217,0.0000059993854,0.0000042754227,8.265676e-7,0.0000014786076,0.00027418789],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992098,0.000009514013,0.00028211746,0.00019408383,0.00013741694,0.00016706983],"domain_scores_gemma":[0.9995794,0.000028431277,0.00010174812,0.00016612782,0.00009460856,0.00002963929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007906604,0.000066774955,0.00009476036,0.00014161356,0.0000294035,0.000024122322,0.00021903712,0.000035478664,0.0000039199435],"category_scores_gemma":[0.000015761176,0.000056981917,0.000008649204,0.00041880086,0.000025542935,0.00016493941,0.00006996808,0.000047780588,0.0000019929716],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053052827,0.0003876026,0.009457771,0.00013310666,0.0000055049177,0.0000025041568,0.00077235705,0.0008330473,0.0040259124,0.047780275,0.00010813924,0.9364407],"study_design_scores_gemma":[0.00059261825,0.00032759976,0.038594782,0.000084036306,0.0000018781187,0.0000045960446,0.00003581451,0.67109066,0.28663906,0.0020081021,0.00039025585,0.00023058624],"about_ca_topic_score_codex":0.00002064022,"about_ca_topic_score_gemma":0.000009473761,"teacher_disagreement_score":0.93621016,"about_ca_system_score_codex":0.000021737835,"about_ca_system_score_gemma":0.000022440867,"threshold_uncertainty_score":0.2323655},"labels":[],"label_agreement":null},{"id":"W2113953643","doi":"10.1109/ccece.2007.242","title":"A Thread Specific Load Balancing Technique for a Clustered SMT Architecture","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Thread (computing); Computer science; Load balancing (electrical power); Parallel computing; Cluster analysis; Architecture; Exploit; Distributed computing; Cluster (spacecraft); Operating system","score_opus":0.01761795393449484,"score_gpt":0.2690631324488758,"score_spread":0.251445178514381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113953643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014021949,0.0001078125,0.9835293,0.0005089368,0.00013682774,0.00064229267,9.59302e-7,0.0012283637,0.0137052685],"genre_scores_gemma":[0.074604124,0.000008258061,0.9239182,0.0005156024,0.000108022025,0.000043590528,0.000002356466,0.000013241116,0.0007865961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863595,0.000025147963,0.00030145774,0.00041527266,0.00022900593,0.00039317977],"domain_scores_gemma":[0.99891996,0.00018835843,0.00010028983,0.00053421245,0.00016247616,0.00009467983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105979,0.00016252905,0.00018162324,0.00016082833,0.00014358491,0.0001198405,0.0007435042,0.000112480746,0.0000075108287],"category_scores_gemma":[0.00005033784,0.00013843793,0.000097950346,0.00037629346,0.000027518416,0.00013113522,0.0001824085,0.00014896468,0.0000084810135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021560401,0.00041870814,0.0005684919,0.00016618417,0.000077192395,0.00006825571,0.0032359425,0.010347076,0.041024134,0.4948235,0.06933843,0.37971652],"study_design_scores_gemma":[0.0021943687,0.0008196589,0.0010327065,0.00027096723,0.000012448914,0.00027275097,0.00006587688,0.11300339,0.4884541,0.22480887,0.16727424,0.0017906401],"about_ca_topic_score_codex":0.000015595273,"about_ca_topic_score_gemma":0.00001795062,"teacher_disagreement_score":0.44742996,"about_ca_system_score_codex":0.00008944681,"about_ca_system_score_gemma":0.00007400013,"threshold_uncertainty_score":0.5645335},"labels":[],"label_agreement":null},{"id":"W2114562199","doi":"10.1109/l-ca.2007.9","title":"A Building Block for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy","year":2007,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Memory hierarchy; Block (permutation group theory); Exploit; Parallel computing; Chip; Hierarchy; CPU cache; Block size; Multiprocessing; Reduction (mathematics); System on a chip; Embedded system; Operating system; Key (lock); Telecommunications","score_opus":0.01489042866387479,"score_gpt":0.2646361284728493,"score_spread":0.2497456998089745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114562199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010127832,0.00001996989,0.97342753,0.014152945,0.00068312534,0.00075587095,0.0000033327933,0.00048207073,0.000347293],"genre_scores_gemma":[0.10810907,0.0000016040584,0.8633505,0.027913032,0.00052251754,0.00005095068,0.000004937123,0.000025501817,0.000021897322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.00022997154,0.00043210582,0.0006250883,0.00037090504,0.0006351389],"domain_scores_gemma":[0.9977671,0.0011566306,0.00013523169,0.0007929663,0.00005447023,0.00009361673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012605165,0.00030399716,0.0002528449,0.0006161144,0.0003153844,0.00025305632,0.0018878746,0.00009075419,8.090188e-7],"category_scores_gemma":[0.000034843815,0.0002378621,0.00017195394,0.00083043816,0.00009704621,0.000115030314,0.00013501587,0.0004957559,0.00000423391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002216993,0.00008431123,0.000019867826,0.000015227327,0.000019283318,0.000037738726,0.0025707355,0.93185306,0.0008038544,0.0038232552,0.014729601,0.046020918],"study_design_scores_gemma":[0.0011822146,0.0002959535,0.0003988608,0.00012269184,0.000010708474,0.00015173957,0.000012049593,0.97842735,0.0032717274,0.0037386606,0.01173442,0.0006536491],"about_ca_topic_score_codex":0.00000994029,"about_ca_topic_score_gemma":0.0000123888285,"teacher_disagreement_score":0.11007707,"about_ca_system_score_codex":0.000061619045,"about_ca_system_score_gemma":0.000034545177,"threshold_uncertainty_score":0.96997344},"labels":[],"label_agreement":null},{"id":"W2114590246","doi":"10.1109/clustr.2007.4629271","title":"Improving System Efficiency through Scheduling and Power Management","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Power consumption; Scheduling (production processes); Power management; System on a chip; Embedded system; Power (physics); Distributed computing; Computer architecture; Engineering; Operations management","score_opus":0.009472723249255745,"score_gpt":0.2449560519684097,"score_spread":0.23548332871915395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114590246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037192788,0.00012150924,0.92023146,0.00005334757,0.00012855427,0.00010748296,3.9910567e-8,0.0009799692,0.07465839],"genre_scores_gemma":[0.49753714,0.0000034990437,0.5022214,0.0000941567,0.000007552797,9.867258e-7,8.3671e-8,0.0000026167318,0.00013256112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999153,0.000013832759,0.00018016515,0.00028140994,0.00014825877,0.00022331037],"domain_scores_gemma":[0.99956226,0.000032084226,0.000055374123,0.00026890842,0.00003791898,0.0000434716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005542177,0.00008581774,0.00008023155,0.00007763421,0.00014777767,0.00013501401,0.0003295416,0.000033129738,0.0000015799372],"category_scores_gemma":[0.00000660534,0.00007416955,0.000020399735,0.0002477402,0.00001790511,0.00022286641,0.00029483667,0.000054777705,0.000008382339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002234776,0.00002961235,0.00015800633,0.000063116044,0.0000094927755,0.000030194029,0.00048856076,0.002133582,0.00012636626,0.968735,0.00010580403,0.028118063],"study_design_scores_gemma":[0.0002964057,0.00007299402,0.00052879006,0.0000769594,0.000004943492,0.000043971148,0.0003931793,0.99235034,0.004484357,0.000706528,0.00074339146,0.00029814497],"about_ca_topic_score_codex":0.00001630906,"about_ca_topic_score_gemma":4.3933406e-7,"teacher_disagreement_score":0.99021673,"about_ca_system_score_codex":0.0000315283,"about_ca_system_score_gemma":0.000006746615,"threshold_uncertainty_score":0.30245462},"labels":[],"label_agreement":null},{"id":"W2114615578","doi":"10.1109/icde.1996.492115","title":"Parallel pointer-based join algorithms in memory mapped environments","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Join (topology); Pointer (user interface); Programmer; Pointer analysis; Parallel computing; Algorithm; Shared memory; Parallel algorithm; Graph; Linked list; Theoretical computer science; Programming language; Static analysis; Mathematics; Artificial intelligence","score_opus":0.024167848415933425,"score_gpt":0.23573596988638224,"score_spread":0.21156812147044882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114615578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009148297,0.00007430398,0.9825348,0.0011716038,0.00007900463,0.0001422067,3.8802696e-7,0.00039805946,0.014684764],"genre_scores_gemma":[0.25142857,0.000027554282,0.74173886,0.001489932,0.000020606969,0.000020454734,0.0000023535417,0.000010749836,0.005260935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878585,0.00008356787,0.00026743225,0.00037182428,0.00021452986,0.00027680804],"domain_scores_gemma":[0.99933505,0.000042630374,0.00006336896,0.00047621632,0.000008582107,0.00007416592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019846272,0.00014194615,0.00014947965,0.00018327365,0.00005277746,0.00007409745,0.0006530237,0.000063318636,0.00021365446],"category_scores_gemma":[0.000012943897,0.00013391016,0.000054564993,0.00024766749,0.000030135585,0.00020678905,0.00014785268,0.000120467004,0.0002317239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004308842,0.004169771,0.007145123,0.00006897833,0.00007693281,0.0004951867,0.003337158,0.46318647,0.0013858579,0.018363113,0.14307016,0.35865816],"study_design_scores_gemma":[0.0007564045,0.000055098582,0.00068190537,0.000014437705,7.8528495e-7,0.0000042878437,0.0000056967015,0.99375194,0.001818552,0.0004621243,0.0022641255,0.00018465938],"about_ca_topic_score_codex":0.000028018465,"about_ca_topic_score_gemma":0.0000035055475,"teacher_disagreement_score":0.53056544,"about_ca_system_score_codex":0.00005360351,"about_ca_system_score_gemma":0.000008497504,"threshold_uncertainty_score":0.54606974},"labels":[],"label_agreement":null},{"id":"W2114746386","doi":"10.1109/spl.2009.4914917","title":"SCBXP: An efficient hardware-based XML parsing technique","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Streaming XML; XML Signature; Efficient XML Interchange; Simple API for XML; XML validation; XML Encryption; XML framework; XML database; Parsing; Programming language; XML; Operating system","score_opus":0.016666070203250817,"score_gpt":0.2708335625938471,"score_spread":0.2541674923905963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114746386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010892923,0.000024054592,0.98588556,0.0009921547,0.00006661938,0.00022824219,3.1613664e-7,0.0027627286,0.008951033],"genre_scores_gemma":[0.46936464,8.7880153e-7,0.5293819,0.0011567479,0.000018262706,0.0000064336004,0.0000019363056,0.000003961432,0.00006526276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877083,0.00008555669,0.00021583204,0.00040865652,0.00023600501,0.00028311074],"domain_scores_gemma":[0.99900633,0.000030465544,0.00006791575,0.0006680671,0.00010599487,0.0001212218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043316552,0.00014529735,0.00013835331,0.00018190984,0.00018624688,0.00022128501,0.0007975054,0.00007719593,0.000011341858],"category_scores_gemma":[0.000023176151,0.00013112286,0.00005681003,0.00044773778,0.00002455487,0.00018919441,0.00005745747,0.00011976587,0.000015418733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018778355,0.00096855627,0.00017145702,0.000014077295,0.0000074731165,0.000041012914,0.00038922508,0.6528412,0.0068358383,0.17311881,0.006785736,0.15880786],"study_design_scores_gemma":[0.00012752664,0.00020655288,0.00027268886,0.000027296956,0.0000014738222,0.000008587038,0.0000021765807,0.9396992,0.056443453,0.0019396151,0.0010629852,0.00020849396],"about_ca_topic_score_codex":0.000009820893,"about_ca_topic_score_gemma":4.8930076e-7,"teacher_disagreement_score":0.46827537,"about_ca_system_score_codex":0.00004667325,"about_ca_system_score_gemma":0.000076992226,"threshold_uncertainty_score":0.5347035},"labels":[],"label_agreement":null},{"id":"W2114822644","doi":"10.1109/date.2005.286","title":"Symmetric Multiprocessing on Programmable Chips Made Easy","year":2005,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Uniprocessor system; Multiprocessing; Computer science; Vendor; Embedded system; Cache; Parallel computing; Symmetric multiprocessor system","score_opus":0.023711152034295295,"score_gpt":0.25353687034192907,"score_spread":0.22982571830763376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114822644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062565594,0.00026200968,0.9881316,0.00036041613,0.000048752463,0.00025541201,4.362914e-7,0.001152944,0.0035318737],"genre_scores_gemma":[0.5346311,0.00006904189,0.46456155,0.00028573483,0.0000451643,0.000014088064,0.000002503755,0.000012276272,0.0003785868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884117,0.00012914414,0.00027560393,0.0003384746,0.0001830632,0.00023256711],"domain_scores_gemma":[0.9991027,0.00034118793,0.00011532748,0.00024346235,0.00013215556,0.00006517983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053251913,0.00014289231,0.00013077409,0.0003744088,0.00018263525,0.00031501506,0.0003413691,0.00004766416,0.000002259056],"category_scores_gemma":[0.00054517156,0.0001320654,0.000014919611,0.0015427493,0.000028509641,0.00045541188,0.000061018392,0.000117242824,0.000034127712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001082573,0.0008189064,0.012391697,0.00008165396,0.000011242499,0.000024942503,0.0016187027,0.08574014,0.00047333937,0.028822267,0.0017763096,0.86823],"study_design_scores_gemma":[0.0002993429,0.00011896281,0.018577954,0.00006626974,0.0000019578983,0.000015476915,0.000001999296,0.97394186,0.0018974724,0.00041566693,0.0044731894,0.0001898755],"about_ca_topic_score_codex":0.0000069932885,"about_ca_topic_score_gemma":0.0000010421202,"teacher_disagreement_score":0.8882017,"about_ca_system_score_codex":0.000029798395,"about_ca_system_score_gemma":0.000056042794,"threshold_uncertainty_score":0.5385471},"labels":[],"label_agreement":null},{"id":"W2115676933","doi":"10.1109/hpca.2009.4798270","title":"A first-order fine-grained multithreaded throughput model","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Parallel computing; Multithreading; Throughput; Thread (computing); Cache algorithms; Markov chain; CPU cache; Probabilistic logic; Cache invalidation; Multi-core processor; Operating system","score_opus":0.024805419395937407,"score_gpt":0.27191349311816293,"score_spread":0.2471080737222255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115676933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020207891,0.00003802855,0.972251,0.0057563726,0.00004520083,0.0001276002,3.6391762e-7,0.0016852975,0.019894073],"genre_scores_gemma":[0.23548529,0.000011157984,0.7603974,0.0018358123,0.000022812288,0.00000491756,0.0000016303736,0.0000046836044,0.0022362967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898756,0.000019272775,0.00020022051,0.00035423593,0.00018092716,0.00025778462],"domain_scores_gemma":[0.9991809,0.00003559176,0.0000547298,0.0005330094,0.00012500735,0.00007075667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013216276,0.00014533571,0.00014554584,0.00008617524,0.00014870291,0.0001211928,0.0007069195,0.00006849979,0.000013348234],"category_scores_gemma":[0.000047621455,0.00012325993,0.000056613233,0.000422126,0.000018819665,0.00031672043,0.00010728773,0.00009317221,0.000037723104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006559529,0.00019365869,0.000040053255,0.0000052295873,0.000010085252,0.000007188812,0.00084942405,0.6747946,0.00014636385,0.27147114,0.036246892,0.016228793],"study_design_scores_gemma":[0.0002529606,0.000059668764,0.00009964442,0.000009061364,0.0000014929245,0.0000045157867,0.0000016156525,0.97060513,0.0006798583,0.027298087,0.0008132069,0.00017474986],"about_ca_topic_score_codex":0.000016397518,"about_ca_topic_score_gemma":0.000009733309,"teacher_disagreement_score":0.29581052,"about_ca_system_score_codex":0.000021659782,"about_ca_system_score_gemma":0.0000459526,"threshold_uncertainty_score":0.5026394},"labels":[],"label_agreement":null},{"id":"W2116249769","doi":"10.1016/j.micpro.2014.06.007","title":"Improved GPU SIMD control flow efficiency via hybrid warp size mechanism","year":2014,"lang":"en","type":"article","venue":"Microprocessors and Microsystems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"SIMD; Computer science; Speedup; Parallel computing; Overhead (engineering); Throughput; Control flow; Operating system","score_opus":0.003633445180697968,"score_gpt":0.19559402237744417,"score_spread":0.1919605771967462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116249769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025445974,0.000678582,0.9718367,0.00019224378,0.00040704233,0.0003850007,0.000009583182,0.00065704685,0.0003878581],"genre_scores_gemma":[0.94954205,0.000035882134,0.049049936,0.00061440404,0.00011737116,0.000029523027,0.000003648148,0.000027160264,0.00058000645],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979479,0.00012268817,0.00047934003,0.0007432607,0.0001835782,0.0005232848],"domain_scores_gemma":[0.998675,0.00014442396,0.00025450805,0.00053528836,0.00022631399,0.00016447454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007763457,0.00032427776,0.00044329665,0.00010844035,0.0003945501,0.00042877565,0.0008415239,0.000118144984,0.000004484282],"category_scores_gemma":[0.00008414669,0.0002841076,0.000091471455,0.00026461345,0.00006400159,0.00023288462,0.00019540271,0.00017896468,0.000021274498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003543189,0.0002677748,0.00007664486,0.0004249501,0.000057850593,0.000010001083,0.0011471155,0.0013870137,0.9597338,0.003023571,0.0031270834,0.030708792],"study_design_scores_gemma":[0.00092178246,0.00026257036,0.0000094581,0.00007416867,0.000012430155,0.00013817598,0.0000108704435,0.83637774,0.15463771,0.0012132904,0.0059015932,0.00044023595],"about_ca_topic_score_codex":0.00010695768,"about_ca_topic_score_gemma":0.0000057151015,"teacher_disagreement_score":0.9240961,"about_ca_system_score_codex":0.000035502835,"about_ca_system_score_gemma":0.00005042858,"threshold_uncertainty_score":0.99996114},"labels":[],"label_agreement":null},{"id":"W2116355244","doi":"10.1109/mdt.2002.1018134","title":"FlexWare: a retargetable, embedded-software development environment","year":2002,"lang":"en","type":"article","venue":"IEEE Design & Test of Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université Laval","keywords":"Computer science; Embedded software; Exploit; Embedded system; Software; Computer architecture; Microcontroller; Software development; Ranging; Operating system","score_opus":0.032843429543215785,"score_gpt":0.21645051993184686,"score_spread":0.18360709038863107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116355244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033450397,0.00040422473,0.9974512,0.00014353696,0.00032129083,0.00029400017,0.0000012750878,0.00079024123,0.00025972695],"genre_scores_gemma":[0.09504566,0.00007744357,0.9042554,0.0003090892,0.000043480606,0.000023006747,0.0000022678623,0.000019959283,0.00022370936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786985,0.00012460782,0.0005558639,0.00054265396,0.0004907012,0.0004163284],"domain_scores_gemma":[0.9982836,0.00047253387,0.00027049822,0.0007373826,0.000084790154,0.00015115671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038928652,0.00028545765,0.0003473193,0.00020520188,0.00016348438,0.000099104225,0.0012852413,0.00009557584,0.000032773103],"category_scores_gemma":[0.000051939733,0.00029118036,0.000092598646,0.00036687596,0.00007264995,0.00031053188,0.00019729508,0.00015079124,0.00011274923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014232936,0.0012658022,0.0011007383,0.000113430135,0.00015387691,0.000104561186,0.004057998,0.58039784,0.0016469872,0.0010580518,0.11989443,0.29019204],"study_design_scores_gemma":[0.00057699793,0.00036548052,0.000495666,0.00013972298,0.000011708591,0.00004342907,0.000003701364,0.93762285,0.044611517,0.00051258074,0.014945711,0.0006706214],"about_ca_topic_score_codex":0.0000024713183,"about_ca_topic_score_gemma":7.7797274e-8,"teacher_disagreement_score":0.357225,"about_ca_system_score_codex":0.00009426827,"about_ca_system_score_gemma":0.00005724646,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W2116394526","doi":"10.1145/2541228.2555307","title":"WADE","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Computing and Communication Foundations; National Science Foundation","keywords":"Computer science; Cache; Cache-only memory architecture; Embedded system; Dram; Static random-access memory; Overhead (engineering); Non-volatile memory; Cache pollution; CPU cache; Latency (audio); Operating system; Microprocessor; Parallel computing; Cache coloring; Cache algorithms; Computer hardware; Telecommunications","score_opus":0.010105644441797878,"score_gpt":0.22717923548104274,"score_spread":0.21707359103924487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116394526","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027609605,0.00004250682,0.9931117,0.004425646,0.0000768894,0.00022370162,0.0000025000568,0.00058310357,0.0012578288],"genre_scores_gemma":[0.16101786,0.00012231234,0.8373142,0.0010107192,0.000018031364,0.000053513555,0.0000049685073,0.000012155285,0.00044621964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991475,0.000056525056,0.00016315682,0.00031512018,0.00014094627,0.00017680101],"domain_scores_gemma":[0.999199,0.00008389081,0.000049265862,0.0005116059,0.000068533926,0.00008771837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000671279,0.00014132715,0.00010974489,0.00018580054,0.00025612485,0.00018895858,0.00043695813,0.000075085125,0.00007553627],"category_scores_gemma":[0.000018297542,0.00012502496,0.000042067284,0.000315887,0.00003518455,0.00028540552,0.000018503637,0.0001747911,0.000022667848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002534195,0.00003237183,0.0000049467553,0.0000036973925,0.000008069081,4.1504114e-7,0.0002303695,0.826876,0.000041552383,0.0005168783,0.00017088398,0.17211229],"study_design_scores_gemma":[0.0002458497,0.00012026735,0.00011526286,0.000019699222,0.0000072970292,0.000024340894,0.000010438097,0.98759466,0.0014301282,0.008947896,0.0012692461,0.0002149269],"about_ca_topic_score_codex":0.000017239345,"about_ca_topic_score_gemma":0.0000044026547,"teacher_disagreement_score":0.17189735,"about_ca_system_score_codex":0.000014167549,"about_ca_system_score_gemma":0.000018874325,"threshold_uncertainty_score":0.509837},"labels":[],"label_agreement":null},{"id":"W2116458028","doi":"10.1109/fccm.2008.38","title":"Investigation of Programming Models for Emerging FPGA-Based High Performance Computing Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Programming paradigm; Set (abstract data type); Supercomputer; Computer architecture; Parallel computing; Embedded system; Programming language","score_opus":0.0451696604486471,"score_gpt":0.25092236035755255,"score_spread":0.20575269990890546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116458028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11027398,0.000042647942,0.888377,0.00009637497,0.000106103296,0.00032760671,4.0317104e-7,0.000610119,0.00016577823],"genre_scores_gemma":[0.5484089,0.0000028671056,0.45147225,0.000044997123,0.000018941768,0.000012450797,0.0000036662352,0.000005247415,0.00003062953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892294,0.000039918843,0.00036455755,0.0002537313,0.00020482225,0.00021405194],"domain_scores_gemma":[0.9991048,0.00009505005,0.00021920848,0.0002702071,0.00026078368,0.00004994622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038197427,0.00011215547,0.0001793508,0.00014946512,0.00024637175,0.000046222354,0.00040418954,0.00004818901,2.923764e-7],"category_scores_gemma":[0.000016458189,0.00010650441,0.00004371748,0.0003613975,0.000046145,0.00035881827,0.000068010966,0.000056128563,6.381479e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026100838,0.000010481433,0.00060000655,0.00009549399,0.0000050972167,3.5004246e-7,0.00036529909,0.9806635,0.00011404123,0.011554229,0.0002017834,0.006387115],"study_design_scores_gemma":[0.00022393864,0.00008711949,0.00013930375,0.00008328525,0.0000022100246,0.0000048786605,0.000007340873,0.98040605,0.018594358,0.00027070154,0.000053438645,0.00012739742],"about_ca_topic_score_codex":0.0000633409,"about_ca_topic_score_gemma":2.659214e-7,"teacher_disagreement_score":0.43813497,"about_ca_system_score_codex":0.000030131161,"about_ca_system_score_gemma":0.000088017296,"threshold_uncertainty_score":0.4343124},"labels":[],"label_agreement":null},{"id":"W2116466593","doi":"10.1142/s0129626403001483","title":"Predicated Partial Redundancy Elimination using a Cost Analysis","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Redundancy (engineering); Computer science; Exploit; Compiler; Partial evaluation; Probabilistic logic; Computation; Data-flow analysis; Transformation (genetics); Static analysis; Parallel computing; Theoretical computer science; Algorithm; Programming language; Data flow diagram; Artificial intelligence","score_opus":0.02689541465424579,"score_gpt":0.2847682013409979,"score_spread":0.2578727866867521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116466593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009851001,0.00016959058,0.9871596,0.0011410777,0.00009830868,0.00019005641,6.554964e-7,0.00070995756,0.00067976036],"genre_scores_gemma":[0.62177676,0.000006103587,0.3773312,0.0007859927,0.000027221005,0.000020098956,0.000007718961,0.000011015937,0.000033857472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805325,0.00019858668,0.0003968617,0.000563541,0.00037113606,0.00041659232],"domain_scores_gemma":[0.9990029,0.00003884192,0.00028872536,0.0004221881,0.00013328926,0.00011408186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051070645,0.00020944464,0.00026197737,0.00043222273,0.0003907251,0.00040795864,0.00056580384,0.00008180803,0.000011619284],"category_scores_gemma":[0.00009323857,0.00021337406,0.00012002338,0.0020057997,0.0000762004,0.00062112533,0.000068084504,0.0001642621,0.000009680451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017498292,0.00020134842,0.0036959099,0.00006490637,0.00026131564,0.000025564554,0.001826525,0.9665734,0.0046115993,0.0047881952,0.0019376152,0.015996113],"study_design_scores_gemma":[0.00028030985,0.000015741694,0.00061896903,0.00003160018,0.000103184306,0.000013919024,0.000010301047,0.9953212,0.0019500983,0.0002386681,0.0011212387,0.0002947611],"about_ca_topic_score_codex":0.000019433919,"about_ca_topic_score_gemma":0.0000010732148,"teacher_disagreement_score":0.6119258,"about_ca_system_score_codex":0.00009430966,"about_ca_system_score_gemma":0.00010983307,"threshold_uncertainty_score":0.8701142},"labels":[],"label_agreement":null},{"id":"W2116841966","doi":"10.1109/ccece.2005.1557271","title":"A versatile component integration tool for rapid prototyping in programmable logic","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Component (thermodynamics); Embedded system; Computer architecture; Rapid prototyping; Programmable logic device; Software; System on a chip; VHDL; Field-programmable gate array; Operating system; Engineering","score_opus":0.020446925388013792,"score_gpt":0.26287726999427513,"score_spread":0.24243034460626134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116841966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013678629,0.00004184463,0.99304134,0.00041707675,0.000047590405,0.001330118,3.2152786e-7,0.00055391213,0.0031999082],"genre_scores_gemma":[0.27504689,0.0000032464523,0.7241993,0.00011317131,0.0000221371,0.00038440176,0.000011407985,0.0000041748863,0.00021528582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922377,0.000035392513,0.00022343348,0.00023272798,0.00009230111,0.00019235756],"domain_scores_gemma":[0.9996228,0.000047462523,0.000060222224,0.00018605503,0.00006898532,0.000014448435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032029962,0.00008533056,0.0001033203,0.000111123205,0.000068294175,0.0001388898,0.00026587507,0.00004123826,0.0000053991375],"category_scores_gemma":[0.000019914956,0.00007341009,0.000038256876,0.00025448774,0.000012835337,0.00023455144,0.000054368807,0.000053507403,0.000004487718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040959854,0.00042657228,0.00078574533,0.000051016043,0.000006360782,0.0000033851356,0.00029668742,0.016741663,0.0009836281,0.66514033,0.0066159773,0.30890766],"study_design_scores_gemma":[0.0003705776,0.000116416086,0.00038481463,0.000027668731,8.503492e-7,0.000001773389,0.0000070110177,0.9706612,0.0060715964,0.017088702,0.005138509,0.0001308787],"about_ca_topic_score_codex":0.0000894171,"about_ca_topic_score_gemma":0.000018866924,"teacher_disagreement_score":0.95391953,"about_ca_system_score_codex":0.000051519488,"about_ca_system_score_gemma":0.000029812758,"threshold_uncertainty_score":0.29935765},"labels":[],"label_agreement":null},{"id":"W2116879325","doi":"10.1109/tcad.2009.2034499","title":"Comparison Study of Performance of Parallel Steady State Solver on Different Computer Architectures","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Solver; Multiprocessing; Computer science; Parallel computing; Nonlinear system; Steady state (chemistry); Distributed memory; State (computer science); Shared memory; Computational science; Algorithm; Programming language","score_opus":0.040769243670703025,"score_gpt":0.26979945721154824,"score_spread":0.2290302135408452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116879325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32902288,0.000046125035,0.6697204,0.000010915246,0.00033675955,0.00067923794,0.00000900575,0.00014713813,0.000027495917],"genre_scores_gemma":[0.9848273,0.000033729535,0.015012443,0.000036645837,0.000024277026,0.000019801351,0.000002075352,0.000016320902,0.000027454977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673325,0.0005548503,0.0012584409,0.0005717718,0.00057064404,0.00031106934],"domain_scores_gemma":[0.9978553,0.00036491864,0.00063885516,0.00064668205,0.00037538877,0.000118847376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004509727,0.00041841494,0.0010299338,0.0006170901,0.00014767027,0.00009255664,0.00072575995,0.00012049285,0.0000018960985],"category_scores_gemma":[0.0000026185846,0.00032473454,0.00012490396,0.00049675273,0.00008285773,0.00011968524,0.0000074131613,0.00037774947,0.0000011488321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011411541,0.00186876,0.000104495506,0.00006646222,0.0001290381,0.0000030049948,0.002130329,0.90668046,0.0011578386,0.00019660752,0.00007264498,0.08747623],"study_design_scores_gemma":[0.0012406992,0.011585231,0.0011483384,0.00054510834,0.000027660632,0.000013855779,0.000078456906,0.9667212,0.018293675,0.000046975285,0.0000059516597,0.000292864],"about_ca_topic_score_codex":0.00008737457,"about_ca_topic_score_gemma":0.0000032181804,"teacher_disagreement_score":0.65580434,"about_ca_system_score_codex":0.000050677947,"about_ca_system_score_gemma":0.00006415829,"threshold_uncertainty_score":0.9999205},"labels":[],"label_agreement":null},{"id":"W2117039411","doi":"10.1109/ccece.2007.131","title":"Investigating Cache Energy Efficiency in Multimedia Processors","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Cache algorithms; Computer science; Smart Cache; Cache invalidation; Cache pollution; Cache coloring; Page cache; Parallel computing; Latency (audio); Efficient energy use; CPU cache; Operating system; Telecommunications","score_opus":0.01748968084466255,"score_gpt":0.26604896290079905,"score_spread":0.2485592820561365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117039411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010966657,0.00005549467,0.9700733,0.00017298448,0.00006336174,0.000047312387,4.4660354e-8,0.0005850488,0.018035794],"genre_scores_gemma":[0.57123643,0.000002826107,0.4281363,0.0003717715,0.000016258358,0.0000027172484,5.6545326e-7,0.0000035128694,0.000229595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989706,0.000030236788,0.00025934586,0.00027190603,0.0001814619,0.00028643335],"domain_scores_gemma":[0.9994501,0.0001244434,0.00006698009,0.0002169884,0.000057196954,0.000084317275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058434,0.0000936602,0.00009561045,0.00021166362,0.00006287954,0.000055823424,0.000564297,0.000058183596,0.000003915228],"category_scores_gemma":[0.00015677566,0.00008380304,0.000020113066,0.000857631,0.000035936602,0.00019515473,0.00013946398,0.00009383646,0.000005891655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005533453,0.0005694497,0.043745156,0.000056278037,0.000012956515,0.00007303355,0.010884004,0.080949344,0.0036187535,0.2719945,0.0034775077,0.5846135],"study_design_scores_gemma":[0.0001525628,0.000024875551,0.0020145387,0.000020008014,3.9479858e-7,0.00000442752,0.000022594562,0.9733669,0.02179775,0.002059953,0.00038362393,0.00015236193],"about_ca_topic_score_codex":0.00018635606,"about_ca_topic_score_gemma":0.00007233232,"teacher_disagreement_score":0.89241755,"about_ca_system_score_codex":0.000033113236,"about_ca_system_score_gemma":0.00005588821,"threshold_uncertainty_score":0.34173888},"labels":[],"label_agreement":null},{"id":"W2117374158","doi":"10.1109/ccece.1993.332431","title":"On a methodology for the design and evaluation of a class of application-oriented parallel computer architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Heuristics; Computer science; Class (philosophy); Computation; Representation (politics); Theoretical computer science; Enumeration; Enhanced Data Rates for GSM Evolution; Algorithm; Artificial intelligence; Mathematics","score_opus":0.1182573460937211,"score_gpt":0.3456428474420133,"score_spread":0.2273855013482922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117374158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013170762,0.00012342894,0.99685144,0.00066879095,0.00003103976,0.0007612177,5.4616385e-7,0.00006522631,0.00018125327],"genre_scores_gemma":[0.30299047,0.000009418869,0.6967333,0.00016646416,0.00000887655,0.00007675599,4.6683655e-7,0.000002476962,0.000011784426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00038270067,0.00020438046,0.00019367285,0.00018929665,0.000085133106],"domain_scores_gemma":[0.9971471,0.0021453332,0.00014388571,0.00031177586,0.0002342357,0.000017694965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470115,0.00007017666,0.00013218656,0.00008265089,0.000056522036,0.000010234304,0.00028804666,0.000038235652,0.000004295297],"category_scores_gemma":[0.000119562486,0.00004549717,0.00003585294,0.00016365723,0.000060270548,0.00002158305,0.000057568224,0.000041157105,4.1152467e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001847428,0.000055948007,0.000018355227,0.000009368578,0.00002456,2.0253847e-8,0.0005239117,0.65020484,0.00015874521,0.14316902,0.0011992897,0.20461747],"study_design_scores_gemma":[0.0003450703,0.00020112257,0.00017489375,0.0000057956872,0.000012880982,0.0000019285978,0.0000037402465,0.9735569,0.002468774,0.023055041,0.00012739497,0.00004647039],"about_ca_topic_score_codex":0.000011559496,"about_ca_topic_score_gemma":0.000001417792,"teacher_disagreement_score":0.32335204,"about_ca_system_score_codex":0.0000075213175,"about_ca_system_score_gemma":0.0000135027985,"threshold_uncertainty_score":0.18553208},"labels":[],"label_agreement":null},{"id":"W2117439128","doi":"10.1109/tvlsi.2002.1043339","title":"An ultra-fast instruction set simulator","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Workstation; Host (biology); Instruction set; Interface (matter); Code (set theory); Computer architecture; Set (abstract data type); Parallel computing; Operating system; Embedded system; Programming language","score_opus":0.01833145711488193,"score_gpt":0.2518577246971913,"score_spread":0.23352626758230938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117439128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014643341,0.00005117411,0.97919565,0.00012517383,0.0026076662,0.00044315835,0.000058829377,0.0015644272,0.0013105483],"genre_scores_gemma":[0.9902837,0.000047523532,0.008145599,0.00016338869,0.00016247104,0.00008363212,0.000017757955,0.000031603264,0.0010642881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973848,0.00034762238,0.00064034935,0.00069016364,0.0005306971,0.00040638677],"domain_scores_gemma":[0.9982822,0.0000860688,0.00021346127,0.0009157778,0.00029335436,0.00020917006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040959186,0.00033521518,0.00032495474,0.0004533722,0.0005994764,0.0005410674,0.0006633533,0.00025737972,0.00008413433],"category_scores_gemma":[0.000008228824,0.0003202374,0.00017152405,0.0008008627,0.00005027421,0.0015365629,0.000001824986,0.00042027966,0.00020762414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034855395,0.0009103249,0.000059053094,0.00004924928,0.000066618326,0.000009410302,0.0043877955,0.9475794,0.0046171444,0.0021894532,0.0030317032,0.03706503],"study_design_scores_gemma":[0.0005501508,0.00025716823,0.000021246613,0.00009591504,0.000013359297,0.000060671853,0.00031256353,0.9677834,0.028558435,0.000049289014,0.0019425189,0.00035529124],"about_ca_topic_score_codex":0.00007676925,"about_ca_topic_score_gemma":0.00005545286,"teacher_disagreement_score":0.9756404,"about_ca_system_score_codex":0.00019333547,"about_ca_system_score_gemma":0.000034037905,"threshold_uncertainty_score":0.99992496},"labels":[],"label_agreement":null},{"id":"W2117576153","doi":"10.1145/1168857.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Optimizing compiler; Abstract interpretation; Compiler; Correctness; Probabilistic logic; Test suite; Theoretical computer science; Algorithm; Static analysis; Programming language; Parallel computing; Test case; Artificial intelligence; Machine learning","score_opus":0.015234514844012049,"score_gpt":0.2610020047553765,"score_spread":0.24576748991136443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117576153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002003604,0.000009448462,0.9808082,0.00053445494,0.000028599608,0.00022594455,0.0000023547245,0.00054247066,0.017648192],"genre_scores_gemma":[0.28204557,4.896138e-7,0.715351,0.00011152418,0.00002239332,0.000031161144,0.000017569098,0.0000036628944,0.0024166212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992858,0.000024845662,0.0001906329,0.00026637525,0.0000875611,0.00014476862],"domain_scores_gemma":[0.99935144,0.00008857208,0.0000624787,0.00029281035,0.00017741894,0.000027276526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116221236,0.000083212726,0.00012876814,0.00021737059,0.00010306713,0.00013070555,0.00031576963,0.00002888659,0.000025436426],"category_scores_gemma":[0.000032246397,0.00007199465,0.00012971382,0.0009116689,0.000020867505,0.00015229417,0.000068794536,0.000026643658,0.0000054646607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010943015,0.00003853671,0.0003026025,0.0000018500698,0.000037200472,2.9801527e-7,0.00003337672,0.6647004,0.0000037717352,0.33212888,0.0026385956,0.00011338636],"study_design_scores_gemma":[0.00013727657,0.000023377488,0.0010411113,0.000001954819,0.000033000495,6.6937037e-7,0.0000018505715,0.9703854,0.00022997786,0.027489804,0.00055245624,0.000103130595],"about_ca_topic_score_codex":0.00003706313,"about_ca_topic_score_gemma":0.00002184403,"teacher_disagreement_score":0.30568498,"about_ca_system_score_codex":0.000027332988,"about_ca_system_score_gemma":0.00002186075,"threshold_uncertainty_score":0.29358566},"labels":[],"label_agreement":null},{"id":"W2117650386","doi":"10.1109/71.932714","title":"Generalized communicators in the message passing interface","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message passing; Message Passing Interface; Interface (matter); Distributed computing; Construct (python library); Process (computing); Parallel computing; Programming language","score_opus":0.027864851378327962,"score_gpt":0.27476682561847154,"score_spread":0.2469019742401436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117650386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009363455,0.00052025483,0.9879305,0.0009769404,0.00021068906,0.00026160674,0.000014126534,0.00027472604,0.0004476988],"genre_scores_gemma":[0.9937142,0.00035580766,0.0055631674,0.00014894857,0.000013149725,0.0000733799,0.0000067512647,0.000007365814,0.000117234515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984589,0.00044991338,0.00035113495,0.00028073034,0.00020626429,0.0002530271],"domain_scores_gemma":[0.9989971,0.00017500101,0.00009287791,0.0006287316,0.00004000191,0.000066286644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935055,0.0001744113,0.00022138325,0.00012451,0.00034373172,0.0003302831,0.0007583759,0.000091744376,0.0000030025615],"category_scores_gemma":[0.000004371909,0.00012851493,0.00006103974,0.00055365404,0.000060395956,0.00021966141,0.000007076142,0.00027422857,0.0000075791027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003024626,0.00020910884,0.00014853427,0.000014885163,0.000024440333,0.000021191016,0.0008801584,0.9903515,0.000049416987,0.004328485,0.0013252045,0.002616822],"study_design_scores_gemma":[0.00097256433,0.000103053404,0.00036903794,0.00011074407,0.000011982894,0.0001656683,0.00040882127,0.9890052,0.00010221792,0.00047005527,0.00796024,0.00032039438],"about_ca_topic_score_codex":0.0002407289,"about_ca_topic_score_gemma":0.000030625557,"teacher_disagreement_score":0.98435074,"about_ca_system_score_codex":0.000046146564,"about_ca_system_score_gemma":0.000023287253,"threshold_uncertainty_score":0.52406865},"labels":[],"label_agreement":null},{"id":"W2117895458","doi":"10.1109/pcee.2000.873593","title":"C++2MPI: a software tool for automatically generating MPI datatypes from C++ classes","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Université du Québec en Outaouais","funders":"","keywords":"Computer science; Porting; Programming language; Message passing; Call graph; Graph; Software; Message Passing Interface; Class (philosophy); Set (abstract data type); Interface (matter); Theoretical computer science; Parallel computing; Artificial intelligence","score_opus":0.03368586381263118,"score_gpt":0.26729620296721723,"score_spread":0.23361033915458607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117895458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018668629,0.000108807224,0.99407154,0.0005653035,0.00012320104,0.00019667578,0.0000122437,0.0020948465,0.0009605046],"genre_scores_gemma":[0.022532765,0.000013937068,0.9751653,0.0012496887,0.00010406818,0.000035844976,0.000020598327,0.000011647002,0.0008661254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988665,0.00004254914,0.00028584566,0.0003879573,0.00017239168,0.00024477925],"domain_scores_gemma":[0.9987996,0.00043149496,0.000079106954,0.00052536593,0.00010659561,0.000057816822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015317248,0.00013740668,0.00016444648,0.000059065664,0.00019750437,0.00036296571,0.0007404955,0.00006594193,0.000106671956],"category_scores_gemma":[0.00032736218,0.00011964116,0.0000607033,0.00016961065,0.000021481621,0.00041434614,0.00021044996,0.00006755687,0.00005390163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069924586,0.0003350043,0.0018007798,0.00006412795,0.000104798324,0.000014403745,0.001231538,0.019851962,0.0010308013,0.069744445,0.41733003,0.48848513],"study_design_scores_gemma":[0.00016950375,0.000048358037,0.00015143267,0.000017480384,0.00000453024,0.0000025158342,0.00000315832,0.9903628,0.0012232609,0.0033642836,0.00446148,0.00019120095],"about_ca_topic_score_codex":0.000020166626,"about_ca_topic_score_gemma":0.0000051547568,"teacher_disagreement_score":0.97051084,"about_ca_system_score_codex":0.00001940739,"about_ca_system_score_gemma":0.00002357538,"threshold_uncertainty_score":0.4878825},"labels":[],"label_agreement":null},{"id":"W2118043730","doi":"10.1109/hpcs.2005.49","title":"Software Engineering Issues for Small-Scale Parallelism","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Parallelism (grammar); Parallel programming model; Programming paradigm; Multiprocessing; Scale (ratio); Software; Task parallelism; Simple (philosophy); Distributed computing; Programming language","score_opus":0.015405075108193606,"score_gpt":0.24992952866241405,"score_spread":0.23452445355422044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118043730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005819335,0.00020955331,0.9948111,0.001659233,0.00009024723,0.00014620117,5.9423087e-7,0.0019177079,0.0005834055],"genre_scores_gemma":[0.012577333,0.000023327759,0.9837622,0.0004935817,0.0001538325,0.000032283006,0.000002548429,0.00000977418,0.0029451184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929994,0.000008243239,0.0001547729,0.00023977556,0.000080570375,0.00021667285],"domain_scores_gemma":[0.9994754,0.00007062051,0.000031241052,0.00029514267,0.00006911862,0.00005847485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014476142,0.00010343965,0.00010990248,0.00006883373,0.00007416461,0.00010961062,0.0005241697,0.00005082076,0.000010039262],"category_scores_gemma":[0.000048279857,0.00009643675,0.00005873754,0.00011871856,0.000007044203,0.00019581083,0.00011011017,0.000050964965,0.000022302282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009182167,0.00018145179,0.00065779296,0.00007078395,0.000043336797,0.0000028963552,0.0015042648,0.4871083,0.00040265996,0.16278137,0.1131624,0.23407555],"study_design_scores_gemma":[0.00015778487,0.00003426598,0.00014514818,0.000010899226,0.0000016828645,0.0000042000675,0.0000020933185,0.85594785,0.006159507,0.0005947334,0.13676041,0.00018142255],"about_ca_topic_score_codex":0.0000074394156,"about_ca_topic_score_gemma":0.0000041688972,"teacher_disagreement_score":0.36883953,"about_ca_system_score_codex":0.000018661765,"about_ca_system_score_gemma":0.0000148857725,"threshold_uncertainty_score":0.39325765},"labels":[],"label_agreement":null},{"id":"W2118427059","doi":"10.1186/s13673-014-0016-8","title":"An optimizing pipeline stall reduction algorithm for power and performance on multi-core CPUs","year":2015,"lang":"en","type":"article","venue":"Human-centric Computing and Information Sciences","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Out-of-order execution; Parallel computing; Pipeline (software); Instruction-level parallelism; Scheduling (production processes); Instruction scheduling; Architecture; Stall (fluid mechanics); Instruction set; Parallelism (grammar); Dynamic priority scheduling; Operating system","score_opus":0.06071211767180993,"score_gpt":0.32572893000299913,"score_spread":0.2650168123311892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118427059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08332401,0.00008775049,0.9149452,0.00010025452,0.00027912422,0.00024775846,0.0000018399116,0.00034825297,0.0006658138],"genre_scores_gemma":[0.6094388,0.00003295806,0.39026415,0.00017979361,0.000048054997,0.0000038644935,0.000009096464,0.0000031597826,0.000020124464],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986065,0.000040439172,0.00040486827,0.00031592086,0.0003372494,0.0002950254],"domain_scores_gemma":[0.9990144,0.00005565114,0.00027071362,0.000199406,0.00029697202,0.00016285805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014158442,0.0001611313,0.00015965803,0.00038158233,0.0008838077,0.0007048761,0.00037795174,0.00005822238,8.9277205e-7],"category_scores_gemma":[0.000058393136,0.00014109751,0.000024714562,0.0004944114,0.00013422413,0.0029120583,0.00014523826,0.000106408595,0.0000029690834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013291692,0.00011623679,0.0004071667,0.000030954096,0.000006332588,4.4660206e-7,0.0075602517,0.08902441,0.000022954337,0.008408214,0.0013870649,0.89302266],"study_design_scores_gemma":[0.0006728184,0.0006258729,0.0006318862,0.000039644445,0.0000025931051,0.000028827528,0.000380415,0.9960017,0.0001618716,0.00015509187,0.0011028204,0.0001964604],"about_ca_topic_score_codex":0.000015282269,"about_ca_topic_score_gemma":2.0309648e-7,"teacher_disagreement_score":0.9069773,"about_ca_system_score_codex":0.000041129613,"about_ca_system_score_gemma":0.00007861972,"threshold_uncertainty_score":0.67976236},"labels":[],"label_agreement":null},{"id":"W2118547657","doi":"10.5555/776261.776288","title":"Design, implementation and evaluation of adaptive recompilation with on-stack replacement","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Exploit; Compiler; Stack (abstract data type); Code (set theory); Compile time; Programming language; Call stack; Code generation; Mechanism (biology); Simple (philosophy); Program optimization; Parallel computing; Computer architecture; Operating system; Key (lock)","score_opus":0.07760732763427,"score_gpt":0.33954726650570655,"score_spread":0.2619399388714365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118547657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010318426,0.000015441634,0.9838089,0.000066045504,0.000020429252,0.00038073838,2.2216179e-7,0.000074803706,0.005315026],"genre_scores_gemma":[0.57522565,0.0000043456334,0.42469072,0.000038477152,0.0000016553766,0.000013678636,0.0000015002494,0.0000020263226,0.000021952104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.0002633053,0.0001557323,0.00019588455,0.000306097,0.00007511545],"domain_scores_gemma":[0.99936074,0.00006343882,0.00012278382,0.00017690567,0.00025416238,0.000021959346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012195971,0.00006563052,0.00006873317,0.00008224087,0.00005436118,0.000028322613,0.00006936704,0.000017431123,0.00002678942],"category_scores_gemma":[0.000012060302,0.000052838204,0.000007679647,0.00017080788,0.000012129991,0.00017074564,0.000014488719,0.000026171565,0.0000012775912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017554122,0.00021024414,0.0025871492,0.00001390574,0.00008145146,5.941519e-7,0.0022606319,0.40019557,0.00053137133,0.42774513,0.0032603678,0.16293803],"study_design_scores_gemma":[0.0010148435,0.0011664341,0.0015410917,0.00002087566,0.000014063488,0.0000036493507,0.0001793423,0.93174875,0.05890143,0.005198227,0.00008030061,0.000131026],"about_ca_topic_score_codex":0.000007389983,"about_ca_topic_score_gemma":0.0000033086321,"teacher_disagreement_score":0.5649072,"about_ca_system_score_codex":0.00004327898,"about_ca_system_score_gemma":0.00007118678,"threshold_uncertainty_score":0.21546794},"labels":[],"label_agreement":null},{"id":"W2118788272","doi":"10.1145/1806651.1806670","title":"A graph theoretic approach to cache-conscious placement of data for direct mapped caches","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache pollution; Cache algorithms; Parallel computing; Cache coloring; Cache invalidation; Bottleneck; Smart Cache; Cache-oblivious algorithm; Page cache; CPU cache; Optimizing compiler; Compiler; Operating system; Embedded system","score_opus":0.03767267186299324,"score_gpt":0.287141914000846,"score_spread":0.24946924213785276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118788272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013298001,0.000018143732,0.9746685,0.00030794597,0.00010382624,0.00049581693,0.000016578098,0.00035674093,0.022702666],"genre_scores_gemma":[0.3793808,0.000002127262,0.6201206,0.0001419732,0.000017167518,0.00003555017,0.000017667819,0.000005855018,0.00027831135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988814,0.000039392013,0.00023036067,0.00047310122,0.00016354608,0.00021220956],"domain_scores_gemma":[0.99819374,0.0001526267,0.00007875843,0.0013975457,0.000092876566,0.0000844473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008177249,0.00011947205,0.00018221443,0.00014134662,0.00008016864,0.000069142894,0.001896794,0.000054011918,0.000005159099],"category_scores_gemma":[0.00011017896,0.00009686276,0.00004385065,0.00029602446,0.000058052417,0.0001560706,0.0006188376,0.000080567595,0.000002757735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006747534,0.00089127896,0.0005421712,0.00017034485,0.000118215044,0.0000011526007,0.002526285,0.0103296535,0.0051691816,0.8790606,0.07468022,0.02644343],"study_design_scores_gemma":[0.000495649,0.00017872482,0.00009502047,0.00001526565,0.000016666909,0.000008148641,0.000050194314,0.96684235,0.017556494,0.008933183,0.005451491,0.00035683773],"about_ca_topic_score_codex":0.000043669905,"about_ca_topic_score_gemma":0.0000141448345,"teacher_disagreement_score":0.9565127,"about_ca_system_score_codex":0.000006518573,"about_ca_system_score_gemma":0.000055302116,"threshold_uncertainty_score":0.39499485},"labels":[],"label_agreement":null},{"id":"W2118995101","doi":"10.1109/ccece.1999.807245","title":"High-speed image composition with enhanced multiplier structures","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada); University of Alberta","funders":"","keywords":"Adder; Computer science; Multiplier (economics); Carry-save adder; Subtraction; Matrix multiplication; Arithmetic; Carry (investment); Computer hardware; Parallel computing; Mathematics; Latency (audio); Telecommunications","score_opus":0.006934255719876375,"score_gpt":0.23146036072001694,"score_spread":0.22452610500014056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118995101","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014771915,0.000009063656,0.96974254,0.000103458326,0.000072963805,0.000115583454,3.7144383e-7,0.0007173616,0.014466735],"genre_scores_gemma":[0.4954098,0.0000016624026,0.50426453,0.00015510492,0.0000072100975,0.0000017564985,0.0000018757199,0.000003882633,0.00015417124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992099,0.00005958072,0.00012793325,0.00027311256,0.00015870943,0.00017079705],"domain_scores_gemma":[0.99941695,0.000032024298,0.000059847785,0.00033097292,0.0001065127,0.000053669344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008819191,0.000116487834,0.0001131737,0.00006882175,0.000119801785,0.00014390772,0.000293729,0.00003908601,0.00004139112],"category_scores_gemma":[0.000009003212,0.00008696011,0.00002282954,0.00022680422,0.00003466258,0.00026815935,0.00004061447,0.00007513734,0.00001817023],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025310039,0.00012536337,0.00009582298,0.000013197134,0.000036002497,0.000013569723,0.0005150513,0.043230515,0.105142266,0.84290606,0.0032547833,0.0046420675],"study_design_scores_gemma":[0.00070257473,0.00012254981,0.00066826417,0.000012959909,0.0000039239453,0.000021906902,0.00001021065,0.06683503,0.9216946,0.009322044,0.00029168028,0.00031428176],"about_ca_topic_score_codex":0.000014427503,"about_ca_topic_score_gemma":0.0000014518835,"teacher_disagreement_score":0.833584,"about_ca_system_score_codex":0.000019819468,"about_ca_system_score_gemma":0.000024797548,"threshold_uncertainty_score":0.35461304},"labels":[],"label_agreement":null},{"id":"W2119151382","doi":"10.1145/949305.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Java; Suite; Just-in-time compilation; Programming language; Benchmark (surveying); Metric (unit); Set (abstract data type); Compiler","score_opus":0.018516748506078737,"score_gpt":0.27847818312668177,"score_spread":0.259961434620603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119151382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006841228,0.00006608115,0.9726428,0.00016817817,0.00011812823,0.00009689954,2.237555e-7,0.000495462,0.026343832],"genre_scores_gemma":[0.12207042,0.000009699705,0.8752333,0.0002979922,0.0000025724537,0.000008160891,6.1498497e-7,0.0000032873695,0.002373944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995322,0.000019853802,0.00009348746,0.00015757438,0.000071916045,0.00012496632],"domain_scores_gemma":[0.9995602,0.00008412942,0.000027704149,0.0002276785,0.00006803074,0.000032250173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023327173,0.000051027742,0.000059873375,0.00010161606,0.000065577144,0.00006545169,0.00030159383,0.00002770556,0.0000065518534],"category_scores_gemma":[0.00012293861,0.000044779215,0.00003457611,0.00037912704,0.00000652162,0.00010115237,0.000030272053,0.00002602367,0.000010847923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1762805e-7,0.000032041502,0.00006969669,0.0000048393786,0.000005216479,5.0486466e-7,0.00004178251,0.0023960946,0.000038651095,0.9686607,0.011305782,0.017444182],"study_design_scores_gemma":[0.0001250482,0.0000410986,0.000026956388,0.0000016564426,0.0000011407698,0.0000038251337,0.0000024386568,0.9362318,0.0024123723,0.022001598,0.039053056,0.00009902086],"about_ca_topic_score_codex":0.0000014002346,"about_ca_topic_score_gemma":5.3458484e-7,"teacher_disagreement_score":0.9466591,"about_ca_system_score_codex":0.00001670859,"about_ca_system_score_gemma":0.000025508367,"threshold_uncertainty_score":0.18260434},"labels":[],"label_agreement":null},{"id":"W2119339302","doi":"10.1007/s00146-006-0033-x","title":"Personal technologies: memory and intimacy through physical computing","year":2006,"lang":"en","type":"article","venue":"AI & Society","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Context (archaeology); Computer science; Multimedia; Physical computing; The arts; Performing arts; Human–computer interaction; Personal computer; Visual arts; Art","score_opus":0.01057860855740751,"score_gpt":0.2664323426209216,"score_spread":0.2558537340635141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119339302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043974333,0.0003210443,0.94976145,0.0023041642,0.000057637357,0.00008391532,6.9628425e-7,0.0020012069,0.0014955288],"genre_scores_gemma":[0.7075827,0.000027166454,0.2916139,0.0006327115,0.00007389376,0.0000025305953,0.0000018047941,0.000006140577,0.000059138427],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990568,0.000026802409,0.00013643311,0.0003633963,0.00017186315,0.0002447006],"domain_scores_gemma":[0.99953616,0.00008119886,0.00006885121,0.00023301295,0.00006258823,0.000018169836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014975987,0.00013491814,0.00015533241,0.00001604892,0.00027121,0.00014456197,0.00040833047,0.00008048439,9.5159373e-7],"category_scores_gemma":[0.0000131687975,0.0001249306,0.00011077523,0.00028749334,0.00016232229,0.00029710948,0.0004420675,0.00022958453,0.000005630919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007363957,0.00085255137,0.005584601,0.0001786723,0.00016367095,0.000026261849,0.049044333,0.007641902,0.0030373826,0.23089764,0.407009,0.29555663],"study_design_scores_gemma":[0.00021455082,0.000037689064,0.0006335391,0.0000206581,0.000004816651,0.00001371185,0.00032064284,0.9737796,0.0018586628,0.020892605,0.0020055172,0.0002180032],"about_ca_topic_score_codex":0.00005824609,"about_ca_topic_score_gemma":4.8710115e-7,"teacher_disagreement_score":0.9661377,"about_ca_system_score_codex":0.00003542158,"about_ca_system_score_gemma":0.000029989176,"threshold_uncertainty_score":0.50945216},"labels":[],"label_agreement":null},{"id":"W2119361011","doi":"10.1145/2628071.2671420","title":"An Event-Based Language for Dynamic Binary Translation Frame Works","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Binary translation; Frame (networking); Translation (biology); Binary number; Event (particle physics); Natural language processing; Programming language; Artificial intelligence; Arithmetic; Mathematics; Telecommunications; Physics; Astrophysics","score_opus":0.010300700938777272,"score_gpt":0.29080925151617265,"score_spread":0.2805085505773954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119361011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005097217,0.0000439514,0.9928052,0.0005534879,0.000070631846,0.00015949037,6.435843e-7,0.00090762763,0.00036178253],"genre_scores_gemma":[0.55013883,6.731467e-7,0.4494492,0.00032447622,0.000012771209,0.0000105367335,0.000013594339,0.000004460967,0.000045452103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993664,0.00006110168,0.00012522169,0.00022125075,0.000088921,0.00013711999],"domain_scores_gemma":[0.99943334,0.00009758497,0.00004172587,0.00034209227,0.00003801324,0.000047264686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027969998,0.00007787008,0.00008026395,0.00008233834,0.00008145664,0.00013196204,0.00037866415,0.000064080225,0.000007208021],"category_scores_gemma":[0.000012818315,0.00007125025,0.0000459179,0.00015341825,0.000010779831,0.00025016948,0.000012187919,0.000053012776,0.000004770603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015403373,0.00013806052,0.00006614568,0.000019335394,0.000005332412,6.989629e-7,0.00047769264,0.49519214,0.0031428356,0.012564915,0.0004781479,0.48789927],"study_design_scores_gemma":[0.00023448508,0.0001561438,0.0001015642,0.0000150751985,0.0000017340717,4.0514624e-7,0.0000082715505,0.9968567,0.0013600582,0.0008523077,0.00030698045,0.00010630739],"about_ca_topic_score_codex":0.000007345357,"about_ca_topic_score_gemma":0.0000047166304,"teacher_disagreement_score":0.5450416,"about_ca_system_score_codex":0.000012440606,"about_ca_system_score_gemma":0.000020013458,"threshold_uncertainty_score":0.29055008},"labels":[],"label_agreement":null},{"id":"W2119485054","doi":"10.1109/tii.2011.2166769","title":"Expressing Coarse-Grain Dependencies Among Tasks in Shared Memory Programs","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Polytechnique Montréal","keywords":"Computer science; Random access memory; Computer hardware","score_opus":0.09529407755967091,"score_gpt":0.2632722615069435,"score_spread":0.1679781839472726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119485054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033915248,0.0000038694757,0.9598526,0.000023974922,0.0005417612,0.00043069987,0.0000050435533,0.0006369721,0.0045898585],"genre_scores_gemma":[0.84290916,0.000004708469,0.15666811,0.00008067924,0.000028543915,0.00007258639,0.0000034752252,0.000012022553,0.00022070348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983436,0.00009058496,0.00071248517,0.00017160023,0.00032611983,0.0003556341],"domain_scores_gemma":[0.9990496,0.000052580406,0.00023429081,0.00046718397,0.0000812063,0.000115133786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004734168,0.00020952888,0.00022939903,0.00040836638,0.00020933368,0.00025952203,0.00074796774,0.00027599395,0.000028561748],"category_scores_gemma":[0.00001718008,0.00020647436,0.000090402275,0.00067692995,0.00009462697,0.0014275151,0.0000101166115,0.0006046962,0.000021507047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017277598,0.0014686777,0.0005225731,0.000095293544,0.000129431,0.000047426245,0.0800652,0.13852824,0.00016811887,0.0014377134,0.0032962656,0.7740683],"study_design_scores_gemma":[0.0020052553,0.00042014776,0.000075077754,0.00053107255,0.000019389097,0.000019760915,0.0017133577,0.94491744,0.048579656,0.00061299105,0.00036367224,0.00074218924],"about_ca_topic_score_codex":0.0001808195,"about_ca_topic_score_gemma":0.000037632642,"teacher_disagreement_score":0.80899394,"about_ca_system_score_codex":0.0000891216,"about_ca_system_score_gemma":0.00012494593,"threshold_uncertainty_score":0.841978},"labels":[],"label_agreement":null},{"id":"W2119539611","doi":"10.1145/1108768.1108809","title":"SableSpMT","year":2005,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multithreading; Computer science; Java; Speculative multithreading; Multiprocessing; Operating system; Speculative execution; strictfp; Set (abstract data type); Context (archaeology); Instruction set; Software; Real time Java; Embedded system; Programming language; Thread (computing)","score_opus":0.012749455996259379,"score_gpt":0.23212316330720978,"score_spread":0.2193737073109504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119539611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007842677,0.0003791763,0.9866361,0.0006916386,0.00017959597,0.0000774477,0.000001415687,0.004169472,0.000022459568],"genre_scores_gemma":[0.45045528,0.000013322085,0.5491291,0.00021149524,0.000104272905,0.000008374361,0.0000028313677,0.00001414229,0.00006114837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989308,0.000014232182,0.00021062241,0.0003247567,0.00019259886,0.0003269937],"domain_scores_gemma":[0.9910405,0.007863105,0.00005115605,0.00087060966,0.000071933355,0.00010267004],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00017553494,0.00018393909,0.00015825967,0.00014665138,0.00008953528,0.00013370214,0.0012784095,0.00008273951,0.000013649148],"category_scores_gemma":[0.02571788,0.00019085211,0.00006578366,0.00035957881,0.000012557877,0.00041911678,0.00039742063,0.00015710619,0.00008685918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006697371,0.00020826345,0.084197335,0.00011805141,0.000074684394,0.000033965112,0.0012241625,0.5474252,0.0018631922,0.023929885,0.019757692,0.32116085],"study_design_scores_gemma":[0.0014764537,0.00032326602,0.08132547,0.00042651477,0.000033945045,0.00019921029,0.000005800974,0.5196401,0.106575616,0.001059768,0.28545028,0.0034835502],"about_ca_topic_score_codex":0.000006240761,"about_ca_topic_score_gemma":6.420577e-7,"teacher_disagreement_score":0.4426126,"about_ca_system_score_codex":0.00004775295,"about_ca_system_score_gemma":0.00003113625,"threshold_uncertainty_score":0.98248893},"labels":[],"label_agreement":null},{"id":"W2119741965","doi":"10.1109/rsp.2005.52","title":"Thread-Level Parallel Execution in Co-Designed Virtual Machines","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtual machine; Executable; Thread (computing); Virtual finite-state machine; Operating system; Software; Temporal isolation among virtual machines; Scheduling (production processes); Java; Hypervisor; Embedded system; Virtualization; Cloud computing","score_opus":0.02215213730619211,"score_gpt":0.2703684141750117,"score_spread":0.24821627686881956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119741965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044204616,0.000042641102,0.97126925,0.00044331397,0.00006566362,0.00013047668,9.736914e-7,0.00075036543,0.022876857],"genre_scores_gemma":[0.49599338,0.000009554387,0.5012054,0.00024086745,0.00004086535,0.000013170631,0.000011723373,0.000006758383,0.0024782866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988939,0.00008090043,0.00027787517,0.00031819244,0.00019205842,0.00023704831],"domain_scores_gemma":[0.99947345,0.00006685167,0.00006716029,0.00031096797,0.00004614874,0.000035416655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922094,0.00013650817,0.00014553082,0.0001834432,0.00008348971,0.00011566203,0.00051915745,0.00007461155,0.00001825],"category_scores_gemma":[0.000014822015,0.00012148222,0.00004186906,0.00035177948,0.000029695115,0.00031710524,0.00008902906,0.00008984819,0.000042979475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013036318,0.00019920594,0.0049774474,0.000004522794,0.0000042959564,0.000015465032,0.00013791448,0.06027564,0.00057017035,0.8990509,0.023817867,0.01093356],"study_design_scores_gemma":[0.0009963457,0.00017546414,0.032559887,0.000029318087,0.0000024138312,0.0000209054,0.000011065756,0.8614691,0.0049588312,0.09788231,0.0013410295,0.0005533672],"about_ca_topic_score_codex":0.00044327724,"about_ca_topic_score_gemma":0.00007058162,"teacher_disagreement_score":0.8011934,"about_ca_system_score_codex":0.000040260144,"about_ca_system_score_gemma":0.00003790071,"threshold_uncertainty_score":0.49539012},"labels":[],"label_agreement":null},{"id":"W2119857683","doi":"10.1109/async.2002.1000295","title":"An event spacing experiment","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia","keywords":"Extension (predicate logic); Computer science; Bursting; Bounded function; Event (particle physics); Chip; Algorithm; Theoretical computer science; Programming language; Mathematics; Physics","score_opus":0.015039487094180412,"score_gpt":0.2928939297275045,"score_spread":0.2778544426333241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119857683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005678648,0.00002704642,0.98751426,0.0004182875,0.000070603906,0.0000479626,3.0371496e-8,0.00087049935,0.005372652],"genre_scores_gemma":[0.5734997,0.000001978396,0.42621043,0.00021400816,0.000013152736,0.0000026957252,2.6729725e-7,0.0000017847576,0.000055969933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949634,0.000014953523,0.00008999282,0.00017830782,0.000105018466,0.000115357056],"domain_scores_gemma":[0.99956393,0.000004334184,0.000022406386,0.0003263478,0.0000242663,0.000058712936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010186738,0.00005531712,0.000049799623,0.00004301954,0.00006825381,0.00008522438,0.00035412473,0.00001867534,0.000008753557],"category_scores_gemma":[0.0000030387619,0.000048102756,0.00002051982,0.00010877992,0.0000073177466,0.00023322161,0.00006584061,0.000030893174,0.00002227872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012575274,0.00020123374,0.000062775805,0.0000021705273,0.0000050469393,0.000008531863,0.0017120963,0.42807254,0.0042550885,0.5515983,0.00054031564,0.013540624],"study_design_scores_gemma":[0.00042894922,0.00028810397,0.00028984487,0.00002318035,0.0000011313797,0.00002004279,0.00005654519,0.537554,0.43814957,0.021407172,0.0014564696,0.00032495227],"about_ca_topic_score_codex":0.00003717099,"about_ca_topic_score_gemma":0.0000011989997,"teacher_disagreement_score":0.5678211,"about_ca_system_score_codex":0.000037883583,"about_ca_system_score_gemma":0.00002775668,"threshold_uncertainty_score":0.19615734},"labels":[],"label_agreement":null},{"id":"W2119961089","doi":"10.1109/fpga.1995.477426","title":"FPGA-based transformable computers for fast digital signal processing","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Coprocessor; Microprocessor; Field-programmable gate array; Convolution (computer science); Computer hardware; Parallel computing; Digital signal processing; Computation; Embedded system; Algorithm; Artificial neural network; Artificial intelligence","score_opus":0.021970332778356666,"score_gpt":0.23491989328465307,"score_spread":0.2129495605062964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119961089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006970461,0.000040916482,0.9871757,0.0007428266,0.000044891403,0.00020176423,0.0000024054302,0.0010779052,0.010643896],"genre_scores_gemma":[0.5594711,0.0000011750998,0.43935606,0.0005254117,0.000026794372,0.000013797191,0.0000042200472,0.0000074869286,0.00059397786],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990911,0.000009905828,0.00019857677,0.0002707793,0.00015661266,0.00027302408],"domain_scores_gemma":[0.9995516,0.00006066035,0.000052565287,0.00016625845,0.000093220246,0.00007572965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009409574,0.00012579239,0.00012472284,0.00009800138,0.00019114075,0.0005344873,0.0005188183,0.000043017357,0.000018143846],"category_scores_gemma":[0.000003862854,0.000112795446,0.00007803347,0.00025413328,0.000028134189,0.0007443196,0.000032762004,0.000057675024,0.000014056134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051672578,0.00012611797,0.000026373978,0.00004085887,0.000006504688,0.0000019734237,0.00031071002,0.07332824,0.000025448915,0.002308764,0.011153168,0.9126667],"study_design_scores_gemma":[0.0003725325,0.000104754625,0.0000039201286,0.000022850376,0.0000016278132,0.000004093182,0.0000040173695,0.98867327,0.0021461782,0.00036051686,0.008137453,0.00016881152],"about_ca_topic_score_codex":0.000001341783,"about_ca_topic_score_gemma":2.4716e-7,"teacher_disagreement_score":0.915345,"about_ca_system_score_codex":0.000021752337,"about_ca_system_score_gemma":0.000026786918,"threshold_uncertainty_score":0.5154073},"labels":[],"label_agreement":null},{"id":"W2119991158","doi":"10.1109/asic.1997.617014","title":"Pipelined adaptive filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada)","funders":"","keywords":"Computer science; Adaptive filter; Equalization (audio); Channel (broadcasting); Adaptive equalizer; Point (geometry); Computer architecture; Algorithm; Telecommunications","score_opus":0.03294143694257283,"score_gpt":0.23406629780530214,"score_spread":0.2011248608627293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119991158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036210615,0.000039054332,0.90265507,0.0011333295,0.000065691354,0.000039115876,1.288626e-7,0.0008802032,0.09515117],"genre_scores_gemma":[0.3211018,0.000013715369,0.67234737,0.0008794767,0.000021743572,0.0000030022904,2.4485817e-7,0.0000028556583,0.00562976],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994943,0.000023228196,0.00009482578,0.00016947497,0.00009586712,0.00012231756],"domain_scores_gemma":[0.9996025,0.00003127544,0.000026893304,0.00025569054,0.000040741998,0.000042915275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006565381,0.000059656144,0.000058913552,0.000055019605,0.00005646529,0.000056507808,0.00041984482,0.00002386002,0.00013133438],"category_scores_gemma":[0.000014045606,0.00005132449,0.000028623668,0.00019692563,0.00001298074,0.00017141143,0.000095071155,0.000044830613,0.00019363896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023560808,0.00011947288,0.00007615283,0.000002689029,0.0000147436895,0.000014960538,0.00083991373,0.008160096,0.000092546,0.25291157,0.5972172,0.14054829],"study_design_scores_gemma":[0.00007443103,0.000037802445,0.000030143312,0.0000028498341,4.9450693e-7,0.000003929839,0.0000030638603,0.99146837,0.0009446035,0.0012677369,0.006083585,0.000082976025],"about_ca_topic_score_codex":0.000006379986,"about_ca_topic_score_gemma":4.276701e-7,"teacher_disagreement_score":0.9833083,"about_ca_system_score_codex":0.000010510513,"about_ca_system_score_gemma":0.0000036599376,"threshold_uncertainty_score":0.24889018},"labels":[],"label_agreement":null},{"id":"W2120128957","doi":"10.1109/ipps.1993.262775","title":"Transformation of Doacross loops on distributed memory systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Compiler; Overhead (engineering); Speedup; Loop fusion; Partition (number theory); Transformation (genetics); Loop (graph theory); Parallelism (grammar); Distributed memory; Compile time; Exploit; Loop fission; Nested loop join; Shared memory; Programming language","score_opus":0.022634632740826093,"score_gpt":0.24327630048628282,"score_spread":0.22064166774545674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120128957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024661655,0.00005287841,0.9709489,0.00022321979,0.00011046802,0.00011470067,0.0000043548785,0.0004423369,0.025636977],"genre_scores_gemma":[0.98573995,0.000018504013,0.013674753,0.000066813554,0.000012314603,0.000005222327,0.0000052059168,0.0000028526185,0.0004743611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993229,0.000038850412,0.00022584671,0.0001270664,0.00017086396,0.00011446115],"domain_scores_gemma":[0.99951625,0.000036768062,0.00007216376,0.000267228,0.00007396138,0.000033648856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015269853,0.00006963969,0.000106599655,0.00006446061,0.000058723836,0.000063537766,0.00033503526,0.00004098071,0.000013568944],"category_scores_gemma":[0.000010442902,0.000058089794,0.00003529932,0.00025974613,0.00001836975,0.00020883363,0.00002276499,0.00004955551,0.000026466894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012137347,0.0004771649,0.00011232951,0.00015572266,0.00003863893,0.000006138596,0.0036899631,0.4964933,0.00047990945,0.41198114,0.037669823,0.04888374],"study_design_scores_gemma":[0.00016422987,0.00007064044,0.00006984048,0.000023324892,0.0000011427961,0.000004658097,0.00001766652,0.99070257,0.0077007464,0.00013028152,0.001032823,0.000082047685],"about_ca_topic_score_codex":0.00001811549,"about_ca_topic_score_gemma":3.4159532e-7,"teacher_disagreement_score":0.9832738,"about_ca_system_score_codex":0.000017816075,"about_ca_system_score_gemma":0.0000050190097,"threshold_uncertainty_score":0.23688331},"labels":[],"label_agreement":null},{"id":"W2120405791","doi":"10.1109/pacrim.2005.1517241","title":"Functional units power gating in SMT processors","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Power gating; Computer science; Simultaneous multithreading; Multithreading; Throughput; Embedded system; Context (archaeology); Power optimization; Microarchitecture; Clock gating; Power (physics); Idle; Energy consumption; Computer architecture; Power consumption; Operating system; Transistor; Engineering; Jitter; Electrical engineering","score_opus":0.023967174577641807,"score_gpt":0.24933948613518953,"score_spread":0.22537231155754772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120405791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114798825,0.000029511368,0.9478247,0.0011847833,0.000048483485,0.000051834762,1.0165842e-7,0.0005180151,0.038862698],"genre_scores_gemma":[0.73966354,0.0000020058174,0.25787956,0.0006218294,0.000024005265,0.000004744168,8.174607e-7,0.0000030169965,0.00180048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936634,0.000022990835,0.00014892184,0.00018247802,0.00013497291,0.00014429707],"domain_scores_gemma":[0.9996534,0.000036309226,0.00003704372,0.00014432624,0.000096320255,0.000032585445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019625973,0.00006410216,0.00006030361,0.0001123656,0.00005509646,0.000062912164,0.00026717604,0.000032479347,0.00006595272],"category_scores_gemma":[0.000050855735,0.000058149377,0.000011624168,0.00061841804,0.000010277867,0.00032333544,0.00008972791,0.000083064864,0.000045359415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001158581,0.00030440252,0.011936713,0.000022361843,0.000014264243,0.000010303576,0.003374203,0.4597325,0.00034264315,0.36037886,0.047156297,0.11671588],"study_design_scores_gemma":[0.0002736484,0.000035134548,0.0058897887,0.000024042603,4.4451346e-7,0.000010837884,0.000028192591,0.9775232,0.0039627287,0.0016485904,0.010395397,0.00020800772],"about_ca_topic_score_codex":0.000007669437,"about_ca_topic_score_gemma":0.000008823223,"teacher_disagreement_score":0.7281836,"about_ca_system_score_codex":0.00002749695,"about_ca_system_score_gemma":0.000055952776,"threshold_uncertainty_score":0.23712628},"labels":[],"label_agreement":null},{"id":"W2120485090","doi":"10.1109/icpp.2002.1040881","title":"Pattern-based parallel programming","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Template; Extensibility; Abstraction; Software design pattern; Programming language; Generic programming; Design pattern; Programming paradigm; Parameterized complexity; Parallel computing; Algorithm; Software","score_opus":0.01816668113963268,"score_gpt":0.255051215617997,"score_spread":0.2368845344783643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120485090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001421074,0.000028423248,0.9813067,0.0003289729,0.000072415234,0.000098817894,5.4811196e-8,0.001097289,0.016925238],"genre_scores_gemma":[0.35239998,0.0000011231024,0.6465978,0.00068807177,0.0000059401864,0.000012010496,5.7727914e-7,0.000003842036,0.00029063626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992354,0.00006332487,0.00013243414,0.00023187745,0.00013244455,0.00020453328],"domain_scores_gemma":[0.9994633,0.000038649887,0.000040823496,0.00035088908,0.000046133784,0.000060209288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021156842,0.000087016495,0.0000785396,0.00006408783,0.000085272804,0.000136324,0.00038848902,0.000034862962,0.000027183834],"category_scores_gemma":[0.000029705589,0.00007568246,0.00004194856,0.0002319465,0.000014585525,0.000116121264,0.00003336157,0.000059752467,0.000037205846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002293879,0.00034204856,0.009495648,0.00002690247,0.000019484141,0.00003068935,0.00024749147,0.04777233,0.000051793817,0.4196898,0.011257595,0.51106393],"study_design_scores_gemma":[0.00045315706,0.00010114137,0.00034653782,0.000016669783,0.0000021970666,0.000010775304,0.0000065937356,0.91364694,0.0051542837,0.0032176564,0.07667604,0.0003680261],"about_ca_topic_score_codex":0.000009055234,"about_ca_topic_score_gemma":0.0000012593644,"teacher_disagreement_score":0.8658746,"about_ca_system_score_codex":0.000013294317,"about_ca_system_score_gemma":0.000045207027,"threshold_uncertainty_score":0.30862412},"labels":[],"label_agreement":null},{"id":"W2120715680","doi":"10.1145/1346281.1346286","title":"Accelerating two-dimensional page walks for virtualized systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":259,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Paging; Computer science; Page fault; Demand paging; Overhead (engineering); Virtualization; Operating system; Page; Hypervisor; Table (database); Dimension (graph theory); Software; Virtual memory; Memory management; Page cache; Parallel computing; Cache algorithms; Overlay; Database; CPU cache; Cache; Cloud computing","score_opus":0.052294680624724144,"score_gpt":0.287384977144376,"score_spread":0.23509029651965185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120715680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059854407,0.00007675703,0.9866381,0.00016785589,0.00026826054,0.00026715617,0.0000010132679,0.0010097288,0.0055856877],"genre_scores_gemma":[0.4148665,0.0000029465677,0.5827137,0.00038273912,0.00007186144,0.000038134942,0.00000436491,0.0000075286853,0.0019122018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897635,0.00005510431,0.00026103848,0.0003004025,0.00019079556,0.00021628916],"domain_scores_gemma":[0.99921596,0.00018283298,0.000085423184,0.0003018377,0.0001482454,0.000065710505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028542778,0.000112591246,0.00016282308,0.00007565919,0.0003528008,0.00010989083,0.0004411236,0.000044172786,0.00000850277],"category_scores_gemma":[0.000047053873,0.000095737705,0.000062830724,0.00016932354,0.000021924441,0.00024414528,0.00014151447,0.00006076004,0.00001513308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029095612,0.00020896945,0.0002982888,0.000045376877,0.000060503633,0.000030202564,0.0010660037,0.36487,0.007314084,0.5198915,0.09962844,0.0065575223],"study_design_scores_gemma":[0.0004550964,0.00005359941,0.000025421627,0.0000127005105,0.0000012549206,0.0000487764,0.0000039452966,0.99514097,0.0019528165,0.000476377,0.0016774712,0.00015158423],"about_ca_topic_score_codex":0.000034959365,"about_ca_topic_score_gemma":6.4502694e-7,"teacher_disagreement_score":0.63027096,"about_ca_system_score_codex":0.000021991491,"about_ca_system_score_gemma":0.000057870133,"threshold_uncertainty_score":0.39040703},"labels":[],"label_agreement":null},{"id":"W2121153954","doi":"10.1109/ipdps.2002.1016487","title":"Generating parallel programs from the wavefront design pattern","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Algorithm; Programming language","score_opus":0.05555571693195875,"score_gpt":0.24033998171404589,"score_spread":0.18478426478208715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121153954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003729305,0.00025803997,0.9945751,0.0019988327,0.00010061226,0.00021466431,2.7198402e-7,0.0008748221,0.0016047178],"genre_scores_gemma":[0.18206172,0.000031519823,0.8151708,0.0019279311,0.00010486809,0.000030158662,0.0000024019955,0.0000074599807,0.00066313543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989227,0.00015373043,0.00019521364,0.0003035579,0.0001942457,0.0002305211],"domain_scores_gemma":[0.9991596,0.0001279355,0.00006814196,0.0005469376,0.000046384306,0.000051012707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023365868,0.00012213824,0.0000993024,0.00001846624,0.00022965578,0.00036388828,0.00094385544,0.000044247587,0.000069563306],"category_scores_gemma":[0.000019225281,0.000076909186,0.000047166057,0.00014772407,0.000025308911,0.00017220573,0.00019403233,0.00010495333,0.000097170436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2193965e-7,0.00007690887,0.00079864106,0.00000105132,0.000018123463,0.0000070973633,0.0012631513,0.032465998,0.00004498247,0.0014782504,0.041573033,0.92227215],"study_design_scores_gemma":[0.000102258,0.00004026519,0.00010962067,0.000008630432,0.0000019276765,0.0000031305121,0.00000905312,0.996667,0.00019607082,0.00066350546,0.0020721285,0.00012636637],"about_ca_topic_score_codex":0.00013568572,"about_ca_topic_score_gemma":0.000009357074,"teacher_disagreement_score":0.96420103,"about_ca_system_score_codex":0.000016063716,"about_ca_system_score_gemma":0.000008157548,"threshold_uncertainty_score":0.3508983},"labels":[],"label_agreement":null},{"id":"W2121207198","doi":"10.1109/icpp.2007.69","title":"RDMA-based and SMP-aware Multi-port All-Gather on Multi-rail QsNet^II SMP Clusters","year":2007,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Remote direct memory access; Computer science; Data striping; Boosting (machine learning); Port (circuit theory); Parallel computing; Operating system; Computer network; Artificial intelligence","score_opus":0.06271917173527262,"score_gpt":0.3180136848290217,"score_spread":0.25529451309374906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121207198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067096904,0.00007038655,0.91279924,0.005771354,0.0003663313,0.00049088325,0.0000049481196,0.0004887149,0.012911241],"genre_scores_gemma":[0.8649492,0.000014827291,0.13252768,0.0015372672,0.000044960987,0.000016638225,0.0000027327442,0.000020888268,0.00088576623],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977808,0.000011916168,0.00051734265,0.0006240718,0.0007081843,0.00035769894],"domain_scores_gemma":[0.99825263,0.000052193052,0.0006014246,0.0001982149,0.0007808451,0.00011466286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000739259,0.0003080185,0.00025495022,0.00027599215,0.00031504757,0.00034979393,0.0017844772,0.00013510359,0.000014349672],"category_scores_gemma":[0.0001485507,0.0002422152,0.000096589996,0.00026269534,0.00016256985,0.00046826783,0.0004553322,0.00034842436,0.0000042925262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033671197,0.009162043,0.06309866,0.0018951185,0.001039891,0.000073399926,0.028624348,0.09061722,0.06535273,0.32988745,0.01396143,0.3929206],"study_design_scores_gemma":[0.001173219,0.0001957619,0.0030898286,0.0006414742,0.000011777848,0.0000151212325,0.00014206258,0.9804213,0.012031988,0.001282999,0.00061436417,0.00038009384],"about_ca_topic_score_codex":0.000025191566,"about_ca_topic_score_gemma":0.0000075012304,"teacher_disagreement_score":0.88980407,"about_ca_system_score_codex":0.00010274118,"about_ca_system_score_gemma":0.00013180761,"threshold_uncertainty_score":0.9877249},"labels":[],"label_agreement":null},{"id":"W2121522147","doi":"10.5555/563998.564024","title":"Mapping reference code to irregular DSPs within the retargetable, optimizing compiler COGEN(T)","year":2001,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Compiler; Dead code; Unreachable code; Code (set theory); Parallel computing; Code generation; Programming language; Redundant code; Object code; Schedule; Abstraction; Set (abstract data type); Dead code elimination; Instruction set; Operating system","score_opus":0.01927482218811427,"score_gpt":0.25990138114751543,"score_spread":0.24062655895940116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121522147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017546643,0.000085910026,0.941143,0.025862617,0.0007692577,0.0003718097,0.000018575054,0.0005528059,0.013649378],"genre_scores_gemma":[0.6416408,0.000050083094,0.345469,0.009879876,0.00032429103,0.000056004297,0.00004482895,0.00003793306,0.0024972123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978282,0.00016281706,0.00042249725,0.0006657828,0.00055712176,0.00036357177],"domain_scores_gemma":[0.99853295,0.00015457517,0.00019787505,0.0007380583,0.00024392919,0.00013258557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043394527,0.00028823756,0.00021246333,0.00023625567,0.0003502605,0.00041259718,0.002599477,0.00010816478,0.000037092766],"category_scores_gemma":[0.000059677022,0.00021619773,0.00010289097,0.0005707754,0.00007237614,0.00015647383,0.0005299448,0.00050166086,0.00010862209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010375647,0.0001384681,0.00048686907,0.000009749962,0.00012806611,0.00005617133,0.0039075017,0.89671725,0.05689343,0.022948006,0.01030679,0.0083039645],"study_design_scores_gemma":[0.00095383567,0.00030757647,0.0016683855,0.00040694096,0.000014416191,0.000644962,0.00011541982,0.46827725,0.046393212,0.0049620266,0.47504085,0.0012151244],"about_ca_topic_score_codex":0.00004528173,"about_ca_topic_score_gemma":0.000018263163,"teacher_disagreement_score":0.6240941,"about_ca_system_score_codex":0.0001213382,"about_ca_system_score_gemma":0.000052863554,"threshold_uncertainty_score":0.88162875},"labels":[],"label_agreement":null},{"id":"W2121788702","doi":"10.1109/hpca.2013.6522302","title":"Power struggles: Revisiting the RISC vs. CISC debate on contemporary ARM and x86 architectures","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":188,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction; Cisco Systems; National Science Foundation","keywords":"x86; Power (physics); ARM architecture; Computer science; Embedded system; Operating system; Physics; Software","score_opus":0.014470389317679522,"score_gpt":0.24195118505915458,"score_spread":0.22748079574147506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121788702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062856056,0.00040598228,0.82020915,0.011471285,0.000104887375,0.00043740016,8.596696e-7,0.0009354195,0.10357895],"genre_scores_gemma":[0.9428636,0.00001702698,0.053568106,0.0028855738,0.000055646768,0.000013565409,7.393876e-7,0.000007999651,0.00058775337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998994,0.00012060637,0.00020762095,0.00031245803,0.00017405399,0.00019127982],"domain_scores_gemma":[0.99906874,0.0002519408,0.00009445053,0.00045659102,0.0000601519,0.00006813632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519663,0.00014144961,0.00013749405,0.000074395066,0.00021415416,0.0003876732,0.0005713234,0.000040961615,0.000063794636],"category_scores_gemma":[0.00006015996,0.00008281944,0.00004075009,0.00014938695,0.00006035874,0.00012835536,0.00025883786,0.00017017873,0.000053005107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047260048,0.00022933341,0.014787944,0.000109048844,0.00018365182,0.000057031197,0.009100913,0.014195683,0.00045815588,0.2014586,0.27478686,0.4845855],"study_design_scores_gemma":[0.0012066787,0.0010268153,0.03024635,0.00046997346,0.0000093596755,0.0001476815,0.0006370073,0.8468957,0.008325135,0.070031434,0.039464515,0.0015393498],"about_ca_topic_score_codex":0.000102786646,"about_ca_topic_score_gemma":0.0000011158156,"teacher_disagreement_score":0.8800075,"about_ca_system_score_codex":0.000008273087,"about_ca_system_score_gemma":0.000024136003,"threshold_uncertainty_score":0.37383416},"labels":[],"label_agreement":null},{"id":"W2122084979","doi":"10.1109/tvlsi.2008.2010941","title":"Dynamic and Leakage Energy Minimization With Soft Real-Time Loop Scheduling and Voltage Assignment","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Dynamic voltage scaling; Scheduling (production processes); Computer science; Voltage; Energy consumption; Dissipation; Leakage (economics); Algorithm; Electronic engineering; Mathematical optimization; Electrical engineering; Engineering; Mathematics; Physics","score_opus":0.006269244762138148,"score_gpt":0.21936199705049542,"score_spread":0.21309275228835728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122084979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01050507,0.00011907448,0.9876094,0.00019204267,0.00024175445,0.00029420888,0.000014763134,0.0006365476,0.00038715964],"genre_scores_gemma":[0.9580803,0.00022409233,0.039929032,0.000121628225,0.000025506348,0.000042237596,0.000017601535,0.000020737956,0.0015388469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981434,0.00016396151,0.00043588353,0.0005985855,0.0003601948,0.00029801897],"domain_scores_gemma":[0.99900055,0.000097396456,0.00019100161,0.0004024058,0.00016688969,0.0001417833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000300452,0.00029419374,0.00031007433,0.00032237804,0.00043092415,0.00043043436,0.00022690953,0.0001677602,0.0000069132007],"category_scores_gemma":[0.0000057490315,0.00025632133,0.000054360888,0.0004171259,0.000051411036,0.00070765853,0.0000041814956,0.00019434013,0.0000069846305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021992206,0.0011054476,0.00007002012,0.00010819731,0.00015175204,0.000034585795,0.0035377743,0.8606358,0.029410357,0.0069809435,0.0007249871,0.09702018],"study_design_scores_gemma":[0.00052224414,0.00039382765,0.000077128156,0.00022893674,0.000022294676,0.00005083117,0.0001715523,0.9924211,0.005539522,0.00009249663,0.00017375336,0.0003062946],"about_ca_topic_score_codex":0.00006872941,"about_ca_topic_score_gemma":0.00004613689,"teacher_disagreement_score":0.94768035,"about_ca_system_score_codex":0.00012442558,"about_ca_system_score_gemma":0.000058983067,"threshold_uncertainty_score":0.9999889},"labels":[],"label_agreement":null},{"id":"W2122708961","doi":"10.1145/1854273.1854307","title":"AKULA","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Council","keywords":"Computer science; Multi-core processor; Scheduling (production processes); Debugging; Distributed computing; Embedded system; Operating system","score_opus":0.008945982939843167,"score_gpt":0.24857522367320153,"score_spread":0.23962924073335837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122708961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017472488,0.0000020457987,0.8913992,0.0005293951,0.0001655776,0.000018021346,2.2729528e-8,0.00080935523,0.105329126],"genre_scores_gemma":[0.38171726,6.6150596e-7,0.6167312,0.00031425827,0.000019106012,0.0000010304016,1.2864245e-7,0.0000011421274,0.0012151544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.0000059377744,0.00004914309,0.00009942727,0.00005537474,0.00007100879],"domain_scores_gemma":[0.9996567,0.000014952234,0.000012303864,0.0002602506,0.000026217731,0.000029621506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009065591,0.000030287183,0.000028847044,0.00003008743,0.000038544404,0.00006227345,0.0003984362,0.000022546781,0.00003560253],"category_scores_gemma":[0.000014660752,0.000024923824,0.000014207041,0.00010281414,0.0000092348755,0.000106347376,0.00008498069,0.000069935246,0.00006787904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4425495e-7,0.000014372165,0.00027171333,5.438832e-7,0.0000010706588,0.0000013345816,0.000043577922,0.0000931595,0.00184911,0.9516794,0.0127244415,0.033321124],"study_design_scores_gemma":[0.00011748081,0.000027031432,0.0016080945,0.0000018067958,5.8931187e-7,0.000025304496,0.0000013938492,0.82596296,0.032234564,0.03192716,0.10789436,0.00019926282],"about_ca_topic_score_codex":0.000004952592,"about_ca_topic_score_gemma":0.0000019953532,"teacher_disagreement_score":0.91975224,"about_ca_system_score_codex":0.0000012347415,"about_ca_system_score_gemma":0.000011125132,"threshold_uncertainty_score":0.1016364},"labels":[],"label_agreement":null},{"id":"W2122858224","doi":"10.1145/1375634.1375649","title":"MPADS","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Padding; Computer science; Memory safety; Pooling; Pointer (user interface); Programming language; Theoretical computer science; Compiler; Computer security; Artificial intelligence","score_opus":0.02475966396426187,"score_gpt":0.24704874283239472,"score_spread":0.22228907886813284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122858224","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011344778,0.00001675079,0.90711594,0.00030265655,0.000042790245,0.000017061711,1.7836815e-8,0.0008944638,0.09047586],"genre_scores_gemma":[0.4426002,0.000013347652,0.554188,0.00044350704,0.000011730099,0.0000011046849,1.4039597e-7,0.0000012255313,0.0027407364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996924,0.000010216426,0.000055437573,0.000098328004,0.0000685917,0.000075021846],"domain_scores_gemma":[0.9997246,0.000012239054,0.000012232327,0.0001989859,0.00002483619,0.00002708515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044222288,0.000031834163,0.000035812718,0.00003317999,0.0000762998,0.000015848398,0.0003149081,0.000014436743,0.00001537187],"category_scores_gemma":[0.000007202756,0.000026699663,0.00001645657,0.00014069799,0.00001258743,0.00011735673,0.00007426567,0.000025632722,0.00007494953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013253622,0.00009521052,0.0039135106,0.0000028232628,0.00000846968,0.000052647243,0.00083306956,0.004022028,0.00019777134,0.67927134,0.28149208,0.030109707],"study_design_scores_gemma":[0.00020080587,0.00007117366,0.005177336,0.0000040738905,5.778807e-7,0.00018958746,0.0000023308096,0.92468315,0.012631761,0.007843551,0.048927333,0.00026830225],"about_ca_topic_score_codex":0.0000053211356,"about_ca_topic_score_gemma":1.2826885e-7,"teacher_disagreement_score":0.92066115,"about_ca_system_score_codex":0.000004657965,"about_ca_system_score_gemma":0.000016198872,"threshold_uncertainty_score":0.10887806},"labels":[],"label_agreement":null},{"id":"W2123051253","doi":"10.1145/2554688.2554773","title":"Modular multi-ported SRAM-based memories","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Porting; Computer science; Static random-access memory; Modular design; Parallel computing; Lookup table; Bitwise operation; Embedded system; Computer hardware; Operating system","score_opus":0.017700444607570875,"score_gpt":0.2509122019006565,"score_spread":0.23321175729308563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123051253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084507756,0.000012789904,0.99073637,0.0005691587,0.00012660217,0.00007132257,1.6525075e-7,0.001726981,0.0059115645],"genre_scores_gemma":[0.43115637,6.274918e-7,0.56762093,0.00070084725,0.000017219949,0.000004082402,0.0000017830984,0.000004134369,0.00049401063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991871,0.00006155358,0.00015712537,0.0002698408,0.00015025809,0.00017409302],"domain_scores_gemma":[0.99921757,0.000049047965,0.000055081262,0.00051901385,0.00009442228,0.000064863874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027935728,0.000100598205,0.000113360766,0.00008305515,0.000103907616,0.00011477727,0.0005784568,0.000047967787,0.000015826554],"category_scores_gemma":[0.00006741709,0.00008670327,0.000043480177,0.00024222024,0.000028958693,0.00015398314,0.000096357115,0.000062558225,0.000037271293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001029778,0.0005300414,0.0035133248,0.00004697189,0.000042562882,0.000015115828,0.00053625595,0.5515443,0.0019402996,0.32610357,0.015317662,0.100399576],"study_design_scores_gemma":[0.0002129824,0.000034709272,0.0007845604,0.000005284459,0.000001256726,0.0000012188865,0.0000013167861,0.98272455,0.010412616,0.0011765069,0.0045156674,0.00012933766],"about_ca_topic_score_codex":0.000017122378,"about_ca_topic_score_gemma":0.0000027163314,"teacher_disagreement_score":0.43118024,"about_ca_system_score_codex":0.000011455353,"about_ca_system_score_gemma":0.000029740042,"threshold_uncertainty_score":0.3535657},"labels":[],"label_agreement":null},{"id":"W2123160336","doi":"10.1109/iccsse.1997.599882","title":"Partial redundancy elimination driven by a cost-benefit analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Computer science; Compiler; Optimizing compiler; Static analysis; Partial evaluation; Program optimization; Reliability engineering; Programming language; Engineering; Operating system","score_opus":0.018471408268173894,"score_gpt":0.25421762726541275,"score_spread":0.23574621899723885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123160336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009248514,0.000076018514,0.9845114,0.0015095643,0.0000508642,0.000100239355,0.0000013848994,0.00070335955,0.012122371],"genre_scores_gemma":[0.82391226,0.000055634184,0.17127638,0.0003376771,0.00002297471,0.000019044573,0.0000107351325,0.0000047130675,0.004360606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990602,0.00003535292,0.00020121834,0.0003090702,0.00020556622,0.00018857114],"domain_scores_gemma":[0.9993375,0.000035114423,0.00008111603,0.00038218408,0.00009251918,0.00007154232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110988425,0.000096041455,0.00013700976,0.00018891433,0.00012133823,0.0001661757,0.00047957056,0.00005186992,0.00020334186],"category_scores_gemma":[0.00001953551,0.00009103345,0.00008933284,0.001043733,0.000017730357,0.0002832507,0.000097007294,0.00006097178,0.00007101388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064825763,0.000702396,0.0048749973,0.000012100525,0.0005173415,0.000013700142,0.0021457039,0.16617307,0.00069409993,0.18928947,0.2707932,0.36477745],"study_design_scores_gemma":[0.00009866981,0.000031776595,0.00041218082,0.0000023294483,0.000024104487,0.0000012138856,0.0000024466312,0.99169296,0.0021737479,0.00030318453,0.0051301867,0.00012717473],"about_ca_topic_score_codex":0.000023459386,"about_ca_topic_score_gemma":0.0000048217494,"teacher_disagreement_score":0.8255199,"about_ca_system_score_codex":0.000031908898,"about_ca_system_score_gemma":0.0000046271953,"threshold_uncertainty_score":0.37122363},"labels":[],"label_agreement":null},{"id":"W2124504744","doi":"10.1016/j.scico.2005.10.012","title":"Gaussian Elimination: A case study in efficient genericity with MetaOCaml","year":2006,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Implementation; Gaussian elimination; Code (set theory); Gaussian; Code generation; Programming language; Algorithm; Theoretical computer science; Parallel computing; Mathematical optimization; Key (lock); Operating system; Mathematics","score_opus":0.013699039743499506,"score_gpt":0.26979308635756466,"score_spread":0.25609404661406515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124504744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39433533,0.000017963139,0.60487,0.00007161086,0.00006620245,0.00033837697,8.7353776e-8,0.00016605838,0.00013432193],"genre_scores_gemma":[0.5628178,1.5057987e-7,0.43712655,0.000011634101,0.000020042675,0.000015865804,2.1980124e-7,0.000003581155,0.0000041413746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977814,0.0000915074,0.00041323475,0.0006242531,0.00066575105,0.000423856],"domain_scores_gemma":[0.9988508,0.000045700443,0.0002132866,0.00053663587,0.00027823463,0.00007529998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014255603,0.00016986454,0.00023523462,0.0005939875,0.00025688234,0.00033863733,0.0010209479,0.000038247254,6.4269676e-7],"category_scores_gemma":[0.000009837704,0.00013851938,0.000037513146,0.0031731466,0.00028345815,0.0004159377,0.00038107773,0.00015283641,9.697094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010420357,0.0022600507,0.013329202,0.000031745483,0.00001221917,0.0015505125,0.0041418085,0.662443,0.00014667312,0.016769808,0.000028910288,0.29927567],"study_design_scores_gemma":[0.00045864366,0.00058054866,0.008077745,0.00003490888,0.0000053006643,0.00056454085,0.00017633276,0.9883599,0.0013354344,0.00013644506,0.000037238697,0.0002329419],"about_ca_topic_score_codex":0.0005186938,"about_ca_topic_score_gemma":0.00008267158,"teacher_disagreement_score":0.32591692,"about_ca_system_score_codex":0.00007519658,"about_ca_system_score_gemma":0.00018250138,"threshold_uncertainty_score":0.5648656},"labels":[],"label_agreement":null},{"id":"W2124579808","doi":"10.1109/ccece.2007.239","title":"Using the Cell Processor As a Network Assist to Minimize Latency","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Copying; Thread (computing); Latency (audio); Scalability; Message passing; Computer architecture; Network processor; Software; Parallel computing; Embedded system; Distributed computing; Computer network; Operating system","score_opus":0.03106623228634653,"score_gpt":0.30323701191235874,"score_spread":0.2721707796260122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124579808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023300971,0.000057759346,0.9491182,0.0007367389,0.00014975376,0.00015915651,7.208461e-8,0.00046199653,0.046986256],"genre_scores_gemma":[0.23587473,0.0000022611468,0.75971305,0.00226502,0.00010100611,0.000003315366,2.1721947e-7,0.0000063821276,0.0020340467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989754,0.00003470685,0.00020715626,0.0002594804,0.00019320242,0.00033004006],"domain_scores_gemma":[0.9992513,0.00010428222,0.000071062255,0.00037721518,0.00010415703,0.000091965965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070018147,0.00010392784,0.000097019576,0.000052934694,0.00025633327,0.00017229849,0.0008166953,0.00004582259,0.0000137852485],"category_scores_gemma":[0.000033277967,0.00006957107,0.00003962141,0.00072575314,0.000018025972,0.00012071051,0.00024682918,0.00008852419,0.00003881836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095114854,0.000535415,0.009998721,0.000069817834,0.000059402813,0.00010337496,0.005835598,0.64176834,0.0016389602,0.1655243,0.09948771,0.07488325],"study_design_scores_gemma":[0.00032930318,0.00013357578,0.0024995874,0.0000609422,0.000011351362,0.000043567456,0.000071706054,0.94938016,0.020208325,0.010367036,0.016310832,0.0005835992],"about_ca_topic_score_codex":0.000045997353,"about_ca_topic_score_gemma":0.0000052192754,"teacher_disagreement_score":0.30761185,"about_ca_system_score_codex":0.00002480401,"about_ca_system_score_gemma":0.00006301094,"threshold_uncertainty_score":0.28370258},"labels":[],"label_agreement":null},{"id":"W2125456629","doi":"10.1109/iwv.2001.923137","title":"Structural design composition for C++ hardware models","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Patient Safety Institute; National Science Foundation","keywords":"Floorplan; Computer science; Abstraction; Component (thermodynamics); Physical design; Predictability; Domain (mathematical analysis); Computer architecture; Software; Component-based software engineering; Abstraction layer; Electronic design automation; Software engineering; Circuit design; Embedded system; Programming language; Software development","score_opus":0.07830920673147788,"score_gpt":0.26562749217984666,"score_spread":0.18731828544836876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125456629","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000931664,0.000051401636,0.9953412,0.00047888464,0.00007568012,0.0002093965,9.3762065e-7,0.0008022228,0.0029471512],"genre_scores_gemma":[0.33087182,0.0000044350236,0.66843927,0.0002593321,0.00001849332,0.000012763546,0.0000020014193,0.0000035382843,0.00038836247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943364,0.000030489926,0.00011353208,0.00019128592,0.00009051594,0.00014052358],"domain_scores_gemma":[0.99957716,0.0000561565,0.00003566748,0.00020962193,0.00008292778,0.000038436647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008321889,0.00007426382,0.00007683522,0.000051151903,0.00013928843,0.000115975745,0.00036301545,0.000034029148,0.000018366467],"category_scores_gemma":[0.0000046120736,0.00006516164,0.000039300758,0.00010539656,0.000010378468,0.0003794629,0.000050380047,0.00003313577,0.000008478915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042535826,0.000022610957,0.0000054445723,0.000007908884,0.000009058287,0.0000011570214,0.00036553972,0.72321063,0.00017986061,0.2055569,0.045365717,0.025270937],"study_design_scores_gemma":[0.00013558406,0.0000485324,0.0000055607775,0.000004340408,0.0000012507087,0.0000058398837,0.0000010663169,0.97202164,0.0025556772,0.024967428,0.00015695322,0.000096099524],"about_ca_topic_score_codex":0.0000025319544,"about_ca_topic_score_gemma":1.0250639e-7,"teacher_disagreement_score":0.33077866,"about_ca_system_score_codex":0.000016959091,"about_ca_system_score_gemma":0.000004724741,"threshold_uncertainty_score":0.26572147},"labels":[],"label_agreement":null},{"id":"W2125829714","doi":"10.1109/icdcs.1992.235030","title":"Performance prediction modeling of multicomputers","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computation; Parallel computing; Tree (set theory); Restructuring; Supercomputer; Theoretical computer science; Algorithm; Mathematics","score_opus":0.019141472447980052,"score_gpt":0.23017453032500088,"score_spread":0.2110330578770208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125829714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0251887,0.00001339832,0.96022046,0.000017446106,0.00010465105,0.00004594278,1.041929e-7,0.00033749655,0.014071828],"genre_scores_gemma":[0.5688644,0.000011641792,0.43104726,0.00002414888,0.0000034164855,0.000001076264,2.1079347e-7,0.0000015283388,0.000046293284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947685,0.000026690252,0.00016029653,0.00013661843,0.000104768136,0.00009476278],"domain_scores_gemma":[0.9996369,0.000013781195,0.00003780009,0.0002171179,0.000068184665,0.0000262555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017779112,0.00005258455,0.00006836552,0.00007033037,0.00004463393,0.00002056064,0.0002277049,0.000025685727,0.0000034808302],"category_scores_gemma":[0.000012789138,0.000047312988,0.000023794973,0.00016590128,0.000008911536,0.00024682755,0.00003749784,0.000037868216,0.0000029403354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.866154e-7,0.00002299877,0.00090058066,0.0000071540544,0.0000033026452,1.296884e-7,0.000115480456,0.97391146,0.00007884231,0.020685667,0.00010698938,0.004166799],"study_design_scores_gemma":[0.000089950714,0.000031381594,0.00007848138,0.000010102043,7.820571e-7,0.0000032792402,0.0000028264521,0.99543387,0.00396455,0.0002545291,0.00008256126,0.0000476761],"about_ca_topic_score_codex":0.0000035691385,"about_ca_topic_score_gemma":6.654285e-8,"teacher_disagreement_score":0.5436757,"about_ca_system_score_codex":0.000010083681,"about_ca_system_score_gemma":0.000020392761,"threshold_uncertainty_score":0.19293676},"labels":[],"label_agreement":null},{"id":"W2126293901","doi":"10.1017/s0960129513000388","title":"Multidimensional infinite data in the language Lucid","year":2014,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Lucid dream; Sequence (biology); Programmer; Theoretical computer science; Value (mathematics); Loop (graph theory); Programming language; Algorithm; Mathematics","score_opus":0.023878365687961887,"score_gpt":0.303900635172346,"score_spread":0.28002226948438413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126293901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01963603,0.00002591642,0.9783899,0.00069976127,0.00015872772,0.00015172541,8.3408844e-7,0.00012357302,0.0008134898],"genre_scores_gemma":[0.51614195,7.5615935e-7,0.48284024,0.0009698903,0.000038201397,0.000002914853,0.0000014629557,0.0000025463771,0.0000020314342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977991,0.00018413897,0.00034371455,0.00062020356,0.0006810124,0.0003718481],"domain_scores_gemma":[0.99744374,0.0006162251,0.00007656908,0.0017592296,0.000041164694,0.00006308057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027707494,0.00014678642,0.00017966027,0.0002338439,0.00014581738,0.00031612732,0.0052855746,0.00003931073,0.000006977026],"category_scores_gemma":[0.00038350883,0.00009438248,0.000022443017,0.001124558,0.00028573113,0.00050574605,0.0019337839,0.00023932154,0.000014783611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033625088,0.0001453969,0.0012196818,0.000033033186,0.0000022476625,0.000039225757,0.005173572,0.019626549,0.00014160447,0.82225627,0.0006985305,0.15066053],"study_design_scores_gemma":[0.0001472811,0.000018595836,0.005725149,0.000029336728,5.7939906e-7,0.000040215717,0.0000078420935,0.92141557,0.00014533117,0.072149746,0.00019693295,0.00012343285],"about_ca_topic_score_codex":0.000019269923,"about_ca_topic_score_gemma":0.0000055455494,"teacher_disagreement_score":0.901789,"about_ca_system_score_codex":0.000028511578,"about_ca_system_score_gemma":0.000057836012,"threshold_uncertainty_score":0.9822001},"labels":[],"label_agreement":null},{"id":"W2126603366","doi":"10.1109/iiswc.2008.4636095","title":"Temporal streams in commercial server applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Exploit; Kernel (algebra); Operating system; Distributed computing; Computer security","score_opus":0.025687695391797476,"score_gpt":0.2646035610439249,"score_spread":0.23891586565212744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126603366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010241427,0.000017945476,0.97493887,0.0004679352,0.000022804865,0.00012095989,2.6426648e-7,0.0004606426,0.0137291355],"genre_scores_gemma":[0.7523672,0.000011765626,0.24671446,0.00033547133,0.000020438718,0.000023933462,0.000003052685,0.0000027142785,0.0005209929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994501,0.00002699873,0.00013958664,0.00016977747,0.00009522571,0.00011834218],"domain_scores_gemma":[0.9995849,0.000021779042,0.000029300127,0.00029605403,0.00003180456,0.000036165507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008762422,0.000059401293,0.00007525479,0.000080498205,0.00008861621,0.000023065457,0.00044316627,0.000033956636,0.000012026712],"category_scores_gemma":[0.000003656335,0.00005582341,0.000022839851,0.00037056857,0.0000236252,0.00016813802,0.000113312606,0.00006665728,0.00003757289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007912395,0.0008931699,0.3726104,0.000016855056,0.000014495913,0.000050004513,0.0017152217,0.013315653,0.000040752253,0.39965484,0.050878156,0.16080256],"study_design_scores_gemma":[0.0012760326,0.0001384676,0.16166617,0.000024839479,0.000002431793,0.00009760163,0.000025537183,0.7544697,0.0027436733,0.014760796,0.06390929,0.00088544737],"about_ca_topic_score_codex":0.00015771251,"about_ca_topic_score_gemma":0.000046850913,"teacher_disagreement_score":0.74212575,"about_ca_system_score_codex":0.000018415747,"about_ca_system_score_gemma":0.000037752194,"threshold_uncertainty_score":0.22764125},"labels":[],"label_agreement":null},{"id":"W2126795434","doi":"10.1109/ipdps.2008.4536190","title":"Extended characterization of DMA transfers on the Cell BE processor","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Computer science; Copying; Thread (computing); Message passing; Parallel computing; Multi-core processor; Computer architecture; Latency (audio); Embedded system; Distributed computing; Operating system","score_opus":0.024188566500641315,"score_gpt":0.24702972936264353,"score_spread":0.22284116286200223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126795434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002575,0.000044268003,0.6845066,0.009608288,0.00020135379,0.00034789625,0.000054316264,0.00040857837,0.004571218],"genre_scores_gemma":[0.99335957,0.00022750546,0.005303892,0.00056817924,0.000083836036,0.000067227615,0.000064727625,0.000015987102,0.0003090618],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998275,0.000017880042,0.00044643044,0.00047604938,0.0005251363,0.0002595078],"domain_scores_gemma":[0.9987465,0.000053425487,0.00034435722,0.00013137577,0.000635975,0.000088379114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002426952,0.00024866988,0.0002231834,0.00015545497,0.0003892613,0.00022547973,0.00088610966,0.00010553583,0.0000055582614],"category_scores_gemma":[0.00004238875,0.00019089437,0.00007012406,0.0004354778,0.00016451908,0.0007144441,0.0000771241,0.00020189061,0.0000024976032],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012752177,0.0037768518,0.009977525,0.0015778607,0.00036834224,0.000047553774,0.02244436,0.009218554,0.8051849,0.11955853,0.015368763,0.011201523],"study_design_scores_gemma":[0.0020842839,0.0007257356,0.0085138455,0.0004900974,0.000048084778,0.00021967533,0.00019006593,0.5995966,0.37861413,0.0039527323,0.004429037,0.001135666],"about_ca_topic_score_codex":0.000004587245,"about_ca_topic_score_gemma":1.0559668e-7,"teacher_disagreement_score":0.69310206,"about_ca_system_score_codex":0.000040635987,"about_ca_system_score_gemma":0.00009673116,"threshold_uncertainty_score":0.77844465},"labels":[],"label_agreement":null},{"id":"W2126888580","doi":"10.1109/pacrim.2013.6625475","title":"Cache prefetching and speculation on multi-threaded processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Parallel computing; Computer science; Speculative multithreading; Speculation; Cache; Storage management; Speculative execution; Multithreading; Operating system; Thread (computing); Business","score_opus":0.028628285864900276,"score_gpt":0.26366159959500685,"score_spread":0.23503331373010658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126888580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043352176,0.000017729004,0.9500142,0.0005974367,0.000028786793,0.00017770629,5.0413043e-8,0.0005618745,0.0052500525],"genre_scores_gemma":[0.6408231,0.000004105874,0.35836104,0.0002320414,0.000010016472,0.00000971962,6.0298277e-7,0.0000030850126,0.0005562915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994393,0.00002655572,0.00010616764,0.00021828701,0.000098298086,0.00011137229],"domain_scores_gemma":[0.9996503,0.000031686435,0.000042679017,0.00017796153,0.000051747124,0.00004563038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000968447,0.0000750895,0.000064817534,0.00006518537,0.00008434647,0.0001712558,0.0001922575,0.000035570974,0.000011445291],"category_scores_gemma":[0.000027649221,0.000059628277,0.000012633127,0.000120065546,0.000012126789,0.00034069232,0.00007645903,0.00006302554,0.000036476034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012133379,0.0006494809,0.014337964,0.00012234197,0.000060247265,0.000006678079,0.009112723,0.08309487,0.0042008744,0.27907002,0.011146801,0.59818584],"study_design_scores_gemma":[0.00014681635,0.00003623463,0.009752197,0.000014260488,7.922619e-7,0.0000025528273,0.000009257757,0.9829302,0.004160329,0.002732126,0.000107761734,0.00010749718],"about_ca_topic_score_codex":0.00005826007,"about_ca_topic_score_gemma":0.0000020786558,"teacher_disagreement_score":0.8998353,"about_ca_system_score_codex":0.00001184531,"about_ca_system_score_gemma":0.000009515138,"threshold_uncertainty_score":0.24315706},"labels":[],"label_agreement":null},{"id":"W2127775022","doi":"10.1109/cds.1996.509367","title":"Kea-a dynamically extensible and configurable operating system kernel","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Extensibility; Kernel (algebra); Control reconfiguration; Computer science; Flexibility (engineering); Operating system; Distributed computing; Computer architecture; Embedded system","score_opus":0.015378646840024,"score_gpt":0.2190311192516022,"score_spread":0.20365247241157822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127775022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002379703,0.00017993987,0.8936286,0.00040827668,0.00006565583,0.000092982256,2.6667797e-7,0.0011355812,0.102108985],"genre_scores_gemma":[0.67771566,0.000020179112,0.31894502,0.00028397693,0.000014541969,0.000004579473,4.000179e-7,0.0000052782393,0.0030103626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913496,0.0000461368,0.00019394892,0.00030327853,0.00012728426,0.00019436471],"domain_scores_gemma":[0.9994269,0.000050562267,0.00004620341,0.00030616828,0.000091817834,0.00007835522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018921777,0.0001022446,0.00013667696,0.000058949616,0.00017954306,0.00030731442,0.00032968208,0.000047783236,0.000026962622],"category_scores_gemma":[0.00002473354,0.00008742519,0.000022274038,0.00017444845,0.000024391233,0.000245605,0.00013674362,0.0000768627,0.000046900484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016638867,0.00010411773,0.0008017618,0.00010939833,0.00003416465,0.000055809593,0.0008629902,0.014306685,0.0023348778,0.9182289,0.019225605,0.04393401],"study_design_scores_gemma":[0.00012207746,0.000032224005,0.00010714059,0.000031575222,0.0000014826395,0.000059618786,0.000025689847,0.99823964,0.00070720626,0.0001396036,0.000407846,0.00012591884],"about_ca_topic_score_codex":0.00003402587,"about_ca_topic_score_gemma":0.0000011436273,"teacher_disagreement_score":0.9839329,"about_ca_system_score_codex":0.00002317329,"about_ca_system_score_gemma":0.000008546055,"threshold_uncertainty_score":0.35650957},"labels":[],"label_agreement":null},{"id":"W2127857977","doi":"10.1109/hicss.2000.926880","title":"Performance analysis of electronic commerce multiprocessor server","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell'Università e della Ricerca; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; MESI protocol; Cache coherence; Multiprocessing; Shared resource; Cache; Scheduling (production processes); Data sharing; Cache invalidation; Kernel (algebra); Overhead (engineering); Operating system; CPU cache; Parallel computing; Embedded system; Cache algorithms","score_opus":0.011456496731329502,"score_gpt":0.2548257796904089,"score_spread":0.24336928295907942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127857977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19672556,0.000048602327,0.7968983,0.00033235148,0.000008515918,0.000038420178,2.0803402e-7,0.0002756451,0.005672373],"genre_scores_gemma":[0.864819,0.00003744893,0.13394904,0.0003174512,0.000007917009,0.00000253195,0.0000019097515,0.0000024817855,0.00086222787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.000021468632,0.0001883573,0.00017421645,0.00014166834,0.00018157657],"domain_scores_gemma":[0.99940777,0.000030264056,0.00008026848,0.00035146403,0.00010126851,0.000028948894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020412813,0.00007112872,0.00015440394,0.00022173255,0.00004926128,0.000023441185,0.0005832868,0.000030343834,0.00003209343],"category_scores_gemma":[0.000007642516,0.00006185209,0.00006963731,0.0012205389,0.000015545174,0.0002845829,0.0000973835,0.00006348943,0.000011114533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007670773,0.00020181616,0.035170447,0.000021826443,0.0003758787,2.287664e-7,0.0006487745,0.85997206,0.00015023307,0.031474005,0.001490263,0.07048678],"study_design_scores_gemma":[0.00007837271,0.000031097235,0.01162159,0.0000029064777,0.000028321447,5.067027e-7,0.0000019480462,0.98287535,0.0035516617,0.000023060498,0.001704956,0.000080226804],"about_ca_topic_score_codex":0.000016099517,"about_ca_topic_score_gemma":0.000020541805,"teacher_disagreement_score":0.66809344,"about_ca_system_score_codex":0.0000263223,"about_ca_system_score_gemma":0.00003162334,"threshold_uncertainty_score":0.2522255},"labels":[],"label_agreement":null},{"id":"W2127890622","doi":"10.1109/ccece.2002.1015286","title":"Circuit simulation: unified simulator","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Electronic circuit; Process (computing); Simple (philosophy); Electronic circuit simulation; Resistive touchscreen; Simulation; Electronic engineering; Algorithm; Engineering; Electrical engineering","score_opus":0.03398595339943684,"score_gpt":0.2772945896179451,"score_spread":0.2433086362185083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127890622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041724474,0.000023917275,0.9109452,0.00007038097,0.000105279716,0.0000681684,7.816125e-8,0.0008917167,0.08747806],"genre_scores_gemma":[0.84500176,0.0000015566739,0.15284441,0.0004321228,0.000012972249,0.0000017570967,4.368124e-7,0.0000042479032,0.0017007575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928206,0.000060178194,0.00014735083,0.00022041322,0.00013924374,0.00015075257],"domain_scores_gemma":[0.99929875,0.00011356307,0.000039968203,0.0004012859,0.000084958294,0.00006148066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019340782,0.00008003401,0.00008133048,0.00006812374,0.00009924492,0.000104514744,0.00034012445,0.00004386518,0.00007139792],"category_scores_gemma":[0.00008145713,0.00007410825,0.000034575398,0.000336668,0.000012253282,0.00021468346,0.000041766903,0.000053541033,0.0000698156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2090074e-7,0.000014400333,0.00012312514,0.0000010931276,0.0000024459105,0.0000012666877,0.000045850207,0.51672184,0.000010954812,0.4811662,0.0003977283,0.0015148431],"study_design_scores_gemma":[0.00012997896,0.000018728588,0.00009225789,0.0000026068558,9.1175406e-7,0.000002375108,0.0000024426552,0.9590078,0.0012994108,0.018523796,0.020795152,0.00012454789],"about_ca_topic_score_codex":0.0000018865422,"about_ca_topic_score_gemma":2.0308069e-7,"teacher_disagreement_score":0.84458447,"about_ca_system_score_codex":0.00001736473,"about_ca_system_score_gemma":0.0000402885,"threshold_uncertainty_score":0.30220464},"labels":[],"label_agreement":null},{"id":"W2128043581","doi":"10.1109/trustcom.2013.250","title":"Performance Evaluation of the Time Analysable On-Demand Coherent Cache","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Cache; Computer science; Predictability; Cache coherence; Cache algorithms; Parallel computing; CPU cache; Operating system; Statistics; Mathematics","score_opus":0.02381358641170845,"score_gpt":0.2606076804790735,"score_spread":0.23679409406736507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128043581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58885086,0.000044426837,0.2832355,0.0011210314,0.000121806464,0.00068370294,2.794055e-7,0.00027914334,0.1256633],"genre_scores_gemma":[0.98125607,0.0000037717064,0.016665239,0.00016670901,0.000009208369,0.000018002807,4.834896e-7,0.0000023421733,0.0018781632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991511,0.00010909595,0.00014076631,0.00013221956,0.0003758523,0.00009092713],"domain_scores_gemma":[0.9991809,0.000032080447,0.00008239244,0.0004202173,0.00026366155,0.000020728221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005869264,0.00005776067,0.00007395542,0.00004010886,0.00007296088,0.000042632408,0.0004905727,0.000024860696,0.00021114235],"category_scores_gemma":[0.000029475274,0.000034146757,0.000034017467,0.0002539731,0.00002055862,0.00016181446,0.00010386613,0.00004592007,0.00012403073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035017754,0.00024355284,0.009989124,0.000017868751,0.000059303547,7.112884e-8,0.0005515486,0.7591566,0.002318968,0.0073890593,0.09246189,0.12780853],"study_design_scores_gemma":[0.00009348551,0.000032696975,0.011063148,0.000012484433,0.0000050773206,4.276527e-7,0.0000014997928,0.9764403,0.011723838,0.0005095006,0.000070709764,0.000046850673],"about_ca_topic_score_codex":0.000027580072,"about_ca_topic_score_gemma":6.0103173e-7,"teacher_disagreement_score":0.39240524,"about_ca_system_score_codex":0.000026416603,"about_ca_system_score_gemma":0.000046243404,"threshold_uncertainty_score":0.23118606},"labels":[],"label_agreement":null},{"id":"W2128492880","doi":"10.1109/asic.2002.1158100","title":"A minimal source-synchronous interface","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Synchronous circuit; Computer science; Robustness (evolution); Clock skew; Transmitter; Initialization; Clock domain crossing; Simple (philosophy); Digital clock manager; Interface (matter); Clock signal; Electronic engineering; Computer network; Parallel computing; Telecommunications; Engineering; Jitter","score_opus":0.013057123780900546,"score_gpt":0.2520414088654783,"score_spread":0.23898428508457778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128492880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018988977,0.000079304475,0.9262657,0.0001624739,0.00008703574,0.00005011279,4.9608207e-8,0.0008318437,0.07062459],"genre_scores_gemma":[0.5295732,0.0000032547312,0.46755734,0.00020245982,0.000007487126,0.000002773768,9.579981e-8,0.0000035472112,0.0026498146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932545,0.000054267584,0.00012570832,0.00022203776,0.00009576218,0.00017676389],"domain_scores_gemma":[0.9995199,0.00003594344,0.000034640347,0.00031590887,0.00003811391,0.000055523422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016988894,0.000081191596,0.000080699465,0.000058372,0.00007043617,0.00010459597,0.00042811397,0.000034860263,0.00006355289],"category_scores_gemma":[0.000042714713,0.00007209395,0.000033984576,0.00018879991,0.00001877904,0.00014039542,0.00009200703,0.00006259262,0.00010919234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009467663,0.00044273812,0.0016223146,0.000025365263,0.000055775017,0.000022128728,0.0033871438,0.04876986,0.0013816874,0.7033517,0.09917446,0.14175735],"study_design_scores_gemma":[0.00039712508,0.00022954705,0.00012899439,0.000018076624,0.0000031393954,0.00009655219,0.000046239496,0.73444265,0.05864578,0.0044518164,0.20105894,0.00048114368],"about_ca_topic_score_codex":0.000006847826,"about_ca_topic_score_gemma":7.4597887e-7,"teacher_disagreement_score":0.69889987,"about_ca_system_score_codex":0.000019440837,"about_ca_system_score_gemma":0.000036789497,"threshold_uncertainty_score":0.29399058},"labels":[],"label_agreement":null},{"id":"W2128714872","doi":"10.1007/s11227-014-1263-1","title":"A comparative simulation study on the power–performance of multi-core architecture","year":2014,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multi-core processor; Pipeline (software); Thread (computing); Laptop; Parallel computing; Microarchitecture; Power consumption; Multiprocessing; Embedded system; Instruction-level parallelism; Chip; Power (physics); Computer architecture; Parallelism (grammar); Operating system","score_opus":0.05907143284523812,"score_gpt":0.31438640329547873,"score_spread":0.2553149704502406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128714872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5308968,0.000020117077,0.46861473,0.00015552797,0.00006988226,0.00011147189,1.0357011e-7,0.000025521893,0.000105870495],"genre_scores_gemma":[0.9758056,0.0000022298677,0.023942923,0.00017117518,0.000065770495,4.62458e-7,1.05201906e-7,0.000006047376,0.000005683357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834913,0.0004986365,0.000498719,0.00011183044,0.0003840295,0.00015768297],"domain_scores_gemma":[0.99751085,0.0013502629,0.0004305998,0.0003945514,0.00027893746,0.000034820547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025536506,0.0001351613,0.00027709152,0.00012252238,0.00027687382,0.00004720554,0.0010924421,0.000029640283,0.0000017475036],"category_scores_gemma":[0.00012905669,0.00006828113,0.00007592831,0.00034364802,0.00006367365,0.00014099409,0.00017765902,0.00039322392,0.0000025436082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025562043,0.00015619962,0.0020196587,0.00000361181,0.000027972816,5.149315e-7,0.014652781,0.9796509,0.0002754879,0.00039750087,0.000041805368,0.0027480132],"study_design_scores_gemma":[0.00033671764,0.0010274791,0.014166012,0.000099509096,0.000010687866,0.000020134064,0.0005470436,0.9823085,0.0011774398,0.00018555216,0.000038302733,0.00008258821],"about_ca_topic_score_codex":0.000005147453,"about_ca_topic_score_gemma":6.34242e-7,"teacher_disagreement_score":0.44490883,"about_ca_system_score_codex":0.00002029578,"about_ca_system_score_gemma":0.00002955996,"threshold_uncertainty_score":0.27844235},"labels":[],"label_agreement":null},{"id":"W2128841495","doi":"10.14778/2021017.2021019","title":"PLP","year":2011,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"European Social Fund; National Science Foundation","keywords":"Computer science; Heap (data structure); Thread (computing); Parallel computing; Multi-core processor; Distributed computing; Operating system; Programming language","score_opus":0.026744184673494705,"score_gpt":0.21851641650143064,"score_spread":0.19177223182793593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128841495","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06933273,0.00027652807,0.38408816,0.0019861695,0.0008628227,0.0009628427,0.0000015403064,0.0015047342,0.54098445],"genre_scores_gemma":[0.82586116,0.000013854468,0.1735776,0.00015295338,0.000014751211,0.000012324723,3.945117e-8,0.000004064053,0.00036324473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99936455,0.0000034711936,0.00015727594,0.00015996094,0.00017972845,0.00013503247],"domain_scores_gemma":[0.99955815,0.000007979255,0.0001412382,0.00014792358,0.000113146045,0.000031583037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018697054,0.000074509335,0.00008527818,0.00004808853,0.00006868244,0.000028317749,0.0011514993,0.000024265988,0.000008298649],"category_scores_gemma":[0.000027458738,0.000049644914,0.000058008296,0.00023107271,0.000033825057,0.00016756315,0.00044017215,0.000060735605,0.000006103824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013600292,0.00028484728,0.007944267,0.000059084818,0.000045798482,5.389159e-7,0.005714772,0.000050451155,0.008959356,0.94450206,0.018187206,0.014238011],"study_design_scores_gemma":[0.0003082726,0.00014396335,0.00544449,0.00008325943,0.000010794391,0.000016108634,0.000055217664,0.012080151,0.9155323,0.06267099,0.003427803,0.00022663485],"about_ca_topic_score_codex":0.000019592939,"about_ca_topic_score_gemma":1.3855889e-7,"teacher_disagreement_score":0.90657294,"about_ca_system_score_codex":0.000018631561,"about_ca_system_score_gemma":0.000012581571,"threshold_uncertainty_score":0.21397914},"labels":[],"label_agreement":null},{"id":"W2129008814","doi":"10.1109/ipdps.2013.105","title":"GPU-based Runtime Verification","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Exploit; Multi-core processor; Runtime verification; Set (abstract data type); Instruction set; Parallel computing; Embedded system; Formal verification; Operating system; Programming language","score_opus":0.012074650450631972,"score_gpt":0.23027766478750408,"score_spread":0.21820301433687211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129008814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094117376,0.0000099481,0.9726161,0.0014883232,0.000051255607,0.00009940591,5.1185626e-8,0.0009885789,0.02380518],"genre_scores_gemma":[0.46886584,0.0000010347334,0.52956975,0.000712777,0.000009888214,0.000015305943,0.0000014186296,0.0000023866846,0.0008216158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995208,0.000022887,0.00009849693,0.0001613438,0.00009381245,0.000102663944],"domain_scores_gemma":[0.9994725,0.000024000306,0.000033333068,0.00035013913,0.00008272672,0.0000373201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008354589,0.000052396663,0.000048296224,0.00005701033,0.000058789483,0.00014408692,0.00041023226,0.00002725536,0.0001231789],"category_scores_gemma":[0.000012685827,0.00004524222,0.000021781276,0.0001882551,0.0000114691275,0.0002524017,0.000042506508,0.000033863114,0.00060988916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027353271,0.00032377176,0.0022789275,0.000021226973,0.00001850758,0.0000022652616,0.00032084677,0.031728197,0.006343896,0.42982984,0.30773234,0.22139744],"study_design_scores_gemma":[0.000067601766,0.000018505649,0.0023471313,0.0000027805493,4.2378198e-7,5.5625384e-7,0.0000010487504,0.9829898,0.009007214,0.0022011322,0.0032825633,0.000081229286],"about_ca_topic_score_codex":0.000042181768,"about_ca_topic_score_gemma":2.2189037e-7,"teacher_disagreement_score":0.95126164,"about_ca_system_score_codex":0.000011260853,"about_ca_system_score_gemma":0.000022860484,"threshold_uncertainty_score":0.78390944},"labels":[],"label_agreement":null},{"id":"W2129170722","doi":"10.1109/iwrsp.2000.855196","title":"Hardware/software co-design of a Java virtual machine","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; strictfp; Operating system; Software; Virtual machine; Embedded Java; Real time Java; Embedded system; Virtual finite-state machine; Software design; Java concurrency; Software engineering; Software development","score_opus":0.03158429737880506,"score_gpt":0.2535042170879285,"score_spread":0.22191991970912342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129170722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005749328,0.00012056342,0.99205035,0.00019912027,0.0000543563,0.00010240242,0.0000016792321,0.0008840889,0.0065299612],"genre_scores_gemma":[0.16948201,0.000044111548,0.8263373,0.00034527184,0.000016020174,0.0000047306085,0.00000162749,0.0000075112034,0.0037614407],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911743,0.000075036376,0.00021842825,0.0002285695,0.00020383853,0.00015671866],"domain_scores_gemma":[0.9992532,0.000117786054,0.00008187805,0.00041217922,0.000078546254,0.00005641384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019580235,0.00010297864,0.00014933234,0.00010860041,0.00006303917,0.000047406997,0.00067290466,0.000047368994,0.00022330711],"category_scores_gemma":[0.00006461454,0.00008922826,0.000045905716,0.00026067157,0.000032844087,0.00018158485,0.00011754526,0.00007293209,0.00007792196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020497702,0.00075454975,0.0016317132,0.00004137429,0.00008625546,0.000041040177,0.0024319156,0.16813405,0.000907145,0.09280793,0.4623823,0.27076125],"study_design_scores_gemma":[0.00019605133,0.0002001407,0.000059537917,0.000012764846,0.0000019026024,0.00001059795,0.0000026464477,0.98966926,0.0064315707,0.00057720847,0.002692589,0.00014572065],"about_ca_topic_score_codex":0.0000143548505,"about_ca_topic_score_gemma":2.6322957e-7,"teacher_disagreement_score":0.8215352,"about_ca_system_score_codex":0.000013085595,"about_ca_system_score_gemma":0.000013060607,"threshold_uncertainty_score":0.36386228},"labels":[],"label_agreement":null},{"id":"W2129568741","doi":"","title":"A Formal Analysis of the Will-Retire Correctness Statement","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Correctness; Statement (logic); Computer science; Programming language; Continuation; Formal methods; Law","score_opus":0.01796330728846217,"score_gpt":0.2484201289033791,"score_spread":0.23045682161491693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129568741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097412495,0.000026536964,0.9794266,0.00048805284,0.0000800725,0.00006468899,7.5521933e-7,0.00015197786,0.010020021],"genre_scores_gemma":[0.9573018,0.0000128137,0.040861443,0.00022277934,0.000004048347,0.0000035854882,5.517566e-7,0.0000016398994,0.0015913381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993301,0.000041458898,0.00019211821,0.00012811969,0.00018336745,0.00012483851],"domain_scores_gemma":[0.9993757,0.000029015151,0.00009782566,0.00040774018,0.00006686966,0.000022822278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000164225,0.000056557175,0.0001133783,0.00010995616,0.000082537124,0.000034762215,0.00061446,0.000019054612,0.00007744066],"category_scores_gemma":[0.000011877564,0.000035297413,0.00009733938,0.0012400093,0.000024923818,0.00020823338,0.00021960885,0.000037729686,0.0000025736208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060023112,0.0004863466,0.028416011,0.000028526156,0.0009572581,0.0000034936338,0.0062234644,0.59313697,0.00009526124,0.1861792,0.062445663,0.12202178],"study_design_scores_gemma":[0.0000508442,0.000017344966,0.0023507203,0.0000038396947,0.00002708919,5.473797e-7,0.000009172632,0.99580187,0.00088433584,0.00010854735,0.0006927771,0.000052915944],"about_ca_topic_score_codex":0.000023331788,"about_ca_topic_score_gemma":0.000007898245,"teacher_disagreement_score":0.94756055,"about_ca_system_score_codex":0.000014411098,"about_ca_system_score_gemma":0.000007234236,"threshold_uncertainty_score":0.14393866},"labels":[],"label_agreement":null},{"id":"W2129832837","doi":"10.1109/ispa.2008.127","title":"Computation with Energy-Time Trade-Offs: Models, Algorithms and Lower-Bounds","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computation; Sorting; Energy consumption; Energy (signal processing); Simple (philosophy); Parallel computing; Multiplication (music); Algorithm; Power (physics); Model of computation; Upper and lower bounds; Computer engineering; Mathematics; Engineering","score_opus":0.017891519943680573,"score_gpt":0.22238641218182695,"score_spread":0.20449489223814638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129832837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015610813,0.000099226854,0.9875363,0.00046870357,0.0000388044,0.000057353034,4.983798e-7,0.000896323,0.0093417],"genre_scores_gemma":[0.42047447,0.000059313024,0.57834613,0.00035618714,0.000023211644,0.0000044107524,0.000004135947,0.000008407505,0.0007237598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990419,0.00003916355,0.00016164494,0.00034732453,0.00022220207,0.00018775059],"domain_scores_gemma":[0.9995422,0.000043137512,0.00006034334,0.00021235083,0.000052740204,0.000089277375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009091011,0.00014134852,0.00014893903,0.000103180464,0.0002259357,0.00010717999,0.00027009437,0.00005461303,0.0000034221655],"category_scores_gemma":[0.000002236027,0.000114757684,0.000024655552,0.00029259166,0.00007778017,0.00051454897,0.00008899097,0.00006408715,0.0000037820712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055229815,0.000581529,0.000264952,0.000024547287,0.00011557528,0.00021007237,0.0029411565,0.5713622,0.00017865126,0.17715608,0.038604435,0.20850556],"study_design_scores_gemma":[0.00024989445,0.0001833073,0.000116692914,0.000009742436,0.000002288891,0.00016389591,0.0000027081874,0.9940868,0.00029170426,0.004173434,0.0005346688,0.0001848448],"about_ca_topic_score_codex":0.000044331253,"about_ca_topic_score_gemma":0.0000016523112,"teacher_disagreement_score":0.4227246,"about_ca_system_score_codex":0.000019544987,"about_ca_system_score_gemma":0.00005373002,"threshold_uncertainty_score":0.46796826},"labels":[],"label_agreement":null},{"id":"W2130556244","doi":"10.5555/2190025.2190053","title":"LAR-CC: Large atomic regions with conditional commits","year":2011,"lang":"en","type":"article","venue":"Symposium on Code Generation and Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Commit; Binary translation; Parallel computing; Scope (computer science); Code (set theory); Binary number; Binary code; Programming language; Software; Arithmetic; Database; Mathematics","score_opus":0.029407373508788366,"score_gpt":0.23905799977012915,"score_spread":0.2096506262613408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130556244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007004389,0.00003107264,0.992316,0.0011667145,0.00012241743,0.00022119905,0.00001289892,0.00044122193,0.004988027],"genre_scores_gemma":[0.48972344,0.00016803801,0.50756186,0.0016578386,0.00009061211,0.000041828527,0.00023769824,0.000019823543,0.00049883715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883735,0.00011270837,0.0002268943,0.00040853716,0.00021402696,0.00020047916],"domain_scores_gemma":[0.99920154,0.000025140098,0.00013727936,0.00033503506,0.00020072688,0.000100255034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002051293,0.00017295135,0.00013586179,0.00017085296,0.00042002846,0.00016203895,0.00023232696,0.00009376367,0.000020619822],"category_scores_gemma":[0.000010697082,0.00015534,0.00002875005,0.000273297,0.000045489476,0.00043991813,0.000064662556,0.000104922416,0.000012194336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003054897,0.00048194482,0.00027062383,0.0000080817545,0.000026129535,0.0000058325036,0.0010109936,0.40156323,0.00015415279,0.59061426,0.005555693,0.00027851315],"study_design_scores_gemma":[0.0011795311,0.00020331416,0.000098410484,0.000016409385,0.00000904057,0.00002293843,0.000010908284,0.9934461,0.002581116,0.0009164633,0.00128898,0.0002267751],"about_ca_topic_score_codex":0.000005383429,"about_ca_topic_score_gemma":0.000017732687,"teacher_disagreement_score":0.5918829,"about_ca_system_score_codex":0.00003334844,"about_ca_system_score_gemma":0.000059680176,"threshold_uncertainty_score":0.63345814},"labels":[],"label_agreement":null},{"id":"W2131604462","doi":"10.1109/eit.2009.5189659","title":"UWindsor Nios II: A soft-core processor for design space exploration","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"MicroBlaze; Field-programmable gate array; Computer science; Nios II; Embedded system; Pipeline (software); Flexibility (engineering); Design space exploration; Software; Coprocessor; Processor design; Instruction set; ARM architecture; Multi-core processor; Computer architecture; Operating system; Computer hardware","score_opus":0.0686500593610418,"score_gpt":0.2969703880102369,"score_spread":0.2283203286491951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131604462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001166568,0.000033660202,0.99216264,0.004559369,0.00006065441,0.0005405667,3.6177465e-7,0.001285077,0.0012409865],"genre_scores_gemma":[0.1337823,0.0000069525518,0.8631963,0.0009552089,0.000057742636,0.000061623374,0.000003236408,0.000006352421,0.0019302617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908745,0.000023658251,0.00018112558,0.00032971127,0.00015379649,0.00022425297],"domain_scores_gemma":[0.9992992,0.00006447342,0.00008886418,0.00029911767,0.00018773518,0.00006057182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002966576,0.00012600422,0.00012371906,0.00010047108,0.00025323758,0.0001422417,0.00050613383,0.00006412464,0.000003848391],"category_scores_gemma":[0.00009415647,0.00010983899,0.000046836034,0.00032640045,0.000010742983,0.00066594745,0.000053409716,0.000054111504,0.0000091337915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010775743,0.00062889647,0.000035268076,0.00004923181,0.000025582445,0.0000054638363,0.0052181436,0.13713796,0.004061738,0.38419577,0.20461103,0.26392314],"study_design_scores_gemma":[0.00027497503,0.00052882096,0.00001993707,0.000017173397,0.0000029169437,0.0000037634763,0.000012045465,0.9218962,0.01887742,0.055577748,0.0025932586,0.00019571038],"about_ca_topic_score_codex":0.0000015321631,"about_ca_topic_score_gemma":5.3198227e-7,"teacher_disagreement_score":0.78475827,"about_ca_system_score_codex":0.000022587392,"about_ca_system_score_gemma":0.000074974014,"threshold_uncertainty_score":0.4479104},"labels":[],"label_agreement":null},{"id":"W2131946149","doi":"10.1109/rsp.2005.26","title":"High Level Synthesis for Data-Driven Applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Compiler; Von Neumann architecture; Interfacing; High-level synthesis; Computer architecture; Asynchronous communication; Parallel computing; Software pipelining; Context (archaeology); Programming language; Instruction set; Computer hardware; Field-programmable gate array","score_opus":0.0571300661316192,"score_gpt":0.2893933205075606,"score_spread":0.23226325437594142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131946149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018532695,0.000015379846,0.9944688,0.0009332696,0.00003188551,0.00023332257,0.000025725556,0.00074137724,0.0035316774],"genre_scores_gemma":[0.07316222,0.000003321653,0.92530984,0.0001374369,0.00007571489,0.00015243232,0.00004612758,0.000005247289,0.0011076797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932754,0.000013671878,0.00014462422,0.00030429347,0.0000824984,0.00012734288],"domain_scores_gemma":[0.9988375,0.00017140953,0.00005003157,0.0008497622,0.00006794676,0.00002338171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013663064,0.0000659382,0.00008323898,0.000053444604,0.00012782859,0.00009843383,0.0012638855,0.000031394487,0.000006816517],"category_scores_gemma":[0.000019321877,0.00005961683,0.000023121227,0.00016326185,0.000015138916,0.00020983702,0.00025113285,0.000024610903,0.00002151514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0231964e-7,0.000072622395,0.000058206864,0.000007705917,0.00000717107,2.2314998e-7,0.00000575859,0.011308411,0.00007703792,0.82948405,0.109100506,0.049877387],"study_design_scores_gemma":[0.00007248593,0.000008832043,0.00022779337,0.0000036246595,0.00000471804,0.0000017248233,8.123418e-7,0.92883676,0.003377446,0.01856545,0.048771463,0.00012886336],"about_ca_topic_score_codex":0.00013350375,"about_ca_topic_score_gemma":0.000012455808,"teacher_disagreement_score":0.9175284,"about_ca_system_score_codex":0.000012031066,"about_ca_system_score_gemma":0.000027409744,"threshold_uncertainty_score":0.24311036},"labels":[],"label_agreement":null},{"id":"W2132026091","doi":"10.1109/pacrim.2009.5291405","title":"An OpenMP-based circuit design tool: Customizable bit-width","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Compiler; Benchmark (surveying); Computer architecture; Abstraction; Register-transfer level; Set (abstract data type); Implementation; Abstraction layer; High-level synthesis; Embedded system; Logic synthesis; Parallel computing; Software; Programming language; Field-programmable gate array; Logic gate; Algorithm","score_opus":0.03539882415226925,"score_gpt":0.2727662482813797,"score_spread":0.23736742412911044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132026091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001672663,0.000023301312,0.979594,0.00048187873,0.000069592876,0.00021205914,2.906198e-7,0.002255701,0.017195934],"genre_scores_gemma":[0.33420116,0.0000034326417,0.6620911,0.0029933199,0.000026246917,0.000005509548,0.0000024517935,0.0000061812416,0.00067065796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865454,0.00014205718,0.00023204445,0.0004330523,0.00022457229,0.0003137283],"domain_scores_gemma":[0.9988407,0.000066360444,0.000071057795,0.000803114,0.000105064144,0.000113702954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005924268,0.00015518127,0.00016640965,0.00015639402,0.00017545356,0.00041043444,0.0012668902,0.00007471124,0.000052148764],"category_scores_gemma":[0.000029115787,0.0001393023,0.000049485112,0.00049633055,0.000018659628,0.00063707004,0.000044212196,0.00009710341,0.00006988719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152056855,0.0003090252,0.00010794851,0.0000045902916,0.0000074943814,0.00002299646,0.00014805413,0.71783054,0.0013735978,0.11343795,0.042563017,0.12417961],"study_design_scores_gemma":[0.00028766642,0.00029660022,0.00020976807,0.000009696375,0.0000022060567,0.0000047290227,0.0000012518703,0.9731441,0.013030955,0.010901275,0.0018640537,0.00024766548],"about_ca_topic_score_codex":0.00002216379,"about_ca_topic_score_gemma":5.0965895e-7,"teacher_disagreement_score":0.33403388,"about_ca_system_score_codex":0.000050373706,"about_ca_system_score_gemma":0.00017908172,"threshold_uncertainty_score":0.56805825},"labels":[],"label_agreement":null},{"id":"W2133198237","doi":"10.1109/icassp.1985.1168084","title":"Software techniques for programming a general purpose data flow signal processor","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Data flow diagram; Programmer; Pipeline (software); Reactive programming; Parallel computing; Programming language; Programming paradigm; SIGNAL (programming language); Visual programming language; Stream processing; Software; Computer architecture; Computation; Signal processing; Inductive programming; Computer hardware; Digital signal processing; Database","score_opus":0.036347375892238847,"score_gpt":0.30344889988053786,"score_spread":0.267101523988299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133198237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032373562,0.000106457905,0.9941117,0.0009777356,0.00003515323,0.0006994561,0.000009095139,0.003700919,0.00032708907],"genre_scores_gemma":[0.0031484733,0.000009872081,0.99456096,0.00068089925,0.00027516493,0.00019127825,0.00006515161,0.000017040758,0.0010511514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985333,0.00002753215,0.00027552247,0.00060470036,0.0002062974,0.00035264943],"domain_scores_gemma":[0.99870175,0.000060590904,0.000093291885,0.00086540205,0.00019217293,0.0000867819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004729815,0.00016718046,0.00016368956,0.00011108585,0.00019383284,0.00033445793,0.0020684297,0.00008222727,0.000010311911],"category_scores_gemma":[0.0000785569,0.00014548359,0.00004865406,0.0002857438,0.00002921136,0.0009244453,0.0006514742,0.000093037175,0.000007278432],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004622997,0.000078853016,0.000029341172,0.000020890719,0.0000073406227,9.852739e-7,0.00007413375,0.0009971476,0.00004786028,0.0020525032,0.017737795,0.97894853],"study_design_scores_gemma":[0.00012622296,0.000090463116,0.0000039386346,0.000018410095,0.0000041091266,0.0000115164285,0.0000017141198,0.77230656,0.010035504,0.0006372832,0.21655542,0.00020885457],"about_ca_topic_score_codex":0.000007301041,"about_ca_topic_score_gemma":0.0000079217025,"teacher_disagreement_score":0.9787397,"about_ca_system_score_codex":0.000031010462,"about_ca_system_score_gemma":0.000109200504,"threshold_uncertainty_score":0.5932649},"labels":[],"label_agreement":null},{"id":"W2133256841","doi":"10.1109/cscwd.2001.942272","title":"A data-centric distributed framework for MDO management","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Compute Canada","funders":"","keywords":"Executable; Computer science; Server; Software deployment; Architecture; Distributed computing; Distributed Computing Environment; Distributed database; Software engineering; Operating system","score_opus":0.05539102448140784,"score_gpt":0.29503466190146543,"score_spread":0.2396436374200576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133256841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064808737,0.000115317016,0.9925499,0.0013173085,0.00012532527,0.00023899252,0.000022424947,0.0008820976,0.004742131],"genre_scores_gemma":[0.020040048,0.000086300264,0.97838056,0.00053586403,0.00003647576,0.000019645662,0.00004806588,0.0000052024925,0.00084786466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991255,0.000018291401,0.00015190532,0.0003614378,0.00012929675,0.00021360135],"domain_scores_gemma":[0.9987589,0.00008955411,0.000049306338,0.0010099428,0.00003920891,0.00005306269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015250027,0.00008455783,0.000087579014,0.000068058405,0.000108743174,0.00015169218,0.0014950805,0.000041359202,0.00004718205],"category_scores_gemma":[0.000042742155,0.00007505666,0.00002854611,0.00041888736,0.00001059188,0.00021419313,0.0005547542,0.00005355498,0.000047417332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012600575,0.000105936146,0.000034775352,0.0000148774025,0.000021992148,0.0000044494045,0.00003183478,0.0011480615,2.8810229e-7,0.6836197,0.25298217,0.06203465],"study_design_scores_gemma":[0.00013165855,0.000020468255,0.000043028398,0.000010574611,0.0000043967766,0.0000018979664,0.000002769824,0.87610114,0.00003133921,0.018733844,0.1048112,0.00010770841],"about_ca_topic_score_codex":0.0000012172744,"about_ca_topic_score_gemma":1.8911582e-7,"teacher_disagreement_score":0.87495303,"about_ca_system_score_codex":0.000018251087,"about_ca_system_score_gemma":0.0000029741993,"threshold_uncertainty_score":0.30607218},"labels":[],"label_agreement":null},{"id":"W2133331749","doi":"10.1088/1742-6596/256/1/012018","title":"Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Branch and bound; Integer programming; Computer science; Branch and cut; Parallel computing; Integer (computer science); Tree (set theory); Branch and price; Linear programming; Parallel algorithm; Algorithm; Upper and lower bounds; Shared memory; Mathematics; Combinatorics","score_opus":0.03490018657931901,"score_gpt":0.31873918592401207,"score_spread":0.28383899934469303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133331749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09004052,0.00004879392,0.9087112,0.00076940237,0.00017674163,0.000083581406,0.000006939004,0.000040060746,0.00012277237],"genre_scores_gemma":[0.65466243,0.00007900358,0.34501553,0.000041121963,0.00016520612,0.0000018805014,0.000002707367,0.0000049066975,0.000027231144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903977,0.000055679917,0.0003890698,0.0001605252,0.00019297279,0.00016197024],"domain_scores_gemma":[0.9989403,0.00008051935,0.00038073093,0.0001734699,0.00031051732,0.00011445139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029182067,0.00013267495,0.00030293228,0.00006279655,0.00022525144,0.000631919,0.00038503075,0.000049166076,0.000007326944],"category_scores_gemma":[0.000022586415,0.0001196334,0.000035885387,0.00013980053,0.00014215244,0.0012631005,0.00018961175,0.00028563957,8.9660585e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020230922,0.00010312854,0.013012545,0.00003427627,0.00011716229,0.000006221884,0.005065263,0.00016512151,0.008504388,0.14898883,0.0013693941,0.8226134],"study_design_scores_gemma":[0.0044983476,0.002608922,0.11066892,0.00026843615,0.00019737173,0.00050627114,0.0010700325,0.05886628,0.183867,0.62457633,0.011090325,0.0017817824],"about_ca_topic_score_codex":0.000021684722,"about_ca_topic_score_gemma":0.000015119419,"teacher_disagreement_score":0.82083166,"about_ca_system_score_codex":0.0000069875514,"about_ca_system_score_gemma":0.00014565198,"threshold_uncertainty_score":0.609361},"labels":[],"label_agreement":null},{"id":"W2133640365","doi":"10.1109/tpds.2004.1264797","title":"The impact of negative acknowledgments in shared memory scientific applications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec; National Science Foundation","keywords":"Computer science; Scalability; Node (physics); Protocol (science); Speedup; Computer network; Distributed computing; Shared memory; Asynchronous communication; Parallel computing; Operating system","score_opus":0.018345297096279828,"score_gpt":0.27642605061293735,"score_spread":0.2580807535166575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133640365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053958152,0.00023344904,0.99314785,0.00007481889,0.00018060733,0.0005440629,0.000103343125,0.0001257998,0.00019427633],"genre_scores_gemma":[0.9967735,0.00005008281,0.0028037536,0.0000036566996,0.0000093085755,0.00020965781,0.000011374546,0.0000055044025,0.00013318931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988233,0.000086475615,0.00036276347,0.0003162396,0.00018820837,0.00022301164],"domain_scores_gemma":[0.99904037,0.00012998321,0.00013751577,0.00044207062,0.00016472927,0.000085307656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030922948,0.000143604,0.00018724779,0.00015064668,0.00047178328,0.00026732738,0.00045109776,0.00006653272,0.0000015735349],"category_scores_gemma":[0.000007910365,0.000102775964,0.00008970434,0.00080087455,0.00012127968,0.00022079515,0.000005900219,0.00014082211,0.000010590102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017573491,0.00017983648,0.000031144216,0.000012012048,0.000028064253,9.0370474e-7,0.000339691,0.99665445,0.00012923377,0.001262118,0.00019305729,0.0011519324],"study_design_scores_gemma":[0.0036302416,0.00045582541,0.0030433992,0.00032720107,0.000023349041,0.000037597663,0.00047926762,0.9811731,0.0026395486,0.0072086453,0.00035629564,0.00062555465],"about_ca_topic_score_codex":0.00028061264,"about_ca_topic_score_gemma":0.00003622411,"teacher_disagreement_score":0.99137765,"about_ca_system_score_codex":0.00013878742,"about_ca_system_score_gemma":0.00014052456,"threshold_uncertainty_score":0.41910824},"labels":[],"label_agreement":null},{"id":"W2134015534","doi":"10.1109/newcas.2007.4488016","title":"A single-chip ring-based multiprocessor with region-level filtering of coherence traffic","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache coherence; Multiprocessing; MESI protocol; MESIF protocol; Cache; Bus sniffing; Directory; Embedded system; Coherence (philosophical gambling strategy); Parallel computing; Computer hardware; Computer architecture; Cache algorithms; CPU cache; Operating system","score_opus":0.05126550534332087,"score_gpt":0.25851720089501046,"score_spread":0.2072516955516896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134015534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051633246,0.000018786015,0.94489056,0.000084253545,0.000030589777,0.00011617653,3.3574082e-7,0.00061374466,0.002612312],"genre_scores_gemma":[0.5651569,3.5280706e-7,0.4346293,0.00007767984,0.0000073698316,0.0000024694098,4.8655306e-7,0.000005168318,0.00012031216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989698,0.00002008413,0.0002548892,0.00029660115,0.00021863692,0.00023997373],"domain_scores_gemma":[0.99909675,0.00014871523,0.00015560423,0.00036581352,0.00016125233,0.00007184145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002755542,0.00012978594,0.00015379881,0.0001509324,0.00007096117,0.000053355474,0.00057717925,0.000048886028,0.0000036428805],"category_scores_gemma":[0.00004067885,0.000105294246,0.00003424793,0.0004715236,0.000059722493,0.00016786186,0.00006538346,0.00008183215,0.0000020746245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023720591,0.0010869075,0.0040536225,0.00030608475,0.000053354677,0.00012822785,0.002416357,0.73154294,0.009081215,0.006899916,0.0007997299,0.24339445],"study_design_scores_gemma":[0.0006191575,0.00035361014,0.0015078889,0.00018045453,0.0000035824035,0.000026723463,0.000019706908,0.85296535,0.14381723,0.00006800118,0.00016079975,0.00027750226],"about_ca_topic_score_codex":0.000018046225,"about_ca_topic_score_gemma":0.00002744895,"teacher_disagreement_score":0.51352364,"about_ca_system_score_codex":0.000023177703,"about_ca_system_score_gemma":0.00006159317,"threshold_uncertainty_score":0.42937747},"labels":[],"label_agreement":null},{"id":"W2134101883","doi":"10.1109/ispass.2010.5452029","title":"Visualizing complex dynamics in many-core accelerator architectures","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Computer science; Bottleneck; Graphics; Multi-core processor; Software; Visualization; General-purpose computing on graphics processing units; Code (set theory); CUDA; Set (abstract data type); Supercomputer; Speedup; Architecture; Computer architecture; Process (computing); Instruction set; Microarchitecture; Graphics hardware; Parallel computing; Embedded system; Operating system; Programming language","score_opus":0.032938317521954315,"score_gpt":0.31321146906598674,"score_spread":0.28027315154403243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134101883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17464533,0.0000057050397,0.8124469,0.00058037136,0.00014869418,0.0001053979,6.368286e-7,0.0007554804,0.011311514],"genre_scores_gemma":[0.6730192,0.0000021966275,0.32649174,0.00039302034,0.000024700645,0.0000041965536,0.0000024580424,0.000005689208,0.00005680894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991253,0.000026143125,0.0001975164,0.00028430656,0.00013900646,0.0002277134],"domain_scores_gemma":[0.9993969,0.000056111254,0.000051472034,0.00039121386,0.00004207591,0.000062215295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016401148,0.000115786206,0.00013329378,0.00019618093,0.00007718129,0.00015623849,0.0008009624,0.000066984976,0.00002120182],"category_scores_gemma":[0.00002603669,0.00010359775,0.00003453442,0.00035330353,0.000030555686,0.00009626682,0.00026027154,0.0002637302,0.000012435382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060203965,0.00015382953,0.027949413,0.000019908208,0.000008851975,0.000025842215,0.0007332342,0.0068728235,0.0034109137,0.91439843,0.002226785,0.04419397],"study_design_scores_gemma":[0.00012297527,0.000019896626,0.0056975465,0.000006107006,4.602906e-7,0.000010074182,0.000019529349,0.9867587,0.0009605259,0.0056625106,0.0005847167,0.00015696019],"about_ca_topic_score_codex":0.00017509467,"about_ca_topic_score_gemma":0.00131895,"teacher_disagreement_score":0.9798859,"about_ca_system_score_codex":0.000029782508,"about_ca_system_score_gemma":0.000028436914,"threshold_uncertainty_score":0.42245933},"labels":[],"label_agreement":null},{"id":"W2134290033","doi":"10.1109/asap.2006.20","title":"Buffer and register allocation for memory space optimization","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Register allocation; Write buffer; Buffer (optical fiber); Cache; Unix; Memory hierarchy; Processor register; Parallel computing; Factor (programming language); CPU cache; Embedded system; Operating system; Cache algorithms; Memory address; Semiconductor memory; Programming language","score_opus":0.011708385252017554,"score_gpt":0.23769097630993324,"score_spread":0.22598259105791568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134290033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021823002,0.00006354145,0.98717314,0.0021520373,0.00005855168,0.00019147333,2.5210605e-7,0.0004329693,0.009709804],"genre_scores_gemma":[0.078781046,0.000011180757,0.91568744,0.00030281997,0.000049490427,0.000020130798,0.000008282813,0.0000059125414,0.0051336926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946195,0.000019102537,0.00012172935,0.00021720405,0.00007436296,0.00010566135],"domain_scores_gemma":[0.99957836,0.000044855577,0.000053856,0.00020736203,0.000097405566,0.000018164168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015657397,0.00006989322,0.00006825191,0.000062448154,0.00008885001,0.0001262541,0.0001567174,0.000041721316,0.0000035677274],"category_scores_gemma":[0.000016250378,0.000063959145,0.000019352223,0.00010963937,0.000017432927,0.00024987265,0.000053091222,0.00002312141,0.0000015974666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066238044,0.000048127677,0.00013018781,0.000022113245,0.0000052818405,5.0032435e-7,0.00010981811,0.5751093,0.0002037728,0.37197545,0.04531909,0.007069744],"study_design_scores_gemma":[0.00017786822,0.000027867836,0.00012872346,0.000005532884,0.0000020979296,0.0000036148547,0.0000028244467,0.99032676,0.0024375394,0.004657789,0.0021312938,0.00009811317],"about_ca_topic_score_codex":0.000036416423,"about_ca_topic_score_gemma":0.000003800891,"teacher_disagreement_score":0.41521743,"about_ca_system_score_codex":0.0000141107785,"about_ca_system_score_gemma":0.000014023524,"threshold_uncertainty_score":0.26081783},"labels":[],"label_agreement":null},{"id":"W2134616937","doi":"10.1145/1596655.1596670","title":"Automatic parallelization for graphics processing units","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Speedup; Just-in-time compilation; Graphics; Control flow; Compiler; General-purpose computing on graphics processing units; Bytecode; Java; CUDA; Java bytecode; Optimizing compiler; Programming language; Operating system; Java applet; Java annotation","score_opus":0.029844820874824582,"score_gpt":0.28504266557077446,"score_spread":0.25519784469594986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134616937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005104882,0.000055528883,0.9944016,0.0011178356,0.000033432803,0.00018452152,1.588262e-7,0.0015332216,0.0021632474],"genre_scores_gemma":[0.39756832,0.000009028553,0.6010585,0.0011687275,0.000018205628,0.000008088861,0.000004370506,0.0000032122418,0.00016156153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993759,0.000019545272,0.00016333147,0.00018181995,0.00010911856,0.0001503273],"domain_scores_gemma":[0.9994466,0.000030558916,0.00006905458,0.0001916571,0.00022315979,0.00003897503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001750418,0.000079079924,0.00008419309,0.000107862914,0.00015728899,0.00016229824,0.00036349276,0.00004341835,0.000002171992],"category_scores_gemma":[0.000056535377,0.0000701975,0.000022834065,0.00065294985,0.000009159027,0.0003221915,0.000022670414,0.000035587076,0.0000020202813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016044806,0.00005262313,0.000041888547,0.000024364526,0.0000032919543,6.5198867e-7,0.00034554282,0.005638873,0.0000462345,0.5426624,0.007365261,0.44381732],"study_design_scores_gemma":[0.00012042855,0.00007397115,0.000297537,0.00001901659,0.000001782909,0.0000028028294,0.00000272654,0.9668623,0.00049584056,0.03079119,0.0012299737,0.00010238736],"about_ca_topic_score_codex":0.0000011269135,"about_ca_topic_score_gemma":4.3374263e-7,"teacher_disagreement_score":0.9612235,"about_ca_system_score_codex":0.000010436731,"about_ca_system_score_gemma":0.000056272638,"threshold_uncertainty_score":0.2862571},"labels":[],"label_agreement":null},{"id":"W2134798898","doi":"10.1145/1278177.1278188","title":"Multiprocessed parallelism support in ALDOR on SMPs and multicores","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Serialization; Computer science; Parallel computing; Compiler; Scheduling (production processes); Linear algebra; Synchronization (alternating current); Data parallelism; Parallelism (grammar); Multi-core processor; Computation; Programming language","score_opus":0.014796829560525141,"score_gpt":0.27538850287554556,"score_spread":0.2605916733150204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134798898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04440135,0.00002786311,0.9435698,0.00047251023,0.00006194801,0.0001324193,2.0247006e-7,0.00046641033,0.010867536],"genre_scores_gemma":[0.7365678,0.000020279724,0.26212567,0.00091378315,0.000014246613,0.0000035385167,0.0000010273793,0.000004549783,0.00034913915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990691,0.000019354906,0.00021727805,0.00030703674,0.00014390002,0.00024333388],"domain_scores_gemma":[0.99946404,0.00013887495,0.000045460576,0.0002334099,0.000041042014,0.000077184646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045433763,0.000107781816,0.00011592054,0.0001900146,0.00005207637,0.000070450325,0.00032603985,0.000060841303,0.000010488627],"category_scores_gemma":[0.000058428715,0.00009195785,0.000018105275,0.0002315274,0.000028101314,0.00016662877,0.00010752783,0.00009991414,0.000015536983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025925483,0.001775587,0.063391745,0.00013218731,0.000055800305,0.0006058178,0.011389355,0.01961628,0.0032808022,0.30587235,0.0238205,0.5698003],"study_design_scores_gemma":[0.0020089042,0.00038595326,0.06826415,0.00005034476,0.0000027311323,0.000028909519,0.000074943404,0.8869728,0.030377809,0.0046150098,0.0065498305,0.00066862564],"about_ca_topic_score_codex":0.00005679355,"about_ca_topic_score_gemma":0.00003724008,"teacher_disagreement_score":0.86735654,"about_ca_system_score_codex":0.000016655978,"about_ca_system_score_gemma":0.000020422875,"threshold_uncertainty_score":0.37499323},"labels":[],"label_agreement":null},{"id":"W2134980609","doi":"10.1109/pacrim.2005.1517311","title":"Prototype hardware implementation of a single-chip multiprocessor with a split-transaction bus","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Multiprocessing; Embedded system; Computer architecture; Computer hardware; Cache coherence; Cache; Operating system; CPU cache; Cache algorithms","score_opus":0.019511562166141756,"score_gpt":0.2771484602231561,"score_spread":0.25763689805701434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134980609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025692701,0.000013795167,0.9718883,0.00042637673,0.000016079795,0.00044388516,9.522707e-7,0.00042702042,0.0010908967],"genre_scores_gemma":[0.56654066,0.0000019736149,0.43326813,0.000067161855,0.000012911107,0.00003008786,0.0000019145018,0.0000042071406,0.00007298273],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922293,0.000024942292,0.0002046798,0.00022110034,0.00018758437,0.00013876721],"domain_scores_gemma":[0.99944514,0.000018026807,0.00011689691,0.00021000572,0.00017331063,0.000036634814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001183397,0.000093716444,0.000103052516,0.00009414944,0.00005850385,0.000051363688,0.00024180944,0.00003136886,0.000031081687],"category_scores_gemma":[0.0000045708457,0.000075033895,0.000026072128,0.00029291786,0.000017804608,0.0004178543,0.000021098223,0.000048701993,0.0000055269556],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019038617,0.0006527097,0.0041382536,0.00021351546,0.00007652345,0.000003902414,0.005523889,0.03650524,0.0140106045,0.013772144,0.0006263946,0.9242864],"study_design_scores_gemma":[0.0018401293,0.0015607731,0.0050790505,0.000105145475,0.000018925977,0.000034750527,0.00021122761,0.4260449,0.56037045,0.00044325468,0.0037820463,0.0005093244],"about_ca_topic_score_codex":0.000069891896,"about_ca_topic_score_gemma":0.00007807677,"teacher_disagreement_score":0.9237771,"about_ca_system_score_codex":0.00003074257,"about_ca_system_score_gemma":0.00005324606,"threshold_uncertainty_score":0.30597934},"labels":[],"label_agreement":null},{"id":"W2135052239","doi":"10.1109/jproc.2008.917731","title":"Scalable Programming Models for Massively Multicore Processors","year":2008,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Scalability; Parallel computing; Programming paradigm; Locality; Implementation; Computer architecture; Programming language; Operating system","score_opus":0.03727866389137689,"score_gpt":0.25362252377061595,"score_spread":0.21634385987923904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135052239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07270797,0.00007757001,0.9235775,0.0006687013,0.00015876965,0.0007807274,0.0000014496712,0.0005214508,0.001505854],"genre_scores_gemma":[0.58340865,0.000012202656,0.4159191,0.000059549002,0.000028043849,0.00006752501,1.1409652e-7,0.000009078748,0.00049573154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990263,0.0000028235347,0.00022269749,0.00026759834,0.00023438374,0.00024619972],"domain_scores_gemma":[0.99902165,0.00003259589,0.00024036576,0.00012857256,0.00053210964,0.000044733348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020083136,0.00011798387,0.00015588927,0.00006568032,0.00027918973,0.000060394126,0.0011589116,0.000057102345,2.932544e-7],"category_scores_gemma":[0.00008752689,0.00008600857,0.00009202191,0.00038439303,0.000080447455,0.0005103477,0.00014925226,0.00008511524,7.6624474e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004027902,0.0028573768,0.024929423,0.0044395686,0.0004494622,0.000006209902,0.045395184,0.2674135,0.07229153,0.29354137,0.15127866,0.13699496],"study_design_scores_gemma":[0.00027888015,0.00007080523,0.00009593699,0.000105576226,0.0000067646447,0.000018400873,0.000022940918,0.85425824,0.13275254,0.0116002355,0.0006301987,0.0001594596],"about_ca_topic_score_codex":0.000006798915,"about_ca_topic_score_gemma":1.4194552e-7,"teacher_disagreement_score":0.5868448,"about_ca_system_score_codex":0.00002388404,"about_ca_system_score_gemma":0.00005303153,"threshold_uncertainty_score":0.35073277},"labels":[],"label_agreement":null},{"id":"W2135183949","doi":"10.1145/379240.379265","title":"Power and energy reduction via pipeline balancing","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Pipeline (software); Reduction (mathematics); Queue; Power (physics); Embedded system; Dissipation; Energy (signal processing); Power budget; Power optimization; Efficient energy use; Microarchitecture; Electric power system; Operating system; Power consumption; Engineering; Computer network; Electrical engineering","score_opus":0.007263304535438872,"score_gpt":0.2288884298080601,"score_spread":0.22162512527262124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135183949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009544481,0.000080029036,0.96473247,0.0006138714,0.000115859046,0.000012047364,2.7775078e-8,0.0005178476,0.032973405],"genre_scores_gemma":[0.7589863,0.0000816814,0.2365686,0.0004105703,0.000039754508,0.0000015610689,6.72442e-7,0.0000033453869,0.003907531],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995214,0.000019898729,0.000099701436,0.00017939183,0.000074167816,0.00010545071],"domain_scores_gemma":[0.99970275,0.000010659989,0.000028986542,0.00017335832,0.000043267904,0.00004097788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104062456,0.00005696966,0.000058347712,0.00006264719,0.000067721194,0.000060049948,0.00014240372,0.00002915001,0.000019191266],"category_scores_gemma":[0.000006698897,0.00005051062,0.000013590074,0.00018009557,0.000012182579,0.00018791786,0.00008323044,0.000031949567,0.000003924812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001754049,0.00017393536,0.0012665616,0.000007985521,0.000020820533,0.00003511628,0.00088401063,0.008538614,0.007952971,0.27209932,0.074359134,0.634644],"study_design_scores_gemma":[0.00012381132,0.00004408097,0.000241355,0.000007488837,0.0000010085897,0.00022083336,0.0000071852014,0.9605793,0.0041734655,0.00491426,0.029539064,0.00014814181],"about_ca_topic_score_codex":0.00004201603,"about_ca_topic_score_gemma":0.0000012714664,"teacher_disagreement_score":0.9520407,"about_ca_system_score_codex":0.000010046944,"about_ca_system_score_gemma":0.000008011289,"threshold_uncertainty_score":0.20597634},"labels":[],"label_agreement":null},{"id":"W2135483384","doi":"10.1109/ccece.2009.5090273","title":"Automata-based approach for kernel trace analysis","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Automaton; Kernel (algebra); Spectrum analyzer; Finite-state machine; Programming language; Theoretical computer science; Mathematics","score_opus":0.020141190098501346,"score_gpt":0.27585518314771457,"score_spread":0.2557139930492132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135483384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008658092,0.000022275017,0.9878076,0.000768136,0.000014774746,0.00014574981,8.773188e-7,0.0014607573,0.00969329],"genre_scores_gemma":[0.3511272,7.2320773e-7,0.6478387,0.0005687856,0.000007820765,0.0000084548265,0.000007746333,0.000001921823,0.00043861248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991989,0.000026550963,0.0001599442,0.00030844208,0.00013293464,0.00017319855],"domain_scores_gemma":[0.9993207,0.00004734944,0.000057688663,0.00044752352,0.00007281051,0.00005391415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002660676,0.000092293856,0.00015748545,0.00020713043,0.00009066039,0.00013133105,0.0005945465,0.000045921755,0.000004002685],"category_scores_gemma":[0.000018177749,0.00007913,0.0001516999,0.0008623814,0.000009443949,0.00013436476,0.000021344498,0.0000387115,0.0000023880316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071345944,0.00030430654,0.00010880721,0.0000072315042,0.00007046951,8.313736e-7,0.00009038896,0.874915,0.000052129337,0.06778978,0.0105624525,0.046091493],"study_design_scores_gemma":[0.00018228039,0.00006654793,0.0007657384,9.209964e-7,0.000025391166,4.897143e-7,0.0000015195633,0.9960883,0.0010195491,0.0010388532,0.00069500355,0.00011540748],"about_ca_topic_score_codex":0.000004855286,"about_ca_topic_score_gemma":3.311446e-7,"teacher_disagreement_score":0.35104063,"about_ca_system_score_codex":0.000015966627,"about_ca_system_score_gemma":0.000029891204,"threshold_uncertainty_score":0.32268277},"labels":[],"label_agreement":null},{"id":"W2135954168","doi":"10.1145/1755913.1755945","title":"Kivati","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Atomicity; Computer science; Interleaving; Overhead (engineering); Software bug; Key (lock); Software; Operating system; Distributed computing; Embedded system; Parallel computing; Programming language; Database transaction","score_opus":0.010074705917208398,"score_gpt":0.24767975801819686,"score_spread":0.23760505210098845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135954168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019991773,0.0000015127166,0.9088863,0.0006576502,0.00015617264,0.0000191431,2.220566e-8,0.0008201653,0.08745983],"genre_scores_gemma":[0.36987054,5.686459e-7,0.6286951,0.00039757285,0.000018463854,0.0000010634068,1.4103466e-7,0.0000011589976,0.0010154004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971944,0.000005293787,0.000051932817,0.00009787546,0.000056002216,0.00006943106],"domain_scores_gemma":[0.99965525,0.000016503222,0.0000135190185,0.00025776075,0.00002905108,0.000027937454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081992155,0.000030682942,0.000029085068,0.000030161284,0.000039745515,0.000061739185,0.00040096082,0.000021910759,0.00003352753],"category_scores_gemma":[0.0000188821,0.000025064937,0.000012726678,0.00011656877,0.000009184673,0.00011339866,0.00008444558,0.00006955327,0.000058022935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.00755074e-7,0.000010603808,0.0002696516,4.4955817e-7,8.12916e-7,7.3339515e-7,0.000034088847,0.00006250623,0.0015329213,0.96622306,0.010289263,0.021575812],"study_design_scores_gemma":[0.00011414317,0.000027498105,0.002052703,0.0000019377628,4.9874734e-7,0.00001706326,0.0000013473103,0.83954,0.033190995,0.033852775,0.09100753,0.00019349676],"about_ca_topic_score_codex":0.0000049152122,"about_ca_topic_score_gemma":0.0000015989622,"teacher_disagreement_score":0.9323703,"about_ca_system_score_codex":0.0000012434186,"about_ca_system_score_gemma":0.000011477919,"threshold_uncertainty_score":0.10221185},"labels":[],"label_agreement":null},{"id":"W2136058988","doi":"10.1109/fpl.2006.311233","title":"TMD-MPI: An MPI Implementation for Multiple Processors Across Multiple FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Programmer; Software portability; Field-programmable gate array; InfiniBand; Embedded system; Programming paradigm; Multiprocessing; Parallel computing; Computer architecture; Operating system","score_opus":0.024251565481599475,"score_gpt":0.3409981366174097,"score_spread":0.31674657113581023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136058988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06586363,0.000019261635,0.9315649,0.0002636238,0.000106405314,0.0005255314,0.000013913077,0.0012218923,0.0004207975],"genre_scores_gemma":[0.59399897,0.0000017871258,0.40523142,0.0001751433,0.00006843069,0.00008365665,0.000063278996,0.00001080671,0.0003665351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853784,0.0000391799,0.00033832947,0.00047400148,0.00019622206,0.0004144143],"domain_scores_gemma":[0.99906313,0.00012009655,0.00013948121,0.00038052656,0.00022637843,0.000070405185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034992056,0.00016341983,0.00014640171,0.00007194577,0.00036163506,0.00030414952,0.0006305357,0.00006696908,0.000009374114],"category_scores_gemma":[0.000042122567,0.00015274687,0.00006465852,0.00028674988,0.00002745263,0.0007423399,0.00013025399,0.000058197158,0.000008981932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016854287,0.0020502135,0.12094759,0.0002833433,0.00009049958,0.000012532741,0.011780976,0.30480257,0.011469381,0.078272745,0.09297845,0.37714317],"study_design_scores_gemma":[0.0011433146,0.00015632439,0.003835433,0.000006382346,0.0000028598204,0.000003821303,0.00016742405,0.9355141,0.048854318,0.003222532,0.0067995326,0.00029395134],"about_ca_topic_score_codex":0.00053873763,"about_ca_topic_score_gemma":0.000810917,"teacher_disagreement_score":0.63071156,"about_ca_system_score_codex":0.000042043386,"about_ca_system_score_gemma":0.000046377183,"threshold_uncertainty_score":0.6228837},"labels":[],"label_agreement":null},{"id":"W2136271630","doi":"10.1145/1925844.1926389","title":"Points-to analysis with efficient strong updates","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Singleton; Flow (mathematics); Set (abstract data type); Program analysis; Compiler; Sensitivity (control systems); Abstract interpretation; Optimizing compiler; Key (lock); Static analysis; Quadratic equation; Theoretical computer science; Algorithm; Programming language; Mathematics; Operating system","score_opus":0.027640971344499457,"score_gpt":0.2537133634451165,"score_spread":0.22607239210061708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136271630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0850456,0.000024656203,0.90920156,0.00031390725,0.00005012275,0.00010400268,0.0000023062166,0.0004952582,0.004762609],"genre_scores_gemma":[0.597808,8.110551e-7,0.40193844,0.0001913246,0.000011136011,0.0000045485904,0.0000033048784,0.000004368844,0.00003804745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889475,0.000053506577,0.0001716053,0.00039095356,0.00023271234,0.00025648283],"domain_scores_gemma":[0.99869144,0.000101207566,0.00010318216,0.0008927716,0.00009170921,0.00011970964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024221092,0.00013685023,0.0001832777,0.0003173065,0.00011460006,0.0001277821,0.0014663015,0.000034559416,0.000042255375],"category_scores_gemma":[0.00006303409,0.00010545731,0.00005022077,0.0011036017,0.000028149278,0.00015324797,0.00034217868,0.00007345026,0.00007487021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001538079,0.00072775764,0.15685917,0.00004558945,0.0014767996,0.00013682262,0.01641106,0.7276919,0.00010838279,0.07323623,0.0049132607,0.018239204],"study_design_scores_gemma":[0.0004149247,0.0006250069,0.07477708,0.000052775602,0.0003112314,0.0000061997625,0.00019616836,0.9108617,0.010023103,0.000858896,0.0010104855,0.0008624777],"about_ca_topic_score_codex":0.00011847647,"about_ca_topic_score_gemma":0.00004698025,"teacher_disagreement_score":0.5127624,"about_ca_system_score_codex":0.000015512695,"about_ca_system_score_gemma":0.000023832086,"threshold_uncertainty_score":0.43004242},"labels":[],"label_agreement":null},{"id":"W2136362035","doi":"10.1145/2366231.2337214","title":"Revisiting hardware-assisted page walks for virtualized systems","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea","keywords":"Paging; Demand paging; Computer science; Page fault; Page; Translation lookaside buffer; Virtual memory; Cache; Operating system; Parallel computing; Computer graphics (images); Physical address; Memory management; Semiconductor memory","score_opus":0.03030701190613608,"score_gpt":0.2870492056538025,"score_spread":0.2567421937476664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136362035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017213034,0.0007452776,0.9911865,0.0016826218,0.0012832496,0.0010072632,0.00000960482,0.0016516771,0.0007124773],"genre_scores_gemma":[0.16387865,0.000022084474,0.83246535,0.0013275474,0.0018651726,0.00015117103,0.000036202106,0.000050938183,0.00020289651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964237,0.00051034003,0.00070509454,0.00077658595,0.00051791663,0.0010663167],"domain_scores_gemma":[0.9958779,0.0013544462,0.00031962097,0.001831051,0.00023252417,0.00038441058],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011932608,0.00045056426,0.0006019423,0.0003527913,0.00044340623,0.0005192834,0.00268926,0.00017813951,0.000005401924],"category_scores_gemma":[0.00035850142,0.00039577304,0.00029263034,0.0005678406,0.00006232665,0.00042391874,0.0013622517,0.00042654324,0.000024843772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006239472,0.00021835139,0.0010672156,0.00036006782,0.00019428655,0.000017543342,0.004527188,0.022082638,0.0019418843,0.026690627,0.024679149,0.91815865],"study_design_scores_gemma":[0.0024592855,0.0005143998,0.002411751,0.0005621887,0.000057092497,0.00046844382,0.000033698994,0.63849115,0.0014697685,0.004926573,0.3469498,0.0016558367],"about_ca_topic_score_codex":0.00004343775,"about_ca_topic_score_gemma":0.0000016912466,"teacher_disagreement_score":0.91650283,"about_ca_system_score_codex":0.000089449364,"about_ca_system_score_gemma":0.00008061579,"threshold_uncertainty_score":0.99984944},"labels":[],"label_agreement":null},{"id":"W2136605135","doi":"10.1016/s0167-6423(02)00059-x","title":"Extracting Java library subsets for deployment on embedded systems","year":2002,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Russian Science Foundation","keywords":"Computer science; Java; Vendor; Real time Java; Software deployment; Operating system; Java annotation; Embedded system; Programming language","score_opus":0.033097929753995725,"score_gpt":0.2732840682834196,"score_spread":0.2401861385294239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136605135","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051751835,0.0001587943,0.9916374,0.00023375826,0.00067272875,0.0005969277,0.0000010512888,0.0008601647,0.000663975],"genre_scores_gemma":[0.48119384,0.000006194193,0.51854795,0.000076572345,0.00008380913,0.000030691055,6.81213e-7,0.000010194306,0.000050077593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977407,0.000069998416,0.0004426966,0.0006387499,0.00056915195,0.0005387156],"domain_scores_gemma":[0.9985199,0.00024859223,0.0003073318,0.0006080206,0.00016659363,0.00014954213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010474442,0.00018602835,0.00023713015,0.00037468024,0.0003758582,0.00074587035,0.0017367767,0.000052943218,0.000004112222],"category_scores_gemma":[0.00005026198,0.00017086104,0.00009290872,0.0010692065,0.00016994805,0.0011747384,0.00027562087,0.0001163451,0.00001094544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009160194,0.00041080994,0.00036785443,0.00011715409,0.000019909268,0.000008605639,0.0017012594,0.07037595,0.0004792567,0.04346294,0.0035869246,0.87946016],"study_design_scores_gemma":[0.00024297487,0.00030561478,0.00003588879,0.00013339405,0.0000030174422,0.000014192148,0.000019139497,0.9909592,0.005275852,0.0001908395,0.0026101456,0.00020969],"about_ca_topic_score_codex":0.0000031263119,"about_ca_topic_score_gemma":5.0268223e-8,"teacher_disagreement_score":0.9205833,"about_ca_system_score_codex":0.000036295594,"about_ca_system_score_gemma":0.00006192911,"threshold_uncertainty_score":0.7192445},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W2137165269","doi":"10.1109/fpga.1997.624614","title":"Automated field-programmable compute accelerator design using partial evaluation","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Field (mathematics); Embedded system","score_opus":0.13442277935422564,"score_gpt":0.33479722590311434,"score_spread":0.2003744465488887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137165269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020603782,0.000081093596,0.9915819,0.00029134942,0.00021002613,0.00032552314,9.206004e-8,0.0035747339,0.0018748908],"genre_scores_gemma":[0.39277926,0.0000053520203,0.60675776,0.00032635132,0.000040440438,0.000011690242,8.7846263e-7,0.0000056614363,0.00007259096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985973,0.00021878236,0.00024701084,0.00032805494,0.00033433782,0.00027447153],"domain_scores_gemma":[0.99915147,0.0000856478,0.00009285078,0.00038382836,0.0002084262,0.00007776818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057672505,0.00012938822,0.00013271265,0.00009684881,0.00020425866,0.00035915492,0.0005046283,0.000079465426,0.00013272087],"category_scores_gemma":[0.0000489192,0.000121678124,0.0000439853,0.0004749646,0.000013704721,0.0004327509,0.00013615112,0.00008107657,0.000052339354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004292415,0.00015137147,0.00016207268,0.0000067015158,0.000027451446,0.000007560481,0.0003029842,0.8393859,0.00041592168,0.0041311,0.038559273,0.11684535],"study_design_scores_gemma":[0.0002451783,0.0000842238,0.000025272107,0.0000098879,0.0000069116822,0.000009942504,0.0000015562559,0.99180144,0.0065683075,0.00046203652,0.00062282995,0.00016241339],"about_ca_topic_score_codex":0.00003102213,"about_ca_topic_score_gemma":6.53549e-7,"teacher_disagreement_score":0.39071888,"about_ca_system_score_codex":0.000051578336,"about_ca_system_score_gemma":0.000041675205,"threshold_uncertainty_score":0.496189},"labels":[],"label_agreement":null},{"id":"W2137549308","doi":"10.1061/40754(183)77","title":"Apportioning Concurrent Delays and Accelerations Using Daily Windows","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"","keywords":"Computer science; Operating system; Real-time computing","score_opus":0.039740507530941035,"score_gpt":0.29433793806687714,"score_spread":0.2545974305359361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137549308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01022927,0.00010787891,0.9839277,0.0004379677,0.000058662663,0.00007698627,2.4537655e-7,0.00041490674,0.004746353],"genre_scores_gemma":[0.5583814,0.000011240075,0.44116607,0.00026036447,0.000038010763,0.0000023516945,0.0000010178425,0.0000024392477,0.00013713098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993842,0.000023484985,0.00017172155,0.00019745326,0.00009378963,0.00012934678],"domain_scores_gemma":[0.99964255,0.000023470539,0.000057604073,0.00016013374,0.00005909143,0.00005714651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014419387,0.000071847084,0.000073201496,0.00006976648,0.00021733808,0.00021853313,0.00018875481,0.000029001136,0.000016175261],"category_scores_gemma":[0.000011916925,0.00006813623,0.000018378882,0.00014831139,0.000020344629,0.0004724866,0.00012951707,0.00006051175,0.000007214313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001700459,0.0001334489,0.0037941043,0.000011269654,0.000027750912,0.0000039994793,0.0015953191,0.31647965,0.0018124023,0.3283657,0.005884577,0.34189004],"study_design_scores_gemma":[0.00010510231,0.000012058446,0.00028129815,0.0000070360975,0.0000020873606,0.000017667764,0.000006734552,0.99379754,0.0018410533,0.00018497108,0.0036477991,0.00009662194],"about_ca_topic_score_codex":0.000010674995,"about_ca_topic_score_gemma":0.0000038079259,"teacher_disagreement_score":0.6773179,"about_ca_system_score_codex":0.000021850137,"about_ca_system_score_gemma":0.000039679344,"threshold_uncertainty_score":0.27785146},"labels":[],"label_agreement":null},{"id":"W2138218143","doi":"10.1145/2540708.2540743","title":"Energy efficient GPU transactional memory via space-time optimizations","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Computer science; Transactional memory; Parallel computing; Programmer; Synchronization (alternating current); Overhead (engineering); Parallelism (grammar); Software transactional memory; Graphics; Database transaction; Embedded system; Operating system; Programming language","score_opus":0.006307483941042058,"score_gpt":0.20310214048025949,"score_spread":0.19679465653921743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138218143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014440175,0.00003216054,0.96284163,0.0018796982,0.0001324348,0.00011117211,5.5686667e-7,0.0011279044,0.033730023],"genre_scores_gemma":[0.1998969,0.000011608312,0.7880755,0.000742709,0.000050415947,0.000047153786,0.0000075384023,0.000013289131,0.011154902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890095,0.000059665297,0.0002167526,0.00033207992,0.00024681888,0.00024373896],"domain_scores_gemma":[0.9991828,0.00006979262,0.000060322644,0.00038849047,0.0001771844,0.00012137034],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010602928,0.0001405363,0.00012915222,0.00016691173,0.00019946303,0.00017493976,0.00053104124,0.00006815695,0.00093443744],"category_scores_gemma":[0.0000070540495,0.00012702665,0.000074729134,0.00042724801,0.000038330963,0.00027577623,0.00007709755,0.00007206919,0.00033809172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.008866e-7,0.0001007875,0.0000029136168,0.0000017957359,0.000012415631,0.0000010103479,0.000088237284,0.95081854,0.00051277305,0.020124756,0.015643083,0.012692906],"study_design_scores_gemma":[0.00012326217,0.00002580789,0.00004238916,0.00000441604,0.0000023938076,0.000013524501,0.0000028844427,0.99297273,0.0041218847,0.0012452719,0.0012739003,0.0001715397],"about_ca_topic_score_codex":0.00012961679,"about_ca_topic_score_gemma":0.0000011009132,"teacher_disagreement_score":0.1997525,"about_ca_system_score_codex":0.000037726597,"about_ca_system_score_gemma":0.00005263827,"threshold_uncertainty_score":0.99997884},"labels":[],"label_agreement":null},{"id":"W2138263001","doi":"10.1016/j.matcom.2016.05.005","title":"Random numbers for parallel computers: Requirements and methods, with emphasis on GPUs","year":2015,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Emphasis (telecommunications); Parallel computing; Software; STREAMS; Data stream mining; Random number generation; Theoretical computer science; Distributed computing; Algorithm; Programming language; Data mining; Operating system","score_opus":0.030498222826223553,"score_gpt":0.2936645186739449,"score_spread":0.26316629584772133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138263001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019060837,0.00022420853,0.9818691,0.0048974864,0.0000968255,0.00043107657,0.000003112838,0.0005764524,0.009995653],"genre_scores_gemma":[0.058043502,0.00006840686,0.94030756,0.00031430236,0.00001133385,0.000058979924,0.00002455947,0.000018476403,0.0011528835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962375,0.0023397137,0.00029400358,0.00056112057,0.00028823188,0.00027943097],"domain_scores_gemma":[0.99599606,0.001472994,0.00023271449,0.0009991695,0.001079344,0.00021971112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004982404,0.00020261428,0.00025716508,0.00013469439,0.00027819807,0.00039545633,0.0008840017,0.000075244316,0.0000025582972],"category_scores_gemma":[0.00064117386,0.00018187982,0.000064105785,0.00035543178,0.00012098115,0.00029823347,0.0003038886,0.000116835006,0.000005132494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031525566,0.0010454395,0.0018194835,0.00009037302,0.00021664765,0.000009687163,0.020031614,0.004871973,0.0003489039,0.37546515,0.025372343,0.5704131],"study_design_scores_gemma":[0.006544206,0.000013582788,0.00034658035,0.00066472933,0.000030069186,0.000035314635,0.00010063187,0.91927403,0.018325014,0.010457435,0.043560684,0.0006477197],"about_ca_topic_score_codex":0.00012272797,"about_ca_topic_score_gemma":0.000044398104,"teacher_disagreement_score":0.91440207,"about_ca_system_score_codex":0.00005732533,"about_ca_system_score_gemma":0.00010909247,"threshold_uncertainty_score":0.7416844},"labels":[],"label_agreement":null},{"id":"W2138542739","doi":"10.1109/icsamos.2006.300804","title":"On the Evaluation of Dense Chip-Multiprocessor Architectures","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache coherence; MESI protocol; Directory; Interconnection; MESIF protocol; Multiprocessing; Embedded system; Cache algorithms; Cache; Indirection; Computer architecture; Architecture; Parallel computing; CPU cache; Operating system; Computer network","score_opus":0.028975549350358204,"score_gpt":0.2901218553206739,"score_spread":0.26114630597031574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138542739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1768225,0.000052075855,0.801292,0.00078708504,0.000030246525,0.00014517453,2.0912951e-7,0.00018822841,0.02068246],"genre_scores_gemma":[0.94990826,9.4136163e-7,0.049687628,0.00026197982,0.000017373484,0.000010656298,4.7319466e-7,0.0000025016957,0.000110185436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917257,0.00011176471,0.00013274232,0.0001372816,0.00036388624,0.000081765014],"domain_scores_gemma":[0.99929583,0.00016941462,0.00007380173,0.00028881573,0.0001618443,0.000010275389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005927297,0.00005849159,0.00005854253,0.0000620244,0.00006698132,0.000034964585,0.00038584418,0.000021208065,0.000015580958],"category_scores_gemma":[0.00012197875,0.00003418994,0.000030195544,0.00019116254,0.00002303024,0.000026336962,0.0000472312,0.00004918649,0.000005880154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007714077,0.00012527112,0.00041586393,0.0000069249895,0.00000852365,3.6051188e-7,0.00025532595,0.6135072,0.0005921625,0.3199803,0.0068194326,0.05828095],"study_design_scores_gemma":[0.00012428778,0.000032039723,0.0034900594,0.000011949594,0.0000031113514,0.000001442253,0.0000027951019,0.87343997,0.02705791,0.09574805,0.00003110351,0.000057294812],"about_ca_topic_score_codex":0.00007680801,"about_ca_topic_score_gemma":0.000016898193,"teacher_disagreement_score":0.7730858,"about_ca_system_score_codex":0.000010651758,"about_ca_system_score_gemma":0.00003430278,"threshold_uncertainty_score":0.13942254},"labels":[],"label_agreement":null},{"id":"W2138542804","doi":"10.1109/pacrim.2011.6033012","title":"Spinal Tap: High level analysis for heavy metal systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Victoria","funders":"","keywords":"Computer science; Compiler; Program comprehension; Extensibility; Variety (cybernetics); Programming language; Domain-specific language; Computer architecture; Intermediate language; Software engineering; Implementation; Domain (mathematical analysis); Comprehension; High-level programming language; Software; Software system; Artificial intelligence; Programming paradigm","score_opus":0.09699097789203848,"score_gpt":0.28652198285604585,"score_spread":0.18953100496400738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138542804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096696406,0.00007359321,0.9943768,0.000053840336,0.00019508708,0.00018942595,0.000003196651,0.00057416206,0.0035669226],"genre_scores_gemma":[0.5412556,0.0000021458466,0.45764676,0.000062184205,0.000022720702,0.000034402605,0.000002526355,0.0000032243065,0.00097042765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908286,0.000039272796,0.00022876175,0.00030702093,0.00014223464,0.00019981852],"domain_scores_gemma":[0.99925876,0.00002533459,0.00008767171,0.0004185561,0.0001438001,0.00006590915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031351362,0.00010584817,0.00021692159,0.0002365958,0.00010338006,0.000098160206,0.00063361775,0.000047942292,0.000015209025],"category_scores_gemma":[0.000016110485,0.0000875725,0.00014521395,0.00062243873,0.000018107887,0.0002060416,0.00011052079,0.000040964056,0.000013519301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030634586,0.0002245337,0.0017852768,0.000029754518,0.000710718,0.000007834028,0.0002997034,0.010478137,0.000053231037,0.97576874,0.0039093997,0.0067020487],"study_design_scores_gemma":[0.00021161628,0.00028564365,0.006818273,0.0000071466943,0.00013431956,0.000008467541,0.000013251072,0.985348,0.003669968,0.0022136837,0.0010090814,0.00028057405],"about_ca_topic_score_codex":0.00044412605,"about_ca_topic_score_gemma":0.000007971367,"teacher_disagreement_score":0.97486985,"about_ca_system_score_codex":0.00001820446,"about_ca_system_score_gemma":0.000026968906,"threshold_uncertainty_score":0.3571103},"labels":[],"label_agreement":null},{"id":"W2138659362","doi":"10.1145/1735688.1735695","title":"Compiling Python to a hybrid execution environment","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; McGill University","funders":"","keywords":"Python (programming language); Computer science; Programming language; Operating system; Software engineering","score_opus":0.009516921744665686,"score_gpt":0.2339960874775855,"score_spread":0.22447916573291982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138659362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023223232,0.0000040062982,0.9689128,0.0008963212,0.00018932564,0.00010797034,2.6870742e-7,0.00067811215,0.005987999],"genre_scores_gemma":[0.47002438,0.0000020497396,0.52919453,0.0004290452,0.000027293454,0.0000055555174,9.4675556e-7,0.000003065759,0.00031313783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932855,0.000017811948,0.000121516256,0.000246505,0.00013701958,0.00014858902],"domain_scores_gemma":[0.99945045,0.000022106067,0.000028161792,0.0003919995,0.00001851561,0.00008876787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006666,0.00007354398,0.000068329864,0.00007356147,0.00009158551,0.00008681798,0.00042618648,0.000022835717,0.00003515314],"category_scores_gemma":[0.000015044596,0.000068342546,0.00002627118,0.00009209639,0.000012296594,0.00012368987,0.00021415652,0.00010274983,0.00017836849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016697837,0.00044041855,0.0014089217,0.00001572022,0.000023488608,0.000033267246,0.0012252884,0.08844737,0.12360212,0.41463807,0.053287465,0.31686118],"study_design_scores_gemma":[0.00014028001,0.00008070361,0.0009163919,0.000006976685,0.0000015320721,0.000026143583,0.0000039083247,0.8492361,0.0970191,0.0039912495,0.04831956,0.00025810456],"about_ca_topic_score_codex":0.000011275596,"about_ca_topic_score_gemma":0.0000012045554,"teacher_disagreement_score":0.7607887,"about_ca_system_score_codex":0.000014457218,"about_ca_system_score_gemma":0.000011531652,"threshold_uncertainty_score":0.27869284},"labels":[],"label_agreement":null},{"id":"W2138791376","doi":"10.1145/2600212.2600220","title":"Scalable matrix inversion using MapReduce","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Parallel computing; Scalability; LU decomposition; Cholesky decomposition; Sparse matrix; Inversion (geology); Matrix (chemical analysis); Matrix decomposition; Computational science; Linear algebra; Supercomputer; Algorithm; Mathematics; Database","score_opus":0.01923527831735278,"score_gpt":0.2708347304506079,"score_spread":0.25159945213325513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138791376","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007259716,0.0000143842335,0.9757341,0.0002510229,0.00011957383,0.00003967462,5.1330286e-8,0.00068543514,0.015896022],"genre_scores_gemma":[0.34242162,0.0000022854285,0.6561384,0.00026470478,0.000025837837,4.9934147e-7,3.481096e-7,0.0000031044365,0.001143194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993994,0.000047551915,0.00010172974,0.00019305528,0.000115447576,0.00014279109],"domain_scores_gemma":[0.9995285,0.000028119783,0.00003801765,0.00030722385,0.000046292756,0.000051826657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022031346,0.00006352765,0.00007147228,0.00007602613,0.00010929232,0.00010209316,0.00043323654,0.000036633835,0.000017510996],"category_scores_gemma":[0.000021492022,0.000057089906,0.000026047415,0.00023237319,0.000013360875,0.0002447077,0.00020563474,0.000045918077,0.000057528752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008022041,0.00017070338,0.0026548475,0.000050605333,0.000020423544,0.000004828567,0.000498124,0.22376029,0.013524673,0.5930204,0.094444744,0.07184233],"study_design_scores_gemma":[0.00006914707,0.000017334365,0.000034007866,0.000008298639,9.3639636e-7,0.00000413259,0.0000017155897,0.9824399,0.010105217,0.003002516,0.00423316,0.00008366957],"about_ca_topic_score_codex":0.00003813814,"about_ca_topic_score_gemma":2.836404e-7,"teacher_disagreement_score":0.75867957,"about_ca_system_score_codex":0.00002050881,"about_ca_system_score_gemma":0.000018850029,"threshold_uncertainty_score":0.23280588},"labels":[],"label_agreement":null},{"id":"W2139232297","doi":"10.1109/hpcs.2006.47","title":"Timesteps and Parallel Domain Decomposition with Application to Astrophysical Simulations","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Computer science; Scalability; Locality; Range (aeronautics); Computational science; Domain decomposition methods; Parallel computing; Finite element method; Aerospace engineering; Physics","score_opus":0.004017890107750436,"score_gpt":0.24137608504639313,"score_spread":0.23735819493864269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139232297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030261928,0.0000041694307,0.96654457,0.00082983973,0.0000062225304,0.00019402438,6.4053137e-7,0.00039851503,0.001760066],"genre_scores_gemma":[0.48953903,2.2945154e-7,0.5102511,0.00010665268,0.000017106513,0.0000105037425,0.000005993411,0.0000027582691,0.000066655324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00002341118,0.0001098594,0.00024422802,0.00010955058,0.000114821916],"domain_scores_gemma":[0.999611,0.000034115157,0.000033970104,0.00021616092,0.00005312831,0.000051590712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043773383,0.00007958717,0.00007480082,0.0000669371,0.00011707496,0.000105293795,0.0001538668,0.000024157727,0.0000015661341],"category_scores_gemma":[0.0000012688427,0.000066751534,0.000011603702,0.0002473951,0.000017642713,0.0001699052,0.00006237869,0.000036665737,0.000014204532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000116837255,0.000103928614,0.0009581756,0.0000029364721,0.000004692046,0.0000013079608,0.000070041584,0.63522756,0.0028469118,0.35352278,0.0012308272,0.0060191196],"study_design_scores_gemma":[0.00023939682,0.00013547033,0.011220537,0.000007477402,0.0000026490952,0.000009173782,0.0000023365208,0.97012126,0.00085832557,0.016384995,0.0008534689,0.00016489554],"about_ca_topic_score_codex":0.000046970228,"about_ca_topic_score_gemma":0.000012589752,"teacher_disagreement_score":0.4592771,"about_ca_system_score_codex":0.00001658133,"about_ca_system_score_gemma":0.000012314681,"threshold_uncertainty_score":0.27220488},"labels":[],"label_agreement":null},{"id":"W2139267070","doi":"10.1109/ipdps.2012.125","title":"An SMT-Selection Metric to Improve Multithreaded Applications' Performance","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Simultaneous multithreading; Scalability; Metric (unit); Multithreading; Selection (genetic algorithm); Performance metric; Workload; Overhead (engineering); Parallel computing; Performance improvement; Embedded system; Computer engineering; Operating system; Thread (computing); Machine learning","score_opus":0.014808216090874972,"score_gpt":0.2794042890685069,"score_spread":0.26459607297763194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139267070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073284376,0.000029252571,0.98798615,0.000105489686,0.000094604315,0.00028314613,2.1348626e-7,0.0010176748,0.0031550385],"genre_scores_gemma":[0.55554515,0.000004275609,0.4436798,0.00039652287,0.00007342857,0.00007163721,0.0000010656413,0.0000039457213,0.00022414634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921095,0.00002858901,0.00014342218,0.0002310002,0.00013670627,0.00024933013],"domain_scores_gemma":[0.99928147,0.000023723464,0.00006347108,0.00037011973,0.00010294246,0.00015825163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029333268,0.00008840178,0.00007726966,0.00024287563,0.00014768622,0.000087349974,0.0004786642,0.00003699076,0.000012296935],"category_scores_gemma":[0.000016570328,0.00007988919,0.00002024118,0.0011024108,0.000007727892,0.00074998086,0.00007672628,0.00006667955,0.00013768255],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007829749,0.00051540614,0.022533799,0.000021124128,0.000014296553,8.338375e-8,0.00070505857,0.015231089,0.007043657,0.037593354,0.0025903867,0.9137439],"study_design_scores_gemma":[0.0001267146,0.00017685036,0.016902406,0.0000031102963,0.0000030701503,0.000005590998,0.0000072939924,0.8883893,0.08498807,0.00011071679,0.009031813,0.00025507275],"about_ca_topic_score_codex":0.000030497544,"about_ca_topic_score_gemma":9.545096e-7,"teacher_disagreement_score":0.91348886,"about_ca_system_score_codex":0.00004425294,"about_ca_system_score_gemma":0.000018456603,"threshold_uncertainty_score":0.32577866},"labels":[],"label_agreement":null},{"id":"W2139538643","doi":"10.1109/igcc.2011.6008585","title":"Fine-grained per-core frequency scheduling for power efficient-multicore execution","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Frequency scaling; Computer science; Multi-core processor; Schedule; Energy consumption; Scheduling (production processes); Power management; Computation; Efficient energy use; Energy conservation; Energy (signal processing); Power (physics); Parallel computing; Distributed computing; Electrical engineering; Operating system; Engineering","score_opus":0.045585829043986004,"score_gpt":0.2735421069051752,"score_spread":0.22795627786118922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139538643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022137117,0.00005119266,0.9674271,0.00018411686,0.00024352189,0.000311559,0.000001612772,0.0010997393,0.008544086],"genre_scores_gemma":[0.4708978,8.918632e-7,0.52873546,0.00010376362,0.000017048378,0.000019291112,0.0000034307632,0.0000070181654,0.00021531152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886006,0.00002267172,0.0002578431,0.00040311785,0.00015247501,0.00030382897],"domain_scores_gemma":[0.99908245,0.000049315582,0.000096807795,0.00045420884,0.00023286452,0.00008436431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028578407,0.0001548852,0.00014433767,0.00013928184,0.00019326738,0.00006891547,0.00064686616,0.00008850088,0.000051283077],"category_scores_gemma":[0.00011238226,0.0001346946,0.0001011286,0.00024013434,0.000035482626,0.00016531264,0.00012357405,0.00008648141,0.00003178703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035314708,0.00047199437,0.0015514509,0.00004258546,0.000038908125,0.000008216512,0.0056739193,0.011921978,0.0056996043,0.961705,0.0031754235,0.009675592],"study_design_scores_gemma":[0.00042751708,0.00017690344,0.00075279194,0.000026968568,0.0000057205502,0.000007945916,0.000035275007,0.9794602,0.007950487,0.0106599815,0.00019971536,0.00029653287],"about_ca_topic_score_codex":0.000028444523,"about_ca_topic_score_gemma":0.0000030929782,"teacher_disagreement_score":0.9675382,"about_ca_system_score_codex":0.00003183882,"about_ca_system_score_gemma":0.00005006327,"threshold_uncertainty_score":0.5492686},"labels":[],"label_agreement":null},{"id":"W2139555208","doi":"","title":"Power management in multi-core processors using automatic dynamic pipeline stage unification","year":2013,"lang":"en","type":"article","venue":"International Symposium on Performance Evaluation of Computer and Telecommunication Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Pipeline (software); Computer science; Frequency scaling; Unification; Dynamic demand; Transistor; Voltage; Energy consumption; Embedded system; Performance metric; Dynamic voltage scaling; Power management; Parallel computing; Power (physics); Electrical engineering; Engineering; Operating system","score_opus":0.046898856150305306,"score_gpt":0.3328204903415782,"score_spread":0.28592163419127287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139555208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48685664,0.000095718344,0.5100613,0.0003149086,0.00028651665,0.000919739,0.0000017693252,0.00012807325,0.0013353124],"genre_scores_gemma":[0.9162252,0.00018898975,0.08320225,0.00006252233,0.000012325951,0.00015892,0.000031310097,0.000011221709,0.00010728601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977705,0.00023143992,0.0007771188,0.0003356247,0.0007248365,0.00016048856],"domain_scores_gemma":[0.99788034,0.00007637501,0.0005006052,0.0006565083,0.0008404077,0.000045764427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014667462,0.000177593,0.00020199365,0.0004369832,0.00010573581,0.00018799763,0.0009066865,0.00007175042,0.000017699747],"category_scores_gemma":[0.000014400031,0.00017372763,0.000034958328,0.0003699328,0.000041291845,0.00078875007,0.0002297925,0.0001336037,0.000016241562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009962214,0.00041813738,0.0032248038,0.00011365073,0.00006176555,3.1990172e-7,0.0011937215,0.91281766,0.000507488,0.006262948,0.00007415643,0.07531541],"study_design_scores_gemma":[0.0007898139,0.00005691786,0.037897326,0.00022296532,0.0000068405775,0.0000063622538,0.00004475169,0.96042967,0.00019236126,0.000061057,0.00012957129,0.00016233575],"about_ca_topic_score_codex":0.00004988794,"about_ca_topic_score_gemma":0.0000021745705,"teacher_disagreement_score":0.42936853,"about_ca_system_score_codex":0.0002422218,"about_ca_system_score_gemma":0.000049194452,"threshold_uncertainty_score":0.7084407},"labels":[],"label_agreement":null},{"id":"W2139838857","doi":"10.1109/tmag.2007.916376","title":"Heterogeneity and Loosely Coupled Systems in Electromagnetic Device Analysis","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software architecture; Representation (politics); Reference architecture; Software; Set (abstract data type); Architecture; Finite element method; Personalization; Distributed computing; Software engineering; Programming language","score_opus":0.020088414418375902,"score_gpt":0.24691519716965002,"score_spread":0.2268267827512741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139838857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20961393,0.00034597388,0.78942215,0.00006996995,0.00008200959,0.00013981966,0.0000018280056,0.00021562885,0.00010869237],"genre_scores_gemma":[0.9533195,0.0005466051,0.045838624,0.0000999264,0.000008023118,0.000022411761,9.045707e-7,0.000008375357,0.00015563577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876547,0.000113615526,0.00029073615,0.00037020832,0.00021258015,0.00024738914],"domain_scores_gemma":[0.99927694,0.00009505634,0.00006223536,0.00040228874,0.00007379833,0.00008968947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015667692,0.00015681931,0.00024299472,0.000479482,0.00016876466,0.00007831332,0.00031212607,0.00008540478,0.0000054785687],"category_scores_gemma":[0.000003347486,0.00016572767,0.00007169933,0.0013635868,0.00005777541,0.00011178104,0.0000033972192,0.00018342037,0.0000078395615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022465547,0.00045155693,0.0016205851,0.000035909714,0.00014392723,0.000065514345,0.00059922616,0.98519105,0.0018470873,0.0003207983,0.000071213035,0.0096306885],"study_design_scores_gemma":[0.0002936387,0.0003210518,0.006269251,0.000008814354,0.000056443816,0.000047689384,0.0000045017764,0.9900798,0.002618465,0.000029795232,0.00007174752,0.00019880167],"about_ca_topic_score_codex":0.00013905551,"about_ca_topic_score_gemma":0.000109690554,"teacher_disagreement_score":0.7437056,"about_ca_system_score_codex":0.00004002765,"about_ca_system_score_gemma":0.000040904513,"threshold_uncertainty_score":0.67581785},"labels":[],"label_agreement":null},{"id":"W2139935536","doi":"10.1145/1513895.1513902","title":"<i>hi</i> CUDA","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Programmer; Compiler; Parallel computing; Code (set theory); General-purpose computing on graphics processing units; Programming language; Programming paradigm; Operating system; Graphics","score_opus":0.010903609519847429,"score_gpt":0.24774583790238508,"score_spread":0.23684222838253766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139935536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012614191,0.00002586753,0.852391,0.0019106911,0.00004294503,0.000025560808,2.745112e-8,0.0010496114,0.14442818],"genre_scores_gemma":[0.34684926,0.000008972475,0.6472461,0.00427481,0.000021778424,6.391469e-7,2.9361473e-7,0.0000012189435,0.001596925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958646,0.0000127543335,0.00007654765,0.00013581064,0.00008210787,0.00010630037],"domain_scores_gemma":[0.99964875,0.000011193967,0.000018545343,0.00025722338,0.000028331026,0.000035938912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081583275,0.000046475732,0.000048343318,0.00003796324,0.00004794393,0.00007604554,0.00042658712,0.000020305044,0.000009168038],"category_scores_gemma":[0.000007592656,0.00003930238,0.00002205121,0.00018283089,0.000005064116,0.00016186011,0.00003945345,0.00003665589,0.000053446154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.112988e-7,0.000053353524,0.00007197328,7.5677804e-7,0.0000018990012,0.0000052378773,0.000100126534,0.0015225152,0.00025742812,0.7202054,0.091042,0.18673845],"study_design_scores_gemma":[0.00029295104,0.0002490881,0.0021914847,0.000012516617,0.0000016310795,0.000028961618,0.0000036100876,0.7837111,0.02132589,0.11244711,0.07931712,0.00041857298],"about_ca_topic_score_codex":0.000002294943,"about_ca_topic_score_gemma":1.3379072e-7,"teacher_disagreement_score":0.78218853,"about_ca_system_score_codex":0.0000062393433,"about_ca_system_score_gemma":0.000011902916,"threshold_uncertainty_score":0.16027045},"labels":[],"label_agreement":null},{"id":"W2139954584","doi":"10.1109/fpga.1993.279478","title":"A field programmable accelerator for compiled-code applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Porting; Computer science; Overhead (engineering); Code (set theory); Field (mathematics); Software; Set (abstract data type); Operating system; Embedded system; Programming language; Computer architecture","score_opus":0.041076414732829816,"score_gpt":0.28641838625105975,"score_spread":0.24534197151822995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139954584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028562908,0.00006886887,0.97871256,0.0017118503,0.00003597896,0.00053091155,0.0000011346585,0.0011031464,0.017806994],"genre_scores_gemma":[0.073724054,0.000015743837,0.9210288,0.0012900931,0.000056690184,0.00055231364,0.0000025707589,0.000006333558,0.0033233962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934673,0.000011561043,0.0001440668,0.00023749571,0.0000785331,0.00018160345],"domain_scores_gemma":[0.99934775,0.0000956704,0.00004501268,0.00036465348,0.00009233122,0.00005460985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000875451,0.00007473749,0.000086075546,0.00005007802,0.00016443503,0.0001232712,0.0005662435,0.000042764368,0.0000490905],"category_scores_gemma":[0.000014110889,0.00006799563,0.00004675585,0.00024001593,0.000010049296,0.00017312751,0.000083737395,0.00004967241,0.000046316014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004618845,0.00035712228,0.00030928495,0.0000339043,0.000020965017,8.3951363e-7,0.0002355053,0.0008149089,0.000102566126,0.39224577,0.24469966,0.36117485],"study_design_scores_gemma":[0.00014016218,0.00009366057,0.0000067492424,0.0000032912071,0.0000016600825,0.0000024673716,0.0000021108435,0.7234309,0.002960159,0.0032668805,0.26998198,0.000110009234],"about_ca_topic_score_codex":0.0000040656587,"about_ca_topic_score_gemma":0.0000020674584,"teacher_disagreement_score":0.72261596,"about_ca_system_score_codex":0.000010543493,"about_ca_system_score_gemma":0.000008783203,"threshold_uncertainty_score":0.27727813},"labels":[],"label_agreement":null},{"id":"W2140016060","doi":"10.1109/igcc.2011.6008593","title":"Power and frequency analysis for data and control independence in embedded processors","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Independence (probability theory); Control (management); Dissipation; Power (physics); Power control; Measure (data warehouse); Control variable; Efficient energy use; Artificial intelligence; Statistics; Electrical engineering; Mathematics; Database; Engineering","score_opus":0.03582278685291387,"score_gpt":0.28313869871731057,"score_spread":0.2473159118643967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140016060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01070581,0.00012514257,0.9873398,0.000088434084,0.000012829278,0.00016532539,0.0000036295119,0.00018378634,0.0013752297],"genre_scores_gemma":[0.6669707,0.000011183855,0.33285382,0.00012390481,0.0000017645035,0.0000082488,0.0000016231176,0.0000024694996,0.000026296197],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.000027646769,0.00016361845,0.00039223407,0.00008751954,0.0001344144],"domain_scores_gemma":[0.9993291,0.000060222577,0.000057857294,0.00043853783,0.00006752412,0.00004679041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045159465,0.00007671085,0.00015011909,0.00019028404,0.000044142103,0.00006850187,0.00060181797,0.000049750506,0.0000062339104],"category_scores_gemma":[0.00007639493,0.000065023785,0.000013455087,0.00040074118,0.000030273039,0.00046123372,0.00020249972,0.00005311711,4.42855e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000660041,0.00033918582,0.8632357,0.00008054603,0.0004563578,0.000022341022,0.0108964,0.00056377024,0.00020577817,0.10644803,0.0007468365,0.016939059],"study_design_scores_gemma":[0.00043292786,0.000066436965,0.025591683,0.000006971288,0.000022832788,0.000003346284,0.00003111108,0.96316135,0.00026293338,0.010250475,0.000018492536,0.00015146643],"about_ca_topic_score_codex":0.00009875094,"about_ca_topic_score_gemma":0.00006897163,"teacher_disagreement_score":0.96259755,"about_ca_system_score_codex":0.0000046594705,"about_ca_system_score_gemma":0.000027541993,"threshold_uncertainty_score":0.26515928},"labels":[],"label_agreement":null},{"id":"W2140200206","doi":"10.1145/360128.360165","title":"Instruction distribution heuristics for quad-cluster, dynamically-scheduled, superscalar processors","year":2000,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Pipeline (software); Latency (audio); Heuristics; Cluster (spacecraft); Bandwidth (computing); Parallel computing; Throughput; Real-time computing; Computer network; Operating system; Telecommunications","score_opus":0.008159872676163846,"score_gpt":0.2430445367587188,"score_spread":0.23488466408255493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140200206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016056065,0.00002455086,0.98037094,0.0008917278,0.00012362518,0.00028397902,0.000010631872,0.00092506025,0.0013134427],"genre_scores_gemma":[0.47611198,0.0000419788,0.52209514,0.000312544,0.000068185356,0.000044216034,0.00011046905,0.000011258589,0.0012042095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989155,0.00003883359,0.00026891433,0.0003551969,0.0001716972,0.00024987795],"domain_scores_gemma":[0.99931985,0.000077728604,0.000053536085,0.00030080284,0.0001683193,0.000079786565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021122758,0.00013651657,0.00013767455,0.000046164005,0.0002035324,0.00015125307,0.00046517726,0.000101430844,0.00003271817],"category_scores_gemma":[0.00009288405,0.00012686494,0.000067409586,0.00030254878,0.00003840087,0.00032603185,0.000053243413,0.00008995662,0.000023345014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018466693,0.0006323522,0.0009061613,0.00021067614,0.00006644934,0.0000041373946,0.00074814,0.08614609,0.00015248812,0.3051588,0.027989974,0.5778001],"study_design_scores_gemma":[0.00050096354,0.00009792574,0.00020172274,0.000013268718,0.000005392936,0.000012717873,0.0000057711813,0.9800778,0.0009385588,0.0053811343,0.01257048,0.00019423511],"about_ca_topic_score_codex":0.00001486807,"about_ca_topic_score_gemma":0.0000031847724,"teacher_disagreement_score":0.89393175,"about_ca_system_score_codex":0.00006296406,"about_ca_system_score_gemma":0.000043553053,"threshold_uncertainty_score":0.5173402},"labels":[],"label_agreement":null},{"id":"W2140405153","doi":"10.1007/978-3-540-78791-4_7","title":"Control Flow Emulation on Tiled SIMD Architectures","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Control flow; SIMD; Cache; Programmer; Emulation; Memory bandwidth; Computer architecture; Embedded system; Programming language","score_opus":0.013719684377009609,"score_gpt":0.2428361197946809,"score_spread":0.2291164354176713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140405153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051557807,0.00019512861,0.9908095,0.00055525085,0.00091554876,0.0005204937,0.0000052351324,0.00072820665,0.006219064],"genre_scores_gemma":[0.39597434,0.00004188328,0.6000831,0.0030543695,0.00050123263,0.000011675787,0.000008109011,0.000043571752,0.00028170925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960359,0.00007495277,0.0005739586,0.001571539,0.0011135397,0.0006301353],"domain_scores_gemma":[0.9970757,0.00069088256,0.00034610787,0.0014529679,0.0002591759,0.0001751886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056987687,0.00061508856,0.0006032307,0.0011794227,0.00040806204,0.00037374411,0.0027714712,0.00037309685,0.000012734168],"category_scores_gemma":[0.00013806885,0.00055330916,0.00018245695,0.0005379626,0.0004642372,0.00020458674,0.0005117894,0.0009148108,0.00005284267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009649233,0.000020617465,0.000011913146,0.0000075859684,0.0000070869432,0.00003065506,0.00026676597,0.73327833,0.000013902425,0.0016992661,0.00015332193,0.26450092],"study_design_scores_gemma":[0.0003978115,0.00028958326,0.00010707278,0.0002287007,0.000004397465,0.000057715344,1.1409617e-8,0.9624308,0.00057205197,0.03381157,0.0015134367,0.0005868995],"about_ca_topic_score_codex":0.000011491583,"about_ca_topic_score_gemma":0.000012321782,"teacher_disagreement_score":0.39592278,"about_ca_system_score_codex":0.00024201772,"about_ca_system_score_gemma":0.00037744013,"threshold_uncertainty_score":0.99969184},"labels":[],"label_agreement":null},{"id":"W2140447297","doi":"10.1109/hpca.2012.6169041","title":"Parabix: Boosting the efficiency of text processing on commodity processors","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Computer science; SIMD; Toolchain; Parallel computing; Compiler; Exploit; Instruction set; Code generation; Parsing; Software; Computer architecture; Programming language; Operating system","score_opus":0.028903733055097556,"score_gpt":0.2810999188988318,"score_spread":0.2521961858437342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140447297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025578195,0.00017288655,0.94787085,0.0004960312,0.00006981295,0.00013601164,2.3541651e-7,0.00039467117,0.025281318],"genre_scores_gemma":[0.9395983,0.000003252403,0.059899293,0.00031717317,0.000036946112,0.000007072691,3.853761e-7,0.0000046801574,0.00013286195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905145,0.00006984997,0.00021503944,0.00015940721,0.00024573723,0.00025851594],"domain_scores_gemma":[0.99919695,0.00015676589,0.00016190883,0.00033444268,0.0001012409,0.00004867624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073251687,0.00009884943,0.00011253417,0.000055420118,0.00025279366,0.00006715791,0.0007768552,0.000035651123,0.0000044701287],"category_scores_gemma":[0.00011868249,0.000060179653,0.000034275236,0.00043877077,0.0000633352,0.00029409496,0.00015836836,0.00011916663,0.00001030422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039795614,0.0024894113,0.034579497,0.00041696866,0.000038578968,0.000002266316,0.023762919,0.04898477,0.0009701268,0.34257525,0.015685389,0.53045505],"study_design_scores_gemma":[0.00020649958,0.0001473361,0.0040247296,0.00013197033,0.0000063223706,0.000012944969,0.00009546641,0.9411101,0.050534505,0.001537114,0.0018786826,0.00031434663],"about_ca_topic_score_codex":0.00000913039,"about_ca_topic_score_gemma":4.0809346e-7,"teacher_disagreement_score":0.9140201,"about_ca_system_score_codex":0.000014929582,"about_ca_system_score_gemma":0.000041291318,"threshold_uncertainty_score":0.24540551},"labels":[],"label_agreement":null},{"id":"W2140712232","doi":"10.1109/iccd.2001.955072","title":"Fast specification of cycle-accurate processor models","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Coprocessor; Computer architecture; Instructions per cycle; Software; Programming language; Parallel computing; Embedded system; Operating system; Central processing unit","score_opus":0.045429306646562,"score_gpt":0.25173933284665295,"score_spread":0.20631002620009095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140712232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005223719,0.000045802215,0.911657,0.00028700338,0.00002996699,0.00007057436,2.7487704e-7,0.00037571322,0.087011345],"genre_scores_gemma":[0.6660011,0.000031286596,0.33317834,0.00006374219,0.000010950956,0.0000026626121,4.602721e-7,0.0000028330273,0.0007086463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935746,0.000014728553,0.0002011339,0.0001742157,0.0001414242,0.00011106368],"domain_scores_gemma":[0.999426,0.000022189668,0.000101201724,0.00029027925,0.000127973,0.00003234728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013367609,0.000061392195,0.00008018122,0.00008729948,0.000038538463,0.000040543637,0.00045126033,0.000031722626,0.000027233154],"category_scores_gemma":[0.000009846263,0.000054248605,0.000024238538,0.00033448276,0.000018994455,0.00036786773,0.00006559501,0.000039432587,0.00002197052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005407118,0.0002780017,0.00005471983,0.00004016013,0.000013063717,0.0000021073627,0.0021491442,0.28700116,0.0007485073,0.5424073,0.0065834024,0.16071704],"study_design_scores_gemma":[0.000059016533,0.000019564022,0.00004850736,0.000006365816,6.304683e-7,0.0000019519266,0.0000074519894,0.98438287,0.009041695,0.0061127027,0.0002503327,0.000068919246],"about_ca_topic_score_codex":0.0000057198013,"about_ca_topic_score_gemma":5.2175824e-7,"teacher_disagreement_score":0.6973817,"about_ca_system_score_codex":0.0000090923495,"about_ca_system_score_gemma":0.000005948103,"threshold_uncertainty_score":0.22121939},"labels":[],"label_agreement":null},{"id":"W2141244992","doi":"10.1109/lcn.2004.20","title":"An evaluation of the Myrinet/GM2 two-port networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Remote direct memory access; Computer science; Message passing; Port (circuit theory); Bandwidth (computing); Parallel computing; Overhead (engineering); Reuse; Message Passing Interface; Computation; Operating system; Computer network; Programming language","score_opus":0.02693629116393607,"score_gpt":0.3116396980650344,"score_spread":0.2847034069010983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141244992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010815399,0.00004587992,0.9727269,0.00039769296,0.00009624527,0.00012847553,7.3461436e-8,0.00022687533,0.015562499],"genre_scores_gemma":[0.84083205,0.000003319932,0.15863435,0.00029616858,0.00006741693,0.000004549036,8.044563e-7,0.0000026759506,0.00015863635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991132,0.00012756983,0.00017021704,0.00015812303,0.0003285514,0.00010231381],"domain_scores_gemma":[0.99909437,0.000018088802,0.00008859981,0.000561141,0.00020921101,0.00002859947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981197,0.000058290698,0.00006440135,0.00003249635,0.00006524086,0.000038990645,0.0006799566,0.000026709986,0.00003091858],"category_scores_gemma":[0.000016859853,0.00003942937,0.000033616478,0.0002499709,0.000020203348,0.0002270426,0.00010204643,0.000056381705,0.0000033003903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4848656e-7,0.000029679972,0.00075361325,3.951628e-7,0.0000022855695,3.060521e-8,0.000057179634,0.91213787,0.00003290663,0.011791819,0.0013649121,0.07382886],"study_design_scores_gemma":[0.00012546737,0.00001780871,0.0036614249,0.0000042850575,0.0000042748648,0.0000021350586,0.0000017645668,0.9920868,0.0027852857,0.00087698794,0.00037968252,0.000054043318],"about_ca_topic_score_codex":0.000021127717,"about_ca_topic_score_gemma":0.00001804696,"teacher_disagreement_score":0.8300167,"about_ca_system_score_codex":0.000022649489,"about_ca_system_score_gemma":0.00005483715,"threshold_uncertainty_score":0.16078831},"labels":[],"label_agreement":null},{"id":"W2141355718","doi":"10.1109/hpca.1996.501173","title":"Co-scheduling hardware and software pipelines","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Pipeline transport; Scheduling (production processes); Control reconfiguration; Software; Software pipelining; Pipeline (software); Parallel computing; Embedded system; Reservation; Schedule; Operating system; Engineering","score_opus":0.02671676126886029,"score_gpt":0.2591918932085215,"score_spread":0.23247513193966118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141355718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008664302,0.0003789237,0.99087816,0.0006058828,0.000051005918,0.0000462057,3.8756787e-7,0.001176211,0.0059967665],"genre_scores_gemma":[0.1070283,0.00010299277,0.8900244,0.00066449965,0.000038612125,0.0000029021403,8.800284e-7,0.0000050454414,0.0021323713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941635,0.00001961075,0.00011622603,0.0002172619,0.00009914194,0.00013141715],"domain_scores_gemma":[0.9995824,0.000048586655,0.000031444157,0.00022599653,0.000054302935,0.000057248482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086742344,0.000078519144,0.00008357747,0.000058166195,0.00011653184,0.00014142563,0.00028483663,0.0000364873,0.00005003075],"category_scores_gemma":[0.000054263706,0.00006840958,0.000020727985,0.00013148051,0.000019999992,0.00021120708,0.0000749778,0.000057903195,0.000041673695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037793288,0.00021479021,0.015754199,0.00008456372,0.000039229577,0.000047198457,0.002608381,0.019771758,0.00033397984,0.056398377,0.19168808,0.7130557],"study_design_scores_gemma":[0.00012856533,0.000026507794,0.0002158438,0.000014696274,0.0000013594729,0.000021554906,0.0000072297685,0.9869418,0.0017327928,0.0011098704,0.009634527,0.0001652206],"about_ca_topic_score_codex":0.000005009988,"about_ca_topic_score_gemma":5.381488e-7,"teacher_disagreement_score":0.96717006,"about_ca_system_score_codex":0.0000056287113,"about_ca_system_score_gemma":0.0000044212156,"threshold_uncertainty_score":0.27896616},"labels":[],"label_agreement":null},{"id":"W2141547276","doi":"10.1109/hpcsa.2002.1019158","title":"Towards asynchronous metacomputing in MPI","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"SPMD; Computer science; Metacomputing; Asynchronous communication; Parallel computing; Workload; Exploit; Thread (computing); Distributed computing; Operating system; Titan (rocket family); Grid; Message passing; Supercomputer; Computer network","score_opus":0.017151543122122477,"score_gpt":0.2637272608557148,"score_spread":0.24657571773359233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141547276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001889713,0.000121698526,0.88866955,0.00016821093,0.00011670385,0.0000668215,3.5074155e-8,0.00054483995,0.108422406],"genre_scores_gemma":[0.5266556,0.000005457681,0.47298086,0.00023835141,0.000007065505,0.0000024043782,1.3296597e-7,0.0000031772333,0.000106916144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990184,0.000108353066,0.00021167367,0.0002835713,0.00013432505,0.00024368703],"domain_scores_gemma":[0.99951786,0.000031669617,0.000044800552,0.0003170111,0.000038839895,0.00004983727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005359484,0.00009901733,0.00013319914,0.00014973994,0.000058050584,0.00010141227,0.00046572322,0.00004431322,0.00001909271],"category_scores_gemma":[0.000073998875,0.00009048522,0.000039131788,0.0005110983,0.000013071851,0.0001925928,0.000104792234,0.000099467514,0.000027913478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.235694e-7,0.000108720014,0.002222918,0.000008378844,0.000009452383,0.000022820259,0.00046210946,0.0309735,0.000068960755,0.90272313,0.0009569269,0.062442265],"study_design_scores_gemma":[0.0004308899,0.000072696435,0.0025127172,0.000028447303,0.00000203136,0.000040628023,0.000019157704,0.95181274,0.013861113,0.024912024,0.0059023118,0.00040522858],"about_ca_topic_score_codex":0.000035227626,"about_ca_topic_score_gemma":0.0000044258327,"teacher_disagreement_score":0.92083925,"about_ca_system_score_codex":0.00004223834,"about_ca_system_score_gemma":0.000077927034,"threshold_uncertainty_score":0.36898804},"labels":[],"label_agreement":null},{"id":"W2141723551","doi":"10.1109/asap.2007.4429954","title":"Evaluation of a High-Level-Language Methodology for High-Performance Reconfigurable Computers","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Speedup; Computer science; Field-programmable gate array; Verilog; High-level programming language; Parallel computing; Hardware description language; VHDL; Floating point; Reconfigurable computing; Computer architecture; High-level synthesis; Programming paradigm; Computer hardware; Programming language","score_opus":0.11815726248412649,"score_gpt":0.3565272919581643,"score_spread":0.2383700294740378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141723551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08535726,0.00005440597,0.9111662,0.00017339422,0.0003922616,0.00034536893,0.0000018416443,0.00026890705,0.0022403668],"genre_scores_gemma":[0.4936511,0.0000051007514,0.50606745,0.0001319691,0.000025033787,0.00000986756,0.000004650678,0.000004194858,0.000100600235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984541,0.00021926923,0.00038660227,0.0003068399,0.00037227583,0.00026091404],"domain_scores_gemma":[0.9981072,0.000597497,0.00020421647,0.00040684044,0.0006374677,0.0000468072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008349716,0.000114140785,0.00022776586,0.00022052167,0.000079954785,0.00002727721,0.00055726955,0.00008487391,0.000022747272],"category_scores_gemma":[0.0002215367,0.000104740764,0.00004140829,0.00033841698,0.000033472053,0.00031311088,0.000058978436,0.00006459279,0.000004373806],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003040727,0.000075175965,0.000050972303,0.000037758844,0.000051903593,6.958739e-7,0.0007276939,0.044769093,0.0036678757,0.12401227,0.0017819036,0.82479423],"study_design_scores_gemma":[0.00075484323,0.00022871076,0.00253986,0.000021998267,0.000021430096,0.0000066392977,0.00002067218,0.6480565,0.3415922,0.0064886133,0.00010517216,0.00016338902],"about_ca_topic_score_codex":0.00012887716,"about_ca_topic_score_gemma":0.000012574945,"teacher_disagreement_score":0.82463086,"about_ca_system_score_codex":0.00006105457,"about_ca_system_score_gemma":0.000098702745,"threshold_uncertainty_score":0.42712045},"labels":[],"label_agreement":null},{"id":"W2141772614","doi":"10.1109/ipdps.2008.4536122","title":"Why shared memory matters to VLSI design: The BSR is as powerful as reconfiguration","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Control reconfiguration; Computer science; Overhead (engineering); Very-large-scale integration; Collision; Shared memory; Reduction (mathematics); Parallel computing; Power (physics); Conflict resolution; Computer architecture; Distributed computing; Embedded system; Programming language","score_opus":0.03217193234443762,"score_gpt":0.2646265559668871,"score_spread":0.2324546236224495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141772614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078415294,0.000018896988,0.91597325,0.058779903,0.00016501574,0.00031197089,4.758429e-7,0.0006493557,0.02331696],"genre_scores_gemma":[0.08891541,0.00004322465,0.5970616,0.2955423,0.00009552801,0.00004175537,0.000004876333,0.000024373401,0.018270973],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879485,0.00012281165,0.00022461177,0.0003663403,0.0002674717,0.00022390412],"domain_scores_gemma":[0.99898607,0.000108845925,0.000072679686,0.0006059671,0.00012999716,0.000096441654],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002935808,0.0001405545,0.000119139986,0.00010931958,0.00027642862,0.00020699041,0.00094071426,0.00005660726,0.000458086],"category_scores_gemma":[0.00005038203,0.00010406168,0.00005547298,0.00039991146,0.00003213583,0.00036507144,0.00013892073,0.0000928927,0.0010274155],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071670315,0.000019649682,0.000012786257,0.0000016069444,0.0000085906895,0.000009411083,0.0024998582,0.0039710137,0.0003040783,0.0009547929,0.9893271,0.0028839987],"study_design_scores_gemma":[0.00074351113,0.0008883409,0.00088470464,0.00009000645,0.000014395624,0.0006472607,0.00022980254,0.4585283,0.27177373,0.006584079,0.25827095,0.001344901],"about_ca_topic_score_codex":0.00018360734,"about_ca_topic_score_gemma":0.0000025043175,"teacher_disagreement_score":0.7310561,"about_ca_system_score_codex":0.000035908306,"about_ca_system_score_gemma":0.00007687424,"threshold_uncertainty_score":0.9997504},"labels":[],"label_agreement":null},{"id":"W2141818421","doi":"10.1145/781027.781030","title":"A framework for modeling and optimization of prescient instruction prefetch","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instruction prefetch; Computer science; Parallel computing","score_opus":0.028476297607723747,"score_gpt":0.27695447194323275,"score_spread":0.248478174335509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141818421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020958344,0.00004173398,0.9966929,0.00005414706,0.000079632555,0.00017088701,2.662845e-7,0.0001513779,0.0007132185],"genre_scores_gemma":[0.27640754,0.000017538989,0.7235128,0.000025462972,0.0000045678375,0.000008338425,4.4312947e-7,0.0000024837343,0.000020789379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994847,0.000024269237,0.00014743165,0.00017675759,0.00008163273,0.000085177344],"domain_scores_gemma":[0.9996008,0.000039483093,0.00005649132,0.00016373089,0.00011239849,0.00002708351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020671684,0.000051810548,0.0000721497,0.00007096506,0.00006776498,0.000044724657,0.00012418244,0.00004661175,0.0000021748426],"category_scores_gemma":[0.00011275477,0.00004744767,0.000018642213,0.00017869366,0.000013095213,0.00018499937,0.00003519493,0.000031202733,9.236232e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011999484,0.000008218292,0.000022749258,0.0000064529477,0.0000014934021,9.159803e-9,0.00007884546,0.6990477,0.000008006086,0.29916495,0.000012162327,0.0016482474],"study_design_scores_gemma":[0.000120470104,0.00003747377,0.0000031530246,0.000014476792,0.0000016096345,0.000002129803,0.000008112525,0.95376617,0.0021221705,0.043823086,0.00004813326,0.000053021322],"about_ca_topic_score_codex":0.0000032084138,"about_ca_topic_score_gemma":2.0925313e-7,"teacher_disagreement_score":0.27431172,"about_ca_system_score_codex":0.000008237593,"about_ca_system_score_gemma":0.000022693624,"threshold_uncertainty_score":0.19348598},"labels":[],"label_agreement":null},{"id":"W2141930736","doi":"10.1145/775832.776025","title":"A retargetable micro-architecture simulator","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture; Computer architecture simulator; Microprocessor; Architecture; Embedded system; Instruction set; Microarchitecture; System on a chip; Cache; Operating system; Computer hardware","score_opus":0.009667757354171252,"score_gpt":0.2330287881282322,"score_spread":0.22336103077406094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141930736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071100605,0.00014763097,0.95649767,0.00027833853,0.000086556036,0.00007232723,1.4970587e-7,0.0007722949,0.04143401],"genre_scores_gemma":[0.2260324,0.0000049771184,0.7702601,0.00075620506,0.000011020692,0.0000026382288,4.5722584e-7,0.000005178153,0.002926994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926335,0.0000626489,0.00012110554,0.00024256596,0.00010921691,0.00020110972],"domain_scores_gemma":[0.999413,0.00003925114,0.00003265477,0.00040304853,0.000048491333,0.00006354866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019209775,0.0000899983,0.000094220006,0.00006768072,0.00009527273,0.000100318946,0.00041030502,0.000044855555,0.00005411414],"category_scores_gemma":[0.00005116372,0.0000746394,0.000043683176,0.00029584303,0.0000137017205,0.00012344196,0.00006443309,0.00008668292,0.000052267496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039652136,0.00015772911,0.0014064021,0.000018621353,0.000030092497,0.000018048375,0.0006300806,0.21244307,0.0038812368,0.7280067,0.03897038,0.014433645],"study_design_scores_gemma":[0.0005730849,0.000109446504,0.00015119913,0.00002092454,0.0000049628707,0.00006753707,0.000008323636,0.45585746,0.13656184,0.063264534,0.34272477,0.00065590465],"about_ca_topic_score_codex":0.0000034169962,"about_ca_topic_score_gemma":3.9740522e-7,"teacher_disagreement_score":0.6647422,"about_ca_system_score_codex":0.000011650153,"about_ca_system_score_gemma":0.000036186408,"threshold_uncertainty_score":0.30437064},"labels":[],"label_agreement":null},{"id":"W2142002613","doi":"10.1109/hpca.2005.17","title":"Improving Multiple-CMP Systems Using Token Coherence","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Cache coherence; Correctness; Protocol (science); Distributed computing; Coherence (philosophical gambling strategy); Security token; Directory; Parallel computing; Computer network; Operating system; CPU cache; Programming language; Cache","score_opus":0.02866419626667977,"score_gpt":0.2619614690552062,"score_spread":0.2332972727885264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142002613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005653774,0.00013721932,0.9887845,0.00010147891,0.0001719239,0.00014590601,3.4982557e-7,0.0010834653,0.0039213737],"genre_scores_gemma":[0.5278717,0.0000019801644,0.47152084,0.000119875825,0.000066296074,0.0000036045105,3.6290993e-7,0.000004340803,0.00041099114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990405,0.00004802154,0.00022422979,0.000284886,0.0001693997,0.00023296197],"domain_scores_gemma":[0.99928015,0.000069126385,0.00009731274,0.00039189562,0.00009152915,0.00006995738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024239256,0.00010848216,0.00011909559,0.00008084405,0.00013840184,0.00026803612,0.0006360321,0.00005181596,0.000006921518],"category_scores_gemma":[0.000042932217,0.000097523036,0.000033288325,0.00021764131,0.000017112132,0.0004870849,0.00022632664,0.00008153328,0.000031702835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048742804,0.00011538719,0.003421425,0.000048117126,0.000021844948,0.000009776312,0.0006388767,0.8296588,0.010094891,0.02872101,0.00381821,0.123446755],"study_design_scores_gemma":[0.000116690935,0.000015028777,0.000052050007,0.00001705506,0.0000013511776,0.00001688727,0.000008362263,0.9943679,0.0037873466,0.000027261263,0.0014470661,0.00014302408],"about_ca_topic_score_codex":0.00030447307,"about_ca_topic_score_gemma":0.000006030441,"teacher_disagreement_score":0.5222179,"about_ca_system_score_codex":0.00006106526,"about_ca_system_score_gemma":0.00005065126,"threshold_uncertainty_score":0.3976874},"labels":[],"label_agreement":null},{"id":"W2142103345","doi":"10.1109/iccl.1992.185488","title":"Designing programming languages for analyzability: a fresh look at pointer data structures","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Pointer (user interface); Computer science; Compiler; Traverse; Programming language; Data structure; Parallel computing; Exploit; Identifier; Artificial intelligence","score_opus":0.03911890317694676,"score_gpt":0.31702601203683317,"score_spread":0.2779071088598864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142103345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001244581,0.00016287135,0.99529976,0.00014088911,0.00005435511,0.00028126405,0.0000033315757,0.0006107562,0.0022021679],"genre_scores_gemma":[0.13718867,0.0000023428834,0.86195385,0.0002534702,0.000021439953,0.000013897272,0.000018879644,0.000008094439,0.0005393425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998842,0.00008345623,0.0001921581,0.0004983947,0.00012986948,0.00025409344],"domain_scores_gemma":[0.9986423,0.00015203678,0.000069717666,0.0010024307,0.000073614945,0.00005988847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564941,0.000119145996,0.00013916777,0.000076630706,0.00016243942,0.00020831656,0.0009877905,0.00004725185,0.000036291698],"category_scores_gemma":[0.00024915842,0.000097977834,0.000044699776,0.00018091283,0.000030874795,0.00029481185,0.00041166984,0.00005835327,0.000003716397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007885027,0.00045558647,0.027058626,0.00034752476,0.00042015527,0.00006323225,0.004196785,0.010399875,0.004625374,0.4290473,0.24602334,0.27728337],"study_design_scores_gemma":[0.001971324,0.0004137464,0.0005052006,0.000083999286,0.000057035333,0.00015091668,0.0004705004,0.6967074,0.14909233,0.035237163,0.11387224,0.0014380903],"about_ca_topic_score_codex":0.000019414385,"about_ca_topic_score_gemma":0.00002801398,"teacher_disagreement_score":0.68630755,"about_ca_system_score_codex":0.000030834828,"about_ca_system_score_gemma":0.00003841539,"threshold_uncertainty_score":0.399542},"labels":[],"label_agreement":null},{"id":"W2142542855","doi":"10.1109/spdp.1993.395551","title":"Architectural support for block transfers in a shared-memory multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiprocessing; Computer science; Block (permutation group theory); Initialization; Architecture; Parallel computing; Code (set theory); Operating system; Programming language; Set (abstract data type)","score_opus":0.024288363504638418,"score_gpt":0.25517022363973224,"score_spread":0.23088186013509382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142542855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074425586,0.000024700374,0.98348147,0.001369591,0.000062002226,0.0003283636,0.0000030579179,0.00065113395,0.0066371267],"genre_scores_gemma":[0.67442757,0.0000045051092,0.32331237,0.0005039576,0.000017993609,0.000048355763,0.0000020829957,0.000006811265,0.001676335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907005,0.00001908028,0.00021309062,0.00031181163,0.000116670286,0.00026928438],"domain_scores_gemma":[0.999569,0.00007321173,0.000026619777,0.0002265264,0.000044885433,0.00005974641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013572638,0.00011256346,0.00013188928,0.00015952096,0.00005863427,0.000075038115,0.0005603115,0.000048160466,0.00004796689],"category_scores_gemma":[0.000028854527,0.00010059022,0.00006367569,0.00027343768,0.000019696112,0.00017814345,0.000043754175,0.000084419895,0.000015691905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069950904,0.0009531826,0.0014883636,0.00030010875,0.000054201017,0.00006413407,0.02261375,0.16501181,0.0013713822,0.011407692,0.0466716,0.74999386],"study_design_scores_gemma":[0.00061200536,0.00014330061,0.00023330188,0.000012607109,0.000001290735,0.000020336109,0.000010894732,0.99426514,0.0032208005,0.0005365817,0.0007594281,0.0001842975],"about_ca_topic_score_codex":0.000014437203,"about_ca_topic_score_gemma":0.000015469754,"teacher_disagreement_score":0.8292534,"about_ca_system_score_codex":0.00001926072,"about_ca_system_score_gemma":0.000015432111,"threshold_uncertainty_score":0.41019502},"labels":[],"label_agreement":null},{"id":"W2142687109","doi":"10.5555/1898699.1898724","title":"Towards MPI progression layer elimination with TCP and SCTP","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Computer science; Component (thermodynamics); Scalability; Transport layer; Computer network; Distributed computing; Protocol stack; Middleware (distributed applications); Layer (electronics); Transmission Control Protocol; Application layer; Operating system","score_opus":0.010661210844325841,"score_gpt":0.26303023009494186,"score_spread":0.252369019250616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142687109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062470064,0.000057879653,0.9641231,0.0011070967,0.000023368797,0.00009327252,1.0814253e-7,0.0005867607,0.027761428],"genre_scores_gemma":[0.5618539,0.0000049394457,0.43751928,0.000087810375,0.000016707498,0.0000052021724,0.0000013766401,0.0000028028403,0.0005079708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.000022559287,0.00009288337,0.00019995667,0.00016099018,0.00010962961],"domain_scores_gemma":[0.9996776,0.000012501431,0.000044382225,0.00015699782,0.00008046261,0.000028055842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012677668,0.00007195308,0.00006301741,0.00006789066,0.00008640597,0.00013353034,0.0001611836,0.000033102453,0.0000047129565],"category_scores_gemma":[0.000004855416,0.000049449805,0.00000963092,0.00018268052,0.000023540333,0.00023906305,0.00008457687,0.00004060369,0.0000034823736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019353,0.00022339112,0.0054020616,0.000032204083,0.000009972489,0.000018341723,0.00032475498,0.004015699,0.0007298028,0.47996956,0.018998353,0.49025565],"study_design_scores_gemma":[0.000646304,0.00040416393,0.036294486,0.00008586824,0.0000059737604,0.00005419307,0.000011225063,0.8969793,0.04770736,0.010454441,0.006933034,0.00042367933],"about_ca_topic_score_codex":0.00003400892,"about_ca_topic_score_gemma":0.0000050073286,"teacher_disagreement_score":0.8929636,"about_ca_system_score_codex":0.000010795623,"about_ca_system_score_gemma":0.000021773345,"threshold_uncertainty_score":0.20165046},"labels":[],"label_agreement":null},{"id":"W2142759683","doi":"10.1109/fpl.2011.34","title":"Hardware Support for Broadcast and Reduce in MPSoC","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; MPSoC; Multiprocessing; Key (lock); Field-programmable gate array; Programming paradigm; Parallel computing; Computer architecture; Network on a chip; Embedded system; Component (thermodynamics); Message Passing Interface; Message passing; Operating system","score_opus":0.048940037051358284,"score_gpt":0.280070463562877,"score_spread":0.23113042651151872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142759683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013731777,0.000040184605,0.97599566,0.00012341634,0.000054830267,0.00012495185,5.5133734e-7,0.0002561598,0.022031069],"genre_scores_gemma":[0.23311105,0.000029659806,0.7639026,0.00025585954,0.000011382491,0.000016488415,0.0000011794424,0.0000041246776,0.0026676506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950033,0.000012721307,0.00011336629,0.0001987106,0.000045907575,0.00012895292],"domain_scores_gemma":[0.9997034,0.000020802074,0.000026412443,0.00017565381,0.000036297748,0.00003741783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017093473,0.000056441815,0.0000741702,0.00007007344,0.000035237186,0.000034961806,0.00025167453,0.000031751177,0.000016039225],"category_scores_gemma":[0.000015598818,0.000051488147,0.000016635986,0.00010723389,0.000015650205,0.000166079,0.00010050445,0.000033981523,0.0000041585527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041070525,0.00028811875,0.008640352,0.00006688039,0.000018519931,0.000024461739,0.008434769,0.00018885949,0.00033253536,0.39816198,0.049828034,0.5339744],"study_design_scores_gemma":[0.0024364672,0.001060012,0.019455547,0.00009326378,0.000009099442,0.000115298506,0.00015356425,0.78049695,0.059502024,0.071127325,0.06430992,0.0012405559],"about_ca_topic_score_codex":0.00002403473,"about_ca_topic_score_gemma":0.0000032424668,"teacher_disagreement_score":0.78030807,"about_ca_system_score_codex":0.000007538525,"about_ca_system_score_gemma":0.000023059923,"threshold_uncertainty_score":0.20996256},"labels":[],"label_agreement":null},{"id":"W2142912837","doi":"10.1109/ccece.1993.332332","title":"Performance analysis for a cache system with different DRAM designs","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Toronto Metropolitan University","funders":"","keywords":"Cache; Computer science; Page cache; Dram; Cache algorithms; Cache pollution; Cache coloring; Cache invalidation; Parallel computing; CPU cache; Smart Cache; Operating system; Embedded system; Computer hardware","score_opus":0.040728091725205744,"score_gpt":0.23684022532607266,"score_spread":0.1961121336008669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142912837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013482717,0.000023270102,0.9809746,0.000101840276,0.000022407108,0.0001769016,4.594871e-7,0.0007907874,0.004427007],"genre_scores_gemma":[0.75695276,0.0000048902016,0.24194877,0.00004811233,0.000011493119,0.000037292877,0.0000011333749,0.000003914046,0.0009916374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992349,0.000027899823,0.0001418285,0.00025495092,0.0001562376,0.00018414186],"domain_scores_gemma":[0.9993676,0.000050172843,0.00006247318,0.000372798,0.000091970294,0.0000549629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011731394,0.000106056366,0.00017300439,0.00015657787,0.00014230036,0.00011174812,0.00041878587,0.000035540394,0.000009368369],"category_scores_gemma":[0.000003880697,0.000069855756,0.00006913915,0.0005721154,0.00001340686,0.00013527962,0.000047987553,0.00004303161,0.0000055034143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038484453,0.00054675696,0.09472487,0.00031800932,0.0014149527,0.000010946669,0.0024815826,0.75978017,0.00008375882,0.08780474,0.009140381,0.043655343],"study_design_scores_gemma":[0.00014047697,0.00014074858,0.0017915685,0.000012159904,0.00003801586,0.0000040095233,0.000008298585,0.9970019,0.00063612295,0.0000060343978,0.00010057588,0.00012010811],"about_ca_topic_score_codex":0.000009453514,"about_ca_topic_score_gemma":0.000004880465,"teacher_disagreement_score":0.74347,"about_ca_system_score_codex":0.00004024795,"about_ca_system_score_gemma":0.000006513809,"threshold_uncertainty_score":0.2848635},"labels":[],"label_agreement":null},{"id":"W2143045374","doi":"10.1109/ccece.2011.6030678","title":"Controller design for matrix multiplication on FPGAs","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Field-programmable gate array; Computer science; Matrix multiplication; Computer architecture; Scheduling (production processes); Multiplication (music); Parallel computing; Embedded system; Floating point; Implementation; Parallelizable manifold; Control logic; Computer hardware; Engineering; Operating system; Algorithm; Programming language","score_opus":0.07026307787141937,"score_gpt":0.2960475449911548,"score_spread":0.22578446711973543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143045374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000053020267,0.00001138858,0.991722,0.00018913281,0.00005090058,0.00040361137,2.871058e-7,0.00068342,0.006886244],"genre_scores_gemma":[0.24907415,0.0000029629282,0.7495439,0.00032080946,0.000015429148,0.00006604087,5.466566e-7,0.000004252592,0.00097192626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.00003429556,0.00012603037,0.00020873181,0.00006951059,0.00012307841],"domain_scores_gemma":[0.99945176,0.00012178987,0.000054617198,0.0002503148,0.00008585216,0.000035683748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025261272,0.00007004022,0.00007953309,0.00006452926,0.00007671668,0.000037186674,0.0003828704,0.000038876726,0.000008607024],"category_scores_gemma":[0.000040011313,0.000056890876,0.000039254093,0.00009261405,0.00000921424,0.000105966865,0.000033311728,0.000029468494,0.00004455099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117613185,0.0002535699,0.000057578938,0.0000073509373,0.000023900819,7.42222e-7,0.00074688037,0.01944031,0.00061443757,0.89484966,0.034886684,0.049001254],"study_design_scores_gemma":[0.00041943113,0.00018123296,0.00013237249,0.000004032548,0.000001722956,9.829278e-7,0.0000019082606,0.964076,0.019004205,0.01478267,0.0012992466,0.000096186144],"about_ca_topic_score_codex":0.0000070939204,"about_ca_topic_score_gemma":1.716257e-7,"teacher_disagreement_score":0.9446357,"about_ca_system_score_codex":0.000013027293,"about_ca_system_score_gemma":0.000013929448,"threshold_uncertainty_score":0.23199426},"labels":[],"label_agreement":null},{"id":"W2143104153","doi":"10.1109/tvlsi.2010.2062545","title":"Two-Stage, Pipelined Register Renaming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Latency (audio); Register file; Parallel computing; Instructions per cycle; Logic synthesis; Computer architecture; Instruction set; Logic gate; Computer hardware; Central processing unit; Algorithm","score_opus":0.015097613562921944,"score_gpt":0.2679675271092134,"score_spread":0.25286991354629146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143104153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043954393,0.000029100476,0.98431295,0.00031050126,0.0045986734,0.00045508877,0.00003260861,0.0013433881,0.0045222268],"genre_scores_gemma":[0.94293576,0.00001617297,0.04609249,0.00026025792,0.00021091817,0.00011591331,0.00001345874,0.00003393331,0.010321074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741477,0.00023542022,0.00071260263,0.0006911601,0.0005093249,0.0004367497],"domain_scores_gemma":[0.9979076,0.0001523022,0.0002687107,0.0011287029,0.0003684465,0.00017426843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008521104,0.00033275873,0.0003428522,0.0004357569,0.0005392301,0.0005684866,0.00079758134,0.00023968436,0.000049074733],"category_scores_gemma":[0.000023609777,0.0003032976,0.00020732188,0.0006541492,0.0000607549,0.00085575035,0.000007464582,0.00076942856,0.00015046367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033087019,0.003347179,0.00027105308,0.000370824,0.0003527856,0.000114061,0.0106352605,0.69334465,0.10167177,0.07587572,0.028620422,0.08506538],"study_design_scores_gemma":[0.0006527994,0.00010454271,0.000017799126,0.00014090963,0.000014103366,0.0000502142,0.00018233088,0.9527067,0.035140738,0.00008904949,0.010489059,0.00041175025],"about_ca_topic_score_codex":0.00017514812,"about_ca_topic_score_gemma":0.0004605887,"teacher_disagreement_score":0.93854034,"about_ca_system_score_codex":0.000097065415,"about_ca_system_score_gemma":0.000101199395,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W2143112169","doi":"10.1109/dsd.2002.1115391","title":"Hardware implementation of a memory allocator","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Allocator; Computer science; Memory management; Embedded system; System on a chip; Task (project management); Memory protection; Computer architecture; Extended memory; Parallel computing; Operating system; Semiconductor memory; Engineering","score_opus":0.015709378177999864,"score_gpt":0.28805936159388595,"score_spread":0.27234998341588607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143112169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028298658,0.000027796554,0.9812431,0.000099091274,0.000051623894,0.000066933564,2.5529107e-7,0.00021041102,0.015470922],"genre_scores_gemma":[0.58954376,0.000004361519,0.41002822,0.00014099322,0.0000032621977,0.0000036909971,6.132143e-7,0.0000019859974,0.00027312766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952865,0.000040057548,0.00013461952,0.00011672292,0.00009816051,0.0000818086],"domain_scores_gemma":[0.99963593,0.000016161319,0.00005278018,0.00020565282,0.00006420513,0.00002527598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016590962,0.000044034583,0.0000614583,0.00005417545,0.00002933711,0.000019760568,0.00021345561,0.000016202432,0.00006980493],"category_scores_gemma":[0.000012059455,0.000039950675,0.000024577776,0.00016605189,0.000008784926,0.00012490031,0.000034065317,0.000021154925,0.000007072309],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014031904,0.000081286154,0.003100531,0.000025661286,0.000026443577,0.0000025663421,0.0013856742,0.0020968285,0.0016114658,0.90748644,0.022800244,0.061381437],"study_design_scores_gemma":[0.00082281133,0.00020263299,0.002438519,0.00001784737,0.0000069889516,0.000017136868,0.00047609842,0.04949097,0.9209377,0.009751895,0.015444382,0.00039302366],"about_ca_topic_score_codex":0.000025749949,"about_ca_topic_score_gemma":0.0000032078594,"teacher_disagreement_score":0.91932625,"about_ca_system_score_codex":0.0000092384735,"about_ca_system_score_gemma":0.000048703507,"threshold_uncertainty_score":0.16291413},"labels":[],"label_agreement":null},{"id":"W2143226612","doi":"10.5555/1950815.1950911","title":"Register pressure aware scheduling for high level synthesis","year":2011,"lang":"en","type":"article","venue":"Asia and South Pacific Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Register allocation; Computer science; Instruction scheduling; High-level synthesis; Parallel computing; Scheduling (production processes); Serialization; Optimizing compiler; Compiler; Data-flow analysis; Two-level scheduling; Dynamic priority scheduling; Schedule; Embedded system; Field-programmable gate array; Programming language; Mathematical optimization; Operating system; Data flow diagram; Mathematics","score_opus":0.11305510317106648,"score_gpt":0.26002247880503,"score_spread":0.1469673756339635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143226612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028543585,0.00003641153,0.99666417,0.00017657691,0.00011516224,0.00038018706,0.000010419382,0.00070578675,0.0016258452],"genre_scores_gemma":[0.5521695,0.0000053294,0.44736955,0.000023442515,0.000011906717,0.00006542293,0.0000022361046,0.000006340486,0.00034624463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880576,0.00013677459,0.00027096586,0.00041548797,0.00015262887,0.00021836802],"domain_scores_gemma":[0.9989098,0.00018315966,0.00019582381,0.00039230188,0.00023895629,0.00007997267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045915964,0.00016739308,0.00019956089,0.000117703785,0.00023027905,0.00023208931,0.0004161671,0.000115652896,0.000020762216],"category_scores_gemma":[0.00014128836,0.00015560977,0.000039191556,0.00014546413,0.00005345981,0.00037783475,0.00006817547,0.00007583268,0.000011501914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012683013,0.00022542872,0.0014149541,0.00044342774,0.0002517111,0.000013336723,0.052188363,0.004748075,0.0006838506,0.7374194,0.00433137,0.1981532],"study_design_scores_gemma":[0.00022574227,0.000080556136,0.001561302,0.00010222425,0.000027432594,0.000007746195,0.00033296994,0.9822145,0.0055280924,0.009413357,0.00020616171,0.00029988895],"about_ca_topic_score_codex":0.0000078899775,"about_ca_topic_score_gemma":2.6370395e-7,"teacher_disagreement_score":0.97746646,"about_ca_system_score_codex":0.000008636274,"about_ca_system_score_gemma":0.00008782963,"threshold_uncertainty_score":0.6345582},"labels":[],"label_agreement":null},{"id":"W2143377682","doi":"10.1109/clustr.2007.4629224","title":"A Feasibility Analysis of Power-Awareness and Energy Minimization in Modern Interconnects for High-Performance Computing","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Myrinet; Computer science; Supercomputer; Gigabit Ethernet; Ethernet; Energy consumption; Reliability (semiconductor); Power (physics); Efficient energy use; Computer cluster; Gigabit; Distributed computing; Operating system; Embedded system; Computer architecture; Message passing; Telecommunications; Electrical engineering","score_opus":0.020626384495871536,"score_gpt":0.2839515362054723,"score_spread":0.2633251517096008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143377682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43451995,0.000017359876,0.56517005,0.00001805644,0.000025807902,0.000043938704,5.6761445e-7,0.0000739666,0.00013033686],"genre_scores_gemma":[0.78836054,0.000006755453,0.21153381,0.00006710264,0.0000040036857,0.000001781121,0.0000059880686,0.000003376027,0.000016617234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.000035493606,0.00038493378,0.0003253612,0.00010667044,0.0001790853],"domain_scores_gemma":[0.9991656,0.00023888853,0.00014169619,0.00026574123,0.00015047617,0.00003760555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005941989,0.00009725012,0.00025797932,0.00052663725,0.000056794503,0.00003380344,0.00027422237,0.00005845634,0.000001333417],"category_scores_gemma":[0.00004923961,0.00009334572,0.00003886203,0.0010630847,0.000027833048,0.00020265656,0.00013520101,0.000033921562,4.5599947e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009723586,0.00030257672,0.22218025,0.00008662328,0.0001605342,0.0000018329013,0.0027278357,0.5587849,0.00053894904,0.06512134,0.00004378983,0.14995417],"study_design_scores_gemma":[0.0002513644,0.00006232014,0.05979869,0.000018173883,0.000013288628,5.598973e-7,0.000019253832,0.9324732,0.006482104,0.0007778419,0.0000031216598,0.00010011295],"about_ca_topic_score_codex":0.000119106204,"about_ca_topic_score_gemma":0.00013062434,"teacher_disagreement_score":0.37368828,"about_ca_system_score_codex":0.00003595245,"about_ca_system_score_gemma":0.000026699969,"threshold_uncertainty_score":0.3806528},"labels":[],"label_agreement":null},{"id":"W2143443573","doi":"10.1109/micro.2007.14","title":"A Framework for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exploit; Computer science; Cache; Block (permutation group theory); Memory hierarchy; Block size; Parallel computing; Chip; Cost reduction; Reduction (mathematics); CPU cache; Embedded system; Operating system; Key (lock); Telecommunications","score_opus":0.034577748187525806,"score_gpt":0.31841488312344135,"score_spread":0.28383713493591556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143443573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019356768,0.00002153092,0.9771746,0.0036095325,0.00013188987,0.00039813595,9.1421873e-7,0.00036153384,0.018108312],"genre_scores_gemma":[0.095889375,0.000006673399,0.89846677,0.0051479023,0.000058718477,0.000038488895,0.000003205055,0.000007470533,0.00038143035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989559,0.00007699425,0.00023290412,0.0002635007,0.00018720177,0.00028351022],"domain_scores_gemma":[0.99822843,0.0010979001,0.00005718127,0.00051207765,0.000059234484,0.00004515072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013451299,0.00010718598,0.00010346602,0.00020543046,0.0001817818,0.00012902156,0.00095899845,0.000080785634,0.00000874705],"category_scores_gemma":[0.00025798843,0.00007637313,0.000059323345,0.0006805065,0.000037535738,0.00011141617,0.00007067008,0.00018437069,0.000010137844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008008375,0.00009667037,0.00004339637,0.0000031114748,0.0000036961117,0.0000038029561,0.0012829158,0.03729034,0.0000025928696,0.94298756,0.006839729,0.011438179],"study_design_scores_gemma":[0.0003212987,0.00016836276,0.0003608993,0.00003578822,0.000002332328,0.000007794981,0.0001403828,0.83599204,0.00050704577,0.15775596,0.0044816406,0.00022644189],"about_ca_topic_score_codex":0.000010085865,"about_ca_topic_score_gemma":0.0000114230625,"teacher_disagreement_score":0.7987017,"about_ca_system_score_codex":0.000025306894,"about_ca_system_score_gemma":0.000038788905,"threshold_uncertainty_score":0.3114406},"labels":[],"label_agreement":null},{"id":"W2143654328","doi":"10.1109/ccece.2011.6030453","title":"Parallel FPGA technology mapping using multi-core architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Field-programmable gate array; Multi-core processor; Context (archaeology); Parallel computing; Parallelism (grammar); Core (optical fiber); Exploit; Embedded system","score_opus":0.09578043424507697,"score_gpt":0.2891615940098102,"score_spread":0.1933811597647332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143654328","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012030329,0.00008441855,0.98184913,0.00013053068,0.00009523457,0.00012470587,2.1153575e-7,0.0020018488,0.0036835608],"genre_scores_gemma":[0.30333027,0.00000477699,0.6962816,0.00022517174,0.000012497486,0.000005424245,3.619535e-7,0.000007055619,0.00013281478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998969,0.000027057198,0.00021981167,0.00037156735,0.000109142544,0.000303377],"domain_scores_gemma":[0.9992228,0.000018088127,0.00008936065,0.00054184196,0.000069671754,0.000058222107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012131326,0.00014837686,0.00015308232,0.00040998423,0.00015078293,0.000042911262,0.00086929946,0.000111772904,0.000016429001],"category_scores_gemma":[0.000032914988,0.0001289237,0.000052249496,0.0005830838,0.000068564514,0.0000918491,0.00040838812,0.00016150855,0.000024463909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038880233,0.0012250245,0.07007404,0.00011227171,0.0002582698,0.00027890573,0.014861718,0.08092007,0.009404037,0.5249964,0.0024712263,0.29535913],"study_design_scores_gemma":[0.00030616022,0.000054028373,0.0016270087,0.000032955428,0.0000031113202,0.00008686453,0.00005782101,0.9646254,0.007867298,0.024476266,0.0005094657,0.00035358453],"about_ca_topic_score_codex":0.00008139521,"about_ca_topic_score_gemma":0.0000072069583,"teacher_disagreement_score":0.8837054,"about_ca_system_score_codex":0.000020579246,"about_ca_system_score_gemma":0.000036249527,"threshold_uncertainty_score":0.52573556},"labels":[],"label_agreement":null},{"id":"W2143677609","doi":"10.5555/1924943.1924946","title":"FlexSC: flexible system call scheduling with exception-less system calls","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":227,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Operating system; System call; Thread (computing); User space; File system; Server; Multi-core processor; Scheduling (production processes); Linux kernel; Embedded system; Distributed computing","score_opus":0.013275356336802926,"score_gpt":0.2380410371283712,"score_spread":0.22476568079156828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143677609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016996186,0.000018107736,0.9481905,0.00013518157,0.00044647892,0.00022758856,8.3434827e-7,0.004623132,0.029361961],"genre_scores_gemma":[0.5953085,9.601696e-7,0.40377337,0.000057224697,0.000087993445,0.000019421612,0.0000017296138,0.000012001796,0.0007388133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838835,0.00006483606,0.00032422753,0.0005094984,0.00035871848,0.00035437406],"domain_scores_gemma":[0.9985423,0.00006140868,0.00014354223,0.00081942294,0.0002643278,0.00016900609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048503847,0.00020944311,0.00024907105,0.000161338,0.0002729659,0.00036953224,0.000975363,0.00013512911,0.0000067627234],"category_scores_gemma":[0.0000121512785,0.00016114039,0.00005559089,0.00045601698,0.00004615463,0.0003757564,0.00019569806,0.00028816678,0.00009661876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016793234,0.000090482936,0.0015077099,0.0003650774,0.00004750807,0.000052287338,0.00045780352,0.05724397,0.002477301,0.9285483,0.0016178751,0.007574911],"study_design_scores_gemma":[0.00035379786,0.00007904375,0.00024073664,0.00022895522,0.000008378569,0.0002151805,0.00013640865,0.99071115,0.0068125157,0.0000615583,0.0007595333,0.0003927416],"about_ca_topic_score_codex":0.0001675595,"about_ca_topic_score_gemma":0.000035357545,"teacher_disagreement_score":0.9334672,"about_ca_system_score_codex":0.00007709995,"about_ca_system_score_gemma":0.00011590542,"threshold_uncertainty_score":0.6571114},"labels":[],"label_agreement":null},{"id":"W2143700077","doi":"10.1145/2678373.2665701","title":"Fine-grain task aggregation and coordination on GPUs","year":2014,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Programmer; Thread (computing); Compiler; General-purpose computing on graphics processing units; Runtime system; Programming language; Graphics; Computer graphics (images)","score_opus":0.009286951154045936,"score_gpt":0.24089021954084003,"score_spread":0.2316032683867941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143700077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009805561,0.00004060915,0.97950983,0.008156505,0.00032588784,0.00029245773,0.0000013353476,0.0007563917,0.0011114484],"genre_scores_gemma":[0.4721338,0.0000074137083,0.5252856,0.0020194894,0.000352526,0.000019666082,0.000015034829,0.000018749983,0.00014772729],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790716,0.00035637943,0.0003020506,0.00069651473,0.00038119496,0.0003566998],"domain_scores_gemma":[0.9978995,0.0006462862,0.00014504346,0.0010456496,0.00010873544,0.00015479198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979116,0.00027458236,0.0002542929,0.0003574102,0.00024841807,0.00028962482,0.0011970634,0.00010618593,0.000002755103],"category_scores_gemma":[0.00028775903,0.00024282087,0.000073218514,0.00041928812,0.000072429706,0.00017638963,0.0006841417,0.00034209093,0.000018990117],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000097211,0.000042796677,0.00030998717,0.000015354979,0.000012300683,0.0000033911856,0.00070987653,0.015087321,0.00020065399,0.013899919,0.008976051,0.96073264],"study_design_scores_gemma":[0.0009098621,0.000885752,0.0032082456,0.000116525945,0.0000072766334,0.00006164316,0.0000017071513,0.8586551,0.0026373547,0.08113787,0.05187677,0.00050191197],"about_ca_topic_score_codex":0.000029000845,"about_ca_topic_score_gemma":0.000022235086,"teacher_disagreement_score":0.9602307,"about_ca_system_score_codex":0.000034696764,"about_ca_system_score_gemma":0.00003223389,"threshold_uncertainty_score":0.99019474},"labels":[],"label_agreement":null},{"id":"W2143904576","doi":"10.1109/ipdps.2005.209","title":"Experiences with Soft-Core Processor Design","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Benchmark (surveying); Flexibility (engineering); Computer science; Nios II; Embedded system; Exploit; Computer architecture; Core (optical fiber); Multi-core processor; Set (abstract data type); Microarchitecture; Instruction set; Computer hardware; Parallel computing","score_opus":0.03229204303647508,"score_gpt":0.2668192993663065,"score_spread":0.2345272563298314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143904576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002642218,0.000046132474,0.99090827,0.00056059373,0.000019283923,0.000104044615,2.5894861e-8,0.0010364007,0.004683049],"genre_scores_gemma":[0.4349802,0.0000017346448,0.56392795,0.0003462481,0.000021618782,0.00002869755,1.2362457e-7,0.0000026816042,0.00069075765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993061,0.000016759413,0.00010441912,0.00024197005,0.00016551338,0.0001652415],"domain_scores_gemma":[0.9995647,0.000034497734,0.0000441152,0.00023372582,0.00007165423,0.00005131918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013305737,0.000087037966,0.00007592286,0.000051863208,0.00010617948,0.00012088754,0.0005870869,0.000026353371,0.000027412529],"category_scores_gemma":[0.0000125780625,0.000058615467,0.000013547038,0.00027659908,0.000034031033,0.00040676666,0.000062111016,0.00004423966,0.000026158355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073017574,0.0005652528,0.00088440423,0.0000359303,0.000047821068,0.00003217827,0.104110524,0.26484653,0.00029993925,0.076492816,0.07512701,0.47748455],"study_design_scores_gemma":[0.00014731656,0.00016861477,0.000023714074,0.000014001747,0.0000011811576,0.000023519455,0.00036631114,0.9793988,0.016579112,0.00047299918,0.0025956398,0.00020881063],"about_ca_topic_score_codex":0.0000028098625,"about_ca_topic_score_gemma":0.00000138064,"teacher_disagreement_score":0.7145522,"about_ca_system_score_codex":0.000012003344,"about_ca_system_score_gemma":0.000060288025,"threshold_uncertainty_score":0.23902693},"labels":[],"label_agreement":null},{"id":"W2143951531","doi":"10.1145/1454268.1454270","title":"Asynchronous exception propagation in blocked tasks","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Asynchronous communication; Computer science; Propagation delay; Syntax; Distributed computing; Programming language; Parallel computing; Computer network; Artificial intelligence","score_opus":0.018439863538748526,"score_gpt":0.2439223385212579,"score_spread":0.22548247498250937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143951531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051541895,0.000016561105,0.94029087,0.00026310614,0.000052280127,0.0001170777,5.770368e-8,0.00057578215,0.0071423855],"genre_scores_gemma":[0.7823392,0.000018749211,0.21724753,0.00012262119,0.000018823162,0.000009690107,0.0000017654577,0.0000027863477,0.0002388138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934167,0.000044113036,0.00015930945,0.0001993473,0.00012495385,0.00013061447],"domain_scores_gemma":[0.9996468,0.000015952113,0.000043610675,0.00021965792,0.00004540158,0.000028590683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014053338,0.00006588341,0.00007411996,0.00012988536,0.00007718211,0.00002718488,0.00025898367,0.000042653846,0.000014547104],"category_scores_gemma":[0.000017670383,0.00006114546,0.000019503253,0.0003328813,0.000021361686,0.00025376663,0.00006471609,0.000065423395,0.000043272088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040966344,0.0015381989,0.058375876,0.000065959575,0.00003067111,0.00026719496,0.011586694,0.16373987,0.010384716,0.20944263,0.0342186,0.5103086],"study_design_scores_gemma":[0.00036576757,0.00009580192,0.020464709,0.000015062895,6.5698725e-7,0.00006138322,0.0000045914458,0.9627437,0.011666476,0.0038316564,0.0005327226,0.00021745406],"about_ca_topic_score_codex":0.000039669838,"about_ca_topic_score_gemma":0.0000066612274,"teacher_disagreement_score":0.79900384,"about_ca_system_score_codex":0.00004524413,"about_ca_system_score_gemma":0.000044482076,"threshold_uncertainty_score":0.24934395},"labels":[],"label_agreement":null},{"id":"W2143998620","doi":"10.1109/cmpcon.1993.289657","title":"Supporting a dynamic SPMD in a multi-threaded architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"SPMD; Computer science; Thread (computing); Parallel computing; Locality; Flexibility (engineering); Computation; Architecture; Dynamic data; Computer architecture; Embedded system; Operating system; Programming language","score_opus":0.026767491415784272,"score_gpt":0.29568722435631606,"score_spread":0.2689197329405318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143998620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00390633,0.0000797491,0.9901541,0.000907367,0.00004212089,0.00011600866,2.1007219e-7,0.00075560185,0.0040385304],"genre_scores_gemma":[0.51611054,0.0000067784595,0.48234335,0.0002914561,0.000003913262,0.00000567714,5.6071485e-7,0.000004324896,0.0012333889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.000047092097,0.00023299697,0.00029436403,0.00011649603,0.00028850415],"domain_scores_gemma":[0.9995014,0.00004088452,0.00006529196,0.00031779584,0.000023080645,0.00005151081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018591918,0.00010398274,0.00012104056,0.00018644158,0.00005001309,0.00007753658,0.000518873,0.000052320145,0.000050472216],"category_scores_gemma":[0.00004746672,0.000092240865,0.000039607607,0.00042499445,0.000017404855,0.00012830045,0.00014706668,0.0001536961,0.000040532417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009628882,0.0012945186,0.011004131,0.000085924774,0.00003804018,0.00035354446,0.018499676,0.16031764,0.0023339074,0.02314967,0.008185863,0.77472746],"study_design_scores_gemma":[0.0002296168,0.000021773756,0.0006870796,0.000014416067,4.897833e-7,0.000019783156,0.000008317835,0.9971607,0.00034589734,0.0010068882,0.00037613208,0.00012895885],"about_ca_topic_score_codex":0.000027538996,"about_ca_topic_score_gemma":0.00004653901,"teacher_disagreement_score":0.836843,"about_ca_system_score_codex":0.000028754364,"about_ca_system_score_gemma":0.0000092074,"threshold_uncertainty_score":0.37614736},"labels":[],"label_agreement":null},{"id":"W2144643978","doi":"10.1109/pact.2005.33","title":"Optimizing Compiler for the CELL Processor","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":173,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; Parallel computing; Computer architecture; Programming language","score_opus":0.021807425733737864,"score_gpt":0.26652619593304183,"score_spread":0.24471877019930396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144643978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005039875,0.00017921376,0.98051214,0.003976961,0.000060520433,0.00021767968,2.9906468e-7,0.0005656285,0.014437166],"genre_scores_gemma":[0.1550194,0.00001659403,0.8405168,0.0015144367,0.000081709746,0.0000368019,5.86015e-7,0.0000050451818,0.0028085958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994339,0.000011969605,0.00012344748,0.00017591663,0.00009256075,0.00016222135],"domain_scores_gemma":[0.99940103,0.00015874408,0.000047274752,0.0002797652,0.00008427306,0.000028925959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021245747,0.00007128676,0.00006506144,0.000030578165,0.00020777626,0.00014595198,0.00074187963,0.000025883766,0.000011118613],"category_scores_gemma":[0.000011918265,0.000044843502,0.000042137617,0.00013727143,0.000016044698,0.00019470102,0.0001095616,0.00005198021,0.000019448049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010249326,0.00018381079,0.000042093507,0.000034092554,0.000019251655,5.01411e-7,0.0016866027,0.57476026,0.00032904305,0.09437425,0.16920394,0.1593559],"study_design_scores_gemma":[0.00013252045,0.00002062831,0.000010042353,0.0000029240966,0.0000017865777,0.000001308898,0.0000079031,0.9086921,0.013352694,0.0003375322,0.07736408,0.00007646363],"about_ca_topic_score_codex":0.0000021677242,"about_ca_topic_score_gemma":0.0000013086311,"teacher_disagreement_score":0.33393183,"about_ca_system_score_codex":0.000012170546,"about_ca_system_score_gemma":0.000025485871,"threshold_uncertainty_score":0.18286648},"labels":[],"label_agreement":null},{"id":"W2144787091","doi":"10.1109/isvlsi.2006.44","title":"Fast Configuration of an Energy-Efficient Branch Predictor","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Aliasing; Dissipation; Computer science; Set (abstract data type); Power (physics); Function (biology); Branch predictor; Table (database); Scheme (mathematics); Energy (signal processing); Algorithm; Parallel computing; Artificial intelligence; Mathematics; Data mining; Statistics","score_opus":0.0074454869249283365,"score_gpt":0.22249992659552928,"score_spread":0.21505443967060095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144787091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010990003,0.000017859578,0.96628314,0.00007639077,0.00006985661,0.000043432025,9.0967876e-7,0.00044665945,0.022071753],"genre_scores_gemma":[0.88653374,0.0000010691226,0.112743974,0.0000661747,0.00003639355,0.0000032388277,0.000008520318,0.0000030145577,0.0006038505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932235,0.000038198523,0.00019537807,0.00017808682,0.00016443797,0.00010154493],"domain_scores_gemma":[0.999497,0.000018264827,0.00007743484,0.00027251395,0.000105325766,0.000029470139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010797462,0.000064242966,0.00008121767,0.00007338412,0.000047105237,0.000049068265,0.00031514675,0.00003564751,0.000014538819],"category_scores_gemma":[0.0000045952256,0.000056663146,0.000025254347,0.00019561216,0.00002984042,0.0001337261,0.000040416282,0.000024442492,0.0000023217087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029892688,0.00019809218,0.00009633067,0.000004854227,0.0000031118698,8.443957e-7,0.00009670319,0.3127144,0.0036118638,0.662123,0.0023267837,0.018820979],"study_design_scores_gemma":[0.000110656496,0.000060782433,0.0008746469,0.0000049236146,9.270023e-7,0.0000021807612,0.000001784668,0.9007242,0.095052995,0.0026137151,0.0004829031,0.00007031304],"about_ca_topic_score_codex":0.000121289304,"about_ca_topic_score_gemma":0.0000062814747,"teacher_disagreement_score":0.8755438,"about_ca_system_score_codex":0.00001025782,"about_ca_system_score_gemma":0.000027701672,"threshold_uncertainty_score":0.2310656},"labels":[],"label_agreement":null},{"id":"W2145035826","doi":"10.1109/micro.2008.4771796","title":"Reducing the harmful effects of last-level cache polluters with an OS-level, software-only pollute buffer","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cache; Computer science; Cache pollution; Cache algorithms; Cache coloring; Operating system; Page cache; Cache invalidation; Smart Cache; Embedded system; CPU cache; Write buffer; Parallel computing","score_opus":0.028863965775287465,"score_gpt":0.24335053683092991,"score_spread":0.21448657105564245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145035826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058938246,0.000079509286,0.93846077,0.0005898245,0.00014583733,0.00026368594,0.0000034108184,0.00068998156,0.00082873384],"genre_scores_gemma":[0.5282966,0.000023313822,0.47012785,0.0004157938,0.00004687396,0.00000795752,0.0000016354716,0.00001540749,0.0010645819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829865,0.00017790405,0.00028824317,0.000464681,0.0004008452,0.0003697043],"domain_scores_gemma":[0.9983837,0.00024499962,0.00017163162,0.0009150866,0.00015857269,0.0001260104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029797875,0.00023788195,0.0002575871,0.00014872619,0.00034473935,0.000081619204,0.0012393309,0.00007781499,0.000007427046],"category_scores_gemma":[0.000072228584,0.0001500136,0.000072220646,0.00057953317,0.00017253766,0.00048510678,0.00026034616,0.00019102384,0.000007514863],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005985875,0.0030148355,0.029302139,0.0008394978,0.0012126545,0.0016352329,0.051639643,0.13767959,0.005825175,0.0695121,0.09137998,0.60736054],"study_design_scores_gemma":[0.0085950475,0.0072448025,0.18292843,0.0011266373,0.0001916149,0.0071461215,0.00029415963,0.45708647,0.32134768,0.0034160893,0.0060026734,0.0046202745],"about_ca_topic_score_codex":0.00034277258,"about_ca_topic_score_gemma":0.000023480368,"teacher_disagreement_score":0.6027403,"about_ca_system_score_codex":0.00003851715,"about_ca_system_score_gemma":0.00023990699,"threshold_uncertainty_score":0.6117377},"labels":[],"label_agreement":null},{"id":"W2145087827","doi":"10.1109/pacrim.1989.48328","title":"A multi-DSP board for a parallel computer using a packet switched, pipelined bus","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Digital signal processing; Unix; Computer hardware; Back-side bus; Interface (matter); Embedded system; Network packet; System bus; Parallel computing; Control bus; Operating system; Computer network; Bus network; Software","score_opus":0.04939724219507031,"score_gpt":0.3006326870807984,"score_spread":0.2512354448857281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145087827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001165814,0.00006666506,0.99620175,0.00024493286,0.0002717845,0.00048588405,0.0000014496068,0.0009648046,0.0005969103],"genre_scores_gemma":[0.04843817,0.000008445317,0.9497754,0.001129122,0.00006608525,0.000032753433,0.0000028603456,0.000019492256,0.0005277028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834955,0.0000981124,0.0003732351,0.00055176223,0.00018355652,0.00044378327],"domain_scores_gemma":[0.9988142,0.00012658913,0.00013340125,0.00056499767,0.00022624824,0.0001345607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004450559,0.0002335329,0.0002780633,0.00014547112,0.00020527508,0.00023119243,0.0006140219,0.00010932969,0.000010882954],"category_scores_gemma":[0.00007484324,0.00020918956,0.00014607178,0.00036054387,0.000031092328,0.00026709907,0.00014135845,0.00010349935,0.000016133836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014615631,0.0021298232,0.0024511355,0.0002397513,0.00032650982,0.00008862845,0.0030760905,0.5165231,0.005053156,0.33809438,0.081405856,0.05046539],"study_design_scores_gemma":[0.0011013043,0.00008608512,0.000048316742,0.000019822139,0.000006820738,0.000022779848,0.000007785242,0.99023813,0.0013030402,0.0018403715,0.0050137225,0.00031182202],"about_ca_topic_score_codex":0.000030292822,"about_ca_topic_score_gemma":0.0000069182724,"teacher_disagreement_score":0.473715,"about_ca_system_score_codex":0.000049355676,"about_ca_system_score_gemma":0.00011282222,"threshold_uncertainty_score":0.85305023},"labels":[],"label_agreement":null},{"id":"W2145230043","doi":"10.1145/2236584.2236586","title":"Reducing OLTP instruction misses with thread migration","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Information and Intelligent Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Online transaction processing; Computer science; Cache; Transactional memory; Thread (computing); Serialization; Database transaction; Transaction processing; Parallel computing; Embedded system; Operating system; Database","score_opus":0.018131867743721407,"score_gpt":0.2509104091992491,"score_spread":0.2327785414555277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145230043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0769151,0.000058004636,0.9148651,0.000360282,0.00012533262,0.00005678017,5.627208e-8,0.00066247483,0.0069568693],"genre_scores_gemma":[0.55308855,0.000008781181,0.44655028,0.00007188284,0.00005039357,0.0000031302498,0.0000011595943,0.000002788041,0.00022306014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994721,0.000024477189,0.00009874565,0.0001361169,0.000115601164,0.0001529655],"domain_scores_gemma":[0.99960047,0.000017210283,0.000053628923,0.00021989008,0.000056758345,0.000052050033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013384284,0.00007007598,0.000059691727,0.00006856789,0.00009877463,0.00008135091,0.00017211387,0.00003027681,0.000008622185],"category_scores_gemma":[0.000010788595,0.000052490166,0.000014442987,0.00024348845,0.000014237725,0.00076035125,0.00003825905,0.000047704903,0.000013255233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003462924,0.00041658516,0.062138636,0.00005109081,0.000063681924,0.0000034539098,0.0070318226,0.022063976,0.0032002202,0.35739964,0.024388215,0.523208],"study_design_scores_gemma":[0.0011775503,0.00054018013,0.033756193,0.00018811434,0.000025561492,0.00046357253,0.0002351806,0.5631154,0.36789063,0.006526391,0.024724616,0.001356597],"about_ca_topic_score_codex":0.00006447086,"about_ca_topic_score_gemma":0.0000056892272,"teacher_disagreement_score":0.54105145,"about_ca_system_score_codex":0.000019211624,"about_ca_system_score_gemma":0.000019595218,"threshold_uncertainty_score":0.21404868},"labels":[],"label_agreement":null},{"id":"W2145908511","doi":"10.1109/hpca.1995.386553","title":"How useful are non-blocking loads, stream buffers and speculative execution in multiple issue processors?","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Blocking (statistics); Parallel computing; Cache; Compiler; Stream processing; Byte; Latency (audio); Embedded system; Operating system; Computer network","score_opus":0.024477924051242054,"score_gpt":0.22875535182779563,"score_spread":0.20427742777655358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145908511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09267664,0.0001563802,0.9023619,0.0017963124,0.000059899183,0.00025984913,8.3091015e-7,0.0004263132,0.0022618233],"genre_scores_gemma":[0.91201127,0.00005791417,0.086910255,0.00012936599,0.000030554493,0.0000098372275,0.0000012071587,0.000006655164,0.0008429315],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903643,0.000039623716,0.00014948042,0.00039166553,0.00016078349,0.00022201531],"domain_scores_gemma":[0.9994671,0.000059028065,0.00010414836,0.00023080411,0.000077203695,0.000061715196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010926772,0.00014463167,0.00015947901,0.00016560138,0.00010213349,0.00025900928,0.00028000635,0.00007079739,0.00000910906],"category_scores_gemma":[0.00006936197,0.00013306948,0.00002365998,0.0004088644,0.000035645568,0.0005117571,0.0001371795,0.00011405147,0.000006586433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000591056,0.0017676625,0.6259921,0.0004657264,0.00013350035,0.00025853535,0.034486506,0.09397898,0.0029021483,0.012167085,0.044293277,0.18349536],"study_design_scores_gemma":[0.0003707784,0.000047926944,0.010166528,0.000072703195,0.0000017413056,0.0000063828384,0.00015603923,0.981499,0.006473042,0.00037873167,0.0006165841,0.00021051698],"about_ca_topic_score_codex":0.000055163568,"about_ca_topic_score_gemma":0.000034911718,"teacher_disagreement_score":0.8875201,"about_ca_system_score_codex":0.00004231112,"about_ca_system_score_gemma":0.0000075565026,"threshold_uncertainty_score":0.54264164},"labels":[],"label_agreement":null},{"id":"W2145985499","doi":"","title":"Coloring for Shared Object-Oriented Libraries","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Inheritance (genetic algorithm); USable; Programming language; Multiple inheritance; Overhead (engineering); Object-oriented programming; Constant (computer programming); Code (set theory); Variation (astronomy); Theoretical computer science; Parallel computing; Distributed computing; World Wide Web; Set (abstract data type)","score_opus":0.03273568642041083,"score_gpt":0.25213561306808574,"score_spread":0.2193999266476749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145985499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018300927,0.000042092855,0.9841253,0.00029437934,0.00015213454,0.00015690243,9.190209e-7,0.0014478992,0.011950277],"genre_scores_gemma":[0.11658574,0.000011072606,0.87951964,0.00034133,0.000042430078,0.000035484754,0.0000045205315,0.000005887332,0.0034538906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993764,0.000013879892,0.0001318783,0.00021516881,0.00009194074,0.00017069242],"domain_scores_gemma":[0.99950993,0.00008720844,0.000039527706,0.0002384794,0.00007832449,0.000046517984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007312106,0.00007467559,0.000093631614,0.00006926203,0.0002466768,0.00007601145,0.00040497113,0.00003447276,0.0000123426225],"category_scores_gemma":[0.000051851166,0.00006797062,0.000043202053,0.00024758448,0.000026587175,0.00047015032,0.00014586191,0.000037588623,0.000009068107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029682567,0.00013300787,0.0024734617,0.00002551802,0.00003325676,0.000015896412,0.0028074277,0.0027246755,0.000356287,0.70947206,0.27628416,0.005644564],"study_design_scores_gemma":[0.00067255186,0.00024109593,0.0018454201,0.000019606663,0.000002702991,0.000036474106,0.000018650288,0.8479995,0.04928241,0.007309316,0.092176326,0.0003959197],"about_ca_topic_score_codex":0.000005775087,"about_ca_topic_score_gemma":8.1368114e-7,"teacher_disagreement_score":0.84527487,"about_ca_system_score_codex":0.000011700246,"about_ca_system_score_gemma":0.000057339756,"threshold_uncertainty_score":0.27717614},"labels":[],"label_agreement":null},{"id":"W2146486934","doi":"10.1145/2024724.2024787","title":"Temporal isolation on multiprocessing architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Air Force Office of Scientific Research; National Science Foundation","keywords":"Computer science; Isolation (microbiology); Multithreading; Multiprocessing; Abstraction; Computer architecture; Parallel computing; Simultaneous multithreading; Software; Set (abstract data type); Memory hierarchy; Instruction set; Embedded system; Distributed computing; Programming language; Thread (computing); Cache","score_opus":0.036841990912452466,"score_gpt":0.2626359560756922,"score_spread":0.2257939651632397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146486934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059719835,0.000008314257,0.94521666,0.00009607511,0.00005445305,0.000046133264,6.182658e-8,0.00083957444,0.04776676],"genre_scores_gemma":[0.54708445,4.715649e-7,0.45247814,0.0003026671,0.000010933056,0.000001553683,2.8467943e-7,0.0000022419129,0.000119281285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948424,0.000026818621,0.000102331,0.00018555585,0.000093972725,0.00010706969],"domain_scores_gemma":[0.9996597,0.00002091435,0.000041322488,0.00021226841,0.000032469365,0.0000333004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008300803,0.000068457884,0.000057529003,0.00009470228,0.000084263556,0.000050834067,0.00031455813,0.000029285204,0.000014103719],"category_scores_gemma":[0.000018157274,0.000054319906,0.000023764293,0.0001483787,0.0000128837955,0.00009301816,0.000057506495,0.00006221959,0.000021571186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063831576,0.00053519785,0.039788976,0.000033556295,0.00003079901,0.000021518346,0.011090185,0.01980592,0.00065054453,0.19936356,0.0059056752,0.72271025],"study_design_scores_gemma":[0.00015831806,0.00014927553,0.0055341143,0.0000224172,0.000001076515,0.000005963055,0.000011668986,0.9591346,0.018609902,0.015773393,0.0003933426,0.00020594177],"about_ca_topic_score_codex":0.00004837463,"about_ca_topic_score_gemma":0.0000035278038,"teacher_disagreement_score":0.9393287,"about_ca_system_score_codex":0.000007704504,"about_ca_system_score_gemma":0.000014774843,"threshold_uncertainty_score":0.22151016},"labels":[],"label_agreement":null},{"id":"W2146849645","doi":"10.1109/ipdpsw.2014.202","title":"Reducing Static and Dynamic Power of L1 Data&amp;#x00A0;&amp;#x00A0;Caches in GPGPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; Bottleneck; Cache pollution; Cache invalidation; Smart Cache; Page cache; Cache algorithms; CPU cache; Operating system; Embedded system","score_opus":0.03293280935808311,"score_gpt":0.300197053347971,"score_spread":0.26726424398988785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146849645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07709658,0.000121615565,0.91899943,0.0004760312,0.00010301438,0.00012546447,0.0000035027483,0.00027035145,0.0028040104],"genre_scores_gemma":[0.53608596,0.000032014977,0.4633403,0.00012372357,0.000006451671,0.0000024064605,0.000014176156,0.000007745518,0.00038722536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983801,0.00015378633,0.0004248495,0.0005487331,0.00022114473,0.0002713775],"domain_scores_gemma":[0.9982186,0.0002493235,0.00015259605,0.0012340493,0.000067567205,0.000077851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095650175,0.00016330674,0.00027549235,0.00024674242,0.00006475643,0.000108271786,0.0010370044,0.00006989362,0.000018215724],"category_scores_gemma":[0.0002375571,0.00014876027,0.000024893738,0.00040185908,0.00007460566,0.0004388084,0.00070477265,0.00014220555,0.000013137007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017437508,0.0025197463,0.037424456,0.0013216179,0.00034536896,0.000023493989,0.04095545,0.1730236,0.021111285,0.21723303,0.05579586,0.45007172],"study_design_scores_gemma":[0.00044531768,0.00009995135,0.004099603,0.00014249889,0.000007213687,0.000020565945,0.000048834132,0.9815282,0.00043099248,0.007316138,0.0054699504,0.0003906888],"about_ca_topic_score_codex":0.00025087656,"about_ca_topic_score_gemma":0.00012830575,"teacher_disagreement_score":0.80850464,"about_ca_system_score_codex":0.000028555758,"about_ca_system_score_gemma":0.000051795978,"threshold_uncertainty_score":0.60662675},"labels":[],"label_agreement":null},{"id":"W2147370385","doi":"10.1109/ccece.2005.1557129","title":"Implementation of three SIMD algorithms for graphical user interface processing in mobile devices using the Atsana J2210 media processor","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"SIMD; Computer science; Reduced instruction set computing; Rendering (computer graphics); Mobile device; Algorithm; Parallel computing; Computer hardware; Instruction set; Computer graphics (images); Operating system","score_opus":0.032242981308489536,"score_gpt":0.342869479254539,"score_spread":0.31062649794604946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147370385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10062555,0.0002682918,0.8982677,0.00014359596,0.000037716924,0.0004565444,0.0000014975597,0.00013140394,0.00006767947],"genre_scores_gemma":[0.68161523,0.000003188042,0.318255,0.000041932657,0.000025650425,0.000044984186,0.000002396645,0.000006112576,0.0000055126243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891686,0.0000342083,0.0003848768,0.00026078033,0.00019733563,0.00020593313],"domain_scores_gemma":[0.99932235,0.00010095929,0.00019295882,0.00017954694,0.00018439475,0.00001978806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042004572,0.00011303977,0.00014765722,0.00013489091,0.00010765587,0.00011307683,0.0005280665,0.00004934166,0.0000035060475],"category_scores_gemma":[0.000012134946,0.00007984257,0.000042021766,0.00059543893,0.000049879876,0.00039377215,0.00011247193,0.00007210863,2.109565e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006762347,0.00076056423,0.12921418,0.0007357186,0.000052777723,0.00000328869,0.008218095,0.35633534,0.005652481,0.030453946,0.0022918032,0.46621418],"study_design_scores_gemma":[0.0003313507,0.000068858935,0.0041913423,0.00004976406,0.0000069205025,0.0000024966378,0.00026880705,0.969636,0.020148631,0.0049645673,0.00018864489,0.0001425697],"about_ca_topic_score_codex":0.0003996263,"about_ca_topic_score_gemma":0.0013945538,"teacher_disagreement_score":0.6133007,"about_ca_system_score_codex":0.00002561702,"about_ca_system_score_gemma":0.00008118542,"threshold_uncertainty_score":0.32558855},"labels":[],"label_agreement":null},{"id":"W2147388638","doi":"10.1109/dsd.2008.115","title":"Automatic Identification of Parallelism in Handel-C","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Parallelism (grammar); Exploit; Hardware architecture; Computer architecture; Hardware compatibility list; Software; Task parallelism; Data parallelism; Set (abstract data type); High-level synthesis; Computer hardware; Embedded system; Programming language; Field-programmable gate array; Parallel computing","score_opus":0.021441973684224604,"score_gpt":0.25859597970798276,"score_spread":0.23715400602375816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147388638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08254576,0.00003511549,0.9146888,0.00016894288,0.000038959468,0.00006574647,8.1501796e-8,0.00026478033,0.002191804],"genre_scores_gemma":[0.8235408,0.000028569246,0.17606504,0.00004782865,0.0000036587346,0.000004760958,6.01726e-7,0.0000017569328,0.00030696948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933904,0.00003444959,0.00029075544,0.0001327548,0.00011924547,0.00008375026],"domain_scores_gemma":[0.99954665,0.00002948319,0.00008694231,0.00027274582,0.000045824407,0.00001837458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019578924,0.00004652775,0.00009103431,0.00013331737,0.000032950113,0.000013409528,0.00035646744,0.000028269613,0.000011021781],"category_scores_gemma":[0.000025276193,0.000042966753,0.000022673394,0.0003147373,0.000024251736,0.00017981272,0.00005860549,0.00003521389,0.000012378578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011832924,0.0013525303,0.039469663,0.00018324437,0.000048477952,0.000083192936,0.0154698985,0.12112023,0.009552845,0.6128344,0.028163359,0.17171031],"study_design_scores_gemma":[0.00012250144,0.000013541529,0.018543025,0.00000893983,3.8869797e-7,0.000010120655,0.0000032343028,0.96966296,0.008052967,0.0034658674,0.000055378863,0.00006106908],"about_ca_topic_score_codex":0.000027228705,"about_ca_topic_score_gemma":0.0000019926285,"teacher_disagreement_score":0.84854275,"about_ca_system_score_codex":0.0000115615385,"about_ca_system_score_gemma":0.00002833786,"threshold_uncertainty_score":0.17521334},"labels":[],"label_agreement":null},{"id":"W2147427680","doi":"10.1109/iccd.2000.878273","title":"The 2-way thrashing-avoidance cache (TAC): an efficient instruction cache scheme for object-oriented languages","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Thrashing; Cache; Computer science; Parallel computing; Scheme (mathematics); Cache algorithms; Cache coloring; CPU cache; Smart Cache; Operating system","score_opus":0.01819028550176755,"score_gpt":0.26704629232868976,"score_spread":0.24885600682692222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147427680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039579954,0.0003023983,0.954328,0.00073561753,0.00031192627,0.00033382315,0.000001726466,0.0010893551,0.0033172204],"genre_scores_gemma":[0.6915855,0.00003608297,0.30673632,0.00026032777,0.000120755765,0.000052632106,0.0000053345307,0.000014078378,0.0011890249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866563,0.00009972297,0.000256331,0.00037396984,0.00025495238,0.00034939],"domain_scores_gemma":[0.99879795,0.00015408134,0.00012713404,0.0006678306,0.00016965285,0.00008335343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005014563,0.00016587574,0.00013192502,0.00007541385,0.00068644475,0.0002907364,0.00079813134,0.00008175653,0.000011273109],"category_scores_gemma":[0.00009646924,0.00011657826,0.00007203399,0.00041201408,0.0000651426,0.00026950898,0.00013788267,0.00015529055,0.000015159971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005355095,0.00083213515,0.0022380026,0.00006982773,0.00012240035,0.000007861796,0.013626184,0.13797656,0.002609362,0.49776652,0.02932834,0.31536925],"study_design_scores_gemma":[0.00034053685,0.00011576546,0.0002376338,0.000011292128,0.0000031411982,0.000011360035,0.00021625806,0.98802274,0.0047156257,0.00018379245,0.0059579075,0.0001839564],"about_ca_topic_score_codex":0.00007178546,"about_ca_topic_score_gemma":0.00004810903,"teacher_disagreement_score":0.85004616,"about_ca_system_score_codex":0.000058940306,"about_ca_system_score_gemma":0.000018024657,"threshold_uncertainty_score":0.5279647},"labels":[],"label_agreement":null},{"id":"W2147483891","doi":"10.1109/newcas.2006.250903","title":"SoC memory optimization using loop transformations","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Loop fusion; Loop tiling; Cache; Parallel computing; Memory hierarchy; Loop optimization; Write buffer; Compiler; Loop fission; Loop (graph theory); Reduction (mathematics); CPU cache; Set (abstract data type); Factor (programming language); Compile time; Cache algorithms; Optimizing compiler; Operating system; Programming language","score_opus":0.017400772417152693,"score_gpt":0.2509992566508528,"score_spread":0.23359848423370014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147483891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005205543,0.000036097055,0.9628704,0.000304442,0.00007658766,0.00009489885,4.3103978e-7,0.00092340965,0.03517315],"genre_scores_gemma":[0.107625164,0.0000067540914,0.89148146,0.00017859961,0.000035997105,0.0000033201356,0.000007065413,0.000005533094,0.0006561187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932224,0.000031817155,0.00020588416,0.00015681243,0.00013497428,0.00014827718],"domain_scores_gemma":[0.99959725,0.000019557114,0.000051944964,0.00021862624,0.000084359046,0.000028290948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013119742,0.00008127007,0.00007631143,0.00011988624,0.00018450858,0.00014018896,0.00030259386,0.000044797056,0.00003134006],"category_scores_gemma":[0.0000046486875,0.00007812338,0.000040333187,0.00036144495,0.00001728983,0.0005912083,0.000038453458,0.000048784503,0.000010239108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.999195e-7,0.000020777543,0.000018654488,0.0000022396332,0.0000015109636,4.743904e-7,0.00004158693,0.9773303,0.000058733414,0.019799206,0.0012767466,0.0014494166],"study_design_scores_gemma":[0.00010648405,0.000008495266,0.000026406471,0.0000051532393,0.0000023078135,0.000008250464,0.0000048475604,0.9952218,0.002893369,0.0014277252,0.00018702733,0.00010813678],"about_ca_topic_score_codex":0.000073030475,"about_ca_topic_score_gemma":0.0000027365684,"teacher_disagreement_score":0.10710461,"about_ca_system_score_codex":0.000030642,"about_ca_system_score_gemma":0.000041278396,"threshold_uncertainty_score":0.31857792},"labels":[],"label_agreement":null},{"id":"W2147573545","doi":"10.1145/2145694.2145756","title":"OpenCL memory infrastructure for FPGAs (abstract only)","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Memory bandwidth; Scalability; Memory controller; Embedded system; Controller (irrigation); Extended memory; Computer hardware; Latency (audio); Direct memory access; Computer architecture; Registered memory; Parallel computing; Semiconductor memory; Operating system","score_opus":0.01891893750948783,"score_gpt":0.2810047044417,"score_spread":0.2620857669322122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147573545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021386265,0.00007453339,0.9605361,0.0003678983,0.0003155058,0.00019568927,9.644267e-7,0.00059430255,0.035776366],"genre_scores_gemma":[0.41395766,0.0000045566844,0.5839977,0.0006162778,0.00011210783,0.00000981355,0.0000025825932,0.0000059370623,0.0012933523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992334,0.000016048927,0.00015972558,0.00018396252,0.00011763662,0.0002892294],"domain_scores_gemma":[0.99933755,0.000072783674,0.00006398527,0.0003515118,0.00007076035,0.00010339812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030766497,0.00010387755,0.000107195265,0.000064922766,0.00011311468,0.000102414124,0.0006459471,0.000065038585,0.0000627333],"category_scores_gemma":[0.000043906814,0.00008571168,0.000053717293,0.00014272619,0.000015817302,0.00058944296,0.00017081136,0.00007732841,0.000025541725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011143439,0.00017644573,0.0026011046,0.000052886797,0.000038518134,0.0000016236229,0.0013889465,0.011214814,0.0005337069,0.32043335,0.312328,0.35121945],"study_design_scores_gemma":[0.0017376695,0.00027621488,0.058317717,0.000079789774,0.00002522251,0.00015356825,0.00011381156,0.53212094,0.06700148,0.037873138,0.3004479,0.0018525624],"about_ca_topic_score_codex":0.000009188204,"about_ca_topic_score_gemma":8.377087e-7,"teacher_disagreement_score":0.5209061,"about_ca_system_score_codex":0.000021899208,"about_ca_system_score_gemma":0.000049765877,"threshold_uncertainty_score":0.3495221},"labels":[],"label_agreement":null},{"id":"W2147577660","doi":"10.1109/ipdps.2009.5161233","title":"Predicting cache needs and cache sensitivity for applications in cloud computing on CMP servers with configurable caches","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Cache algorithms; Cache coloring; Parallel computing; Cache pollution; Server; Cache-oblivious algorithm; Cache invalidation; Smart Cache; Spec#; Cloud computing; CPU cache; Operating system","score_opus":0.016564766596789376,"score_gpt":0.24967337567271486,"score_spread":0.23310860907592548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147577660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0826423,0.000024125742,0.9118009,0.0010398644,0.000020934109,0.0004957146,0.000001742252,0.0005177055,0.003456679],"genre_scores_gemma":[0.8701592,0.0000032190285,0.12905626,0.0006305843,0.000037018344,0.000011867203,0.000006159278,0.0000066564367,0.0000890369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.00007652239,0.00020460173,0.00035648266,0.00013153283,0.00027776984],"domain_scores_gemma":[0.9990487,0.00037778256,0.000099538425,0.0002871114,0.000111106994,0.00007574232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006031225,0.00015990173,0.0001949754,0.000165875,0.00024860926,0.0001360032,0.00020083935,0.000070366186,4.2601843e-7],"category_scores_gemma":[0.000040990337,0.00013547702,0.000027615613,0.00048281715,0.00003466805,0.00017732722,0.00004804703,0.00015071665,6.645131e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091873306,0.0006052988,0.0655356,0.00011779013,0.000068295725,0.000016350115,0.007764846,0.6125185,0.0011056274,0.23665647,0.0018788954,0.07364045],"study_design_scores_gemma":[0.00048773576,0.00024100683,0.0062223217,0.000056461704,0.000005934083,0.000015359861,0.00026626352,0.98759025,0.0038698467,0.0007289188,0.00028776078,0.00022813302],"about_ca_topic_score_codex":0.00018362499,"about_ca_topic_score_gemma":0.000060694183,"teacher_disagreement_score":0.7875169,"about_ca_system_score_codex":0.000047257745,"about_ca_system_score_gemma":0.000046468394,"threshold_uncertainty_score":0.5524593},"labels":[],"label_agreement":null},{"id":"W2147657366","doi":"10.1145/2024716.2024718","title":"The gem5 simulator","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4858,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"x86; Computer science; ARM architecture; Booting; Operating system; Embedded system; Software","score_opus":0.02500028102197819,"score_gpt":0.2505314914940309,"score_spread":0.22553121047205274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147657366","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016655306,0.00016501275,0.99082863,0.001993174,0.00059660553,0.0003099284,7.523847e-7,0.0011694147,0.0032709618],"genre_scores_gemma":[0.20236492,0.00003846549,0.7949302,0.0020387974,0.00036279438,0.000025426914,0.0000019597794,0.000025724801,0.00021170876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977067,0.00027130565,0.00038215096,0.00061723735,0.0004108942,0.0006117248],"domain_scores_gemma":[0.9964881,0.00073255063,0.0001369667,0.002313611,0.00013219421,0.00019658952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045958353,0.00028994386,0.00022794436,0.00015273919,0.00057875324,0.00030261697,0.0048841564,0.0000929907,0.000010655487],"category_scores_gemma":[0.00013684639,0.00019344104,0.00016064702,0.000486732,0.00014381159,0.00017882926,0.0020906306,0.00045457119,0.00006563912],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026005746,0.00009980442,0.0007942894,0.000011421033,0.00007017146,0.000037581987,0.0047148173,0.017473795,0.000057265646,0.023596257,0.017439758,0.93567884],"study_design_scores_gemma":[0.0007791558,0.0006462273,0.005182208,0.000055263044,0.00001368604,0.00013590907,0.000012329478,0.623934,0.002776822,0.17289221,0.19270203,0.0008702024],"about_ca_topic_score_codex":0.00005464482,"about_ca_topic_score_gemma":0.000020811489,"teacher_disagreement_score":0.9348086,"about_ca_system_score_codex":0.000029565983,"about_ca_system_score_gemma":0.00008530447,"threshold_uncertainty_score":0.9076059},"labels":[],"label_agreement":null},{"id":"W2148032086","doi":"10.1145/2694344.2694356","title":"DeNovoSync","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec; National Science Foundation","keywords":"Computer science; Synchronization (alternating current); Exploit; Cache coherence; Cache; Protocol (science); Embedded system; Coherence (philosophical gambling strategy); Parallel computing; Computer network; CPU cache; Computer security; Channel (broadcasting)","score_opus":0.03984776990169188,"score_gpt":0.2747072372493459,"score_spread":0.23485946734765406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148032086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023761639,0.000024486702,0.88072413,0.00051022443,0.00007612768,0.000018761899,1.8285007e-8,0.0008211276,0.11758748],"genre_scores_gemma":[0.2831945,0.0000012439027,0.7143894,0.0004883547,0.000017201062,0.0000012824026,2.0255378e-7,0.0000015847218,0.0019062527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.000014737609,0.000055785815,0.00009774066,0.00009026631,0.00007586279],"domain_scores_gemma":[0.9996469,0.000009500487,0.000013596575,0.00020583947,0.00005844722,0.00006569507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014037233,0.000032230033,0.00003514856,0.000033491855,0.000020038695,0.000058621594,0.00036461535,0.00001535988,0.000004222747],"category_scores_gemma":[0.000023363653,0.000026731013,0.000010736492,0.00014460704,0.000006322078,0.00014372029,0.00011124669,0.0000237026,0.00011422846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010540228,0.000036086512,0.0006395284,0.0000011209988,0.000003930429,0.0000073464926,0.00038650318,0.0038616576,0.000027173524,0.76909095,0.19452116,0.031423476],"study_design_scores_gemma":[0.00022558689,0.000073693795,0.00018061973,0.0000034407324,7.227261e-7,0.000024733828,0.000011627713,0.8846584,0.0044456404,0.045933742,0.0642614,0.00018037629],"about_ca_topic_score_codex":0.000008129017,"about_ca_topic_score_gemma":4.5412915e-7,"teacher_disagreement_score":0.88079673,"about_ca_system_score_codex":0.000010214738,"about_ca_system_score_gemma":0.000032197968,"threshold_uncertainty_score":0.1468214},"labels":[],"label_agreement":null},{"id":"W2148232535","doi":"10.1109/newcas.2008.4606314","title":"Multithreading and interprocessor communication in a dual-issue pipelined processor","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multithreading; Computer science; Multiprocessing; Thread (computing); Datapath; Computer architecture; Cache coherence; Parallel computing; Embedded system; Interface (matter); Field-programmable gate array; Operating system; CPU cache; Cache","score_opus":0.01819529248532979,"score_gpt":0.2679199041474322,"score_spread":0.24972461166210244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148232535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025805647,0.0002616042,0.96768725,0.0010852221,0.000020306632,0.00013691111,1.4163606e-7,0.0004935041,0.004509391],"genre_scores_gemma":[0.63841957,0.00014802597,0.3606637,0.00022993835,0.0000071676727,0.00001350419,0.0000010431096,0.0000036916283,0.00051333604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931276,0.000041613017,0.00020370133,0.00021913448,0.00009150698,0.00013126472],"domain_scores_gemma":[0.99946827,0.00006860355,0.00006139001,0.0002836408,0.00007847582,0.00003960554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020711303,0.000085533946,0.000115518975,0.00014327209,0.00011333887,0.00005550555,0.00028493837,0.00004247729,0.00000457166],"category_scores_gemma":[0.00007879008,0.000077684585,0.000011807005,0.00034173415,0.000044833072,0.00038734745,0.00022378955,0.00009575961,0.0000094324805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024779933,0.0030330312,0.1395896,0.0008865413,0.00011227622,0.00039349447,0.17074713,0.02971479,0.0047620637,0.1410769,0.049382504,0.4600539],"study_design_scores_gemma":[0.00045014714,0.000043316657,0.0020679526,0.00008960036,0.0000010229048,0.00009489191,0.000048610036,0.9903812,0.0037971498,0.0014783083,0.0013416779,0.00020612327],"about_ca_topic_score_codex":0.00008022142,"about_ca_topic_score_gemma":0.000030126817,"teacher_disagreement_score":0.9606664,"about_ca_system_score_codex":0.000018197903,"about_ca_system_score_gemma":0.00003244019,"threshold_uncertainty_score":0.31678855},"labels":[],"label_agreement":null},{"id":"W2148284646","doi":"10.1145/1278177.1278180","title":"High performance computing","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Supercomputer; Commodity; Reliability (semiconductor); Parallel processing; Distributed computing; Operating system; Parallel computing; Embedded system; Power (physics)","score_opus":0.012828473721510917,"score_gpt":0.2512436611111153,"score_spread":0.23841518738960438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148284646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07735962,0.000011022699,0.900556,0.00012227845,0.00015991084,0.000036831483,2.3745914e-8,0.0011023798,0.020651918],"genre_scores_gemma":[0.5621254,0.000002479571,0.43725413,0.00028518302,0.00003086027,1.3946611e-7,2.880403e-7,0.0000020628845,0.00029950286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930763,0.00001050944,0.00016078628,0.00017589233,0.00012983353,0.00021537178],"domain_scores_gemma":[0.9995401,0.00005348338,0.00004488623,0.00025704684,0.000055704277,0.000048798363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535655,0.00006745968,0.00007020532,0.00008348738,0.00012065749,0.00006354863,0.0004921364,0.000030814186,0.000010050259],"category_scores_gemma":[0.000010113548,0.000059861537,0.000018252365,0.00029208735,0.000014462854,0.0001882593,0.00016652182,0.00006995815,0.000067550245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004689648,0.000068327055,0.0053547695,0.000013421662,0.000009953575,0.000012889435,0.00039872527,0.026235603,0.00030951618,0.3899733,0.0048614023,0.5727574],"study_design_scores_gemma":[0.00015568973,0.00006247912,0.017419588,0.00001337489,7.756991e-7,0.000019380126,0.000005194441,0.9474135,0.031921595,0.00092115067,0.0018682365,0.00019900358],"about_ca_topic_score_codex":0.000009046992,"about_ca_topic_score_gemma":4.6503732e-7,"teacher_disagreement_score":0.9211779,"about_ca_system_score_codex":0.000017096812,"about_ca_system_score_gemma":0.000012913481,"threshold_uncertainty_score":0.24410826},"labels":[],"label_agreement":null},{"id":"W2148397646","doi":"10.1155/2012/862469","title":"Automated Generation of Custom Processor Core from C Code","year":2012,"lang":"en","type":"article","venue":"Journal of Electrical and Computer Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"","keywords":"Computer science; Overhead (engineering); Parallel computing; Code (set theory); Latency (audio); Multi-core processor; Block (permutation group theory); Critical path method; Data parallelism; Exploit; Parallelism (grammar); Embedded system; Programming language; Engineering","score_opus":0.021845432671688644,"score_gpt":0.24391206278051852,"score_spread":0.22206663010882988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148397646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119811974,0.00090065825,0.87889767,0.000039107075,0.00017693893,0.000026971706,3.7936437e-7,0.0001365857,0.0000097438515],"genre_scores_gemma":[0.67992127,0.000037998547,0.3197341,0.000033708708,0.0002655872,4.5029287e-7,5.9024495e-7,0.0000038672365,0.000002390544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992879,0.000016195985,0.0003098722,0.0000787804,0.00015820855,0.00014904444],"domain_scores_gemma":[0.99945444,0.000066013185,0.0001776447,0.00008066847,0.00012864568,0.00009260334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017333846,0.00008450859,0.00018650333,0.00013538773,0.000025056239,0.00003868376,0.00022326414,0.000047358015,6.8403045e-7],"category_scores_gemma":[0.000021470343,0.00006949454,0.000040945466,0.00026280654,0.0000061742408,0.00029256553,0.00005396435,0.00012917908,4.005329e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058680253,0.000760021,0.008112851,0.00012276966,0.0003523201,0.000033430064,0.0022985707,0.74763703,0.061210833,0.019957017,0.015010527,0.14444594],"study_design_scores_gemma":[0.00015519815,0.0001147774,0.002643075,0.000031562333,0.000006972013,0.000048338636,2.6854818e-7,0.9886535,0.007881264,0.00006111136,0.00032588805,0.00007806157],"about_ca_topic_score_codex":0.000002123252,"about_ca_topic_score_gemma":4.769757e-8,"teacher_disagreement_score":0.5601093,"about_ca_system_score_codex":0.000018726332,"about_ca_system_score_gemma":0.000022972834,"threshold_uncertainty_score":0.28339052},"labels":[],"label_agreement":null},{"id":"W2148488513","doi":"10.3233/jec-2009-0093","title":"Energy simulation of embedded XScale systems with XEEMU","year":2009,"lang":"en","type":"article","venue":"Journal of Embedded Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nemzeti Kutatási és Technológiai Hivatal; Bundesministerium für Bildung und Forschung; Canadian Institute of Steel Construction","keywords":"Computer science; Energy (signal processing); Energy requirement; Operating system; Embedded system; Psychology; Physics","score_opus":0.013655360863386359,"score_gpt":0.2678633112525586,"score_spread":0.2542079503891722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148488513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02815321,0.00031663437,0.96956486,0.00009516177,0.00026375253,0.00006823334,2.6807442e-7,0.00013282138,0.0014050424],"genre_scores_gemma":[0.8384996,0.000008855255,0.16113608,0.00011102799,0.00019175955,1.9683958e-7,6.1297396e-7,0.00000877216,0.00004312508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978521,0.00017320129,0.00093003054,0.00021984149,0.00055609253,0.00026875874],"domain_scores_gemma":[0.997058,0.00025906198,0.0014228856,0.00037185795,0.00076952804,0.00011869034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007149051,0.0001892254,0.0004794372,0.00034514104,0.000118715005,0.00014967663,0.0007907474,0.00008675289,0.0000020062382],"category_scores_gemma":[0.000060745675,0.00015291145,0.00012928821,0.0006195957,0.00003095118,0.00042383923,0.000080046535,0.00020790388,9.364549e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027158283,0.00008521316,0.00009741061,0.000012397322,0.000029657092,0.000020579648,0.00057189993,0.979031,0.00034381507,0.003591154,0.00027579456,0.015913889],"study_design_scores_gemma":[0.0005458705,0.0006694715,0.00024495536,0.0003178708,0.000012571803,0.00015400031,0.000056482855,0.9947372,0.00191547,0.0010076502,0.00016246818,0.0001759696],"about_ca_topic_score_codex":0.000004560036,"about_ca_topic_score_gemma":2.2569368e-7,"teacher_disagreement_score":0.81034636,"about_ca_system_score_codex":0.00005382492,"about_ca_system_score_gemma":0.00012336385,"threshold_uncertainty_score":0.62355477},"labels":[],"label_agreement":null},{"id":"W2148501376","doi":"10.1109/icpp.2000.876165","title":"The NUMAchine multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache coherence; Multiprocessing; Scalability; Directory; Modular design; Exploit; Parallel computing; Computer architecture; Protocol (science); Sequential consistency; Node (physics); MESI protocol; Consistency (knowledge bases); Cache; Distributed computing; Consistency model; CPU cache; Operating system; Cache algorithms; Data consistency","score_opus":0.018117329644484235,"score_gpt":0.24080890891550594,"score_spread":0.2226915792710217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148501376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011885739,0.0001907735,0.94667727,0.0036198935,0.000068161906,0.00003863684,4.463468e-8,0.00069901336,0.048587374],"genre_scores_gemma":[0.7061299,0.00010650103,0.28193793,0.0006565266,0.000020992771,0.000006789567,1.2724544e-7,0.0000034048137,0.011137809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957293,0.000019142555,0.00008403253,0.00011581262,0.00009326999,0.00011481457],"domain_scores_gemma":[0.9995567,0.000074096715,0.000025683583,0.00027961738,0.000037012916,0.000026854923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011265305,0.000045978777,0.000035576028,0.000017206674,0.00024733282,0.00014653745,0.00064409076,0.000015079886,0.000022424674],"category_scores_gemma":[0.000035021447,0.000026264514,0.00001959176,0.00016141348,0.000017392002,0.00011254633,0.000098626726,0.000049101433,0.000102225575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011969302,0.00008488178,0.0002805869,0.0000035978305,0.000011043631,0.0000036588806,0.00070006563,0.002945877,0.00006369795,0.3439199,0.14720888,0.5047766],"study_design_scores_gemma":[0.000054542175,0.000011276303,0.000084211504,0.0000012537957,2.4946402e-7,0.0000036184645,0.0000018083924,0.96794474,0.0004028951,0.002370181,0.029076139,0.00004907471],"about_ca_topic_score_codex":0.0000045511706,"about_ca_topic_score_gemma":0.0000014876413,"teacher_disagreement_score":0.9649989,"about_ca_system_score_codex":0.0000053826025,"about_ca_system_score_gemma":0.0000026174216,"threshold_uncertainty_score":0.1902309},"labels":[],"label_agreement":null},{"id":"W2148567424","doi":"10.1145/513918.514004","title":"Retargetable binary utilities","year":2002,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software engineering; Software; Downstream (manufacturing); Interface (matter); De facto; Architecture; Set (abstract data type); Programming language; Software architecture; Simple (philosophy); Operating system; Engineering","score_opus":0.08883617484457842,"score_gpt":0.2630983132992856,"score_spread":0.1742621384547072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148567424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00221476,0.00014997824,0.9821977,0.001279231,0.00022580603,0.00031106532,0.0000010437464,0.003092754,0.0105276825],"genre_scores_gemma":[0.5556309,0.00008554769,0.44292253,0.00021232032,0.000039759252,0.00005015954,0.0000012567217,0.000011002176,0.001046482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982203,0.000046641188,0.0003999246,0.0005328504,0.0004060509,0.00039419098],"domain_scores_gemma":[0.99850726,0.00012953285,0.0002536137,0.0004304779,0.0005624735,0.000116642455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005462122,0.00024157553,0.0002391052,0.00026198602,0.00030367414,0.00067457015,0.0016673576,0.00012422906,0.00016240103],"category_scores_gemma":[0.00037749636,0.0002435287,0.000057194535,0.00065511686,0.000069724585,0.0017077596,0.00020142496,0.00018405663,0.00021632217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003711166,0.00068268745,0.0010992861,0.0004928615,0.00012690508,0.000025144127,0.021004552,0.011213616,0.039910614,0.4156258,0.40185115,0.107930265],"study_design_scores_gemma":[0.0001613853,0.000102804996,0.0001562584,0.000060482915,0.0000053370563,0.000018729426,0.000029831079,0.95927876,0.022049284,0.01647954,0.0013657444,0.0002918286],"about_ca_topic_score_codex":0.0000053533718,"about_ca_topic_score_gemma":8.0777724e-8,"teacher_disagreement_score":0.94806516,"about_ca_system_score_codex":0.000058867718,"about_ca_system_score_gemma":0.0000533452,"threshold_uncertainty_score":0.9930812},"labels":[],"label_agreement":null},{"id":"W2149003795","doi":"10.1109/micro.2008.4771779","title":"Hybrid analytical modeling of pending cache hits, data prefetching, and MSHRs","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Menzies School of Health Research","keywords":"Computer science; Cache; Superscalar; Parallel computing; Cache algorithms; Locality; Locality of reference; CPU cache","score_opus":0.10025297239876073,"score_gpt":0.3034855556939368,"score_spread":0.20323258329517607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149003795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03186995,0.00010624039,0.96311134,0.0001309537,0.00002827048,0.00004889318,0.0000016994163,0.00024886138,0.00445379],"genre_scores_gemma":[0.6707379,0.00006467517,0.329046,0.000044418564,0.000011694499,3.9586155e-7,0.000004613773,0.000003228578,0.00008701303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909306,0.000036828133,0.00021818648,0.00033888078,0.00016884443,0.00014419544],"domain_scores_gemma":[0.9991166,0.000050515842,0.000053129894,0.0006714677,0.000045541667,0.00006271615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031334592,0.00008252102,0.00014207215,0.000092639726,0.00011015276,0.000037240203,0.0008555695,0.00002437202,0.000006541946],"category_scores_gemma":[0.00006280669,0.00007227136,0.000018650077,0.00011733677,0.00003533911,0.00039537196,0.00083468447,0.00008859871,0.000001566244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025508974,0.0003998003,0.011623705,0.00013171475,0.00016456239,0.00011085595,0.0034562738,0.76063865,0.00028949374,0.14597484,0.022200365,0.054984223],"study_design_scores_gemma":[0.000082512204,0.000017507371,0.00007711336,0.000012007753,0.0000034430643,0.000056014254,0.0000057765023,0.99869025,0.00029018102,0.0005820922,0.00009440411,0.00008869586],"about_ca_topic_score_codex":0.00008510907,"about_ca_topic_score_gemma":8.854244e-7,"teacher_disagreement_score":0.638868,"about_ca_system_score_codex":0.000008660979,"about_ca_system_score_gemma":0.000041007563,"threshold_uncertainty_score":0.29471406},"labels":[],"label_agreement":null},{"id":"W2149281020","doi":"10.22215/etd/2010-08650","title":"Adaptive high-accuracy timing module : algorithms and performance bounds","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Algorithm; Mathematics; Arithmetic","score_opus":0.01684616462055241,"score_gpt":0.2665679144500381,"score_spread":0.24972174982948567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149281020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044821084,0.00021875782,0.9341152,0.00008050889,0.0010416465,0.000256847,0.0000024338522,0.001019177,0.018444348],"genre_scores_gemma":[0.28297406,0.000269841,0.70392907,0.00010513983,0.00012129502,0.00003229515,0.00010036657,0.00002676602,0.01244116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986148,0.000028321583,0.00027495943,0.0005603385,0.0002574509,0.00026415932],"domain_scores_gemma":[0.9989328,0.00007579159,0.00022788753,0.0004715619,0.0002011269,0.00009086129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019801011,0.00027837517,0.00026817934,0.00020176626,0.00030724233,0.000342132,0.00069692836,0.0003090335,0.000021739801],"category_scores_gemma":[0.000036278536,0.00026140522,0.000046395915,0.00023178711,0.000030847048,0.0005505689,0.00013659283,0.0004909955,0.00001701848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003356525,0.00008196541,0.000086010674,0.00012703701,0.00005869857,0.0000096783,0.0021133341,0.0010438563,0.00020052539,0.022541476,0.0031063647,0.9705975],"study_design_scores_gemma":[0.00016468865,0.00016016963,0.0027943274,0.000097628,0.000011264502,0.000011786685,0.000036849062,0.9879466,0.0054207137,0.0016591984,0.0011904191,0.00050630607],"about_ca_topic_score_codex":0.00010140143,"about_ca_topic_score_gemma":0.000027041817,"teacher_disagreement_score":0.9869028,"about_ca_system_score_codex":0.000025993902,"about_ca_system_score_gemma":0.000115732946,"threshold_uncertainty_score":0.9999838},"labels":[],"label_agreement":null},{"id":"W2149296502","doi":"10.1145/2420936.2420937","title":"Impact of compiler optimizations on voltage droops and reliability of an SMT, multi-core processor","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Compiler; Computer science; Optimizing compiler; Voltage; CPU core voltage; Parallel computing; Interprocedural optimization; Reliability (semiconductor); Power (physics); Embedded system; Loop optimization; Electronic engineering; Voltage regulator; Voltage optimisation; Electrical engineering; Engineering; Physics; Operating system","score_opus":0.03526741351446792,"score_gpt":0.33000046759232,"score_spread":0.29473305407785205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149296502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23944712,0.000017991164,0.7594599,0.000020093557,0.000025175234,0.00014600439,0.0000052632918,0.00016359372,0.00071486953],"genre_scores_gemma":[0.6406039,0.0000055618016,0.3592803,0.000032072552,0.00000779242,0.0000034482578,0.0000038129074,0.0000043604878,0.000058744412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991566,0.000043937103,0.0002747167,0.0002090289,0.00014127849,0.00017446498],"domain_scores_gemma":[0.99896264,0.00008173603,0.00015687484,0.0004598921,0.00022610018,0.00011276653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033322207,0.000113652495,0.00019147569,0.000105946,0.000060242244,0.000021308626,0.00030723368,0.000051356365,0.000014969715],"category_scores_gemma":[0.000100586745,0.00008630265,0.000051134,0.000301633,0.000075499665,0.00045921037,0.00011705312,0.00007153867,0.0000011213289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007118549,0.005141186,0.41528288,0.00018502993,0.00005469888,8.4543e-7,0.004559105,0.54282695,0.0014012338,0.018894598,0.001760018,0.009822263],"study_design_scores_gemma":[0.00026662656,0.0003060645,0.12843063,0.000019462994,0.000004106396,0.0000025119757,0.000008461919,0.8675419,0.0030537308,0.00022925808,0.000018625462,0.00011860811],"about_ca_topic_score_codex":0.00007932251,"about_ca_topic_score_gemma":0.0000012399146,"teacher_disagreement_score":0.4011568,"about_ca_system_score_codex":0.000020135984,"about_ca_system_score_gemma":0.000044683566,"threshold_uncertainty_score":0.351932},"labels":[],"label_agreement":null},{"id":"W2149377744","doi":"10.1145/1363686.1364035","title":"Exploiting program cyclic behavior to reduce memory latency in embedded processors","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Latency (audio); CAS latency; Parallel computing; Embedded system; Storage management; Computer hardware; Memory controller; Operating system; Semiconductor memory","score_opus":0.04081310682661981,"score_gpt":0.3158984268994627,"score_spread":0.27508532007284286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149377744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7095639,0.000029490733,0.27564994,0.0003356778,0.000090191395,0.0007378084,1.4904896e-7,0.0023830943,0.01120974],"genre_scores_gemma":[0.58731073,0.000008362426,0.41144547,0.00017976895,0.000019945843,0.00023583317,9.0344224e-7,0.000008072879,0.00079090113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863285,0.000047424684,0.00031390582,0.00043806413,0.00022283084,0.00034491555],"domain_scores_gemma":[0.9993252,0.000026008325,0.00006633913,0.00037230522,0.000093814,0.00011634495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020837112,0.00014049964,0.00016316566,0.00024107921,0.0001323368,0.00007078111,0.0007192371,0.00006089564,0.0000105957915],"category_scores_gemma":[0.00006437004,0.00013336354,0.00003915092,0.0009443886,0.00002542675,0.00035680272,0.00021198804,0.00013238854,0.000042695683],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029438694,0.0029319816,0.022954082,0.00007892678,0.000017912933,0.0005739492,0.02629065,0.02381449,0.00487271,0.004974694,0.009884805,0.9035764],"study_design_scores_gemma":[0.002654188,0.0016083317,0.0893314,0.00047466348,0.000018876395,0.0005988711,0.0007687058,0.61477745,0.2816471,0.0021179882,0.002607093,0.0033953574],"about_ca_topic_score_codex":0.000056083503,"about_ca_topic_score_gemma":0.0000065669983,"teacher_disagreement_score":0.900181,"about_ca_system_score_codex":0.000039120998,"about_ca_system_score_gemma":0.000074877484,"threshold_uncertainty_score":0.54384077},"labels":[],"label_agreement":null},{"id":"W2149473201","doi":"10.1109/tkde.2009.17","title":"Learning Heuristics for the Superblock Instruction Scheduling Problem","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Heuristics; Compiler; Parallel computing; Scheduling (production processes); Instruction scheduling; Benchmark (surveying); Register allocation; Schedule; Dynamic priority scheduling; Two-level scheduling; Programming language; Mathematical optimization; Operating system; Mathematics","score_opus":0.02210105566365551,"score_gpt":0.2659790234019478,"score_spread":0.2438779677382923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149473201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005228202,0.00029951704,0.99807215,0.00016853648,0.00025509982,0.00015320082,0.000005708517,0.0004604799,0.00006247804],"genre_scores_gemma":[0.66991985,0.00020514798,0.32969674,0.000023004775,0.00006537479,0.00001125658,0.0000054147617,0.0000077953755,0.0000654308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993636,0.000014333437,0.0001432109,0.00026528694,0.0000622002,0.0001513558],"domain_scores_gemma":[0.9993281,0.00016480687,0.000023912331,0.00038946033,0.000052029944,0.00004172378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023790725,0.00010783934,0.00008994491,0.000091573296,0.00032477744,0.0001282715,0.00044318844,0.000045668952,6.2858044e-7],"category_scores_gemma":[0.0000140431475,0.00009082105,0.000025382797,0.00021207353,0.0000102215,0.00030376876,0.0000072331472,0.00020574048,0.0000021149115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003872642,0.000031523992,0.0000015281679,0.00002022291,0.000013106848,2.9826188e-7,0.00027502907,0.7898314,0.00021579734,0.0012774387,0.000103102466,0.2082267],"study_design_scores_gemma":[0.00018401173,0.00009582275,0.00001809439,0.000036907804,0.0000121170515,0.000011804316,0.000009468348,0.9931852,0.0017132973,0.00009674441,0.004524262,0.0001122625],"about_ca_topic_score_codex":0.0000019430215,"about_ca_topic_score_gemma":0.0000010448778,"teacher_disagreement_score":0.669397,"about_ca_system_score_codex":0.000015151457,"about_ca_system_score_gemma":0.000020183581,"threshold_uncertainty_score":0.37035748},"labels":[],"label_agreement":null},{"id":"W2149474590","doi":"10.5555/367072.367976","title":"Static memory allocation by pointer analysis and coloring","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dataflow; Pointer (user interface); Benchmark (surveying); Minification; Reduction (mathematics); Set (abstract data type); Parallel computing; Computer engineering; Theoretical computer science; Programming language; Computer hardware","score_opus":0.009988400820943825,"score_gpt":0.2481384489511825,"score_spread":0.23815004813023868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149474590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02016872,0.00003223451,0.97343266,0.00096771814,0.000019302299,0.000043049073,1.5289957e-7,0.00030564523,0.005030502],"genre_scores_gemma":[0.78863627,0.000055189732,0.20863786,0.0006360906,0.0000060443963,0.000004342594,0.000003202758,0.0000024435114,0.0020185616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994877,0.000030120735,0.000114481416,0.00018362036,0.000086167245,0.00009792077],"domain_scores_gemma":[0.9996612,0.000038922648,0.000037064026,0.00018127935,0.000040686326,0.00004081501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015482944,0.00005547096,0.000083574305,0.00013326223,0.00005684179,0.000103448314,0.00018163047,0.000018961851,0.000020355023],"category_scores_gemma":[0.000011468412,0.000049989543,0.00002293024,0.0005171033,0.000013169207,0.00020496678,0.00007629913,0.000031915082,0.0000058169885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057144538,0.00075066974,0.09321609,0.00008313437,0.0018689076,0.00006103884,0.008692413,0.1084349,0.0053780125,0.07984027,0.2059426,0.49567482],"study_design_scores_gemma":[0.00011805548,0.000028067036,0.0016334507,0.0000029916034,0.000019616265,0.000004217772,0.000016527192,0.9939851,0.0024948406,0.0005719773,0.0010263522,0.00009876767],"about_ca_topic_score_codex":0.0000698245,"about_ca_topic_score_gemma":0.000010366312,"teacher_disagreement_score":0.88555026,"about_ca_system_score_codex":0.000014023809,"about_ca_system_score_gemma":0.000007169255,"threshold_uncertainty_score":0.20385145},"labels":[],"label_agreement":null},{"id":"W2149698371","doi":"10.5555/776261.776291","title":"Dynamic profiling and trace cache generation","year":2003,"lang":"en","type":"article","venue":"Symposium on Code Generation and Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Profiling (computer programming); Java; Cache; TRACE (psycholinguistics); Call graph; Parallel computing; Distributed computing; Operating system","score_opus":0.020632762694220187,"score_gpt":0.25510505676541223,"score_spread":0.23447229407119205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149698371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005776866,0.00028604455,0.9908627,0.0009813632,0.00025787496,0.00028881355,0.000002250156,0.00028648085,0.0012575682],"genre_scores_gemma":[0.32283637,0.0006960333,0.6754144,0.0005003968,0.000056153116,0.000030827636,0.00006000282,0.000016820757,0.00038902878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986768,0.00019531659,0.00027001844,0.0005023308,0.00018232781,0.00017324714],"domain_scores_gemma":[0.9993725,0.00002803021,0.00011752486,0.0002601374,0.00013376064,0.00008807802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039269973,0.00017864075,0.00013480692,0.00015995614,0.00038948475,0.00038656464,0.00011247922,0.0001146353,0.0000056142344],"category_scores_gemma":[0.000051460804,0.00017830294,0.00002300963,0.0002424345,0.000029801397,0.0004314746,0.000032744494,0.000099265744,0.0000024615301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022847064,0.000030365545,0.00004405274,0.000007046245,0.000005384017,6.94729e-7,0.00021055882,0.9470446,0.0112808,0.03948165,0.00024562818,0.0016469487],"study_design_scores_gemma":[0.00030437272,0.00009429831,0.000012123819,0.000008032342,0.0000066090015,0.00001638488,0.000008538022,0.97804636,0.020755295,0.000114696784,0.00043115916,0.0002021464],"about_ca_topic_score_codex":0.0000021503795,"about_ca_topic_score_gemma":0.0000062541117,"teacher_disagreement_score":0.31705952,"about_ca_system_score_codex":0.000044243734,"about_ca_system_score_gemma":0.000050591643,"threshold_uncertainty_score":0.7270983},"labels":[],"label_agreement":null},{"id":"W2149757711","doi":"10.1109/asap.2008.4580178","title":"A multi-FPGA application-specific architecture for accelerating a floating point Fourier Integral Operator","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary; Simon Fraser University","funders":"CMC Microsystems","keywords":"Field-programmable gate array; Kernel (algebra); Computer science; Floating point; Fast Fourier transform; Throughput; Hardware acceleration; Parallel computing; Embedded system; Operator (biology); Point (geometry); Acceleration; Computer hardware; Floating-point unit; Software; Hardware architecture; Fixed-point arithmetic; Algorithm; Mathematics; Operating system","score_opus":0.04249055872018292,"score_gpt":0.2755700704881838,"score_spread":0.2330795117680009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149757711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030268347,0.00007661947,0.99361914,0.0007615778,0.0000842484,0.0005838943,0.000001930799,0.0009966417,0.00084913225],"genre_scores_gemma":[0.13508326,0.000011021244,0.8636537,0.0006554914,0.00011734976,0.00012144348,0.0000071093677,0.000016381045,0.000334228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986128,0.00004828751,0.00034609265,0.0005093618,0.00017329231,0.00031014084],"domain_scores_gemma":[0.9989223,0.00013715151,0.00010843476,0.00051957706,0.00021610345,0.00009646648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002809858,0.00018886758,0.00019177553,0.00012289228,0.00054276467,0.00017885667,0.0007686223,0.00007693711,0.000009508967],"category_scores_gemma":[0.00007953534,0.00015868414,0.000101337595,0.00034855166,0.00004168571,0.00025988702,0.00019518766,0.00018018814,0.000011073106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061081926,0.00076989195,0.0017649906,0.000098914075,0.000111141315,0.000026902384,0.019310651,0.10926077,0.02009853,0.1323314,0.05772516,0.6584406],"study_design_scores_gemma":[0.00045022275,0.000060053597,0.00012383367,0.000016762406,0.0000012962619,0.000043836004,0.000033426903,0.9775875,0.010524793,0.00062335015,0.010270412,0.0002645051],"about_ca_topic_score_codex":0.000023835855,"about_ca_topic_score_gemma":0.000006884577,"teacher_disagreement_score":0.8683267,"about_ca_system_score_codex":0.00004117783,"about_ca_system_score_gemma":0.000068890025,"threshold_uncertainty_score":0.64709514},"labels":[],"label_agreement":null},{"id":"W2149904643","doi":"10.1109/pacrim.2009.5291239","title":"Architecting graphics processors for non-graphics compute acceleration","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graphics; General-purpose computing on graphics processing units; Real-time computer graphics; Architecture; Parallel computing; Graphics pipeline; Intersection (aeronautics); Graphics hardware; CUDA; Computer graphics; Computer architecture; Software rendering; Computer graphics (images); Graphics processing unit; 2D computer graphics; 3D computer graphics; Computational science","score_opus":0.026806870154068626,"score_gpt":0.28998650339676857,"score_spread":0.26317963324269994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149904643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028287035,0.000017409842,0.99187225,0.0017192223,0.00009858343,0.00035560335,4.6156504e-7,0.0011267398,0.0019810272],"genre_scores_gemma":[0.4719209,0.000012821956,0.52630603,0.0015959581,0.000059611357,0.000012682723,0.000004624696,0.0000056342533,0.00008171257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885875,0.000026574171,0.0002720777,0.00037726588,0.00019029468,0.00027501103],"domain_scores_gemma":[0.99914324,0.000106483734,0.00012461591,0.00031909035,0.00023586054,0.000070692615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039875478,0.00014897491,0.00015189493,0.00025594118,0.00033120735,0.0002934748,0.0006718203,0.00007785701,7.857396e-7],"category_scores_gemma":[0.0000501056,0.00013922609,0.00008757545,0.00073152734,0.000020299316,0.0003543465,0.000063999956,0.00013658826,0.0000018123684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021508813,0.0002710048,0.00038548338,0.000062501094,0.000029000254,0.0000029683251,0.0014741424,0.033456083,0.00057966943,0.768072,0.00847165,0.18717398],"study_design_scores_gemma":[0.00023393868,0.00021343952,0.000757842,0.000021126707,0.0000028274692,0.0000063352672,0.0000034899692,0.9584024,0.0037937434,0.0355321,0.00083046034,0.00020229959],"about_ca_topic_score_codex":0.000006716062,"about_ca_topic_score_gemma":0.0000035551782,"teacher_disagreement_score":0.9249463,"about_ca_system_score_codex":0.00001278804,"about_ca_system_score_gemma":0.000049682625,"threshold_uncertainty_score":0.56774753},"labels":[],"label_agreement":null},{"id":"W2150606811","doi":"10.1109/iscas.2005.1465342","title":"Implementation of a Cycle by Cycle Variable Speed Processor","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Speedup; Computer science; Pipeline (software); Field-programmable gate array; Variable (mathematics); Clock rate; Energy consumption; Generator (circuit theory); Embedded system; Parallel computing; Engineering; Operating system; Electrical engineering; Chip; Power (physics)","score_opus":0.00829257189372405,"score_gpt":0.2815813325025887,"score_spread":0.27328876060886464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150606811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00949517,0.000034046447,0.97699827,0.0005882299,0.000021722184,0.0001114107,0.0000017135146,0.000356784,0.01239263],"genre_scores_gemma":[0.5338113,0.000005817995,0.46545234,0.00024958645,0.000015728301,0.0000033069664,0.0000031916065,0.0000035309106,0.00045522567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930817,0.000020545729,0.00020890779,0.00017662179,0.00014407809,0.00014168148],"domain_scores_gemma":[0.9995638,0.000020017083,0.00009476088,0.00020205419,0.00008329931,0.00003607504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017725077,0.0000660327,0.00008940477,0.00005243187,0.000049013906,0.00004769548,0.00036287965,0.000026542919,0.00009881022],"category_scores_gemma":[0.000007295482,0.00006158599,0.000019912086,0.00028291548,0.00001127354,0.00035728674,0.000085814136,0.000033615466,0.000013974284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018179631,0.00087636884,0.0039927005,0.000117761534,0.00008576419,0.0000014085683,0.0033660808,0.12991555,0.033867195,0.2732021,0.20461096,0.34994593],"study_design_scores_gemma":[0.0004198039,0.00007567537,0.00021195717,0.000008584876,0.0000033199628,0.0000028858012,0.00003667997,0.7985701,0.19017291,0.0037567292,0.0065822494,0.00015912576],"about_ca_topic_score_codex":0.00013992422,"about_ca_topic_score_gemma":0.0000058484516,"teacher_disagreement_score":0.6686545,"about_ca_system_score_codex":0.00001930465,"about_ca_system_score_gemma":0.000043886612,"threshold_uncertainty_score":0.2511404},"labels":[],"label_agreement":null},{"id":"W2150829878","doi":"10.1109/5.964438","title":"Microarchitectural innovations: boosting microprocessor performance beyond semiconductor technology scaling","year":2001,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Microprocessor; Microarchitecture; Computer architecture; Exploit; Embedded system; Speculation; Thread (computing); Multithreading; Boosting (machine learning); Reuse; Parallel computing; Operating system; Engineering","score_opus":0.01287354849616351,"score_gpt":0.23280077613880992,"score_spread":0.2199272276426464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150829878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750809,0.00014427598,0.020786092,0.0017147743,0.00022656185,0.00016883812,5.9760816e-7,0.00045758995,0.0014203422],"genre_scores_gemma":[0.8704545,0.000027431264,0.12897684,0.00022455967,0.00005628061,0.000011953684,2.365664e-7,0.000010686588,0.0002375221],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890256,0.0000036821382,0.00033964193,0.00029318297,0.0001854464,0.00027550463],"domain_scores_gemma":[0.9989179,0.000023012457,0.0003279079,0.00018912325,0.0005165002,0.00002557381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027604867,0.00014495855,0.00016203315,0.00028950933,0.0002775995,0.00009212476,0.0015356982,0.00008754712,0.0000014418713],"category_scores_gemma":[0.00013572302,0.000111235655,0.0000469791,0.0018631455,0.00013060078,0.00037811318,0.00032735447,0.0002520453,0.0000031257623],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000152377615,0.00006800403,0.036350712,0.00017693151,0.000030040448,5.7550886e-7,0.0011874465,0.0010470236,0.9129132,0.006404931,0.0020170768,0.039788846],"study_design_scores_gemma":[0.00018990849,0.00004271448,0.00060046214,0.0001958009,0.0000062403237,0.00015523408,0.000050270133,0.043796387,0.9493383,0.0045831283,0.0008288265,0.00021272396],"about_ca_topic_score_codex":0.000004432939,"about_ca_topic_score_gemma":1.4581909e-7,"teacher_disagreement_score":0.10819074,"about_ca_system_score_codex":0.000035804784,"about_ca_system_score_gemma":0.00004176761,"threshold_uncertainty_score":0.45360586},"labels":[],"label_agreement":null},{"id":"W2150959205","doi":"10.1109/igcc.2013.6604502","title":"Application Specific Low Leakage data Cache for embedded processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cache; Computer science; Leakage (economics); CPU cache; Granularity; Parallel computing; Embedded system; Cache algorithms; Leakage power; Operating system; Power (physics); Power consumption","score_opus":0.036608987871980095,"score_gpt":0.2848547870305659,"score_spread":0.2482457991585858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150959205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002488762,0.00003673345,0.9925262,0.0012505861,0.000041500116,0.0005922207,0.0000020280174,0.00079078495,0.0045110984],"genre_scores_gemma":[0.22697556,0.000016096583,0.7712179,0.0005327688,0.000040514507,0.00014191768,0.000058773443,0.0000084598705,0.0010080471],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991173,0.00002212463,0.00016431265,0.00042297246,0.00011365884,0.00015964085],"domain_scores_gemma":[0.99862754,0.00006753962,0.00007216006,0.0010522569,0.00013361174,0.000046860772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027797994,0.00008743214,0.00008782066,0.00005260462,0.000083311505,0.00023223701,0.0015172767,0.00004109498,0.000015416479],"category_scores_gemma":[0.000029406136,0.000074643445,0.000019291303,0.00021183347,0.000015945398,0.00073269004,0.00031366086,0.000052043823,0.000101931895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005545168,0.000294889,0.0001402953,0.00009686198,0.000022064014,6.627504e-7,0.0008823548,0.008256142,0.0029210544,0.22382045,0.468486,0.29507366],"study_design_scores_gemma":[0.00011672094,0.000017914637,0.00013660389,0.000005576818,8.9758817e-7,0.000001910018,0.000010227928,0.97796965,0.003093252,0.005626793,0.012897865,0.00012259911],"about_ca_topic_score_codex":0.000020675714,"about_ca_topic_score_gemma":0.0000019072562,"teacher_disagreement_score":0.9697135,"about_ca_system_score_codex":0.000012127842,"about_ca_system_score_gemma":0.000032666157,"threshold_uncertainty_score":0.30438715},"labels":[],"label_agreement":null},{"id":"W2151258819","doi":"10.1007/978-3-540-74742-0_21","title":"Comparing Direct-to-Cache Transfer Policies to TCP/IP and M-VIA During Receive Operations in MPI Environments","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Thread (computing); Overhead (engineering); Latency (audio); Copying; Embedded system; Message passing; Operating system; Computer network; Parallel computing; Telecommunications","score_opus":0.02582684437176289,"score_gpt":0.2637553639606001,"score_spread":0.23792851958883723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151258819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065039834,0.00015310518,0.9892693,0.0005894544,0.0003189712,0.0006169829,0.0000025015634,0.00019628069,0.0023493925],"genre_scores_gemma":[0.57011414,0.000053413507,0.42801797,0.0013762782,0.0001240644,0.000016472437,0.000002720182,0.00002931306,0.00026560135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658775,0.00005156124,0.0005955698,0.0014219203,0.00063450396,0.00070870743],"domain_scores_gemma":[0.9985614,0.00019696106,0.000057254107,0.00082660414,0.000066097804,0.00029169078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007996211,0.0004918265,0.0005565318,0.0016471129,0.00034598514,0.000471621,0.0017825629,0.00023532851,0.000004991122],"category_scores_gemma":[0.00005490922,0.00050181954,0.00006255059,0.00087849353,0.0002495622,0.00040480925,0.0011016901,0.0005968922,0.00002054745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001083232,0.00004174143,0.00070703414,0.000021519298,0.000009049161,0.000035979065,0.005196985,0.9081089,0.00086106226,0.0019412269,0.00000795934,0.08305775],"study_design_scores_gemma":[0.0005461465,0.00027054283,0.011232154,0.0008551556,0.000009055229,0.00006923729,0.000001079158,0.9658693,0.014360329,0.004262445,0.0010250027,0.0014995461],"about_ca_topic_score_codex":0.00014656255,"about_ca_topic_score_gemma":0.00053136516,"teacher_disagreement_score":0.56361014,"about_ca_system_score_codex":0.00038449845,"about_ca_system_score_gemma":0.00010522126,"threshold_uncertainty_score":0.99974334},"labels":[],"label_agreement":null},{"id":"W2151326614","doi":"10.1145/1508244.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":174,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Cache algorithms; Overhead (engineering); Cache invalidation; Parallel computing; Smart Cache; Software; CPU cache; Process (computing); Code (set theory); Cache pollution; Operating system; Programming language","score_opus":0.012682740421160755,"score_gpt":0.2532537885188776,"score_spread":0.24057104809771684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151326614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010136152,0.000021920074,0.8721585,0.0018143696,0.000030438001,0.000019882595,1.2422191e-8,0.0009303714,0.124923125],"genre_scores_gemma":[0.3873216,0.000005299088,0.6097127,0.0019026571,0.000013527059,3.6311874e-7,1.6017783e-7,6.7698005e-7,0.0010430275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968535,0.000010482026,0.00005830857,0.00010391471,0.00006142571,0.00008050329],"domain_scores_gemma":[0.99972403,0.000008661494,0.0000133852545,0.00020552243,0.000021554555,0.000026858681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007274897,0.000034146648,0.00003661971,0.00003642529,0.00003654597,0.000055143926,0.00033875532,0.000015222626,0.000008564465],"category_scores_gemma":[0.0000068425215,0.000028413044,0.000017233284,0.00014428853,0.000003637302,0.00012756663,0.000026655622,0.000025735735,0.000029411052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.452225e-7,0.000028346733,0.000027001768,3.4067335e-7,0.0000011023823,0.0000025065387,0.000066340006,0.0006965142,0.00017723656,0.75921607,0.037074603,0.20270951],"study_design_scores_gemma":[0.00020466071,0.0001920222,0.002699765,0.0000067068327,8.180773e-7,0.000018776302,0.0000022446766,0.836658,0.015307691,0.1119682,0.03267972,0.0002613975],"about_ca_topic_score_codex":9.936374e-7,"about_ca_topic_score_gemma":4.6605237e-8,"teacher_disagreement_score":0.83596146,"about_ca_system_score_codex":0.0000043209916,"about_ca_system_score_gemma":0.000008356409,"threshold_uncertainty_score":0.11586503},"labels":[],"label_agreement":null},{"id":"W2151430232","doi":"10.1109/fpt.2009.5377658","title":"An architecture for exploiting coarse-grain parallelism on FPGAs","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Field-programmable gate array; Exploit; Computer architecture; Scheduling (production processes); Overhead (engineering); Parallel computing; Architecture; Parallelism (grammar); Embedded system; Operating system","score_opus":0.02224638256518143,"score_gpt":0.291500888649162,"score_spread":0.2692545060839806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151430232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001533784,0.0000143019215,0.9859388,0.0034743194,0.000081385835,0.00023256763,8.6878975e-7,0.001437873,0.007286121],"genre_scores_gemma":[0.32819566,0.000003098853,0.6672151,0.004167366,0.00008613707,0.00001362616,0.0000057613697,0.0000063282214,0.00030687655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893486,0.000054873784,0.00018467092,0.00038759515,0.00015619725,0.00028180183],"domain_scores_gemma":[0.99920064,0.00008127192,0.00006506576,0.00049182033,0.00006307605,0.00009812054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027598446,0.00014300006,0.00013736292,0.000118958545,0.00017828701,0.00017901433,0.0007264588,0.000063073836,0.000004587865],"category_scores_gemma":[0.00004228017,0.000121344034,0.000069209644,0.00017115168,0.000013820786,0.00018712429,0.000030751722,0.00010839313,0.000007204874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021031781,0.00018367919,0.000009199693,0.000005294238,0.0000064880865,0.0000055926594,0.0008580987,0.11022995,0.00074659975,0.44211006,0.016379805,0.42944422],"study_design_scores_gemma":[0.00036851157,0.0008537248,0.00009704169,0.000024007093,0.0000019238457,0.000009249665,0.00001713594,0.90471274,0.0052590556,0.078901395,0.009465869,0.0002893298],"about_ca_topic_score_codex":0.000004397023,"about_ca_topic_score_gemma":0.0000017687676,"teacher_disagreement_score":0.7944828,"about_ca_system_score_codex":0.000015985384,"about_ca_system_score_gemma":0.00002261351,"threshold_uncertainty_score":0.4948266},"labels":[],"label_agreement":null},{"id":"W2151662465","doi":"10.1109/tc.2012.197","title":"Parallel Simulation of Pore Networks Using Multicore CPUs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Computer science; Multi-core processor; Parallel computing; Set (abstract data type); Monte Carlo method; Speedup; Algorithm; Distributed computing; Mathematics","score_opus":0.0380393125837284,"score_gpt":0.28851626510685646,"score_spread":0.25047695252312807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151662465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037020475,0.00005254641,0.99444723,0.000036724305,0.0010843045,0.00017853583,0.0000016907883,0.00041787073,0.00007903698],"genre_scores_gemma":[0.66323125,0.000008276788,0.33657297,0.000110115296,0.000048785176,0.0000031491054,0.000001291546,0.000010171077,0.000013973444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987849,0.000094015835,0.00033291793,0.00024581578,0.00022100005,0.0003213768],"domain_scores_gemma":[0.9989802,0.00020857458,0.00015987118,0.00043045986,0.00009827439,0.00012257871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020198242,0.00017693374,0.00020646414,0.00021711377,0.0001724969,0.00004694789,0.00041859588,0.00010433912,0.0000051753527],"category_scores_gemma":[0.000002661684,0.00018083196,0.00012914972,0.00043501993,0.000046185192,0.00046315882,0.00000651348,0.00018030201,0.000004081745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009523034,0.00014272203,0.00005214337,0.000005727955,0.0000219405,9.575948e-7,0.00028474058,0.97491294,0.00003016091,0.00018545044,0.000060415092,0.024293266],"study_design_scores_gemma":[0.00028194222,0.00005947683,0.00010549913,0.000046806726,0.000012808177,0.000010175151,0.0000058257324,0.99803644,0.0011541733,0.000037388574,0.00006801537,0.00018143826],"about_ca_topic_score_codex":0.000018884642,"about_ca_topic_score_gemma":6.3004103e-7,"teacher_disagreement_score":0.6595292,"about_ca_system_score_codex":0.000060115846,"about_ca_system_score_gemma":0.000026165037,"threshold_uncertainty_score":0.7374114},"labels":[],"label_agreement":null},{"id":"W2152284590","doi":"10.1109/pacrim.2001.953584","title":"A Java processor architecture with bytecode folding and dynamic scheduling","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java concurrency; Java; Java applet; Bytecode; Real time Java; Architecture; Java annotation; Embedded Java; Parallel computing; Operating system; Computer architecture; strictfp; Programming language","score_opus":0.007673850967162144,"score_gpt":0.23849633361650285,"score_spread":0.23082248264934072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152284590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042276125,0.00014330391,0.95265114,0.00089851976,0.000015688769,0.00009763263,1.0619888e-7,0.0007806839,0.00313682],"genre_scores_gemma":[0.4852951,0.000027076992,0.5142272,0.0001721209,0.000007155826,0.000004607156,3.6295586e-7,0.0000048369,0.00026152044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926573,0.000017520291,0.00010546972,0.00029767386,0.00012034461,0.00019323506],"domain_scores_gemma":[0.9995977,0.000032787717,0.00004762711,0.00021154174,0.000049048907,0.00006127443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012155748,0.00010778815,0.000100874684,0.0001036651,0.00013141616,0.00016601216,0.00030896088,0.0000367245,0.000003771344],"category_scores_gemma":[0.000016450194,0.00007926968,0.000014048962,0.00032703497,0.000025839354,0.00018669329,0.000119174765,0.000104380364,0.000002335322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000761557,0.00019848073,0.009251719,0.00012604271,0.000090713955,0.0001327117,0.0037869313,0.4546024,0.001849511,0.042423237,0.00034766176,0.48711443],"study_design_scores_gemma":[0.00020235822,0.00007905983,0.00030161103,0.000050793165,0.000002652709,0.00017089571,0.000014001164,0.995029,0.00056723424,0.0028455157,0.000562986,0.00017393426],"about_ca_topic_score_codex":0.000009051909,"about_ca_topic_score_gemma":0.00001551185,"teacher_disagreement_score":0.54042655,"about_ca_system_score_codex":0.000012692503,"about_ca_system_score_gemma":0.000029595116,"threshold_uncertainty_score":0.32325238},"labels":[],"label_agreement":null},{"id":"W2152350268","doi":"10.1109/ecbs.1995.521874","title":"A protection cache architecture for the multi-view memory model and its performance","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Computer science; Cache; Cache-only memory architecture; Flexibility (engineering); Architecture; CPU cache; Access control; Data access; Cache pollution; Protocol (science); Cache coloring; Cache algorithms; Computer architecture; Distributed computing; Operating system; Database","score_opus":0.06017049168207259,"score_gpt":0.25788817765350874,"score_spread":0.19771768597143616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152350268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011605927,0.00074728334,0.995025,0.0016964212,0.00003240884,0.00054028735,3.6672853e-7,0.00033696654,0.00046068444],"genre_scores_gemma":[0.5244359,0.00023981286,0.47192088,0.0004808684,0.000024319146,0.00014351486,2.0352539e-7,0.000006163263,0.0027483737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994891,0.000020575764,0.000095838695,0.0001911294,0.00007637476,0.00012696178],"domain_scores_gemma":[0.9996467,0.000037104495,0.000037287216,0.00020011062,0.00005130939,0.000027456632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018523859,0.00008019732,0.00006778125,0.000037030968,0.00024527384,0.00006787673,0.000291782,0.00003621563,0.0000029416394],"category_scores_gemma":[0.000023527136,0.000049495873,0.00002583861,0.00011925078,0.00001471294,0.00013412876,0.000084383595,0.000092622235,0.000003341729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031606523,0.000040632665,0.000004666606,0.000058565805,0.00000922047,1.5533989e-7,0.0010880395,0.6052005,0.00015047086,0.0021884777,0.0010081425,0.3902479],"study_design_scores_gemma":[0.00014411172,0.000036951387,0.00002219823,0.000011329219,0.0000024447017,0.0000102899985,0.000002189275,0.9974349,0.0011252748,0.00016579291,0.0009672005,0.00007733114],"about_ca_topic_score_codex":0.0000034295638,"about_ca_topic_score_gemma":0.0000028973445,"teacher_disagreement_score":0.52327526,"about_ca_system_score_codex":0.000008605892,"about_ca_system_score_gemma":0.00000721923,"threshold_uncertainty_score":0.20183831},"labels":[],"label_agreement":null},{"id":"W2152517291","doi":"","title":"Synchronization via scheduling: managing shared state in video games","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Synchronization (alternating current); Parallel computing; Implementation; Dependency graph; Graph; Theoretical computer science; Programming language","score_opus":0.009292821611210238,"score_gpt":0.24713333345345617,"score_spread":0.23784051184224594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152517291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005983515,0.000023302828,0.9883971,0.000567954,0.00017668145,0.00010324166,1.8926806e-7,0.0007864062,0.003961603],"genre_scores_gemma":[0.56760544,0.000009044041,0.43195453,0.00018963467,0.000015130817,0.000005205156,0.0000022344896,0.000005300039,0.00021348581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991146,0.00003121864,0.00020877566,0.00030123242,0.0001372673,0.00020691841],"domain_scores_gemma":[0.9994132,0.000038689363,0.00006375913,0.0003612553,0.00007181324,0.000051315972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028789576,0.00009786571,0.00009955348,0.0002110378,0.00006216707,0.00020761651,0.00054381776,0.000045983314,0.000042819465],"category_scores_gemma":[0.000045835175,0.00009550669,0.000022816805,0.00047924317,0.000019211086,0.0004974617,0.00018660979,0.00017634407,0.00003069809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010885079,0.00023537742,0.016525988,0.00006121616,0.000022565302,0.000047615602,0.002758425,0.32732105,0.0049861255,0.099993646,0.0025584286,0.5454787],"study_design_scores_gemma":[0.00013336094,0.000012725613,0.0010708071,0.000014457107,5.4832697e-7,0.0000048003535,0.0000026964772,0.97790766,0.0024391753,0.017959505,0.0003225861,0.0001316557],"about_ca_topic_score_codex":0.000081269645,"about_ca_topic_score_gemma":0.000060972376,"teacher_disagreement_score":0.6505866,"about_ca_system_score_codex":0.000021898932,"about_ca_system_score_gemma":0.000036404555,"threshold_uncertainty_score":0.389465},"labels":[],"label_agreement":null},{"id":"W2152676535","doi":"10.1109/ciip.2009.4937875","title":"An efficient architecture for hardware implementations of image processing algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Memoization; Computer science; Pipeline (software); Speedup; Parallel computing; Microprocessor; Throughput; Pipeline transport; Computer hardware; Image processing; Algorithm; Implementation; Computer engineering; Computer architecture; Embedded system; Image (mathematics); Artificial intelligence","score_opus":0.017060300903432895,"score_gpt":0.3278229273437981,"score_spread":0.3107626264403652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152676535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080178643,0.000019601512,0.99708486,0.0007011639,0.000021351943,0.00022271102,0.00000500784,0.00038694442,0.0007565964],"genre_scores_gemma":[0.23536044,6.300122e-7,0.76433164,0.00023612299,0.000016187074,0.000007705116,0.000008664966,0.0000028266998,0.0000357918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.000019684525,0.00018273042,0.00020732585,0.00011821409,0.00014869437],"domain_scores_gemma":[0.9994496,0.00002218492,0.00007897854,0.00023240261,0.00017197679,0.000044840504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015792776,0.00007500918,0.00009290576,0.00009656755,0.00012232077,0.000092272174,0.00040513882,0.000021655282,0.0000035454182],"category_scores_gemma":[0.000012340013,0.00006378323,0.000040492974,0.00022089812,0.000015568681,0.00013019395,0.000026024647,0.000036375885,4.5671896e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082119495,0.0003386028,0.000034896202,0.00003635601,0.0000071523705,0.0000011132512,0.0025704997,0.18569326,0.004631073,0.028071182,0.002926719,0.77568096],"study_design_scores_gemma":[0.00018481244,0.00020940293,0.00029468315,0.000010137912,0.0000026499795,0.0000029352404,0.000029400797,0.97520584,0.020051066,0.003618971,0.00029456054,0.000095538904],"about_ca_topic_score_codex":0.0000044273347,"about_ca_topic_score_gemma":6.872664e-7,"teacher_disagreement_score":0.7895126,"about_ca_system_score_codex":0.000010552872,"about_ca_system_score_gemma":0.000044004424,"threshold_uncertainty_score":0.26010045},"labels":[],"label_agreement":null},{"id":"W2152883828","doi":"10.1145/2024724.2024792","title":"Dynamic binary translation to a reconfigurable target for on-the-fly acceleration","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Binary translation; Porting; Acceleration; Computer science; Translation (biology); Focus (optics); Binary number; On the fly; Hardware acceleration; Parallel computing; Reconfigurable computing; Embedded system; Distributed computing; Field-programmable gate array; Operating system; Software; Arithmetic; Mathematics","score_opus":0.06783712183492092,"score_gpt":0.27620304322050393,"score_spread":0.20836592138558302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152883828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012778682,0.000009828252,0.96692115,0.0026762846,0.00010756956,0.00046103587,0.0000011872171,0.00042642312,0.028118635],"genre_scores_gemma":[0.3274009,0.0000030036526,0.67057484,0.0009864735,0.000009215001,0.00007922016,0.0000043309183,0.0000060702864,0.0009359206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993469,0.000036451653,0.00015463858,0.00023053674,0.000085185966,0.0001462658],"domain_scores_gemma":[0.9994717,0.00008572562,0.000041348707,0.00028547036,0.00007512657,0.000040594055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002986188,0.000083174535,0.000072748386,0.000093943876,0.00016511232,0.00007944384,0.0004210505,0.000038889328,0.0000616696],"category_scores_gemma":[0.00002177163,0.00006214798,0.000040982,0.00022231872,0.0000075233725,0.00021797343,0.000015033742,0.000045822297,0.000041002437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019451462,0.000480757,0.00006172229,0.000037510654,0.00005531414,0.0000032136634,0.008643451,0.050935954,0.007822759,0.57333785,0.09066326,0.26776367],"study_design_scores_gemma":[0.00011685271,0.0003836449,0.00011994126,0.000011018705,0.0000014525884,0.000001171724,0.000008899797,0.9605704,0.019735927,0.014487416,0.0044319555,0.0001313305],"about_ca_topic_score_codex":0.000012056715,"about_ca_topic_score_gemma":0.0000044528783,"teacher_disagreement_score":0.9096344,"about_ca_system_score_codex":0.000019243289,"about_ca_system_score_gemma":0.00002618973,"threshold_uncertainty_score":0.2534321},"labels":[],"label_agreement":null},{"id":"W2152951955","doi":"10.1007/s00224-002-1066-2","title":"Bulk Synchronous Parallel Algorithms for the External Memory Model","year":2002,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Algorithm","score_opus":0.038564986612626403,"score_gpt":0.26619390324245,"score_spread":0.2276289166298236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152951955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091321114,0.0035538287,0.9919,0.00017436696,0.0007097262,0.0005893577,0.0000028741217,0.00056968606,0.0015869318],"genre_scores_gemma":[0.7395255,0.000027129514,0.2589427,0.000084771076,0.00022297793,0.000022509537,6.4531685e-7,0.000018776753,0.0011550208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981161,0.00023330137,0.0005691702,0.00037877812,0.00032606657,0.00037662778],"domain_scores_gemma":[0.9974566,0.0010480459,0.0004090526,0.0008174005,0.00020002847,0.000068835376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019415977,0.00021649545,0.0003543798,0.00010651513,0.00037076452,0.00015643673,0.0016823448,0.00008313618,0.000003600909],"category_scores_gemma":[0.00006968733,0.00016288778,0.0001610549,0.00020146638,0.00016725951,0.00014017419,0.00024679533,0.00014765804,0.000010555395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057724337,0.00004703852,0.0000036137958,0.000046922312,0.000030424542,0.0000010944201,0.0013803198,0.7877758,0.000030557832,0.18319973,0.00095825206,0.026520465],"study_design_scores_gemma":[0.00034402005,0.00008137126,0.000012482776,0.00013221946,0.000013095908,0.00004205446,0.000059235444,0.9905988,0.00014502248,0.008242803,0.00013272645,0.00019615599],"about_ca_topic_score_codex":0.000022350758,"about_ca_topic_score_gemma":1.9299152e-7,"teacher_disagreement_score":0.7386123,"about_ca_system_score_codex":0.000043519027,"about_ca_system_score_gemma":0.000032242548,"threshold_uncertainty_score":0.6642371},"labels":[],"label_agreement":null},{"id":"W2153332319","doi":"10.1109/pccc.1988.10100","title":"Effective algorithms for partitioning distributed programs","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dataflow; Computer science; Distributed algorithm; Partition (number theory); Algorithm; Graph partition; Simulated annealing; Software; Graph; Theoretical computer science; Distributed computing; Parallel computing; Programming language; Mathematics","score_opus":0.021625283063426107,"score_gpt":0.2811582664663851,"score_spread":0.259532983402959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153332319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013776365,0.00002337975,0.99500924,0.00011273818,0.00009870228,0.00045678605,0.0000011788667,0.0008725317,0.0032876665],"genre_scores_gemma":[0.18784977,0.0000015503267,0.81159484,0.00009096981,0.000016287848,0.00022120142,0.000015211523,0.0000044731255,0.0002056716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.0000514542,0.00011139602,0.00022043262,0.000078169636,0.00018963178],"domain_scores_gemma":[0.99953145,0.000083810664,0.00004086675,0.00018640123,0.00010940757,0.00004808594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002666071,0.00007540196,0.000083958934,0.000031398446,0.00014709837,0.00013737888,0.00019753174,0.000034514404,0.0000032178866],"category_scores_gemma":[0.00008266216,0.00006623309,0.000047684705,0.00024447002,0.000016422735,0.00015654977,0.000030055644,0.000039460872,0.0000061022693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031006298,0.00016284086,0.00076670235,0.0000146448065,0.00002537494,0.0000019380238,0.00016588795,0.004374293,0.000036543064,0.84550273,0.00466576,0.14428017],"study_design_scores_gemma":[0.00054632564,0.00031077376,0.00026212147,0.000023409168,0.0000052310606,0.00001191371,0.000013406391,0.89873046,0.01864915,0.03926955,0.04189067,0.0002869627],"about_ca_topic_score_codex":0.0000036199992,"about_ca_topic_score_gemma":6.7000366e-7,"teacher_disagreement_score":0.8943562,"about_ca_system_score_codex":0.00002300459,"about_ca_system_score_gemma":0.000019584331,"threshold_uncertainty_score":0.27009073},"labels":[],"label_agreement":null},{"id":"W2153605561","doi":"10.1109/hicss.1989.47180","title":"Instruction set architecture of an efficient pipelined dataflow architecture","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Centre for Advanced Photovoltaics; McGill University","keywords":"Dataflow; Computer science; Dataflow architecture; Instruction set; Architecture; Parallel computing; Computer architecture; Scheduling (production processes); Latency (audio); Set (abstract data type); Interpreter; FIFO and LIFO accounting; Programming language; FIFO (computing and electronics)","score_opus":0.012226578057066603,"score_gpt":0.25123747697455173,"score_spread":0.23901089891748512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153605561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04876274,0.000016411617,0.9468522,0.00012004938,0.00015515821,0.00013015489,0.0000037595364,0.0004728605,0.003486666],"genre_scores_gemma":[0.3982257,0.0000017187177,0.6015473,0.000111113826,0.000018666811,0.000002420607,0.000010156458,0.000005746621,0.0000771504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987938,0.00016352953,0.0002520131,0.00036040205,0.00023583413,0.00019445048],"domain_scores_gemma":[0.9989672,0.000038087815,0.00010608865,0.00071554584,0.00008730685,0.000085827356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031329316,0.00013824235,0.0001564083,0.00018925664,0.000085349086,0.000056275367,0.0006103606,0.000070317794,0.000019613302],"category_scores_gemma":[0.00006941359,0.00011259157,0.000049065115,0.00046983987,0.000044157572,0.000095287745,0.000095807925,0.00015549784,0.000003866608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011695794,0.00013080671,0.000056860772,0.000021600088,0.000011275128,0.0000033540005,0.0008192097,0.88969284,0.0010462247,0.04675707,0.0004719933,0.060977068],"study_design_scores_gemma":[0.0006891463,0.00024710625,0.00017450906,0.000027653294,0.0000064865053,0.0001404405,0.00003293865,0.9057951,0.07693196,0.009020298,0.0065693944,0.00036496655],"about_ca_topic_score_codex":0.000016557757,"about_ca_topic_score_gemma":0.000005585213,"teacher_disagreement_score":0.34946296,"about_ca_system_score_codex":0.000014086896,"about_ca_system_score_gemma":0.000058913385,"threshold_uncertainty_score":0.45913512},"labels":[],"label_agreement":null},{"id":"W2153636549","doi":"10.5555/1898699.1898829","title":"Power-performance efficiency of asymmetric multiprocessors for multi-threaded scientific applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Server; Multiprocessing; Spec#; Scheduling (production processes); Energy consumption; Slowdown; Operating system; Power consumption; Embedded system; Power management; Parallel computing; Efficient energy use; Power (physics); Power budget; Electric power system; Engineering","score_opus":0.02217611362826873,"score_gpt":0.27704388154756926,"score_spread":0.25486776791930055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153636549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007913735,0.00013060034,0.9871567,0.00004767792,0.000088346176,0.00052117027,0.0000030057424,0.00048735336,0.0036513954],"genre_scores_gemma":[0.53558,0.0000020251555,0.46340317,0.0000146818065,0.000007697394,0.00007140666,0.0000046343634,0.000004445142,0.0009119453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987958,0.000013545034,0.00033801948,0.00039984955,0.00021119679,0.00024155327],"domain_scores_gemma":[0.9988619,0.00008534828,0.00016801423,0.0004678609,0.0003778952,0.000039001192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039329028,0.00011169225,0.0001418845,0.0004159596,0.00027916976,0.000114375965,0.0008722132,0.000052120748,0.0000023477837],"category_scores_gemma":[0.000035581514,0.00010013441,0.00006315189,0.0018761496,0.000097811404,0.0002421473,0.000099466815,0.000047934038,0.000010870651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003286508,0.004733401,0.013198845,0.0006210144,0.00004473828,9.173091e-7,0.0010056157,0.17301412,0.013308282,0.64609474,0.011865739,0.13607971],"study_design_scores_gemma":[0.00035975402,0.00006318672,0.0010655116,0.0000099299505,0.0000022801757,0.000001343044,0.000005062709,0.8964127,0.0987762,0.00048057965,0.0026727403,0.00015077139],"about_ca_topic_score_codex":0.000014364246,"about_ca_topic_score_gemma":0.0000017611552,"teacher_disagreement_score":0.7233985,"about_ca_system_score_codex":0.00002144427,"about_ca_system_score_gemma":0.000067468936,"threshold_uncertainty_score":0.40833628},"labels":[],"label_agreement":null},{"id":"W2153668951","doi":"10.1109/hpca.2000.824344","title":"Software-controlled multithreading using informing memory operations","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multithreading; Computer science; Thread (computing); Software; Simultaneous multithreading; Speedup; Parallel computing; Yarn; Shared memory; CAS latency; Embedded system; Operating system; Computer hardware; Memory controller; Semiconductor memory","score_opus":0.03596660523226621,"score_gpt":0.26693774526011405,"score_spread":0.23097114002784783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153668951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031305058,0.000089937574,0.9864287,0.00013109454,0.00013087246,0.00018965329,1.5469709e-7,0.0011045125,0.008794571],"genre_scores_gemma":[0.19214845,0.000010540463,0.805646,0.00040626395,0.000036396475,0.00000923644,4.831821e-7,0.0000059057797,0.0017367365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991402,0.00003274136,0.0002679237,0.00020430876,0.00014856557,0.00020625342],"domain_scores_gemma":[0.9994021,0.00007968826,0.000047391582,0.0003182212,0.000090363035,0.00006223791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020310766,0.000109934204,0.00017157473,0.00015767892,0.00031320698,0.0002542909,0.0004243057,0.000046800877,0.00007600125],"category_scores_gemma":[0.00012721449,0.00009528117,0.0000634614,0.00027766425,0.000017753231,0.0007282698,0.000141322,0.00008135888,0.000046937614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004210677,0.00009106677,0.00023746006,0.000007912554,0.000037259524,0.000009728502,0.0017713123,0.9104917,0.0005469921,0.01589324,0.0018482727,0.06906084],"study_design_scores_gemma":[0.00068154867,0.0000138916075,0.000009702961,0.000011646119,0.0000032663818,0.000015636486,0.000008652634,0.9978821,0.0009528981,0.00011216573,0.00017302508,0.00013544525],"about_ca_topic_score_codex":0.00005679279,"about_ca_topic_score_gemma":0.0000057722473,"teacher_disagreement_score":0.18901794,"about_ca_system_score_codex":0.00003829433,"about_ca_system_score_gemma":0.000019141802,"threshold_uncertainty_score":0.3885453},"labels":[],"label_agreement":null},{"id":"W2153703965","doi":"10.1145/1242531.1242549","title":"Computational and storage power optimizations for the O-GEHL branch predictor","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Branch predictor; Computer science; Computation; Computational complexity theory; Latency (audio); Power consumption; Power (physics); Energy consumption; Efficient energy use; Parallel computing; Algorithm; Engineering","score_opus":0.013035659194625343,"score_gpt":0.26623397861006165,"score_spread":0.2531983194154363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153703965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039610456,0.000126614,0.9948676,0.0013654319,0.00014749671,0.00027880777,0.000003237916,0.0004067703,0.0024079152],"genre_scores_gemma":[0.40907288,0.0000074188,0.5897258,0.0006637493,0.000030705287,0.000009971324,0.0000041501717,0.000005316485,0.00048003378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929756,0.00001611517,0.00017250475,0.00020446947,0.00014259726,0.00016674557],"domain_scores_gemma":[0.99895793,0.00057620544,0.00005243813,0.0002074291,0.00014921048,0.000056782712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004799307,0.00008235209,0.00007277839,0.000070084774,0.00031531576,0.00014220417,0.00034794866,0.000039324634,0.000013183746],"category_scores_gemma":[0.00005215962,0.000058798352,0.00003236615,0.00021220851,0.000050212766,0.00018409823,0.00010478657,0.00005578809,0.0000021507738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009622444,0.00005655779,0.0004081903,0.000006379449,0.00002810402,8.840465e-7,0.0006782141,0.61128676,0.000010287497,0.35875368,0.020519024,0.008242312],"study_design_scores_gemma":[0.00023814567,0.000045241803,0.003357779,0.0000038506255,0.0000032220562,0.000008455296,0.0000109383745,0.98428136,0.00006141174,0.006776597,0.005120559,0.00009245294],"about_ca_topic_score_codex":0.000003842801,"about_ca_topic_score_gemma":0.0000017992315,"teacher_disagreement_score":0.40867677,"about_ca_system_score_codex":0.000013887709,"about_ca_system_score_gemma":0.0000339501,"threshold_uncertainty_score":0.24251859},"labels":[],"label_agreement":null},{"id":"W2153858627","doi":"10.1109/hpdc.1997.626434","title":"Design patterns for parallel computing using a network of processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Software design pattern; Design pattern; Parallel programming model; Parallel computing; Generic programming; Distributed computing; Bulk synchronous parallel; Synchronization (alternating current); Programming paradigm; Programming language; Parallel algorithm; Software","score_opus":0.08143986316714683,"score_gpt":0.2877410573741317,"score_spread":0.20630119420698487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153858627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011164185,0.000098224395,0.9975174,0.00009917989,0.00007326597,0.00030937773,3.2321813e-7,0.00038872423,0.00039707767],"genre_scores_gemma":[0.34710965,0.000007205957,0.65264523,0.00011998577,0.000038509992,0.000004180706,3.7462885e-7,0.000006362216,0.00006848623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989899,0.000054786888,0.00029293424,0.00025509406,0.000130456,0.00027686064],"domain_scores_gemma":[0.9991965,0.00017454418,0.00017670794,0.00025408523,0.00015421087,0.000043936067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034828394,0.00011224733,0.00018169035,0.00004792515,0.00013350383,0.000060657785,0.0005391002,0.000049575287,0.000009029501],"category_scores_gemma":[0.000029933073,0.000103227525,0.00005631633,0.0002963041,0.000017162904,0.00015548812,0.000121667435,0.00004975102,0.0000014696035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002888,0.00004318801,0.0005114728,0.000031813965,0.00001147189,6.80271e-7,0.0003572265,0.98321956,0.000027533266,0.0054259165,0.0018457354,0.008522495],"study_design_scores_gemma":[0.00019629221,0.00007344129,0.000041468305,0.000050107803,0.000003677686,0.000005283367,0.000004512395,0.99683756,0.0007697882,0.0018103787,0.000077340024,0.00013017809],"about_ca_topic_score_codex":0.0000093668905,"about_ca_topic_score_gemma":3.9190627e-7,"teacher_disagreement_score":0.34599322,"about_ca_system_score_codex":0.000017512872,"about_ca_system_score_gemma":0.000018224047,"threshold_uncertainty_score":0.42094964},"labels":[],"label_agreement":null},{"id":"W2154138708","doi":"10.1109/iccd.2005.90","title":"ReCast: boosting tag line buffer coverage in low-power high-level caches \"for free\"","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Spec#; Parallel computing; Locality; CPU cache; Boosting (machine learning); Translation lookaside buffer; Reduction (mathematics); Search engine indexing; Power (physics); Page cache; Line (geometry); Filter (signal processing); Cache algorithms; Computer hardware; Physical address","score_opus":0.022579149448354027,"score_gpt":0.24578515532525136,"score_spread":0.22320600587689732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154138708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012710922,0.0000666171,0.98000306,0.0008957302,0.00017349893,0.00022158572,0.000008374303,0.00057807664,0.005342154],"genre_scores_gemma":[0.60797524,0.0000037894476,0.38904998,0.00038418,0.000064345826,0.000015847443,0.000008941932,0.000010036988,0.0024876266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987192,0.000042667663,0.00035419257,0.0003932052,0.00016988478,0.00032085483],"domain_scores_gemma":[0.9990644,0.00020092532,0.000097360535,0.0004911002,0.00010273024,0.000043490105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038880573,0.00016013674,0.00019246979,0.00015305598,0.00010074572,0.00014799251,0.00070147903,0.000093578914,0.000019049856],"category_scores_gemma":[0.000100300276,0.00014663664,0.000054743305,0.0003269527,0.00002233443,0.00026958654,0.00026038132,0.000117581134,0.000010058735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030453,0.0008720192,0.005691379,0.00011322687,0.00003545074,0.000070953036,0.0008603757,0.54212016,0.0018555148,0.30830708,0.11864169,0.021371823],"study_design_scores_gemma":[0.0014146303,0.00017961724,0.0074282927,0.00012001593,0.000004444436,0.000011317399,0.000007929384,0.93807036,0.017371383,0.031735387,0.0030602224,0.0005964247],"about_ca_topic_score_codex":0.00047980642,"about_ca_topic_score_gemma":0.000085348,"teacher_disagreement_score":0.5952643,"about_ca_system_score_codex":0.000046818655,"about_ca_system_score_gemma":0.000047862646,"threshold_uncertainty_score":0.59796685},"labels":[],"label_agreement":null},{"id":"W2154532072","doi":"10.1145/1272996.1273000","title":"JIT instrumentation","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instrumentation (computer programming); x86; Computer science; Debugging; Profiling (computer programming); Operating system; Embedded system; Linux kernel; Kernel (algebra); Software","score_opus":0.014401294391112587,"score_gpt":0.2762977702834293,"score_spread":0.2618964758923167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154532072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030756053,0.000005355356,0.9233396,0.00021091293,0.00007541264,0.000029172099,1.8898529e-8,0.00058272074,0.07268121],"genre_scores_gemma":[0.48629263,0.0000016041774,0.51285565,0.0003624873,0.000011170833,4.0986953e-7,4.0909313e-7,0.0000010345217,0.00047458528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996395,0.000006651598,0.00008427763,0.00009819922,0.000080264384,0.000091124784],"domain_scores_gemma":[0.99976707,0.000019053501,0.000022388163,0.00013725358,0.000026111624,0.000028098302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023353302,0.0000318162,0.000028011209,0.000058867827,0.000042718108,0.000045048513,0.0002161274,0.000016960996,0.000011664939],"category_scores_gemma":[0.00000698688,0.00002863695,0.0000122354,0.00017541165,0.0000061850983,0.00017719617,0.000051417403,0.000025023057,0.00003477874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018756183,0.000031774758,0.0017648117,0.000002018995,0.0000037661684,0.0000041772664,0.00028387667,0.00047266379,0.00044634662,0.6071723,0.005782654,0.38403374],"study_design_scores_gemma":[0.0007624209,0.00021272665,0.030660186,0.0000185051,0.0000030249093,0.000045509005,0.00006734719,0.65422183,0.22919363,0.04410517,0.040088564,0.0006210695],"about_ca_topic_score_codex":0.0000079865495,"about_ca_topic_score_gemma":0.000001938824,"teacher_disagreement_score":0.65374917,"about_ca_system_score_codex":0.000012496018,"about_ca_system_score_gemma":0.000007954951,"threshold_uncertainty_score":0.11677809},"labels":[],"label_agreement":null},{"id":"W2154958545","doi":"10.1109/icdcs.1990.89329","title":"Extending distributed shared memory to heterogeneous environments","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Porting; Distributed memory; Shared memory; Distributed shared memory; Ethernet; Data diffusion machine; Workstation; Homogeneous; Distributed computing; Multiprocessing; Parallel computing; Symmetric multiprocessor system; Memory management; Uniform memory access; Operating system","score_opus":0.02369750812991709,"score_gpt":0.2391324509351171,"score_spread":0.2154349428052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154958545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013883997,0.000061167375,0.9938271,0.0004688977,0.00008505675,0.00011375301,0.0000030467058,0.0006124416,0.0034401612],"genre_scores_gemma":[0.6693706,0.000019359833,0.32716665,0.0009122986,0.000026545264,0.000015350146,0.000005937511,0.000008562449,0.002474718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908525,0.000033881122,0.00015634378,0.0003192764,0.00017428864,0.0002309646],"domain_scores_gemma":[0.99937487,0.00002434415,0.00003564724,0.0004280738,0.00001023001,0.00012684964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084841995,0.0001051435,0.00009649022,0.00007660112,0.00011168603,0.00012360107,0.00063255924,0.00003497011,0.00022560878],"category_scores_gemma":[0.000021498445,0.00010045101,0.00003945678,0.00021572836,0.000010037012,0.00016658234,0.0002976717,0.000049028586,0.00036719185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104808705,0.0007734643,0.00067206554,0.000019512536,0.0000941923,0.0002213569,0.0023199732,0.4109001,0.00604957,0.0074717966,0.2111663,0.3603012],"study_design_scores_gemma":[0.0001705964,0.00007559417,0.00028983434,0.000010973069,0.0000020038017,0.000028556113,0.0000030708961,0.9614364,0.014251907,0.0002600714,0.023194889,0.0002761053],"about_ca_topic_score_codex":0.0000042333286,"about_ca_topic_score_gemma":3.464256e-7,"teacher_disagreement_score":0.66798216,"about_ca_system_score_codex":0.000046555462,"about_ca_system_score_gemma":0.00000222533,"threshold_uncertainty_score":0.4719631},"labels":[],"label_agreement":null},{"id":"W2155382325","doi":"10.1109/iiswc.2009.5306782","title":"Evaluation of the Intel&amp;#x00AE; Core&amp;#x2122; i7 Turbo Boost feature","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Turbo; Computer science; Energy consumption; Turbo code; Multi-core processor; Power consumption; Workload; Turbo generator; Power (physics); Parallel computing; Real-time computing; Operating system; Electrical engineering; Decoding methods; Algorithm; Engineering; Automotive engineering; Physics","score_opus":0.0704075067081348,"score_gpt":0.3329158394846309,"score_spread":0.2625083327764961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155382325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011874061,0.00025246886,0.95266336,0.0037097337,0.00030415654,0.0003566983,0.0000012250249,0.0004693686,0.03036892],"genre_scores_gemma":[0.6959255,0.000016221555,0.29990783,0.0012675908,0.00005457018,0.000005655063,0.0000052761434,0.000006163944,0.0028112377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982393,0.0001978754,0.0002419436,0.0003029057,0.00082610885,0.0001918822],"domain_scores_gemma":[0.99820304,0.00006392223,0.00017072268,0.0009046378,0.000608581,0.0000491009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013889738,0.00014271257,0.00015662533,0.000093385286,0.00013452124,0.00008749704,0.0011081594,0.0000995595,0.00004829542],"category_scores_gemma":[0.000311225,0.000095733536,0.0001013316,0.0005938645,0.000043973138,0.00019676011,0.00018287699,0.00018576464,0.000025293306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029372452,0.00061450433,0.0014098256,0.000026098045,0.000094836156,6.810659e-7,0.004204325,0.06747455,0.009675898,0.13316849,0.3220937,0.46120772],"study_design_scores_gemma":[0.0013302132,0.00029045017,0.02766713,0.0002244604,0.000120368415,0.00006282968,0.000036389254,0.7327873,0.026911251,0.13227199,0.07734143,0.00095615827],"about_ca_topic_score_codex":0.000017900997,"about_ca_topic_score_gemma":0.000021425243,"teacher_disagreement_score":0.6840514,"about_ca_system_score_codex":0.000068389796,"about_ca_system_score_gemma":0.00013500574,"threshold_uncertainty_score":0.39039004},"labels":[],"label_agreement":null},{"id":"W2155582075","doi":"10.1145/1017753.1017799","title":"An approach for integrating basic retiming and software pipelining","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Retiming; Software pipelining; Computer science; Parallel computing; Software; Programming language","score_opus":0.023199883706208194,"score_gpt":0.2750485989298699,"score_spread":0.2518487152236617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155582075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018018098,0.000037938196,0.9957077,0.00010139745,0.000031188025,0.0001319273,3.339927e-7,0.0009398315,0.0012478817],"genre_scores_gemma":[0.25451234,0.0000025945951,0.745164,0.00024160999,0.000026567172,0.00001230562,0.0000037002762,0.00000600599,0.000030867755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992716,0.000019865209,0.00014996517,0.00031828022,0.0000779851,0.00016233718],"domain_scores_gemma":[0.9995195,0.000057123427,0.00005151049,0.0002417326,0.00006953508,0.00006054937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003310294,0.00009192452,0.000100796366,0.00006882588,0.00019920497,0.00020273498,0.00033204947,0.00004570161,6.97936e-7],"category_scores_gemma":[0.00009063435,0.0000798397,0.000024548332,0.00013766036,0.000020106942,0.00036002675,0.00008097399,0.000073235824,3.943216e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012026554,0.00019171619,0.001625432,0.00009336469,0.000018058909,0.000003180418,0.00676774,0.2083487,0.00068703253,0.32487372,0.0005063036,0.4568727],"study_design_scores_gemma":[0.00023862325,0.00009808866,0.00005779329,0.000024135217,0.0000019703052,0.000011002105,0.000102639904,0.9895599,0.0020794794,0.0076239253,0.00005298601,0.0001494725],"about_ca_topic_score_codex":0.000019765703,"about_ca_topic_score_gemma":0.0000010750325,"teacher_disagreement_score":0.7812112,"about_ca_system_score_codex":0.000018263043,"about_ca_system_score_gemma":0.000034573775,"threshold_uncertainty_score":0.32557684},"labels":[],"label_agreement":null},{"id":"W2155729354","doi":"10.1145/1950413.1950420","title":"VEGAS","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Vector processor; Register file; Throughput; Debugging; Byte; Operating system; Computer hardware; Instruction set","score_opus":0.03994468990809405,"score_gpt":0.2413955290778263,"score_spread":0.20145083916973225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155729354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014366182,0.000007434337,0.70756733,0.000043040745,0.000039738992,0.000013226492,1.0125059e-8,0.00060593314,0.29157963],"genre_scores_gemma":[0.3125836,0.0000022192426,0.6861049,0.00027157454,0.000005745234,0.0000011738242,6.0096646e-8,0.0000011557053,0.0010295915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973524,0.0000096210615,0.00005052902,0.000092111964,0.000043060514,0.000069436996],"domain_scores_gemma":[0.99973387,0.000005486842,0.000012840598,0.00020265851,0.000020697531,0.000024437984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006214932,0.000029187455,0.000028810724,0.00003023277,0.000028086688,0.00001944229,0.00035767502,0.000013523427,0.000047783968],"category_scores_gemma":[0.000004900519,0.000024121893,0.000013501465,0.000101346435,0.0000069765983,0.000119350734,0.000081661026,0.00002155362,0.00008745646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.624755e-7,0.000030318095,0.00046053468,8.7344506e-7,0.000002578336,0.0000037862508,0.0005124086,0.000028627737,0.000023850365,0.9667055,0.009907434,0.022323534],"study_design_scores_gemma":[0.0003488717,0.00024994242,0.010786991,0.000014426705,0.000002939034,0.00004502293,0.000016861753,0.6886948,0.08505429,0.18047519,0.033700466,0.0006102175],"about_ca_topic_score_codex":0.000014154939,"about_ca_topic_score_gemma":3.5162128e-7,"teacher_disagreement_score":0.7862303,"about_ca_system_score_codex":0.0000029863647,"about_ca_system_score_gemma":0.000007792125,"threshold_uncertainty_score":0.1124105},"labels":[],"label_agreement":null},{"id":"W2155733037","doi":"10.1109/fmpc.1988.47417","title":"Parallel implementations of the simplex algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Health Sciences Centre Foundation","keywords":"Computer science; Parallel computing; Compiler; Implementation; Massively parallel; Parallel algorithm; Asynchronous communication; Fortran; Class (philosophy); Algorithm; Multiprocessing; Simplex; Programming language; Artificial intelligence; Mathematics","score_opus":0.021740388697487754,"score_gpt":0.28832210515831197,"score_spread":0.26658171646082424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155733037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014010108,0.000015417094,0.9816695,0.00034027366,0.00007023568,0.00009412794,9.369984e-7,0.00013341432,0.017536024],"genre_scores_gemma":[0.123236805,0.000005399098,0.87575823,0.00033127758,0.0000046346677,0.0000060128846,5.4390756e-7,0.0000025038007,0.0006546027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00007181147,0.00016345936,0.00011818776,0.00012587347,0.00011233301],"domain_scores_gemma":[0.99944067,0.000043288746,0.00006751749,0.000363466,0.00006205536,0.000023030116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016444782,0.00005279771,0.00006156495,0.000032079297,0.000102407685,0.000028576673,0.00047748577,0.000017143491,0.000048800226],"category_scores_gemma":[0.00002563574,0.000035265923,0.000047852587,0.0003127437,0.000023932025,0.000094544645,0.000090857284,0.00003744919,0.000004386646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.944486e-7,0.000045444405,0.0007844099,0.0000024044991,0.0000106651,2.7335375e-7,0.00023615074,0.003779002,0.000047056234,0.95145714,0.013537812,0.030099468],"study_design_scores_gemma":[0.00090334646,0.00010300139,0.006337513,0.00001590642,0.000011702807,0.000027478693,0.00013461623,0.7108242,0.041705538,0.13609572,0.10339119,0.000449803],"about_ca_topic_score_codex":0.000020741529,"about_ca_topic_score_gemma":0.0000030384097,"teacher_disagreement_score":0.8153614,"about_ca_system_score_codex":0.0000088573515,"about_ca_system_score_gemma":0.000048353802,"threshold_uncertainty_score":0.14381026},"labels":[],"label_agreement":null},{"id":"W2155835356","doi":"10.1109/fpga.2000.903387","title":"Design of a VLIW compute accelerator on the Transmogrifier-2","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Very long instruction word; Compiler; Instruction set; Computer architecture; Software; Set (abstract data type); Class (philosophy); Process (computing); Hardware architecture; Embedded system; Computer hardware; Operating system; Programming language; Artificial intelligence","score_opus":0.07515317402227784,"score_gpt":0.24571373857461604,"score_spread":0.1705605645523382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155835356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028728513,0.000045422963,0.98537534,0.0019127263,0.000056569235,0.00015903906,2.2039305e-7,0.00035175984,0.01181166],"genre_scores_gemma":[0.5799851,0.000031368065,0.41827497,0.0010959428,0.000017801885,0.000008390926,1.3476718e-7,0.000005138602,0.0005811735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992094,0.0001188639,0.00017392963,0.00018338105,0.00017740419,0.00013699556],"domain_scores_gemma":[0.99919426,0.000232273,0.000058112313,0.0004248648,0.000057172918,0.000033304084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024912282,0.00009032019,0.000107970074,0.00006126367,0.00009333162,0.00006946405,0.000861774,0.000036858863,0.00008972671],"category_scores_gemma":[0.000011554435,0.000055881916,0.000044337336,0.00032761323,0.000033285844,0.00009712863,0.000048099326,0.000086487365,0.00003451879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013449269,0.00054160354,0.000048271162,0.000017335065,0.00006321109,0.000009349984,0.002919144,0.12972611,0.0012648372,0.5623784,0.21412016,0.08889814],"study_design_scores_gemma":[0.00010269238,0.00012878254,0.000029544843,0.000011645026,0.0000013780677,0.0000026518717,0.0000028460393,0.98354626,0.013361899,0.0012467494,0.0014793595,0.00008619637],"about_ca_topic_score_codex":0.0000032676955,"about_ca_topic_score_gemma":9.488378e-8,"teacher_disagreement_score":0.85382015,"about_ca_system_score_codex":0.000007315724,"about_ca_system_score_gemma":0.000009650276,"threshold_uncertainty_score":0.22787984},"labels":[],"label_agreement":null},{"id":"W2156403661","doi":"10.1109/l-ca.2008.13","title":"Multicore DIMM: an Energy Efficient Memory Module with Independently Controlled DRAMs","year":2008,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Registered memory; Embedded system; Interleaved memory; Dram; Multi-core processor; Virtual memory; Memory management; Semiconductor memory; Memory bandwidth; Memory controller; Memory map; Computer hardware; Operating system","score_opus":0.009121959770687846,"score_gpt":0.204740974859805,"score_spread":0.19561901508911717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156403661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20889306,0.000028941055,0.78796846,0.0011199252,0.00048528484,0.00031044913,0.0000014676922,0.0010683539,0.00012406496],"genre_scores_gemma":[0.65555966,0.0000028892673,0.33727613,0.006723953,0.00031755574,0.000036401554,0.000007448465,0.000032203716,0.000043773445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695265,0.00032543836,0.00043459298,0.0009681659,0.0006846731,0.0006344906],"domain_scores_gemma":[0.99809,0.00016284971,0.00022306155,0.001138172,0.00011764487,0.00026825702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002150146,0.00047306667,0.000573066,0.00038083727,0.00042747537,0.00020268625,0.0016243921,0.00011661887,0.00000363403],"category_scores_gemma":[0.000005994841,0.00036485677,0.00017838115,0.0004523167,0.00020179135,0.00020375071,0.0002357315,0.00041420502,0.000009184623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107198,0.00018356788,0.000113440394,0.000007444143,0.0000657796,0.0002415464,0.0018467905,0.9804749,0.0010134503,0.00019505483,0.0013812362,0.01436962],"study_design_scores_gemma":[0.0035335536,0.00032985536,0.00059157435,0.000040191742,0.000012790503,0.0005175134,0.0000027976587,0.99093145,0.0030435498,0.00008887638,0.00033278405,0.00057508575],"about_ca_topic_score_codex":0.00010834804,"about_ca_topic_score_gemma":0.000018893375,"teacher_disagreement_score":0.45069233,"about_ca_system_score_codex":0.00006458573,"about_ca_system_score_gemma":0.00007055413,"threshold_uncertainty_score":0.9998803},"labels":[],"label_agreement":null},{"id":"W2156740638","doi":"10.1109/ccece.2003.1226100","title":"A distributed implementation of fast Fourier transform on indirect swap networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Swap (finance); Locality; Fast Fourier transform; Parallel computing; Network topology; Distributed memory; Distributed algorithm; Distributed database; Distributed computing; Algorithm; Computer network; Shared memory","score_opus":0.012340070178468655,"score_gpt":0.27306836398002265,"score_spread":0.260728293801554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156740638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044185496,0.000007879581,0.9917318,0.00058690115,0.000055452518,0.00014593455,0.0000036163249,0.0003221952,0.0027276708],"genre_scores_gemma":[0.86116326,0.000011272656,0.13858992,0.00016444834,0.000015143351,0.000007673499,0.000018521347,0.000003962619,0.000025785559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929166,0.000019855515,0.00020648546,0.00017061156,0.00015521336,0.0001561884],"domain_scores_gemma":[0.9996041,0.000022452177,0.00007181505,0.00020845869,0.00005257248,0.000040571755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014622975,0.0000878283,0.00011281151,0.00007700435,0.000061281804,0.000038472037,0.00028901367,0.000039871207,0.000014822817],"category_scores_gemma":[0.0000036307936,0.0000732842,0.000050409857,0.00034974472,0.000015629166,0.0001477148,0.000032539745,0.000063077496,0.0000028555514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019942561,0.00022324757,0.0007466261,0.000014889587,0.00005604755,0.0000060488933,0.0017543847,0.48824638,0.00006740666,0.11118155,0.0032899687,0.3943935],"study_design_scores_gemma":[0.00308128,0.0012088623,0.007893706,0.00010366352,0.000019230216,0.00001468503,0.00021690929,0.8425762,0.12442729,0.01772512,0.0020433909,0.0006896728],"about_ca_topic_score_codex":0.00006512781,"about_ca_topic_score_gemma":0.000022363341,"teacher_disagreement_score":0.8567447,"about_ca_system_score_codex":0.00004151758,"about_ca_system_score_gemma":0.000041621526,"threshold_uncertainty_score":0.2988443},"labels":[],"label_agreement":null},{"id":"W2156742168","doi":"10.1145/1133255.1133995","title":"Shared memory programming for large scale machines","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Compiler; Parallel computing; Scalability; Runtime system; Distributed memory; Partitioned global address space; Optimizing compiler; Programming paradigm; Shared memory; Asynchronous communication; Programming language; Operating system","score_opus":0.016197497304911726,"score_gpt":0.2706697248421612,"score_spread":0.25447222753724946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156742168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009586799,0.0002539396,0.98547536,0.0008057432,0.00022056879,0.00035586284,0.00001531837,0.0011914759,0.0020949428],"genre_scores_gemma":[0.32779557,0.0000013047348,0.67130053,0.00018686555,0.0001595967,0.00004118439,0.000044019114,0.000010653385,0.00046032047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989443,0.000034493278,0.00021126878,0.00034251047,0.00015753029,0.00030989852],"domain_scores_gemma":[0.9989849,0.00022526241,0.000121448174,0.00053876895,0.0000843899,0.00004524892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030385167,0.00013442371,0.00014849877,0.00009193389,0.0002326226,0.0002973919,0.0011454344,0.00006016236,0.000006619784],"category_scores_gemma":[0.00010043087,0.000121219404,0.00006413255,0.00020559716,0.000016302869,0.00035499866,0.00025932837,0.000066449145,0.0000138581445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001703813,0.0023322378,0.059037965,0.0009913475,0.00018584533,0.00008632223,0.0066618025,0.058040574,0.00236835,0.14832191,0.25445968,0.46734357],"study_design_scores_gemma":[0.00094124867,0.0001755737,0.004394231,0.000068022346,0.000020928457,0.0000103734155,0.00003990509,0.9400597,0.0042256666,0.011534629,0.037942234,0.00058745855],"about_ca_topic_score_codex":0.00007072561,"about_ca_topic_score_gemma":0.000068244466,"teacher_disagreement_score":0.88201916,"about_ca_system_score_codex":0.00001338203,"about_ca_system_score_gemma":0.000022713095,"threshold_uncertainty_score":0.49431837},"labels":[],"label_agreement":null},{"id":"W2157158468","doi":"10.5555/2485288.2485455","title":"Characterizing the performance benefits of fused CPU/GPU systems using FusionSim","year":2013,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Speedup; Computer science; Parallel computing; Overhead (engineering); Computation; Software; Supercomputer; Simple (philosophy); General-purpose computing on graphics processing units; Performance improvement; Coherence (philosophical gambling strategy); Computer engineering; Algorithm; Graphics; Operating system; Mathematics","score_opus":0.030276892189869595,"score_gpt":0.22965288769395908,"score_spread":0.1993759955040895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157158468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48253056,0.000197525,0.5162831,0.000105409556,0.000106123196,0.00033453823,7.926001e-7,0.00023956229,0.00020235652],"genre_scores_gemma":[0.9554912,0.00015994183,0.04416905,0.00008663425,0.000026114978,0.0000130691005,0.0000017010956,0.000008991985,0.000043300657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898034,0.00019508993,0.0003367878,0.00018733564,0.00014813102,0.0001523247],"domain_scores_gemma":[0.9988306,0.0003829009,0.00020106985,0.000290474,0.00026236472,0.00003254497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006112721,0.000107765794,0.00013949629,0.00013007152,0.00018820738,0.00019032204,0.0003600009,0.00003560621,0.0000026228872],"category_scores_gemma":[0.00014585773,0.000080150625,0.000012103934,0.0006205095,0.000037966314,0.00048931857,0.0001001657,0.00007291723,0.000007573067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012296643,0.00065145956,0.11619979,0.0006406327,0.000056035547,0.000009480316,0.017209873,0.6298478,0.07115301,0.029556237,0.0019113263,0.13275203],"study_design_scores_gemma":[0.00009658652,0.000041114447,0.089246534,0.000114759365,0.000002055681,0.0000150237875,0.000009129206,0.90841615,0.0018396563,0.000026395326,0.000099617275,0.000092978175],"about_ca_topic_score_codex":0.000058984522,"about_ca_topic_score_gemma":4.6936975e-7,"teacher_disagreement_score":0.47296062,"about_ca_system_score_codex":0.000012379129,"about_ca_system_score_gemma":0.00004466507,"threshold_uncertainty_score":0.32684475},"labels":[],"label_agreement":null},{"id":"W2157833041","doi":"10.1109/async.2001.914084","title":"How to achieve worst-case performance [self-timed circuit design]","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Intuition; Percolation (cognitive psychology); Electronic circuit; Connection (principal bundle); Theoretical computer science; Topology (electrical circuits); Mathematics; Electrical engineering","score_opus":0.04461015012894234,"score_gpt":0.22645397793322503,"score_spread":0.18184382780428268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157833041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023133736,0.000039881408,0.98294264,0.0014168001,0.000111783476,0.00026525624,2.1128488e-7,0.0021712447,0.010738806],"genre_scores_gemma":[0.48435083,0.000019611905,0.51046604,0.00064673787,0.00003326617,0.000017529357,1.9797658e-7,0.0000074503364,0.004458336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988223,0.00007568883,0.00016251368,0.0003977445,0.00020716489,0.00033461445],"domain_scores_gemma":[0.99899656,0.0000818499,0.000056113877,0.00060432736,0.00009075585,0.00017037304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028010822,0.00015875166,0.0001438676,0.00016888637,0.00021530113,0.0003988499,0.00076851924,0.00006118948,0.000040769843],"category_scores_gemma":[0.00003440448,0.00014180882,0.000044621123,0.00060314144,0.0000137788,0.0004959038,0.0002050352,0.00010960483,0.00019270697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019302903,0.0005213398,0.00046006718,0.000059455157,0.0000915771,0.00080502336,0.0076906714,0.07429703,0.00039615668,0.03138802,0.2366345,0.6476369],"study_design_scores_gemma":[0.00014534128,0.0002507591,0.000032244374,0.000011001564,0.0000029026644,0.000325882,0.0000071275927,0.9918513,0.0024716211,0.00031140412,0.004332306,0.00025812662],"about_ca_topic_score_codex":0.0000050071294,"about_ca_topic_score_gemma":7.121962e-7,"teacher_disagreement_score":0.91755426,"about_ca_system_score_codex":0.000058368034,"about_ca_system_score_gemma":0.000018452329,"threshold_uncertainty_score":0.5782796},"labels":[],"label_agreement":null},{"id":"W2157933512","doi":"10.1145/1242531.1242568","title":"Speculative supplier identification for reducing power of interconnects in snoopy cache coherence protocols","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache coherence; MESIF protocol; MESI protocol; Cache; Interconnection; Bus sniffing; Latency (audio); Node (physics); Low latency (capital markets); Embedded system; Computer network; CPU cache; Cache algorithms; Telecommunications; Engineering","score_opus":0.03207702493534087,"score_gpt":0.3395224962901869,"score_spread":0.307445471354846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157933512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144137265,0.000004074286,0.97707695,0.000096544114,0.000043955402,0.0046079503,7.077603e-7,0.000119077355,0.003637022],"genre_scores_gemma":[0.69990647,2.1826214e-7,0.29937795,0.000033884706,0.000007162302,0.00048089595,0.0000016131296,0.000003817233,0.0001879928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990051,0.000030807532,0.00039426438,0.00027615618,0.000121019526,0.00017265356],"domain_scores_gemma":[0.99915534,0.00015301444,0.00016886333,0.00031814195,0.00017339361,0.000031217554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009892375,0.00008191016,0.00013156405,0.00017262096,0.000032655706,0.00004726236,0.00043348392,0.000051930365,0.000014915412],"category_scores_gemma":[0.00012413152,0.000076329095,0.00003651038,0.00035357804,0.000028781546,0.00023696684,0.00008351558,0.00006251175,0.0000026176592],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027380613,0.0011531601,0.009582323,0.00029272866,0.000061600535,0.00001227609,0.026558895,0.021201972,0.19551031,0.65089417,0.006416565,0.088042215],"study_design_scores_gemma":[0.00051522715,0.0001918387,0.009713131,0.00015768317,0.0000015558719,0.0000031634188,0.00012662607,0.12093948,0.8598322,0.008029324,0.0002734364,0.00021630364],"about_ca_topic_score_codex":0.00003647053,"about_ca_topic_score_gemma":0.000014843897,"teacher_disagreement_score":0.68549275,"about_ca_system_score_codex":0.000047595702,"about_ca_system_score_gemma":0.000039230665,"threshold_uncertainty_score":0.311261},"labels":[],"label_agreement":null},{"id":"W2157942139","doi":"10.1145/1806799.1806858","title":"Views","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Computing and Communication Foundations","keywords":"Computer science; Concurrency; Concurrency control; Programming language; Multiversion concurrency control; Task (project management); Concurrent computing; Isolation (microbiology); Distributed computing; Distributed concurrency control","score_opus":0.020822292326090727,"score_gpt":0.27833262191107416,"score_spread":0.25751032958498343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157942139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073402264,0.0000041594144,0.8735174,0.00049950683,0.00016567767,0.000022393517,1.9146668e-8,0.0006709709,0.12438584],"genre_scores_gemma":[0.19772306,0.0000016630172,0.7999848,0.00053909054,0.000023844781,0.0000018647031,1.4724266e-7,0.0000013782554,0.0017241592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997137,0.000007382594,0.000058219335,0.000100407335,0.000051279734,0.0000689952],"domain_scores_gemma":[0.9996442,0.000013110807,0.000014874561,0.00027502034,0.000023500648,0.000029250497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011131138,0.00003147352,0.00003378129,0.000028237277,0.000037879166,0.00005804466,0.00040864336,0.000021132877,0.000043936412],"category_scores_gemma":[0.000013005434,0.000024797502,0.000016113623,0.000104733714,0.0000082820125,0.00010957427,0.00008116879,0.000069750604,0.00009796724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.6619714e-7,0.000020207332,0.00022765351,9.1558275e-7,0.0000012528292,0.0000012741257,0.0000772859,0.000065642256,0.0025410487,0.887866,0.033044696,0.076153845],"study_design_scores_gemma":[0.00010428219,0.000027147196,0.0010007432,0.0000020722582,5.890166e-7,0.00002067482,0.0000011877207,0.55631983,0.027297834,0.02347985,0.39154968,0.00019611936],"about_ca_topic_score_codex":0.0000033710073,"about_ca_topic_score_gemma":0.000003626005,"teacher_disagreement_score":0.86438614,"about_ca_system_score_codex":0.000001199692,"about_ca_system_score_gemma":0.0000100697125,"threshold_uncertainty_score":0.12592034},"labels":[],"label_agreement":null},{"id":"W2158006601","doi":"10.1109/ccece.1998.682561","title":"A Colliding Puck Simulator for Computational RAM","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; SIMD; Workstation; Parallel computing; Massively parallel; Computer architecture simulator; Computer architecture; Operating system","score_opus":0.03864820600056178,"score_gpt":0.2767005917723432,"score_spread":0.2380523857717814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158006601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045772776,0.00003802998,0.992865,0.00080079614,0.0000923221,0.00019075927,0.0000010096805,0.0007869615,0.004767363],"genre_scores_gemma":[0.43884882,0.0000020409545,0.55946493,0.0005073399,0.000027341568,0.000012255851,0.000001493987,0.000004136257,0.0011316701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993177,0.000018426583,0.0001560322,0.00021829699,0.0001286289,0.00016090265],"domain_scores_gemma":[0.99940425,0.000209892,0.000048013255,0.0001710197,0.000113655246,0.000053182994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013168025,0.00007695517,0.00009203818,0.00007434708,0.00015659897,0.00014024776,0.0003616264,0.000035315523,0.00003760415],"category_scores_gemma":[0.00004505038,0.00007286664,0.000051839346,0.00021470494,0.000012656341,0.00018863822,0.00007402566,0.00003554955,0.00003484031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012681268,0.000051303705,0.00006987381,0.0000059721565,0.000007981053,8.5189964e-7,0.00012968092,0.82112664,0.000010547541,0.13490918,0.036695816,0.006990887],"study_design_scores_gemma":[0.00023511582,0.000042017993,0.00002980384,0.0000047604713,0.0000011219566,0.0000034201707,0.0000019361262,0.9835451,0.00020394039,0.007347594,0.008482174,0.00010297268],"about_ca_topic_score_codex":0.0000014241792,"about_ca_topic_score_gemma":1.7933766e-7,"teacher_disagreement_score":0.4383911,"about_ca_system_score_codex":0.000022461878,"about_ca_system_score_gemma":0.00001195704,"threshold_uncertainty_score":0.29714152},"labels":[],"label_agreement":null},{"id":"W2158151680","doi":"10.1109/parbse.1990.77126","title":"Parallel function invocation in a dynamic argument-fetching dataflow architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Dataflow architecture; Dataflow; Parallel computing; Architecture; Address space; Overlay; Programming language; Distributed computing; Theoretical computer science; Operating system","score_opus":0.015668242292788553,"score_gpt":0.23862513583425765,"score_spread":0.2229568935414691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158151680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002588185,0.00012442627,0.99005055,0.0013232211,0.00011420937,0.00014877283,3.3695514e-7,0.00062812754,0.005022166],"genre_scores_gemma":[0.6052294,0.000049621463,0.39339843,0.0005825358,0.00001707945,0.00001578972,0.000009789913,0.0000065245113,0.0006908295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896955,0.000078636476,0.00022376313,0.00035059638,0.00016823705,0.00020918314],"domain_scores_gemma":[0.99936956,0.0000402778,0.00006682722,0.00045159823,0.00002633856,0.00004542136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021687288,0.000118445736,0.00010678854,0.0002360679,0.00008399986,0.00013025495,0.0004937789,0.000058089543,0.000040653227],"category_scores_gemma":[0.00002552746,0.00010973478,0.000030471776,0.00046657518,0.0000131642,0.0004147314,0.00014137663,0.0001689994,0.000056419383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015763519,0.00038048733,0.00160574,0.00003505104,0.00002338767,0.000012961515,0.002476378,0.44569764,0.00058195705,0.04698245,0.006716878,0.49547133],"study_design_scores_gemma":[0.00023723226,0.000043340246,0.0014297921,0.000018831584,0.0000014603658,0.0000071928257,0.000008306813,0.9891337,0.00004573051,0.007526587,0.0014042966,0.00014350115],"about_ca_topic_score_codex":0.00003733865,"about_ca_topic_score_gemma":0.000050464903,"teacher_disagreement_score":0.6026412,"about_ca_system_score_codex":0.000056596815,"about_ca_system_score_gemma":0.000010147136,"threshold_uncertainty_score":0.44748542},"labels":[],"label_agreement":null},{"id":"W2158190559","doi":"10.1145/2749469.2750421","title":"Fusion","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Granularity; Locality; Computer science; Coprocessor; Preprocessor; Multi-core processor; Chip; Computer architecture; Function (biology); System on a chip; Efficient energy use; Embedded system; Distributed computing; Operating system; Programming language; Telecommunications; Engineering; Electrical engineering","score_opus":0.036977331262142143,"score_gpt":0.2744554830468151,"score_spread":0.23747815178467296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158190559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032817625,0.000017202707,0.8821853,0.0005300423,0.00007758665,0.000017222425,1.2326136e-8,0.0007136123,0.11613088],"genre_scores_gemma":[0.2548744,0.0000020205857,0.74276304,0.00045172923,0.000016602135,9.899276e-7,2.524281e-7,0.0000012736614,0.0018896825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997142,0.0000135620885,0.000046720066,0.000084143,0.00008254579,0.00005885842],"domain_scores_gemma":[0.99970895,0.0000068875383,0.000011846623,0.00017142604,0.00004807978,0.000052807525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012912299,0.00002634387,0.000028194932,0.00002885438,0.000019988885,0.000042327767,0.00027119735,0.0000137161605,0.0000042733523],"category_scores_gemma":[0.000016726914,0.000021007882,0.000009074031,0.00012047265,0.0000043818195,0.000118927135,0.00012025206,0.000019548943,0.00007960513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017664686,0.000048311642,0.00059817615,0.0000013824151,0.000002521218,0.0000063175034,0.00055315404,0.004847658,0.00008725356,0.62225944,0.2881591,0.0834349],"study_design_scores_gemma":[0.00014766131,0.000053448475,0.00013765095,0.000002715458,3.254936e-7,0.000009094897,0.000006977224,0.92492616,0.003237625,0.02287048,0.04850706,0.000100778205],"about_ca_topic_score_codex":0.0000075481844,"about_ca_topic_score_gemma":2.852449e-7,"teacher_disagreement_score":0.9200785,"about_ca_system_score_codex":0.000007871227,"about_ca_system_score_gemma":0.000021552803,"threshold_uncertainty_score":0.10231894},"labels":[],"label_agreement":null},{"id":"W2158630919","doi":"10.1145/1150019.1136508","title":"Spatial Memory Streaming","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Parallel computing; Memory bandwidth; Exploit; Block size; Cache-only memory architecture; Interleaved memory; Uniform memory access; Block (permutation group theory); Registered memory; Shared memory; Flat memory model; Cache coloring; Computer architecture; CPU cache; Memory management; Semiconductor memory; Computer hardware; Operating system; Key (lock)","score_opus":0.009048801510486407,"score_gpt":0.23477378888692355,"score_spread":0.22572498737643715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158630919","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007557061,0.00009286451,0.98383105,0.0021332735,0.0004818119,0.00028416223,0.0000020880434,0.0015920199,0.0040256903],"genre_scores_gemma":[0.3253672,0.0000050136337,0.6725928,0.00085634127,0.0009307685,0.000015146936,0.000015528103,0.000023140346,0.00019402965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974312,0.00022116087,0.00044315564,0.00079427386,0.0005030796,0.0006070917],"domain_scores_gemma":[0.99758446,0.00039203174,0.00015235644,0.001618819,0.00011047886,0.0001418379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026854913,0.0003457534,0.00032097253,0.00033934013,0.00027398104,0.00033221752,0.0027258878,0.0001177106,0.000013640248],"category_scores_gemma":[0.00005276345,0.0003145426,0.00016356578,0.00048681593,0.00008233725,0.0002087117,0.0015399791,0.00042744185,0.000038954084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009100028,0.00012460502,0.0008477282,0.000020893742,0.000024061814,0.00006396522,0.00055744953,0.09501469,0.00060850166,0.0038328532,0.016236084,0.8826601],"study_design_scores_gemma":[0.0015950946,0.0005878235,0.016192935,0.00013542653,0.000019473606,0.00028165875,0.0000072923663,0.8276595,0.0083934115,0.097721644,0.04595521,0.0014505282],"about_ca_topic_score_codex":0.0008779778,"about_ca_topic_score_gemma":0.00015229182,"teacher_disagreement_score":0.88120955,"about_ca_system_score_codex":0.00005301041,"about_ca_system_score_gemma":0.000094597504,"threshold_uncertainty_score":0.9999307},"labels":[],"label_agreement":null},{"id":"W2158716966","doi":"10.1109/ipdps.2007.370682","title":"A Comprehensive Analysis of OpenMP Applications on Dual-Core Intel Xeon SMPs","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Xeon; Computer science; Xeon Phi; Multi-core processor; Benchmark (surveying); Suite; Parallel computing; Multithreading; Speedup; Bottleneck; Computer architecture; Dual (grammatical number); Operating system; Software; Shared memory; Embedded system","score_opus":0.039785485744979324,"score_gpt":0.3253976155980617,"score_spread":0.2856121298530824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158716966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004645591,0.000039920953,0.9766162,0.0001247745,0.000024795894,0.0001853389,0.0000016262634,0.00031288635,0.018048855],"genre_scores_gemma":[0.6896909,0.000019696872,0.30937064,0.00053778145,0.0000135863875,0.000011840587,0.000010472272,0.000004329794,0.00034078455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.000021597372,0.00030479746,0.00028812187,0.00019887197,0.00015325399],"domain_scores_gemma":[0.9987319,0.00020050869,0.0001324098,0.0006327859,0.00024123528,0.00006116369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023885677,0.00009772073,0.00021624003,0.0005331399,0.00007403849,0.00003866251,0.00053037656,0.000050084756,0.000020062114],"category_scores_gemma":[0.000014345217,0.00008616751,0.000110069624,0.0019688383,0.0000379546,0.00008555528,0.00017344016,0.00008151218,0.000018013376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002355678,0.00045509226,0.002260729,0.000024136374,0.0005242193,0.000007392938,0.0009287458,0.087882504,0.0014284069,0.83191484,0.0042823753,0.07026802],"study_design_scores_gemma":[0.00029793422,0.00022074864,0.020986639,0.000026727997,0.00012549428,0.000005162208,0.00010968972,0.940988,0.021033294,0.004118669,0.011687677,0.00039995022],"about_ca_topic_score_codex":0.000044310247,"about_ca_topic_score_gemma":0.000018426925,"teacher_disagreement_score":0.8531055,"about_ca_system_score_codex":0.000024660561,"about_ca_system_score_gemma":0.000019276109,"threshold_uncertainty_score":0.35138088},"labels":[],"label_agreement":null},{"id":"W2158753164","doi":"10.1109/ipdps.2001.924959","title":"On-line debugging and performance monitoring with barriers","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Debugging; Computer science; POSIX Threads; Operating system; POSIX; SPMD; Construct (python library); Thread (computing); Parallel computing; Embedded system; Programming language","score_opus":0.02131164798406566,"score_gpt":0.23699489513404026,"score_spread":0.2156832471499746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158753164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08440955,0.00007381877,0.90568864,0.00025841285,0.000044685177,0.000040099065,4.0327894e-8,0.0006379905,0.008846765],"genre_scores_gemma":[0.8103471,0.000050013936,0.18901965,0.00012280412,0.000016672551,0.0000024296346,4.4189072e-8,0.0000032907672,0.00043801763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995322,0.000009581566,0.0000653806,0.0001675898,0.00010159044,0.00012364125],"domain_scores_gemma":[0.9996818,0.000030159707,0.000022002332,0.00017314748,0.000023875535,0.00006905503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000668849,0.00006815469,0.000057181704,0.000056614666,0.00013783894,0.00008051946,0.00017941902,0.000017166834,0.000011086689],"category_scores_gemma":[0.000010157042,0.000050930572,0.0000068373756,0.00014242799,0.00001744771,0.00019680367,0.000052054365,0.000061481114,0.0000069905323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030753014,0.00009989793,0.08575192,0.000059857895,0.00005821205,0.000037866605,0.0032264683,0.2923385,0.00009140143,0.04115611,0.006730337,0.5704187],"study_design_scores_gemma":[0.00011135093,0.00017504614,0.00044869824,0.00002984944,8.6401974e-7,0.0000103562925,0.0000044254944,0.9964644,0.002430657,0.000089599016,0.00014298994,0.000091775386],"about_ca_topic_score_codex":0.0000025568097,"about_ca_topic_score_gemma":1.2079396e-7,"teacher_disagreement_score":0.72593755,"about_ca_system_score_codex":0.000009465145,"about_ca_system_score_gemma":0.0000051467723,"threshold_uncertainty_score":0.20768884},"labels":[],"label_agreement":null},{"id":"W2158800048","doi":"10.1145/586094.586103","title":"STEP","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Computer science; Tracing; Compiler; Programming language; Java; TRACE (psycholinguistics); Reuse; Interface (matter); Encoding (memory); Set (abstract data type); Software engineering; Operating system; Artificial intelligence","score_opus":0.024324306944741938,"score_gpt":0.23748497048203207,"score_spread":0.21316066353729013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158800048","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042734988,0.00003704404,0.8107488,0.0005836128,0.000038423746,0.000016449558,1.7867329e-8,0.00073834736,0.18779457],"genre_scores_gemma":[0.20268433,0.000013828296,0.7889345,0.0006501535,0.000013716676,0.0000014273143,6.9268836e-8,0.0000015781247,0.007700352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970317,0.000010779074,0.000052840507,0.000097515825,0.00006124702,0.00007446324],"domain_scores_gemma":[0.9997297,0.000012393387,0.000012053026,0.00020343193,0.00001783559,0.000024580171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042280037,0.00003056277,0.00003109359,0.000030260588,0.000036589547,0.000051598312,0.00031429087,0.000013712214,0.00012112938],"category_scores_gemma":[0.000006031049,0.000025755175,0.000014242587,0.00012921308,0.0000054939296,0.0001124643,0.00006631996,0.000024333101,0.00022134572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.4137491e-7,0.000050463193,0.00019569423,0.00000167727,0.00000354462,0.000004813008,0.0001611434,0.00074629957,0.000026745218,0.45595396,0.33224398,0.21061154],"study_design_scores_gemma":[0.000036493562,0.0000125255165,0.000053780273,0.0000011035271,1.6502362e-7,0.000003850217,6.0660994e-7,0.96704113,0.00041961588,0.00082148105,0.03156102,0.00004822399],"about_ca_topic_score_codex":0.0000025486563,"about_ca_topic_score_gemma":1.8519924e-7,"teacher_disagreement_score":0.9662948,"about_ca_system_score_codex":0.000004262073,"about_ca_system_score_gemma":0.0000013743257,"threshold_uncertainty_score":0.2845025},"labels":[],"label_agreement":null},{"id":"W2158990613","doi":"10.1109/ispass.2000.842296","title":"Simplified workload characterization using unified prediction","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Workload; Memory footprint; Compiler; Architecture; Human multitasking; Memory hierarchy; Distributed computing; Simple (philosophy); Hierarchy; Computer architecture; Computer engineering; Parallel computing; Programming language; Operating system","score_opus":0.04202316989144851,"score_gpt":0.2459248567254342,"score_spread":0.20390168683398568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158990613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009070193,0.000019069204,0.9827449,0.00024892404,0.00018800214,0.0001007498,8.4448027e-7,0.0012842434,0.006343072],"genre_scores_gemma":[0.80462503,0.000052539664,0.19346872,0.00041233143,0.000079795645,0.0000042228658,0.0000072877947,0.000008126398,0.0013419607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992256,0.00004423072,0.00019058595,0.00023875492,0.0001415996,0.00015923542],"domain_scores_gemma":[0.999474,0.000017928478,0.00007622758,0.00030998368,0.00007056016,0.000051297346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010825564,0.000090101385,0.00008430752,0.000113616,0.00014260107,0.00014856383,0.0003095804,0.00006138487,0.00006157905],"category_scores_gemma":[0.000015198003,0.0000872657,0.00002881338,0.000443693,0.000013100038,0.0004483581,0.00008465689,0.00006564952,0.000034636316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019201088,0.00077578134,0.006448186,0.000052879972,0.00009406678,0.000025515981,0.0030214207,0.08447344,0.12099718,0.12482931,0.009825258,0.6494378],"study_design_scores_gemma":[0.00010219597,0.000021108495,0.001002482,0.000013915768,0.0000019299002,0.0000074889786,0.000001907085,0.9946719,0.0026648878,0.0003079937,0.0011064798,0.00009774985],"about_ca_topic_score_codex":0.0000060202597,"about_ca_topic_score_gemma":2.1880865e-7,"teacher_disagreement_score":0.91019845,"about_ca_system_score_codex":0.000031264288,"about_ca_system_score_gemma":0.000007882867,"threshold_uncertainty_score":0.3558592},"labels":[],"label_agreement":null},{"id":"W2159462167","doi":"10.1109/icpp.2004.22","title":"Architecture and implementation of chip multiprocessors: custom logic components and software for rapid prototyping","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Embedded system; Computer architecture; Executable; Programmable Array Logic; Rapid prototyping; Software prototyping; Software; Simple programmable logic device; Logic synthesis; Computer hardware; Logic family; Operating system; Logic gate; Software development; Engineering","score_opus":0.04113826213252978,"score_gpt":0.3106224465497966,"score_spread":0.2694841844172668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159462167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20946993,0.00022407087,0.78401357,0.0043465067,0.00007741837,0.0011503927,0.000009810586,0.00015562076,0.0005526849],"genre_scores_gemma":[0.7384673,0.000043385175,0.26126197,0.00012967201,0.000016807335,0.00006168287,0.0000022145534,0.000006976195,0.0000099958415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998893,0.0000057045936,0.0003296377,0.00032386882,0.00029618703,0.0001515554],"domain_scores_gemma":[0.9985918,0.000033490796,0.00049880974,0.00007251494,0.0007650859,0.000038314396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024944564,0.00015347087,0.00018237534,0.00013937184,0.00016047225,0.00016484607,0.0007055011,0.000054100983,0.0000015887331],"category_scores_gemma":[0.0001285199,0.000117459655,0.000038526166,0.00016429431,0.000107595995,0.00037671524,0.00023795117,0.0001204565,1.1935288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004653596,0.00038487717,0.009725885,0.0024042912,0.00015551943,5.6015625e-7,0.01080838,0.005531649,0.050571453,0.5645659,0.00008974761,0.3552964],"study_design_scores_gemma":[0.005741871,0.0008855831,0.01521234,0.0035374633,0.000050202507,0.00007254737,0.0010107394,0.21153209,0.16605978,0.59464514,0.0003485597,0.0009036834],"about_ca_topic_score_codex":0.000018784382,"about_ca_topic_score_gemma":0.0000016223196,"teacher_disagreement_score":0.52899736,"about_ca_system_score_codex":0.000029518953,"about_ca_system_score_gemma":0.00009043007,"threshold_uncertainty_score":0.47898656},"labels":[],"label_agreement":null},{"id":"W2159493595","doi":"10.1109/isqed.2004.1283711","title":"Stacked FSMD: a power efficient micro-architecture for high level synthesis","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datapath; Computer science; Overhead (engineering); Architecture; Abstraction; Simple (philosophy); High-level synthesis; Computer architecture; Controller (irrigation); Metric (unit); Finite-state machine; Embedded system; State (computer science); Range (aeronautics); Computer engineering; Distributed computing; Programming language; Engineering; Field-programmable gate array","score_opus":0.017826989576647797,"score_gpt":0.24819407097803659,"score_spread":0.23036708140138878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159493595","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097632,0.000027834352,0.98504627,0.002590704,0.00013731323,0.00031163415,0.00000773517,0.0011686863,0.0009466258],"genre_scores_gemma":[0.39052302,0.0000016679437,0.6088582,0.00042619611,0.00001555145,0.000030331275,0.0000012047891,0.000008378345,0.00013542904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889296,0.000029039224,0.00020429,0.0003946781,0.00017525398,0.0003037679],"domain_scores_gemma":[0.99912524,0.00014939334,0.00006852551,0.0004649567,0.000114590446,0.00007729817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022660951,0.0001560237,0.00016422107,0.00013924344,0.0001624078,0.00013286556,0.00072752475,0.0000743374,0.00001218266],"category_scores_gemma":[0.000074078285,0.00012787514,0.0000874168,0.00026825868,0.00002562976,0.000060409708,0.00016502017,0.0000793137,0.000021223326],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004131833,0.0007642869,0.000020740714,0.000055395205,0.000093668816,0.000013245299,0.0026611257,0.44754082,0.0047985883,0.51430017,0.009032689,0.020677967],"study_design_scores_gemma":[0.003178358,0.0007703449,0.0012335824,0.00020906964,0.000042188985,0.00008437221,0.00006269109,0.17266987,0.72724134,0.07640263,0.01618054,0.0019250186],"about_ca_topic_score_codex":0.00003233269,"about_ca_topic_score_gemma":0.0000030913832,"teacher_disagreement_score":0.72244275,"about_ca_system_score_codex":0.000068247384,"about_ca_system_score_gemma":0.000092075556,"threshold_uncertainty_score":0.5214597},"labels":[],"label_agreement":null},{"id":"W2159681195","doi":"10.1109/icci.1992.227678","title":"Revisiting parallel speedup complexity","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computation; Computer science; Parallel computing; Automated theorem proving; Parallel algorithm; Theoretical computer science; Algorithm","score_opus":0.05028716493988472,"score_gpt":0.2884030979953407,"score_spread":0.23811593305545597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159681195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027826583,0.00005543332,0.81312525,0.0004654002,0.00006687764,0.000058223257,1.00031386e-7,0.00076551666,0.18518496],"genre_scores_gemma":[0.17473386,0.000010835276,0.8234772,0.0006283906,0.000025169418,0.0000021993562,7.2288367e-7,0.0000043003456,0.0011172903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909186,0.000100552665,0.00018503115,0.00026276062,0.00014453818,0.00021526296],"domain_scores_gemma":[0.99934745,0.00004920274,0.00006072113,0.0004065797,0.00006609065,0.000069951646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039279566,0.00009617539,0.000118351745,0.000057228674,0.00014519789,0.0001396445,0.00046980954,0.000033419663,0.000077236466],"category_scores_gemma":[0.00008081696,0.0000871184,0.00004774195,0.00027710307,0.000030370495,0.00020524143,0.00009376967,0.000083310835,0.00009076612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.3763018e-7,0.000012416751,0.00042461077,0.000003328272,0.0000029734708,0.0000027177443,0.000041698593,0.0010357867,0.000016704098,0.9920342,0.0026564873,0.0037687535],"study_design_scores_gemma":[0.00063138985,0.00007253083,0.0026198789,0.000052869305,0.0000050410367,0.0001146011,0.00003311523,0.7042036,0.004765258,0.20272388,0.08394989,0.0008279384],"about_ca_topic_score_codex":0.000009837344,"about_ca_topic_score_gemma":4.7122865e-7,"teacher_disagreement_score":0.78931034,"about_ca_system_score_codex":0.000017914344,"about_ca_system_score_gemma":0.000029685307,"threshold_uncertainty_score":0.35525852},"labels":[],"label_agreement":null},{"id":"W2159844683","doi":"10.1145/2133352.2133358","title":"Portable and scalable FPGA-based acceleration of a direct linear system solver","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stratix; Field-programmable gate array; Scalability; Embedded system; Software; FPGA prototype; Parallel computing; Computer hardware; Operating system","score_opus":0.021836365035082062,"score_gpt":0.2458732791999477,"score_spread":0.22403691416486562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159844683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025580728,0.0013909121,0.9682059,0.0003029483,0.00033438453,0.00034240657,0.000007820376,0.00096506113,0.0028698237],"genre_scores_gemma":[0.97416747,0.00007399784,0.025124934,0.000027600969,0.000014765389,0.000072934505,0.0000019894997,0.000010498628,0.00050580077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988587,0.00007873564,0.00036376354,0.00029732627,0.00011947338,0.00028200884],"domain_scores_gemma":[0.9989094,0.00012604619,0.0001691068,0.00060976413,0.00010975973,0.00007592386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195037,0.0001594916,0.00032438536,0.00055114675,0.0002790147,0.00005639689,0.00033085523,0.00026442946,0.000006700865],"category_scores_gemma":[0.000025381689,0.00014706909,0.000037003996,0.0005699214,0.000086692686,0.00035620786,0.000008850305,0.00018747765,0.0000064057126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036936806,0.0032181013,0.027453063,0.005668725,0.001300282,0.000044395994,0.0023393794,0.19881879,0.034925453,0.27843916,0.0032778578,0.4441454],"study_design_scores_gemma":[0.0011045109,0.00053784525,0.00034967548,0.0006383481,0.00006990967,0.00023956661,0.0004902672,0.7149149,0.27715063,0.00043215093,0.00343401,0.0006381438],"about_ca_topic_score_codex":0.000087280074,"about_ca_topic_score_gemma":0.0000024290619,"teacher_disagreement_score":0.94858676,"about_ca_system_score_codex":0.000032031898,"about_ca_system_score_gemma":0.000040107134,"threshold_uncertainty_score":0.5997303},"labels":[],"label_agreement":null},{"id":"W2160167197","doi":"10.48550/arxiv.1002.4392","title":"Complete Context Calculus Design and Implementation in GIPSY","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Context (archaeology); Computer science; Calculus (dental); Java; Programming language; Medicine","score_opus":0.05651109504330517,"score_gpt":0.21617790080083626,"score_spread":0.1596668057575311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160167197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13352154,0.000008135403,0.8657438,0.000083779065,0.00006024024,0.00012737351,7.8731705e-7,0.00013555343,0.0003187447],"genre_scores_gemma":[0.96236706,0.0000151033155,0.0374143,0.0001223807,0.000007797443,4.255018e-7,0.0000017813261,0.000003496617,0.00006764763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993541,0.000074702075,0.00009343172,0.00029439203,0.00003124884,0.00015210798],"domain_scores_gemma":[0.99954504,0.00007252875,0.000054058135,0.00022429379,0.0000435599,0.000060504688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022534464,0.00007913856,0.00008770306,0.00013309365,0.00008680437,0.000048704984,0.00032507585,0.000042813568,0.000012995192],"category_scores_gemma":[0.000010013911,0.00009048925,0.000019157478,0.00033685748,0.00004267201,0.00029091598,0.00012989122,0.00012137729,0.000009952776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020653979,0.000058235,0.011057978,0.000007711187,0.000012347141,0.00009146361,0.0007266805,0.038564254,0.001787763,0.93307436,0.0007166107,0.013881918],"study_design_scores_gemma":[0.00055234955,0.000046533867,0.0036284032,0.0000047384788,0.0000029209057,0.000006276023,0.000055497178,0.9867466,0.00061180367,0.0074384487,0.0007672514,0.00013914473],"about_ca_topic_score_codex":0.0001345139,"about_ca_topic_score_gemma":0.0001358527,"teacher_disagreement_score":0.9481824,"about_ca_system_score_codex":0.000022042548,"about_ca_system_score_gemma":0.000029163875,"threshold_uncertainty_score":0.36900446},"labels":[],"label_agreement":null},{"id":"W2160289368","doi":"10.1109/apccas.2006.342526","title":"Bit-Serial Digital Filter Implementation using a Custom C Compiler","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Compiler; VHDL; Parallel computing; Compiler construction; Compiler correctness; Implicit parallelism; Computer hardware; Data parallelism; Computer architecture; Parallelism (grammar); Field-programmable gate array; Programming language","score_opus":0.020794801732392478,"score_gpt":0.287148270100289,"score_spread":0.26635346836789653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160289368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030267252,0.0000063547495,0.9609348,0.00012762813,0.00015467271,0.000096958946,0.0000029868502,0.00056396687,0.00784536],"genre_scores_gemma":[0.6754726,4.4043983e-7,0.3239451,0.00014983505,0.00011686965,0.0000026275395,0.00001922162,0.0000055520663,0.00028773292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923426,0.000020807067,0.0002045378,0.00021396004,0.00014693334,0.00017950934],"domain_scores_gemma":[0.9996209,0.00001947153,0.000066091365,0.00020524794,0.000059101232,0.000029178369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007681258,0.000091302005,0.00008368971,0.000087720466,0.00010364323,0.00043233088,0.0002857873,0.000030957173,0.000059008307],"category_scores_gemma":[0.0000025760532,0.00008327867,0.00004023906,0.00020777943,0.0000165344,0.00062194554,0.00014545205,0.000039571463,0.000027132635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040905532,0.00063166604,0.031507086,0.00003483831,0.00007105269,0.000042567528,0.0008964228,0.16717309,0.009718747,0.40078664,0.27014536,0.118951626],"study_design_scores_gemma":[0.0006217329,0.000061270075,0.00208927,0.000009109562,0.000003965388,0.000022261669,0.000019239968,0.9701608,0.010881378,0.0058916803,0.009890829,0.00034851008],"about_ca_topic_score_codex":0.0001571641,"about_ca_topic_score_gemma":0.00000813367,"teacher_disagreement_score":0.80298764,"about_ca_system_score_codex":0.000031829393,"about_ca_system_score_gemma":0.00003134379,"threshold_uncertainty_score":0.41689765},"labels":[],"label_agreement":null},{"id":"W2160428323","doi":"10.1109/micro.2007.30","title":"Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":727,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; SIMD; Parallel computing; Control flow; Instruction set; Overhead (engineering); Scheduling (production processes); Graphics; Computer architecture; Embedded system; Operating system; Programming language","score_opus":0.00861684684107671,"score_gpt":0.25525513770586433,"score_spread":0.2466382908647876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160428323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053651,0.00007227235,0.99282634,0.0003426,0.000085510816,0.00023905619,6.3124094e-7,0.0004391553,0.0006293186],"genre_scores_gemma":[0.48408154,0.000002758675,0.51569396,0.0001739053,0.000006739163,0.0000037970465,0.0000012731186,0.0000021644898,0.000033853477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993921,0.000011127255,0.00017173013,0.00015775942,0.00008985672,0.00017742795],"domain_scores_gemma":[0.9995568,0.000116403215,0.00005252056,0.00014221911,0.000084336876,0.000047718153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006039584,0.0000681443,0.000080095306,0.000092549315,0.00013086286,0.0000877322,0.000169864,0.000038182636,9.2757654e-7],"category_scores_gemma":[0.00003652702,0.00005939133,0.000026865091,0.000112649206,0.0000126922005,0.00014851555,0.000043244494,0.000038332666,0.0000026097932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030254621,0.00006973612,0.00007140617,0.000045206027,0.000013474014,0.0000017297502,0.0007528592,0.70822936,0.0009105456,0.057136856,0.0003600056,0.23237854],"study_design_scores_gemma":[0.00040250542,0.000042226617,0.00012772765,0.0000090936655,0.000001942074,0.000006108875,0.00001025525,0.99688286,0.0013475461,0.00081698224,0.00027047825,0.00008225004],"about_ca_topic_score_codex":0.0000019154354,"about_ca_topic_score_gemma":0.000002387539,"teacher_disagreement_score":0.47871643,"about_ca_system_score_codex":0.000025821228,"about_ca_system_score_gemma":0.000010931207,"threshold_uncertainty_score":0.24219081},"labels":[],"label_agreement":null},{"id":"W2160561117","doi":"10.1109/saci.2011.5873058","title":"Custom instruction hardware integration within a SoC hybrid environment","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Datapath; Computer science; Coprocessor; Dataflow; Computer architecture; Heuristics; Embedded system; Kernel (algebra); System on a chip; Instruction set; Preprocessor; Software; Field-programmable gate array; Parallel computing; Programming language; Operating system","score_opus":0.024148295868289336,"score_gpt":0.21735155496934278,"score_spread":0.19320325910105343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160561117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062690657,0.0000108279055,0.97981703,0.00007992828,0.00018286843,0.00009424217,3.772048e-7,0.00068931456,0.012856336],"genre_scores_gemma":[0.5106342,0.000009775919,0.48878458,0.00012040415,0.000016287222,0.000008163626,0.0000025821862,0.00000389604,0.00042008556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992609,0.000041983032,0.00018400647,0.00025469708,0.00014284214,0.000115593684],"domain_scores_gemma":[0.9995097,0.0000068827676,0.00008592437,0.00031997505,0.000030001363,0.00004752204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015860547,0.000095832205,0.00007820075,0.00008484001,0.00009778564,0.000059420538,0.00034925865,0.000033526998,0.00007413249],"category_scores_gemma":[0.000009839003,0.000082065584,0.000035122146,0.00009370358,0.000026747492,0.00039715957,0.00011823434,0.00008787228,0.00008932889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002998831,0.0003535836,0.0013834875,0.000016276415,0.000046942496,0.000024277739,0.009806455,0.0063714087,0.0011390874,0.4775061,0.012647804,0.4906746],"study_design_scores_gemma":[0.0003577594,0.00018826095,0.0014994811,0.000025043291,0.0000063017314,0.000065793916,0.00009115329,0.79468286,0.18025245,0.020173134,0.0022768697,0.0003808731],"about_ca_topic_score_codex":0.000046935584,"about_ca_topic_score_gemma":0.0000018523173,"teacher_disagreement_score":0.7883115,"about_ca_system_score_codex":0.000044017142,"about_ca_system_score_gemma":0.000021186575,"threshold_uncertainty_score":0.33465374},"labels":[],"label_agreement":null},{"id":"W2160570867","doi":"10.1109/hicss.1995.375459","title":"Using the Parsec environment to implement a high-performance processor farm","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Parsec; Computer science; Scalability; Set (abstract data type); Context (archaeology); Abstraction; Reuse; Task (project management); Implementation; Computer architecture; Parallel computing; Distributed computing; Programming language; Operating system","score_opus":0.049672207517659696,"score_gpt":0.2651634283244029,"score_spread":0.21549122080674318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160570867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038749684,0.000033185945,0.95765716,0.0014854932,0.000050106955,0.00022792829,3.6715147e-7,0.00024974602,0.0015463191],"genre_scores_gemma":[0.7095725,0.00002877925,0.28895426,0.0010132787,0.000023843755,0.000021527165,2.3017498e-7,0.0000042954352,0.00038131134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991165,0.0000256176,0.0001696033,0.00024250602,0.0002130143,0.00023276928],"domain_scores_gemma":[0.99944687,0.000017318298,0.000048940896,0.00041235372,0.000020503823,0.000054034623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017719895,0.000098705765,0.00007739119,0.000046049263,0.00021473931,0.000102664875,0.0006570206,0.000019425483,0.000072177216],"category_scores_gemma":[0.0000044868484,0.00006499544,0.00001913668,0.0002018661,0.00001217345,0.00010766987,0.00029505996,0.000056470715,0.00006130387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052636437,0.00026994944,0.0011940218,0.000026524636,0.000035158668,0.0000051086117,0.003707873,0.7014763,0.0010508122,0.038557164,0.008674303,0.24499753],"study_design_scores_gemma":[0.00008874653,0.000071576564,0.000271815,0.0000076035244,0.0000020946065,0.0000056405647,0.000010495243,0.97812474,0.00980205,0.000116620395,0.011368917,0.00012971163],"about_ca_topic_score_codex":0.000025423195,"about_ca_topic_score_gemma":0.0000014677768,"teacher_disagreement_score":0.6708228,"about_ca_system_score_codex":0.000049656464,"about_ca_system_score_gemma":0.00000810739,"threshold_uncertainty_score":0.2650437},"labels":[],"label_agreement":null},{"id":"W2160943330","doi":"10.1145/2212736.2212740","title":"Using the Cowichan problems to investigate the programmability of X10 programming system","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Flexibility (engineering); Programming language; Programming paradigm; Programming domain; Reactive programming; Inductive programming; Functional reactive programming; Object-oriented programming; Functional logic programming; Set (abstract data type); Parallel computing","score_opus":0.10505820855823242,"score_gpt":0.2814795314247336,"score_spread":0.17642132286650117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160943330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015206317,0.000025486139,0.98095423,0.0003391175,0.00008694978,0.0010338194,2.126306e-7,0.00066000264,0.0016938879],"genre_scores_gemma":[0.56074417,2.7009807e-7,0.4390992,0.000076151264,0.000010143899,0.00004025878,1.2662478e-7,0.0000043153627,0.00002537668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875724,0.00018743538,0.00031883147,0.0002674347,0.00022032665,0.0002487071],"domain_scores_gemma":[0.99874014,0.00005102391,0.00015063482,0.00079601986,0.0001888437,0.000073354866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252333,0.000115895244,0.00013691804,0.000047906397,0.00022979389,0.00011347564,0.001261532,0.000037784757,0.000001436236],"category_scores_gemma":[0.000047731268,0.000058454076,0.00005676399,0.0006783606,0.00013640431,0.00012877554,0.00040599486,0.00009967272,0.0000027927372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025266598,0.00052755413,0.015996441,0.00063636765,0.0001447262,0.000006194966,0.054914765,0.028081521,0.0016336683,0.7304979,0.0007011124,0.1668345],"study_design_scores_gemma":[0.00015841029,0.00031556786,0.00095609005,0.00021329548,0.00002077031,0.00003901562,0.00064191123,0.9650201,0.026425414,0.0039083706,0.001964555,0.00033649002],"about_ca_topic_score_codex":0.0004902427,"about_ca_topic_score_gemma":0.000019664476,"teacher_disagreement_score":0.9369386,"about_ca_system_score_codex":0.0000312251,"about_ca_system_score_gemma":0.00006566385,"threshold_uncertainty_score":0.2383688},"labels":[],"label_agreement":null},{"id":"W2160955383","doi":"10.1145/1508244.1508281","title":"Phantom-BTB","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fetch; Concurrency; Parallel computing; Set (abstract data type); Instruction set; Chip; Computer architecture; Embedded system; Distributed computing; Programming language; Telecommunications","score_opus":0.013127832532885658,"score_gpt":0.2646129054398927,"score_spread":0.25148507290700706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160955383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020272424,0.000027157288,0.87924004,0.0014891175,0.00004053452,0.00002592113,2.45377e-8,0.0010793797,0.1178951],"genre_scores_gemma":[0.4869865,0.0000071763034,0.5097,0.0018615827,0.000019346446,5.0345443e-7,2.3366881e-7,9.599993e-7,0.0014236792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995976,0.00001238583,0.000072776464,0.00013151452,0.00008129081,0.000104437764],"domain_scores_gemma":[0.9996781,0.000010353971,0.000018015657,0.00023094268,0.000028139872,0.00003448902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008378175,0.000044659762,0.000047219895,0.000045656052,0.000045028457,0.00007215731,0.00041032373,0.000019256227,0.000013427897],"category_scores_gemma":[0.000007948012,0.000037415364,0.000020659807,0.00017928709,0.000004793166,0.00016401516,0.000036194346,0.000031731448,0.0000513696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0155413e-7,0.00005897198,0.00005511694,7.536057e-7,0.0000022411098,0.0000059986387,0.00013038245,0.0009926065,0.00035552084,0.7122874,0.042023998,0.24408609],"study_design_scores_gemma":[0.0002129769,0.00017404158,0.0018107468,0.000008431321,0.0000011076311,0.000021136682,0.000002336487,0.88306266,0.020301837,0.07032986,0.023811605,0.000263281],"about_ca_topic_score_codex":0.0000020312734,"about_ca_topic_score_gemma":1.228947e-7,"teacher_disagreement_score":0.88207,"about_ca_system_score_codex":0.000006297858,"about_ca_system_score_gemma":0.00001104396,"threshold_uncertainty_score":0.15257543},"labels":[],"label_agreement":null},{"id":"W2161210471","doi":"10.1109/ipdps.2001.924989","title":"Asynchronous MPI messaging on Myrinet","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Myrinet; Computer science; Message passing; Asynchronous communication; Message Passing Interface; Parallel computing; Scheduling (production processes); Operating system; Distributed computing; Computer network","score_opus":0.021213393224756988,"score_gpt":0.23857134689412193,"score_spread":0.21735795366936494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161210471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026596955,0.000035597794,0.6983031,0.0008898052,0.00005462907,0.000035017918,7.072297e-8,0.00092333375,0.29949245],"genre_scores_gemma":[0.70418006,0.000022492952,0.2915179,0.0012120322,0.000027970045,0.0000036620659,3.6219464e-7,0.0000051893876,0.0030303427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993216,0.000027698197,0.000110514455,0.00022911475,0.00014047252,0.00017063237],"domain_scores_gemma":[0.9994772,0.000039861123,0.00003229496,0.00037561657,0.000025700498,0.000049348735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009773538,0.00008324177,0.00007774688,0.00008379302,0.000089174486,0.000105445164,0.00048481103,0.000027775215,0.00015280698],"category_scores_gemma":[0.000013037821,0.00007202835,0.000029684437,0.00019911908,0.000012024233,0.00013895569,0.000108881075,0.00007397673,0.0002905853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017481616,0.0002503086,0.0004904657,0.0000092011605,0.000018573286,0.00003386502,0.0005281095,0.03156789,0.00008926248,0.6391614,0.15320331,0.17464584],"study_design_scores_gemma":[0.00012893502,0.000073229225,0.00017060037,0.000010890764,7.7650753e-7,0.000009522677,0.0000018961994,0.98274153,0.002287337,0.0016099528,0.012814654,0.00015069841],"about_ca_topic_score_codex":0.0000063182397,"about_ca_topic_score_gemma":3.9755577e-7,"teacher_disagreement_score":0.9511736,"about_ca_system_score_codex":0.000021054164,"about_ca_system_score_gemma":0.0000046334117,"threshold_uncertainty_score":0.3734983},"labels":[],"label_agreement":null},{"id":"W2161252043","doi":"10.1109/glsv.1996.497586","title":"A global mode instruction minimization technique for embedded DSPs","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Instruction set; Addressing mode; Schedule; Minification; Block (permutation group theory); Parallel computing; Mode (computer interface); Set (abstract data type); Cover (algebra); Extension (predicate logic); Register allocation; Arithmetic; Instructions per cycle; Computer hardware; Compiler; Programming language; Mathematics; Central processing unit; Operating system","score_opus":0.020389801499176463,"score_gpt":0.273932354675008,"score_spread":0.2535425531758315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161252043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012932689,0.000020302617,0.98442346,0.0005507002,0.00012896606,0.00038822857,0.0000024061615,0.0011170775,0.013239523],"genre_scores_gemma":[0.1649807,0.00001975401,0.8340553,0.00039395175,0.000025015648,0.00009745031,0.0000051220713,0.0000053214894,0.00041736494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.000041015654,0.00018847232,0.00027739882,0.00011857245,0.00015859875],"domain_scores_gemma":[0.9994376,0.0000298369,0.0000754005,0.00029098094,0.00012126804,0.000044925062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011702108,0.00010209256,0.00009872759,0.0000760961,0.000101642196,0.00010699064,0.00035504287,0.000079056765,0.000014497673],"category_scores_gemma":[0.000050002272,0.00009860061,0.000052092866,0.00040455692,0.000015263267,0.00038954304,0.00007524626,0.000036281603,0.0000060842845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012873157,0.0002134828,0.00020697062,0.000031948493,0.00002154706,0.0000016708403,0.00052317715,0.090494655,0.0005172619,0.74244213,0.052545454,0.112988815],"study_design_scores_gemma":[0.00025364608,0.000060536797,0.000029768473,0.00000939519,0.0000020070263,0.000021155716,0.000003842778,0.976616,0.0039032453,0.016814642,0.0021500932,0.00013566627],"about_ca_topic_score_codex":0.000011359306,"about_ca_topic_score_gemma":0.0000037969332,"teacher_disagreement_score":0.88612133,"about_ca_system_score_codex":0.00005028225,"about_ca_system_score_gemma":0.000015844127,"threshold_uncertainty_score":0.40208164},"labels":[],"label_agreement":null},{"id":"W2161740129","doi":"10.1109/dsd.2002.1115347","title":"Hardware architecture for Java in a hardware/software co-design of the virtual machine","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Virtual machine; Architecture; Hardware architecture; Benchmark (surveying); Embedded Java; Operating system; Computer architecture; strictfp; Software; Embedded system; Java concurrency; Real time Java","score_opus":0.01977855431164506,"score_gpt":0.25926971854312936,"score_spread":0.2394911642314843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161740129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002015962,0.00007407624,0.9975095,0.00034261658,0.000098234,0.00049424235,0.00000780286,0.00025858835,0.0010133542],"genre_scores_gemma":[0.17053196,0.0000069371413,0.8276092,0.0005711352,0.000011777727,0.000040501334,0.0000029622706,0.000013236395,0.0012123246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882305,0.00020308698,0.0002681777,0.0002916308,0.00019349919,0.00022056536],"domain_scores_gemma":[0.9989688,0.0002781934,0.000104351115,0.0005224711,0.000085987806,0.000040242503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047225202,0.00014056012,0.00018985399,0.000115310475,0.000094680654,0.000046342084,0.0008677709,0.0000703407,0.000015599184],"category_scores_gemma":[0.00034688105,0.00009508072,0.00009013725,0.0003887328,0.000043171796,0.000086763925,0.00009822249,0.00013896388,0.0000022480688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064910666,0.0003645166,0.0046684803,0.000086583845,0.000048837726,0.0000061513365,0.0025569925,0.76215136,0.00075989286,0.1453343,0.039141484,0.044816475],"study_design_scores_gemma":[0.0030032096,0.00091191404,0.0017029198,0.0002637656,0.000017220065,0.00006599225,0.00006429779,0.7877308,0.114657424,0.043606855,0.046912145,0.0010634577],"about_ca_topic_score_codex":0.000017692899,"about_ca_topic_score_gemma":0.000008826307,"teacher_disagreement_score":0.17033036,"about_ca_system_score_codex":0.000026038368,"about_ca_system_score_gemma":0.00010761884,"threshold_uncertainty_score":0.38772795},"labels":[],"label_agreement":null},{"id":"W2161762085","doi":"10.1109/ccece.2007.422","title":"A Comparison of Profiling Tools for FPGA-Based Embedded Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Field-programmable gate array; Computer science; Profiling (computer programming); Embedded system; Software; Embedded software; Computer hardware; Nios II; Computer architecture; Operating system","score_opus":0.07064793768924334,"score_gpt":0.3652438867604236,"score_spread":0.29459594907118025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161762085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018947351,0.0000706259,0.99044234,0.00003135786,0.00012643384,0.00042005113,7.5048865e-7,0.00050877454,0.0065049315],"genre_scores_gemma":[0.53052104,1.9018556e-7,0.46934688,0.000036835074,0.00001564054,0.000009259927,0.0000026769262,0.0000032860667,0.00006417873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990141,0.00003110079,0.00039517335,0.00019914523,0.00016252673,0.00019794588],"domain_scores_gemma":[0.9987849,0.00048165486,0.00016898816,0.00030853192,0.00020955426,0.000046367277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009709206,0.00008406432,0.00020688814,0.00011573695,0.000060882307,0.00010609899,0.0004426106,0.000055206438,0.0000011278258],"category_scores_gemma":[0.00012133746,0.0000741849,0.000059147394,0.00024151168,0.000017124257,0.00016496495,0.00004629225,0.000046651232,0.0000016767902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007541256,0.00050103315,0.0032931224,0.00039819343,0.0000397201,0.0000024134197,0.0006571241,0.38673738,0.006336072,0.5421548,0.007888692,0.051916037],"study_design_scores_gemma":[0.00017931013,0.00008751384,0.00002725152,0.000024330766,0.0000018824035,5.6018945e-7,0.000040355906,0.7940813,0.20480378,0.00018631421,0.00048654102,0.00008088346],"about_ca_topic_score_codex":0.000009296386,"about_ca_topic_score_gemma":0.0000010122224,"teacher_disagreement_score":0.5419685,"about_ca_system_score_codex":0.000019644242,"about_ca_system_score_gemma":0.00005164894,"threshold_uncertainty_score":0.30251724},"labels":[],"label_agreement":null},{"id":"W2161884282","doi":"10.1109/icpp.2004.42","title":"Low-cost register-pressure prediction for scalar replacement using pseudo-schedules","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Register allocation; Computer science; Speedup; Parallel computing; Software pipelining; Schedule; Software; Scalar (mathematics); Register (sociolinguistics); Control flow graph; Algorithm; Suite; Mathematics; Theoretical computer science; Operating system","score_opus":0.028091114423260084,"score_gpt":0.28280684515084753,"score_spread":0.25471573072758746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161884282","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028116864,0.000044415905,0.994198,0.0005239513,0.00024146857,0.00049012864,0.000004548263,0.00084815314,0.0008376164],"genre_scores_gemma":[0.18801455,0.000011413749,0.81124455,0.00031157513,0.00007826495,0.00003532399,0.000007378141,0.000010047347,0.00028692943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988877,0.000026973203,0.00025777685,0.00040380497,0.00019158104,0.00023212619],"domain_scores_gemma":[0.9991125,0.000026863778,0.00010944342,0.0005421573,0.00013897897,0.000070083894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033218646,0.00012770251,0.00012838833,0.00009172053,0.00021551899,0.00016667845,0.0004477073,0.00007913696,0.0000046134674],"category_scores_gemma":[0.000041945306,0.000118611846,0.00006871087,0.00019027661,0.000026156507,0.00035327792,0.00014720556,0.00007022135,0.000004537237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040001447,0.00021099034,0.00049578544,0.00008706123,0.000048210208,0.000002416829,0.00027705132,0.8570243,0.0010695559,0.13108581,0.0029960673,0.0066627436],"study_design_scores_gemma":[0.0006410644,0.0000989538,0.00011601434,0.00008138112,0.000012443709,0.000012842361,0.000010034802,0.9662612,0.023540234,0.0056797103,0.0033780357,0.00016806064],"about_ca_topic_score_codex":0.000025263758,"about_ca_topic_score_gemma":0.000002530381,"teacher_disagreement_score":0.18520287,"about_ca_system_score_codex":0.000065611,"about_ca_system_score_gemma":0.00006895809,"threshold_uncertainty_score":0.48368508},"labels":[],"label_agreement":null},{"id":"W2161884835","doi":"10.1109/ispa.2008.128","title":"Energy Optimal Scheduling on Multiprocessors with Migration","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multiprocessor scheduling; Multiprocessing; Parallel computing; Scheduling (production processes); Schedule; Time complexity; Job shop scheduling; Regular polygon; Mathematical optimization; Algorithm; Flow shop scheduling; Mathematics; Operating system","score_opus":0.017183747792445442,"score_gpt":0.23179462836520945,"score_spread":0.214610880572764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161884835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03726479,0.000016563761,0.95698375,0.00033603038,0.000025427422,0.000030169887,7.308646e-8,0.00073738856,0.0046057985],"genre_scores_gemma":[0.52416855,0.000016115662,0.47503158,0.0003000124,0.000014931724,0.0000043918803,0.0000010154383,0.000003474039,0.00045992204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993194,0.000019656656,0.00010437423,0.00024449354,0.00017605103,0.00013604024],"domain_scores_gemma":[0.9995692,0.000030472605,0.000047944148,0.00022216083,0.00008361816,0.000046628757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005633129,0.000092252274,0.0000768097,0.00009204214,0.00016811275,0.000046056135,0.000296521,0.000034939796,0.0000040058967],"category_scores_gemma":[0.000009100438,0.00006911276,0.000019818113,0.0002681459,0.000024667486,0.0002350865,0.00004033969,0.000054299635,0.00000991485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023603203,0.0001260002,0.00084082584,0.0000037431846,0.000011876842,0.00002600788,0.00067074643,0.9335297,0.00015436599,0.05265537,0.0014422938,0.010515473],"study_design_scores_gemma":[0.00015628373,0.0001514123,0.00014287102,0.000011736245,6.633237e-7,0.000026654554,0.00000542239,0.97848386,0.019924818,0.000074166965,0.00089752185,0.00012458637],"about_ca_topic_score_codex":0.00004451309,"about_ca_topic_score_gemma":0.0000065474696,"teacher_disagreement_score":0.48690376,"about_ca_system_score_codex":0.0000144764135,"about_ca_system_score_gemma":0.00004136009,"threshold_uncertainty_score":0.28183362},"labels":[],"label_agreement":null},{"id":"W2162105624","doi":"10.1007/3-540-46419-0_32","title":"VIP: A Visual Editor and Compiler for v-Promela","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Promela; Programming language; Computer science; Validator; Model checking; Compiler","score_opus":0.012330673812065152,"score_gpt":0.26516929688204544,"score_spread":0.2528386230699803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162105624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002817377,0.00036176326,0.9936519,0.000491132,0.0023108097,0.00057957,0.0000069787357,0.00042585548,0.0021438138],"genre_scores_gemma":[0.016781777,0.000136826,0.9782451,0.0014766515,0.002771382,0.000030261408,0.000010231832,0.00004621981,0.000501567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690294,0.000027396552,0.00046705024,0.0014404897,0.0005868592,0.00057529024],"domain_scores_gemma":[0.9981539,0.0004876257,0.00021330183,0.00075043965,0.00021784303,0.00017687162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064313883,0.00048108163,0.00052556046,0.00069673115,0.00033065825,0.0006229621,0.001892032,0.00034724324,0.000015632017],"category_scores_gemma":[0.000050036382,0.00045212518,0.00011049299,0.00035203138,0.0005272709,0.0004102938,0.00077062834,0.00048759748,0.000014701788],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001924696,0.000055179364,0.000019905952,0.00006411513,0.000017129338,0.000020097585,0.00048235967,0.024922447,0.000056205132,0.017212167,0.0010930105,0.9560381],"study_design_scores_gemma":[0.0003096575,0.00032115987,0.00003711125,0.0002388686,0.0000062419285,0.000037926664,4.4485777e-8,0.8545571,0.0004124451,0.12632482,0.017145941,0.0006086829],"about_ca_topic_score_codex":0.0000074780564,"about_ca_topic_score_gemma":0.000005246158,"teacher_disagreement_score":0.95542943,"about_ca_system_score_codex":0.0001209073,"about_ca_system_score_gemma":0.00030545538,"threshold_uncertainty_score":0.99979305},"labels":[],"label_agreement":null},{"id":"W2162451809","doi":"10.1109/hpcs.2008.11","title":"Exploiting Data Locality in FFT Using Indirect Swap Network on Cell/B.E.","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings (International Symposium on High Performance Computing Systems and Applications)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Parallel computing; Locality; Fast Fourier transform; SIMD; Synchronization (alternating current); Algorithm; Computer network","score_opus":0.037872046487895,"score_gpt":0.2649540092825864,"score_spread":0.2270819627946914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162451809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88648045,0.00017443541,0.10032349,0.00045972422,0.0005472095,0.0010480278,0.000010041383,0.00091674365,0.010039863],"genre_scores_gemma":[0.9703264,0.00029520836,0.027764812,0.00027798343,0.0010858785,0.000099868215,0.000025051826,0.00004039839,0.000084384774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996342,0.00001618847,0.00091503083,0.0013633032,0.0007598265,0.0006036564],"domain_scores_gemma":[0.99818015,0.000116076546,0.00068904966,0.00037765905,0.00047859232,0.00015849911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012988391,0.00043026477,0.00045963918,0.00034435082,0.00094543444,0.00058435363,0.0020590853,0.00017253734,0.0000014810081],"category_scores_gemma":[0.000035030193,0.00043951202,0.000047565998,0.0009861155,0.00009780587,0.0011037061,0.0008893029,0.00048695068,0.00001677506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002279185,0.0015802833,0.36639893,0.0015526557,0.00020617933,0.000018669649,0.0040241242,0.3952621,0.0067864545,0.20185027,0.008988756,0.013103684],"study_design_scores_gemma":[0.00054314936,0.000117459254,0.0043482385,0.00061140297,0.000008011622,0.000118726646,0.00008095891,0.98908496,0.001272829,0.00014231006,0.0031605384,0.0005113949],"about_ca_topic_score_codex":0.00008002162,"about_ca_topic_score_gemma":3.29397e-7,"teacher_disagreement_score":0.5938229,"about_ca_system_score_codex":0.0002786329,"about_ca_system_score_gemma":0.000056898658,"threshold_uncertainty_score":0.9998057},"labels":[],"label_agreement":null},{"id":"W2162727661","doi":"10.1016/j.scico.2005.03.008","title":"A selective dynamic compiler for embedded Java virtual machines targeting ARM processors","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Porting; Compiler; Operating system; Just-in-time compilation; Java; Embedded system; Embedded Java; Virtual machine; Memory footprint; strictfp; Real time Java; Software","score_opus":0.009300400936536063,"score_gpt":0.28451684635323987,"score_spread":0.2752164454167038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162727661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020731715,0.00005646129,0.9769029,0.00056793744,0.00025035944,0.0006075388,0.0000013361213,0.00066650636,0.0002152136],"genre_scores_gemma":[0.47592902,0.0000028439283,0.52384347,0.00010913075,0.00005236123,0.000031052536,0.0000024368292,0.000008582677,0.000021120255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752253,0.000065055276,0.0005039103,0.0007424939,0.0005468444,0.00061917753],"domain_scores_gemma":[0.9982559,0.00016224971,0.00035702964,0.0003704858,0.000722677,0.00013167114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017064047,0.0002379542,0.00030463815,0.00042017477,0.0004445444,0.00042367322,0.0017588373,0.000051407704,0.0000011998737],"category_scores_gemma":[0.00011500791,0.00021899345,0.00011227755,0.0015739946,0.0003293401,0.0015096943,0.00048046088,0.00017149272,0.000003221302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016854723,0.00034360948,0.00010601978,0.00005778449,0.000019295205,7.9395454e-7,0.0042106537,0.10776692,0.0018385142,0.022007715,0.00031732518,0.8633145],"study_design_scores_gemma":[0.00031982924,0.00042628252,0.00017482604,0.0000660426,0.0000039827605,0.000008355043,0.000028457218,0.9894518,0.007238078,0.0011069498,0.00090123643,0.00027410896],"about_ca_topic_score_codex":0.000006889834,"about_ca_topic_score_gemma":0.0000033667075,"teacher_disagreement_score":0.88168496,"about_ca_system_score_codex":0.000091105,"about_ca_system_score_gemma":0.0003204596,"threshold_uncertainty_score":0.89302933},"labels":[],"label_agreement":null},{"id":"W2162767333","doi":"10.1109/mc.2010.75","title":"Parallelism via Multithreaded and Multicore CPUs","year":2010,"lang":"en","type":"article","venue":"Computer","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Multithreading; Throughput; Parallelism (grammar); Task parallelism; Server; Data parallelism; Computer architecture; Operating system; Thread (computing)","score_opus":0.01038137558371473,"score_gpt":0.23961182449294988,"score_spread":0.22923044890923513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162767333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023516193,0.000044797023,0.973809,0.00056018616,0.00062218716,0.00012749806,3.8962315e-7,0.0007580269,0.00056174665],"genre_scores_gemma":[0.38258037,0.0000073459705,0.616619,0.00052789185,0.00014867951,0.000005890924,0.0000017174176,0.000007608283,0.00010148441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990113,0.000033310025,0.00018438253,0.00040120803,0.00013353169,0.00023631791],"domain_scores_gemma":[0.9991281,0.000077764846,0.00006496729,0.0005221143,0.00008159298,0.00012546098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015268438,0.00015452561,0.00015556638,0.000094223455,0.00013665076,0.00019519182,0.0006070707,0.00010225025,0.000008723251],"category_scores_gemma":[0.000013208939,0.00013898911,0.000042069427,0.00013913818,0.000070591544,0.0002450751,0.000417176,0.0002545251,0.000039210114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000102978975,0.00024530612,0.0045607006,0.000034711768,0.00004492317,0.00006796359,0.0020863768,0.002975452,0.004704642,0.052701857,0.018744169,0.9138236],"study_design_scores_gemma":[0.00033459996,0.00004039947,0.005934729,0.000008427887,0.0000022188142,0.00006375417,7.012261e-7,0.98325294,0.0009497731,0.0026735137,0.006526914,0.0002119972],"about_ca_topic_score_codex":0.000017094802,"about_ca_topic_score_gemma":0.0000050132066,"teacher_disagreement_score":0.98027754,"about_ca_system_score_codex":0.0000061564397,"about_ca_system_score_gemma":0.00001674748,"threshold_uncertainty_score":0.56678116},"labels":[],"label_agreement":null},{"id":"W2162970483","doi":"10.1145/2670979.2670984","title":"Exploiting iterative-ness for parallel ML computations","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Intel Corporation","keywords":"Computer science; Instruction prefetch; Parallel computing; Thread (computing); Cache; Computation; Cloud computing; Sequence (biology); Distributed computing; Iterative method; Algorithm; Theoretical computer science; Operating system","score_opus":0.02921258560803955,"score_gpt":0.28809785574399305,"score_spread":0.2588852701359535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162970483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037374065,0.000011999847,0.9878916,0.00091448135,0.00012494225,0.0001968326,6.923938e-7,0.0010339658,0.009451704],"genre_scores_gemma":[0.28690147,0.0000015540066,0.71186733,0.0006402102,0.000058264948,0.000047450165,0.000006216282,0.000006536882,0.00047099215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991089,0.000066886314,0.00021308515,0.0002943323,0.00011058047,0.00020619929],"domain_scores_gemma":[0.99908644,0.00032682385,0.00008006445,0.0002741448,0.00017241768,0.00006010529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003198577,0.00010779582,0.00013322821,0.00008847729,0.00027054764,0.00022967343,0.00048404883,0.00003735713,0.000005295028],"category_scores_gemma":[0.00008894203,0.00009832109,0.00005796718,0.00020002303,0.000021029486,0.00032175114,0.000110396155,0.000052286356,0.000016260634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002473707,0.00004630448,0.00011529801,0.000014923127,0.000009258865,3.3350966e-7,0.0006648495,0.087472774,0.00005024389,0.8707443,0.0066660848,0.034213196],"study_design_scores_gemma":[0.00025515925,0.00005880034,0.000118900025,0.000013980371,0.0000015861958,0.0000028284464,0.000012749539,0.96695024,0.00058453146,0.025836762,0.0060167154,0.00014775823],"about_ca_topic_score_codex":0.0000050821,"about_ca_topic_score_gemma":0.0000013585266,"teacher_disagreement_score":0.87947744,"about_ca_system_score_codex":0.000013511689,"about_ca_system_score_gemma":0.000021274052,"threshold_uncertainty_score":0.40094176},"labels":[],"label_agreement":null},{"id":"W2162973193","doi":"10.1109/5.964447","title":"Advances and future challenges in binary translation and optimization","year":2001,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University at Buffalo; McGill University","keywords":"Binary translation; Computer science; Interoperability; Emulation; Binary number; Software engineering; Software; Translation (biology); Convergence (economics); Distributed computing; Programming language; World Wide Web; Mathematics","score_opus":0.025506794992066168,"score_gpt":0.2474690850434445,"score_spread":0.22196229005137832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162973193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33066517,0.109067425,0.47440082,0.051815044,0.00089832826,0.0013740964,0.000001505167,0.00096523995,0.03081237],"genre_scores_gemma":[0.73045284,0.054697298,0.21469419,0.000051514577,0.000071995724,0.000007482627,1.3357455e-7,0.000005988756,0.000018559427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958444,0.0000052289784,0.00010562689,0.00014987231,0.000082877734,0.00007193835],"domain_scores_gemma":[0.99979866,0.000015445694,0.00007400522,0.00004743317,0.000048718448,0.000015754567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015113679,0.0000587621,0.00007496418,0.00006960989,0.00004793475,0.000029354467,0.00018603563,0.000037615304,3.1082484e-7],"category_scores_gemma":[0.000006963866,0.00004468073,0.000010827375,0.0002025494,0.000028057564,0.00046229604,0.000038431834,0.00005164407,4.519749e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045293207,0.00009890019,0.008101174,0.00033463328,0.000008551848,8.3586485e-7,0.0063968506,0.043648813,0.0012693906,0.014720559,0.00016681533,0.9252082],"study_design_scores_gemma":[0.00033751302,0.00008624341,0.0037509033,0.000115058065,0.0000041492744,0.000028078874,0.00017246793,0.98568636,0.0019348111,0.0050501064,0.002684561,0.00014973455],"about_ca_topic_score_codex":0.0000014748005,"about_ca_topic_score_gemma":8.6324985e-7,"teacher_disagreement_score":0.9420376,"about_ca_system_score_codex":0.000005319432,"about_ca_system_score_gemma":0.000004458678,"threshold_uncertainty_score":0.18220274},"labels":[],"label_agreement":null},{"id":"W2163229661","doi":"10.1145/583810.583830","title":"Run-time evaluation of opportunities for object inlining in Java","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Compiler; Just-in-time compilation; Programming language; Pointer (user interface); Object (grammar); Speedup; Object code; Benchmark (surveying); Parallel computing; Operating system; Key (lock)","score_opus":0.17544183458071427,"score_gpt":0.32281203971319994,"score_spread":0.14737020513248567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163229661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008405159,0.00008456669,0.95589966,0.00039107905,0.000048572656,0.00022980849,6.765818e-7,0.00019831705,0.03474218],"genre_scores_gemma":[0.6927726,0.00001959329,0.30597717,0.00012601554,0.000013679848,0.000023408427,0.0000023051755,0.0000040465643,0.0010611368],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992426,0.000079086276,0.00022395304,0.00013905884,0.00020997947,0.000105309075],"domain_scores_gemma":[0.99940145,0.00010685259,0.00008102734,0.00018805284,0.00020288445,0.000019722165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011028223,0.000057115423,0.0001060086,0.00016622081,0.00003133614,0.00002836783,0.00025816978,0.0000342213,0.000054331616],"category_scores_gemma":[0.000112235866,0.000054679465,0.000030010495,0.00017417337,0.00001474211,0.0001994352,0.000053622203,0.000030302615,0.000003997364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007432106,0.0002615241,0.0005916732,0.000042614232,0.000023666951,0.0000017687148,0.0036568616,0.09135744,0.00040176365,0.045500223,0.021736972,0.83641803],"study_design_scores_gemma":[0.0002477786,0.000053432792,0.00011655946,0.000019474292,0.0000026953833,8.012304e-7,0.000028571027,0.99521387,0.0018373039,0.0021659539,0.00024664938,0.00006694105],"about_ca_topic_score_codex":0.0000096758395,"about_ca_topic_score_gemma":0.0000018981181,"teacher_disagreement_score":0.9038564,"about_ca_system_score_codex":0.000023481301,"about_ca_system_score_gemma":0.000036281213,"threshold_uncertainty_score":0.22297639},"labels":[],"label_agreement":null},{"id":"W2163398904","doi":"10.1007/978-3-540-77560-7_18","title":"Turbo-ROB: A Low Cost Checkpoint/Restore Accelerator","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Out-of-order execution; Operating system; Speculative execution; Embedded system","score_opus":0.02375913372544606,"score_gpt":0.25653136486213735,"score_spread":0.2327722311366913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163398904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004439481,0.0005660832,0.99128467,0.0007620379,0.0014516955,0.00063444854,0.0000053919875,0.00093448244,0.0043167737],"genre_scores_gemma":[0.06992143,0.00037540452,0.92456335,0.0028871915,0.0008119858,0.000031371183,0.000014767987,0.00008324685,0.001311278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493325,0.00005576631,0.0007820772,0.0021025727,0.0012014266,0.0009248835],"domain_scores_gemma":[0.996368,0.00031003714,0.0004729609,0.0020747127,0.00045625723,0.0003180407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071590964,0.00079024414,0.0007498943,0.0011011746,0.00050462154,0.00074442,0.005297079,0.0005329056,0.000030195386],"category_scores_gemma":[0.00012568806,0.00075162644,0.00023275868,0.000893939,0.0008286368,0.0007481331,0.0018909444,0.0012119758,0.00010350382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015517682,0.00012875236,0.00019119175,0.00008689907,0.000029702363,0.0005288191,0.0018799101,0.16186388,0.000090001,0.005944347,0.0025991136,0.82664186],"study_design_scores_gemma":[0.0005151847,0.00018944422,0.00022055327,0.00075452833,0.00000800066,0.00036327384,9.684573e-8,0.95037645,0.005825421,0.026138661,0.013904916,0.0017034593],"about_ca_topic_score_codex":0.000023722105,"about_ca_topic_score_gemma":0.00002148289,"teacher_disagreement_score":0.8249384,"about_ca_system_score_codex":0.0004734151,"about_ca_system_score_gemma":0.000994356,"threshold_uncertainty_score":0.9994935},"labels":[],"label_agreement":null},{"id":"W2163782956","doi":"10.1109/fpt.2009.5377688","title":"The challenges of using an embedded MPI for hardware-based processing nodes","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Embedded system; Computer hardware; Computer architecture; Parallel computing","score_opus":0.0648686900782662,"score_gpt":0.3273468819582351,"score_spread":0.2624781918799689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163782956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020963105,0.00045499866,0.9948317,0.00095743395,0.000030364954,0.00013992043,2.4198738e-7,0.00035916842,0.0011298682],"genre_scores_gemma":[0.5158053,0.000009581213,0.48401582,0.0001319211,0.000016063457,0.000002676349,3.1054742e-7,0.000002854634,0.00001545969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929607,0.000040113206,0.00017728205,0.00019733766,0.0001255298,0.00016364458],"domain_scores_gemma":[0.9992678,0.00007947074,0.000110179164,0.00031701062,0.00019176342,0.000033758242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037215833,0.00008254145,0.000105794155,0.000051963718,0.00024320345,0.00012333968,0.0005585861,0.000035992718,4.2951118e-7],"category_scores_gemma":[0.000036238278,0.00005653222,0.000041690233,0.00012789371,0.000028373901,0.00022498125,0.000025770702,0.000035709316,1.7714548e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031798845,0.00029566206,0.00004169437,0.00006515662,0.000009788522,9.037901e-7,0.0015478021,0.10936224,0.0023016445,0.13130212,0.0002621418,0.75477904],"study_design_scores_gemma":[0.00013855913,0.00010329281,0.00011908282,0.000031144726,0.0000021825383,0.0000010541833,0.00003973673,0.976092,0.015601298,0.00768153,0.00010470035,0.0000854102],"about_ca_topic_score_codex":0.000002764424,"about_ca_topic_score_gemma":0.00000132681,"teacher_disagreement_score":0.8667298,"about_ca_system_score_codex":0.000011634934,"about_ca_system_score_gemma":0.0000822335,"threshold_uncertainty_score":0.23053169},"labels":[],"label_agreement":null},{"id":"W2163901392","doi":"10.1109/pacrim.1995.519428","title":"A caching compiler for C","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Compiler; Header; Programming language; Reduction (mathematics); Debugging; Compile time; Reuse; Parallel computing; Computer network","score_opus":0.03953132233069196,"score_gpt":0.26333769427088677,"score_spread":0.22380637194019481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163901392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009395643,0.00003204505,0.9649064,0.00085831626,0.00006658585,0.00007931122,2.0337816e-7,0.0006891077,0.03327408],"genre_scores_gemma":[0.3309588,0.000003828824,0.666221,0.0007010507,0.000022201508,0.000008422807,3.6533808e-7,0.0000026076384,0.0020817162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996172,0.000011487933,0.00007832624,0.0001314176,0.000053805223,0.00010776473],"domain_scores_gemma":[0.99968624,0.000051282077,0.00002100945,0.00018211735,0.000031885244,0.000027476066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008699891,0.000043474487,0.000052260195,0.000038739377,0.00008779864,0.00006832018,0.00031441142,0.000018311155,0.00002702025],"category_scores_gemma":[0.0000149343905,0.00003761632,0.00002969699,0.00008956483,0.000006068753,0.00012251087,0.000056552988,0.000028484004,0.000025527257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013974571,0.00011691392,0.00022945035,0.000012824426,0.000013188624,0.00000195833,0.00059487054,0.025740618,0.00013136842,0.5047057,0.3507734,0.11767831],"study_design_scores_gemma":[0.00008986082,0.00002284196,0.000024425251,0.0000025868762,4.522681e-7,0.0000026631715,8.38646e-7,0.9752202,0.00044979804,0.002018457,0.022106376,0.000061519735],"about_ca_topic_score_codex":0.00000339735,"about_ca_topic_score_gemma":4.2249619e-7,"teacher_disagreement_score":0.9494796,"about_ca_system_score_codex":0.0000071123327,"about_ca_system_score_gemma":0.0000023890175,"threshold_uncertainty_score":0.1533949},"labels":[],"label_agreement":null},{"id":"W2164321120","doi":"10.1109/ispass.2006.1620809","title":"Aestimo: a feedback-directed optimization evaluation tool","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Compiler; Benchmark (surveying); Selection (genetic algorithm); Workload; Code (set theory); Optimizing compiler; Spec#; Machine learning; Program optimization; Sensitivity (control systems); Artificial intelligence; Programming language; Set (abstract data type); Operating system","score_opus":0.015285049686425214,"score_gpt":0.2595928415872038,"score_spread":0.2443077919007786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164321120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007169246,0.00005150821,0.95817524,0.0004021024,0.00012856645,0.0002452403,3.3596586e-7,0.0026481468,0.037631933],"genre_scores_gemma":[0.17272383,0.00000462839,0.8259642,0.00016623118,0.000051958305,0.00002730702,0.0000251157,0.000007420777,0.0010293059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878246,0.0001096545,0.0002480183,0.0003154828,0.00036436575,0.00018000272],"domain_scores_gemma":[0.9991055,0.000042683874,0.00009243679,0.00037338567,0.0003580941,0.000027899285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048060872,0.00011429989,0.000101153375,0.0001367515,0.0001344473,0.00021559143,0.000377303,0.000063885695,0.000090163],"category_scores_gemma":[0.0000671843,0.000108214736,0.00003871268,0.0005876527,0.000017173381,0.00043130407,0.00008796889,0.00005671373,0.000035468318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001478002,0.000043090087,0.00012540304,0.000001665123,0.000002557708,6.8574144e-7,0.000018839952,0.9568784,0.00004569811,0.016662998,0.014462383,0.011756806],"study_design_scores_gemma":[0.00024905693,0.000022900545,0.0009889822,0.000007680867,0.000004683477,0.0000058227843,9.467124e-7,0.9934109,0.0010198177,0.0036131782,0.00052100554,0.0001550582],"about_ca_topic_score_codex":0.000087441666,"about_ca_topic_score_gemma":0.0000051702973,"teacher_disagreement_score":0.1720069,"about_ca_system_score_codex":0.00006466197,"about_ca_system_score_gemma":0.000086825276,"threshold_uncertainty_score":0.4412869},"labels":[],"label_agreement":null},{"id":"W2164348333","doi":"10.1145/2379776.2379780","title":"Survey of scheduling techniques for addressing shared resources in multicore processors","year":2012,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Thread (computing); Multi-core processor; Scheduling (production processes); Shared resource; Architecture; Distributed computing; Instruction set; Cache; Computer architecture; Embedded system; Operating system; Parallel computing","score_opus":0.19800983041105927,"score_gpt":0.39570481136649244,"score_spread":0.19769498095543317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164348333","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034000284,0.5131975,0.48518,0.000005903987,0.00015802057,0.0008117628,0.000030425073,0.00054266665,0.000039744566],"genre_scores_gemma":[0.0045736,0.29392305,0.7008409,0.000018329745,0.00015540089,0.00008786568,0.00026128,0.000114354945,0.000025237536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928878,0.0030499988,0.0018060971,0.0010190133,0.0004149253,0.00082219596],"domain_scores_gemma":[0.99084973,0.005060852,0.001777256,0.0015561193,0.0006275443,0.00012847206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.014240457,0.00067411596,0.002323033,0.00091119565,0.00021722844,0.00028090752,0.004103098,0.00056043454,0.0000017638893],"category_scores_gemma":[0.003935758,0.000632112,0.00034930673,0.0019752453,0.00009761181,0.00035187133,0.001694136,0.000619455,0.0000031638917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019355493,0.00009605691,0.0012493975,0.0065421825,0.00004059972,0.0000015782948,0.00036260104,0.0003682679,3.077954e-7,0.000034904337,0.000049880364,0.9912523],"study_design_scores_gemma":[0.0017172934,0.00056826667,0.01900512,0.16607723,0.00051487755,0.00008245676,0.000041108226,0.6399858,0.00025654768,0.0007817333,0.16375443,0.0072151097],"about_ca_topic_score_codex":0.00044151183,"about_ca_topic_score_gemma":0.00006589333,"teacher_disagreement_score":0.98403716,"about_ca_system_score_codex":0.00013567918,"about_ca_system_score_gemma":0.00035487613,"threshold_uncertainty_score":0.99961305},"labels":[],"label_agreement":null},{"id":"W2164645802","doi":"10.1145/582034.582067","title":"Dynamic page placement to improve locality in CC-NUMA multiprocessors for TPC-C","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Demand paging; Locality; Page fault; Benchmark (surveying); Multiprocessing; Interleaved memory; Page; Memory map; Shared memory; Memory management; Virtual memory; Operating system; Overlay","score_opus":0.014840996782138642,"score_gpt":0.29219748959389114,"score_spread":0.2773564928117525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164645802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009557285,0.000009408431,0.988133,0.0007979021,0.000072514806,0.00049267814,0.00002000974,0.00037711655,0.0005400753],"genre_scores_gemma":[0.52934045,0.000007908674,0.4688757,0.0009849496,0.000011891859,0.00010507254,0.000035595906,0.0000065384656,0.00063189596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887985,0.000027472819,0.00025559613,0.00040506732,0.00013886802,0.00029312656],"domain_scores_gemma":[0.9993518,0.00006758833,0.00005155737,0.00036319203,0.00008111308,0.0000847445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039600008,0.00012120083,0.00013801562,0.00012822883,0.000069833,0.000087586486,0.00056756847,0.000052250965,0.0000057821603],"category_scores_gemma":[0.00006421316,0.00011043877,0.000039168564,0.00039886712,0.000011952739,0.00014643052,0.0001871217,0.0000638651,0.000022976843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005208981,0.01082878,0.004662962,0.00037159023,0.00008599105,0.00007194652,0.005211568,0.42770886,0.00288906,0.02635065,0.097107254,0.42419043],"study_design_scores_gemma":[0.0010938818,0.0001580401,0.0002701049,0.0000133745625,9.571562e-7,0.0000017019448,0.000016119444,0.99071705,0.0010457209,0.0010837687,0.0054172743,0.00018197778],"about_ca_topic_score_codex":0.00010841517,"about_ca_topic_score_gemma":0.00016358022,"teacher_disagreement_score":0.5630082,"about_ca_system_score_codex":0.00010470454,"about_ca_system_score_gemma":0.00003624521,"threshold_uncertainty_score":0.45035625},"labels":[],"label_agreement":null},{"id":"W2164854789","doi":"10.1109/hprcta.2008.4745682","title":"MPI as an abstraction for software-hardware interaction for HPRCs","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"High Performance Research Computing, Texas A and M University","keywords":"Computer science; Software portability; Computer architecture; x86; Usability; Porting; Field-programmable gate array; Software; Programming paradigm; Embedded system; Programming language; Parallel computing; Operating system","score_opus":0.04498284767371409,"score_gpt":0.32215817164880234,"score_spread":0.27717532397508826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164854789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041340166,0.000008142155,0.99223846,0.00025725848,0.00038804938,0.0003691694,0.0000023153311,0.0012602018,0.0013423631],"genre_scores_gemma":[0.16974278,0.000013511726,0.82764894,0.0004328386,0.00012393856,0.000095376425,0.000028401546,0.0000111596655,0.0019030307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992174,0.000017045872,0.00018663894,0.00030536496,0.0001046098,0.00016893579],"domain_scores_gemma":[0.99919677,0.0001431232,0.00009612963,0.00027617134,0.00022483617,0.000062962805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015905728,0.00009923658,0.00010160968,0.00009408156,0.0002873758,0.00008644861,0.00031595712,0.000066558074,0.000014872694],"category_scores_gemma":[0.00010676427,0.00009546868,0.00007542929,0.000103310784,0.000013643066,0.0008263507,0.00003632259,0.00005859732,0.000021654692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043502866,0.0013127385,0.0010908205,0.00018581131,0.00012325787,0.000014638121,0.003500597,0.09138906,0.0017032302,0.09805929,0.33470115,0.46748438],"study_design_scores_gemma":[0.00068443187,0.0008120748,0.00061686797,0.00002009566,0.000007407882,0.000120443285,0.0000444627,0.86124384,0.027392637,0.013936289,0.09471961,0.0004018552],"about_ca_topic_score_codex":0.00003134771,"about_ca_topic_score_gemma":0.000004921417,"teacher_disagreement_score":0.7698548,"about_ca_system_score_codex":0.000041534822,"about_ca_system_score_gemma":0.000053163512,"threshold_uncertainty_score":0.38930994},"labels":[],"label_agreement":null},{"id":"W2164913620","doi":"10.3233/978-1-60750-065-0-7","title":"The SCOOP Concurrency Model in Java-like Languages","year":2009,"lang":"en","type":"book-chapter","venue":"IOS Press eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"SCOOP; Programming language; Java; Computer science; Concurrency","score_opus":0.03268696742414099,"score_gpt":0.2774208021234136,"score_spread":0.2447338346992726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164913620","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013090443,0.0022647653,0.21461147,0.000053071126,0.0001376768,0.00029799974,0.000004981133,0.0004698521,0.78215885],"genre_scores_gemma":[0.0029048799,0.0004917162,0.020761544,0.00050821336,0.00011243684,0.000033438788,0.000006925398,0.000039656505,0.97514117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998445,0.00004228543,0.00039433016,0.0004909138,0.00031589004,0.0003115898],"domain_scores_gemma":[0.9985686,0.00010745673,0.00022401333,0.000932754,0.000098836346,0.000068351364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026554795,0.00031351898,0.0002900106,0.00011533013,0.00015272183,0.00025339925,0.0016169176,0.00024560431,0.0000015098389],"category_scores_gemma":[0.000015054933,0.00024827605,0.00010482146,0.000011916143,0.0000871008,0.00007674085,0.000379961,0.00047811738,0.000009646449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038334097,0.000007769577,3.3210085e-7,0.000011699484,0.000012507491,0.000023781906,0.00034330256,0.0034181252,0.0000041367393,0.8110508,0.006802752,0.17832097],"study_design_scores_gemma":[0.00037023472,0.00008459446,0.0000035131893,0.00047677543,0.000015868789,0.00001724151,0.0000021456028,0.5543291,0.00036805152,0.109947525,0.33356425,0.0008207243],"about_ca_topic_score_codex":0.000029636123,"about_ca_topic_score_gemma":0.000016751044,"teacher_disagreement_score":0.70110327,"about_ca_system_score_codex":0.000041915257,"about_ca_system_score_gemma":0.00011388314,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2165137738","doi":"10.5555/1870926.1871246","title":"Accurate timed RTOS model for transaction level modeling","year":2010,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Real-time operating system; Computer science; Embedded system; Context switch; Transaction processing; Overhead (engineering); Scheduling (production processes); Operating system; Real-time computing; Engineering; Database transaction; Database","score_opus":0.06437192095887787,"score_gpt":0.2799053627650983,"score_spread":0.21553344180622044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165137738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004746202,0.000014588825,0.99389887,0.0002021272,0.00009048738,0.00031072937,0.0000034602017,0.0005717532,0.00016176207],"genre_scores_gemma":[0.53123844,0.000018679091,0.46849638,0.000075373326,0.000016057838,0.00002224638,0.0000041223625,0.000009057798,0.000119667784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991341,0.000047379508,0.00026601888,0.00028074402,0.00010382134,0.00016788984],"domain_scores_gemma":[0.9991961,0.00023379872,0.00007637826,0.00021673052,0.00022787672,0.00004913302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005210098,0.00011923453,0.00011640756,0.00014582874,0.0001591408,0.0001590515,0.00027284992,0.00006534999,0.0000015116551],"category_scores_gemma":[0.00025228216,0.0001166291,0.000020022362,0.00032314332,0.000017488157,0.0005109833,0.000021177011,0.00011842184,0.0000035814824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004889577,0.000060090882,0.00004518592,0.000016171314,0.0000029759487,7.974487e-7,0.0008597938,0.97883993,0.0030361814,0.004631651,0.00022407458,0.012278241],"study_design_scores_gemma":[0.00029126156,0.00003547159,0.0002840247,0.000013635098,0.0000031106788,0.0000071164395,0.0000015873662,0.9946206,0.0010945555,0.0034443734,0.00005817828,0.00014606444],"about_ca_topic_score_codex":0.000007343456,"about_ca_topic_score_gemma":0.000006536887,"teacher_disagreement_score":0.52649224,"about_ca_system_score_codex":0.000009081388,"about_ca_system_score_gemma":0.00008042709,"threshold_uncertainty_score":0.47559965},"labels":[],"label_agreement":null},{"id":"W2165637133","doi":"10.1002/cpe.3409","title":"Improving the user experience of the rCUDA remote GPU virtualization framework","year":2014,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Science; Generalitat Valenciana; Queen's University; Queen's University Belfast; U.S. Department of Energy","keywords":"CUDA; Computer science; Overhead (engineering); Node (physics); Virtualization; GPU cluster; Usability; General-purpose computing on graphics processing units; Parallel computing; Operating system; Graphics; Embedded system; Cloud computing","score_opus":0.01676471276957835,"score_gpt":0.30663671325132347,"score_spread":0.2898720004817451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165637133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04683725,0.0004341497,0.9508728,0.00091503456,0.00033840814,0.00015225097,3.341737e-7,0.000087075554,0.00036269854],"genre_scores_gemma":[0.9323193,0.00015648743,0.066393726,0.0010564512,0.000034726785,0.000010016812,6.250586e-7,0.000004691268,0.000024008283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.0003038137,0.0003041697,0.00034055166,0.00025763028,0.00015135745],"domain_scores_gemma":[0.998131,0.0008633053,0.00038295143,0.00036564987,0.00020796627,0.000049132635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494498,0.00012858001,0.00012519489,0.00003754943,0.0005128939,0.00023621648,0.00051958096,0.00006278381,0.0000020560074],"category_scores_gemma":[0.0012990802,0.00008509921,0.000028372993,0.00042120973,0.0002560011,0.000972571,0.000313575,0.00017277584,0.0000010477816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020603973,0.000067126886,0.0014802591,0.000049275488,0.000013420858,9.841486e-7,0.08811238,0.0044003697,0.00069229555,0.3095382,0.00023343682,0.5953917],"study_design_scores_gemma":[0.00018229279,0.00009559966,0.0014388663,0.00009896745,0.00001106588,0.000038933114,0.0020401608,0.98121876,0.0023683198,0.0066884225,0.005610121,0.0002084766],"about_ca_topic_score_codex":0.00006370658,"about_ca_topic_score_gemma":7.766278e-7,"teacher_disagreement_score":0.9768184,"about_ca_system_score_codex":0.000008352511,"about_ca_system_score_gemma":0.000039290484,"threshold_uncertainty_score":0.39448172},"labels":[],"label_agreement":null},{"id":"W2165928541","doi":"10.1109/icpp.1996.538567","title":"Scheduling of wavefront parallelism on scalable shared-memory multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Loop tiling; Dynamic priority scheduling; Locality; Locality of reference; Cache; Scheduling (production processes); Distributed computing; Mathematics; Compiler; Operating system","score_opus":0.026357165873538046,"score_gpt":0.2453554537253773,"score_spread":0.21899828785183925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165928541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068156207,0.0002213624,0.9456278,0.0005989642,0.00010643303,0.00012501799,7.978096e-7,0.0007162557,0.045787748],"genre_scores_gemma":[0.52569413,0.000040470608,0.4714198,0.00035552,0.000021926791,0.000006349546,8.877108e-7,0.0000068884433,0.0024540012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00003392711,0.00027893536,0.0003388812,0.00025708682,0.00023461496],"domain_scores_gemma":[0.9991512,0.000066654546,0.00011324807,0.00047851447,0.00011509909,0.00007533072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018355333,0.00013357753,0.00018048567,0.00013852473,0.00009572144,0.00006821115,0.000734387,0.000070209004,0.00014353314],"category_scores_gemma":[0.000063624924,0.000116351606,0.00006258516,0.00029379944,0.000032586096,0.00027584596,0.00015346248,0.00011519664,0.000107109314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001995607,0.0010026777,0.00064492685,0.00013441949,0.00006157813,0.00002449124,0.0037474574,0.7500341,0.0010465237,0.06407989,0.040278204,0.13892578],"study_design_scores_gemma":[0.00024641052,0.000076977514,0.00011420154,0.000048120168,0.0000015793356,0.0000029071987,0.000012543546,0.98710275,0.011005314,0.0006166897,0.00061564764,0.00015684977],"about_ca_topic_score_codex":0.000023070714,"about_ca_topic_score_gemma":0.00000101357,"teacher_disagreement_score":0.5188785,"about_ca_system_score_codex":0.000021974627,"about_ca_system_score_gemma":0.000012649934,"threshold_uncertainty_score":0.47446808},"labels":[],"label_agreement":null},{"id":"W2165986258","doi":"10.1109/spdp.1991.218280","title":"Efficient support of concurrent threads in a hybrid dataflow/von Neumann architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Computer Research Institute of Montréal","funders":"Astellas Pharma US","keywords":"Computer science; Dataflow; Parallel computing; Register file; Thread (computing); Von Neumann architecture; Operating system; Cache; Processor register; Instruction set; Computer architecture; Memory address; Semiconductor memory","score_opus":0.021759775468115833,"score_gpt":0.25383389016787933,"score_spread":0.2320741146997635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165986258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012852611,0.00010012089,0.97767836,0.00044733618,0.000162459,0.0001427082,0.0000036951255,0.00027874362,0.008333939],"genre_scores_gemma":[0.93816304,0.000018270604,0.061278496,0.00022227327,0.000014244014,0.0000057426573,0.0000056546496,0.000005459268,0.00028682177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988641,0.000052120085,0.00030620588,0.00031958846,0.00023304162,0.00022494048],"domain_scores_gemma":[0.999264,0.00005038657,0.000087569846,0.0004925799,0.000047653037,0.00005782694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022436013,0.000119554235,0.00018208273,0.00020398568,0.00003192792,0.000038096212,0.00072221627,0.00002899359,0.000093691604],"category_scores_gemma":[0.00002414556,0.00010181336,0.00004844496,0.00034538624,0.000043053144,0.00005197879,0.00026471092,0.00013110477,0.000024104076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007832338,0.0011931554,0.0015057233,0.000086009706,0.000022368837,0.00007397463,0.0026512574,0.68431103,0.00032905812,0.05365308,0.05328913,0.20287737],"study_design_scores_gemma":[0.00024855096,0.00010910435,0.00029582775,0.00002202415,0.0000014581502,0.00002058098,0.0000025579538,0.99353486,0.0026071235,0.00034071482,0.002676946,0.00014023251],"about_ca_topic_score_codex":0.000021027552,"about_ca_topic_score_gemma":0.000004573684,"teacher_disagreement_score":0.92531043,"about_ca_system_score_codex":0.000020253265,"about_ca_system_score_gemma":0.000018572013,"threshold_uncertainty_score":0.41518286},"labels":[],"label_agreement":null},{"id":"W2166075056","doi":"10.1109/tcad.2005.844092","title":"Context sensitive symbolic pointer analysis","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Compile time; Binary decision diagram; Theoretical computer science; Compiler; Abstract interpretation; Generality; Algorithm; Programming language; Static analysis; Artificial intelligence","score_opus":0.02657423014802609,"score_gpt":0.24268842373627283,"score_spread":0.21611419358824674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166075056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030224365,0.00015253095,0.9951275,0.00013194178,0.00043322737,0.0004070761,0.000024597246,0.00051722187,0.00018345585],"genre_scores_gemma":[0.9679306,0.000059998958,0.03142978,0.000250186,0.000055235712,0.000023850773,0.0000040984805,0.000018372515,0.00022786565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752337,0.00048763043,0.00074324064,0.00060982845,0.000320423,0.0003155078],"domain_scores_gemma":[0.99812317,0.0003691872,0.00028059745,0.0005662465,0.0005020795,0.00015872308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005672964,0.00033190317,0.0006948358,0.0008989703,0.00019498887,0.00026279717,0.00047695593,0.00016609271,0.0000081766875],"category_scores_gemma":[0.000005437441,0.00028747736,0.00022840138,0.0012899919,0.000085097876,0.0003355672,0.000005215099,0.00028752026,0.000016612204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021610444,0.0002329849,0.000010206063,0.000024089357,0.00083835813,0.000012328184,0.0013236298,0.85193324,0.0009508066,0.0026346892,0.0006581728,0.1413599],"study_design_scores_gemma":[0.00050427427,0.0003482702,0.00003230579,0.0001512735,0.000114416915,0.00006916107,0.00009853496,0.9831233,0.015033983,0.000032932876,0.0001957266,0.00029583494],"about_ca_topic_score_codex":0.00021502413,"about_ca_topic_score_gemma":0.00001174347,"teacher_disagreement_score":0.9649082,"about_ca_system_score_codex":0.000099747755,"about_ca_system_score_gemma":0.00009164802,"threshold_uncertainty_score":0.99995774},"labels":[],"label_agreement":null},{"id":"W2166263440","doi":"10.1145/2366231.2337207","title":"Staged memory scheduling","year":2012,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Army Research Office; National Science Foundation","keywords":"Computer science; Memory controller; Registered memory; Central processing unit; Embedded system; Uniform memory access; Scheduling (production processes); Parallel computing; Interleaved memory; Locality; Write buffer; Memory management; CPU cache; Operating system; Overlay; Cache; Cache algorithms; Semiconductor memory","score_opus":0.01999806909825688,"score_gpt":0.2682172986647576,"score_spread":0.2482192295665007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166263440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014733594,0.0003682884,0.97836876,0.0020953794,0.00086753163,0.000305742,0.0000012316514,0.00163217,0.0016273109],"genre_scores_gemma":[0.27049345,0.0000140862985,0.7264111,0.0020571202,0.00086775376,0.000017522205,0.00000590065,0.000024970204,0.000108084256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971962,0.00035674506,0.00041069728,0.00059473526,0.0005167413,0.00092489907],"domain_scores_gemma":[0.9970038,0.0005181803,0.00014881273,0.0018355799,0.000105237785,0.00038841463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007328772,0.0003525864,0.0003372047,0.00034692735,0.00031519213,0.0002537298,0.0028950248,0.0001281382,0.000020060232],"category_scores_gemma":[0.00016772452,0.00031405463,0.00016771868,0.0006158316,0.000076954675,0.000502979,0.002005442,0.0006299831,0.00008785133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017146904,0.00026796202,0.0034121745,0.000054365843,0.000088087596,0.00002232644,0.007391851,0.091084346,0.001056876,0.008397348,0.009951771,0.8782557],"study_design_scores_gemma":[0.0035438756,0.0010564014,0.013069306,0.0003750187,0.00006153281,0.00075260416,0.000082409555,0.7703688,0.03126473,0.046766784,0.12866089,0.0039976193],"about_ca_topic_score_codex":0.000030836636,"about_ca_topic_score_gemma":0.000003808036,"teacher_disagreement_score":0.8742581,"about_ca_system_score_codex":0.00005670398,"about_ca_system_score_gemma":0.00008271448,"threshold_uncertainty_score":0.99993116},"labels":[],"label_agreement":null},{"id":"W2166338303","doi":"10.1145/2458523.2458538","title":"Warp size impact in GPUs","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Divergence (linguistics); Computer science; Parallel computing; Reduction (mathematics); Control flow; Mathematics; Geometry","score_opus":0.010652604988400238,"score_gpt":0.26510941958512735,"score_spread":0.2544568145967271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166338303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03558028,0.000024816663,0.933627,0.00076921494,0.000052710184,0.00011451436,6.6891246e-8,0.00057866116,0.029252702],"genre_scores_gemma":[0.73620445,0.0000051528596,0.26255766,0.00031260337,0.000008976435,0.000007444219,1.5850229e-7,0.0000023378223,0.00090124516],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994531,0.000028219987,0.00011802513,0.00015438076,0.00008136357,0.00016490341],"domain_scores_gemma":[0.9995512,0.00007632772,0.000023943308,0.0002625511,0.000037389287,0.00004862282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108295244,0.00006418697,0.00007595526,0.000062278465,0.000023612807,0.00011950596,0.00042630231,0.000030870102,0.00016779163],"category_scores_gemma":[0.00004179391,0.000048324222,0.000030571242,0.00027660327,0.000008820681,0.0003224245,0.000115271716,0.00005846647,0.00018480161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008092187,0.00062498485,0.07630848,0.000024575249,0.0000427438,0.00004243492,0.0027319677,0.07091639,0.0029312675,0.11252507,0.36982945,0.36401457],"study_design_scores_gemma":[0.00019048956,0.00006212487,0.051697366,0.000008737143,3.137593e-7,0.0000075313587,0.0000047862377,0.9308921,0.0018928334,0.014630999,0.00044056785,0.00017211294],"about_ca_topic_score_codex":0.00047511293,"about_ca_topic_score_gemma":0.0000040627347,"teacher_disagreement_score":0.85997576,"about_ca_system_score_codex":0.000027023894,"about_ca_system_score_gemma":0.000024661078,"threshold_uncertainty_score":0.23753124},"labels":[],"label_agreement":null},{"id":"W2166345115","doi":"10.1109/icppw.2001.951913","title":"Feedback guided dynamic loop scheduling; A theoretical approach","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Loop (graph theory); Feedback loop; Workload; Inner loop; Scheduling (production processes); Dynamic priority scheduling; Loop fission; Loop tiling; Convergence (economics); Loop fusion; Control theory (sociology); Schedule; Mathematical optimization; Parallel computing; Mathematics; Artificial intelligence","score_opus":0.02255770833488799,"score_gpt":0.25858720572332367,"score_spread":0.23602949738843568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166345115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086659944,0.000108164124,0.8666847,0.0010352037,0.00006096429,0.00009808468,1.7031157e-7,0.0011865206,0.12995961],"genre_scores_gemma":[0.42538714,0.000018953186,0.5723978,0.0004597819,0.000013381491,0.0000055783444,9.72655e-7,0.000006183121,0.0017101814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883866,0.00006708649,0.00022296255,0.00038736037,0.00021062665,0.00027331873],"domain_scores_gemma":[0.9991506,0.00004617076,0.00004767308,0.00058138306,0.00007804685,0.000096165015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023920764,0.00013447521,0.0001413513,0.000068329995,0.00010917903,0.00018084214,0.00090882677,0.00007995362,0.00018421216],"category_scores_gemma":[0.00004539357,0.000111618145,0.000065365435,0.00039256478,0.00010485001,0.00017581233,0.00025142886,0.00013328694,0.00020032626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.995346e-7,0.00017781812,0.00004124949,0.0000067231026,0.000011114885,0.0000035706285,0.0001737798,0.009109468,0.000033975495,0.9709433,0.0072296225,0.012268583],"study_design_scores_gemma":[0.00015409767,0.000028433959,0.00003691596,0.0000059833264,0.0000024653802,0.00003092341,0.000005101123,0.9885415,0.00019478699,0.010591617,0.0002465955,0.00016162168],"about_ca_topic_score_codex":0.0000021263272,"about_ca_topic_score_gemma":1.0512195e-7,"teacher_disagreement_score":0.979432,"about_ca_system_score_codex":0.000023021896,"about_ca_system_score_gemma":0.00001324303,"threshold_uncertainty_score":0.4551656},"labels":[],"label_agreement":null},{"id":"W2166382329","doi":"10.1109/rsp.2011.5929981","title":"A novel low-overhead flexible instrumentation framework for virtual platforms","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Instrumentation (computer programming); Computer science; Profiling (computer programming); Debugging; Overhead (engineering); Embedded system; Tracing; Source code; Operating system","score_opus":0.05258785485284176,"score_gpt":0.28924618978128314,"score_spread":0.23665833492844138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166382329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00399049,0.0000054877796,0.9891675,0.00005993897,0.00027708977,0.00021687201,0.0000018474243,0.0008752122,0.0054055755],"genre_scores_gemma":[0.21550047,0.0000041704084,0.78355604,0.0005354722,0.000029400953,0.000028014954,0.000003764136,0.00000689072,0.00033578454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991928,0.000004189901,0.00019927295,0.00026226757,0.00013460698,0.00020688344],"domain_scores_gemma":[0.99941856,0.00006721041,0.000083117426,0.00029913438,0.00007140649,0.00006056513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016027603,0.00010653815,0.00010334121,0.000094511335,0.0001187853,0.000080968246,0.000487106,0.00008648112,0.000030339545],"category_scores_gemma":[0.000041853455,0.00009192455,0.000053431628,0.0002303016,0.000021614847,0.00053017726,0.0001175836,0.000075324715,0.000023325285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012977037,0.00007954054,0.00008778935,0.000005263892,0.000007836809,1.7862969e-7,0.00070598786,0.00030699378,0.000107703054,0.97971755,0.0006914878,0.01827666],"study_design_scores_gemma":[0.0008560512,0.0006005634,0.001161566,0.000072711315,0.0000056899453,0.000011096459,0.000094979296,0.5873793,0.08419705,0.32463962,0.0005320338,0.00044936218],"about_ca_topic_score_codex":0.000027059636,"about_ca_topic_score_gemma":0.0000019016284,"teacher_disagreement_score":0.65507793,"about_ca_system_score_codex":0.000027350367,"about_ca_system_score_gemma":0.000042573,"threshold_uncertainty_score":0.37485746},"labels":[],"label_agreement":null},{"id":"W2166446045","doi":"10.1109/rtas.2010.40","title":"Using PCM in Next-generation Embedded Space Applications","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Phase-change memory; Computer science; Dram; Embedded system; Memory controller; Dynamic random-access memory; Universal memory; Registered memory; CAS latency; Scalability; Interleaved memory; Interface (matter); Semiconductor memory; Computer memory; Computer hardware; Computer architecture; Operating system; Engineering","score_opus":0.07282726386613744,"score_gpt":0.3152569391735555,"score_spread":0.24242967530741807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166446045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012775338,0.000010063029,0.9801639,0.0003320645,0.00009468613,0.00014988339,1.1809164e-7,0.00035292315,0.006121058],"genre_scores_gemma":[0.42859727,0.0000022134066,0.5710875,0.000107639884,0.00005032875,0.0000124722765,0.0000013650164,0.0000027351957,0.00013849667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941534,0.000023676272,0.00013608573,0.00021538672,0.00008841965,0.00012107152],"domain_scores_gemma":[0.9994741,0.000020462247,0.00004336107,0.0003703457,0.00005412196,0.000037621478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018045364,0.00006434903,0.00006437077,0.00011800654,0.00008444777,0.0001570955,0.00035575038,0.000054328717,0.000013956164],"category_scores_gemma":[0.000016096647,0.00006319319,0.000018371475,0.00039443528,0.000014883782,0.00032827765,0.00008705573,0.000118990894,0.000015259098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.923762e-7,0.000120521894,0.0009555032,0.0000052589708,0.0000035392,0.0000018314021,0.00043410235,0.041794226,0.26791525,0.6625435,0.0014511596,0.024774242],"study_design_scores_gemma":[0.00006251848,0.000004806472,0.00010509597,0.0000016748003,5.5064083e-7,0.000004453999,0.00000411691,0.97858644,0.017730257,0.002222577,0.0011912961,0.000086237844],"about_ca_topic_score_codex":0.00004775732,"about_ca_topic_score_gemma":0.000062873216,"teacher_disagreement_score":0.9367922,"about_ca_system_score_codex":0.000014663782,"about_ca_system_score_gemma":0.000049576825,"threshold_uncertainty_score":0.25769433},"labels":[],"label_agreement":null},{"id":"W2166532433","doi":"10.1109/rtcsa.2009.25","title":"Integrating Preemption Threshold to Fixed Priority DVS Scheduling Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Preemption; Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Algorithm; Embedded system; Real-time computing; Parallel computing; Operating system; Mathematical optimization; Mathematics; Engineering","score_opus":0.021465450214727514,"score_gpt":0.2912733675942191,"score_spread":0.2698079173794916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166532433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0087335035,0.000028711149,0.97899145,0.0016573434,0.0001282897,0.00019322887,2.1232341e-7,0.0014363496,0.008830927],"genre_scores_gemma":[0.36340654,0.00000342141,0.6354138,0.0008901834,0.00005332323,0.0000035324883,0.0000011524395,0.0000029894218,0.00022501724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988596,0.000034732784,0.00024506144,0.00038898617,0.0002215266,0.00025011506],"domain_scores_gemma":[0.9992419,0.00003073413,0.00006224503,0.0004296982,0.00012434403,0.00011110617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004140288,0.00013433928,0.0001377606,0.00013053966,0.00016549173,0.0002652815,0.0006590212,0.00006668225,0.000008035083],"category_scores_gemma":[0.00007699615,0.00011865396,0.000050430514,0.00047088042,0.000008718979,0.0003936568,0.00014649157,0.00015731345,0.000032525546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013162155,0.0002502214,0.0013373063,0.000012056221,0.000015526632,0.0000118579455,0.0023031002,0.074709274,0.0055851378,0.25929224,0.004219424,0.6522507],"study_design_scores_gemma":[0.00010809053,0.0001583341,0.0013803205,0.000037397007,0.0000014670179,0.0000055556943,0.000012764089,0.98263633,0.0093044,0.0058088284,0.0003467867,0.0001997323],"about_ca_topic_score_codex":0.000017910912,"about_ca_topic_score_gemma":0.0000033909944,"teacher_disagreement_score":0.90792704,"about_ca_system_score_codex":0.000047227357,"about_ca_system_score_gemma":0.000038712795,"threshold_uncertainty_score":0.48385683},"labels":[],"label_agreement":null},{"id":"W2166675154","doi":"10.1109/mtdt.1994.397197","title":"A fault-tolerant multiprocessor cache memory","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; MESI protocol; Cache pollution; Cache invalidation; Cache; Page cache; Cache algorithms; Cache coloring; Bus sniffing; Smart Cache; Cache coherence; Operating system; Parallel computing; CPU cache","score_opus":0.026718224987615065,"score_gpt":0.24351711607205487,"score_spread":0.2167988910844398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166675154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007991962,0.00018731858,0.9406914,0.001024589,0.000084578955,0.0000817552,2.1250004e-7,0.0013676983,0.055763233],"genre_scores_gemma":[0.5671689,0.000021994969,0.42282942,0.0010549573,0.000033955886,0.0000105350155,4.3778905e-7,0.0000062594404,0.008873538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999167,0.000032127908,0.00015944865,0.000274901,0.00016725519,0.000199242],"domain_scores_gemma":[0.9993903,0.00004012183,0.000046490146,0.00038056308,0.00007283415,0.00006967524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012508321,0.000100544225,0.000105655585,0.0000759606,0.000108916196,0.0001082,0.00066039164,0.000047674937,0.00010917093],"category_scores_gemma":[0.000030933934,0.00008325119,0.000042143954,0.00028026107,0.00002018772,0.00024436243,0.00013338812,0.000086444365,0.00020109455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000745807,0.0008863669,0.000399441,0.00007476715,0.00006387932,0.00010127847,0.008813612,0.101383805,0.00081299664,0.04450112,0.2581955,0.5847598],"study_design_scores_gemma":[0.00016609483,0.000022860191,0.00004192223,0.000006879281,0.0000010640777,0.00001299253,0.000008324302,0.99168205,0.0027171497,0.0002565946,0.004948002,0.00013605953],"about_ca_topic_score_codex":0.000020732856,"about_ca_topic_score_gemma":0.0000018271385,"teacher_disagreement_score":0.89029825,"about_ca_system_score_codex":0.000015207348,"about_ca_system_score_gemma":0.000008619528,"threshold_uncertainty_score":0.33948848},"labels":[],"label_agreement":null},{"id":"W2166963505","doi":"10.1109/icecs.2009.5410772","title":"Estimation of energy performance in computing platforms","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Computer science; Energy (signal processing); Acceleration; Speedup; Key (lock); Bounded function; Performance prediction; Very-large-scale integration; Power (physics); Efficient energy use; Computer engineering; Real-time computing; Parallel computing; Simulation; Embedded system; Engineering","score_opus":0.01158560679923925,"score_gpt":0.24533355820072217,"score_spread":0.2337479514014829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166963505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079515435,0.000014275263,0.9110798,0.000069198075,0.000023206168,0.000023544539,2.624961e-8,0.00019277433,0.009081719],"genre_scores_gemma":[0.69007695,0.0000070701553,0.3097559,0.00011989728,0.0000040062528,2.451286e-7,7.324699e-7,9.5164853e-7,0.00003426563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994527,0.0000067095716,0.00020780148,0.000120356766,0.00010231493,0.000110121815],"domain_scores_gemma":[0.9996968,0.00002199834,0.000069999776,0.00016696556,0.000025910613,0.000018312794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016154077,0.000055614,0.00009137983,0.00013472073,0.000028493667,0.000019790585,0.000296918,0.000029250337,0.0000014510614],"category_scores_gemma":[0.000009523511,0.000048509704,0.000016512717,0.0003378481,0.000008382221,0.00028030627,0.000043780175,0.000038405087,0.0000012771136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015799695,0.000033514938,0.00068305817,0.0000035850064,7.229557e-7,5.4760795e-7,0.00013501022,0.47280315,0.000026316819,0.13802579,0.00006767086,0.38821906],"study_design_scores_gemma":[0.000094540264,0.00006758555,0.009066114,0.000024066938,2.1578143e-7,0.0000027090098,0.0000013703986,0.977664,0.008561318,0.0044373027,0.000020597145,0.00006015854],"about_ca_topic_score_codex":0.000008837133,"about_ca_topic_score_gemma":7.853871e-7,"teacher_disagreement_score":0.6105615,"about_ca_system_score_codex":0.000015226042,"about_ca_system_score_gemma":0.000017427536,"threshold_uncertainty_score":0.19781683},"labels":[],"label_agreement":null},{"id":"W2167303720","doi":"10.1109/ccece.2005.1557375","title":"Measuring the potential benefits of a dynamically adaptive cache line size","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cache; Computer science; Cache algorithms; Cache coloring; Cache pollution; Cache invalidation; Parallel computing; CPU cache; Page cache; Smart Cache; Cache-oblivious algorithm; Locality","score_opus":0.016866737879560733,"score_gpt":0.2167882118961196,"score_spread":0.19992147401655888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167303720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008792847,0.00009946621,0.9836326,0.00074207137,0.000053203847,0.00009064876,9.029447e-7,0.00028678396,0.006301476],"genre_scores_gemma":[0.73762554,0.000004340783,0.26191857,0.00007544076,0.000036069734,0.0000027083745,4.953154e-7,0.000003546484,0.00033330708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991833,0.000054192828,0.00021195514,0.00018283706,0.00022364724,0.00014409228],"domain_scores_gemma":[0.9993273,0.00009571457,0.0000915247,0.0003066351,0.00015707815,0.000021724967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002438272,0.00008411258,0.00010512695,0.00003539594,0.00008794498,0.000048241178,0.000645536,0.00003984236,0.000005845646],"category_scores_gemma":[0.00003378846,0.000056023106,0.00005898058,0.00023841509,0.00004775901,0.00009900101,0.00020423543,0.000081441154,0.0000030810063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013394804,0.00013636735,0.00016918819,0.0000058080504,0.000021543954,0.0000029039586,0.00012149903,0.7623775,0.0016576808,0.22159006,0.00089033856,0.0130137075],"study_design_scores_gemma":[0.00013093825,0.000056032866,0.004326314,0.000013124504,0.0000041477792,0.0000068595227,0.0000055757105,0.9837364,0.0059471224,0.005653525,0.000028406816,0.00009157281],"about_ca_topic_score_codex":0.00022559076,"about_ca_topic_score_gemma":0.000027361946,"teacher_disagreement_score":0.72883266,"about_ca_system_score_codex":0.000015606653,"about_ca_system_score_gemma":0.000031126212,"threshold_uncertainty_score":0.22845559},"labels":[],"label_agreement":null},{"id":"W2167664807","doi":"10.1109/fccm.2010.34","title":"Integrating High-Level Synthesis into MPI","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Message passing; Message Passing Interface; Interface (matter); Software; Computer architecture; Port (circuit theory); Operating system; Parallel computing","score_opus":0.016239889994470322,"score_gpt":0.2552320780469404,"score_spread":0.2389921880524701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167664807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059739347,0.000005342185,0.9782067,0.0010897219,0.00029447468,0.000049062437,2.4054006e-7,0.0010773657,0.01330318],"genre_scores_gemma":[0.47694966,0.0000012284933,0.5225402,0.00018799258,0.000032041266,0.000006775421,2.452685e-7,0.0000035195724,0.00027832628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.00003183477,0.00016655782,0.00025815112,0.00013745109,0.00015906928],"domain_scores_gemma":[0.9991943,0.00013444174,0.000055346904,0.00046310778,0.00008876919,0.000063983374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030097578,0.00010016117,0.000106452215,0.00009556325,0.00014589944,0.00017988033,0.00084334874,0.00006782746,0.00004969171],"category_scores_gemma":[0.00026684412,0.000080388156,0.000037559625,0.00024168724,0.000029472956,0.0002544661,0.00023080231,0.00019172867,0.00006188076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010785416,0.000046485344,0.00042200167,0.0000071208055,0.000008926408,0.0000036062038,0.00040658106,0.00020384803,0.0072948895,0.7632799,0.005439,0.22288658],"study_design_scores_gemma":[0.00013489801,0.00005030035,0.0017735551,0.00004235335,0.000004792039,0.0000220207,0.000030247784,0.7329875,0.21251723,0.047048073,0.0048745163,0.00051450543],"about_ca_topic_score_codex":0.00022190968,"about_ca_topic_score_gemma":0.00006340405,"teacher_disagreement_score":0.7327837,"about_ca_system_score_codex":0.00001075982,"about_ca_system_score_gemma":0.000038701575,"threshold_uncertainty_score":0.3278134},"labels":[],"label_agreement":null},{"id":"W2167675119","doi":"10.1145/1964179.1964184","title":"Reducing branch divergence in GPU programs","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Divergence (linguistics); CUDA; Parallel computing; General-purpose computing on graphics processing units; Computer graphics (images); Graphics","score_opus":0.04299293693754882,"score_gpt":0.258245426340903,"score_spread":0.21525248940335415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167675119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01336103,0.000030872798,0.9488215,0.00005564342,0.00010597568,0.00009175354,2.7992481e-8,0.0006123293,0.036920898],"genre_scores_gemma":[0.6171028,0.000008432099,0.3825234,0.000059928963,0.000006637213,0.000006347824,2.286028e-7,0.000002088647,0.00029017508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932104,0.000030035944,0.00014556124,0.00023416177,0.0000935497,0.00017563977],"domain_scores_gemma":[0.99959934,0.000009009374,0.000034094635,0.00028512982,0.00003346947,0.000038940565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019696337,0.00006483185,0.00007153562,0.00008046501,0.00004150489,0.000039945917,0.00057551515,0.000031322354,0.000026196649],"category_scores_gemma":[0.000012175767,0.00005787609,0.000021619106,0.00040217538,0.000017562983,0.00023615961,0.00018443327,0.00006493001,0.000027170834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000083154955,0.00049972505,0.11314305,0.000021488568,0.000010436004,0.00003243092,0.009766492,0.0016248559,0.00028735137,0.18865424,0.0025125234,0.6834391],"study_design_scores_gemma":[0.00054505165,0.00034263407,0.07149283,0.00016324868,0.0000029076473,0.00003307181,0.00004703289,0.84361213,0.0340996,0.046889544,0.0018908267,0.0008811331],"about_ca_topic_score_codex":0.0002787987,"about_ca_topic_score_gemma":0.000010261007,"teacher_disagreement_score":0.84198725,"about_ca_system_score_codex":0.000013174618,"about_ca_system_score_gemma":0.000019398962,"threshold_uncertainty_score":0.23601183},"labels":[],"label_agreement":null},{"id":"W2167897136","doi":"10.1145/1534916.1534922","title":"Vector Processing as a Soft Processor Accelerator","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Field-programmable gate array; Scalability; Speedup; Programmer; Vector processor; Register file; Software; Processor design; Computer hardware; Embedded system; Computer architecture; Parallel computing; Instruction set; Operating system","score_opus":0.018669935596102707,"score_gpt":0.26214404327371843,"score_spread":0.24347410767761574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167897136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00737116,0.0012886552,0.9802308,0.0050332216,0.00019622679,0.00038989398,0.0000018764583,0.002705569,0.002782588],"genre_scores_gemma":[0.9831517,0.00009002683,0.0152381575,0.00032310878,0.000018751583,0.00008532545,8.576484e-7,0.0000100543275,0.0010820223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986682,0.00004400605,0.00031759107,0.0005082736,0.00014251017,0.00031944126],"domain_scores_gemma":[0.9989519,0.000052921678,0.00013341155,0.0006372366,0.00014584462,0.00007867676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022330608,0.00020428361,0.00027639486,0.0005958731,0.0005011341,0.0002597448,0.00084520143,0.00029913333,0.000010782641],"category_scores_gemma":[0.000048858055,0.00018769124,0.00003998892,0.0010253328,0.00006437135,0.0003963603,0.000006068543,0.00035112762,0.00003342411],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033423712,0.00028407408,0.000054406242,0.000108759756,0.00004563001,0.000024954306,0.00045351178,0.002733213,0.0027617428,0.030915653,0.00042247126,0.96216214],"study_design_scores_gemma":[0.0035428193,0.005088031,0.0006590174,0.0019221054,0.000109890716,0.0029651846,0.0011281103,0.60111105,0.20947614,0.1388849,0.03178772,0.0033250365],"about_ca_topic_score_codex":0.000009571451,"about_ca_topic_score_gemma":0.0000011155254,"teacher_disagreement_score":0.97578055,"about_ca_system_score_codex":0.000034296707,"about_ca_system_score_gemma":0.00010740442,"threshold_uncertainty_score":0.76538265},"labels":[],"label_agreement":null},{"id":"W2168098483","doi":"10.1109/hpcs.2005.55","title":"The HPCVL Working Template: A Tool for High-Performance Programming","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Innovation Trust","keywords":"Computer science; Debugger; Correctness; Programming language; Simple (philosophy); Parallel computing; Set (abstract data type); Compiler; Scripting language; Working set; Code (set theory); Source code; Debugging; Operating system","score_opus":0.01859263703073404,"score_gpt":0.2560054340903117,"score_spread":0.23741279705957763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168098483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006371672,0.00007365064,0.989388,0.0016738476,0.00012431732,0.00027977358,7.317147e-8,0.0008562315,0.0012324454],"genre_scores_gemma":[0.48535815,0.000017854769,0.51346475,0.00018594525,0.00007861855,0.000050676204,4.5031538e-7,0.000004192956,0.0008393655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999185,0.000016939262,0.00019347512,0.00020292905,0.00012391507,0.00027771198],"domain_scores_gemma":[0.9993625,0.0001535842,0.000067390756,0.00032879206,0.00006152671,0.000026153453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045740817,0.0000874597,0.00007364369,0.000035557037,0.0005093438,0.0003614825,0.00068560574,0.00003557136,0.000001565378],"category_scores_gemma":[0.000026204498,0.000058084875,0.00003069509,0.00021467354,0.000022563745,0.0002484957,0.00012508736,0.00006820945,0.000011980382],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038459402,0.000013031101,0.00020199548,0.0000032388625,0.000005088942,1.5492483e-7,0.00007259649,0.0052941134,0.000011116668,0.04231095,0.0026845306,0.94939935],"study_design_scores_gemma":[0.00018473083,0.0000664497,0.00026328475,0.000021916185,0.0000018157853,0.0000056673116,0.0000035487476,0.7775457,0.0050088977,0.00071520114,0.21602196,0.00016085332],"about_ca_topic_score_codex":0.0000034970003,"about_ca_topic_score_gemma":0.0000032734101,"teacher_disagreement_score":0.9492385,"about_ca_system_score_codex":0.000025968933,"about_ca_system_score_gemma":0.000027012185,"threshold_uncertainty_score":0.39175123},"labels":[],"label_agreement":null},{"id":"W2168488307","doi":"10.1145/781498.781532","title":"Using generative design patterns to generate parallel code for a distributed memory environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Software design pattern; Programmer; Design pattern; Distributed memory; Code generation; Programming language; Synchronization (alternating current); Code (set theory); Object-oriented programming; Java; Set (abstract data type); Parallel computing; Distributed computing; Shared memory; Software; Operating system; Key (lock)","score_opus":0.0817346443722106,"score_gpt":0.2929441025557126,"score_spread":0.211209458183502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168488307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001178977,0.00003227703,0.9974096,0.0002463964,0.00008823269,0.00062138983,0.000022258799,0.00026813213,0.00013277672],"genre_scores_gemma":[0.05047385,0.000010954941,0.94823056,0.00084484386,0.000028271612,0.000092600974,0.000010381492,0.000012511812,0.00029599937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866813,0.00017715115,0.0002388187,0.000449366,0.00015091106,0.00031563846],"domain_scores_gemma":[0.99927765,0.000071609735,0.00007279101,0.00038825275,0.000056666762,0.0001329993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038132467,0.00017342225,0.0001688303,0.000070410315,0.00020959991,0.00013344323,0.00038714666,0.000053180855,0.000020178917],"category_scores_gemma":[0.000035245237,0.00015823764,0.000056738947,0.000142112,0.00001357255,0.00013612607,0.000097636344,0.00004975073,0.000011169757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050806507,0.000045529814,0.000038104103,0.0000028989693,0.000014706679,0.0000024835879,0.0001621318,0.9850466,0.0014512228,0.009688285,0.0026809224,0.0008620089],"study_design_scores_gemma":[0.0002919187,0.000102986116,0.00002150344,0.000006661358,0.0000052241835,0.0000064534825,0.000011501358,0.92697996,0.06901455,0.0013530601,0.0019573893,0.0002487795],"about_ca_topic_score_codex":0.000007826888,"about_ca_topic_score_gemma":0.0000016541728,"teacher_disagreement_score":0.067563325,"about_ca_system_score_codex":0.00009623617,"about_ca_system_score_gemma":0.000056242385,"threshold_uncertainty_score":0.6452744},"labels":[],"label_agreement":null},{"id":"W2168664118","doi":"10.1109/pacrim.1995.519458","title":"Efficient modular interconnection networks for digital filtering and convolution","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interconnection; Convolution (computer science); Adder; Very-large-scale integration; Computer science; Modular design; Topology (electrical circuits); Simple (philosophy); Parallel computing; Factorization; Tensor product; Algorithm; Mathematics; Embedded system; Artificial intelligence; Latency (audio)","score_opus":0.017028565529647318,"score_gpt":0.2178239349034043,"score_spread":0.20079536937375697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168664118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008746229,0.00009370253,0.989241,0.00014197738,0.00012714956,0.00011731741,3.6294014e-7,0.00044181006,0.0010904393],"genre_scores_gemma":[0.8956989,0.0000084080675,0.10395769,0.000066716835,0.000029682531,0.000009032997,0.0000011443619,0.0000033247104,0.00022508552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954516,0.000008127623,0.00010050681,0.00018485707,0.000045355533,0.00011601113],"domain_scores_gemma":[0.99973565,0.00003906962,0.000029830899,0.00012488253,0.000038483937,0.000032095104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007554139,0.000059748647,0.00005946419,0.00004874621,0.00008982556,0.00018691884,0.00011739937,0.000031142663,0.0000038465128],"category_scores_gemma":[0.000020449821,0.000055950462,0.00002384751,0.000085099884,0.000013980784,0.0001326585,0.00008595894,0.000031797113,0.0000022797703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031570976,0.000049799484,0.00008391497,0.000010129679,0.0000087318585,6.8086615e-7,0.00023307872,0.8880599,0.00011106769,0.022531822,0.0019125082,0.086995214],"study_design_scores_gemma":[0.00011666576,0.000055190187,0.00005254107,0.000009656361,8.556364e-7,0.000008262012,0.0000038119415,0.9986505,0.00018778512,0.0003275511,0.00051232637,0.00007486463],"about_ca_topic_score_codex":0.0000019036011,"about_ca_topic_score_gemma":1.9607131e-7,"teacher_disagreement_score":0.8869527,"about_ca_system_score_codex":0.000016201702,"about_ca_system_score_gemma":0.0000012691758,"threshold_uncertainty_score":0.22815937},"labels":[],"label_agreement":null},{"id":"W2168814915","doi":"10.1109/ccece.1999.807239","title":"A tightly coupled hybrid SIMD/SISD system","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"SIMD; Computer science; Parallel computing; Latency (audio); Host (biology); Overhead (engineering); Low latency (capital markets); Instruction set; Operating system; Computer network; Telecommunications","score_opus":0.011494940577634208,"score_gpt":0.2263625361966868,"score_spread":0.2148675956190526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168814915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076889206,0.00005765985,0.9048436,0.000095487434,0.00017825338,0.000100715624,2.0198934e-7,0.001763917,0.092191234],"genre_scores_gemma":[0.6803684,0.000004379966,0.317972,0.00022954484,0.000013910355,0.000007603293,8.5579046e-7,0.000005543565,0.0013977163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990437,0.00008046144,0.00019490128,0.0002881014,0.00018076744,0.00021204469],"domain_scores_gemma":[0.99923736,0.000052757892,0.00006134983,0.0004791153,0.00008890257,0.00008050048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177331,0.00010929611,0.00013567627,0.00008201598,0.00012013029,0.00014855358,0.00050970854,0.000030521092,0.000013881879],"category_scores_gemma":[0.000031677002,0.00009265292,0.000050005863,0.00025982608,0.000015121185,0.00017302897,0.00007127496,0.00006480967,0.00016869816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015936495,0.00005876102,0.000133069,0.000024811794,0.00001679738,0.000021971691,0.00008726418,0.0051119407,0.0001511553,0.97024304,0.022869553,0.0012800539],"study_design_scores_gemma":[0.00018403985,0.00004794591,0.000032184085,0.000019472962,0.0000024433261,0.00006458259,0.00000965507,0.980382,0.004718023,0.0010622913,0.013286765,0.0001905923],"about_ca_topic_score_codex":0.000012959564,"about_ca_topic_score_gemma":7.469868e-7,"teacher_disagreement_score":0.9752701,"about_ca_system_score_codex":0.0000410325,"about_ca_system_score_gemma":0.000055973935,"threshold_uncertainty_score":0.37782764},"labels":[],"label_agreement":null},{"id":"W2169072909","doi":"10.1109/ccece.2007.133","title":"Fast Power Estimation for Automatic Instruction-Set Selection","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Instruction set; Selection (genetic algorithm); Set (abstract data type); Function (biology); Enumeration; Simple (philosophy); Power (physics); Block (permutation group theory); Probabilistic logic; Parallel computing; Artificial intelligence; Programming language; Mathematics","score_opus":0.012419537930027208,"score_gpt":0.28002728842994945,"score_spread":0.26760775049992225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169072909","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068219854,0.0000037663126,0.9877228,0.0001548068,0.00022159243,0.00019298,3.0462394e-7,0.0013930198,0.0034887455],"genre_scores_gemma":[0.3816595,4.1299472e-7,0.6179995,0.00010468735,0.000016731798,0.0000070329525,0.0000027865801,0.0000036339218,0.00020570576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999317,0.000013158344,0.00020310616,0.00018537602,0.00011787737,0.00016351214],"domain_scores_gemma":[0.9995412,0.00006977785,0.0000784721,0.00015097605,0.00011867797,0.000040882107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003982032,0.000075829266,0.00007333865,0.00015366277,0.00015358975,0.00009992861,0.0002053402,0.00005165912,0.000014057169],"category_scores_gemma":[0.000048216833,0.0000715488,0.0000349842,0.00035244954,0.000011458344,0.0003527459,0.00003321896,0.000044341807,0.000013464004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000114366385,0.00008778231,0.00068152515,0.000035955665,0.00002437242,8.2022467e-7,0.0009151261,0.053907137,0.0003967202,0.2824538,0.013681579,0.6478037],"study_design_scores_gemma":[0.00018769821,0.00007151006,0.0013370577,0.000006784214,0.0000015828435,0.0000166289,0.000009702222,0.9873758,0.0051796357,0.0050931456,0.0006236174,0.0000968652],"about_ca_topic_score_codex":0.000007664055,"about_ca_topic_score_gemma":0.000004177831,"teacher_disagreement_score":0.93346864,"about_ca_system_score_codex":0.000047299138,"about_ca_system_score_gemma":0.000026748732,"threshold_uncertainty_score":0.29176754},"labels":[],"label_agreement":null},{"id":"W2169295182","doi":"10.1109/iccd.2002.1106766","title":"Power-performance trade-offs for energy-efficient architectures: A quantitative study","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Department of Energy; University of Alberta; National Science Foundation","keywords":"Computer science; Energy consumption; Baseline (sea); Compiler; Integer programming; Parallel computing; Reduction (mathematics); Design space exploration; Software; Linear programming; Embedded system; Power (physics); Set (abstract data type); Integer (computer science); Computer architecture; Real-time computing; Computer engineering; Algorithm; Mathematics; Engineering; Operating system","score_opus":0.02082721021017792,"score_gpt":0.27858165189675055,"score_spread":0.25775444168657263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169295182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03850083,0.00005660609,0.9509625,0.0001222656,0.00014059874,0.0003566386,7.5369496e-7,0.000524231,0.009335564],"genre_scores_gemma":[0.6871707,0.00000192894,0.31232777,0.00022934306,0.000005009899,0.00005120476,4.4313916e-7,0.000006902401,0.00020671422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877256,0.00011483963,0.00023586587,0.00039657688,0.0002045207,0.00027564456],"domain_scores_gemma":[0.99922246,0.000178512,0.00007587303,0.00039725832,0.00005858952,0.00006728331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041693787,0.00015408493,0.0001625015,0.00014783962,0.00021308001,0.0000936017,0.0005228952,0.00003537667,0.000006907864],"category_scores_gemma":[0.00006750079,0.00012488558,0.000063990294,0.00038502968,0.000027420298,0.00005717146,0.000056915138,0.00007046077,0.000003486397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029202212,0.0010768474,0.000532975,0.000014125143,0.000053777065,0.0000038313747,0.0060439887,0.3097725,0.00008232115,0.6714704,0.002426583,0.008493446],"study_design_scores_gemma":[0.0006282408,0.0014245,0.0005357534,0.000012562317,0.0000041392673,0.000008946541,0.00018858127,0.98424214,0.0057090283,0.0019530917,0.0049913763,0.00030164016],"about_ca_topic_score_codex":0.000005799306,"about_ca_topic_score_gemma":0.0000028734203,"teacher_disagreement_score":0.67446965,"about_ca_system_score_codex":0.000024049965,"about_ca_system_score_gemma":0.00006009442,"threshold_uncertainty_score":0.50926864},"labels":[],"label_agreement":null},{"id":"W2169322540","doi":"10.1109/cgo.2006.16","title":"Experiences with Multi-threading and Dynamic Class Loading in a Java Just-In-Time Compiler","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"International Business Machines Corporation","keywords":"Computer science; Context switch; Profiling (computer programming); Java; Operating system; Java concurrency; Compiler; Embedded Java; Just-in-time compilation; Compile time; Multithreading; Cache; Correctness; Parallel computing; Thread (computing); Optimizing compiler; Embedded system; Programming language; Real time Java","score_opus":0.011975081157464797,"score_gpt":0.25448780897873546,"score_spread":0.24251272782127067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169322540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3758366,0.000067935565,0.6213845,0.00009914446,0.000020934394,0.00010643152,1.0635985e-7,0.00024054422,0.0022438036],"genre_scores_gemma":[0.7596965,0.000004281803,0.239831,0.000074768555,0.000004952182,0.000014690928,8.7280296e-7,0.0000049510877,0.00036801776],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989804,0.00004525136,0.00021877287,0.00035938504,0.00014337129,0.00025282227],"domain_scores_gemma":[0.99964285,0.0000627436,0.000055142962,0.00017963836,0.00002346557,0.000036176345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021622397,0.00012622462,0.00016792744,0.00024027251,0.0000663053,0.0001722447,0.00036044526,0.000048146816,0.0000074503987],"category_scores_gemma":[0.0000062387358,0.000104066145,0.000013288846,0.00045260062,0.000059790724,0.00033403272,0.00012971011,0.000096523334,0.000005849911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019824653,0.0023723135,0.5115845,0.00018971853,0.000050423583,0.0007019261,0.084898084,0.29578975,0.00589615,0.05787895,0.0033569552,0.037082955],"study_design_scores_gemma":[0.000425059,0.000048425896,0.006323626,0.00006333927,6.690968e-7,0.000015505482,0.00033172494,0.9918316,0.0006281469,0.00012099557,0.00003246774,0.00017843515],"about_ca_topic_score_codex":0.00023542634,"about_ca_topic_score_gemma":0.00022736493,"teacher_disagreement_score":0.6960419,"about_ca_system_score_codex":0.000050491613,"about_ca_system_score_gemma":0.00002158095,"threshold_uncertainty_score":0.42436942},"labels":[],"label_agreement":null},{"id":"W2169525139","doi":"10.5555/1995456.1995643","title":"On the scalability and dynamic load balancing of parallel Verilog simulations","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Verilog; Electronic circuit; Scalability; Bottleneck; Hardware description language; Parallel computing; Viterbi decoder; Embedded system; Decoding methods; Field-programmable gate array; Algorithm; Electrical engineering; Engineering","score_opus":0.010148384472246239,"score_gpt":0.2576905051664332,"score_spread":0.24754212069418696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169525139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07451286,0.000024472272,0.91945153,0.0019783417,0.000019639274,0.000094377276,4.9881425e-7,0.00017040498,0.0037478462],"genre_scores_gemma":[0.9079187,0.000005127952,0.09152914,0.0004770064,0.0000027143915,7.010763e-7,3.6948342e-7,0.0000011963489,0.000065060834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994437,0.000046558136,0.00013581732,0.00015910163,0.00012593591,0.00008886359],"domain_scores_gemma":[0.99929386,0.00023695051,0.000046769197,0.00033496742,0.00006401119,0.000023413952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022759981,0.00006015645,0.0000804827,0.00002781973,0.000090331545,0.00003555992,0.00025326962,0.000025949714,0.000007733055],"category_scores_gemma":[0.00010163379,0.000039607454,0.00002140819,0.0001619575,0.00003332553,0.00008214446,0.00005139987,0.00005640202,0.0000017982409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015263136,0.000185161,0.001451342,0.000009182882,0.000011193055,9.375528e-7,0.0006605909,0.3040976,0.00072790124,0.66076404,0.0014363544,0.030640448],"study_design_scores_gemma":[0.00007255426,0.00007122878,0.013569644,0.0000085850525,9.618024e-7,8.338587e-7,0.0000024640274,0.9351149,0.0002358648,0.05084367,0.000028355249,0.000050902538],"about_ca_topic_score_codex":0.000009263864,"about_ca_topic_score_gemma":0.000003392206,"teacher_disagreement_score":0.83340585,"about_ca_system_score_codex":0.000021730813,"about_ca_system_score_gemma":0.000025570518,"threshold_uncertainty_score":0.16151452},"labels":[],"label_agreement":null},{"id":"W2169665207","doi":"10.1145/1854273.1854350","title":"A case for NUMA-aware contention management on multicore systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Memory hierarchy; Non-uniform memory access; Scheduling (production processes); Distributed computing; Latency (audio); Uniform memory access; Multi-core processor; Interleaved memory; Flat memory model; Shared memory; Cache-only memory architecture; Parallel computing; Memory management; Operating system; Cache; Semiconductor memory","score_opus":0.032164231455030765,"score_gpt":0.28280447689886357,"score_spread":0.2506402454438328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169665207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036090086,0.000003857751,0.9897535,0.00015933652,0.00060698815,0.0005149694,0.0000016796391,0.0006812131,0.0046694563],"genre_scores_gemma":[0.77303135,0.0000013033922,0.22481401,0.00013534236,0.00003303103,0.00007677665,0.0000028817014,0.00000513256,0.0019001855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.000017390263,0.00014912355,0.0002466526,0.000098292985,0.00013985163],"domain_scores_gemma":[0.99937844,0.0000508781,0.00005631445,0.0003695553,0.00009726845,0.000047520916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019983175,0.000083670275,0.00008415056,0.00008418181,0.00013316631,0.0001668825,0.00028368758,0.000045223434,0.000003839243],"category_scores_gemma":[0.000012173739,0.000069516245,0.00004658999,0.00008884353,0.000010525098,0.00010571021,0.000072484494,0.00006729677,0.000016380802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012051863,0.00016500191,0.000059011905,0.00009185176,0.000031505464,0.0002731014,0.00015543909,0.005414066,0.00012331785,0.94734895,0.014799094,0.03152658],"study_design_scores_gemma":[0.00035163702,0.000073394556,0.00002266523,0.000017434773,0.000003655718,0.0001940003,0.00003443254,0.99498326,0.00037691373,0.00048984186,0.0033398974,0.00011285553],"about_ca_topic_score_codex":0.000029329582,"about_ca_topic_score_gemma":0.0000073469164,"teacher_disagreement_score":0.9895692,"about_ca_system_score_codex":0.000012737926,"about_ca_system_score_gemma":0.0000055909586,"threshold_uncertainty_score":0.283479},"labels":[],"label_agreement":null},{"id":"W2169698242","doi":"10.1109/ccece.1996.548053","title":"A configuration independent substation switching scheme","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Scheme (mathematics); Computer science; Power (physics); Electronic engineering; Electrical engineering; Engineering; Reliability engineering; Mathematics","score_opus":0.02668778411483964,"score_gpt":0.2470840240429578,"score_spread":0.22039623992811816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169698242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038401722,0.000036551875,0.96552485,0.000656468,0.000074609736,0.000076004995,5.6808073e-8,0.0007562333,0.02903504],"genre_scores_gemma":[0.7190831,0.000012345711,0.27987155,0.00029828068,0.000016745162,0.0000046792843,0.0000010777868,0.0000027933424,0.00070941274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993392,0.000031526768,0.0001502264,0.0001888025,0.00017362498,0.00011662617],"domain_scores_gemma":[0.9995916,0.000026443528,0.00006032222,0.00021385509,0.00006938877,0.00003838592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014298099,0.00006603821,0.00005895679,0.000084738705,0.000101573045,0.00017021345,0.00027213607,0.00003657433,0.00009574075],"category_scores_gemma":[0.00002280581,0.00006168743,0.000022624243,0.00020280645,0.000004901357,0.00044655812,0.00004371789,0.00006998656,0.000118798234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029074777,0.00018400374,0.0010951568,0.000013768627,0.000021670781,0.000012972356,0.003589767,0.006437696,0.0088911615,0.76897794,0.015488468,0.19528447],"study_design_scores_gemma":[0.00012148264,0.000020591047,0.00038795956,0.0000052317823,6.115354e-7,0.0000059886884,0.000008391403,0.9907424,0.0059604025,0.0018104585,0.000840643,0.000095860916],"about_ca_topic_score_codex":0.000013071217,"about_ca_topic_score_gemma":0.000002254751,"teacher_disagreement_score":0.98430467,"about_ca_system_score_codex":0.00002237842,"about_ca_system_score_gemma":0.000006823907,"threshold_uncertainty_score":0.25155404},"labels":[],"label_agreement":null},{"id":"W2169826316","doi":"10.1109/icess.2009.50","title":"On-Line and Off-Line DVS for Fixed Priority with Preemption Threshold Scheduling","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preemption; Dynamic voltage scaling; Computer science; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Earliest deadline first scheduling; Rate-monotonic scheduling; Dynamic priority scheduling; Fair-share scheduling; Power consumption; Energy consumption; Embedded system; Real-time computing; Parallel computing; Computer network; Power (physics); Operating system; Mathematical optimization; Engineering; Mathematics; Electrical engineering; Quality of service","score_opus":0.029138574616658596,"score_gpt":0.2919496921405179,"score_spread":0.26281111752385933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169826316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032923616,0.00006813553,0.96371806,0.0014571529,0.00003325268,0.00028049882,6.864334e-7,0.00055798417,0.00096062844],"genre_scores_gemma":[0.5116186,0.000017734359,0.48761752,0.00051957014,0.00003102302,0.0000045864294,0.0000027906888,0.000003065573,0.00018509016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.000013968639,0.00015096806,0.00032015418,0.00013403935,0.00016488436],"domain_scores_gemma":[0.9994288,0.00006351307,0.00006357758,0.00028233716,0.00010290835,0.000058847727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025165343,0.00011439659,0.00012807858,0.00007158889,0.00012702898,0.00011545963,0.00023298529,0.000052422387,0.0000019358326],"category_scores_gemma":[0.000032698117,0.000086500324,0.000024087636,0.0001544336,0.000018425904,0.00020893355,0.0000430255,0.000082895065,0.0000015049369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027308843,0.0005118011,0.0006746936,0.000045344168,0.00003142672,0.00000595911,0.00040773806,0.35404342,0.000590617,0.40588963,0.0017214868,0.23580477],"study_design_scores_gemma":[0.0005147278,0.0009850332,0.0004738805,0.000036449102,0.0000034666978,0.000005246538,0.0000017796717,0.9824889,0.0043060337,0.010892682,0.00015203153,0.00013981201],"about_ca_topic_score_codex":0.0000025635652,"about_ca_topic_score_gemma":0.0000030448741,"teacher_disagreement_score":0.62844545,"about_ca_system_score_codex":0.000014732949,"about_ca_system_score_gemma":0.000029509403,"threshold_uncertainty_score":0.35273808},"labels":[],"label_agreement":null},{"id":"W2169894728","doi":"10.1109/ccece.2003.1226363","title":"Embedded memory in system-on-chip design: architecture and prototype implementation","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Row; Embedded system; Computer hardware; Dram; Registered memory; Static random-access memory; Memory address; Interleaved memory; Memory architecture; Computer architecture; Semiconductor memory; Computer memory","score_opus":0.02027707478235733,"score_gpt":0.2864098201289212,"score_spread":0.26613274534656384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169894728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007929564,0.000018555651,0.98843366,0.00036138616,0.00003661429,0.00069809746,2.1009598e-7,0.00043788884,0.0020840287],"genre_scores_gemma":[0.60156727,0.0000018150366,0.39817244,0.00017355531,0.000010745424,0.00005023806,7.9095304e-7,0.0000037403506,0.000019425404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925464,0.00007862473,0.00016008686,0.00024220142,0.00012007917,0.00014438099],"domain_scores_gemma":[0.9996566,0.00003523162,0.000044638262,0.0002007583,0.000023374516,0.000039385577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027817357,0.000090917296,0.00009369171,0.00014871157,0.00006000601,0.00007786137,0.0002116823,0.000034924346,0.0000028771444],"category_scores_gemma":[0.000008499021,0.00007577352,0.000014149033,0.00022145947,0.000012727457,0.00010175648,0.00005978731,0.00007925916,0.0000060250914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093097005,0.00017392679,0.00057805574,0.00016443177,0.000023135184,0.00005757052,0.007833967,0.6008557,0.0009627931,0.26465175,0.0006105479,0.12399501],"study_design_scores_gemma":[0.010082294,0.0040779174,0.013909909,0.00083211495,0.000016374355,0.00032038198,0.0013780206,0.6717567,0.20475599,0.09052964,0.00030814993,0.0020325268],"about_ca_topic_score_codex":0.000050103718,"about_ca_topic_score_gemma":0.000012360419,"teacher_disagreement_score":0.5936377,"about_ca_system_score_codex":0.000050199524,"about_ca_system_score_gemma":0.000050331713,"threshold_uncertainty_score":0.30899543},"labels":[],"label_agreement":null},{"id":"W2170118092","doi":"10.1109/ispdc.2008.8","title":"The Shared Memory Hierarchy: The PRAM is as Powerful as the BSR","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"Hierarchy; Computer science; Massively parallel; Class (philosophy); Memory hierarchy; Shared memory; Parallel computing; Class hierarchy; Computation; Theoretical computer science; Supercomputer; Programming language; Artificial intelligence; Object-oriented programming","score_opus":0.01853789930171924,"score_gpt":0.264581022624197,"score_spread":0.2460431233224778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170118092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00485702,0.0008417803,0.5765515,0.095227905,0.00049955613,0.000686024,0.0000013476115,0.0014942047,0.31984067],"genre_scores_gemma":[0.7236516,0.0010563732,0.07055375,0.05322295,0.00035506824,0.00008279194,0.0000041555472,0.000042207368,0.15103109],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852383,0.00020729974,0.0002213157,0.00030825214,0.0004247646,0.0003145154],"domain_scores_gemma":[0.99794924,0.0005072287,0.000099504665,0.0012478417,0.00013645265,0.00005972417],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00066270074,0.00014805971,0.00010157871,0.00003429497,0.0014101546,0.00038122767,0.00271973,0.0000541802,0.000092232716],"category_scores_gemma":[0.00012519001,0.00006199279,0.000095992,0.00042805055,0.00023908769,0.00021288515,0.0005727314,0.00025814847,0.000453333],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018479279,0.00008351315,0.00015925078,0.0000037976922,0.00006747305,0.000030901538,0.011847965,0.0018179414,0.000042043717,0.1435974,0.81111497,0.031216301],"study_design_scores_gemma":[0.00035611223,0.0002526246,0.0014817198,0.0000241495,0.000009373065,0.00046065619,0.0002614107,0.3158756,0.0071628513,0.033258326,0.64038664,0.0004705531],"about_ca_topic_score_codex":0.00012957233,"about_ca_topic_score_gemma":0.000004538268,"teacher_disagreement_score":0.7187946,"about_ca_system_score_codex":0.000022923534,"about_ca_system_score_gemma":0.00016354263,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W2170284436","doi":"10.1109/spdp.1992.242729","title":"The Parallel Asynchronous Recursion model","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Recursion (computer science); Parallel computing; Asynchronous communication; Bulk synchronous parallel; Memory model; Parallel programming model; Theoretical computer science; Synchronization (alternating current); Merge (version control); Programming language; Computation; Model of computation; Abstraction; Semantics (computer science); Programming paradigm; Parallel algorithm; Shared memory","score_opus":0.0161722298235738,"score_gpt":0.24987274332803294,"score_spread":0.23370051350445914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170284436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009458269,0.00014987047,0.90791786,0.0006683565,0.00008680076,0.000067394765,5.674576e-8,0.00048245725,0.09053262],"genre_scores_gemma":[0.18344498,0.00011893296,0.8120333,0.0003793724,0.000007798368,0.000008042214,2.3593181e-7,0.0000044607095,0.004002882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992855,0.00006669767,0.00012866798,0.0001901199,0.00013520547,0.00019379573],"domain_scores_gemma":[0.9993257,0.000068868285,0.000041116407,0.00046318647,0.00005464204,0.00004646587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036008767,0.00007532935,0.000058405192,0.00002552488,0.00034203107,0.00015347401,0.000584643,0.000035400342,0.0000047073822],"category_scores_gemma":[0.00005073502,0.000047664325,0.000035808458,0.00015827142,0.00002576387,0.00013906174,0.000075778786,0.00007300495,0.00003481947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.1417596e-7,0.000015192711,0.0000152114,7.2072464e-7,0.0000023249677,5.621425e-7,0.00006210248,0.0976645,0.000009146457,0.881896,0.011177417,0.009155986],"study_design_scores_gemma":[0.00006956782,0.000019588455,0.0000089506175,0.0000021714318,5.9407597e-7,0.0000056578283,0.0000036532808,0.9277386,0.00060090184,0.05952673,0.011942833,0.00008073006],"about_ca_topic_score_codex":0.000002727128,"about_ca_topic_score_gemma":0.0000012710478,"teacher_disagreement_score":0.83007413,"about_ca_system_score_codex":0.000021452523,"about_ca_system_score_gemma":0.000058608653,"threshold_uncertainty_score":0.26306608},"labels":[],"label_agreement":null},{"id":"W2170517858","doi":"10.1109/ccece.2002.1013016","title":"Performance analysis of a dual processor workstation","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Workstation; x86; Personal computer; Computer performance; Speedup; Microarchitecture; Multithreading; Parallel computing; Fast Fourier transform; Computation; Supercomputer; Operating system; Computer architecture; Embedded system; Software","score_opus":0.014107848966715353,"score_gpt":0.25412239540991655,"score_spread":0.2400145464432012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170517858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054190546,0.000013840252,0.93117285,0.000031065178,0.000017240494,0.000034794466,1.1996823e-7,0.00015417994,0.014385356],"genre_scores_gemma":[0.7071541,0.000008248932,0.29250818,0.000039108407,0.0000013208629,0.0000025412191,9.2627823e-7,0.0000010536442,0.0002844976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.000026355556,0.00014007074,0.0001248725,0.00011463206,0.000078290774],"domain_scores_gemma":[0.9996018,0.000026284639,0.0000710043,0.00017691242,0.00010446535,0.000019538833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019446525,0.00004326143,0.00009518988,0.0002165149,0.00003508095,0.000024484238,0.00014918369,0.000020530972,0.000015939222],"category_scores_gemma":[0.000030060966,0.000037158134,0.00003450509,0.0015950903,0.000010928314,0.00017987014,0.000019466297,0.000025934538,0.0000023387556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007169812,0.0002221012,0.04678584,0.000044330052,0.00038872182,0.0000015567042,0.0020264303,0.66687214,0.00026654833,0.23938632,0.0013360558,0.042662792],"study_design_scores_gemma":[0.000049558577,0.000024888297,0.0051726988,0.0000037727089,0.000022292357,6.8114554e-7,0.000006282845,0.9886419,0.0056674597,0.00020111221,0.00015222223,0.000057090707],"about_ca_topic_score_codex":0.0000027244876,"about_ca_topic_score_gemma":0.0000011752585,"teacher_disagreement_score":0.6529636,"about_ca_system_score_codex":0.0000069625153,"about_ca_system_score_gemma":0.000027628892,"threshold_uncertainty_score":0.15152647},"labels":[],"label_agreement":null},{"id":"W2171072232","doi":"10.1109/ccece.2007.379","title":"Evaluating the Performance of CSB+-Trees on Multithreaded Architectures","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Speedup; Multithreading; Pentium; Parallel computing; Thread (computing); Simultaneous multithreading; Yarn; Operating system; Database","score_opus":0.04885380139131387,"score_gpt":0.3468582684587195,"score_spread":0.2980044670674056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171072232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45644575,0.000017132445,0.5388858,0.00017612682,0.000043998836,0.00007623571,7.519338e-8,0.0001799762,0.004174906],"genre_scores_gemma":[0.74578714,0.0000028069903,0.25372612,0.00028311342,0.000020781543,0.0000017553772,1.8975223e-7,0.0000026938937,0.00017539116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919504,0.00004347187,0.00018858051,0.0001595098,0.00025740103,0.00015599337],"domain_scores_gemma":[0.99914837,0.00028591545,0.00008829526,0.0003868861,0.00006672496,0.000023814782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081880233,0.00007609261,0.000078956866,0.000080133184,0.00011258484,0.000026852316,0.00061835017,0.000025790483,0.0000052966143],"category_scores_gemma":[0.00006352834,0.00004447873,0.00003419523,0.00023001473,0.000041625903,0.00003904947,0.000110559704,0.00009714316,0.0000059087074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048120066,0.00010186464,0.0051101935,0.000017067227,0.000018152467,0.000001209753,0.0017288327,0.4535379,0.0050853635,0.021919975,0.00039225083,0.51203907],"study_design_scores_gemma":[0.00011666835,0.00037588703,0.0105511695,0.000024884012,0.0000013679621,0.0000030927883,0.000011465383,0.8877858,0.10062486,0.00038074446,0.00004767926,0.00007637636],"about_ca_topic_score_codex":0.000027638067,"about_ca_topic_score_gemma":0.00001131628,"teacher_disagreement_score":0.51196265,"about_ca_system_score_codex":0.000009462491,"about_ca_system_score_gemma":0.000019186293,"threshold_uncertainty_score":0.18137899},"labels":[],"label_agreement":null},{"id":"W2171274268","doi":"10.1109/ipdps.2005.386","title":"Runtime Empirical Selection of Loop Schedulers on Hyperthreaded SMPs","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Thread (computing); Spec#; Scheduling (production processes); Multiprocessing; POSIX Threads; Benchmark (surveying); Speedup; Multi-core processor; Memory hierarchy; Operating system; Cache","score_opus":0.031724349110900954,"score_gpt":0.29526226254217647,"score_spread":0.26353791343127553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171274268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038258325,0.000015971818,0.9431351,0.0018559351,0.00004868543,0.00007431495,1.420534e-7,0.0006555933,0.015955964],"genre_scores_gemma":[0.5881697,0.00000552825,0.4102455,0.0007064199,0.00003545475,0.000002301942,6.179657e-7,0.0000041069675,0.0008303493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999216,0.0000410744,0.00018629378,0.00022847421,0.00018175493,0.00014636264],"domain_scores_gemma":[0.99952865,0.000047799345,0.00006237956,0.0002294183,0.00008373715,0.00004802697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015519696,0.00008762468,0.00011849058,0.00013213984,0.000059943053,0.000034629018,0.00033733653,0.000060565984,0.000046455192],"category_scores_gemma":[0.000027520191,0.000074951575,0.000047687594,0.00038345356,0.000023099425,0.0001713776,0.00006273711,0.00009027475,0.0000705523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009362327,0.0019132659,0.015553045,0.000037282152,0.00012275607,0.0000045450224,0.0011823679,0.29602247,0.008916679,0.18492818,0.11680715,0.37441862],"study_design_scores_gemma":[0.00021692026,0.0001737438,0.0013181018,0.000012749554,0.0000022921115,0.0000066952857,0.0000032194744,0.9053149,0.0894697,0.000360231,0.002984214,0.00013719373],"about_ca_topic_score_codex":0.000007936946,"about_ca_topic_score_gemma":0.000001992171,"teacher_disagreement_score":0.60929245,"about_ca_system_score_codex":0.000030805357,"about_ca_system_score_gemma":0.000038895923,"threshold_uncertainty_score":0.30564368},"labels":[],"label_agreement":null},{"id":"W2171356936","doi":"10.1145/1278480.1278663","title":"Automatic cache tuning for energy-efficiency using local regression modeling","year":2007,"lang":"en","type":"article","venue":"Proceedings - ACM IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid","keywords":"Speedup; Computer science; Benchmark (surveying); Cache; Design space exploration; Parallel computing; Cache-oblivious algorithm; Inference; Set (abstract data type); Algorithm; CPU cache; Power (physics); Space (punctuation); Instruction set; Energy (signal processing); Computer engineering; Cache algorithms; Artificial intelligence; Embedded system; Mathematics; Statistics","score_opus":0.10017936747282771,"score_gpt":0.31843908231090334,"score_spread":0.21825971483807563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171356936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083214035,0.000053318247,0.98830825,0.00014096969,0.0002484271,0.0004287926,6.0726893e-7,0.0022225862,0.00027563053],"genre_scores_gemma":[0.5206513,0.0000055185596,0.47915372,0.00008444981,0.000044521523,0.000024771687,0.0000018621027,0.000015626187,0.000018267552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974404,0.000041773696,0.0007149078,0.0006695861,0.0005332827,0.00060004997],"domain_scores_gemma":[0.9976883,0.000302601,0.00047495312,0.00038813677,0.0009781681,0.00016782046],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021500438,0.00032616622,0.00031904428,0.00047143563,0.0005673492,0.0005084241,0.0014859712,0.00020689722,0.000005830818],"category_scores_gemma":[0.0005476248,0.0003107955,0.00008794827,0.0008072081,0.00006503744,0.0011731064,0.00020652234,0.00017660564,0.000004126828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054971086,0.00024174625,0.000071578135,0.00034503586,0.0000464737,0.000007447298,0.0055134986,0.39073354,0.07180504,0.12280988,0.0010057811,0.407365],"study_design_scores_gemma":[0.0002828627,0.000093914336,0.0000070063847,0.00030819664,0.0000135120545,0.000027585455,0.00009359783,0.9384429,0.04603276,0.014310346,0.000022658158,0.00036466648],"about_ca_topic_score_codex":0.000020547708,"about_ca_topic_score_gemma":6.4643854e-7,"teacher_disagreement_score":0.54770935,"about_ca_system_score_codex":0.00020761866,"about_ca_system_score_gemma":0.00026373088,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W2172293999","doi":"10.1145/378580.378604","title":"Automatable verification of sequential consistency","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Undecidable problem; Sequential consistency; Computer science; Consistency model; Consistency (knowledge bases); Decidability; Class (philosophy); Protocol (science); Task (project management); Theoretical computer science; State (computer science); Formal verification; Finite-state machine; Model checking; Programming language; Multiprocessing; Parallel computing; Artificial intelligence; Correctness","score_opus":0.02604205129317929,"score_gpt":0.2713485114170733,"score_spread":0.24530646012389398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172293999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027003828,0.00003320107,0.9443847,0.0001970928,0.000065996304,0.00004430793,1.9003365e-7,0.0004922716,0.05208184],"genre_scores_gemma":[0.6286163,0.00002173402,0.3704719,0.00006656469,0.000007952759,0.0000020269017,0.000001399703,0.0000017019898,0.0008104434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952656,0.000023539043,0.00014824589,0.00012524624,0.000094536575,0.00008184563],"domain_scores_gemma":[0.99952126,0.000016729378,0.00006136139,0.00029701515,0.000081032435,0.000022618953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013079295,0.000041160492,0.00006672244,0.00005563969,0.000042066127,0.000028499171,0.00030403523,0.000024284633,0.000034756304],"category_scores_gemma":[0.000015174869,0.000038210957,0.000023730576,0.00023664255,0.000021145628,0.000177805,0.0000596676,0.000023687355,0.000016623731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056584295,0.00015352109,0.0020967987,0.000017316981,0.000017336619,0.0000060651496,0.00029308177,0.0052120835,0.006112268,0.9346283,0.011622018,0.039835557],"study_design_scores_gemma":[0.00018331167,0.000054510998,0.0016224328,0.000012796871,0.000002890135,0.00002858712,0.000007888462,0.9480763,0.035354156,0.005524391,0.008996697,0.00013602042],"about_ca_topic_score_codex":0.000035412184,"about_ca_topic_score_gemma":8.463829e-7,"teacher_disagreement_score":0.94286424,"about_ca_system_score_codex":0.00000908427,"about_ca_system_score_gemma":0.000037290585,"threshold_uncertainty_score":0.15581977},"labels":[],"label_agreement":null},{"id":"W2173057405","doi":"10.1002/cpe.848","title":"Run‐time evaluation of opportunities for object inlining in Java","year":2005,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Just-in-time compilation; Compiler; Programming language; Object (grammar); Pointer (user interface); Object code; Speedup; Benchmark (surveying); Parallel computing; Operating system; Key (lock)","score_opus":0.1108328471571171,"score_gpt":0.3907268302496824,"score_spread":0.2798939830925653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173057405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117904656,0.001327149,0.8777024,0.0009798124,0.0000820605,0.00027458408,0.0000013725943,0.00007234263,0.0016555787],"genre_scores_gemma":[0.89819956,0.0002376898,0.10124896,0.00022305395,0.00002101357,0.000045681656,0.000004748405,0.00000293718,0.000016359432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989738,0.00015590996,0.00030612448,0.00024301762,0.00020688544,0.000114281465],"domain_scores_gemma":[0.9988164,0.00048242207,0.0002133589,0.00009825761,0.0003499627,0.00003964023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014873,0.00008858331,0.00013284717,0.00012185934,0.000103662685,0.000085784945,0.00013207375,0.000040568855,0.000002970341],"category_scores_gemma":[0.000450109,0.00009202302,0.00001586201,0.00016505306,0.000065537715,0.001336834,0.00006573534,0.000061070205,6.2537697e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017272589,0.000068154186,0.00014399446,0.000020609034,0.0000059768304,6.1045876e-7,0.016318938,0.00872726,0.000095874755,0.010509713,0.00014584747,0.96394575],"study_design_scores_gemma":[0.00049223634,0.00010585683,0.00030838375,0.000048950853,0.0000099023255,0.000010972172,0.001496112,0.993881,0.0005751143,0.0013872106,0.0015641525,0.00012010107],"about_ca_topic_score_codex":0.000008863289,"about_ca_topic_score_gemma":9.502831e-7,"teacher_disagreement_score":0.98515373,"about_ca_system_score_codex":0.000016480888,"about_ca_system_score_gemma":0.00011002968,"threshold_uncertainty_score":0.37525898},"labels":[],"label_agreement":null},{"id":"W2173524761","doi":"10.1109/models.2015.7338231","title":"Incremental symbolic execution of evolving state machines","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Memoization; Computer science; IBM; Symbolic execution; State (computer science); Dependency (UML); Programming language; Abstract state machines; Extended finite-state machine; Finite-state machine; Theoretical computer science; Parallel computing; Software engineering; Software","score_opus":0.023363113363971576,"score_gpt":0.2707334696336993,"score_spread":0.24737035626972775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173524761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02555443,0.0000745467,0.9546714,0.00010157005,0.000083225044,0.00005540262,4.2195356e-7,0.00036765865,0.019091355],"genre_scores_gemma":[0.74078137,0.000004544788,0.25891188,0.000064399406,0.000009299851,0.000001470746,9.838933e-7,0.0000023499938,0.00022368514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940604,0.00004079859,0.00015742773,0.00012797107,0.00016806462,0.00009967929],"domain_scores_gemma":[0.99954325,0.000015745503,0.00006674999,0.0001996432,0.00012045103,0.00005418471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027697597,0.000059134218,0.00008405228,0.000084180836,0.000029074818,0.000040689414,0.0003267707,0.000017017646,0.0000073799793],"category_scores_gemma":[0.00003231216,0.000051051164,0.000021654929,0.00019806744,0.000016832575,0.00026349557,0.00017912604,0.000034418197,0.000008454492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006641191,0.0009797197,0.061699636,0.00013715043,0.00015418882,0.000027897153,0.016376087,0.07013981,0.020998593,0.30011615,0.23757,0.29173434],"study_design_scores_gemma":[0.00018487671,0.00006914349,0.0016568928,0.000012284104,0.0000012583124,0.0000056643244,0.000014065717,0.97408426,0.017253198,0.006419616,0.00020216775,0.000096573],"about_ca_topic_score_codex":0.00016488422,"about_ca_topic_score_gemma":0.0000033613885,"teacher_disagreement_score":0.90394443,"about_ca_system_score_codex":0.000024767078,"about_ca_system_score_gemma":0.00003873242,"threshold_uncertainty_score":0.2081806},"labels":[],"label_agreement":null},{"id":"W2174359188","doi":"10.1109/pacrim.2015.7334827","title":"GPU design space exploration: NN-based models","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Outlier; General-purpose computing on graphics processing units; Design space exploration; Filter (signal processing); Power (physics); Artificial neural network; Anomaly detection; Efficient energy use; Artificial intelligence; Computer engineering; Algorithm; Graphics; Embedded system; Computer vision; Computer graphics (images)","score_opus":0.15036252425974345,"score_gpt":0.2874393477079117,"score_spread":0.13707682344816824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174359188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010504773,0.000041714626,0.9783237,0.0027370616,0.000118947384,0.0001197696,1.01573264e-7,0.0013435885,0.017304605],"genre_scores_gemma":[0.14226761,0.000002888401,0.8560517,0.0006615829,0.000027520517,0.000014201472,0.0000012324818,0.0000055948167,0.0009676674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991541,0.00009749623,0.0001324887,0.00023691224,0.00022774847,0.00015124929],"domain_scores_gemma":[0.99917364,0.00005415604,0.00004827254,0.00041397323,0.00018860832,0.000121372745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041867056,0.000093238465,0.000090154754,0.00008439714,0.00006280599,0.00016322767,0.0005050637,0.000043199405,0.000004990362],"category_scores_gemma":[0.000031457443,0.0000825248,0.000026255802,0.00031005716,0.000016094533,0.000739831,0.00007950698,0.00005246427,0.000055512188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027354727,0.000020864496,0.0000033299752,8.6659395e-7,0.0000014287556,0.0000020538794,0.0002003136,0.8892057,0.000006754083,0.07263216,0.03665369,0.001270088],"study_design_scores_gemma":[0.0001767626,0.00006884459,7.7217715e-7,0.0000048643255,8.6290856e-7,0.0000014963142,0.00000944497,0.9475815,0.004871616,0.045797538,0.0013714063,0.00011484563],"about_ca_topic_score_codex":0.000013631866,"about_ca_topic_score_gemma":7.0163645e-7,"teacher_disagreement_score":0.14225711,"about_ca_system_score_codex":0.000032435113,"about_ca_system_score_gemma":0.0001675281,"threshold_uncertainty_score":0.33652636},"labels":[],"label_agreement":null},{"id":"W2175048909","doi":"10.1145/2814328","title":"Challenges of memory management on modern NUMA systems","year":2015,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Memory management; Parallel computing; Operating system; Semiconductor memory","score_opus":0.13959955195808882,"score_gpt":0.3239424250193529,"score_spread":0.18434287306126407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175048909","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003397578,0.023589866,0.39803037,0.084782995,0.0006964738,0.0012345784,0.0000057730826,0.0007548126,0.48750755],"genre_scores_gemma":[0.7349779,0.00053276215,0.26430193,0.000033574324,0.0000041591156,0.000014599842,5.211499e-7,0.000003554341,0.00013097863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992671,0.00018679866,0.00019690135,0.00010483474,0.0001783379,0.000066050976],"domain_scores_gemma":[0.97727686,0.00011043854,0.00017862204,0.022272078,0.00013786748,0.000024118097],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00045365494,0.000056758192,0.00010649512,0.0000682677,0.000066826615,0.0000148521085,0.024361784,0.000025560299,1.2769578e-7],"category_scores_gemma":[0.0004236851,0.00004312387,0.000041002502,0.00016206784,0.00007288683,0.00006671922,0.012673387,0.00006862117,0.000003902838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052667788,0.00030480322,0.000059671547,0.000064984306,0.00005704749,1.6178647e-7,0.002646209,0.06141783,0.00003357352,0.89034075,0.019471912,0.025597788],"study_design_scores_gemma":[0.00049646915,0.00012673598,0.0011573954,0.0004531929,0.00002075226,0.00000556235,0.0005143758,0.6295427,0.0022448984,0.3609644,0.004258413,0.00021507805],"about_ca_topic_score_codex":0.000014225532,"about_ca_topic_score_gemma":0.0000015661202,"teacher_disagreement_score":0.7315803,"about_ca_system_score_codex":0.0000229231,"about_ca_system_score_gemma":0.000020873085,"threshold_uncertainty_score":0.9953119},"labels":[],"label_agreement":null},{"id":"W21752106","doi":"10.1111/j.1365-2958.2011.07761.x","title":"Hardware microinformático: viaje a las profundidades del PC","year":2000,"lang":"en","type":"article","venue":"Dialnet (Universidad de la Rioja)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Art","score_opus":0.008256587243021127,"score_gpt":0.23615098561689266,"score_spread":0.22789439837387154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21752106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08224744,0.00021093858,0.7397612,0.0010957243,0.000121875884,0.0003318556,0.0000110209885,0.0018512957,0.17436868],"genre_scores_gemma":[0.6498872,0.00019417355,0.33594957,0.0012463655,0.00009004871,0.000011723274,0.000022334001,0.00003230897,0.0125662675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998672,0.00013277095,0.0001718287,0.00037181764,0.00022402097,0.0004275329],"domain_scores_gemma":[0.99902594,0.00013369785,0.000085736894,0.00051611516,0.00007100381,0.00016749736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028652773,0.00019762566,0.00020114412,0.00022973857,0.00028142415,0.00035569887,0.0010655192,0.0001693674,0.00021937134],"category_scores_gemma":[0.000027904123,0.00021678259,0.0001134186,0.000593288,0.00010210079,0.0006632989,0.00017133552,0.00022742781,0.00022799242],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018651037,0.0006477935,0.0062721027,0.00013934044,0.00024323704,0.00076076435,0.01740071,0.033464007,0.0015836965,0.2960263,0.18449979,0.45877576],"study_design_scores_gemma":[0.002319907,0.00033944068,0.012076422,0.000171293,0.00004906751,0.0002869357,0.00023698003,0.5268769,0.0052612005,0.015464831,0.435428,0.001488984],"about_ca_topic_score_codex":0.0001246661,"about_ca_topic_score_gemma":0.000010585947,"teacher_disagreement_score":0.56763977,"about_ca_system_score_codex":0.00011156718,"about_ca_system_score_gemma":0.00016767913,"threshold_uncertainty_score":0.8840138},"labels":[],"label_agreement":null},{"id":"W2175443198","doi":"","title":"A case for NUMA-aware contention management on multicore systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Memory hierarchy; Multi-core processor; Non-uniform memory access; Scheduling (production processes); Uniform memory access; Shared memory; Distributed computing; Cache-only memory architecture; Interleaved memory; Flat memory model; Parallel computing; Memory management; Memory controller; Operating system; Cache; Semiconductor memory","score_opus":0.09141423489280852,"score_gpt":0.2782868616391393,"score_spread":0.18687262674633076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175443198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007551135,0.000010260394,0.9836111,0.000031728534,0.0002524795,0.00050170923,0.000001276251,0.0006643798,0.014171942],"genre_scores_gemma":[0.7400507,0.0000028546913,0.25798437,0.000117307914,0.000013306699,0.0000802275,0.0000018071572,0.000005016365,0.0017444751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993542,0.000025945592,0.00015647756,0.00023967974,0.000084457475,0.00013922743],"domain_scores_gemma":[0.9994682,0.00002640277,0.000059512855,0.00031877274,0.00008475179,0.000042369447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626912,0.00008350633,0.0000862404,0.00008604807,0.000105613944,0.00007438557,0.00026835012,0.000032624786,0.000005095579],"category_scores_gemma":[0.000005668341,0.000069410366,0.000047051606,0.000088357156,0.000008774065,0.00011128656,0.00007348181,0.000029433402,0.000018930756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002722401,0.00026090603,0.0000867692,0.000121042234,0.000054711876,0.0005174867,0.00077209726,0.0023156141,0.000006021579,0.95954645,0.011763428,0.024528248],"study_design_scores_gemma":[0.0004079844,0.00016959684,0.00004625825,0.00003935091,0.000006094883,0.00016251674,0.000110693145,0.99683195,0.00036454693,0.0009056574,0.00081616285,0.00013917357],"about_ca_topic_score_codex":0.00006045557,"about_ca_topic_score_gemma":0.0000021361645,"teacher_disagreement_score":0.9945164,"about_ca_system_score_codex":0.000022588934,"about_ca_system_score_gemma":0.0000042602687,"threshold_uncertainty_score":0.28304726},"labels":[],"label_agreement":null},{"id":"W2176959691","doi":"10.1109/micro.1992.697015","title":"Exploiting Instruction-level Parallelism: The Multithreaded Approach","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Very long instruction word; Parallel computing; Instruction set; Locality; Parallelism (grammar); Instruction-level parallelism; Instructions per cycle; Architecture; Multithreading; Computer architecture; Set (abstract data type); Data parallelism; Thread (computing); Programming language; Operating system; Central processing unit","score_opus":0.053527985408140584,"score_gpt":0.2632989498562679,"score_spread":0.20977096444812732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176959691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018363107,0.000044046064,0.9661395,0.0019824947,0.00008228029,0.00012666131,2.7320914e-7,0.0009506837,0.028837783],"genre_scores_gemma":[0.34923437,0.000012130305,0.6490307,0.00071253616,0.000114013405,0.000019041725,0.0000013857292,0.000005172263,0.0008706987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990252,0.00005819795,0.00021603657,0.00028421005,0.00019876302,0.0002175739],"domain_scores_gemma":[0.9992645,0.00005753478,0.000076300144,0.0004810061,0.00007225739,0.000048444104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002830646,0.00011553234,0.00009873724,0.00006296919,0.00029622484,0.00018726867,0.00087993476,0.000048834074,0.000011826596],"category_scores_gemma":[0.000031686443,0.00007658233,0.000051591247,0.00029260945,0.00004278894,0.00043506606,0.00020813661,0.00014119291,0.000042593452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045644797,0.00015688532,0.00034222924,0.000008913097,0.000031646152,0.0000013689072,0.003149887,0.14002287,0.000114325834,0.43373725,0.017084187,0.4053459],"study_design_scores_gemma":[0.00024619466,0.000010569469,0.00047604745,0.0000045957686,0.0000017181845,0.000033311106,0.000082996725,0.98835397,0.0012825894,0.0011797411,0.008174667,0.0001536065],"about_ca_topic_score_codex":0.000028139732,"about_ca_topic_score_gemma":0.0000033312426,"teacher_disagreement_score":0.8483311,"about_ca_system_score_codex":0.00002602456,"about_ca_system_score_gemma":0.00002730063,"threshold_uncertainty_score":0.31229365},"labels":[],"label_agreement":null},{"id":"W2177293824","doi":"10.1109/pacrim.2015.7334858","title":"Investigating the effects of store value locality on processor power","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Workload; Computer science; Locality; Power (physics); Value (mathematics); Locality of reference; Dissipation; Work (physics); Microarchitecture; Real-time computing; Embedded system; Parallel computing; Engineering; Operating system","score_opus":0.02188288722295291,"score_gpt":0.2728214091992591,"score_spread":0.25093852197630623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177293824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025219811,0.000050478953,0.96250755,0.00093848776,0.0001391588,0.00016784291,1.07680144e-7,0.00035577468,0.010620766],"genre_scores_gemma":[0.88746506,8.3569876e-7,0.11089322,0.0014464982,0.000013645841,0.000006803262,2.348095e-7,0.000003610704,0.00017007728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992245,0.000115339826,0.00013701085,0.00016470785,0.0002489048,0.000109578315],"domain_scores_gemma":[0.9991018,0.00019979886,0.00008937881,0.000363634,0.00017972782,0.0000656605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049543416,0.000073432006,0.00009168675,0.000030891584,0.00005692298,0.00004151707,0.0005804776,0.000032774355,6.675775e-7],"category_scores_gemma":[0.0007351924,0.000043986845,0.000024352821,0.00026193427,0.000058558067,0.00010119882,0.00014445143,0.00008587875,0.0000058209184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010218756,0.00035846847,0.0050863773,0.0002652084,0.000045525478,0.0000059893846,0.011304903,0.062294967,0.0006171553,0.82953084,0.07292465,0.017555706],"study_design_scores_gemma":[0.0005534899,0.0008147579,0.0023161767,0.00022876365,0.0000061518763,0.0000057026227,0.00008503059,0.84075844,0.10971997,0.043715455,0.0014884426,0.00030761398],"about_ca_topic_score_codex":0.00002586324,"about_ca_topic_score_gemma":5.265447e-7,"teacher_disagreement_score":0.86224526,"about_ca_system_score_codex":0.000018807035,"about_ca_system_score_gemma":0.00008365572,"threshold_uncertainty_score":0.17937315},"labels":[],"label_agreement":null},{"id":"W21782772","doi":"10.1016/j.cgh.2011.07.007","title":"A Composable Model for Analyzing Locality of Multi-threaded Programs","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research","keywords":"Computer science; Thread (computing); Interleaving; Locality; Parallel computing; Cache; Scalability; Cache invalidation; Distributed computing; CPU cache; Locality of reference; Operating system; Cache algorithms","score_opus":0.06524775815578802,"score_gpt":0.31818746300600587,"score_spread":0.25293970485021783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21782772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067455333,0.000035765228,0.9976969,0.00026703757,0.000014000103,0.00025722358,5.862273e-7,0.00050617236,0.00054779166],"genre_scores_gemma":[0.4692671,0.0000018843175,0.5305099,0.00009194092,0.0000032665907,0.0000047483986,0.0000020810032,0.000001618622,0.00011750157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925214,0.000019432931,0.0002320492,0.00022282737,0.00009666534,0.00017689164],"domain_scores_gemma":[0.99937505,0.000025089748,0.00008743613,0.00031245532,0.0001529082,0.00004706451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027201747,0.00008614196,0.00016704315,0.0000583092,0.000061214254,0.000051669223,0.0004550693,0.000042572563,4.598411e-7],"category_scores_gemma":[0.000012216566,0.000072444214,0.00007579891,0.00023349668,0.00002179355,0.0001563999,0.00005105255,0.000040889303,7.1056036e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002244589,0.0008482686,0.0007361142,0.000041940453,0.000023588846,6.4195706e-7,0.00065671635,0.66205263,0.0009364202,0.171045,0.0012087316,0.16242751],"study_design_scores_gemma":[0.0002451548,0.00009363546,0.000055330525,0.000013370654,0.0000026195128,6.935374e-7,0.0000023402358,0.9869102,0.0055887583,0.0069646607,0.0000321778,0.00009102916],"about_ca_topic_score_codex":0.0000128849615,"about_ca_topic_score_gemma":0.0000021118874,"teacher_disagreement_score":0.46859252,"about_ca_system_score_codex":0.000013919992,"about_ca_system_score_gemma":0.0000339445,"threshold_uncertainty_score":0.29541892},"labels":[],"label_agreement":null},{"id":"W2179096730","doi":"10.1109/hpcc-css-icess.2015.145","title":"Rethinking Prefetching in GPGPUs: Exploiting Unique Opportunities","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Instruction prefetch; Thread (computing); Parallel computing; Operating system; Speculative multithreading; Software; Multithreading; Address space; Block (permutation group theory); Embedded system; Cache","score_opus":0.17355046586148587,"score_gpt":0.29673746172261894,"score_spread":0.12318699586113308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179096730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013291249,0.00005487322,0.9164397,0.0009478288,0.000105977626,0.0000814099,9.287776e-8,0.0011406328,0.06793821],"genre_scores_gemma":[0.5695812,0.000018399624,0.4292991,0.00057428144,0.00002469759,0.00000778387,0.0000012122931,0.000006568202,0.00048673936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890786,0.00014952733,0.0002634932,0.00024529322,0.00020686098,0.00022693985],"domain_scores_gemma":[0.9993183,0.00008433727,0.00008031523,0.00032186948,0.00009625654,0.00009892345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011865603,0.000105410334,0.0001287205,0.00020967583,0.00006676242,0.00018547432,0.00061792164,0.000059388854,0.0000031703485],"category_scores_gemma":[0.00012858759,0.00010075576,0.00002440475,0.00026814686,0.000018466666,0.00071602373,0.00032246095,0.00017495593,0.000005369428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074225713,0.00009187205,0.0027409168,0.000027034637,0.000010945986,0.00012453755,0.03739499,0.0371409,0.000106162704,0.850142,0.0058413763,0.06637185],"study_design_scores_gemma":[0.0003137118,0.00006404267,0.00010799538,0.00014749831,0.0000011112483,0.000028485223,0.0008091207,0.82591975,0.002049641,0.16806038,0.002159439,0.0003388086],"about_ca_topic_score_codex":0.00013067311,"about_ca_topic_score_gemma":0.000017110242,"teacher_disagreement_score":0.7887789,"about_ca_system_score_codex":0.000066442335,"about_ca_system_score_gemma":0.00013292837,"threshold_uncertainty_score":0.41087008},"labels":[],"label_agreement":null},{"id":"W2182016073","doi":"10.5555/3241639.3241642","title":"Collection-focused parallelism","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Parallelism (grammar); Data parallelism; Implicit parallelism; Task parallelism; Disjoint sets; Correctness; Synchronization (alternating current); Parallel computing; Scheduling (production processes); Overhead (engineering); Programmer; Programming language","score_opus":0.013245137226837024,"score_gpt":0.23043821757715413,"score_spread":0.21719308035031712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182016073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008825454,0.000018713637,0.9042679,0.0016304782,0.00010854593,0.00012671216,3.0306023e-8,0.0012197989,0.09174529],"genre_scores_gemma":[0.25168437,0.000009008329,0.73725796,0.0009588121,0.000025841822,0.000040012,5.254891e-7,0.0000044926815,0.010019007],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993912,0.000029848947,0.00012659005,0.00018902915,0.00011190762,0.00015144698],"domain_scores_gemma":[0.99946964,0.00003684365,0.000033163305,0.00030393247,0.00009668056,0.000059767077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075207965,0.00007052877,0.00007605656,0.0000793043,0.000116944226,0.00019877838,0.00045095562,0.000037868293,0.00015669623],"category_scores_gemma":[0.000017281633,0.000059240185,0.000031823405,0.00033449417,0.000013280229,0.0003455839,0.00010351018,0.00005369173,0.00046864807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0704725e-7,0.00007323415,0.00051670446,0.000003635095,0.000014689953,0.0000012864919,0.0003376193,0.0022615702,0.00015236772,0.15881135,0.7818161,0.056010514],"study_design_scores_gemma":[0.0002621592,0.000063676554,0.0023800414,0.0000052905993,0.000001092691,0.00001010387,0.0000059646177,0.9448504,0.0037044806,0.030220293,0.01824649,0.00025004792],"about_ca_topic_score_codex":0.00014058784,"about_ca_topic_score_gemma":0.0000019460256,"teacher_disagreement_score":0.9425888,"about_ca_system_score_codex":0.00001570501,"about_ca_system_score_gemma":0.000025281328,"threshold_uncertainty_score":0.60236794},"labels":[],"label_agreement":null},{"id":"W2182477665","doi":"10.22215/etd/2010-09080","title":"Asymmetrical load-balancing for incremental fast fourier transform on multi-core processors","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Core (optical fiber); Parallel computing; Arithmetic; Mathematics; Telecommunications","score_opus":0.024200560910785606,"score_gpt":0.30639504205838847,"score_spread":0.28219448114760287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182477665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026212267,0.000045207704,0.976036,0.00013660212,0.00075379654,0.0009429835,0.000010263381,0.0008792418,0.01857469],"genre_scores_gemma":[0.08969618,0.000025929692,0.89254856,0.00044775725,0.00019168714,0.0002634672,0.00042234542,0.0000651815,0.016338866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978376,0.000016772072,0.0004464423,0.00070930406,0.00058912986,0.00040075867],"domain_scores_gemma":[0.9987118,0.00012588206,0.00022673013,0.00041765333,0.00039133496,0.00012660061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041078916,0.00037543126,0.00036434142,0.0003810671,0.00026389663,0.0002181025,0.0009396044,0.00048827697,0.000015041985],"category_scores_gemma":[0.00016659807,0.00032922925,0.00019819637,0.0005072576,0.000017400038,0.0002260329,0.000036758076,0.0005470817,0.000017565926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045881298,0.0016567399,0.0002249099,0.0010951997,0.00023437165,0.000018950172,0.0072674053,0.0017704628,0.001910319,0.03665934,0.024379482,0.924324],"study_design_scores_gemma":[0.0015582918,0.00054848887,0.00031518826,0.00023960916,0.000033963042,0.0000067443116,0.00014158602,0.927683,0.06028351,0.0014115159,0.0067464574,0.0010316381],"about_ca_topic_score_codex":0.000046483743,"about_ca_topic_score_gemma":0.00020942617,"teacher_disagreement_score":0.92591256,"about_ca_system_score_codex":0.0001403773,"about_ca_system_score_gemma":0.00030267605,"threshold_uncertainty_score":0.99991596},"labels":[],"label_agreement":null},{"id":"W2184676575","doi":"","title":"Real-time Musical Applications on an Experimental Operating System for Multi-Core Processors","year":2011,"lang":"en","type":"article","venue":"The Journal of the Abraham Lincoln Association","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Exploit; Digital signal processing; Multi-core processor; Computer architecture; Isolation (microbiology); Parallelism (grammar); Embedded system; Distributed computing; Operating system; Parallel computing; Computer hardware","score_opus":0.046783743554921695,"score_gpt":0.3111508142212766,"score_spread":0.2643670706663549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184676575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2516728,0.00003447124,0.74455106,0.0005354035,0.00044622197,0.0012127208,0.0000051319125,0.0002898065,0.0012523644],"genre_scores_gemma":[0.84342766,0.0000052152977,0.1558551,0.0001335904,0.00025013415,0.00004217218,0.0000010124178,0.000013159953,0.00027194739],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986809,0.00026631105,0.00042314254,0.00012842908,0.00033893387,0.00016231481],"domain_scores_gemma":[0.99799436,0.00019878978,0.0010435112,0.00033848203,0.00037150196,0.000053337826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020161248,0.000109042,0.00016836965,0.000059739155,0.0005350969,0.00008898929,0.0011079222,0.00007862963,0.0000017473037],"category_scores_gemma":[0.00014222624,0.000064984524,0.00010647114,0.00023323686,0.000018641336,0.00031311592,0.00010519659,0.00017684218,0.0000060188268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001199141,0.012922009,0.011140768,0.00039398743,0.0014258526,0.0000118458765,0.23087154,0.20163974,0.309987,0.16461818,0.028557252,0.037232656],"study_design_scores_gemma":[0.0012175355,0.0007875154,0.003891895,0.00016982343,0.000068246416,0.00003567952,0.0007370351,0.91856146,0.07317655,0.0008257883,0.00025334116,0.00027511638],"about_ca_topic_score_codex":0.00001508721,"about_ca_topic_score_gemma":0.0000018129894,"teacher_disagreement_score":0.71692175,"about_ca_system_score_codex":0.0003746207,"about_ca_system_score_gemma":0.000094966774,"threshold_uncertainty_score":0.4115587},"labels":[],"label_agreement":null},{"id":"W2189035983","doi":"10.1007/s11227-015-1575-9","title":"Tuning framework for stencil computation in heterogeneous parallel platforms","year":2015,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Stencil; Computer science; Computation; Parallel computing; Flexibility (engineering); Computational science; Supercomputer; Computer engineering; Algorithm","score_opus":0.07174342816708904,"score_gpt":0.3080689272630681,"score_spread":0.23632549909597908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189035983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12981395,0.00036132298,0.86881167,0.00040985976,0.0003213329,0.00014437226,2.673659e-7,0.00007681142,0.000060431717],"genre_scores_gemma":[0.52717835,0.000010815677,0.4725311,0.00016169083,0.00010648055,7.982025e-7,4.839846e-7,0.000007453704,0.0000028156242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842906,0.000109945875,0.0006626184,0.00013918722,0.00036401316,0.0002951615],"domain_scores_gemma":[0.99824065,0.0007011928,0.00035147983,0.00020786263,0.00039004817,0.0001087399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029905487,0.00014329185,0.00027140786,0.00020134888,0.00014932046,0.00011600626,0.0009686798,0.00008011805,4.9897324e-7],"category_scores_gemma":[0.0003243511,0.0001003958,0.00009402664,0.0003771632,0.000037657755,0.0004303152,0.00018493738,0.0003368824,0.0000020050966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004810246,0.00003861091,0.0005033095,0.000009247487,0.00001593159,0.000011049738,0.005294177,0.9762883,0.000024197336,0.0036304707,0.00025056247,0.0138860075],"study_design_scores_gemma":[0.00060148427,0.00026675043,0.00020352489,0.0001586094,0.0000071423574,0.0003063279,0.00035463792,0.9361529,0.00016506908,0.061567612,0.00007866236,0.00013728476],"about_ca_topic_score_codex":0.00001566619,"about_ca_topic_score_gemma":0.0000022366428,"teacher_disagreement_score":0.3973644,"about_ca_system_score_codex":0.000116895266,"about_ca_system_score_gemma":0.0001467403,"threshold_uncertainty_score":0.4094022},"labels":[],"label_agreement":null},{"id":"W2195788284","doi":"","title":"On instruction organization","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Task (project management); Locality; Latency (audio); Program code; Code (set theory); Programming language; Software engineering","score_opus":0.019700695353627534,"score_gpt":0.24347777765983475,"score_spread":0.22377708230620721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195788284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057317354,0.0000020129146,0.9661108,0.00035511493,0.00017285116,0.000028439843,2.7846262e-8,0.0009032177,0.026695775],"genre_scores_gemma":[0.72853774,0.0000011320474,0.270562,0.00042424785,0.000020790774,6.719109e-7,0.0000015526416,0.0000030121982,0.00044888415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996532,0.000018353589,0.000060635986,0.00010931138,0.00010459978,0.000053860742],"domain_scores_gemma":[0.99963456,0.000009074552,0.00002273838,0.00016676717,0.00012427114,0.000042570744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008474118,0.000036451587,0.000031797827,0.00005766386,0.000034539,0.000061467326,0.00019335056,0.000022285214,0.0000064959036],"category_scores_gemma":[0.00007567319,0.000031552656,0.0000057071557,0.00035641677,0.000005085484,0.00017379236,0.000048179103,0.000027861728,0.00009088512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001201601,0.000025625106,0.0003484497,6.9872516e-7,0.0000017286593,8.314052e-7,0.00018848546,0.0157664,0.000019147226,0.9365765,0.029917365,0.017153583],"study_design_scores_gemma":[0.0008235366,0.00029362185,0.0010505139,0.000011734245,0.0000016215926,0.00003597331,0.000022561548,0.85726905,0.024943558,0.108732685,0.0064945347,0.00032059892],"about_ca_topic_score_codex":0.000004574698,"about_ca_topic_score_gemma":1.9527712e-7,"teacher_disagreement_score":0.84150267,"about_ca_system_score_codex":0.000024643257,"about_ca_system_score_gemma":0.000026953094,"threshold_uncertainty_score":0.128668},"labels":[],"label_agreement":null},{"id":"W2196946741","doi":"","title":"A Look at Lua","year":2007,"lang":"en","type":"article","venue":"Linux journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Scripting language; Programming language; Python (programming language); Interpreter; Host (biology); Exception handling; Copying; Code (set theory); Chess endgame; Operating system; Computer graphics (images); Artificial intelligence; Set (abstract data type)","score_opus":0.014495926340965776,"score_gpt":0.27108606957072173,"score_spread":0.25659014322975593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196946741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070520286,0.00019313191,0.9758836,0.0004462016,0.00037711454,0.000028080392,9.445393e-8,0.00022914346,0.015790578],"genre_scores_gemma":[0.35201892,0.000055731078,0.6432706,0.0009969507,0.0004235851,4.7652753e-7,3.8278188e-7,0.000007928655,0.003225438],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915385,0.000031030202,0.00022629744,0.00012940013,0.00021464638,0.00024478688],"domain_scores_gemma":[0.99939656,0.000051175328,0.00011561374,0.00020640722,0.00009202626,0.00013819893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084324786,0.000072725816,0.0000824341,0.00011920656,0.00024023313,0.0001450063,0.000563713,0.000046812656,0.000039932416],"category_scores_gemma":[0.00003413175,0.0000624652,0.000060446906,0.00019012652,0.000018277655,0.00019085668,0.00017016365,0.0002022534,0.000078014644],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100376004,0.00042866723,0.018946087,0.00002416527,0.00012639293,0.0016956278,0.006466557,0.01390343,0.0038003155,0.07848224,0.34783083,0.5281953],"study_design_scores_gemma":[0.0026530984,0.0007878736,0.018864835,0.00022397206,0.000024042452,0.01214305,0.00008815735,0.41761896,0.056527942,0.0652904,0.42422122,0.0015564694],"about_ca_topic_score_codex":0.00000123134,"about_ca_topic_score_gemma":0.0000016699987,"teacher_disagreement_score":0.52663887,"about_ca_system_score_codex":0.00006856231,"about_ca_system_score_gemma":0.000040179573,"threshold_uncertainty_score":0.2547257},"labels":[],"label_agreement":null},{"id":"W2200129358","doi":"10.1109/iccd.2015.7357140","title":"Shift-aware racetrack memory","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Parallel computing; Cache; Power consumption; Latency (audio); Magnetoresistive random-access memory; Racetrack memory; Non-volatile memory; CPU cache; Interleaved memory; Semiconductor memory; Memory management; Operating system; Computer hardware; Random access memory; Power (physics)","score_opus":0.036473729060132735,"score_gpt":0.27617865879422615,"score_spread":0.2397049297340934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200129358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003912524,0.000049789553,0.9148509,0.0012646499,0.00018113789,0.000050843664,1.227249e-7,0.0012829328,0.08192841],"genre_scores_gemma":[0.6150186,0.000003088202,0.38045266,0.0008474223,0.000049105576,0.0000038247244,0.0000010951378,0.0000049916407,0.0036192038],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999317,0.00004072591,0.00011667491,0.00020176126,0.00017662236,0.00014721444],"domain_scores_gemma":[0.9993563,0.000025778809,0.000034784254,0.00038240934,0.00007938547,0.0001213216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028814992,0.00007324774,0.00008075991,0.00006380222,0.00004574294,0.00010951496,0.00061431323,0.000042496496,0.000015897469],"category_scores_gemma":[0.000032384265,0.000062801286,0.00002732134,0.00023371169,0.000016347109,0.0002863176,0.00018883176,0.00006927614,0.00017959501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009645901,0.00020816273,0.0009439222,0.000014087694,0.000025461157,0.00005052944,0.0034128756,0.03765737,0.000020071802,0.25871652,0.6231032,0.07583812],"study_design_scores_gemma":[0.00044838947,0.00011126481,0.00058296387,0.0000120005,0.000002136653,0.000020953341,0.000046020028,0.95114005,0.003487534,0.017104596,0.026694624,0.00034944224],"about_ca_topic_score_codex":0.000020565554,"about_ca_topic_score_gemma":0.0000018665584,"teacher_disagreement_score":0.9134827,"about_ca_system_score_codex":0.000022084094,"about_ca_system_score_gemma":0.000066108194,"threshold_uncertainty_score":0.2560962},"labels":[],"label_agreement":null},{"id":"W2202266523","doi":"10.1109/iecon.1989.69630","title":"A microprocessor-based suboptimal speed controller for an SCR-DC motor drive","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Microprocessor; DC motor; Computer science; Armature (electrical engineering); Controller (irrigation); Electronic speed control; Control theory (sociology); Algorithm; Control engineering; Computer hardware; Control (management); Electrical engineering; Engineering; Artificial intelligence","score_opus":0.02355798541421011,"score_gpt":0.275300049888196,"score_spread":0.2517420644739859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202266523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046493947,0.00003907222,0.9876895,0.00025011864,0.000089618356,0.00047755014,0.000002896481,0.0007804694,0.006021374],"genre_scores_gemma":[0.4047282,0.0000012348195,0.59335554,0.0009733947,0.000023637329,0.000022860386,0.00000310695,0.000010452131,0.0008815519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987563,0.0000728384,0.00023894993,0.00044729884,0.00015746882,0.00032715092],"domain_scores_gemma":[0.9990258,0.0000969298,0.00009838011,0.0003642997,0.00028870377,0.00012588529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003666398,0.00016957606,0.00021039949,0.00012483927,0.0001724098,0.00021700702,0.0005894626,0.00008183275,0.000013405313],"category_scores_gemma":[0.00009684921,0.00014810283,0.00009660101,0.00023615816,0.00003758011,0.00028224385,0.000029322502,0.000071780596,0.000013968694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042763705,0.0017327368,0.0014701537,0.0001168349,0.00014031256,0.000013834618,0.0009271441,0.18046391,0.069684066,0.69920164,0.030859437,0.014962321],"study_design_scores_gemma":[0.0013992983,0.00038484603,0.0000616709,0.000007847795,0.000005126006,0.000003955799,0.0000083279765,0.958219,0.033163518,0.0021360994,0.0043672463,0.00024306795],"about_ca_topic_score_codex":0.000012511189,"about_ca_topic_score_gemma":0.0000022880315,"teacher_disagreement_score":0.7777551,"about_ca_system_score_codex":0.000029011917,"about_ca_system_score_gemma":0.00012430968,"threshold_uncertainty_score":0.60394585},"labels":[],"label_agreement":null},{"id":"W2203656049","doi":"10.1109/samos.2015.7363674","title":"Chip-independent Error Correction in main memories","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Electrical, Communications and Cyber Systems; International Council for Canadian Studies; National Science Foundation","keywords":"Computer science; Dram; Overhead (engineering); Error detection and correction; Reliability (semiconductor); Chip; Embedded system; Soft error; Context (archaeology); Parallel computing; Computer hardware; Electronic engineering; Engineering; Algorithm; Telecommunications; Operating system","score_opus":0.03163381467027437,"score_gpt":0.2784309943868966,"score_spread":0.24679717971662224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203656049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042157625,0.000023839919,0.96149784,0.00043273222,0.0007749227,0.000078944366,9.9921515e-8,0.0005661116,0.032409754],"genre_scores_gemma":[0.8149673,0.000003297624,0.18103814,0.00024718686,0.000034836314,0.000007916743,0.0000011560923,0.00000415686,0.0036960102],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992675,0.00006047953,0.00014588579,0.00020134616,0.00017971094,0.00014503485],"domain_scores_gemma":[0.999589,0.000023574923,0.000037937003,0.00023295105,0.00004985783,0.00006663688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004288489,0.00007145414,0.00008535313,0.00012450886,0.000033587643,0.00008444247,0.0003440005,0.000042978376,0.0000065447384],"category_scores_gemma":[0.000059856196,0.000064084204,0.000018595098,0.00032402782,0.000012554383,0.00025488954,0.00013491404,0.00008690875,0.000032737364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007058388,0.00070385553,0.026423613,0.000021078964,0.000028902567,0.00013826188,0.0131078465,0.29130006,0.00024785293,0.17010866,0.3702909,0.12755838],"study_design_scores_gemma":[0.00031581335,0.00007713451,0.0025192585,0.000011415821,7.1839713e-7,0.000030913714,0.00010456088,0.9832566,0.0037650855,0.007084415,0.0026694143,0.00016471736],"about_ca_topic_score_codex":0.00010362573,"about_ca_topic_score_gemma":0.000105823194,"teacher_disagreement_score":0.81075156,"about_ca_system_score_codex":0.00007308959,"about_ca_system_score_gemma":0.00007189814,"threshold_uncertainty_score":0.2613278},"labels":[],"label_agreement":null},{"id":"W2204974001","doi":"10.1007/978-1-4615-0849-6_14","title":"Reducing Indirect Mispredictions of Two-Stage Branch Predictors","year":2002,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Branch predictor; Computer science; Cache; Parallel computing; Stage (stratigraphy); Scheme (mathematics); Mathematics","score_opus":0.010476586426889336,"score_gpt":0.22228368114489092,"score_spread":0.21180709471800158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204974001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074297795,0.00025036055,0.95692205,0.00013470961,0.0021219645,0.00014343283,0.000017612118,0.00042172836,0.03924513],"genre_scores_gemma":[0.4208238,0.001185269,0.52028865,0.0001429248,0.00073872955,0.000030969273,0.000022925711,0.00008170206,0.056685008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980082,0.000009526118,0.0004859613,0.0006457893,0.0005897258,0.0002607951],"domain_scores_gemma":[0.99897116,0.00006921143,0.00020377661,0.00045312397,0.00020149421,0.00010123855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003827526,0.0002778234,0.0003067656,0.0008942473,0.00009892812,0.00021014844,0.0014557858,0.00010994814,0.000023921677],"category_scores_gemma":[0.00003381958,0.00030035395,0.000069010675,0.00028246295,0.00024980333,0.0007160302,0.0007187893,0.00032985563,0.0000025406591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058311057,0.000052427054,0.00036670308,0.00009507159,0.00007738675,0.00002986995,0.0012677803,0.45632985,0.00020726207,0.52063215,0.0005947855,0.020340882],"study_design_scores_gemma":[0.00019941722,0.00008396391,0.00039017395,0.00050104735,0.0000048387187,0.00006595963,9.356477e-7,0.984601,0.0007110222,0.0016257723,0.011467426,0.00034844948],"about_ca_topic_score_codex":0.000016700053,"about_ca_topic_score_gemma":0.0000015163197,"teacher_disagreement_score":0.52827114,"about_ca_system_score_codex":0.00012293653,"about_ca_system_score_gemma":0.00007730623,"threshold_uncertainty_score":0.99994487},"labels":[],"label_agreement":null},{"id":"W2206585663","doi":"10.1109/aeect.2015.7360554","title":"Analysis of meta-heuristics performance in energy aware scheduling of real-time embedded systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Frequency scaling; Computer science; Energy consumption; Scheduling (production processes); Dynamic voltage scaling; Energy management; Efficient energy use; Meta heuristic; Electric power system; Voltage; Power consumption; Distributed computing; Real-time computing; Energy (signal processing); Embedded system; Power (physics); Mathematical optimization; Operating system; Engineering; Algorithm","score_opus":0.04232876347867168,"score_gpt":0.274284166353624,"score_spread":0.23195540287495234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206585663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023096908,0.00014600636,0.97276247,0.000012861644,0.000039104245,0.00003945262,0.0000016605738,0.00013619554,0.00376536],"genre_scores_gemma":[0.8337987,0.000061200175,0.16586052,0.000008482958,0.0000057924403,0.0000043010355,0.000004763963,0.000003706585,0.00025249468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877846,0.00012688765,0.0004904415,0.00020465173,0.00026732174,0.00013225351],"domain_scores_gemma":[0.9987949,0.00009355136,0.000255407,0.00045939078,0.00033984368,0.000056873174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078020943,0.000099553574,0.00053129805,0.0005299701,0.000016330041,0.000024711395,0.0005107005,0.000053442887,0.000004973285],"category_scores_gemma":[0.00004643813,0.00008240187,0.00010763938,0.0016306593,0.000024852861,0.0001459464,0.00013871751,0.000040783263,0.0000011854358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028044701,0.000034582605,0.0016208953,0.000015506339,0.00033804236,8.746889e-7,0.00018103288,0.9921841,0.000047040307,0.005248678,0.00007431072,0.00025210893],"study_design_scores_gemma":[0.000088235225,0.000042625197,0.0002076124,0.000013610729,0.00021238692,7.21252e-7,0.000020898982,0.9972221,0.0020323042,0.0000473136,0.00002675267,0.00008544059],"about_ca_topic_score_codex":0.00041512115,"about_ca_topic_score_gemma":0.000006871972,"teacher_disagreement_score":0.81070185,"about_ca_system_score_codex":0.000024887451,"about_ca_system_score_gemma":0.000078550205,"threshold_uncertainty_score":0.3360251},"labels":[],"label_agreement":null},{"id":"W2213699459","doi":"10.6084/m9.figshare.2059944.v1","title":"Supplementary Data for CAFA2","year":2016,"lang":"en","type":"article","venue":"Lirias","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Lawrence Berkeley National Laboratory; Natural Sciences and Engineering Research Council of Canada; Biotechnology and Biological Sciences Research Council; Office of Science; Directorate for Biological Sciences; National Institutes of Health; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; China Scholarship Council; Parkinson's UK; National Science Foundation; Royal Society; National Key Research and Development Program of China; British Heart Foundation; Alexander von Humboldt-Stiftung; Academy of Finland; National Natural Science Foundation of China; Microsoft Research; KU Leuven; Fundação de Amparo à Pesquisa do Estado de São Paulo; Gordon and Betty Moore Foundation; U.S. Department of Energy","keywords":"Computer science","score_opus":0.05467910202720348,"score_gpt":0.31362317684313656,"score_spread":0.25894407481593307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213699459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016417912,0.000019991117,0.9913973,0.0072360844,0.00021636102,0.0001245925,0.00016362841,0.00022245478,0.00045536668],"genre_scores_gemma":[0.06760193,0.000021192785,0.929837,0.0010286081,0.00017070559,0.000018050967,0.000111026806,0.000007872286,0.0012036577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993628,0.000019695533,0.00011186715,0.00027327205,0.0000836367,0.00014870404],"domain_scores_gemma":[0.99883044,0.000122404,0.000037270976,0.0009403056,0.000032549182,0.000037011338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000236476,0.000057113208,0.00006428265,0.000036018097,0.00006112022,0.000042561594,0.0013082456,0.000021296806,0.00005073227],"category_scores_gemma":[0.00005399759,0.00003846101,0.000018499022,0.000070879876,0.000013203487,0.00022908424,0.0004956526,0.000016227306,0.000014099077],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074349164,0.000040029427,0.0003143517,0.0000074412483,0.000017286573,0.0000022579404,0.00009097811,0.000025872308,0.0005860652,0.068087704,0.83215284,0.098667726],"study_design_scores_gemma":[0.00061283144,0.00008970011,0.00018191425,0.000024644813,0.000004458399,0.0000052357427,0.000003434736,0.059619498,0.0052438285,0.011303219,0.92272186,0.00018934647],"about_ca_topic_score_codex":0.000015142155,"about_ca_topic_score_gemma":0.000005341964,"teacher_disagreement_score":0.098478384,"about_ca_system_score_codex":0.000012341879,"about_ca_system_score_gemma":0.000025951413,"threshold_uncertainty_score":0.24310675},"labels":[],"label_agreement":null},{"id":"W2218744901","doi":"10.1109/mc.2015.375","title":"Superconducting Computing in Large-Scale Hybrid Systems","year":2015,"lang":"en","type":"article","venue":"Computer","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada)","funders":"","keywords":"Computer science; Computation; Superconductivity; Scale (ratio); Complement (music); Distributed computing; Computational science; Physics; Algorithm","score_opus":0.03632339728995849,"score_gpt":0.27068336611852356,"score_spread":0.23435996882856508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218744901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07631158,0.00023835423,0.91958565,0.00017391764,0.0012501396,0.00016511996,8.187825e-7,0.00081316504,0.0014612374],"genre_scores_gemma":[0.6658774,0.0000024511417,0.33349952,0.00027378366,0.0002630147,0.0000037455882,0.0000043715027,0.0000122152915,0.000063502055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981374,0.00018935667,0.00041842897,0.00050988636,0.0002751875,0.00046973085],"domain_scores_gemma":[0.99894357,0.00008520388,0.00009769214,0.00054281706,0.0001645881,0.00016610562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010602106,0.00018580566,0.00028364602,0.00023570377,0.00010053942,0.00033350554,0.0009311189,0.00006127823,0.0000014520696],"category_scores_gemma":[0.000027384125,0.00018597627,0.00005365068,0.00045020625,0.000023685727,0.00049259054,0.0006809267,0.00023175814,0.000056781795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010677412,0.00049196626,0.033593323,0.00009221941,0.000035835998,0.00028928014,0.011687762,0.8416942,0.000073307536,0.024352156,0.04969332,0.037985966],"study_design_scores_gemma":[0.00047158,0.00005047576,0.00053930224,0.00006928669,0.0000011727972,0.00008641377,0.000063772444,0.99439883,0.0001525238,0.0003376987,0.003591212,0.00023772253],"about_ca_topic_score_codex":0.00004626554,"about_ca_topic_score_gemma":0.000003136725,"teacher_disagreement_score":0.5895658,"about_ca_system_score_codex":0.00009690312,"about_ca_system_score_gemma":0.0000799638,"threshold_uncertainty_score":0.75838923},"labels":[],"label_agreement":null},{"id":"W2220109089","doi":"10.1007/978-3-319-16214-0_6","title":"Operand-Value-Based Modeling of Dynamic Energy Consumption of Soft Processors in FPGA","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Operand; Computer science; Field-programmable gate array; Parallel computing; Energy consumption; Software; Energy (signal processing); Value (mathematics); Soft error; Embedded system; Computer hardware; Programming language; Electronic engineering; Mathematics","score_opus":0.028123439084828093,"score_gpt":0.27682106088749653,"score_spread":0.24869762180266844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220109089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000341535,0.00093178445,0.9974779,0.00012383223,0.00026863744,0.00021284366,0.000003645473,0.00013368783,0.00050615217],"genre_scores_gemma":[0.60960376,0.00003821623,0.39016655,0.00012379084,0.000019277351,0.000004657202,0.000004991578,0.000015508316,0.000023253224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969256,0.00006211971,0.00082277553,0.0009462169,0.00086690864,0.00037636637],"domain_scores_gemma":[0.99785256,0.00021683359,0.00045599227,0.0008315128,0.00054915645,0.00009395576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011821513,0.00037072302,0.00065116346,0.0012915398,0.00006364972,0.000088696506,0.0022355223,0.00029640517,0.000003994076],"category_scores_gemma":[0.00009820248,0.00035612812,0.00009516615,0.0006609141,0.00044638038,0.00032548452,0.0005277718,0.0003733079,0.0000012678734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104499,0.000033193206,0.000026582416,0.00007636417,0.0000032982819,0.000005238094,0.0002561512,0.90778935,0.000051365227,0.003912599,0.0000019173037,0.087833464],"study_design_scores_gemma":[0.0003714903,0.00012613,0.0000094054585,0.0008314785,0.000004187518,0.0000068631384,9.785409e-8,0.9576709,0.001461939,0.039172668,0.000016774284,0.00032803632],"about_ca_topic_score_codex":0.00008537958,"about_ca_topic_score_gemma":0.000058289796,"teacher_disagreement_score":0.6092622,"about_ca_system_score_codex":0.0002357782,"about_ca_system_score_gemma":0.00095499936,"threshold_uncertainty_score":0.9998891},"labels":[],"label_agreement":null},{"id":"W2220328383","doi":"10.1145/3053370","title":"Array Layouts for Comparison-Based Searching","year":2017,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Binary search algorithm; Value (mathematics); Parallel computing; Binary tree; Binary number; Latency (audio); Algorithm; Search algorithm; Arithmetic; Mathematics","score_opus":0.05509203364200714,"score_gpt":0.3722407228452136,"score_spread":0.31714868920320644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220328383","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009824527,0.0003589927,0.98787504,0.00086842885,0.0005699006,0.00011085498,0.0000021132826,0.000055388075,0.00033472516],"genre_scores_gemma":[0.46109837,0.0000051025945,0.53863025,0.00011400896,0.00012983083,0.0000024166102,7.3923496e-7,0.000006738388,0.000012559103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989034,0.000042142266,0.00038594665,0.00016337754,0.00028755006,0.00021757316],"domain_scores_gemma":[0.9981833,0.00015076718,0.00064393616,0.0006991875,0.00020429525,0.00011850363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052786886,0.00012548114,0.0002457997,0.00010674219,0.00052381563,0.00047718588,0.002625963,0.000048317306,0.0000023241917],"category_scores_gemma":[0.00021923252,0.000112472786,0.00015073651,0.00004411058,0.00006628147,0.000526124,0.00024980374,0.0001749603,0.0000018981729],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011802157,0.006611218,0.022008363,0.00016474989,0.0009567592,0.00034493205,0.017077822,0.09024719,0.2815409,0.042707928,0.06761763,0.4695423],"study_design_scores_gemma":[0.001307338,0.0008311906,0.00031539425,0.0000787841,0.0000070259402,0.000046927667,0.000096272954,0.5049585,0.4879531,0.0020745813,0.0020920176,0.00023884689],"about_ca_topic_score_codex":0.000007891732,"about_ca_topic_score_gemma":3.0681113e-7,"teacher_disagreement_score":0.46930346,"about_ca_system_score_codex":0.00006547713,"about_ca_system_score_gemma":0.00012260575,"threshold_uncertainty_score":0.4879736},"labels":[],"label_agreement":null},{"id":"W2227036781","doi":"","title":"Constraint programming techniques for optimal instruction scheduling","year":2008,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Instruction scheduling; Computer science; Register allocation; Compiler; Parallel computing; Block scheduling; Scheduling (production processes); Constraint programming; Dynamic priority scheduling; Two-level scheduling; Programming language; Mathematical optimization; Schedule; Mathematics; Operating system","score_opus":0.01336465924342182,"score_gpt":0.22826627620071022,"score_spread":0.2149016169572884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227036781","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21552865,0.00008783322,0.78155875,0.00023817402,0.0003137075,0.00077702035,0.000009109618,0.001121365,0.00036539132],"genre_scores_gemma":[0.013301977,0.0001544668,0.96425945,0.000008611226,0.000043958997,0.000003324334,0.0001897763,0.000019892677,0.02201854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.000038435315,0.00018387982,0.00047387113,0.00022349099,0.00027346215],"domain_scores_gemma":[0.998758,0.00003336308,0.00040229294,0.00034055414,0.00039330393,0.000072461815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001717045,0.0002328837,0.00035380985,0.00039141177,0.0003763587,0.000058276113,0.00076669396,0.0003316393,0.000004929403],"category_scores_gemma":[0.000020216072,0.00029021295,0.00020338898,0.00026128552,0.00010002642,0.00037436912,0.00009411213,0.00022107112,0.0000026771224],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003300208,0.00033034495,0.00013671594,0.0012064142,0.0003378818,0.00007029613,0.15090244,0.005767481,0.003742082,0.01569386,0.0027623812,0.8187201],"study_design_scores_gemma":[0.0053687417,0.003098393,0.00070137216,0.003679327,0.0004544069,0.00027293968,0.13660467,0.60014904,0.21316652,0.002978104,0.028176513,0.005349962],"about_ca_topic_score_codex":0.0013575819,"about_ca_topic_score_gemma":0.0003812566,"teacher_disagreement_score":0.8133701,"about_ca_system_score_codex":0.000075792435,"about_ca_system_score_gemma":0.00016786453,"threshold_uncertainty_score":0.999955},"labels":[],"label_agreement":null},{"id":"W2233147800","doi":"10.1145/2840807","title":"Citadel","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Cache; Cache-only memory architecture; Granularity; Registered memory; Embedded system; CPU cache; Interleaved memory; Dram; Parallel computing; Overlay; Computer hardware; Memory management; Operating system; Cache coloring","score_opus":0.012470259115192277,"score_gpt":0.23610710468421053,"score_spread":0.22363684556901825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233147800","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012972859,0.00003569123,0.9912192,0.0070788395,0.00008517002,0.000117658295,0.0000076794995,0.0005679415,0.0007580879],"genre_scores_gemma":[0.21408725,0.0002487507,0.7843497,0.000647524,0.000021135715,0.000021816353,0.0000018191356,0.00001268971,0.000609311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913514,0.000056862104,0.00015727397,0.00033712553,0.0001443342,0.00016926185],"domain_scores_gemma":[0.9991479,0.00014068793,0.000050898896,0.00052777474,0.000054612487,0.00007815072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000096397074,0.00013534434,0.000105108746,0.00019463518,0.00021411927,0.0000771967,0.00042359822,0.0000719622,0.000031140193],"category_scores_gemma":[0.000029950996,0.00009377094,0.000044347737,0.00027360715,0.00004432184,0.00021780618,0.000017859684,0.00009564472,0.000008569358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012683099,0.000038239486,0.00000855345,0.0000033515432,0.00001179947,0.0000011694766,0.00016488618,0.557749,0.0001667368,0.0018756235,0.00010954719,0.43985844],"study_design_scores_gemma":[0.0018010483,0.0005836674,0.00022072875,0.00019082469,0.00003372501,0.0001170241,0.00001587702,0.9340273,0.01318771,0.03921077,0.009719405,0.0008919109],"about_ca_topic_score_codex":0.0000022224265,"about_ca_topic_score_gemma":0.0000041414196,"teacher_disagreement_score":0.4389665,"about_ca_system_score_codex":0.00001908053,"about_ca_system_score_gemma":0.000022802295,"threshold_uncertainty_score":0.38238677},"labels":[],"label_agreement":null},{"id":"W2237082146","doi":"10.1145/2830772.2830778","title":"Efficiently enforcing strong memory ordering in GPUs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec; Nvidia; National Science Foundation","keywords":"Computer science; Parallel computing; CUDA; Memory model; Semantics (computer science); Programming paradigm; Memory management; Shared memory; Computer architecture; Programming language; Overlay","score_opus":0.029794968350142195,"score_gpt":0.2718671241967279,"score_spread":0.24207215584658573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237082146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147366375,0.00005190958,0.9283552,0.00011867338,0.00015549995,0.00006971665,4.476551e-8,0.0005600602,0.055952247],"genre_scores_gemma":[0.7472123,0.0000015307679,0.25214377,0.00010913108,0.000016610378,0.0000032976968,3.9806636e-7,0.000003857812,0.000509106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992129,0.000034216067,0.00016821001,0.00020997372,0.00016637029,0.00020830585],"domain_scores_gemma":[0.99953306,0.000029824057,0.000037574988,0.00026988043,0.000053685,0.00007600501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042881776,0.00007770402,0.00009464501,0.0001510268,0.000036686986,0.000100866135,0.00047485303,0.00003231974,0.0000040778555],"category_scores_gemma":[0.00005094863,0.00007273018,0.000019026364,0.00037811606,0.000011614409,0.00024954823,0.00023593946,0.00008425925,0.000020971976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003566856,0.000056528173,0.0013631319,0.0000070674664,0.0000035597707,0.000022999156,0.0019235996,0.9214234,0.00006724339,0.041270524,0.0022192013,0.0316392],"study_design_scores_gemma":[0.0002468741,0.000030424146,0.00013309611,0.000014871249,3.8944614e-7,0.000006992433,0.00007033523,0.99590737,0.002487225,0.00046811948,0.00051930675,0.00011501359],"about_ca_topic_score_codex":0.00011125135,"about_ca_topic_score_gemma":0.000013576899,"teacher_disagreement_score":0.73247564,"about_ca_system_score_codex":0.00005714721,"about_ca_system_score_gemma":0.00006672774,"threshold_uncertainty_score":0.29658508},"labels":[],"label_agreement":null},{"id":"W2237415205","doi":"10.1145/2830772.2830790","title":"Doppelgänger","year":2015,"lang":"de","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cache; Computer science; Parallel computing; Redundancy (engineering); Cache algorithms; Leverage (statistics); CPU cache; Locality; Exploit; Data deduplication; Cache-oblivious algorithm; Smart Cache; Cache coloring; Operating system","score_opus":0.048331746851153504,"score_gpt":0.28465262005424213,"score_spread":0.23632087320308864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237415205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007746627,0.0024200897,0.8927134,0.0024798803,0.0017960306,0.00009870633,6.3169034e-7,0.00090572034,0.099508055],"genre_scores_gemma":[0.13720983,0.00021332043,0.82951146,0.0030325395,0.00087368366,0.0000066120965,0.000006295665,0.000024219671,0.029122034],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998574,0.00011316397,0.00025752024,0.0003876464,0.00034573436,0.00032192733],"domain_scores_gemma":[0.998661,0.00003875336,0.0000851808,0.0006253694,0.00027151263,0.0003182309],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000566968,0.00016625738,0.00017141682,0.00011219773,0.00007647766,0.00035100503,0.00084919744,0.000106473446,0.000064393724],"category_scores_gemma":[0.000083798506,0.00015094741,0.00006212112,0.00044483345,0.000051162413,0.00028254997,0.00043461926,0.00014175675,0.0032863095],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070037618,0.00011862706,0.00037415646,0.000007744382,0.000033371583,0.000026754295,0.0011575873,0.005792753,0.0000048061934,0.08967388,0.8754507,0.027352639],"study_design_scores_gemma":[0.00031049774,0.00014068575,0.000049758437,0.000021682716,0.000010034469,0.000007761189,0.000018537887,0.63061875,0.0006231944,0.0056874007,0.36221632,0.00029534748],"about_ca_topic_score_codex":0.000044183387,"about_ca_topic_score_gemma":8.866174e-7,"teacher_disagreement_score":0.624826,"about_ca_system_score_codex":0.00005472912,"about_ca_system_score_gemma":0.00022845731,"threshold_uncertainty_score":0.99748975},"labels":[],"label_agreement":null},{"id":"W22487599","doi":"10.1007/b136892","title":"Building ASIPS: The Mescal Methodology","year":2005,"lang":"en","type":"book","venue":"Kluwer Academic Publishers eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"RWTH Aachen University; University of Waterloo","keywords":"Computer science","score_opus":0.05967845208356374,"score_gpt":0.31981700566595406,"score_spread":0.2601385535823903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22487599","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014357854,0.0007480484,0.5153076,0.0023631884,0.00083678524,0.0003127008,0.0000023004402,0.0011204125,0.4793075],"genre_scores_gemma":[0.00006686638,0.000030864754,0.3770739,0.0042428407,0.001406311,0.00006674168,0.000012144478,0.00007792776,0.6170224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99534434,0.00073592726,0.00094829674,0.0012330967,0.0008361508,0.00090221013],"domain_scores_gemma":[0.996021,0.0011538177,0.0007203867,0.0016050203,0.00024933333,0.00025049085],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.003809281,0.00066631584,0.00075386505,0.0005520125,0.0003908182,0.0010082624,0.007271079,0.001827834,0.000036878882],"category_scores_gemma":[0.0004844595,0.00051657384,0.00036244933,0.00019634175,0.00036320928,0.0009941083,0.0018265483,0.0043157423,0.00005364581],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037586788,0.000004125683,0.0000013172308,0.00001254106,0.0000690334,0.000006845094,0.00044612668,0.00022217224,0.000017534103,0.17512934,0.7174399,0.106647305],"study_design_scores_gemma":[0.00018578689,0.00003258894,0.000004151877,0.000098469034,0.000039534872,0.000095045994,0.000006466794,0.008843753,0.00018045845,0.12859857,0.8613541,0.0005610585],"about_ca_topic_score_codex":0.000014103853,"about_ca_topic_score_gemma":0.0000017885133,"teacher_disagreement_score":0.14391421,"about_ca_system_score_codex":0.0004332836,"about_ca_system_score_gemma":0.0010309195,"threshold_uncertainty_score":0.99972856},"labels":[],"label_agreement":null},{"id":"W2252908030","doi":"10.14288/1.0167110","title":"GPU computing architecture for irregular parallelism","year":2015,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallelism (grammar); Parallel computing; Architecture; Task parallelism; Data parallelism; Geography","score_opus":0.015285420724101627,"score_gpt":0.20193776367507155,"score_spread":0.1866523429509699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252908030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088783965,0.00013772005,0.9090902,0.00029042145,0.00014355397,0.00022609405,0.000014495308,0.00039832937,0.0009152171],"genre_scores_gemma":[0.6592642,0.000009282409,0.34019083,0.000085638916,0.000032565822,3.1629955e-7,0.000008495808,0.00000726911,0.00040141307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.000061260784,0.0001247795,0.00039075257,0.00022003996,0.00025008747],"domain_scores_gemma":[0.99897385,0.000059158563,0.00013875356,0.00036642392,0.00030800895,0.00015377991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034347986,0.00004724092,0.00022149942,0.00005427408,0.00021276726,0.00016835489,0.00091951014,0.000091252594,0.0000023990058],"category_scores_gemma":[0.000044809545,0.00016125124,0.00011385344,0.00026771825,0.00010489553,0.0002406599,0.00030987692,0.00010027646,0.0000046530467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007766803,0.00009730656,0.0007201374,0.00004854576,0.000033105076,0.000047546804,0.00093172205,0.0088675525,0.000033567216,0.0001820286,0.03434338,0.95468736],"study_design_scores_gemma":[0.004687017,0.0005926597,0.2905368,0.0003694305,0.000046038233,0.00031149335,0.0007062453,0.6457977,0.000015364783,0.03323725,0.02258452,0.00111544],"about_ca_topic_score_codex":0.006089496,"about_ca_topic_score_gemma":0.005063281,"teacher_disagreement_score":0.9535719,"about_ca_system_score_codex":0.000042322285,"about_ca_system_score_gemma":0.00010191178,"threshold_uncertainty_score":0.9205537},"labels":[],"label_agreement":null},{"id":"W2254303959","doi":"10.2172/1157316","title":"Tracking Tests for the SNS Fast Injection Bump Power Supply","year":2004,"lang":"en","type":"report","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Argonne National Laboratory; UT-Battelle; Battelle; U.S. Department of Energy","keywords":"Power (physics); Construct (python library); Tracking (education); Computer science; Waveform; Real-time computing; Computer hardware; Electrical engineering; Database; Embedded system; Engineering; Telecommunications; Physics; Programming language","score_opus":0.043671413482181044,"score_gpt":0.32264649484090446,"score_spread":0.2789750813587234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254303959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000097758675,0.0004340925,0.9583952,0.0006845194,0.0015297162,0.00059749023,0.0000064639385,0.0011628673,0.03717991],"genre_scores_gemma":[0.2547368,0.0012325941,0.69711536,0.0011999623,0.0013830866,0.0003687422,0.00009418935,0.00014215836,0.04372709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980984,0.000033461965,0.00041474059,0.0005557768,0.00056903344,0.0003286068],"domain_scores_gemma":[0.99786,0.00028281147,0.00030756232,0.00077952194,0.00071480754,0.00005527976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008743381,0.00027826126,0.00027688054,0.00019202866,0.0003596845,0.00046046346,0.0011381961,0.00027157925,0.000022601305],"category_scores_gemma":[0.00023872804,0.00019256366,0.00022133903,0.00035933015,0.000039645107,0.00022956564,0.00021971969,0.00032804487,0.000011635537],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015022681,0.00032528903,0.00064248487,0.0002685307,0.00028810985,0.00001851984,0.0016645589,0.11044003,0.00004226686,0.02564259,0.5534993,0.30715334],"study_design_scores_gemma":[0.00090999686,0.000999122,0.005072414,0.00091229525,0.0001217091,0.0009963848,0.000077908655,0.20259239,0.0019320076,0.011778391,0.7724372,0.002170183],"about_ca_topic_score_codex":0.0002785242,"about_ca_topic_score_gemma":0.000046115347,"teacher_disagreement_score":0.30498314,"about_ca_system_score_codex":0.00028150258,"about_ca_system_score_gemma":0.0009706521,"threshold_uncertainty_score":0.7852518},"labels":[],"label_agreement":null},{"id":"W2255454767","doi":"10.1049/iet-cdt.2015.0056","title":"Evaluating fault tolerance on asymmetric multicore systems‐on‐chip using iso‐metrics","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Seventh Framework Programme; European Commission; Queen's University; Ministerio de Economía y Competitividad; Federación Española de Enfermedades Raras; Engineering and Physical Sciences Research Council; Universidad Complutense de Madrid","keywords":"Emulation; Computer science; Multi-core processor; Embedded system; Fault tolerance; Frequency scaling; Implementation; Reliability (semiconductor); Energy consumption; Supercomputer; Reliability engineering; Power (physics); Distributed computing; Engineering; Parallel computing; Electrical engineering","score_opus":0.10094770743611232,"score_gpt":0.34727397872046256,"score_spread":0.24632627128435025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255454767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019262023,0.00022049977,0.96785074,0.00013516232,0.00086324324,0.00074838387,0.000012682207,0.0043061413,0.0066011185],"genre_scores_gemma":[0.5994316,0.000009792885,0.39968434,0.00053372735,0.0001869139,0.000028954488,0.000010300126,0.000039894705,0.00007452228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616575,0.00020474657,0.0007477137,0.001018354,0.0012183246,0.00064510206],"domain_scores_gemma":[0.99688584,0.00053328264,0.00045493318,0.0011705535,0.0006247167,0.0003307052],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009918021,0.0005284268,0.0005582647,0.0012670178,0.00023377329,0.0016912491,0.0018552396,0.00022358456,3.8563408e-7],"category_scores_gemma":[0.00056452997,0.00050438003,0.00018053087,0.0025896963,0.00008321897,0.001096359,0.0006089335,0.00043818395,0.000037035414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084509506,0.0008317388,0.00088989077,0.000098206154,0.000079445264,0.00011864164,0.00070747465,0.4115128,0.00014386814,0.022661809,0.025043111,0.5378285],"study_design_scores_gemma":[0.00039073417,0.0012187634,0.000046822115,0.0004040375,0.000007402197,0.000072175004,0.000014757428,0.98973876,0.0037106408,0.0013524011,0.0024127564,0.0006307345],"about_ca_topic_score_codex":0.000033234966,"about_ca_topic_score_gemma":1.3353115e-7,"teacher_disagreement_score":0.58016956,"about_ca_system_score_codex":0.00040155993,"about_ca_system_score_gemma":0.00016270998,"threshold_uncertainty_score":0.9997408},"labels":[],"label_agreement":null},{"id":"W2258870353","doi":"","title":"13th compiler-driven performance workshop (CDP)","year":2014,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"IBM (Canada); University of Toronto","funders":"","keywords":"Compiler; Computer science; Bridge (graph theory); State (computer science); Software engineering; Computer architecture; Programming language","score_opus":0.009526808272626763,"score_gpt":0.20929044861736207,"score_spread":0.19976364034473532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258870353","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03617595,0.000051170544,0.96178794,0.00011667618,0.00050834735,0.00007956012,1.8917622e-7,0.0012113473,0.00006879484],"genre_scores_gemma":[0.45935115,0.000015600339,0.5403032,0.00021341853,0.0000918204,0.0000040771224,4.944014e-7,0.0000064758387,0.000013813005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984195,0.000022192457,0.00019907198,0.0005346862,0.00040047916,0.0004240254],"domain_scores_gemma":[0.9988551,0.00017966387,0.000054809694,0.00052947993,0.00019443763,0.00018646962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083349604,0.00018105954,0.00018394699,0.00027538714,0.0003483053,0.00047132466,0.0012772057,0.000050483533,0.0000010193658],"category_scores_gemma":[0.00017804997,0.00017364179,0.00002938421,0.00090625917,0.00012601541,0.00086975633,0.0007148055,0.00017257368,0.000010424306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013428694,0.000028852262,0.004445689,0.000053784188,0.000007434157,0.0000037820334,0.0008123046,0.55314535,0.00012978372,0.009320881,0.00095685764,0.43109396],"study_design_scores_gemma":[0.000106725165,0.00005642542,0.0064291228,0.000066293906,0.0000013082341,0.000022030907,7.462307e-7,0.9893567,0.00039380102,0.00005302218,0.003277578,0.00023625356],"about_ca_topic_score_codex":0.0000018662485,"about_ca_topic_score_gemma":1.7097024e-7,"teacher_disagreement_score":0.43621135,"about_ca_system_score_codex":0.000047305824,"about_ca_system_score_gemma":0.00006773478,"threshold_uncertainty_score":0.70809066},"labels":[],"label_agreement":null},{"id":"W2258889300","doi":"10.2197/ipsjtrans.4.217","title":"Retrospective Study of Performance and Power Consumption of Computer Systems","year":2011,"lang":"en","type":"article","venue":"IPSJ Online Transactions","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Astronomical Observatory of Japan; Canadian Foundation for Climate and Atmospheric Sciences","keywords":"Computer science; Spec#; Laptop; Benchmark (surveying); Power consumption; Workstation; Operating system; Suite; Power (physics); Mobile device; Embedded system","score_opus":0.034048117978548474,"score_gpt":0.26410408830765475,"score_spread":0.23005597032910627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258889300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38440335,0.000026718093,0.61509585,0.0000050542158,0.00013053585,0.00014071184,0.0000051609163,0.000086937034,0.00010569798],"genre_scores_gemma":[0.92840743,0.000045372763,0.07149529,0.0000048525494,0.000009395374,0.000005553876,8.2277245e-7,0.0000045168194,0.000026763519],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926156,0.000053765703,0.00028065487,0.00018568373,0.00013235337,0.0000860093],"domain_scores_gemma":[0.9994026,0.000016386552,0.00012986638,0.0002552509,0.00016349941,0.00003239678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001263728,0.000083826075,0.0001829385,0.00013640021,0.000063850784,0.000010968175,0.00019265212,0.00003719863,0.000007540181],"category_scores_gemma":[0.0000017715734,0.00007888764,0.000027007081,0.00019348282,0.000051731255,0.00020184428,0.000015467172,0.00009227698,7.7987426e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043273476,0.031815905,0.56540847,0.0011698285,0.001503685,0.000028597355,0.14621022,0.1352184,0.0019659265,0.032778576,0.000489342,0.0829783],"study_design_scores_gemma":[0.00090730475,0.0018739317,0.40858656,0.00009810391,0.000038137572,0.000030156345,0.00025031646,0.5869456,0.00094679894,0.000060368526,0.00004779268,0.00021494902],"about_ca_topic_score_codex":0.000069931746,"about_ca_topic_score_gemma":0.000009286589,"teacher_disagreement_score":0.5440041,"about_ca_system_score_codex":0.000013066466,"about_ca_system_score_gemma":0.000016288985,"threshold_uncertainty_score":0.3216945},"labels":[],"label_agreement":null},{"id":"W2261706461","doi":"","title":"A design for comprehensive kernel instrumentation","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dependability; Instrumentation (computer programming); Computer science; Kernel (algebra); Key (lock); Software engineering; Systems engineering; Embedded system; Operating system; Engineering","score_opus":0.044346291763223446,"score_gpt":0.30057958374969007,"score_spread":0.2562332919864666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261706461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026509315,0.0000031561658,0.9945471,0.00037184672,0.00021759958,0.00024637915,2.3781475e-7,0.00079224,0.0011705036],"genre_scores_gemma":[0.23591901,0.000001470562,0.76349026,0.00039497597,0.00001981562,0.000024512556,0.0000016016918,0.0000030277458,0.00014532727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995446,0.00001789767,0.00009964285,0.00016364559,0.000068672794,0.000105508865],"domain_scores_gemma":[0.999516,0.00010149391,0.000041807347,0.00019689229,0.0001106286,0.000033196884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010181971,0.00005830343,0.000058573045,0.00005085401,0.00008579527,0.00009346086,0.00031370108,0.00003550889,0.0000058072956],"category_scores_gemma":[0.000016553615,0.00005246866,0.000023940136,0.000103088605,0.000014570211,0.00018959198,0.000052458083,0.000054593474,0.000011150565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028619543,0.000155924,0.00024415748,0.000023381683,0.000032204163,0.0000019617382,0.0011564622,0.018552568,0.048670117,0.69087094,0.06160672,0.17865697],"study_design_scores_gemma":[0.00023722666,0.00006196331,0.00019539011,0.0000018792825,0.0000011481511,0.000004948924,0.000005174854,0.9526898,0.03440105,0.00950863,0.0028004854,0.0000922664],"about_ca_topic_score_codex":0.0000058653945,"about_ca_topic_score_gemma":0.0000010243443,"teacher_disagreement_score":0.9341373,"about_ca_system_score_codex":0.0000055650166,"about_ca_system_score_gemma":0.000027568954,"threshold_uncertainty_score":0.21396099},"labels":[],"label_agreement":null},{"id":"W2264859574","doi":"10.1145/2856400.2876011","title":"A framework to transform in-core GPU algorithms to out-of-core algorithms","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Porting; Out-of-core algorithm; Parallel computing; Core (optical fiber); Algorithm; Set (abstract data type); Many core; Multi-core processor; General-purpose computing on graphics processing units; Instruction set; Operating system; Programming language; Software; Graphics","score_opus":0.04177681863237576,"score_gpt":0.31515365601124246,"score_spread":0.2733768373788667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2264859574","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015475145,0.00001934073,0.98942035,0.004117055,0.0003725126,0.00039211017,0.000004302726,0.0004984065,0.0036284311],"genre_scores_gemma":[0.08854809,0.000016488792,0.9089668,0.0012653072,0.00006994695,0.00004168617,5.859747e-7,0.000014742966,0.0010763945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982891,0.00002314335,0.0004251722,0.00052278046,0.00032218825,0.00041761703],"domain_scores_gemma":[0.9987473,0.0001691051,0.000058119855,0.00066266034,0.00013790582,0.00022492607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037442465,0.00019750299,0.00028828185,0.0003396267,0.000050404687,0.000049657792,0.0011808595,0.00013322808,0.000037678376],"category_scores_gemma":[0.00010109123,0.00013736701,0.00008451094,0.0008702943,0.000027656684,0.0002230667,0.00023111817,0.0001184365,0.00010825073],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001904618,0.00014208128,0.0007094672,0.0000138350915,0.000015325091,0.000016456053,0.004278505,0.001237606,0.0006596374,0.049104452,0.005100199,0.9387034],"study_design_scores_gemma":[0.0032887005,0.0039138063,0.008968351,0.002925038,0.000025064704,0.000044664914,0.00026746924,0.45335856,0.13396558,0.31733933,0.07168901,0.0042144083],"about_ca_topic_score_codex":0.00005339176,"about_ca_topic_score_gemma":0.000027146965,"teacher_disagreement_score":0.93448895,"about_ca_system_score_codex":0.00006709995,"about_ca_system_score_gemma":0.00006322139,"threshold_uncertainty_score":0.5601664},"labels":[],"label_agreement":null},{"id":"W2268492982","doi":"10.82308/18434","title":"Mix10: a MATLAB to X10 compiler for high performance","year":2014,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Programming language; MATLAB; Set (abstract data type); Code generation; Parallel computing; Operating system; Key (lock)","score_opus":0.015837803298820043,"score_gpt":0.2321515773519082,"score_spread":0.21631377405308816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268492982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80988467,0.0000347033,0.14683941,0.0007068169,0.0015162459,0.0016064739,0.00014250592,0.0036063297,0.035662867],"genre_scores_gemma":[0.7208175,0.000010697392,0.27632502,0.0018471025,0.000044789675,0.000110743305,0.0000129076125,0.000041969877,0.0007892421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714667,0.00019994125,0.0005545388,0.00092101505,0.0004534993,0.0007243576],"domain_scores_gemma":[0.99769336,0.00029027357,0.0002081956,0.0011020128,0.00036738702,0.00033878602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012334388,0.00038806858,0.0004236985,0.00029899398,0.0010173157,0.00020940622,0.0017586703,0.00018792858,0.00002171877],"category_scores_gemma":[0.00033433142,0.00039033138,0.00013338121,0.000706398,0.00004158405,0.0008369448,0.00060937204,0.00035641086,0.00031333245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004824673,0.00014957532,0.00006632335,0.0000826322,0.000035481942,0.0000032076414,0.0000084233125,0.0068502855,0.004481968,0.7092923,0.00028335804,0.27869824],"study_design_scores_gemma":[0.002436569,0.0015622621,0.0028164524,0.00033364267,0.000042766627,0.00006534431,0.000007818611,0.21767192,0.2482175,0.07951147,0.44510812,0.0022261527],"about_ca_topic_score_codex":0.000041569314,"about_ca_topic_score_gemma":0.000010056026,"teacher_disagreement_score":0.6297808,"about_ca_system_score_codex":0.00019387335,"about_ca_system_score_gemma":0.00002119963,"threshold_uncertainty_score":0.99985486},"labels":[],"label_agreement":null},{"id":"W2269410433","doi":"10.1002/spe.2393","title":"Register allocation and spilling using the expected distance heuristic","year":2016,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Allocator; Register allocation; Computer science; Profiling (computer programming); Compiler; Parallel computing; Operating system","score_opus":0.026264379434039448,"score_gpt":0.30093789960287226,"score_spread":0.27467352016883284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269410433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021487456,0.000818141,0.97511965,0.0021028144,0.0000858807,0.0000880998,3.4865616e-7,0.00022522477,0.000072359064],"genre_scores_gemma":[0.7144528,0.00036898357,0.28456378,0.0004944003,0.000029525447,0.000013360353,1.9277023e-7,0.0000050895424,0.00007182727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912274,0.00009073837,0.0001524291,0.0003228651,0.00015216316,0.00015906643],"domain_scores_gemma":[0.9987818,0.00055690226,0.00014440094,0.00035303304,0.00012075798,0.00004312501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023279841,0.00009795761,0.00008078944,0.000029617942,0.00033762475,0.00021815657,0.0002729981,0.000033314544,0.0000016868951],"category_scores_gemma":[0.0010459184,0.000058609137,0.000012296014,0.00017203798,0.00014364973,0.0011657808,0.00016672304,0.0000628698,0.0000015269616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026190048,0.00032038495,0.01965269,0.00014461037,0.00009522288,0.00013265411,0.13740927,0.0009948249,0.013156222,0.17655742,0.0022158208,0.649059],"study_design_scores_gemma":[0.0041053556,0.0010867518,0.010506336,0.0025957355,0.0001922409,0.0035041536,0.015494268,0.5913226,0.033395007,0.049224783,0.28335735,0.0052154395],"about_ca_topic_score_codex":0.000027292475,"about_ca_topic_score_gemma":0.0000011909801,"teacher_disagreement_score":0.6929654,"about_ca_system_score_codex":0.00002115677,"about_ca_system_score_gemma":0.000026115127,"threshold_uncertainty_score":0.25967708},"labels":[],"label_agreement":null},{"id":"W2273003839","doi":"","title":"IPMACC: Translating OpenACC API to OpenCL","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Compiler; Parallel computing; Overhead (engineering); Operating system; Set (abstract data type); Programming language","score_opus":0.06147002004597902,"score_gpt":0.31279322532841936,"score_spread":0.25132320528244034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273003839","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041591685,0.000025980657,0.8699395,0.0027045894,0.00011702899,0.00014679022,1.8069638e-7,0.00074404775,0.12590595],"genre_scores_gemma":[0.286691,8.991779e-7,0.71022165,0.0014945156,0.000028295097,0.0000082790475,5.8387104e-7,0.000005398001,0.0015493585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909544,0.00004535892,0.00017867556,0.00027888498,0.00019954842,0.00020208517],"domain_scores_gemma":[0.9992452,0.000023648608,0.000030604886,0.00038159257,0.00011050918,0.000208403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045336384,0.00009179723,0.00011117581,0.000087378205,0.00007250788,0.0002501964,0.0010469833,0.000032817956,0.000017164857],"category_scores_gemma":[0.000053271535,0.00007983098,0.000027426146,0.00042003416,0.000007566918,0.0003962101,0.00028971035,0.00006346951,0.00018533574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001877757,0.0001657698,0.0009235903,0.000013054695,0.000026337868,0.000032200747,0.010467002,0.10119237,0.0006586166,0.24950917,0.2620019,0.3749912],"study_design_scores_gemma":[0.00055204896,0.00022832079,0.000113387854,0.000032080177,0.00000265356,0.000023910055,0.000082230385,0.9349389,0.0113403695,0.008423296,0.043754898,0.00050790823],"about_ca_topic_score_codex":0.000075195065,"about_ca_topic_score_gemma":0.000008212921,"teacher_disagreement_score":0.83374655,"about_ca_system_score_codex":0.000023467912,"about_ca_system_score_gemma":0.00007384658,"threshold_uncertainty_score":0.32554126},"labels":[],"label_agreement":null},{"id":"W2274575838","doi":"10.1007/0-387-27705-6_16","title":"Cluster Computing: High-Performance, High-Availability, and High-Throughput Processing on a Network of Computers","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Throughput; Computer science; Cluster (spacecraft); Supercomputer; Computer cluster; Computer architecture; Computer network; Parallel computing; Operating system","score_opus":0.014807321190521174,"score_gpt":0.2304928100208618,"score_spread":0.21568548883034064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274575838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032531065,0.00068605284,0.6289488,0.0010582857,0.0023186966,0.0015286113,0.000022640621,0.0022464183,0.3599374],"genre_scores_gemma":[0.606368,0.00009620596,0.26449808,0.0046004406,0.0023236398,0.000040436917,0.00020295539,0.00034961756,0.1215206],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943895,0.00014161877,0.0016566147,0.0017557081,0.0010928925,0.0009637061],"domain_scores_gemma":[0.9960534,0.00039907917,0.0015198289,0.0012546356,0.00050281204,0.00027024467],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.001374414,0.0010234793,0.0013509782,0.00052941206,0.000406358,0.0007618895,0.0025220069,0.0014771994,0.000011271999],"category_scores_gemma":[0.000042442276,0.0010046004,0.00018262136,0.00020905459,0.0006272061,0.0010878419,0.0017727406,0.0023636117,0.000013139766],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001099098,0.00007380096,0.0003152159,0.0007595986,0.00022714281,0.000019449017,0.00057827507,0.07014123,0.000010260855,0.19519918,0.56020206,0.17236386],"study_design_scores_gemma":[0.005421353,0.0017170794,0.002145292,0.008094536,0.00035009062,0.00016075169,0.0000110930705,0.5505972,0.00063483644,0.16360658,0.26123622,0.006024963],"about_ca_topic_score_codex":0.000099176505,"about_ca_topic_score_gemma":0.0000022281868,"teacher_disagreement_score":0.6031149,"about_ca_system_score_codex":0.00028243038,"about_ca_system_score_gemma":0.0004372506,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W2274813036","doi":"10.1109/fpt.2015.7393142","title":"Resource and memory management techniques for the high-level synthesis of software threads into parallel FPGA hardware","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Shared memory; Computer hardware; Parallel computing; Distributed memory; Registered memory; Field-programmable gate array; Uniform memory access; Memory map; Software; POSIX Threads; Distributed shared memory; Thread (computing); Embedded system; Memory management; Operating system; Semiconductor memory","score_opus":0.0350393575440201,"score_gpt":0.264971044748907,"score_spread":0.22993168720488688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274813036","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006981777,0.00026957688,0.99389434,0.0016936582,0.000043599026,0.0005045366,0.0000036213103,0.00074742455,0.0027734078],"genre_scores_gemma":[0.04717028,0.00007412685,0.95085585,0.00036322538,0.000028839746,0.00018927196,0.0000022280321,0.000013221916,0.0013029778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889076,0.000060976876,0.0002630643,0.00033415543,0.00026164774,0.00018939213],"domain_scores_gemma":[0.99857175,0.00039712974,0.00012378677,0.0006546448,0.00017590025,0.0000767721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080172333,0.00015350408,0.00020663714,0.000119770135,0.0001539712,0.00009327563,0.00093668734,0.000067731795,0.0000023764185],"category_scores_gemma":[0.00014068857,0.00010459557,0.000056600224,0.00021029958,0.00009102643,0.00016293196,0.0005479966,0.00006364593,0.0000015013736],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004663349,0.00009063855,0.00014208503,0.00015650001,0.00010572753,0.0000037186592,0.001035122,0.0036137346,0.000011113181,0.074106045,0.088638246,0.83205044],"study_design_scores_gemma":[0.002750482,0.0013433775,0.0034629256,0.00089151366,0.0003279753,0.00006655373,0.0022855843,0.38926858,0.16049434,0.25817275,0.17827995,0.0026559804],"about_ca_topic_score_codex":0.00008831941,"about_ca_topic_score_gemma":0.00000671415,"teacher_disagreement_score":0.82939446,"about_ca_system_score_codex":0.000030296454,"about_ca_system_score_gemma":0.000030400908,"threshold_uncertainty_score":0.42652836},"labels":[],"label_agreement":null},{"id":"W2276747962","doi":"10.1007/0-306-47015-2_26","title":"A Programming System for Parallel Execution of Fortran Subprograms in Distributed Environment","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Fortran; Parallel computing; Programming language; Object-oriented programming; Scheduling (production processes); Programming paradigm; Operating system","score_opus":0.021417292208056327,"score_gpt":0.24077551364486804,"score_spread":0.21935822143681172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276747962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022219425,0.0005803306,0.9332982,0.00021914006,0.00023612939,0.0022643076,0.00004009394,0.00081142026,0.06252821],"genre_scores_gemma":[0.09861148,0.00015734306,0.7648934,0.00029917317,0.0008137901,0.0021145828,0.0012529605,0.00035870165,0.13149856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99652123,0.000048480317,0.0012629648,0.00093064917,0.0005859706,0.0006507016],"domain_scores_gemma":[0.99795485,0.000100425976,0.00088517,0.0007520564,0.00012588657,0.0001816393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010007286,0.0005316493,0.00074711884,0.00047719773,0.00010139499,0.00026139873,0.0016664888,0.001112758,0.000004064239],"category_scores_gemma":[0.000029201976,0.00055047823,0.00032374018,0.00007385768,0.00016060918,0.00060319225,0.0003302737,0.00096512923,0.000003602895],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011763251,0.00010480689,0.00012128212,0.00081968517,0.0002315806,0.000020627625,0.0011502873,0.005285531,0.00004622365,0.4977245,0.012775536,0.4816023],"study_design_scores_gemma":[0.0023234235,0.00037428984,0.000035944933,0.001621558,0.000111215275,0.000048816415,0.00006563419,0.06929589,0.0003557927,0.017359393,0.90681237,0.0015956644],"about_ca_topic_score_codex":0.000019435985,"about_ca_topic_score_gemma":0.0000037703635,"teacher_disagreement_score":0.8940368,"about_ca_system_score_codex":0.0005559157,"about_ca_system_score_gemma":0.00017017596,"threshold_uncertainty_score":0.99969465},"labels":[],"label_agreement":null},{"id":"W2278073748","doi":"10.1109/fpt.2015.7393135","title":"Exploring pipe implementations using an OpenCL framework for FPGAs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Construct (python library); Implementation; Computer science; Field-programmable gate array; Component (thermodynamics); Resource (disambiguation); FIFO (computing and electronics); Embedded system; Computer architecture; Parallel computing; Operating system; Software engineering; Programming language; Computer network","score_opus":0.47949295427589483,"score_gpt":0.4234890139521864,"score_spread":0.05600394032370842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278073748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059894524,0.000010254993,0.9919351,0.00029040576,0.00022470174,0.00020291473,0.0000010353737,0.0005767291,0.00076943444],"genre_scores_gemma":[0.16927095,0.0000028068239,0.8302976,0.00027266907,0.00006681169,0.00004045314,0.000003472828,0.0000070231745,0.00003821139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922854,0.000036994366,0.0001715045,0.00023828752,0.00012997517,0.00019469012],"domain_scores_gemma":[0.9992466,0.00006810944,0.000055283013,0.0003425061,0.00016254792,0.00012492754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036828866,0.00007965455,0.000085795546,0.00008418149,0.00016731079,0.00022649787,0.00051983335,0.000025248914,0.00000648698],"category_scores_gemma":[0.00007595975,0.00007693534,0.000028429376,0.00025124228,0.000010192079,0.001161945,0.00015800877,0.000049244936,0.000004644176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005842331,0.000121073754,0.00032660287,0.000008661795,0.000014954871,0.0000017949269,0.004124079,0.07571976,0.00019329954,0.88967067,0.0019384933,0.027874762],"study_design_scores_gemma":[0.0002002731,0.00010246766,0.000039540886,0.000015633945,0.0000036738893,0.000004403773,0.00025566545,0.9118894,0.0077417907,0.07787088,0.0016987678,0.00017754738],"about_ca_topic_score_codex":0.00007100366,"about_ca_topic_score_gemma":0.0000047393705,"teacher_disagreement_score":0.8361696,"about_ca_system_score_codex":0.00004083897,"about_ca_system_score_gemma":0.00007785691,"threshold_uncertainty_score":0.31373322},"labels":[],"label_agreement":null},{"id":"W2278290577","doi":"10.4230/oasics.fsfma.2013.32","title":"On the Determinism of Multi-core Processors","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Core (optical fiber); Computer science; Multi-core processor; Determinism; Parallel computing; Philosophy; Telecommunications; Epistemology","score_opus":0.04619803570894649,"score_gpt":0.2935138285973516,"score_spread":0.2473157928884051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278290577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052826,0.000052734835,0.9394551,0.00056666875,0.000988073,0.002593539,0.00020016528,0.00064232206,0.0026753875],"genre_scores_gemma":[0.67177707,0.000082745624,0.32482478,0.0017293274,0.000102383136,0.00066328933,0.00021541216,0.000069250214,0.0005357388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675226,0.00006324934,0.0014963684,0.00044950168,0.00062585017,0.0006127639],"domain_scores_gemma":[0.9955493,0.00035728395,0.0014973808,0.0019049564,0.00054831593,0.00014274284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077873113,0.0006046427,0.00068217213,0.0003501432,0.000303396,0.00053788687,0.003623609,0.00050786603,0.000015498212],"category_scores_gemma":[0.00025020365,0.0004279552,0.0004023578,0.00026762515,0.00017853103,0.0005311295,0.0021884907,0.0009802592,0.000073037445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002700552,0.004354533,0.0027740998,0.013637567,0.0017409398,0.000019879866,0.11704762,0.12223759,0.00008784956,0.5318029,0.11420052,0.09182646],"study_design_scores_gemma":[0.00083068997,0.00022283522,0.00013769866,0.0007239008,0.000024750885,0.000012332696,0.00012103186,0.9785775,0.0018227879,0.013795852,0.0031182964,0.0006123238],"about_ca_topic_score_codex":0.000019721952,"about_ca_topic_score_gemma":0.0000024553633,"teacher_disagreement_score":0.85633993,"about_ca_system_score_codex":0.0000885708,"about_ca_system_score_gemma":0.0001966803,"threshold_uncertainty_score":0.99981725},"labels":[],"label_agreement":null},{"id":"W227870380","doi":"10.1007/978-3-319-09873-9_30","title":"Power-Aware L1 and L2 Caches for GPGPUs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; General-purpose computing on graphics processing units; Page cache; Cache pollution; CUDA; Cache invalidation; Cache algorithms; Idle; Smart Cache; Throughput; Embedded system; Graphics; CPU cache; Operating system","score_opus":0.015596233634441048,"score_gpt":0.25099358609407835,"score_spread":0.2353973524596373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227870380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017737846,0.0005456211,0.9949243,0.00080476265,0.0008419618,0.00046044413,0.000005058834,0.000440263,0.0019598368],"genre_scores_gemma":[0.11495181,0.000055816316,0.8822061,0.0017343818,0.0002891265,0.00001844539,0.0000061173023,0.000040694962,0.0006975468],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701667,0.000031091306,0.00043763043,0.0014436576,0.00050691003,0.00056404324],"domain_scores_gemma":[0.9975898,0.0006217353,0.00027501266,0.001061138,0.0002812067,0.00017105819],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009003139,0.000480094,0.00052523287,0.0006291017,0.00033723135,0.0006080045,0.002288667,0.0003321112,0.00000517645],"category_scores_gemma":[0.00011254539,0.00044490336,0.000112538786,0.0002962506,0.00049040205,0.00027072703,0.0010728033,0.00043290382,0.0000073787933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011537711,0.000028116714,0.000066858614,0.0001204909,0.000022869111,0.000023176777,0.0010116061,0.0524578,0.000042432526,0.08945151,0.0005634061,0.8562002],"study_design_scores_gemma":[0.00025353828,0.000300955,0.00004377175,0.00027279533,0.000006737027,0.000054765533,9.013939e-8,0.85902244,0.0006931662,0.1318108,0.006873508,0.00066746084],"about_ca_topic_score_codex":0.000009588565,"about_ca_topic_score_gemma":0.000011301609,"teacher_disagreement_score":0.85553277,"about_ca_system_score_codex":0.000105969135,"about_ca_system_score_gemma":0.00025816454,"threshold_uncertainty_score":0.99980026},"labels":[],"label_agreement":null},{"id":"W2278832452","doi":"10.1137/16m1062454","title":"Reordering Strategy for Blocking Optimization in Sparse Linear Solvers","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Direction Générale de l’Armement; Université de Bordeaux; Agence Nationale de la Recherche","keywords":"Granularity; Solver; Computer science; Block (permutation group theory); Kernel (algebra); Sparse matrix; Parallel computing; Linear algebra; LU decomposition; Linear system; Computation; Algorithm; Theoretical computer science; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","score_opus":0.029945912898479372,"score_gpt":0.33527092304797645,"score_spread":0.3053250101494971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2278832452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001170638,0.00008370503,0.99745774,0.00057420926,0.000017591838,0.00015737455,0.0000017747587,0.000049442137,0.00048753442],"genre_scores_gemma":[0.58130807,0.0004529239,0.41791907,0.000046919416,0.00009778023,0.000035914167,0.000005150851,0.000006704683,0.00012748278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916697,0.000026690379,0.00029061484,0.00024092091,0.000118871016,0.00015590762],"domain_scores_gemma":[0.9989897,0.00005709235,0.00035219296,0.00041086425,0.000115524905,0.000074635325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047286588,0.00009642101,0.00018569751,0.00037878164,0.00083142193,0.0005961254,0.00050638214,0.000048187343,0.000004189311],"category_scores_gemma":[0.00003446622,0.00009024924,0.000109739834,0.00036956475,0.000025808384,0.00026746833,0.00006750945,0.00013525042,0.0000011569499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029471607,0.000030981224,0.0009182658,0.000003761826,0.000047187867,9.422243e-7,0.00002722824,0.9761435,0.000015977732,0.012501208,0.000035324534,0.0102727255],"study_design_scores_gemma":[0.00022101561,0.000032441036,0.00091706665,0.000014164621,0.000052387913,0.0000045870606,0.000013892077,0.9951832,0.00009141928,0.0021209093,0.001241762,0.00010713378],"about_ca_topic_score_codex":0.000012424378,"about_ca_topic_score_gemma":0.00000935288,"teacher_disagreement_score":0.58013743,"about_ca_system_score_codex":0.000027110254,"about_ca_system_score_gemma":0.00003305243,"threshold_uncertainty_score":0.63947093},"labels":[],"label_agreement":null},{"id":"W2280654368","doi":"10.1109/reconfig.2015.7393303","title":"Evaluating shared virtual memory in an OpenCL framework for embedded systems on FPGAs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Computer architecture; Parallel computing; Embedded system; Shared memory; Operating system","score_opus":0.17095559411688155,"score_gpt":0.41473053035044055,"score_spread":0.243774936233559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280654368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009099454,0.000028576022,0.9857366,0.00024735002,0.00036129917,0.000515289,0.0000012389672,0.00057613384,0.0034340566],"genre_scores_gemma":[0.38015053,6.413889e-7,0.6188616,0.0005518194,0.000051727035,0.000073317526,0.000005434948,0.000009503347,0.00029539232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843013,0.00031031464,0.00029598354,0.00041385237,0.0003184902,0.0002312295],"domain_scores_gemma":[0.9986935,0.00034757287,0.000101711885,0.00053309527,0.00020148563,0.0001225808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023998115,0.00012810552,0.00018556799,0.00014434151,0.00006728154,0.0003797784,0.0008385716,0.00009612465,0.000004346787],"category_scores_gemma":[0.0006327257,0.000114329436,0.000031129344,0.0002813596,0.000011897133,0.0005086369,0.00016867547,0.00013900126,0.000017223778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026234511,0.00010215247,0.00004455428,0.0000076282854,0.000004247136,0.0000025417428,0.002588805,0.71063405,0.00003703375,0.2733069,0.0023788528,0.010866973],"study_design_scores_gemma":[0.00039620462,0.00065920065,0.00003347088,0.00009065647,0.0000011826929,0.0000021671337,0.00021654498,0.9880893,0.00039444424,0.0098912725,0.00006182932,0.00016370212],"about_ca_topic_score_codex":0.000041099276,"about_ca_topic_score_gemma":0.0000060215916,"teacher_disagreement_score":0.37105107,"about_ca_system_score_codex":0.00007178287,"about_ca_system_score_gemma":0.00014757067,"threshold_uncertainty_score":0.4662219},"labels":[],"label_agreement":null},{"id":"W2280924807","doi":"10.1109/hipc.2015.25","title":"Characterizing Large Dataset GPU Compute Workloads Targeting Systems with Die-Stacked Memory","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Memory bandwidth; Memory footprint; Parallel computing; Cache; Solver; Computer architecture; Operating system","score_opus":0.029244290213390218,"score_gpt":0.26099446563776135,"score_spread":0.23175017542437112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280924807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012561101,0.00032074054,0.99305797,0.0003768248,0.00040168432,0.00023987379,0.000037896185,0.0013826881,0.0029262304],"genre_scores_gemma":[0.46884224,0.000027885782,0.52805823,0.0013206389,0.0002766206,0.000028757946,0.00070501707,0.00003472073,0.0007059176],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803734,0.00016596059,0.00036175805,0.00053102174,0.00041455464,0.00048934156],"domain_scores_gemma":[0.9985393,0.00006992431,0.00020980093,0.0007350971,0.00019660646,0.00024925554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048943,0.00023426619,0.00029548316,0.00013453397,0.0002028221,0.0005065014,0.0010505494,0.00007353955,0.000004521333],"category_scores_gemma":[0.000036766993,0.00018502098,0.00003124044,0.00037186025,0.000032674143,0.0007530563,0.0005778811,0.0001866167,0.000067907604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013855961,0.00077205274,0.002663137,0.0002293426,0.0002673572,0.0005529325,0.006460658,0.12719573,0.0005043235,0.030775009,0.81880784,0.011633084],"study_design_scores_gemma":[0.0006227237,0.00011735566,0.00007036316,0.00009615309,0.0000059415133,0.000032328055,0.00013860411,0.92555064,0.0005444554,0.000044371143,0.0723722,0.0004048585],"about_ca_topic_score_codex":0.00006656445,"about_ca_topic_score_gemma":0.0000036281413,"teacher_disagreement_score":0.7983549,"about_ca_system_score_codex":0.00005755678,"about_ca_system_score_gemma":0.00010226891,"threshold_uncertainty_score":0.75449365},"labels":[],"label_agreement":null},{"id":"W2281407436","doi":"10.1002/spe.2382","title":"DataMill: a distributed heterogeneous infrastructure forrobust experimentation","year":2015,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmarking; Dilemma; Computer science; Competition (biology); Empirical research; Compiler; Process (computing); Data science; Operating system","score_opus":0.026376792835969862,"score_gpt":0.31034585328382025,"score_spread":0.28396906044785036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281407436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014117271,0.0005376952,0.98393345,0.00035106894,0.00019572738,0.00012278146,0.0000052181226,0.0005756538,0.00016114351],"genre_scores_gemma":[0.49566627,0.00007696456,0.50323683,0.000905043,0.000031105286,0.000033112003,0.000026584554,0.0000072064645,0.0000168847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988625,0.00008620079,0.00018967867,0.00038851096,0.00025868448,0.00021442065],"domain_scores_gemma":[0.9989417,0.00012666792,0.0001415208,0.00041639328,0.00019952605,0.00017416925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018457406,0.00014161924,0.00011763575,0.00005211848,0.0001738906,0.00031071508,0.0004512429,0.00006336094,0.0000040235586],"category_scores_gemma":[0.0008035271,0.00013272365,0.000019611405,0.00027885503,0.00006692219,0.0018870087,0.00033325364,0.00010898409,0.000007606518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066927256,0.0010908761,0.015463089,0.00012901683,0.00023411766,0.0007668967,0.33140257,0.11066251,0.00188024,0.031277835,0.095045045,0.41137853],"study_design_scores_gemma":[0.004024892,0.0017584541,0.0017325627,0.00016516085,0.00007309836,0.0037585797,0.024341175,0.48196316,0.04252469,0.012747451,0.423743,0.003167782],"about_ca_topic_score_codex":0.00004657913,"about_ca_topic_score_gemma":8.3988726e-7,"teacher_disagreement_score":0.481549,"about_ca_system_score_codex":0.000048054815,"about_ca_system_score_gemma":0.00007319416,"threshold_uncertainty_score":0.54123133},"labels":[],"label_agreement":null},{"id":"W2287431757","doi":"10.1007/3-540-44520-x_50","title":"Identifying and Validating Irregular Mutual Exclusion Synchronization in Explicitly Parallel Programs","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semaphore; Mutual exclusion; Computer science; Lock (firearm); Compiler; Deadlock; Synchronization (alternating current); Code (set theory); Parallel computing; Distributed computing; Programming language; Computer network","score_opus":0.023040141872864635,"score_gpt":0.26301764083087753,"score_spread":0.2399774989580129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287431757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006310171,0.000661471,0.9959802,0.00019044959,0.00033435517,0.00053541135,6.979876e-7,0.00040359274,0.0012628249],"genre_scores_gemma":[0.24361458,0.0002621574,0.75543034,0.00032345657,0.00017349981,0.000017227398,0.000015674403,0.00003744415,0.00012559544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963115,0.00007457615,0.00067071297,0.0015425304,0.0007857554,0.00061494537],"domain_scores_gemma":[0.99840426,0.0001795488,0.00030178332,0.0008500837,0.00013334527,0.00013096747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009846902,0.000489077,0.00048711733,0.001035263,0.0003269415,0.0009148746,0.0017749495,0.00033602738,0.000010156596],"category_scores_gemma":[0.000048292248,0.00049463497,0.000070174516,0.00085219333,0.00034825175,0.0008313005,0.0013054312,0.0006248996,0.000010913983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003926913,0.0000281774,0.00015689617,0.00003810155,0.0000035302096,0.000049657538,0.0014163926,0.08671247,0.0000299206,0.0050131073,0.0000048185693,0.906543],"study_design_scores_gemma":[0.0002679569,0.000106101346,0.000112303096,0.00091632316,0.0000037131476,0.000061370425,4.2702015e-7,0.9135743,0.00021459044,0.08401884,0.00017564339,0.0005484428],"about_ca_topic_score_codex":0.00004185561,"about_ca_topic_score_gemma":0.000044774984,"teacher_disagreement_score":0.90599453,"about_ca_system_score_codex":0.00026402686,"about_ca_system_score_gemma":0.00023628799,"threshold_uncertainty_score":0.99975055},"labels":[],"label_agreement":null},{"id":"W2291811177","doi":"10.1109/socc.2015.7406990","title":"Exploiting multi-band transmission line interconnects to improve the efficiency of cache coherence in multiprocessor system-on-chip","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; MESI protocol; Cache coherence; Indirection; Cache algorithms; Cache; Cache invalidation; MESIF protocol; Smart Cache; Parallel computing; Bus sniffing; Cache pollution; Coherence (philosophical gambling strategy); CPU cache; Operating system","score_opus":0.046532244670679346,"score_gpt":0.2905265363844138,"score_spread":0.24399429171373443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291811177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092039,0.00006173509,0.90557337,0.00034534966,0.0001045364,0.000400909,6.6889476e-7,0.00027111842,0.00120333],"genre_scores_gemma":[0.8689746,0.0000015447607,0.13070638,0.00016255275,0.000016204762,0.00003117502,4.2670212e-7,0.0000068823074,0.00010016737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986381,0.0001246833,0.00039161497,0.00036601297,0.0002503958,0.00022922404],"domain_scores_gemma":[0.9989679,0.00020997609,0.000121125086,0.00039010894,0.00019085969,0.000120055156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009342476,0.00014518126,0.00020343087,0.00014811811,0.00006430902,0.00006366163,0.00092563836,0.000057493708,9.790109e-7],"category_scores_gemma":[0.00026263885,0.00009198847,0.000038021913,0.00054547697,0.000027848571,0.0001435562,0.00011369212,0.00014517456,0.0000079972215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003298507,0.002070078,0.0026991041,0.0008201311,0.00004153445,0.000055726847,0.07689579,0.57927245,0.075315475,0.015617336,0.0010857187,0.2457968],"study_design_scores_gemma":[0.0005768409,0.00028638387,0.000064385546,0.00028746272,0.0000014488934,0.000004058959,0.0004425605,0.80336934,0.19476376,0.000045250737,0.000030280744,0.00012819757],"about_ca_topic_score_codex":0.00016028385,"about_ca_topic_score_gemma":0.000012165118,"teacher_disagreement_score":0.77693564,"about_ca_system_score_codex":0.00005299131,"about_ca_system_score_gemma":0.00008342911,"threshold_uncertainty_score":0.3751181},"labels":[],"label_agreement":null},{"id":"W2293015622","doi":"10.1109/icpp.2015.39","title":"Automatic Performance Tuning of Stencil Computations on GPUs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stencil; Computer science; Heuristics; Computation; Parallel computing; CUDA; Graphics; Titan (rocket family); Heuristic; Computational science; Algorithm; Artificial intelligence; Computer graphics (images)","score_opus":0.04905661481208288,"score_gpt":0.27352006558083547,"score_spread":0.2244634507687526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293015622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072315685,0.000014214238,0.9035144,0.00016096019,0.00009164725,0.00006217918,1.7761914e-7,0.0005786505,0.02326213],"genre_scores_gemma":[0.6307588,0.0000016307782,0.36893353,0.00011348842,0.000006480278,0.0000020465807,6.3248046e-7,0.0000023234686,0.00018108076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999299,0.000039055547,0.00018865366,0.00013489497,0.00022922945,0.000109198205],"domain_scores_gemma":[0.9993474,0.00006650106,0.00008446766,0.00027018704,0.00016806045,0.00006339835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028005295,0.00006757765,0.00010401603,0.00011020405,0.000053102707,0.0000358775,0.00040671148,0.00002417028,0.0000049483865],"category_scores_gemma":[0.000045941244,0.000058040187,0.00002257617,0.00031210974,0.000022128597,0.00018677331,0.000095126314,0.00005373055,0.000030374676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005156442,0.00022790811,0.0020411417,0.00005637905,0.000023026387,0.000003931374,0.0035369594,0.6789501,0.00006189505,0.10179594,0.013445735,0.19985189],"study_design_scores_gemma":[0.00013874649,0.00015930453,0.0007217391,0.000033311346,0.00000112762,0.000004203555,0.000019902418,0.99662906,0.0012549371,0.0008095288,0.00015607807,0.00007207066],"about_ca_topic_score_codex":0.000009890694,"about_ca_topic_score_gemma":3.920854e-7,"teacher_disagreement_score":0.5584431,"about_ca_system_score_codex":0.00002812036,"about_ca_system_score_gemma":0.00008860345,"threshold_uncertainty_score":0.23668101},"labels":[],"label_agreement":null},{"id":"W2293057678","doi":"10.1145/2847263.2847294","title":"A Scalable Heterogeneous Dataflow Architecture For Big Data Analytics Using FPGAs (Abstract Only)","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Dataflow; Scalability; SPARK (programming language); Field-programmable gate array; Analytics; Big data; Computer architecture; Dataflow architecture; Data analysis; Symmetric multiprocessor system; Distributed computing; Parallel computing; Embedded system; Operating system; Database; Programming language","score_opus":0.110060519611358,"score_gpt":0.31153327114701723,"score_spread":0.20147275153565924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293057678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001521095,0.00004861265,0.99620336,0.000711939,0.0002650875,0.00019718138,0.000066398105,0.0005228632,0.00046347664],"genre_scores_gemma":[0.13252352,0.000021179198,0.8661623,0.00037309923,0.00024483638,0.00000314067,0.00003196926,0.000017889814,0.00062203896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852103,0.000028315395,0.00026814715,0.00063435215,0.00019423642,0.00035392912],"domain_scores_gemma":[0.9976246,0.00018825452,0.00011102709,0.0018722522,0.00009737821,0.000106503365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035835354,0.00016621767,0.00018200756,0.00014237953,0.00015320495,0.00020316767,0.0021696922,0.00007373251,0.00000972919],"category_scores_gemma":[0.00011777761,0.00011006736,0.000054831984,0.0002566017,0.000041776828,0.0003480293,0.0008904899,0.000064323045,0.000010633194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033468245,0.00023202648,0.0003927998,0.000061293315,0.00012753259,0.000027043336,0.00008305575,0.115565106,0.0046319035,0.0035090346,0.031021712,0.84431505],"study_design_scores_gemma":[0.00035768925,0.000064799504,0.000030689593,0.000058606332,0.000013302464,0.00007724614,0.0000010849224,0.95266354,0.0074066953,0.0029968657,0.036032826,0.00029664495],"about_ca_topic_score_codex":0.00003848918,"about_ca_topic_score_gemma":0.000035133286,"teacher_disagreement_score":0.8440184,"about_ca_system_score_codex":0.000035069323,"about_ca_system_score_gemma":0.00014730319,"threshold_uncertainty_score":0.4488417},"labels":[],"label_agreement":null},{"id":"W2293141122","doi":"10.1109/inis.2015.52","title":"Simulation based Performance Study of Cache Coherence Protocols","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"MESI protocol; Computer science; Cache coherence; Cache; MESIF protocol; Cache pollution; Cache invalidation; Bus sniffing; Parallel computing; Cache algorithms; Energy consumption; Smart Cache; Coherence (philosophical gambling strategy); Cache coloring; Page cache; Protocol (science); CPU cache","score_opus":0.0930982699479368,"score_gpt":0.3482031655922154,"score_spread":0.25510489564427863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293141122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05904181,0.0000012759356,0.9349606,0.000019346506,0.000018468414,0.0035524743,7.887909e-8,0.0003086335,0.0020973198],"genre_scores_gemma":[0.86517197,2.6544761e-8,0.13421084,0.000038746537,0.0000061906176,0.00047065856,3.3648425e-7,0.0000024685767,0.00009877308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992414,0.00007102285,0.00018983902,0.00016413427,0.0002451015,0.00008851199],"domain_scores_gemma":[0.99915147,0.000083330764,0.00009753987,0.00036652063,0.00025403794,0.00004708286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037666448,0.00006509904,0.000098120596,0.00006458609,0.000034836776,0.00003794953,0.00044803595,0.000024258816,0.0000037434331],"category_scores_gemma":[0.000081387174,0.00005401503,0.000012468742,0.00029855612,0.000011673798,0.00022378803,0.00008402535,0.000043807162,0.0000058033047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005958986,0.00020087947,0.009402046,0.0000058052083,0.0000015869823,2.9244023e-7,0.00040048454,0.9867354,0.000010687203,0.00013819122,0.00010679196,0.0029918882],"study_design_scores_gemma":[0.00046413267,0.0006363159,0.0013964901,0.000013031456,8.70667e-7,1.159256e-7,0.000023799488,0.9950132,0.0022179617,0.00004972555,0.00011518627,0.00006917526],"about_ca_topic_score_codex":0.000024332234,"about_ca_topic_score_gemma":0.0000019007196,"teacher_disagreement_score":0.8061302,"about_ca_system_score_codex":0.000017537006,"about_ca_system_score_gemma":0.00008268358,"threshold_uncertainty_score":0.2202669},"labels":[],"label_agreement":null},{"id":"W2293164505","doi":"10.1109/pact.2015.30","title":"A Software-Managed Approach to Die-Stacked DRAM","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Speedup; Computer science; Dram; Cache; Parallel computing; CAS latency; Translation lookaside buffer; Software; Embedded system; CPU cache; Locality; Partition (number theory); Computer architecture; Computer hardware; Operating system; Memory controller; Semiconductor memory","score_opus":0.040547759727607734,"score_gpt":0.26898807962559995,"score_spread":0.2284403198979922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293164505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026228625,0.000024962505,0.92088777,0.0004336422,0.000101562866,0.00016709963,2.1849411e-7,0.0020435292,0.07607896],"genre_scores_gemma":[0.0804755,0.0000015689627,0.91460294,0.0013318282,0.00003176455,0.000020210045,0.0000022596537,0.000007625731,0.0035263132],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989518,0.00005891234,0.0001563275,0.0003551265,0.00024497352,0.00023286702],"domain_scores_gemma":[0.9990121,0.000031470518,0.000035865243,0.00056206767,0.00012667692,0.00023180584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039843228,0.00011125388,0.00012893653,0.00012890079,0.000072769355,0.00019662223,0.00092572195,0.00004365014,0.0000018783398],"category_scores_gemma":[0.00014214285,0.00009596198,0.000035820627,0.00040516295,0.000015511872,0.00023274723,0.00043095293,0.00007678656,0.000120859884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025960091,0.000627476,0.0005721217,0.000029198172,0.00004744079,0.000021662601,0.0073758005,0.16028987,0.000030657757,0.23853831,0.4761502,0.11629128],"study_design_scores_gemma":[0.00043076224,0.00016388751,0.00022043008,0.000010583061,0.0000034349637,0.00000994463,0.00005773361,0.93542486,0.00077884545,0.010338132,0.052108385,0.00045298488],"about_ca_topic_score_codex":0.00003571694,"about_ca_topic_score_gemma":0.0000015149282,"teacher_disagreement_score":0.77513504,"about_ca_system_score_codex":0.000036941306,"about_ca_system_score_gemma":0.000053434243,"threshold_uncertainty_score":0.3913216},"labels":[],"label_agreement":null},{"id":"W2293255575","doi":"","title":"Exception-less system calls for event-driven servers","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; System call; Asynchronous communication; Scalability; Operating system; Event (particle physics); Server; Context switch; Kernel (algebra); File system; Context (archaeology); Distributed computing; Computer network","score_opus":0.04959095330605878,"score_gpt":0.2614305043176114,"score_spread":0.2118395510115526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293255575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017776471,0.000009173207,0.98700356,0.000060223723,0.00021330707,0.00022251459,0.0000011477098,0.00107842,0.009633981],"genre_scores_gemma":[0.58806705,0.0000017558012,0.41113424,0.00008587219,0.00002222445,0.00002650416,0.0000014545637,0.0000047174317,0.000656199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992702,0.00003485968,0.00017729422,0.00024211865,0.00010230179,0.00017325376],"domain_scores_gemma":[0.9993968,0.000028115714,0.0000696814,0.00032751172,0.00011513262,0.00006278398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017745642,0.00008770706,0.00010747167,0.00006483305,0.0001033359,0.00005280913,0.0005961168,0.000051045918,0.000010581688],"category_scores_gemma":[0.0000074469485,0.00007770795,0.000067232686,0.00013780086,0.000013242764,0.00022020828,0.00010643464,0.00003579307,0.000029781053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015868356,0.00014874786,0.001822075,0.00014578192,0.00004963943,0.0000075746534,0.002267329,0.0076453844,0.00014199199,0.9444561,0.022158606,0.021140914],"study_design_scores_gemma":[0.000347581,0.000109169225,0.0012639943,0.00005307124,0.00000614979,0.00001087578,0.00009707786,0.99120873,0.0036928745,0.0020005405,0.0009469312,0.00026299444],"about_ca_topic_score_codex":0.000065161796,"about_ca_topic_score_gemma":0.000004862375,"teacher_disagreement_score":0.98356336,"about_ca_system_score_codex":0.000039566534,"about_ca_system_score_gemma":0.000030087627,"threshold_uncertainty_score":0.3168838},"labels":[],"label_agreement":null},{"id":"W2293779257","doi":"10.1007/978-3-319-24595-9_3","title":"Exploiting Fine- and Coarse-Grained Parallelism Using a Directive Based Approach","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Exploit; Compiler; Parallel computing; Overhead (engineering); Multi-core processor; Directive; Cluster (spacecraft); Optimizing compiler; Programming paradigm; Distributed computing; Programming language","score_opus":0.05035961286907456,"score_gpt":0.27606304790178265,"score_spread":0.2257034350327081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293779257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005631601,0.0006389589,0.99325997,0.00020614151,0.0004036739,0.0004340978,0.0000034602674,0.000538509,0.0044588596],"genre_scores_gemma":[0.06203225,0.000012166631,0.93702596,0.0005394437,0.00022195921,0.000010945094,0.0000069923494,0.000038351875,0.000111935486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996221,0.00008812325,0.0005213155,0.00166608,0.0008725297,0.0006309568],"domain_scores_gemma":[0.99752516,0.00039085708,0.00038264907,0.000999186,0.00045750008,0.00024467675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013884886,0.00058902416,0.0006430224,0.0009138235,0.0003459973,0.00061561464,0.001903992,0.00032941884,0.0000032072435],"category_scores_gemma":[0.00019207782,0.00055950443,0.00010179548,0.0006639821,0.0005966137,0.00052163465,0.0012085568,0.00068661076,0.0000030009883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010262234,0.00004442537,0.00003179385,0.00005140644,0.0000143376565,0.000052535772,0.00115076,0.76007533,0.000058064616,0.012033092,0.00006180273,0.22641617],"study_design_scores_gemma":[0.0003284062,0.000093666706,0.000006760802,0.00027068803,0.000007863026,0.00006027971,3.18524e-7,0.9505307,0.00024271235,0.047531232,0.00031345512,0.0006139037],"about_ca_topic_score_codex":0.000044215925,"about_ca_topic_score_gemma":0.000009318873,"teacher_disagreement_score":0.22580226,"about_ca_system_score_codex":0.00031253955,"about_ca_system_score_gemma":0.0006947582,"threshold_uncertainty_score":0.99968565},"labels":[],"label_agreement":null},{"id":"W2294048662","doi":"10.4108/eai.1-1-2016.150814","title":"Energy Efficient Dual Issue Embedded Processor","year":2015,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Industrial Networks and Intelligent Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Superscalar; Computer science; Embedded system; Efficient energy use; Dual (grammatical number); Battery (electricity); Computer architecture; Power (physics); Parallel computing; Electrical engineering; Engineering","score_opus":0.04378291957043357,"score_gpt":0.2555280405967123,"score_spread":0.21174512102627874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294048662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000301635,0.00050197134,0.9932689,0.000246519,0.0032391665,0.00036173328,0.000004013147,0.0005267678,0.001549266],"genre_scores_gemma":[0.99466014,0.00012556711,0.001916558,0.00013644049,0.00080040673,0.000099957746,0.000007680263,0.000023217686,0.0022300521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791294,0.00023923292,0.00054924004,0.00051816966,0.00039212249,0.00038830028],"domain_scores_gemma":[0.9987696,0.00013249434,0.00018218115,0.00040990365,0.00017948422,0.00032633787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538738,0.0002740065,0.00033394463,0.00024030673,0.00025779914,0.00035616185,0.00037241555,0.0002787384,0.000014367395],"category_scores_gemma":[0.000020863277,0.00024182591,0.00008460383,0.00062923814,0.000056683482,0.00015934472,0.000019023522,0.00037096362,0.00001734922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044313023,0.00012648625,0.000004015799,0.0000045225825,0.000035559508,0.0000062865224,0.00028082015,0.9606651,0.0000020953667,0.0027025698,0.0063096257,0.029818578],"study_design_scores_gemma":[0.00063448073,0.00033381247,5.594167e-7,0.00010029793,0.0000138447085,0.00003903538,0.00016114966,0.95345634,0.0009607104,0.000047674162,0.043983225,0.00026888735],"about_ca_topic_score_codex":0.00015892826,"about_ca_topic_score_gemma":0.0000036682566,"teacher_disagreement_score":0.9943585,"about_ca_system_score_codex":0.00008852096,"about_ca_system_score_gemma":0.00011292139,"threshold_uncertainty_score":0.98613745},"labels":[],"label_agreement":null},{"id":"W2298302970","doi":"10.82308/17923","title":"Hardware related optimizations in a Java virtual machine","year":2007,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Java; strictfp; Profiling (computer programming); Java concurrency; Virtual machine; Real time Java; Operating system; Workload; Embedded Java; Java annotation; Embedded system","score_opus":0.013372541287107376,"score_gpt":0.2403180391024766,"score_spread":0.2269454978153692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298302970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3214249,0.00084928644,0.33846682,0.0007845943,0.0025891114,0.0023953125,0.00033998513,0.010583945,0.32256603],"genre_scores_gemma":[0.84562194,0.0000668538,0.15228789,0.0005103195,0.000012564021,0.000018239194,0.000036521946,0.000049907132,0.001395793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966161,0.00028139265,0.0009247315,0.00089690456,0.0005250411,0.0007558194],"domain_scores_gemma":[0.99795246,0.00028369259,0.0002727254,0.0009385864,0.00025153218,0.00030102453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019535702,0.0003895262,0.00038284663,0.00073944434,0.00072151766,0.00013712596,0.0014265117,0.00031967834,0.000063066494],"category_scores_gemma":[0.0005694544,0.00042027008,0.00015133792,0.0021039003,0.00006880016,0.0012027933,0.0006149689,0.0008649798,0.00014697229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030950974,0.00034083083,0.0003268421,0.000014532331,0.000042876578,0.00019923208,0.000029379971,0.056698382,0.0013893169,0.8031392,0.000026558628,0.13776188],"study_design_scores_gemma":[0.0066584554,0.0010813482,0.0070802127,0.00066266273,0.00007172174,0.0005512168,0.00011694204,0.7034213,0.06605257,0.10894406,0.10088829,0.0044712042],"about_ca_topic_score_codex":0.0001282517,"about_ca_topic_score_gemma":0.00013485934,"teacher_disagreement_score":0.69419515,"about_ca_system_score_codex":0.00039359313,"about_ca_system_score_gemma":0.000039239083,"threshold_uncertainty_score":0.99982494},"labels":[],"label_agreement":null},{"id":"W2301552806","doi":"10.1145/2892208.2892227","title":"Reducing memory buffering overhead in software thread-level speculation","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rollback; Speculative multithreading; Parallel computing; Scalability; Speculative execution; Compiler; Thread (computing); Software; Overhead (engineering); Speculation; Operating system; Distributed computing; Embedded system; Multithreading; Computer architecture; Programming language","score_opus":0.0354181258631118,"score_gpt":0.26669500484419223,"score_spread":0.23127687898108043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301552806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011825395,0.000028208766,0.9803773,0.0005385041,0.000118971715,0.00008237498,3.8036822e-7,0.0005476565,0.006481202],"genre_scores_gemma":[0.4615831,0.000011902508,0.53679687,0.00009905915,0.000030357933,0.0000023706714,4.6512764e-7,0.000005747951,0.0014701512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991348,0.000036627876,0.00020204828,0.00029542542,0.00013802797,0.00019307768],"domain_scores_gemma":[0.99940246,0.00009542149,0.000054452958,0.00035043445,0.000056955163,0.00004028502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025163704,0.00009314982,0.0001035749,0.00013930093,0.00004115346,0.000055987304,0.0003562704,0.000048990234,0.000033334065],"category_scores_gemma":[0.000103626175,0.00006742682,0.000026337724,0.00028974417,0.0000151726135,0.0004422885,0.00016535509,0.000051287734,0.000053272543],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015486188,0.00014720869,0.017767156,0.000035873174,0.000017811624,0.000033072116,0.0015230316,0.03581116,0.008009515,0.1120375,0.0063590696,0.8182431],"study_design_scores_gemma":[0.002708684,0.0002175288,0.14605914,0.0012856926,0.0000068062423,0.00007291789,0.00004800033,0.60139537,0.16186824,0.08317569,0.0013140753,0.0018478397],"about_ca_topic_score_codex":0.00007342251,"about_ca_topic_score_gemma":0.000013738055,"teacher_disagreement_score":0.8163953,"about_ca_system_score_codex":0.00009066603,"about_ca_system_score_gemma":0.000038414924,"threshold_uncertainty_score":0.2749586},"labels":[],"label_agreement":null},{"id":"W2312852746","doi":"10.2514/6.2006-1617","title":"Comparison of MDO Architectures Within a Common Python Framework","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Python (programming language); Computer science; Programming language; Computer architecture; Software engineering","score_opus":0.018081497426793783,"score_gpt":0.31361077305902024,"score_spread":0.2955292756322265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312852746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03668489,0.00011445738,0.95039946,0.00026701755,0.00009369112,0.000083009254,4.0974663e-7,0.0006906498,0.011666411],"genre_scores_gemma":[0.54854494,4.5452953e-7,0.45124948,0.000081723236,0.000020039248,0.0000018323932,9.701721e-7,0.0000036964022,0.00009686544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999009,0.00007240472,0.00034975325,0.00021165432,0.00020671278,0.00015046056],"domain_scores_gemma":[0.9991578,0.00014489626,0.00017037797,0.000443271,0.000051542458,0.000032125932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018520739,0.00010594051,0.00022174961,0.000112284,0.00006070922,0.000059652342,0.00062723464,0.00007623288,0.0000082333745],"category_scores_gemma":[0.000025328356,0.00008892735,0.0000530076,0.000333547,0.000048544327,0.000047124526,0.0001591002,0.00016443337,0.0000055257915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001036005,0.0002929558,0.034571882,0.00002836086,0.000011441283,0.000002684226,0.0012294,0.33454812,0.00044648084,0.61111987,0.008440842,0.009297592],"study_design_scores_gemma":[0.00011413623,0.00012937933,0.005583065,0.000057853802,0.0000033274887,0.000005499202,0.000013360029,0.79019886,0.0664602,0.13664359,0.00058418256,0.00020655862],"about_ca_topic_score_codex":0.00018349821,"about_ca_topic_score_gemma":0.000024416395,"teacher_disagreement_score":0.51186,"about_ca_system_score_codex":0.000010592806,"about_ca_system_score_gemma":0.000020475343,"threshold_uncertainty_score":0.3626352},"labels":[],"label_agreement":null},{"id":"W2317200477","doi":"10.15514/ispras-2012-22-14","title":"On Optimizing OpenFOAM GPU Solvers","year":2012,"lang":"en","type":"article","venue":"Proceedings of the Institute for System Programming of RAS","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Preconditioner; Computer science; Parallel computing; Porting; CUDA; Conjugate gradient method; Computational science; Polygon mesh; Iterative method; Algorithm; Computer graphics (images); Software; Operating system","score_opus":0.022405086730849184,"score_gpt":0.2624261052647681,"score_spread":0.24002101853391894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317200477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04263176,0.00016544414,0.9455615,0.00020358403,0.0017225916,0.0017009242,0.0000044631474,0.00070984464,0.0072998395],"genre_scores_gemma":[0.5992502,8.825749e-7,0.40059167,0.000016312839,0.000045500758,0.000053334832,5.018609e-7,0.0000088395855,0.00003275856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865776,0.00000744017,0.00043760068,0.00023160563,0.00032522716,0.00034036735],"domain_scores_gemma":[0.9986188,0.0000600817,0.00059392647,0.0002386367,0.00041143323,0.00007713943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091226434,0.00016896642,0.00029390826,0.00013204855,0.00022121334,0.000098766046,0.0014106838,0.00008039837,1.6378092e-7],"category_scores_gemma":[0.00019032981,0.00012541134,0.00016767235,0.0004957287,0.00010214862,0.00074795925,0.0002980702,0.00009765705,0.0000012457947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048864542,0.00023643991,0.0012240474,0.001470086,0.00009965052,1.834655e-7,0.0016760875,0.005459201,0.001520894,0.9656993,0.0023307553,0.02023448],"study_design_scores_gemma":[0.0044242176,0.0024175649,0.00054043747,0.00999114,0.0003041505,0.0002207805,0.0016624574,0.27177423,0.6211208,0.004841379,0.08035521,0.0023476467],"about_ca_topic_score_codex":0.00003078004,"about_ca_topic_score_gemma":3.42474e-7,"teacher_disagreement_score":0.9608579,"about_ca_system_score_codex":0.000079414545,"about_ca_system_score_gemma":0.000051126706,"threshold_uncertainty_score":0.5114126},"labels":[],"label_agreement":null},{"id":"W2320450249","doi":"10.2316/p.2010.676-037","title":"Low-Complex Task Scheduling Algorithms for Hierarchical Embedded Many-Core Architectures and Dynamic Applications","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Processor scheduling; Dynamic priority scheduling; Many core; Scheduling (production processes); Distributed computing; Multi-core processor; Fair-share scheduling; Task (project management); Algorithm; Computer network; Mathematical optimization; Resource (disambiguation)","score_opus":0.014159194591029291,"score_gpt":0.28127375390317066,"score_spread":0.2671145593121414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320450249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043383494,0.00057213946,0.95449615,0.0004280384,0.00010025566,0.0004516088,0.000024465904,0.0004982049,0.00004562752],"genre_scores_gemma":[0.62399346,0.000073998046,0.37548527,0.00015285768,0.00012616043,0.000035324556,0.00011291773,0.000011323208,0.000008674465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828273,0.00004744781,0.0003518092,0.0007074583,0.00012694503,0.00048359996],"domain_scores_gemma":[0.99872714,0.00042362345,0.00014886113,0.00034775076,0.00009145032,0.00026114477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036828243,0.00028348202,0.0003257248,0.0000987507,0.0007894644,0.00034854873,0.00038509577,0.00018586546,9.866123e-7],"category_scores_gemma":[0.000042771862,0.0002630692,0.000060942344,0.0002555415,0.00021548361,0.000065031556,0.00039799162,0.0004945494,4.5698232e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073630574,0.00019942681,0.001290864,0.00016174781,0.00010100953,0.0000080571735,0.0006251482,0.39382142,0.00065730565,0.05681634,0.0006092904,0.54563576],"study_design_scores_gemma":[0.00060130033,0.00006921264,0.0032656894,0.000035926936,0.000014506901,0.000077534525,0.000014466212,0.9819328,0.0000115011035,0.012999825,0.00065443385,0.00032278552],"about_ca_topic_score_codex":0.000007634304,"about_ca_topic_score_gemma":0.000004305914,"teacher_disagreement_score":0.5881114,"about_ca_system_score_codex":0.000008769684,"about_ca_system_score_gemma":0.000026446382,"threshold_uncertainty_score":0.9999822},"labels":[],"label_agreement":null},{"id":"W2324876502","doi":"10.5121/cseij.2015.5101","title":"A Survey of Paradigms for Building and Designing Parallel Computing Machines","year":2015,"lang":"en","type":"article","venue":"Computer Science & Engineering An International Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Naval Academy; National Institute of Standards and Technology; Canadian Institute of Steel Construction","keywords":"Computer science; Data science; Computer architecture","score_opus":0.04429778029945081,"score_gpt":0.3139944890859613,"score_spread":0.2696967087865105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324876502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07135769,0.00010440014,0.9269474,0.00007873228,0.0012696517,0.00007840578,0.0000020684327,0.00015003953,0.000011601794],"genre_scores_gemma":[0.47675452,0.000006173941,0.5230612,0.000034732522,0.00013409242,0.0000010836144,0.0000012646095,0.000005738516,0.0000011582694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983403,0.000057277022,0.00039868115,0.00035571697,0.0005487721,0.00029925795],"domain_scores_gemma":[0.9979817,0.00019381658,0.00022965424,0.00022064109,0.0010953124,0.0002788569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003045582,0.0001541616,0.0001989498,0.00049244927,0.00017213414,0.000795105,0.0019538538,0.000036838515,2.9667092e-7],"category_scores_gemma":[0.0003362901,0.00014826158,0.000043069846,0.0004114842,0.000093011855,0.0012815307,0.00040218473,0.00015781228,2.8366432e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011557104,0.00003683644,0.006497383,0.000005189825,0.000025122003,0.000007752163,0.0008648723,0.9294855,0.0006141518,0.017337184,0.00009502765,0.045019448],"study_design_scores_gemma":[0.00038574936,0.00016022478,0.015050589,0.000064091495,0.000002047866,0.00023186422,0.0000028409847,0.982555,0.00061692554,0.0006681085,0.00009554353,0.00016701318],"about_ca_topic_score_codex":0.000037357993,"about_ca_topic_score_gemma":8.5984135e-7,"teacher_disagreement_score":0.40539685,"about_ca_system_score_codex":0.000084358755,"about_ca_system_score_gemma":0.00022657642,"threshold_uncertainty_score":0.76672155},"labels":[],"label_agreement":null},{"id":"W2330657922","doi":"10.1145/2851502","title":"Examining and Reducing the Influence of Sampling Errors on Feedback-Driven Optimizations","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Compiler; Sampling (signal processing); Optimizing compiler; Profiling (computer programming); Algorithm; Detector; Programming language","score_opus":0.025459240443890786,"score_gpt":0.2574581186130349,"score_spread":0.23199887816914413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330657922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028959105,0.000026141792,0.9666411,0.0037739133,0.00004872387,0.0002079232,0.000011437045,0.00019643425,0.00013520812],"genre_scores_gemma":[0.5885542,0.00018398551,0.41095263,0.00020513574,0.000009490878,0.000016475622,0.0000015888996,0.000010694728,0.00006582002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988539,0.00010868663,0.00027500233,0.0003967769,0.00018762465,0.0001779611],"domain_scores_gemma":[0.9985462,0.00054417603,0.00014738196,0.00058882654,0.000106802756,0.00006664918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018778778,0.00017423878,0.00015939312,0.00024037067,0.00043833157,0.00007756426,0.00043687172,0.00007837288,0.0000064777146],"category_scores_gemma":[0.000118884265,0.00011200494,0.00003412676,0.00041140203,0.00013862483,0.00022335153,0.000037264486,0.00016124967,8.0359786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001460961,0.000024035426,0.000034584988,0.0000065194267,0.000014054975,2.5745632e-7,0.00062942004,0.9376585,0.0003808473,0.00059125136,0.0000076085935,0.06063832],"study_design_scores_gemma":[0.00086153543,0.0005510784,0.0024315426,0.00059064414,0.000046499747,0.00004824237,0.00008650615,0.9877808,0.0040479004,0.0028753835,0.00022535339,0.00045449703],"about_ca_topic_score_codex":0.000009266372,"about_ca_topic_score_gemma":0.000005792743,"teacher_disagreement_score":0.55959505,"about_ca_system_score_codex":0.000019956864,"about_ca_system_score_gemma":0.000033398916,"threshold_uncertainty_score":0.4567429},"labels":[],"label_agreement":null},{"id":"W2331476467","doi":"10.2316/journal.211.2013.3.211-1053","title":"A GPGPU PROGRAMMING FRAMEWORK BASED ON A SHARED-MEMORY MODEL","year":2013,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Computer science; General-purpose computing on graphics processing units; Parallel computing; Programming paradigm; Shared memory; CUDA; Computer architecture; Programming language; Computer graphics (images); Graphics","score_opus":0.01196231576734502,"score_gpt":0.2428184954972875,"score_spread":0.2308561797299425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331476467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036745952,0.000544205,0.9932184,0.00078481605,0.000086142376,0.0003369165,0.0000037894483,0.00093193696,0.00041915738],"genre_scores_gemma":[0.6522454,0.000035021723,0.34682804,0.00073434395,0.0000675115,0.000026556998,0.00003078435,0.000011521462,0.00002082902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981285,0.000092610724,0.00033814088,0.0006652254,0.00021086489,0.0005646961],"domain_scores_gemma":[0.9986972,0.0003325282,0.00015236612,0.00043998772,0.00010797633,0.00026994635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030619794,0.00030827872,0.00030928696,0.00009956618,0.000502856,0.00070087094,0.00043555355,0.00020441577,0.000004615524],"category_scores_gemma":[0.00006256646,0.00027834513,0.000068601024,0.00039004805,0.00008602597,0.00019961478,0.0003209843,0.0004179248,0.0000058735113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009529984,0.000072800154,0.0004987508,0.00001569666,0.000010820824,0.000004115781,0.00012555957,0.92054576,7.8745126e-7,0.0046684085,0.002201975,0.071845815],"study_design_scores_gemma":[0.00037748154,0.000114835595,0.0010930855,0.00017892975,0.0000070515657,0.000010512123,0.000014146722,0.9931528,0.0000025685147,0.0045472165,0.00015589134,0.00034548846],"about_ca_topic_score_codex":0.000029110744,"about_ca_topic_score_gemma":4.405824e-7,"teacher_disagreement_score":0.6485708,"about_ca_system_score_codex":0.000022992808,"about_ca_system_score_gemma":0.000033854863,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W2339666327","doi":"10.1109/mm.2016.24","title":"Energy-Efficient Graphics and Multimedia in 28-nm Carrizo Accelerated Processing Unit","year":2016,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Benchmark (surveying); Computer science; Transcoding; Power management; Idle; Throughput; Graphics; Multimedia; Embedded system; Power (physics); Efficient energy use; Operating system; Real-time computing; Computer architecture; Electrical engineering; Engineering; Wireless","score_opus":0.025758427478601974,"score_gpt":0.262128859637374,"score_spread":0.23637043215877201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339666327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927613,0.00034922626,0.8393909,0.00032496214,0.00012322124,0.00006709758,0.000001653811,0.00031473956,0.0001521229],"genre_scores_gemma":[0.9343052,0.00008812498,0.0651688,0.00022642074,0.000027915963,0.000007768589,9.466702e-7,0.000009808847,0.0001650465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990448,0.00006132454,0.00021533432,0.00032745991,0.00011202961,0.00023910108],"domain_scores_gemma":[0.9994486,0.00007991798,0.00008101765,0.00022014265,0.00010263959,0.000067689194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020974837,0.00012483937,0.00012688056,0.00022578223,0.00009057343,0.00011050656,0.00037449948,0.00007723483,0.000001873677],"category_scores_gemma":[0.00002345083,0.000093664145,0.00002029861,0.0005229472,0.00006669503,0.00014376434,0.000096029085,0.00007531685,0.0000031510153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023851771,0.00027657475,0.0064349775,0.000047669942,0.000018241637,0.00005916971,0.002080938,0.004507423,0.24153453,0.002341743,0.0021841398,0.74049073],"study_design_scores_gemma":[0.00069499575,0.000042371543,0.0012617875,0.0001780592,0.0000026593693,0.00001427508,0.000006573129,0.83459365,0.1598155,0.00047801062,0.0025947755,0.00031732704],"about_ca_topic_score_codex":0.000050960312,"about_ca_topic_score_gemma":0.000014855786,"teacher_disagreement_score":0.83008623,"about_ca_system_score_codex":0.000024731675,"about_ca_system_score_gemma":0.00006593206,"threshold_uncertainty_score":0.3819513},"labels":[],"label_agreement":null},{"id":"W2341130085","doi":"10.5281/zenodo.45585","title":"assigner: update with new gsi_sim linux and mac install instructions","year":2016,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Operating system; OS X; Programming language; Software","score_opus":0.021715606621452832,"score_gpt":0.2262466955915896,"score_spread":0.20453108897013678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341130085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038308692,0.000041529733,0.9681107,0.0026314794,0.000053195967,0.00017234136,0.000015054925,0.0018916774,0.023253167],"genre_scores_gemma":[0.8798088,0.00042161046,0.11454577,0.00054405123,0.00018674163,7.7178754e-8,0.000111609406,0.00083903235,0.0035422964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882925,0.00012350224,0.00016491998,0.00040260472,0.00022957033,0.0002501568],"domain_scores_gemma":[0.9989728,0.000019125477,0.00008657679,0.00045268482,0.0002737977,0.00019506465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025650364,0.00011952151,0.00010385562,0.00020126281,0.0010980151,0.00073600526,0.0009353943,0.000045750698,0.00061284966],"category_scores_gemma":[0.000117633645,0.000089757144,0.000019907908,0.0004858668,0.00012172286,0.00055043865,0.0010221069,0.00011654223,0.0006865498],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034191777,0.00005760177,0.000025731393,0.000016376645,0.000039200244,0.000012770591,0.00072114565,0.00019907807,0.0017205555,0.0768724,0.15066952,0.76963145],"study_design_scores_gemma":[0.00066554744,0.0002610643,0.00045897835,0.000050142426,0.0000053821805,0.00024713555,0.000021579144,0.0030240144,0.0009958016,0.0017985537,0.99224514,0.00022668444],"about_ca_topic_score_codex":0.000009987688,"about_ca_topic_score_gemma":3.6600852e-7,"teacher_disagreement_score":0.87597793,"about_ca_system_score_codex":0.00005776237,"about_ca_system_score_gemma":0.000009530144,"threshold_uncertainty_score":0.8824438},"labels":[],"label_agreement":null},{"id":"W2343095407","doi":"10.1145/2798724","title":"Employing Software-Managed Caches in OpenACC","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reuse; Exploit; Directive; Programming paradigm; Cache; Software; Operating system; Parallel computing; Programming language; Computer security","score_opus":0.0751410574342717,"score_gpt":0.310551316731607,"score_spread":0.23541025929733533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343095407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35330427,0.00011016863,0.6458532,0.00011361854,0.00017475562,0.00021232499,6.836217e-7,0.00016217242,0.000068775626],"genre_scores_gemma":[0.937476,0.00009642387,0.062319484,0.000023279606,0.000022854929,0.00002144603,7.909371e-7,0.000010847809,0.000028869885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804634,0.0002799372,0.0005485471,0.00036786468,0.00053946336,0.00021782496],"domain_scores_gemma":[0.9986376,0.00027733325,0.00016999217,0.0005468298,0.0003205779,0.000047677568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031067417,0.00015589979,0.00024224001,0.00038483116,0.00023297095,0.00008016425,0.0005113202,0.00007778691,0.0000021497383],"category_scores_gemma":[0.0001106452,0.00012451601,0.000042482596,0.00034922504,0.000028262888,0.00045136202,0.000028825443,0.00012679913,0.0000041337753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006658625,0.000023890307,0.00060320925,0.00002556127,0.000008686053,1.1570937e-7,0.0005010485,0.8174449,0.000028222918,0.000082735954,0.0000031236632,0.18127182],"study_design_scores_gemma":[0.00067056343,0.00009206488,0.00068774814,0.0006754825,0.000011698499,0.0000063776306,0.00003720787,0.9969149,0.00033392158,0.00040150058,0.000005124347,0.0001633627],"about_ca_topic_score_codex":0.000075143595,"about_ca_topic_score_gemma":0.000004272335,"teacher_disagreement_score":0.5841717,"about_ca_system_score_codex":0.000096933705,"about_ca_system_score_gemma":0.00009624184,"threshold_uncertainty_score":0.50776154},"labels":[],"label_agreement":null},{"id":"W2344159446","doi":"","title":"Texture Cache Approximation on GPUs","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Kernel (algebra); Parallel computing; Texture (cosmology); Texture memory; CUDA; CPU cache; Fetch; Image (mathematics); Texture mapping; Computer graphics (images); Algorithm; Artificial intelligence; Computational science; Mathematics; Graphics; Geology; Discrete mathematics","score_opus":0.036357362169484195,"score_gpt":0.2710160572032377,"score_spread":0.23465869503375347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344159446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030712882,0.000017067054,0.8951698,0.0009801204,0.000101216545,0.000061014063,9.7700394e-8,0.0007709704,0.102592565],"genre_scores_gemma":[0.518739,0.0000017475807,0.47778097,0.001044611,0.000045894634,0.0000059080508,0.0000024297362,0.0000040270056,0.0023754118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944735,0.000035879104,0.00008604,0.00016725204,0.00016538237,0.00009810545],"domain_scores_gemma":[0.9995194,0.00001973364,0.000033733162,0.00028712727,0.000073471696,0.00006652904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144907,0.000061907536,0.00005703756,0.00005949712,0.000038460294,0.00008735409,0.000351268,0.00004145147,0.000004015928],"category_scores_gemma":[0.000042935993,0.00004840894,0.00001804665,0.00019033706,0.000008186074,0.00016021862,0.00007144634,0.00006371595,0.00009954846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071577256,0.00013036592,0.00017739592,0.0000054875454,0.000007786107,0.0000054979732,0.0011149046,0.037502866,0.00005115854,0.63829726,0.21801114,0.104688995],"study_design_scores_gemma":[0.00017017122,0.0000950212,0.00008504759,0.000006236183,7.485148e-7,0.0000063237685,0.000011172081,0.97262526,0.003384367,0.012495893,0.0110026,0.000117147225],"about_ca_topic_score_codex":0.0000086415575,"about_ca_topic_score_gemma":5.640017e-7,"teacher_disagreement_score":0.93512243,"about_ca_system_score_codex":0.000027127273,"about_ca_system_score_gemma":0.000031961652,"threshold_uncertainty_score":0.19740592},"labels":[],"label_agreement":null},{"id":"W2345041994","doi":"10.1145/2927964.2927968","title":"A Case Study in Reverse Engineering GPGPUs","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Kepler; Key (lock); Set (abstract data type); Parallel computing; Instruction set; Science and engineering; Computer architecture; Operating system; Programming language","score_opus":0.018129945766858346,"score_gpt":0.25801460500702006,"score_spread":0.23988465924016172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345041994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16072676,0.000022048313,0.8363409,0.0013780587,0.0002666015,0.00047027165,9.167611e-7,0.0007289453,0.00006549002],"genre_scores_gemma":[0.5763205,0.0000044328826,0.423117,0.0003276438,0.00014306071,0.000031536467,3.7041326e-7,0.000017355705,0.00003806297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976847,0.00025020298,0.0004328962,0.00076929684,0.00032626474,0.000536634],"domain_scores_gemma":[0.9974009,0.00067759247,0.00008829953,0.0015931292,0.000068165384,0.00017190712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048208475,0.0003044438,0.00032280383,0.0005511758,0.00009552992,0.00013486718,0.0018288966,0.00007967231,0.0000060515226],"category_scores_gemma":[0.00017502533,0.00021925943,0.00009245966,0.00070628664,0.00003252568,0.00024792698,0.0015297531,0.00032376323,0.000019527262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022211496,0.0005168975,0.012021039,0.000030375026,0.00006431066,0.013766539,0.009847074,0.060064077,0.0006087984,0.0008231894,0.0029920312,0.8992435],"study_design_scores_gemma":[0.013443712,0.0047070794,0.014409148,0.0009982352,0.000046501234,0.031422533,0.00021538259,0.88071185,0.0025777842,0.015967686,0.031153088,0.004346972],"about_ca_topic_score_codex":0.00024672627,"about_ca_topic_score_gemma":0.00014264659,"teacher_disagreement_score":0.8948965,"about_ca_system_score_codex":0.00008580168,"about_ca_system_score_gemma":0.00006781753,"threshold_uncertainty_score":0.89411396},"labels":[],"label_agreement":null},{"id":"W2346824377","doi":"10.1145/2971571.2971573","title":"Reduction of Parallel Computation in the Parallel Model for Ada","year":2016,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Parallel computing; Parallelism (grammar); Computer science; Reduction (mathematics); Computation; Loop (graph theory); Task parallelism; Automatic parallelization; Programming language; Compiler; Mathematics","score_opus":0.0331962137927896,"score_gpt":0.274088169665274,"score_spread":0.2408919558724844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346824377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023960076,0.00003300275,0.9542017,0.021117793,0.00011600769,0.00038233926,0.0000024643448,0.00013685193,0.000049785176],"genre_scores_gemma":[0.54135954,0.000013388707,0.4574126,0.001091229,0.000032256234,0.000052417592,0.0000034828488,0.000007276077,0.000027789632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865294,0.00011102631,0.00037217815,0.0003350061,0.00027832808,0.0002505378],"domain_scores_gemma":[0.9986831,0.0003968352,0.00020543928,0.0006040967,0.00007950397,0.00003102458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049868756,0.00014406374,0.00017542204,0.00013181879,0.00008805846,0.000047315712,0.0011893314,0.000056892084,9.1205345e-7],"category_scores_gemma":[0.00011356061,0.000094441595,0.000082802384,0.0002708821,0.00006508774,0.00037219186,0.00012583389,0.00007898348,0.000002223797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057595433,0.00009925979,0.00018931323,0.00003347726,0.000021221555,0.0000028684274,0.0022854684,0.9163006,0.009391194,0.010070228,0.041625503,0.019923301],"study_design_scores_gemma":[0.00088129146,0.00007704463,0.00041135494,0.000074262076,0.000006527691,0.000010781536,0.0000358005,0.97786385,0.001137848,0.018987413,0.0002902525,0.0002235799],"about_ca_topic_score_codex":0.000042252046,"about_ca_topic_score_gemma":0.000006581794,"teacher_disagreement_score":0.5173995,"about_ca_system_score_codex":0.00004715365,"about_ca_system_score_gemma":0.00004596588,"threshold_uncertainty_score":0.38512164},"labels":[],"label_agreement":null},{"id":"W2349830530","doi":"10.3850/9783981537079_0829","title":"Efficient Program Tracing and Monitoring Through Power Consumption — With a Little Help from the Compiler","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tracing; Compiler; Correctness; Debugging; TRACE (psycholinguistics); Code (set theory); Power consumption; Block (permutation group theory); Embedded system; Programming language; Power (physics)","score_opus":0.024552359260788862,"score_gpt":0.27534745025738744,"score_spread":0.2507950909965986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2349830530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19672666,0.00015468009,0.80092764,0.0007248254,0.00007392618,0.00022664698,7.4446194e-7,0.00056261464,0.00060226757],"genre_scores_gemma":[0.71671116,0.000021599002,0.28309244,0.000064708285,0.000026014572,0.000021838869,2.2843757e-7,0.0000041591456,0.000057837056],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992768,0.000047227535,0.00011343865,0.00025598117,0.00015184205,0.00015468849],"domain_scores_gemma":[0.99938446,0.00019448588,0.000051548865,0.0002838977,0.000052364907,0.000033245215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013015284,0.000093261144,0.00008332635,0.000015965674,0.0001522145,0.00016006362,0.00024645677,0.000030183366,0.000009165527],"category_scores_gemma":[0.000010631633,0.00004258437,0.000017009163,0.00009853542,0.00007058885,0.000117509655,0.00011329386,0.000054100707,0.000011276239],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105966086,0.0007823996,0.22294916,0.000031676343,0.00017480864,0.000024519355,0.01386949,0.011676996,0.0032018418,0.048457388,0.0034872068,0.69523853],"study_design_scores_gemma":[0.0042261365,0.0014116906,0.29161543,0.001874625,0.000049372597,0.00010103388,0.00043102066,0.6265064,0.054177217,0.004769951,0.013097671,0.0017394888],"about_ca_topic_score_codex":0.000031101892,"about_ca_topic_score_gemma":0.0000016516632,"teacher_disagreement_score":0.693499,"about_ca_system_score_codex":0.000016620088,"about_ca_system_score_gemma":0.000012956237,"threshold_uncertainty_score":0.173654},"labels":[],"label_agreement":null},{"id":"W2350996402","doi":"10.1017/cbo9781139878395.012","title":"Program initiation and execution","year":2001,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Programming language","score_opus":0.024096539285594975,"score_gpt":0.2215768905715966,"score_spread":0.19748035128600164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350996402","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010346842,0.000069292284,0.28151774,0.000017444208,0.00006412907,0.00026555834,0.0000062279614,0.00077664445,0.7172726],"genre_scores_gemma":[0.0008704675,0.00033995978,0.021694468,0.00006601415,0.000059051792,0.000001288537,0.000030632433,0.000017073991,0.976921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990855,0.000030637533,0.00012906933,0.00042544462,0.00016670299,0.00016263052],"domain_scores_gemma":[0.9991753,0.000028419647,0.00017704563,0.0003832997,0.00014225206,0.00009368086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008384406,0.00020917591,0.00018992998,0.00018418067,0.0001736529,0.00012222923,0.00045249477,0.00024007334,5.308942e-7],"category_scores_gemma":[0.0000048637016,0.00025712347,0.00006541803,0.000013584344,0.00008986989,0.00018195949,0.00040942527,0.00022449833,0.0000030775263],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006094149,0.0000074392187,0.0000010726283,0.000018236798,0.000017405555,0.000056634217,0.000026393183,0.000013388624,0.000002322,0.9654653,0.01041963,0.023966067],"study_design_scores_gemma":[0.00024050985,0.000091920105,0.000016960706,0.00009949187,0.000031558026,0.000033045642,0.0000021026651,0.015619385,0.00009370402,0.00012620198,0.98330617,0.00033897566],"about_ca_topic_score_codex":0.00002220207,"about_ca_topic_score_gemma":3.0143414e-7,"teacher_disagreement_score":0.9728865,"about_ca_system_score_codex":0.00008415832,"about_ca_system_score_gemma":0.00005071284,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W2375707682","doi":"","title":"Lock Free Technology and Its Application","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Semaphore; Computer science; Mutual exclusion; Thread (computing); Lock (firearm); Shared memory; Synchronization (alternating current); Multi-core processor; Distributed shared memory; Distributed computing; Embedded system; Operating system; Parallel computing; Uniform memory access; Computer network; Memory management; Semiconductor memory","score_opus":0.005043019080611174,"score_gpt":0.23241944787976215,"score_spread":0.227376428799151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375707682","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031871712,0.00015240688,0.9907095,0.003031699,0.000021656591,0.00058944547,0.000003107141,0.00134016,0.0009648486],"genre_scores_gemma":[0.17585863,0.000017345232,0.8230939,0.00033476768,0.00009370664,0.0004602059,0.0000066296066,0.000011618484,0.00012316942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989487,0.000012969904,0.00021883081,0.0005153335,0.00009265338,0.00021154838],"domain_scores_gemma":[0.99877226,0.00003832149,0.00009682504,0.00085560995,0.00015291995,0.0000840497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012746415,0.00014307634,0.0001270791,0.0003452733,0.0002531726,0.00011629979,0.001448042,0.00014704805,0.000002871412],"category_scores_gemma":[0.000002192467,0.00015044436,0.000029161416,0.000894592,0.000057175428,0.00018478546,0.0007040516,0.00026157385,0.000074812015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.0870426e-7,0.000073845295,0.00022055717,0.0000109263465,0.000007974509,4.4121782e-7,0.00006822865,0.00006785389,0.04765569,0.66938186,0.0019628778,0.28054923],"study_design_scores_gemma":[0.000343717,0.000029797553,0.00066178583,0.0000066361176,0.0000068021836,0.00011974402,0.0000030601686,0.1812306,0.045107022,0.08824176,0.68385595,0.00039309578],"about_ca_topic_score_codex":0.0000028356194,"about_ca_topic_score_gemma":0.0000034798145,"teacher_disagreement_score":0.6818931,"about_ca_system_score_codex":0.0000111956615,"about_ca_system_score_gemma":0.00003080669,"threshold_uncertainty_score":0.61349434},"labels":[],"label_agreement":null},{"id":"W2376727710","doi":"10.1145/2933575.2935310","title":"Proving Liveness of Parameterized Programs","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liveness; Correctness; Thread (computing); Computer science; Parameterized complexity; Programming language; Argument (complex analysis); Distributed computing; Theoretical computer science; Algorithm","score_opus":0.032525394011583,"score_gpt":0.27614590537560657,"score_spread":0.24362051136402357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2376727710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025618572,0.00006974644,0.9897608,0.00019959892,0.00028721237,0.00043894295,0.0000012228072,0.0011316416,0.0055489494],"genre_scores_gemma":[0.34957883,0.000022398393,0.6498389,0.000031115593,0.000029727604,0.00006093449,0.0000037983968,0.000009805501,0.0004244734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858606,0.00010624369,0.00037892142,0.0004981657,0.00022499767,0.00020559311],"domain_scores_gemma":[0.9983644,0.00006908946,0.00035355645,0.0009591859,0.00020033667,0.000053432384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034200662,0.00019200853,0.00034367552,0.0001283997,0.000034474655,0.0001417677,0.0015471102,0.00018286219,0.000006140081],"category_scores_gemma":[0.000042552314,0.00013871255,0.00013418253,0.0001293667,0.00005272245,0.00010923318,0.0021105972,0.00015640669,0.0000057609145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028830142,0.00050265394,0.0018937774,0.0009974843,0.00017457809,0.000015970649,0.0009650159,0.002751487,0.0016689033,0.119684204,0.0009906134,0.87032646],"study_design_scores_gemma":[0.0008456431,0.00041604723,0.0005366958,0.0028351787,0.000030164556,0.000016657626,0.000009674217,0.7423366,0.064713046,0.18448906,0.0022059614,0.0015652954],"about_ca_topic_score_codex":0.000026672456,"about_ca_topic_score_gemma":5.559438e-7,"teacher_disagreement_score":0.8687612,"about_ca_system_score_codex":0.000027114269,"about_ca_system_score_gemma":0.00016286552,"threshold_uncertainty_score":0.5656533},"labels":[],"label_agreement":null},{"id":"W2377581251","doi":"","title":"Analyzing Multiprocessor Structure","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cache coherence; Multiprocessing; MESI protocol; Parallel computing; Cache; Bus sniffing; Distributed memory; Shared memory; MESIF protocol; Cache invalidation; Cache algorithms; CPU cache","score_opus":0.007691058774904393,"score_gpt":0.25217889554804657,"score_spread":0.24448783677314218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2377581251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075880607,0.0002084459,0.995825,0.0012587203,0.000010289958,0.00028694852,0.0000037525128,0.0010192505,0.0006288099],"genre_scores_gemma":[0.13960256,0.0000107898695,0.8592906,0.00064262614,0.00021280655,0.00006329406,0.000011672853,0.00000977924,0.00015584778],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998962,0.000022641794,0.00024342317,0.00043629605,0.00010203809,0.00023363307],"domain_scores_gemma":[0.99917835,0.000036254467,0.00009702975,0.00048398136,0.000121902944,0.00008246038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008023808,0.00014639924,0.00012828443,0.00015066755,0.0002427368,0.000207802,0.0010990222,0.00006594582,0.00001116833],"category_scores_gemma":[5.834987e-7,0.00014511327,0.00005685062,0.00055661105,0.000025411176,0.00032380116,0.0002516672,0.00013565457,0.00008788544],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.366806e-7,0.000088806024,0.00029869174,0.000012770987,0.00001886141,5.3124614e-7,0.000338808,0.017115897,0.004802376,0.02243503,0.006737458,0.9481499],"study_design_scores_gemma":[0.00021937068,0.000011176592,0.0004295542,0.000009359044,0.0000051473817,0.000025486102,0.000002046925,0.3209266,0.019727796,0.0024371345,0.65590745,0.00029885056],"about_ca_topic_score_codex":0.0000033264985,"about_ca_topic_score_gemma":0.0000029119722,"teacher_disagreement_score":0.94785106,"about_ca_system_score_codex":0.000043135922,"about_ca_system_score_gemma":0.00003482597,"threshold_uncertainty_score":0.59175473},"labels":[],"label_agreement":null},{"id":"W2380589172","doi":"","title":"Pating GAS to a VLIW Processor","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Very long instruction word; Computer science; Key (lock); Digital signal processing; Generator (circuit theory); Digital signal processor; Parallel computing; Embedded system; Computer architecture; Computer hardware; Operating system; Power (physics)","score_opus":0.006736352186669799,"score_gpt":0.25352070167573054,"score_spread":0.24678434948906075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2380589172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003472494,0.000011796513,0.99049264,0.0020279074,0.00003609893,0.0006433333,0.0000020378764,0.001198527,0.0021151856],"genre_scores_gemma":[0.061114524,0.000001633839,0.93655074,0.0014519877,0.00017972534,0.0005250172,0.0000060617863,0.000013835719,0.00015646435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998793,0.00001815528,0.00025973082,0.00051072927,0.00013776327,0.00028063657],"domain_scores_gemma":[0.99888146,0.000054678407,0.00008684032,0.0006266936,0.00019301755,0.00015732471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001855379,0.00015023578,0.00012962426,0.00016385446,0.00028019256,0.00028229298,0.0013423796,0.00006886806,0.000008054088],"category_scores_gemma":[0.0000029114337,0.00015277516,0.000050939474,0.0007354026,0.00002334242,0.00018469244,0.00043074504,0.00022409213,0.00024157595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015187587,0.00019865492,0.00032635513,0.000024326688,0.000012484502,0.0000015248878,0.0010555525,0.0012298629,0.043086857,0.065177046,0.015089331,0.87379646],"study_design_scores_gemma":[0.0002155907,0.00004837387,0.0006663725,0.000019304414,0.0000046295027,0.000050364593,0.000005391215,0.0961647,0.03503931,0.008491797,0.85879415,0.0004999877],"about_ca_topic_score_codex":0.000009501703,"about_ca_topic_score_gemma":0.0000066376188,"teacher_disagreement_score":0.8732965,"about_ca_system_score_codex":0.000016333923,"about_ca_system_score_gemma":0.000058009704,"threshold_uncertainty_score":0.622999},"labels":[],"label_agreement":null},{"id":"W2383809103","doi":"","title":"Automatic Convert from Single Thread to Multithread","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Thread (computing); Programmer; Parallel computing; Operating system; Instruction set; Program structure; Programming language","score_opus":0.011286175283694473,"score_gpt":0.25138243244701564,"score_spread":0.24009625716332117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383809103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010509102,0.000023339615,0.98485684,0.0013148973,0.00008912773,0.0006438553,0.000009218057,0.0016740584,0.0008795634],"genre_scores_gemma":[0.06323754,0.0000015951013,0.93464667,0.0015191783,0.00017364493,0.0002729537,0.000023947445,0.00001692787,0.000107566215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865556,0.000025872352,0.00030491434,0.00058421463,0.00015432219,0.00027514095],"domain_scores_gemma":[0.99853,0.00012191109,0.00009417026,0.00093633,0.00013792077,0.00017971366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011422769,0.00018947039,0.00018670819,0.00015061577,0.00020635915,0.00029625188,0.001486344,0.00009715342,0.000039028022],"category_scores_gemma":[0.0000023259136,0.00019328066,0.00006817696,0.0004955494,0.000041076783,0.00020231727,0.000447295,0.00020763568,0.0007139536],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010744855,0.0003422632,0.0003560309,0.000008266853,0.000025164201,0.0000019082604,0.0007600356,0.00035152104,0.06961513,0.019823562,0.014232995,0.894482],"study_design_scores_gemma":[0.00041535895,0.000061023427,0.0026541385,0.000029390436,0.000011484078,0.00002415665,0.0000061110045,0.3573553,0.066877246,0.016026484,0.55587703,0.0006622865],"about_ca_topic_score_codex":0.00007876267,"about_ca_topic_score_gemma":0.000029346198,"teacher_disagreement_score":0.89381975,"about_ca_system_score_codex":0.000029947345,"about_ca_system_score_gemma":0.0000442488,"threshold_uncertainty_score":0.9176667},"labels":[],"label_agreement":null},{"id":"W2389629787","doi":"10.14288/1.0066716","title":"Architectures and limits of GPU-CPU heterogeneous systems","year":2008,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing","score_opus":0.01256733329696096,"score_gpt":0.18135760338516438,"score_spread":0.1687902700882034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2389629787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82815033,0.00048931997,0.17051618,0.000020557134,0.00005545938,0.000099839235,0.000010508735,0.00013982368,0.00051799865],"genre_scores_gemma":[0.9824548,0.00019555517,0.017120373,0.000015796952,0.000008374045,1.7026046e-7,0.0000013231138,0.000004388017,0.0001992639],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99928373,0.000056805726,0.00010687393,0.00025456434,0.00016562229,0.00013242166],"domain_scores_gemma":[0.9993771,0.000040639745,0.00012379092,0.00025428226,0.00013508102,0.000069130656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008879822,0.000033170625,0.00019927349,0.000054574084,0.00016684004,0.00004389566,0.0004448047,0.000058722053,0.000002070481],"category_scores_gemma":[0.000014108754,0.00010756751,0.000053551303,0.00019185075,0.00019062363,0.00009802788,0.00016648699,0.00006275054,0.0000011110704],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021075437,0.00043506277,0.037442468,0.00048315036,0.00017900094,0.001060588,0.0034865078,0.029046519,0.0009883684,0.000101759244,0.008194855,0.9185606],"study_design_scores_gemma":[0.0006153127,0.0002287665,0.9259204,0.00019572866,0.000011643434,0.0012497543,0.00007017096,0.07082591,0.00004307174,0.0003339783,0.00023657802,0.00026864026],"about_ca_topic_score_codex":0.015112663,"about_ca_topic_score_gemma":0.0029356596,"teacher_disagreement_score":0.918292,"about_ca_system_score_codex":0.000012400205,"about_ca_system_score_gemma":0.000037378257,"threshold_uncertainty_score":0.9914458},"labels":[],"label_agreement":null},{"id":"W2394967315","doi":"","title":"Data-dependence profiling to enable safe thread level speculation","year":2015,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Speculation; Compiler; Speculative execution; Parallel computing; Profiling (computer programming); Speculative multithreading; Thread (computing); Cache; Spec#; Supercomputer; Multithreading; Operating system; Programming language","score_opus":0.08294887851926361,"score_gpt":0.2845879590408981,"score_spread":0.2016390805216345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394967315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004680281,0.00009744361,0.9935416,0.00015084859,0.00055203,0.00016224328,0.0000033872589,0.00075851125,0.000053685457],"genre_scores_gemma":[0.12253149,0.000004019467,0.8771047,0.00020180605,0.000118517826,0.0000049861615,0.000004256284,0.000007629683,0.000022611523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810064,0.000017168984,0.00020728014,0.0007121601,0.0005892989,0.00037345794],"domain_scores_gemma":[0.99831027,0.000078312354,0.000047002988,0.0008875988,0.00035785965,0.00031894128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016982083,0.00015559737,0.00014695573,0.00035227157,0.0001872727,0.00067629537,0.0019170298,0.00003987114,4.5093026e-7],"category_scores_gemma":[0.0005634849,0.00015245122,0.000013311691,0.0012664206,0.000047756446,0.001697567,0.0018418607,0.00011528925,0.0000151261465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031810575,0.00003487253,0.0025878488,0.000033159966,0.000008664645,0.000020974416,0.0011060091,0.85119575,0.0005182254,0.021721998,0.0023642937,0.120404996],"study_design_scores_gemma":[0.000092892486,0.00004726236,0.00088545063,0.00004067433,0.0000014827438,0.000029174254,0.0000035870814,0.99479127,0.0017565,0.0005026148,0.0016247915,0.00022430452],"about_ca_topic_score_codex":0.000013536997,"about_ca_topic_score_gemma":8.383399e-7,"teacher_disagreement_score":0.14359549,"about_ca_system_score_codex":0.000085852014,"about_ca_system_score_gemma":0.00025560625,"threshold_uncertainty_score":0.6521532},"labels":[],"label_agreement":null},{"id":"W2395137269","doi":"10.1137/1.9781611973198.6","title":"Multi-Pivot Quicksort: Theory and Experiments","year":2013,"lang":"en","type":"article","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; Computer science; Cache; Hybrid algorithm (constraint satisfaction); Parallel computing; Algorithm; Sorting algorithm; Sorting; Artificial intelligence; Constraint satisfaction","score_opus":0.056048753163043495,"score_gpt":0.2772960848098143,"score_spread":0.22124733164677082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395137269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01566202,0.00004603709,0.98019254,0.000067073044,0.00006508244,0.00090459804,0.0000023588047,0.0002638562,0.0027964266],"genre_scores_gemma":[0.0965407,0.000007981084,0.9016762,0.0002713735,0.0000862256,0.00028007134,0.000002166475,0.000015919359,0.0011194116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991994,0.000010985741,0.00022723878,0.00025367623,0.000103796934,0.0002049069],"domain_scores_gemma":[0.9993821,0.0001836455,0.00011169305,0.00020052619,0.000035600093,0.000086477485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043681797,0.00014853984,0.00019068824,0.000020266223,0.00023978094,0.0002036142,0.00022605728,0.00015315643,0.0000028943516],"category_scores_gemma":[0.000020633024,0.0001239279,0.00008060815,0.000035481848,0.00009531654,0.0000645626,0.0002064904,0.00011451158,0.0000025216953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009410197,0.00013221374,0.00000693199,0.00009449903,0.0001153397,1.3728845e-7,0.011822835,0.000018037481,0.0072667487,0.90628994,0.007776445,0.06646745],"study_design_scores_gemma":[0.0069094626,0.0002791787,0.00001759271,0.00015953528,0.0000805421,0.000015562337,0.0038550666,0.23603311,0.06808188,0.67920274,0.0040679947,0.001297356],"about_ca_topic_score_codex":0.0000031251855,"about_ca_topic_score_gemma":7.598421e-8,"teacher_disagreement_score":0.23601508,"about_ca_system_score_codex":0.000011288006,"about_ca_system_score_gemma":0.000024367218,"threshold_uncertainty_score":0.5053633},"labels":[],"label_agreement":null},{"id":"W2396203134","doi":"10.1109/hotchips.2009.7478369","title":"Programming the Nallatech Xeon + multi-FPGA heterogeneous platform","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software portability; Computer science; Xeon Phi; Xeon; Scalability; Field-programmable gate array; Message Passing Interface; Parallel computing; Programming paradigm; Computer architecture; Focus (optics); Interface (matter); CUDA; Supercomputer; Symmetric multiprocessor system; Operating system; Message passing; Embedded system; Programming language","score_opus":0.028920172818973064,"score_gpt":0.2769825641771224,"score_spread":0.24806239135814934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396203134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023269956,0.00010690434,0.99241656,0.0010761525,0.00006926497,0.00020342998,9.7369934e-8,0.0014389331,0.0023616815],"genre_scores_gemma":[0.57250905,0.000012551304,0.42619294,0.00085138803,0.000022659076,0.000005321249,7.343944e-7,0.000003704834,0.0004016883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990794,0.000022806302,0.00018745047,0.00025975387,0.00018099592,0.00026958567],"domain_scores_gemma":[0.99930793,0.000033006516,0.00006399023,0.00047941215,0.00006099841,0.00005467657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024637158,0.00012180018,0.00009790282,0.00005811648,0.00023568832,0.00027256136,0.00093220983,0.000057316578,0.0000060224056],"category_scores_gemma":[0.000016054997,0.00007764717,0.000064015374,0.0002869845,0.000021069945,0.00019143014,0.00012159609,0.00011980994,0.000020162925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039651054,0.00013333376,0.00006558823,0.0000031795496,0.0000135574555,0.000017525435,0.0005453974,0.014732061,0.0001389536,0.019440666,0.0011639394,0.96374184],"study_design_scores_gemma":[0.00023596792,0.00020414074,0.0003502633,0.000014653944,0.0000031735833,0.00008969279,0.000009776471,0.97054017,0.013093609,0.0028001538,0.012394211,0.00026416717],"about_ca_topic_score_codex":0.000013310448,"about_ca_topic_score_gemma":0.000004643714,"teacher_disagreement_score":0.9634777,"about_ca_system_score_codex":0.000023366101,"about_ca_system_score_gemma":0.000021277621,"threshold_uncertainty_score":0.316636},"labels":[],"label_agreement":null},{"id":"W2398713501","doi":"10.1109/saner.2016.118","title":"Trace Files for Automatic Memory Management Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; New Brunswick Innovation Foundation","keywords":"Computer science; TRACE (psycholinguistics); Benchmark (surveying); Memory management; Virtual memory; Process (computing); Extended memory; Embedded system; Operating system; Semiconductor memory","score_opus":0.01704658489853461,"score_gpt":0.25218860185764735,"score_spread":0.23514201695911274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398713501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017271191,0.00006933563,0.983699,0.0006676714,0.00019664677,0.00032125658,9.579373e-7,0.0012781711,0.01359424],"genre_scores_gemma":[0.14908648,0.00002018056,0.8300544,0.00012180281,0.000034793906,0.00012687696,4.7429046e-7,0.0000073208935,0.020547675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993493,0.000025972407,0.0001573764,0.00020548028,0.00010904109,0.00015285103],"domain_scores_gemma":[0.9994177,0.00011351534,0.00005165616,0.00033940785,0.000040835264,0.00003687161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023046906,0.00007314677,0.000089951376,0.00007079589,0.000067153036,0.00008657026,0.00048740822,0.000025154604,0.000011844236],"category_scores_gemma":[0.000011882801,0.000044829172,0.00003764094,0.000092628645,0.000011624892,0.00016683621,0.00009081927,0.000011905266,0.000035207737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019365375,0.000057010166,0.000016548587,0.00014239787,0.00003705127,0.000004112027,0.00012929557,0.002079622,0.00010880841,0.47579533,0.13013771,0.3914902],"study_design_scores_gemma":[0.00036127688,0.00005403219,0.0001154826,0.00011057949,0.000004533054,0.0000062618246,0.000018034649,0.97932494,0.0014856801,0.0033174714,0.015024214,0.00017748169],"about_ca_topic_score_codex":0.0000028914465,"about_ca_topic_score_gemma":2.2115158e-7,"teacher_disagreement_score":0.97724533,"about_ca_system_score_codex":0.000023701617,"about_ca_system_score_gemma":0.00000893502,"threshold_uncertainty_score":0.18280806},"labels":[],"label_agreement":null},{"id":"W2398823745","doi":"","title":"A Generative Process for Contractive Auto-Encoders.","year":2012,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Process (computing); Generative grammar; Artificial intelligence; Programming language","score_opus":0.057069992015881,"score_gpt":0.3567650522907404,"score_spread":0.2996950602748594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398823745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012660503,0.00004996311,0.9716182,0.0025512553,0.00036489172,0.00017925478,0.000005352551,0.00036496503,0.023600094],"genre_scores_gemma":[0.93499887,0.00001734193,0.06322317,0.00053888315,0.00017426217,0.00006815662,0.000027312228,0.000009932876,0.00094205665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.00008764117,0.00018025095,0.00026203372,0.00026074378,0.00024302493],"domain_scores_gemma":[0.9991067,0.00015474205,0.00017426677,0.0001243972,0.0003618855,0.00007798348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456335,0.00014185728,0.00013038135,0.0001340374,0.00018182698,0.00017009585,0.0005765414,0.000054245,0.00006551972],"category_scores_gemma":[0.0002806457,0.00013090327,0.00005645919,0.00010005895,0.000025075029,0.0005631443,0.00007488852,0.00027767487,0.000025604986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008955638,0.0002531403,0.0045325,0.000012689136,0.00010964025,0.0000028118611,0.00408162,0.044041198,0.0012155136,0.9049813,0.00055094523,0.040129054],"study_design_scores_gemma":[0.00032103952,0.00012031676,0.00030478404,0.000027206619,0.0000030435242,0.000006894106,0.000046898596,0.9862464,0.0025036277,0.00624557,0.0040012393,0.00017296555],"about_ca_topic_score_codex":0.000013388169,"about_ca_topic_score_gemma":0.0000013859906,"teacher_disagreement_score":0.9422052,"about_ca_system_score_codex":0.000049797127,"about_ca_system_score_gemma":0.000063182364,"threshold_uncertainty_score":0.533808},"labels":[],"label_agreement":null},{"id":"W2400145601","doi":"10.1007/978-3-319-32152-3_17","title":"Parallel Ant Brood Graph Partitioning in Julia","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Thread (computing); Graph partition; Parallel computing; Scalability; Parallel algorithm; Algorithm; Theoretical computer science; Graph; Programming language","score_opus":0.016753000184757935,"score_gpt":0.24985534209783675,"score_spread":0.23310234191307883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400145601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002581137,0.00043523582,0.9889969,0.0010790321,0.0008862315,0.00032796164,0.000002913983,0.00045922014,0.0077866605],"genre_scores_gemma":[0.08951689,0.00019124609,0.907795,0.0015240144,0.00032815203,0.000022189599,0.0000042726597,0.000041537718,0.0005766922],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960638,0.00006415245,0.00070226437,0.0015826342,0.0007869819,0.00080016087],"domain_scores_gemma":[0.9976537,0.00037697307,0.00033351738,0.0012717741,0.00019597879,0.00016803182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010049943,0.0005240038,0.00055696,0.0013151936,0.00023917094,0.00047195927,0.0030140297,0.00034086136,0.000018109968],"category_scores_gemma":[0.000093164,0.0004485422,0.00013934736,0.0008097184,0.00050070876,0.00066955335,0.0010876349,0.00068002916,0.00005437157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013044045,0.00008469459,0.00062720216,0.00004990284,0.000016136315,0.00024022555,0.00090219,0.26787078,0.000082069804,0.15977757,0.00026221282,0.57007396],"study_design_scores_gemma":[0.00049632957,0.00016201005,0.0003483133,0.0011429735,0.000003836897,0.000060572762,7.578926e-8,0.4667267,0.0006180744,0.5278903,0.0016044792,0.0009463294],"about_ca_topic_score_codex":0.000019910225,"about_ca_topic_score_gemma":0.00007432464,"teacher_disagreement_score":0.5691276,"about_ca_system_score_codex":0.0002828906,"about_ca_system_score_gemma":0.0004058407,"threshold_uncertainty_score":0.9997966},"labels":[],"label_agreement":null},{"id":"W2401673269","doi":"10.11575/prism/1113","title":"Complete framework for memory consistency with applications to the itanium architecture","year":2007,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Consistency model; Sequential consistency; Memory model; Consistency (knowledge bases); Programming language; Parallel computing; Shared memory; Artificial intelligence","score_opus":0.014428321151668226,"score_gpt":0.2268178057249838,"score_spread":0.21238948457331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401673269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016775576,0.000047472848,0.9914223,0.003269621,0.000027716831,0.0005275382,6.1681015e-7,0.00017212774,0.0043648724],"genre_scores_gemma":[0.013579532,0.000003777249,0.98567724,0.00043207328,0.00001327414,0.0000019386878,0.0000027788135,0.000004557648,0.00028484064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993764,0.000023040962,0.00008081956,0.0002120318,0.00014394028,0.00016375772],"domain_scores_gemma":[0.9990486,0.00023644016,0.00008716395,0.00043769894,0.00011393822,0.00007615302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002539083,0.000076313416,0.00011407638,0.00009312381,0.00032368902,0.000017872773,0.00082049903,0.0000518195,0.000003638253],"category_scores_gemma":[0.000015340322,0.00006576318,0.000053260974,0.00030683403,0.00008650582,0.00005725328,0.00015677747,0.0001201162,0.000005715778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009161362,0.000089541005,0.0001121242,0.00003858496,0.000056924793,0.000007737558,0.004380358,0.0006684918,0.00013904534,0.5554769,0.0043981513,0.4345405],"study_design_scores_gemma":[0.0014297722,0.0008980822,0.008994654,0.00018541321,0.00010387913,0.00005133224,0.00046349622,0.31829843,0.0012376488,0.10730004,0.5600006,0.0010366681],"about_ca_topic_score_codex":0.000043831555,"about_ca_topic_score_gemma":0.000012083156,"teacher_disagreement_score":0.55560243,"about_ca_system_score_codex":0.000019873476,"about_ca_system_score_gemma":0.000043791075,"threshold_uncertainty_score":0.26817447},"labels":[],"label_agreement":null},{"id":"W2410641680","doi":"10.1145/2925426.2926269","title":"Peruse and Profit","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Porting; Exploit; Computer science; Rewriting; Process (computing); Architecture; Acceleration; Efficient energy use; Profit (economics); Function (biology); General purpose; Embedded system; Computer architecture; Software engineering; Operating system; Programming language; Engineering; Software; Computer security; Electrical engineering","score_opus":0.01343089671044413,"score_gpt":0.2388164571767771,"score_spread":0.22538556046633298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410641680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040322808,0.000021037438,0.9830773,0.0023527557,0.000022493577,0.00002978745,6.436933e-8,0.00048419065,0.009980124],"genre_scores_gemma":[0.561242,0.000027013106,0.43446222,0.0002898984,0.000010308366,0.0000026056025,2.799358e-8,0.0000017530805,0.003964195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971676,0.000010780915,0.00004518045,0.00011666634,0.000043764798,0.00006687448],"domain_scores_gemma":[0.9997661,0.000025364234,0.000011593304,0.00014844415,0.000019908433,0.000028551845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069544796,0.000031329568,0.000031293013,0.000025913707,0.000030988776,0.00003561065,0.00016145466,0.000013761719,0.000010129606],"category_scores_gemma":[0.000013337005,0.000017093767,0.000006994999,0.000050326653,0.000014132452,0.00014986715,0.00010276753,0.000010546231,0.000020958027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000108269,0.00000836497,0.0050480226,0.0000027709666,0.0000035042888,0.0000023065309,0.00013644778,0.000005384208,0.0009498651,0.5905605,0.010388372,0.39289337],"study_design_scores_gemma":[0.0029275524,0.00068851904,0.067490295,0.00022687444,0.000008948858,0.00019735501,0.000024740657,0.43252334,0.18169329,0.17528458,0.13697234,0.0019621623],"about_ca_topic_score_codex":0.000002188335,"about_ca_topic_score_gemma":2.5367976e-7,"teacher_disagreement_score":0.55720973,"about_ca_system_score_codex":0.000003840087,"about_ca_system_score_gemma":0.000007342665,"threshold_uncertainty_score":0.06970636},"labels":[],"label_agreement":null},{"id":"W2411553844","doi":"10.1145/2926534.2926537","title":"DFA minimization in map-reduce","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Minification; Computer science; Implementation; Algorithm","score_opus":0.017188547062584922,"score_gpt":0.26059839196637513,"score_spread":0.2434098449037902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411553844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001006331,0.000014302052,0.98393816,0.004071338,0.000103549544,0.00005504433,1.4435972e-7,0.00043507645,0.010376038],"genre_scores_gemma":[0.60163915,0.000015627082,0.39506742,0.00021876974,0.00002027312,0.000006169051,4.0479938e-7,0.0000035011724,0.0030286768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999426,0.000035912344,0.00013268949,0.00019142563,0.00008687824,0.00012707038],"domain_scores_gemma":[0.9996126,0.00004886744,0.000031719177,0.00024148212,0.00003530287,0.000030027511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012249443,0.00005564463,0.000060144463,0.00010916106,0.00002331379,0.00003667313,0.000364255,0.000033024568,0.000026854006],"category_scores_gemma":[0.000030620857,0.000036786,0.000015918773,0.0002190578,0.000012642976,0.00026702328,0.000092625494,0.000022072365,0.000059983886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010674786,0.0002140072,0.008236116,0.000013205362,0.000008657387,0.000011298317,0.0006675558,0.0071193622,0.003466922,0.3644006,0.11141962,0.50443196],"study_design_scores_gemma":[0.0016166836,0.0001506047,0.0107477745,0.00018770048,0.0000021093758,0.000011511931,0.000024381727,0.84132373,0.0750604,0.035192918,0.034895215,0.0007869826],"about_ca_topic_score_codex":0.0000092816335,"about_ca_topic_score_gemma":0.0000044284507,"teacher_disagreement_score":0.8342044,"about_ca_system_score_codex":0.000025394656,"about_ca_system_score_gemma":0.000022777896,"threshold_uncertainty_score":0.15000896},"labels":[],"label_agreement":null},{"id":"W2412787108","doi":"","title":"Predictor virtualization: teaching old caches new tricks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Metadata; Exploit; Memory hierarchy; Cache; Branch predictor; Virtualization; Latency (audio); Parallel computing; Computer architecture; Embedded system; Operating system; Cloud computing","score_opus":0.018994647892293087,"score_gpt":0.27809529689657136,"score_spread":0.25910064900427826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412787108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025549592,0.00045955388,0.89161766,0.000115294075,0.001198225,0.00022112048,0.0000012008012,0.0018686085,0.10426284],"genre_scores_gemma":[0.07781919,0.000097871816,0.46067035,0.000508116,0.0013196715,0.000034693472,0.00072396925,0.000076366436,0.45874977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981902,0.000114499904,0.00044030676,0.0004981783,0.00042403128,0.0003327875],"domain_scores_gemma":[0.9986454,0.00008921239,0.00030751998,0.0006431005,0.00010703556,0.00020771546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035851073,0.00032432526,0.0003091187,0.00031381592,0.00023640537,0.0003044895,0.0011603128,0.0003576938,0.00010647453],"category_scores_gemma":[0.000114138034,0.00030291942,0.00012220202,0.000318825,0.000008492816,0.00057731353,0.00010623156,0.00040728596,0.00006826334],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002055185,0.00023057146,0.0008714592,0.00014221792,0.00012681812,0.0000054968536,0.009791671,0.0013328393,0.000100428035,0.4538925,0.3139806,0.21950486],"study_design_scores_gemma":[0.002202498,0.0005794768,0.015724938,0.0011259419,0.00029125766,0.000059882612,0.00066604116,0.49876007,0.008591463,0.02233869,0.44424933,0.0054104254],"about_ca_topic_score_codex":0.00019979515,"about_ca_topic_score_gemma":0.00002258894,"teacher_disagreement_score":0.49742723,"about_ca_system_score_codex":0.00006601288,"about_ca_system_score_gemma":0.00023126362,"threshold_uncertainty_score":0.9999423},"labels":[],"label_agreement":null},{"id":"W2414505127","doi":"","title":"HiCMA: Hierarchical Computations on Manycore Architectures library","year":2016,"lang":"en","type":"article","venue":"The 7th International Conference on Computational Methods (ICCM2016)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Parallel computing; Numerical linear algebra; Locality; Computation; Concurrency; Linear algebra; Theoretical computer science; Distributed computing; Synchronization (alternating current); Hierarchy; Algorithm; Numerical analysis; Mathematics","score_opus":0.0737332500188923,"score_gpt":0.3786070275750166,"score_spread":0.30487377755612427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414505127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014228417,0.000018805707,0.9183575,0.0504813,0.00085729256,0.0002917304,0.000060459675,0.0007758238,0.027734265],"genre_scores_gemma":[0.39091906,0.000026478418,0.6036422,0.0035451318,0.00027680746,0.000053431188,0.000032100343,0.000027252638,0.0014775273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962265,0.0011008723,0.00058994384,0.0007844739,0.00090909237,0.00038913667],"domain_scores_gemma":[0.9947116,0.0038117187,0.00031909806,0.0006420476,0.00033534758,0.00018019587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076160417,0.0003759011,0.00029755445,0.00048458535,0.00042115164,0.00041599828,0.0026752935,0.00012057756,0.0003440387],"category_scores_gemma":[0.00036887554,0.00022413072,0.00018515752,0.00041143034,0.00028708662,0.00032980833,0.0005362825,0.0004593105,0.00027447694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007120307,0.00011579144,0.000057316138,0.0000035836301,0.000065235356,0.0000074186514,0.00018763919,0.045300547,0.000114982664,0.7951431,0.003720871,0.15521227],"study_design_scores_gemma":[0.00048366818,0.0002062842,0.0032445574,0.00014010006,0.000005639048,0.00003477076,0.000008286588,0.46204415,0.0007283929,0.5281351,0.0046801385,0.0002889227],"about_ca_topic_score_codex":0.0000050947633,"about_ca_topic_score_gemma":6.249159e-7,"teacher_disagreement_score":0.4167436,"about_ca_system_score_codex":0.000087034554,"about_ca_system_score_gemma":0.0002677435,"threshold_uncertainty_score":0.9139786},"labels":[],"label_agreement":null},{"id":"W2416882351","doi":"10.2514/6.2016-3666","title":"Optimal Spacecraft Hardware Placement to Minimize Required Power Input for Hibernation Survival","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Hibernation (computing); Spacecraft; Power (physics); Computer science; Computer hardware; Engineering; Aerospace engineering; State (computer science); Physics; Algorithm","score_opus":0.02492292767757659,"score_gpt":0.28212186615189455,"score_spread":0.25719893847431796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416882351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096470385,0.000011307519,0.9835939,0.008829443,0.0004604121,0.00040911324,0.0000064749843,0.0007289871,0.004995681],"genre_scores_gemma":[0.06486039,0.00000828837,0.9218466,0.0006428154,0.00008363835,0.00007778165,0.000003565513,0.000014829553,0.012462088],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998647,0.00004826823,0.00025625832,0.00045571703,0.0002842567,0.0003085257],"domain_scores_gemma":[0.9989067,0.00017621128,0.000085271095,0.00045970743,0.00023868427,0.00013346704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042792683,0.0001529979,0.0001645828,0.00014244024,0.00010538568,0.00012727286,0.00065049744,0.000063015315,0.000053385458],"category_scores_gemma":[0.00013184774,0.00010933816,0.00007319409,0.00019032233,0.00001675254,0.0003243755,0.00027708904,0.000029459774,0.00006981088],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005964498,0.0006244204,0.0018653659,0.00004893516,0.00020977463,0.000018581097,0.003072568,0.05322588,0.013871478,0.24366464,0.52705693,0.155745],"study_design_scores_gemma":[0.0067589046,0.0017206861,0.0016764512,0.0002857109,0.000023431085,0.000016898746,0.000120223405,0.47036052,0.11396444,0.003091945,0.39986178,0.0021190154],"about_ca_topic_score_codex":0.000005791067,"about_ca_topic_score_gemma":0.0000023225207,"teacher_disagreement_score":0.41713464,"about_ca_system_score_codex":0.000093439194,"about_ca_system_score_gemma":0.00005733992,"threshold_uncertainty_score":0.44586807},"labels":[],"label_agreement":null},{"id":"W2418965201","doi":"10.1142/s0129626416500080","title":"Pitfalls in Memory Consistency Modelling","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Consistency (knowledge bases); Consistency model; Computer science; Sequential consistency; Data consistency; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.023773302472192795,"score_gpt":0.2452968953228121,"score_spread":0.2215235928506193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418965201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008264902,0.0003172012,0.981133,0.007466944,0.00009174648,0.00011573447,2.8207293e-7,0.0006029894,0.0020072032],"genre_scores_gemma":[0.60918725,0.000030849566,0.3885881,0.0019758325,0.000034846806,0.000018188965,4.5264767e-7,0.000012296188,0.0001522092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.00008061221,0.00036161143,0.0004997062,0.0002413509,0.0004077782],"domain_scores_gemma":[0.99925035,0.00009101893,0.00013993359,0.00038402225,0.00005919795,0.00007545089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038399603,0.00018247013,0.00020601097,0.00022974012,0.00013268666,0.0001510132,0.0007677708,0.000063633684,0.000005056856],"category_scores_gemma":[0.000028570164,0.00013802775,0.0000540909,0.00035654748,0.00008516396,0.0006784807,0.00013644667,0.0001185966,0.00003747674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042856216,0.00024936674,0.0027945042,0.00016531452,0.000028959863,0.00013884678,0.0037133177,0.7149994,0.013004275,0.011827004,0.0076536564,0.24538253],"study_design_scores_gemma":[0.00092061213,0.000027921853,0.00026290835,0.00042511342,0.000003946878,0.000025554418,0.000014741371,0.9906329,0.0013048992,0.0048078103,0.000993777,0.00057981897],"about_ca_topic_score_codex":0.000024317575,"about_ca_topic_score_gemma":0.0000019304155,"teacher_disagreement_score":0.60092235,"about_ca_system_score_codex":0.00007153732,"about_ca_system_score_gemma":0.0000764236,"threshold_uncertainty_score":0.56286085},"labels":[],"label_agreement":null},{"id":"W2419105324","doi":"10.1007/978-3-319-30695-7_1","title":"Towards Multicore Performance with Configurable Computing Units","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Reconfigurability; Computer architecture; Compiler; Multi-core processor; Microarchitecture; Embedded system; Cache; Netlist; Energy consumption; Process (computing); Parallel computing; Operating system","score_opus":0.020305152423301834,"score_gpt":0.24093607471466036,"score_spread":0.22063092229135853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419105324","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018564652,0.0001784855,0.9757112,0.000489971,0.00065258937,0.00040195364,0.0000037434409,0.000742979,0.021633402],"genre_scores_gemma":[0.31473622,0.00007803077,0.68296325,0.00090264954,0.00029015166,0.0000057111465,0.0000044891617,0.000052559415,0.00096695375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584997,0.000043525593,0.0005735103,0.0016002592,0.0010473662,0.0008853733],"domain_scores_gemma":[0.99672514,0.00034675078,0.0004406181,0.0014710925,0.0007965072,0.00021988923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000855453,0.0006779499,0.00063607114,0.0008306333,0.0004751477,0.0005640815,0.0036387448,0.0003168081,0.000016683074],"category_scores_gemma":[0.00007621417,0.0004959139,0.00006977718,0.0009598137,0.0007790034,0.00070190086,0.0011131547,0.00075455726,0.000043163152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010911146,0.00001884613,0.00011935319,0.00005326489,0.000015067566,0.000058587208,0.0005187723,0.10786912,0.000037039084,0.018614283,0.000033115444,0.87265164],"study_design_scores_gemma":[0.00048741058,0.00037023594,0.0001484825,0.0015916987,0.00000763319,0.00014464633,1.3346558e-7,0.979948,0.003583121,0.011172287,0.0015603558,0.0009859975],"about_ca_topic_score_codex":0.000012865452,"about_ca_topic_score_gemma":0.00000936772,"teacher_disagreement_score":0.8720789,"about_ca_system_score_codex":0.00030140826,"about_ca_system_score_gemma":0.0010760624,"threshold_uncertainty_score":0.99974924},"labels":[],"label_agreement":null},{"id":"W243847709","doi":"","title":"Multidimensional Performance Modeling for Advanced Embedded Signal Processors","year":2002,"lang":"en","type":"article","venue":"Defense Technical Information Center (DTIC)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Signal processing; Parallel computing; Computer architecture; Digital signal processing; Computer hardware","score_opus":0.029233570637503675,"score_gpt":0.2553940521337283,"score_spread":0.2261604814962246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W243847709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011005914,0.000030657207,0.98389465,0.00034432273,0.00012230096,0.00053683674,0.000008404649,0.0013178686,0.0027390772],"genre_scores_gemma":[0.63459796,0.000030743024,0.36436406,0.00080261054,0.000021447346,0.000089213405,0.00003533563,0.0000084558715,0.00005015184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982364,0.00002640505,0.000677591,0.00026980482,0.000382627,0.0004071709],"domain_scores_gemma":[0.99876666,0.00008641168,0.00021183952,0.00039720308,0.0004113127,0.00012660079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031893945,0.00022031617,0.0002160403,0.0002212241,0.0002782577,0.00014547988,0.0005720551,0.00013524806,0.00002690539],"category_scores_gemma":[0.00010971805,0.00020536085,0.0001174635,0.00035345825,0.00003922731,0.0021636237,0.00020075437,0.00020708791,0.00010581892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014181288,0.0004934908,0.00014742283,0.0002593004,0.000038492926,0.0000024412516,0.0017545271,0.85353273,0.00045533924,0.025868941,0.012947705,0.104357794],"study_design_scores_gemma":[0.00087232,0.00012453606,0.0000171229,0.00006625848,0.00000436556,0.000026096379,0.000011034905,0.9927279,0.001110814,0.00030886004,0.004464982,0.00026573273],"about_ca_topic_score_codex":7.916425e-7,"about_ca_topic_score_gemma":2.2013624e-7,"teacher_disagreement_score":0.6235921,"about_ca_system_score_codex":0.00007311269,"about_ca_system_score_gemma":0.000026559557,"threshold_uncertainty_score":0.8374372},"labels":[],"label_agreement":null},{"id":"W2441593292","doi":"10.1109/lca.2015.2435709","title":"Inter-Core Locality Aware Memory Scheduling","year":2015,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Locality; Parallel computing; Cache; Locality of reference; CPU cache; Operating system","score_opus":0.03353139430427328,"score_gpt":0.26647081695305,"score_spread":0.23293942264877676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2441593292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025403684,0.000043080323,0.96443605,0.0063774516,0.0016431955,0.00021474021,0.0000017860226,0.0016546234,0.00022541074],"genre_scores_gemma":[0.34762186,0.0000010680192,0.6379795,0.013678266,0.00065356016,0.000011026656,0.0000059905396,0.000023512315,0.00002523547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976763,0.00020483368,0.0003988632,0.0007605635,0.00043977317,0.0005196325],"domain_scores_gemma":[0.99824214,0.00011806762,0.000153825,0.0010343294,0.00013930387,0.00031231606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050884194,0.00034934212,0.00033488413,0.00028216804,0.00014702688,0.0002768293,0.0018082957,0.00010919104,0.0000025951538],"category_scores_gemma":[0.000017237819,0.0003192446,0.00015922716,0.00049000065,0.000116571086,0.00025940913,0.0005334256,0.00054297555,0.00005157882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020075186,0.00008088396,0.00041040246,0.00004153203,0.00005756754,0.00012327361,0.003468133,0.8125532,0.0005201937,0.00040424336,0.04492346,0.13739702],"study_design_scores_gemma":[0.00057686033,0.00011980065,0.000094154566,0.00009612525,0.0000074265977,0.00014954142,0.000009455778,0.9893755,0.002313855,0.0025339487,0.0041643525,0.0005589791],"about_ca_topic_score_codex":0.000041076906,"about_ca_topic_score_gemma":0.000004579255,"teacher_disagreement_score":0.32645655,"about_ca_system_score_codex":0.00010376993,"about_ca_system_score_gemma":0.00008419397,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W2462520875","doi":"10.1109/hotchips.2011.7477515","title":"VENICE: A compact vector processor for FPGA applications","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field-programmable gate array; Computer science; Software; Vector processor; Compiler; Speedup; Parallel computing; Embedded system; Computer hardware; Computer architecture; Operating system","score_opus":0.04637768958057396,"score_gpt":0.2927876734509556,"score_spread":0.24640998387038163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462520875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005497393,0.00003635939,0.9771721,0.00024024484,0.00003242959,0.00039936727,0.000001377475,0.0008740191,0.021189127],"genre_scores_gemma":[0.3613572,0.000003506258,0.6374626,0.0002448277,0.00003190331,0.0001490466,0.0000024860708,0.000006067662,0.0007423479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994319,0.000011025397,0.00012742745,0.0002122754,0.000070164046,0.0001471808],"domain_scores_gemma":[0.99941874,0.00004035594,0.00005815588,0.00031544355,0.00011331013,0.000054028485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001182116,0.000071782524,0.000084200175,0.000052954325,0.0001110089,0.000048157468,0.00059735106,0.000032048803,0.000014704963],"category_scores_gemma":[0.0000141032015,0.00006250941,0.000041887673,0.00021835993,0.00001672686,0.00015652429,0.000046504305,0.000037457452,0.000027366423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023551354,0.0005509226,0.00041912385,0.00009367288,0.00004477536,0.0000010285069,0.0020709753,0.0005025227,0.00033148992,0.9037011,0.04350897,0.04875186],"study_design_scores_gemma":[0.0009813759,0.0004896662,0.0036096103,0.00003694515,0.000020892801,0.00002204265,0.00003622708,0.69589484,0.076469414,0.08478772,0.13678953,0.0008617704],"about_ca_topic_score_codex":0.000011708309,"about_ca_topic_score_gemma":0.0000013473544,"teacher_disagreement_score":0.8189134,"about_ca_system_score_codex":0.000013136869,"about_ca_system_score_gemma":0.000045027275,"threshold_uncertainty_score":0.25490597},"labels":[],"label_agreement":null},{"id":"W2469520437","doi":"10.1145/2851506","title":"Modular Switched Multiported SRAM-Based Memories","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Modular design; Flexibility (engineering); Embedded system; Computer hardware; Field-programmable gate array; Lookup table; Block (permutation group theory); Port (circuit theory); Static random-access memory; Operating system","score_opus":0.019022050251882847,"score_gpt":0.23963339590136792,"score_spread":0.2206113456494851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469520437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010381368,0.00027590513,0.98146456,0.0044592195,0.00036877603,0.00031581352,0.0000061215646,0.002241277,0.00048696727],"genre_scores_gemma":[0.9671281,0.00006744802,0.03145346,0.00009824906,0.000010925695,0.00014006314,9.751105e-7,0.000013668974,0.001087106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986105,0.00007766421,0.00034860926,0.0005141963,0.00014108252,0.00030794507],"domain_scores_gemma":[0.99831617,0.00021153924,0.00013269718,0.0011294889,0.00013577107,0.000074312586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031481494,0.00020537882,0.0002908051,0.00067606854,0.00032965618,0.000081970116,0.00079368206,0.00032497192,0.000019015028],"category_scores_gemma":[0.000073406285,0.00015028358,0.000056982728,0.0006807212,0.00014609478,0.00023391914,0.000008612406,0.00019537233,0.000033345023],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010819545,0.0005881357,0.0017762969,0.00017824097,0.0003717615,0.00007978442,0.00030301238,0.03654367,0.046279214,0.06295066,0.0006542878,0.85016674],"study_design_scores_gemma":[0.003986298,0.0010325956,0.0006689802,0.00083657575,0.00005870854,0.00032987303,0.00022838732,0.51337063,0.42994,0.03099445,0.017010273,0.0015432386],"about_ca_topic_score_codex":0.000021845077,"about_ca_topic_score_gemma":0.0000042983706,"teacher_disagreement_score":0.95674676,"about_ca_system_score_codex":0.000041613854,"about_ca_system_score_gemma":0.0000576261,"threshold_uncertainty_score":0.6128387},"labels":[],"label_agreement":null},{"id":"W2470680602","doi":"10.1109/hotchips.2008.7476518","title":"Scalable parallel programming with CUDA introduction","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"CUDA; Computer science; Multithreading; Parallel computing; Scalability; General-purpose computing on graphics processing units; Yarn; Software; Programming paradigm; Computer architecture; Computational science; Thread (computing); Operating system; Graphics; Programming language","score_opus":0.014706275927825483,"score_gpt":0.22789576403727832,"score_spread":0.21318948810945285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470680602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016934846,0.000030125424,0.990281,0.0014704276,0.000067932306,0.00011786147,3.197877e-8,0.0013649372,0.0049741943],"genre_scores_gemma":[0.10537524,0.00001874479,0.89136255,0.00014195967,0.000110693705,0.000015370091,0.000001676909,0.0000057824304,0.0029679665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999189,0.000025653697,0.0001199745,0.00029412203,0.0001722172,0.00019902852],"domain_scores_gemma":[0.9994387,0.000012383317,0.00004755613,0.0003509874,0.00009611135,0.000054286083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116198324,0.00009044858,0.00009250668,0.000073093506,0.00021073999,0.0000729413,0.0003312383,0.00003077249,0.000013510122],"category_scores_gemma":[0.000010745748,0.00006841419,0.000021062819,0.0004092379,0.000046320412,0.00037636384,0.00007750531,0.000076588985,0.0000318989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007192943,0.000797692,0.016107466,0.00004682347,0.00009670068,0.00013144377,0.0023514156,0.18554418,0.00025217683,0.30853292,0.26316342,0.22290382],"study_design_scores_gemma":[0.0010022637,0.00071869604,0.0024394002,0.000026940736,0.000007547601,0.0009638177,0.000032567154,0.76535344,0.007237747,0.0019396608,0.21941836,0.0008595606],"about_ca_topic_score_codex":0.000026372682,"about_ca_topic_score_gemma":0.0000020107477,"teacher_disagreement_score":0.57980925,"about_ca_system_score_codex":0.000019375135,"about_ca_system_score_gemma":0.000041929467,"threshold_uncertainty_score":0.278985},"labels":[],"label_agreement":null},{"id":"W2481059562","doi":"10.5281/zenodo.59770","title":"ht: Github release for 0.1.47","year":2016,"lang":"en","type":"article","venue":"INFM-OAR (INFN Catania)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Business","score_opus":0.01897213681053971,"score_gpt":0.2593526308242216,"score_spread":0.2403804940136819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481059562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003094323,0.00012741568,0.9887644,0.0030698634,0.00036301403,0.00032090888,0.00002259663,0.0011716178,0.0030658562],"genre_scores_gemma":[0.64057493,0.00007960961,0.35433042,0.0015516891,0.00030725953,0.00010729724,0.00001132532,0.000039897663,0.0029975842],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844813,0.00004860414,0.00033059999,0.0005060103,0.00025069702,0.00041594086],"domain_scores_gemma":[0.99827445,0.0002601651,0.0001547998,0.00092882017,0.00022082971,0.00016094818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003627483,0.00019764592,0.00020784483,0.00014002237,0.00019231046,0.00014924645,0.0011436453,0.000112082365,0.000018903469],"category_scores_gemma":[0.0002652551,0.00015120978,0.000114187154,0.0002952244,0.000066846624,0.0005169803,0.0002747474,0.00008572115,0.00019857462],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009376532,0.00028513212,0.001837032,0.000098840996,0.00009662179,0.000050047318,0.0012677283,0.0010743974,0.00722103,0.1894292,0.29883805,0.49970815],"study_design_scores_gemma":[0.0033451542,0.00082374306,0.0025835424,0.00035838495,0.000037220838,0.00011128303,0.000022360555,0.1291578,0.057514824,0.039547995,0.7646276,0.0018701324],"about_ca_topic_score_codex":0.000019856594,"about_ca_topic_score_gemma":0.000006448337,"teacher_disagreement_score":0.63748056,"about_ca_system_score_codex":0.00007860506,"about_ca_system_score_gemma":0.0001268233,"threshold_uncertainty_score":0.6166156},"labels":[],"label_agreement":null},{"id":"W2482444401","doi":"10.1109/ipdpsw.2016.183","title":"Assessing Multi-task Placement Algorithms in RCUs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Workload; Task (project management); Efficient energy use; Parallel computing; Multi-core processor; Computer architecture; Personalization; Embedded system; Performance improvement; Supercomputer; Algorithm; Operating system; Engineering","score_opus":0.03997668741136653,"score_gpt":0.31887756884919755,"score_spread":0.27890088143783104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482444401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012480832,0.000026617001,0.9940372,0.00072220375,0.00010763884,0.00007539599,1.6665754e-7,0.00049031107,0.003292373],"genre_scores_gemma":[0.34081966,0.000011013132,0.6581511,0.00018018082,0.000013117176,0.000006817534,2.1895703e-7,0.0000035253763,0.00081438094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991762,0.000053466385,0.0001777037,0.00026353906,0.00013146186,0.0001975989],"domain_scores_gemma":[0.9995282,0.0000704212,0.000045978122,0.00027465174,0.000036403362,0.000044335553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030854967,0.0000820642,0.000088815315,0.000116852665,0.000046141064,0.000143499,0.00041286187,0.000036512105,0.000014605357],"category_scores_gemma":[0.000029848032,0.000052457992,0.000022430793,0.00020650694,0.000015964586,0.0005182405,0.00017715458,0.000042527947,0.000036500132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003544751,0.00036376438,0.0064991317,0.0000095776795,0.00001355631,0.000041891904,0.0005935945,0.0053453855,0.004644423,0.020611374,0.004124789,0.95774895],"study_design_scores_gemma":[0.0008913477,0.00004277985,0.00437974,0.00007967837,8.544557e-7,0.00000700556,0.00001876523,0.9812464,0.010060636,0.00086860784,0.0021411926,0.0002629992],"about_ca_topic_score_codex":0.000022397642,"about_ca_topic_score_gemma":0.000004565671,"teacher_disagreement_score":0.975901,"about_ca_system_score_codex":0.000060037113,"about_ca_system_score_gemma":0.000036381316,"threshold_uncertainty_score":0.21391748},"labels":[],"label_agreement":null},{"id":"W2483150783","doi":"10.1117/3.1002297.ch7","title":"Data Compression Engines aboard a Satellite","year":2013,"lang":"en","type":"book-chapter","venue":"Society of Photo-Optical Instrumentation Engineers eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Application-specific integrated circuit; Computer science; Field-programmable gate array; Scalability; Embedded system; Network topology; Computer hardware; Lossless compression; Computer architecture; Data compression; Digital signal processing; Lossy compression","score_opus":0.03499888456926101,"score_gpt":0.26360877215539646,"score_spread":0.22860988758613546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483150783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071325136,0.00027862113,0.75856954,0.00017097556,0.0004037556,0.0006674557,0.00008750215,0.0007820703,0.23896876],"genre_scores_gemma":[0.004278904,0.0005680621,0.91419715,0.00049458473,0.00015915888,0.00003063446,0.00054665754,0.00008889513,0.079635955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975373,0.0000219942,0.00073955837,0.0007497688,0.00062502886,0.0003263127],"domain_scores_gemma":[0.99771744,0.00015773489,0.0003831574,0.0013457665,0.00021727699,0.00017860209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002686223,0.0004705748,0.0005346256,0.00013247065,0.000108597174,0.00014676905,0.0016485,0.00044809372,0.00010480256],"category_scores_gemma":[0.000014864543,0.00047164524,0.00029017028,0.000053552027,0.00021443311,0.0003428937,0.0007151022,0.00042748742,0.00003984934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024777988,0.00012581063,0.0000067742812,0.00091869227,0.00095526717,0.000008302477,0.0028685182,0.0041359873,0.0060558785,0.6360989,0.0984444,0.25035664],"study_design_scores_gemma":[0.001096428,0.00021824439,0.000019793528,0.0008017175,0.00011459441,0.000017159848,0.00008141684,0.7917301,0.019264568,0.014758262,0.17052488,0.0013728376],"about_ca_topic_score_codex":0.000010608327,"about_ca_topic_score_gemma":6.520867e-7,"teacher_disagreement_score":0.7875941,"about_ca_system_score_codex":0.00008469775,"about_ca_system_score_gemma":0.00011685007,"threshold_uncertainty_score":0.9997735},"labels":[],"label_agreement":null},{"id":"W2485359403","doi":"10.1007/978-981-10-1454-3","title":"Modern Mathematical Methods and High Performance Computing in Science and Technology","year":2016,"lang":"en","type":"book","venue":"Springer proceedings in mathematics & statistics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Management science; Engineering","score_opus":0.015645223768279565,"score_gpt":0.299730405321933,"score_spread":0.2840851815536535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485359403","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015130916,0.00021210162,0.9788094,0.00014151918,0.00007453644,0.00046562246,0.0000057529305,0.00031487682,0.01846306],"genre_scores_gemma":[0.005731446,0.0003721188,0.989386,0.000036574787,0.000030440728,0.000021550208,7.4829194e-7,0.000048681457,0.004372401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969841,0.000015462567,0.00089075917,0.00089412765,0.0006005071,0.0006150138],"domain_scores_gemma":[0.9979795,0.00045699993,0.0005042798,0.00037914029,0.0005650105,0.00011506094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031243602,0.00043682707,0.0007565241,0.0014544958,0.00017904761,0.00035152523,0.0011984421,0.00033190163,0.0000021661813],"category_scores_gemma":[0.0010179188,0.00039275223,0.000014645209,0.0006334555,0.00082512636,0.0003597695,0.0016860291,0.00065312337,0.000005520431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017037537,0.00005350215,0.000162069,0.0013850708,0.000008957895,0.000011682752,0.0022172371,0.000019454445,0.00017248714,0.89124304,0.00022349397,0.10450132],"study_design_scores_gemma":[0.00016916027,0.000043099106,0.000058602625,0.001194454,0.0000071953755,0.000041857795,0.000014525685,0.47431004,0.0003114219,0.5233756,0.00015915485,0.00031489533],"about_ca_topic_score_codex":0.0000012029979,"about_ca_topic_score_gemma":6.604839e-7,"teacher_disagreement_score":0.4742906,"about_ca_system_score_codex":0.00033640483,"about_ca_system_score_gemma":0.0003819445,"threshold_uncertainty_score":0.9998524},"labels":[],"label_agreement":null},{"id":"W2487439263","doi":"10.4018/978-1-60566-661-7","title":"Handbook of Research on Scalable Computing Technologies","year":2010,"lang":"en","type":"book","venue":"IGI Global eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Data science; Operating system","score_opus":0.041754005329462884,"score_gpt":0.334458833059146,"score_spread":0.2927048277296831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2487439263","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016860535,0.00036769148,0.23134623,0.00008714178,0.00031398973,0.00034301562,0.000010677812,0.0019820395,0.7655323],"genre_scores_gemma":[0.07440527,0.000053981697,0.7046702,0.000392344,0.00048008404,0.00004830743,0.000010200721,0.00011492703,0.21982472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970017,0.00011160921,0.0005255398,0.00081079605,0.00094558945,0.00060474884],"domain_scores_gemma":[0.9970967,0.0002927779,0.00034893444,0.0015899871,0.0005887241,0.00008288151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009430791,0.00035891353,0.00055596145,0.00044809145,0.00029232807,0.00021536657,0.0030013223,0.00091019215,0.000002382349],"category_scores_gemma":[0.00014912373,0.0003420286,0.00016224952,0.00025132162,0.0004833718,0.000059762544,0.0015973,0.0014228146,0.000079034064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007792309,0.000028054303,0.000006381069,0.0000633422,0.00002315002,0.000020507294,0.00004123472,0.00023391085,0.000051961473,0.92180884,0.05326714,0.024447678],"study_design_scores_gemma":[0.00042514395,0.0006467507,0.000007262173,0.002722514,0.000013651272,0.00004882728,0.000014734799,0.024317825,0.019580415,0.90639657,0.045010705,0.00081559],"about_ca_topic_score_codex":0.000029339491,"about_ca_topic_score_gemma":0.0000074111017,"teacher_disagreement_score":0.54570764,"about_ca_system_score_codex":0.0002765143,"about_ca_system_score_gemma":0.00069344114,"threshold_uncertainty_score":0.9999032},"labels":[],"label_agreement":null},{"id":"W2489118313","doi":"10.1142/9781783266975_0009","title":"Future DREAMS: Dynamically Reconfigurable Extensible Architectures for Manycore Systems","year":2015,"lang":"en","type":"book-chapter","venue":"IMPERIAL COLLEGE PRESS eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Extensibility; Computer science; Computer architecture; Embedded system; Distributed computing; Operating system","score_opus":0.034868161394285474,"score_gpt":0.2634131510982436,"score_spread":0.22854498970395812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489118313","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015927191,0.0025340766,0.17154753,0.00010817992,0.00435816,0.0028268227,0.0005639719,0.0015466453,0.8164987],"genre_scores_gemma":[0.0028970013,0.000073667754,0.06505456,0.00019535706,0.0035511805,0.00048092921,0.00009691484,0.00021237312,0.927438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99691147,0.00009182383,0.0007794941,0.00108308,0.0005479796,0.00058617746],"domain_scores_gemma":[0.9968746,0.00017075341,0.0005395957,0.001339617,0.0007780735,0.0002973823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005227249,0.00070795993,0.0009421482,0.0002622794,0.00030373997,0.0004904423,0.0018289477,0.0008118824,0.000009912818],"category_scores_gemma":[0.000051700612,0.0006580441,0.00031035728,0.000023164139,0.00011387252,0.0000633288,0.00034817215,0.000495618,0.000008738397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019587354,0.000015976013,5.8326723e-8,0.00019484249,0.00013418829,0.000039593073,0.0002671395,0.0033551324,0.00007581871,0.9098615,0.07938206,0.006477794],"study_design_scores_gemma":[0.0009994884,0.000414916,2.1829702e-7,0.00036106087,0.00006129956,0.00013198255,0.000007328307,0.09145762,0.00035529234,0.06751908,0.8376712,0.0010204632],"about_ca_topic_score_codex":0.00007548739,"about_ca_topic_score_gemma":0.000015563508,"teacher_disagreement_score":0.84234244,"about_ca_system_score_codex":0.00017039139,"about_ca_system_score_gemma":0.0004954729,"threshold_uncertainty_score":0.99958706},"labels":[],"label_agreement":null},{"id":"W2494404592","doi":"10.1007/978-3-319-32557-6","title":"High Performance Computing and Applications","year":2016,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Supercomputer; Operating system","score_opus":0.009396581289261135,"score_gpt":0.24523196549144222,"score_spread":0.2358353842021811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494404592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000082677674,0.0003439849,0.9959253,0.00038998367,0.0004798386,0.00042367177,0.0000025483948,0.00056685234,0.0017851256],"genre_scores_gemma":[0.08607477,0.00017935925,0.91127837,0.0009072011,0.0007432894,0.00002218583,0.0000051990055,0.000029933351,0.00075967534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693775,0.00004853607,0.0004672708,0.0013758804,0.00057479995,0.00059578446],"domain_scores_gemma":[0.99770594,0.0004686903,0.0002996261,0.0011465149,0.00022909982,0.00015012328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008323765,0.00041038854,0.00043299087,0.00070237124,0.00044320978,0.00048535064,0.0026799284,0.0002472315,0.0000030752224],"category_scores_gemma":[0.000037642723,0.00034339546,0.00004947623,0.0008600923,0.00060757255,0.00051153795,0.0017142328,0.00049617275,0.0000248764],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010990793,0.000014474039,0.000084129475,0.00004351396,0.0000041520557,0.0000046746927,0.00013551848,0.030818556,0.000017724455,0.0074180295,0.0001042371,0.9613539],"study_design_scores_gemma":[0.0002623861,0.00011965759,0.0003278415,0.0005460268,0.0000046553732,0.0000721895,3.7068304e-8,0.92314804,0.0011511083,0.0703805,0.0032722345,0.0007153442],"about_ca_topic_score_codex":0.000005654608,"about_ca_topic_score_gemma":0.0000022353854,"teacher_disagreement_score":0.9606385,"about_ca_system_score_codex":0.00027919965,"about_ca_system_score_gemma":0.00063387724,"threshold_uncertainty_score":0.99990183},"labels":[],"label_agreement":null},{"id":"W2494965690","doi":"10.2197/ipsjtsldm.9.49","title":"Accurate Cloning of the Memory Access Behavior","year":2016,"lang":"en","type":"article","venue":"IPSJ Transactions on System and LSI Design Methodology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Cloning (programming); Workload; Software; Embedded system; Computer architecture; Operating system; Computer hardware; Programming language","score_opus":0.17815123295447333,"score_gpt":0.3593073503303528,"score_spread":0.1811561173758795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494965690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001106946,0.00006706427,0.99719965,0.00034789316,0.0004651719,0.0002996774,0.0000026452099,0.0002417131,0.00026926084],"genre_scores_gemma":[0.6534761,0.000020657659,0.34609717,0.00005745027,0.000013568734,0.000057128436,4.7383857e-8,0.0000071225213,0.00027070273],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99697673,0.0020962425,0.00031457428,0.00030531737,0.00013175844,0.00017540393],"domain_scores_gemma":[0.99769336,0.0015021967,0.00018505503,0.00048144726,0.00008920282,0.00004873745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215749,0.00012552792,0.00025329326,0.00014413569,0.00021717553,0.000044290133,0.0007273852,0.00011152859,0.0000079157535],"category_scores_gemma":[0.000043438722,0.00007106132,0.000080676735,0.00028708472,0.00009436725,0.00021948204,0.000025070389,0.00009804456,0.000002639156],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025930916,0.000364139,0.00055325107,0.0003022393,0.000254104,0.000032855933,0.0031270026,0.060481533,0.060414962,0.053653922,0.0009319621,0.8196247],"study_design_scores_gemma":[0.0026058548,0.0008698189,0.0055233873,0.0010008579,0.0002446185,0.0008274111,0.0003825475,0.071535744,0.9123201,0.002989729,0.0006834335,0.0010165414],"about_ca_topic_score_codex":0.000023734603,"about_ca_topic_score_gemma":0.0000019964045,"teacher_disagreement_score":0.8519051,"about_ca_system_score_codex":0.00002919736,"about_ca_system_score_gemma":0.00005417032,"threshold_uncertainty_score":0.28977963},"labels":[],"label_agreement":null},{"id":"W2495984805","doi":"10.1109/iccd.1993.393327","title":"A field programmable accelerator for compiled-code applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Porting; Computer science; Overhead (engineering); Code (set theory); Software; Set (abstract data type); Field (mathematics); Operating system; Embedded system; Programming language; Computer architecture","score_opus":0.041076414732829816,"score_gpt":0.28641838625105975,"score_spread":0.24534197151822995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495984805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028562908,0.00006886887,0.97871256,0.0017118503,0.00003597896,0.00053091155,0.0000011346585,0.0011031464,0.017806994],"genre_scores_gemma":[0.073724054,0.000015743837,0.9210288,0.0012900931,0.000056690184,0.00055231364,0.0000025707589,0.000006333558,0.0033233962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934673,0.000011561043,0.0001440668,0.00023749571,0.0000785331,0.00018160345],"domain_scores_gemma":[0.99934775,0.0000956704,0.00004501268,0.00036465348,0.00009233122,0.00005460985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000875451,0.00007473749,0.000086075546,0.00005007802,0.00016443503,0.0001232712,0.0005662435,0.000042764368,0.0000490905],"category_scores_gemma":[0.000014110889,0.00006799563,0.00004675585,0.00024001593,0.000010049296,0.00017312751,0.000083737395,0.00004967241,0.000046316014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004618845,0.00035712228,0.00030928495,0.0000339043,0.000020965017,8.3951363e-7,0.0002355053,0.0008149089,0.000102566126,0.39224577,0.24469966,0.36117485],"study_design_scores_gemma":[0.00014016218,0.00009366057,0.0000067492424,0.0000032912071,0.0000016600825,0.0000024673716,0.0000021108435,0.7234309,0.002960159,0.0032668805,0.26998198,0.000110009234],"about_ca_topic_score_codex":0.0000040656587,"about_ca_topic_score_gemma":0.0000020674584,"teacher_disagreement_score":0.72261596,"about_ca_system_score_codex":0.000010543493,"about_ca_system_score_gemma":0.000008783203,"threshold_uncertainty_score":0.27727813},"labels":[],"label_agreement":null},{"id":"W2497380202","doi":"10.1109/ipdpsw.2016.196","title":"Employing Compression Solutions under OpenACC","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Speedup; Parallel computing; CUDA; Bandwidth (computing); Memory bandwidth; Programming paradigm; Interconnection; Memory model; Shared memory; Programming language; Computer network","score_opus":0.05156253628962067,"score_gpt":0.288854681847988,"score_spread":0.23729214555836736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497380202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004170509,0.00003117976,0.98000973,0.003315589,0.00011132043,0.000058956342,2.6240514e-7,0.0010595998,0.014996302],"genre_scores_gemma":[0.6727542,0.000019284013,0.32412496,0.0005223559,0.000021978767,0.000005588554,3.0725678e-7,0.000004557734,0.0025467197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930686,0.000045405573,0.00012419552,0.00021231973,0.000118053664,0.00019315079],"domain_scores_gemma":[0.99940866,0.00008136001,0.000037220565,0.00036064233,0.000055583798,0.000056514822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015651647,0.00006818162,0.000069399815,0.00006511594,0.0001975326,0.00008209509,0.00056509324,0.00003341803,0.000049551767],"category_scores_gemma":[0.000017129025,0.000040347844,0.000030438616,0.00015098238,0.000023219793,0.00038077813,0.0004034155,0.00003344186,0.00011136036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022982547,0.00007312931,0.0005122681,0.0000027388198,0.0000112445405,0.0000025196382,0.00009217597,0.002725745,0.006947155,0.842739,0.057398472,0.089493275],"study_design_scores_gemma":[0.0019989272,0.00022414657,0.010354784,0.00043820075,0.0000099639055,0.00006604603,0.000031641066,0.6796978,0.059823424,0.18552159,0.060418516,0.0014149494],"about_ca_topic_score_codex":0.000012645124,"about_ca_topic_score_gemma":0.0000017320052,"teacher_disagreement_score":0.6769721,"about_ca_system_score_codex":0.000025159337,"about_ca_system_score_gemma":0.00002640728,"threshold_uncertainty_score":0.16453373},"labels":[],"label_agreement":null},{"id":"W2501331689","doi":"10.1109/isorc.2016.33","title":"Increasing the Code Density of Embedded RISC Applications","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reduced instruction set computing; Computer science; Instruction set; Parallel computing; Code (set theory); Cache; Set (abstract data type); Embedded system; Programming language","score_opus":0.01531248218749997,"score_gpt":0.2621700661409236,"score_spread":0.2468575839534236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501331689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004724813,0.000012541614,0.9856793,0.0010142189,0.000015875838,0.00010034631,5.7034e-7,0.00028111838,0.008171216],"genre_scores_gemma":[0.6996747,0.000009131555,0.29978862,0.00013244872,0.000012457727,0.000007967351,1.4761868e-7,0.0000018559251,0.00037264888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949205,0.000070087925,0.00012741073,0.00013038593,0.00009746271,0.00008260669],"domain_scores_gemma":[0.9991142,0.00022428679,0.000071553266,0.0004708396,0.00009559331,0.000023537983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033662777,0.00004492648,0.00006334281,0.00002986472,0.00009498271,0.000023627388,0.0005527889,0.000021386777,0.000008897031],"category_scores_gemma":[0.00004401686,0.00002214792,0.00002722869,0.00017244018,0.000049774615,0.00009176949,0.00016689546,0.000025611516,0.000022029504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010004784,0.00012661806,0.010146569,0.00001066583,0.000030805248,8.49089e-7,0.00045730796,0.0005224358,0.019062052,0.80670863,0.012707306,0.15021674],"study_design_scores_gemma":[0.0010394426,0.00013793136,0.03353666,0.00012848417,0.000026220303,0.00011789887,0.000058461854,0.35293013,0.40695426,0.16150205,0.042777218,0.00079126336],"about_ca_topic_score_codex":0.000022042046,"about_ca_topic_score_gemma":0.000003753796,"teacher_disagreement_score":0.6949499,"about_ca_system_score_codex":0.000009657576,"about_ca_system_score_gemma":0.000024293247,"threshold_uncertainty_score":0.102722846},"labels":[],"label_agreement":null},{"id":"W2501817638","doi":"10.1007/978-3-319-30379-6_13","title":"Molecular-Dynamics Simulations Using Spatial Decomposition and Task-Based Parallelism","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Parallel computing; Computer science; Xeon; Parallelism (grammar); Benchmark (surveying); Xeon Phi; Task (project management); Decomposition; Message passing; Workload; Multi-core processor; Operating system; Engineering; Chemistry","score_opus":0.015121649912908972,"score_gpt":0.2681771795189138,"score_spread":0.2530555296060048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501817638","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041586474,0.0000846057,0.92596936,0.00037080536,0.00010884557,0.00021407881,0.000020077463,0.0005003906,0.07269026],"genre_scores_gemma":[0.1793954,0.000036652593,0.79417217,0.00088199845,0.00012513042,0.0000047861845,0.00011241891,0.0000726904,0.025198733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987047,0.00003148656,0.0003172258,0.000505915,0.00024504424,0.00019568266],"domain_scores_gemma":[0.99892616,0.00010121296,0.00021513838,0.00049541245,0.00016444434,0.000097654265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009132249,0.00028983568,0.00025445875,0.00025641487,0.00017154454,0.00017666366,0.00037706184,0.00027095314,0.000030127158],"category_scores_gemma":[0.000008804446,0.00026239562,0.000091619055,0.000036727717,0.00006362505,0.00015833165,0.00021042922,0.00015245433,0.000009502809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005729541,0.00001679978,0.000010602493,0.000018129664,0.000035100886,0.00002074804,0.000023614708,0.114809014,0.00017381416,0.8667409,0.000108810425,0.018036753],"study_design_scores_gemma":[0.00021482757,0.00003734751,0.0000044019484,0.00011903935,0.000017750319,0.000009375257,8.844001e-8,0.9533403,0.00016222335,0.044414304,0.0013306164,0.00034971262],"about_ca_topic_score_codex":0.000022151356,"about_ca_topic_score_gemma":0.000015870388,"teacher_disagreement_score":0.8385313,"about_ca_system_score_codex":0.00015805835,"about_ca_system_score_gemma":0.0001597412,"threshold_uncertainty_score":0.99998283},"labels":[],"label_agreement":null},{"id":"W2502266447","doi":"10.4018/978-1-60566-046-2.ch039","title":"Parallel Computing on a Mobile Device","year":2009,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Bluetooth; Mobile device; Wireless; Interface (matter); Implementation; Computer network; Gigabit; Mobile computing; Embedded system; Operating system; Telecommunications","score_opus":0.021094359151057777,"score_gpt":0.2703121091165409,"score_spread":0.24921774996548313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502266447","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006618185,0.00022670136,0.29415467,0.00005900635,0.00020882173,0.00034018685,0.0000068376225,0.0013171086,0.70368004],"genre_scores_gemma":[0.09323336,0.000038803388,0.6843208,0.011412786,0.000990097,0.000035935227,0.000016442831,0.0001361166,0.20981568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974943,0.00004222646,0.0005294015,0.00092019717,0.00053780025,0.0004761024],"domain_scores_gemma":[0.9980803,0.00007410765,0.000390467,0.00109289,0.00016902943,0.00019318546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021280137,0.0005751637,0.000555024,0.00013097703,0.00022549975,0.00029533208,0.0015973662,0.00043292594,0.0000067588453],"category_scores_gemma":[0.000012779721,0.00058414147,0.0002610384,0.00005126304,0.00005550498,0.00006883734,0.00041696287,0.0004544554,0.0002740325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073700226,0.000016002528,0.0000010812214,0.000010282584,0.000025449466,0.00005417361,0.00004444313,0.0044900114,6.7026406e-7,0.9084573,0.005252536,0.081640705],"study_design_scores_gemma":[0.0006898965,0.0009629921,0.000025697838,0.0009372529,0.000041523435,0.00014340738,0.000002705275,0.06334637,0.00006788865,0.7514388,0.18055478,0.001788685],"about_ca_topic_score_codex":0.0000149298985,"about_ca_topic_score_gemma":0.0000042316888,"teacher_disagreement_score":0.49386436,"about_ca_system_score_codex":0.00024417287,"about_ca_system_score_gemma":0.00017963273,"threshold_uncertainty_score":0.999661},"labels":[],"label_agreement":null},{"id":"W2505535144","doi":"10.1109/ipdpsw.2016.139","title":"Topology-Aware Rank Reordering for MPI Collectives","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Benchmark (surveying); Exploit; Distributed computing; Latency (audio); Parallel computing; Network topology; Graph; Reduction (mathematics); Message passing; Topology (electrical circuits); Theoretical computer science; Computer network","score_opus":0.01867753162473753,"score_gpt":0.2770958885670742,"score_spread":0.25841835694233667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505535144","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026462614,0.000023108701,0.9875777,0.0035036986,0.00013878077,0.00015768994,8.278665e-7,0.00081040466,0.007523198],"genre_scores_gemma":[0.30763075,0.000021959455,0.68336,0.0004029174,0.00006377667,0.00004816047,3.7878786e-7,0.0000072679277,0.008464786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938524,0.000026980446,0.0001154057,0.00023965896,0.000057876616,0.00017486002],"domain_scores_gemma":[0.99938613,0.00020381976,0.000037787027,0.00024612504,0.000091087204,0.00003507599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015703906,0.000071795715,0.000095323565,0.00007213095,0.00013312281,0.000040964027,0.0003965608,0.000042638396,0.00001966984],"category_scores_gemma":[0.00005382635,0.000046895155,0.000041968935,0.0001493722,0.000030118617,0.00016117492,0.00011390799,0.000021173024,0.000008995414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049790127,0.00011495388,0.00153577,0.000028881672,0.000058804824,0.000004246308,0.0007278277,0.0006031763,0.0036457097,0.5644079,0.14718041,0.28164256],"study_design_scores_gemma":[0.0037794244,0.0008922456,0.0017413069,0.00014560264,0.0000110413175,0.00004467364,0.000061142426,0.49137357,0.15314086,0.20278393,0.14480816,0.0012180448],"about_ca_topic_score_codex":0.00000520475,"about_ca_topic_score_gemma":0.0000021502483,"teacher_disagreement_score":0.4907704,"about_ca_system_score_codex":0.000024199955,"about_ca_system_score_gemma":0.000035158235,"threshold_uncertainty_score":0.19123289},"labels":[],"label_agreement":null},{"id":"W2505954124","doi":"10.1145/2870638","title":"Shared Memory Multicore MicroBlaze System with SMP Linux Support","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx","keywords":"MicroBlaze; Computer science; Multi-core processor; Scalability; Embedded system; Shared memory; Field-programmable gate array; Memory hierarchy; Memory bandwidth; Distributed memory; Software; Operating system; Computer architecture; Cache","score_opus":0.015389324904570869,"score_gpt":0.22349674827818922,"score_spread":0.20810742337361834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505954124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054575857,0.00022075424,0.98694533,0.0018272818,0.00033324724,0.0004485122,0.000018511018,0.002702175,0.0020465835],"genre_scores_gemma":[0.97470224,0.00006086698,0.022227062,0.000057063546,0.000015080482,0.00016617311,0.0000016479053,0.000020774802,0.0027491061],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839205,0.00007947534,0.0003878497,0.0006358031,0.00014679179,0.0003580623],"domain_scores_gemma":[0.99820423,0.00016242467,0.00016933458,0.0012057708,0.00016202874,0.00009618721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030320877,0.0002504423,0.00036169228,0.0006524582,0.00035016797,0.000113306305,0.0009323904,0.00033840214,0.000020180842],"category_scores_gemma":[0.000021599046,0.00016770625,0.000050888448,0.00059170584,0.000152502,0.00029312345,0.000014331818,0.00023631577,0.00007673436],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003595312,0.0008040113,0.002069206,0.0011508057,0.0010439898,0.0005059698,0.0012912609,0.011846622,0.028298674,0.11303305,0.004595223,0.83500165],"study_design_scores_gemma":[0.02024864,0.0100188805,0.0012508644,0.0125473635,0.00041134495,0.019773724,0.005195676,0.3366716,0.5456711,0.0067427796,0.03353479,0.007933221],"about_ca_topic_score_codex":0.000038277914,"about_ca_topic_score_gemma":0.000008922819,"teacher_disagreement_score":0.96924466,"about_ca_system_score_codex":0.00008290369,"about_ca_system_score_gemma":0.000073800766,"threshold_uncertainty_score":0.6838863},"labels":[],"label_agreement":null},{"id":"W2509084915","doi":"10.1109/isvlsi.2016.60","title":"Workload-Aware Power Gating Design and Run-Time Management for Massively Parallel GPGPUs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Power gating; Granularity; Parallel computing; General-purpose computing on graphics processing units; Power management; Workload; Massively parallel; CUDA; Overhead (engineering); Frequency scaling; Electrical efficiency; Boosting (machine learning); Graphics; Embedded system; Computer architecture; Power (physics); Operating system","score_opus":0.017195237674406547,"score_gpt":0.24475123885948966,"score_spread":0.22755600118508312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509084915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000114249684,0.0000595317,0.9928606,0.0013403803,0.000059294023,0.00046167723,7.0110207e-7,0.0006828512,0.004420672],"genre_scores_gemma":[0.055829667,0.000046378304,0.93686193,0.00037639312,0.000016726197,0.00006484571,4.2979946e-7,0.000011619077,0.006791999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988905,0.000056077362,0.00020863223,0.00041094408,0.00014203067,0.00029181427],"domain_scores_gemma":[0.9991838,0.00024490926,0.0000914975,0.0003182863,0.000079242796,0.00008231304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003645777,0.00014829673,0.00014294176,0.00009312842,0.00016317105,0.00014583534,0.00046446503,0.000052813517,0.000032180516],"category_scores_gemma":[0.000023339986,0.00010110689,0.000043728498,0.00013975972,0.000031142023,0.00026767168,0.00026614795,0.00003267111,0.00003238244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002228029,0.00020045825,0.00035163385,0.00008377945,0.0002065153,0.00004368754,0.0006540948,0.010023739,0.0009425213,0.22024685,0.13261595,0.634408],"study_design_scores_gemma":[0.0023023104,0.0009111078,0.0006914517,0.00043479048,0.000020166297,0.000024047145,0.00003508961,0.9394165,0.004219784,0.04254921,0.00843135,0.0009641476],"about_ca_topic_score_codex":9.597824e-7,"about_ca_topic_score_gemma":1.2354381e-7,"teacher_disagreement_score":0.9293928,"about_ca_system_score_codex":0.000028447948,"about_ca_system_score_gemma":0.000016016733,"threshold_uncertainty_score":0.41230193},"labels":[],"label_agreement":null},{"id":"W2509454674","doi":"10.5281/zenodo.61748","title":"whitehall2: First release","year":2016,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas Mental Health University Institute; McGill University","funders":"","keywords":"Business","score_opus":0.027297446523630333,"score_gpt":0.23437697803713245,"score_spread":0.2070795315135021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509454674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000745106,0.000029488763,0.9210126,0.0039378563,0.000076527234,0.00016558378,0.000016003523,0.0031688581,0.07084802],"genre_scores_gemma":[0.96471786,0.00020397708,0.030698793,0.00043988312,0.00015346859,6.140529e-8,0.0000912783,0.00081707997,0.002877567],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998608,0.0001838236,0.00019774996,0.00042283893,0.0002783832,0.00030919447],"domain_scores_gemma":[0.9986389,0.000038821807,0.00008679045,0.000677193,0.0003959966,0.00016229943],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00047784092,0.00011378118,0.00010029496,0.00019277429,0.001550038,0.0006588908,0.0019043004,0.000050234856,0.0016759711],"category_scores_gemma":[0.00046384672,0.000092659,0.000044822067,0.0004940187,0.000084667474,0.00044764337,0.0014338938,0.0001030811,0.0052973223],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018726123,0.00013070404,0.00000906428,0.000022630742,0.000020634363,0.000019706858,0.0005952013,0.00018566918,0.0012776824,0.08595827,0.4611402,0.45062152],"study_design_scores_gemma":[0.00032802214,0.00011612804,0.0002190253,0.000043715143,0.0000022421307,0.00006887295,0.000008300845,0.005153279,0.0009204689,0.0011468626,0.991817,0.00017608267],"about_ca_topic_score_codex":0.000004060968,"about_ca_topic_score_gemma":9.80514e-8,"teacher_disagreement_score":0.9639728,"about_ca_system_score_codex":0.00009497976,"about_ca_system_score_gemma":0.0000033024367,"threshold_uncertainty_score":0.9997498},"labels":[],"label_agreement":null},{"id":"W2510617510","doi":"","title":"Software method level speculation for java","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Speculative multithreading; Java; Speculative execution; Speculation; Java concurrency; Speedup; Real time Java; Operating system; Java bytecode; Programming language; strictfp; Parallel computing; Java annotation; Bytecode; Thread (computing); Multithreading","score_opus":0.0798838975638567,"score_gpt":0.3466083314096049,"score_spread":0.2667244338457482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510617510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005692551,0.00003700057,0.996384,0.00024345203,0.00016930375,0.00013016239,9.0895225e-7,0.00068337575,0.0022948359],"genre_scores_gemma":[0.043235008,0.0000013473096,0.9552211,0.00030963565,0.00007275913,0.000012082188,0.0000037447055,0.0000049202504,0.0011393884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945414,0.000031565578,0.000112060225,0.00013399035,0.000087632834,0.00018059368],"domain_scores_gemma":[0.9994925,0.00011886003,0.000043189488,0.00021935365,0.000072494775,0.000053586402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042488842,0.00006254332,0.000069939226,0.00005423979,0.000081307306,0.00005035549,0.0002558452,0.000037869617,0.000011889682],"category_scores_gemma":[0.00007366862,0.000054803913,0.00004225203,0.00012805244,0.0000038945896,0.00035047086,0.000076497316,0.000028544999,0.000017093396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000425699,0.00009948611,0.0025389213,0.00001871733,0.000017407416,2.0065666e-7,0.0006353317,0.0073484457,0.0002636946,0.6458193,0.029219616,0.31403464],"study_design_scores_gemma":[0.00023299253,0.000041117015,0.004213072,0.0000073186106,0.000004683413,0.000009009797,0.0000055475316,0.9316114,0.017836364,0.01601137,0.029777376,0.00024971267],"about_ca_topic_score_codex":0.00000819239,"about_ca_topic_score_gemma":6.1669596e-7,"teacher_disagreement_score":0.924263,"about_ca_system_score_codex":0.000017336195,"about_ca_system_score_gemma":0.000013885967,"threshold_uncertainty_score":0.22348388},"labels":[],"label_agreement":null},{"id":"W25112069","doi":"10.1007/978-1-4757-3609-0_4","title":"Predictable Parallel Performance: The BSP Model","year":2002,"lang":"en","type":"book-chapter","venue":"Applied optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Correctness; Benchmarking; Implementation; Bulk synchronous parallel; Predictability; Programming paradigm; Software; Context (archaeology); Software engineering; Parallel computing; Distributed computing; Computer architecture; Programming language; Parallel algorithm","score_opus":0.01925853327042915,"score_gpt":0.20380068459145062,"score_spread":0.18454215132102147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25112069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7641125e-7,0.00010717839,0.55713326,0.0001503007,0.000074062205,0.00035092563,0.0000026618343,0.0006156891,0.44156575],"genre_scores_gemma":[0.0018275407,0.0019817676,0.68970937,0.0007217482,0.00016222152,0.000097831646,0.000105604224,0.000083967105,0.30530998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979738,0.000014689532,0.00048674727,0.00065915886,0.0005197707,0.00034581302],"domain_scores_gemma":[0.9981443,0.000053898617,0.00039858645,0.0011545197,0.00016369081,0.00008499528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027078818,0.00043328377,0.00033400924,0.00017928526,0.00045140955,0.00026875583,0.0014399731,0.00040208906,0.000117337935],"category_scores_gemma":[0.0000070170695,0.00035327717,0.00010442371,0.00013678666,0.00009120171,0.00027942902,0.00039707488,0.00046015935,0.00012031261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033325057,0.000010298106,3.6254576e-7,0.000012394545,0.00001763001,4.8231266e-7,0.00012646372,0.7804925,3.633023e-7,0.2047835,0.011591447,0.0029612635],"study_design_scores_gemma":[0.00020393824,0.000029647601,7.6709364e-7,0.000043267963,0.000026123827,0.0000058859473,8.263982e-7,0.98051304,0.000016741036,0.00901842,0.0097474465,0.0003939258],"about_ca_topic_score_codex":0.0000013183007,"about_ca_topic_score_gemma":1.3881667e-7,"teacher_disagreement_score":0.20002055,"about_ca_system_score_codex":0.000093335315,"about_ca_system_score_gemma":0.00008929343,"threshold_uncertainty_score":0.99989194},"labels":[],"label_agreement":null},{"id":"W2511956618","doi":"10.1007/978-3-319-48989-6_23","title":"Error Invariants for Concurrent Traces","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Atomicity; Computer science; Concurrency; TRACE (psycholinguistics); Slicing; Programmer; Program slicing; Programming language; Debugging; Theoretical computer science; Algorithm; Parallel computing; Database transaction","score_opus":0.032928697880267005,"score_gpt":0.28805167091456424,"score_spread":0.2551229730342972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511956618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037139348,0.00040988237,0.99098575,0.0011302141,0.002270624,0.0006253677,0.000016044527,0.00045639978,0.004101983],"genre_scores_gemma":[0.039973836,0.00008366766,0.9561701,0.0013932713,0.00065275276,0.000040334733,0.00000759652,0.000048416372,0.0016300158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966616,0.000034063953,0.000553626,0.0014658407,0.0006315014,0.0006533727],"domain_scores_gemma":[0.997373,0.00071821397,0.00037277574,0.0010506327,0.00031786488,0.0001675091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096261635,0.00049063703,0.00052188936,0.0006706734,0.00028866896,0.0004619216,0.003478845,0.0003419941,0.000015887419],"category_scores_gemma":[0.00014147753,0.00039043845,0.00014272584,0.00029797683,0.00047320666,0.00052592525,0.000849044,0.00040796696,0.00002996737],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044961675,0.000025212592,0.000007912893,0.000035225443,0.000010539007,0.000013203316,0.00027060305,0.009558546,0.00004859563,0.1195825,0.00027683566,0.8701663],"study_design_scores_gemma":[0.0004707493,0.00026445728,0.000016855218,0.0005661608,0.0000071721533,0.00003403491,4.275057e-8,0.7327861,0.0016433541,0.25187755,0.011521968,0.00081151],"about_ca_topic_score_codex":0.0000030531462,"about_ca_topic_score_gemma":0.000011370736,"teacher_disagreement_score":0.86935484,"about_ca_system_score_codex":0.0002056791,"about_ca_system_score_gemma":0.00053134194,"threshold_uncertainty_score":0.99985474},"labels":[],"label_agreement":null},{"id":"W2513721464","doi":"10.1145/3007787.3001159","title":"Transparent offloading and mapping (TOM)","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":196,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Bottleneck; Programmer; Memory bandwidth; Bandwidth (computing); Computer architecture; Dram; Embedded system; Compiler; Parallel computing; Operating system; Computer hardware; Computer network","score_opus":0.027196566798935593,"score_gpt":0.2578622872750542,"score_spread":0.23066572047611864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513721464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009431448,0.00016378,0.97957814,0.008920156,0.00026281658,0.00023547492,0.0000020558723,0.00095097924,0.000455165],"genre_scores_gemma":[0.34288126,0.000076021286,0.6556289,0.0010709268,0.00023374289,0.000015274814,0.0000012908218,0.000017893824,0.00007467566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785304,0.00018580629,0.0003602957,0.0007529747,0.00033036078,0.0005175069],"domain_scores_gemma":[0.9979639,0.0005760607,0.00010229677,0.0010656521,0.00006868035,0.00022338878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151725,0.0002879113,0.00030120026,0.00032243977,0.0002115238,0.00019452469,0.0016921087,0.00008630183,0.000008455498],"category_scores_gemma":[0.0000721631,0.00019745354,0.000096278105,0.00035284663,0.00009978795,0.00024543004,0.0009969004,0.00021756864,0.000015718662],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060139387,0.000028388244,0.0012129425,0.000022106635,0.00002910601,0.000018327766,0.0016495476,0.0011948687,0.002106472,0.002822089,0.0018717234,0.9890384],"study_design_scores_gemma":[0.006832537,0.001807465,0.03736188,0.002238687,0.00004790144,0.0011611232,0.00003558837,0.4010262,0.025385343,0.25460318,0.26525375,0.004246354],"about_ca_topic_score_codex":0.000016604361,"about_ca_topic_score_gemma":0.0000070635942,"teacher_disagreement_score":0.98479205,"about_ca_system_score_codex":0.000040997667,"about_ca_system_score_gemma":0.000049005812,"threshold_uncertainty_score":0.8051922},"labels":[],"label_agreement":null},{"id":"W2513926952","doi":"","title":"Optimizing the java virtual machine instruction set by despecialization and multicode substitution","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Java annotation; Java; Java applet; strictfp; Java concurrency; Generics in Java; Programming language; Java Modeling Language; Real time Java; Bytecode; Operating system","score_opus":0.011150941171815032,"score_gpt":0.23486337188060002,"score_spread":0.223712430708785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513926952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146158375,0.00013738258,0.98263866,0.00038806724,0.00013341605,0.00011611737,0.0000017426657,0.0004579266,0.0015108746],"genre_scores_gemma":[0.82056314,0.000048759495,0.1788504,0.00016035767,0.00006239864,0.000005373391,0.000027568307,0.000005244312,0.00027677653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926245,0.00006713049,0.00017965751,0.00022210741,0.00014244186,0.00012622512],"domain_scores_gemma":[0.99961424,0.000038970662,0.000075391705,0.0001904449,0.000055874105,0.000025102614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019783297,0.00009672694,0.00007425721,0.00006153374,0.00031633314,0.00023032284,0.00022504381,0.000050310267,0.0000052010387],"category_scores_gemma":[0.00001810188,0.00007155908,0.000018576688,0.00023877017,0.00005831288,0.00038063552,0.00009212115,0.000069706366,0.0000032616035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015169601,0.000084291314,0.0016417973,0.000008348214,0.000013894802,0.0000020597283,0.0007226898,0.22925866,0.003255011,0.70230895,0.014848231,0.047840923],"study_design_scores_gemma":[0.000263395,0.000025574185,0.00040453402,0.0000057062643,0.0000031658121,0.000015293097,0.000009809446,0.98712283,0.0068579516,0.0013212144,0.0038551423,0.00011535574],"about_ca_topic_score_codex":0.00022235716,"about_ca_topic_score_gemma":0.00002611405,"teacher_disagreement_score":0.8059473,"about_ca_system_score_codex":0.00003176181,"about_ca_system_score_gemma":0.000014246736,"threshold_uncertainty_score":0.29180944},"labels":[],"label_agreement":null},{"id":"W2515745369","doi":"10.1049/joe.2016.0127","title":"Hardware‐assisted instruction profiling and latency detection","year":2016,"lang":"en","type":"article","venue":"The Journal of Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tracing; Computer science; Profiling (computer programming); Debugging; Software; Embedded system; Granularity; Parallel computing; Real-time computing; Computer hardware; Operating system","score_opus":0.01043298257837883,"score_gpt":0.2094597960126589,"score_spread":0.19902681343428008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515745369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15595353,0.00009622922,0.8435071,0.00014506084,0.00018632229,0.000020071253,4.8209536e-8,0.000066517496,0.000025081885],"genre_scores_gemma":[0.9182564,0.00008609215,0.08158003,0.000006482964,0.000056146146,3.081979e-7,1.08779625e-8,0.0000032899436,0.000011261956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996411,0.000021515496,0.00014709144,0.000040724583,0.00008278554,0.000066747336],"domain_scores_gemma":[0.9996702,0.000054254764,0.00010057758,0.00008419632,0.00006573107,0.000025050693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034753408,0.000044855995,0.000059726495,0.000083564126,0.00004540717,0.000025230598,0.00016435084,0.000019779265,4.2392807e-7],"category_scores_gemma":[0.00005970931,0.000024108745,0.000018269135,0.00010095624,0.000007613682,0.00026546305,0.000036936628,0.00006994279,4.2675413e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026978785,0.000017389364,0.0006057877,0.000030016587,0.000054025026,0.000007418196,0.00045596543,0.0519794,0.43642876,0.0035735448,0.000050248535,0.50677043],"study_design_scores_gemma":[0.00081970333,0.0002655594,0.0154515095,0.00031938512,0.000022603283,0.0016066128,0.000016298245,0.6198924,0.35929787,0.0012994217,0.00077455724,0.00023403381],"about_ca_topic_score_codex":9.0141583e-7,"about_ca_topic_score_gemma":1.1469009e-7,"teacher_disagreement_score":0.7623028,"about_ca_system_score_codex":0.000021412674,"about_ca_system_score_gemma":0.000008916298,"threshold_uncertainty_score":0.09831261},"labels":[],"label_agreement":null},{"id":"W2516980303","doi":"10.1109/fccm.2016.11","title":"High Performance Instruction Scheduling Circuits for Out-of-Order Soft Processors","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Debugging; Field-programmable gate array; Scheduling (production processes); Soft error; Out-of-order execution; Embedded system; Processor design; Processor scheduling; Yarn; Instruction scheduling; Parallel computing; Computer architecture; Dynamic priority scheduling; Operating system; Electronic engineering; Schedule","score_opus":0.021894744220478147,"score_gpt":0.25742356202419403,"score_spread":0.23552881780371587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516980303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060798123,0.000011569553,0.9375259,0.0003309765,0.00030939357,0.00013764469,5.7340276e-7,0.0004301074,0.00045569194],"genre_scores_gemma":[0.5946601,0.000011965529,0.40493858,0.000046538502,0.000031975123,0.000013019477,4.290642e-7,0.0000044137637,0.00029297447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992638,0.000011333528,0.00020882688,0.00022955808,0.00012498109,0.00016147387],"domain_scores_gemma":[0.99927056,0.00005731586,0.00011924771,0.0002220431,0.00029900388,0.000031802814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018961771,0.00008473331,0.00011194383,0.00008979666,0.00008793997,0.000030584564,0.0003838695,0.00005152357,0.0000052487394],"category_scores_gemma":[0.000082916784,0.000057980193,0.000027040558,0.00020784159,0.00002875462,0.00046158698,0.00006697735,0.000030862466,0.000006760978],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000868694,0.000047476544,0.0013929589,0.000095675896,0.000016674392,1.4432212e-7,0.00031254062,0.013004739,0.0025712599,0.044999886,0.00027403943,0.93727595],"study_design_scores_gemma":[0.0010922019,0.00024204543,0.0008363053,0.000171429,0.0000056641616,0.0000046613504,0.000009715442,0.78231364,0.20589857,0.007958046,0.0011209395,0.000346803],"about_ca_topic_score_codex":0.0000023010673,"about_ca_topic_score_gemma":5.7031843e-7,"teacher_disagreement_score":0.9369291,"about_ca_system_score_codex":0.00001823228,"about_ca_system_score_gemma":0.000060700444,"threshold_uncertainty_score":0.23643637},"labels":[],"label_agreement":null},{"id":"W2517118997","doi":"10.1109/fccm.2016.45","title":"A Multi-ported Memory Compiler Utilizing True Dual-Port BRAMs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Porting; Compiler; Cover (algebra); Set (abstract data type); Optimizing compiler; Parallel computing; Computer hardware; Computer engineering; Programming language","score_opus":0.039679992874381946,"score_gpt":0.28114583020339107,"score_spread":0.24146583732900911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517118997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035048923,0.000035002322,0.9776316,0.0008884392,0.00024013732,0.00015257078,0.000001024278,0.0020979065,0.015448379],"genre_scores_gemma":[0.52298075,0.000016595879,0.47186935,0.00062424125,0.00003706835,0.000009365618,0.0000015164381,0.000011122898,0.004449981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998568,0.00006722782,0.00033671435,0.00046958652,0.0002322094,0.00032628965],"domain_scores_gemma":[0.9988093,0.00009513612,0.000118858065,0.00073035224,0.000121128556,0.00012522792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036326525,0.00017023907,0.00019489539,0.00013065571,0.00013112427,0.000102648846,0.000640378,0.00008296778,0.00010249315],"category_scores_gemma":[0.000057596215,0.000113041744,0.00007833042,0.0002989728,0.00005856861,0.0004081858,0.00030746343,0.00008188268,0.00013259066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004152836,0.001251028,0.014425436,0.000057955407,0.0002170341,0.00033355167,0.0022275376,0.001775948,0.039754298,0.10530354,0.13471335,0.6998988],"study_design_scores_gemma":[0.0026135237,0.00019802539,0.022519154,0.00018731791,0.0000133051035,0.00016163709,0.000057887963,0.9058548,0.04514527,0.002235339,0.019776547,0.0012371603],"about_ca_topic_score_codex":0.000029355342,"about_ca_topic_score_gemma":0.0000060683738,"teacher_disagreement_score":0.9040789,"about_ca_system_score_codex":0.000035499987,"about_ca_system_score_gemma":0.000064701824,"threshold_uncertainty_score":0.46097085},"labels":[],"label_agreement":null},{"id":"W2517678212","doi":"10.1145/3007787.3001195","title":"The anytime automaton","year":2016,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Automaton; Pipeline (software); Computation; Theoretical computer science; Simple (philosophy); Distributed computing; Cellular automaton; State (computer science); Algorithm; Computer engineering; Programming language","score_opus":0.010086729097621244,"score_gpt":0.2448873781263465,"score_spread":0.23480064902872527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517678212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015931727,0.00013210105,0.9684486,0.02621641,0.00050539646,0.0002640614,0.0000013750838,0.0017127283,0.0011261972],"genre_scores_gemma":[0.113265835,0.0001033093,0.8827731,0.002372088,0.0005788373,0.00004223354,0.0000016551643,0.000034054046,0.0008288813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975671,0.00030791044,0.00037399319,0.00064408337,0.00046708225,0.00063982094],"domain_scores_gemma":[0.99571353,0.0015718902,0.00013841734,0.0022712257,0.00011941699,0.00018551438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005067427,0.0002822516,0.00022532581,0.00015486726,0.00053104054,0.00037198266,0.0044427607,0.00008959561,0.000008054586],"category_scores_gemma":[0.00020155562,0.00014247376,0.00015020881,0.00043311174,0.00016275712,0.0002174083,0.0019799874,0.0002494578,0.00011234298],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070760493,0.000023353501,0.00022577237,0.0000036593945,0.00002418203,0.000011448615,0.00031398577,0.00085813174,0.00039859157,0.010772282,0.026716199,0.9606453],"study_design_scores_gemma":[0.0014377123,0.0006313636,0.0045868526,0.00019641475,0.000010819655,0.00029907833,0.0000036954445,0.17062874,0.0075481203,0.18322977,0.63039386,0.0010335452],"about_ca_topic_score_codex":0.000015604486,"about_ca_topic_score_gemma":0.000012208472,"teacher_disagreement_score":0.9596118,"about_ca_system_score_codex":0.000052189713,"about_ca_system_score_gemma":0.00010496758,"threshold_uncertainty_score":0.82558286},"labels":[],"label_agreement":null},{"id":"W2522678032","doi":"10.1007/978-3-642-12659-8","title":"High Performance Computing Systems and Applications","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer architecture","score_opus":0.009466674454298352,"score_gpt":0.2385303856430876,"score_spread":0.22906371118878924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522678032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021440258,0.0005163303,0.99549294,0.00016962134,0.0011915154,0.0006160351,0.0000024406672,0.0006301877,0.0011665474],"genre_scores_gemma":[0.14840293,0.0001049177,0.8494686,0.00055202516,0.000922512,0.000033484775,0.000010699651,0.000033245295,0.0004716076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967466,0.000052677464,0.0005426453,0.0014054432,0.00065354246,0.00059910427],"domain_scores_gemma":[0.9974232,0.00041735245,0.00036790903,0.0013286166,0.0002928154,0.00017013632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010792799,0.00044447108,0.0005079685,0.00075848645,0.00053720933,0.0009938068,0.0029538653,0.00040021492,0.0000012895449],"category_scores_gemma":[0.00004015941,0.0004250112,0.00004765765,0.0010359569,0.0005952386,0.00047630892,0.001554403,0.0011597042,0.000014869125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012252647,0.000027105092,0.000110573455,0.0001259983,0.0000062012814,0.000007792781,0.0002712287,0.3275126,0.00003839333,0.011826094,0.00012854309,0.65994424],"study_design_scores_gemma":[0.0001370912,0.00007284653,0.00016249096,0.00026583552,0.000004182426,0.000094538154,6.0926794e-8,0.9854286,0.0003554908,0.010034754,0.0029379083,0.0005062098],"about_ca_topic_score_codex":0.000026458241,"about_ca_topic_score_gemma":0.0000058145433,"teacher_disagreement_score":0.659438,"about_ca_system_score_codex":0.00022298394,"about_ca_system_score_gemma":0.0006913346,"threshold_uncertainty_score":0.9998202},"labels":[],"label_agreement":null},{"id":"W2527883145","doi":"10.1109/iiswc.2016.7581272","title":"SPEC-AX and PARSEC-AX: extracting accelerator benchmarks from microprocessor benchmarks","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Spec#; Parsec; Benchmark (surveying); Profiling (computer programming); Microarchitecture; Workload; Parallel computing; Computer architecture; Suite; Architecture; Instruction set; Speculative execution; Code (set theory); Operating system; Set (abstract data type); Programming language","score_opus":0.012218815271052834,"score_gpt":0.2321542027940822,"score_spread":0.21993538752302935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527883145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094686784,0.00036506532,0.8835717,0.0016524489,0.00025327146,0.00016216548,0.000006615035,0.00052590267,0.018776085],"genre_scores_gemma":[0.6985724,0.00015114753,0.30013564,0.00044688807,0.00014117299,0.000009755641,0.000008987619,0.000011687908,0.0005222953],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982533,0.0000656951,0.0003639268,0.0007016617,0.00023311761,0.00038229921],"domain_scores_gemma":[0.9986495,0.00033427094,0.0001796891,0.00053743075,0.00012822037,0.00017093387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029802928,0.00023714687,0.00023741237,0.00011488412,0.00022036354,0.00038210102,0.0007894681,0.00013731583,0.00066462805],"category_scores_gemma":[0.00010230171,0.0001652696,0.000054869426,0.00023556208,0.00006487546,0.0008442468,0.00042211942,0.00014869304,0.000024941744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067934154,0.0004465893,0.030508505,0.00006833624,0.00019352268,0.00011645457,0.0028858066,0.00012825252,0.090673536,0.0374341,0.118909456,0.7185675],"study_design_scores_gemma":[0.005630072,0.0007095474,0.051179342,0.001158714,0.00008558281,0.0002227562,0.00043709477,0.2231311,0.53721094,0.0699947,0.10486408,0.0053760577],"about_ca_topic_score_codex":0.00011723257,"about_ca_topic_score_gemma":0.000017903407,"teacher_disagreement_score":0.71319145,"about_ca_system_score_codex":0.000039832492,"about_ca_system_score_gemma":0.00006450363,"threshold_uncertainty_score":0.7277211},"labels":[],"label_agreement":null},{"id":"W2528472514","doi":"10.1109/iiswc.2016.7581279","title":"Memory controller design under cloud workloads","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Memory controller; Interleaved memory; Registered memory; Flat memory model; Extended memory; Physical address; Scheduling (production processes); Memory map; Memory management; Memory refresh","score_opus":0.027387305697037387,"score_gpt":0.2498159875147535,"score_spread":0.22242868181771613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528472514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005484715,0.000069612186,0.98187464,0.002878165,0.00019748084,0.00011802016,9.94119e-8,0.0010898801,0.013717252],"genre_scores_gemma":[0.44875947,0.000027915887,0.5384442,0.0017402925,0.000086032065,0.000011593678,7.154504e-8,0.0000073893793,0.01092301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908936,0.00011107973,0.00015985964,0.0002622912,0.00015019326,0.00022718709],"domain_scores_gemma":[0.9992086,0.00025309005,0.000049915478,0.0003467039,0.00007076982,0.00007091328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039804922,0.00010030095,0.00011996987,0.000068489164,0.0000789212,0.00007759088,0.0005980393,0.000055123048,0.000067477784],"category_scores_gemma":[0.00003325551,0.000058659774,0.00004656947,0.00017235354,0.000033004562,0.00021095618,0.00013311073,0.00004062485,0.00018897878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040626903,0.00012908282,0.00009235432,0.0000035018984,0.00006344842,0.000010344893,0.00019551597,0.017627135,0.0029421917,0.3844906,0.23329172,0.3611135],"study_design_scores_gemma":[0.005117946,0.00043938303,0.00087434635,0.00017058302,0.000016327036,0.000050345378,0.000025105757,0.6172131,0.1051514,0.25181526,0.017647458,0.0014787624],"about_ca_topic_score_codex":0.000003904402,"about_ca_topic_score_gemma":2.999646e-7,"teacher_disagreement_score":0.59958595,"about_ca_system_score_codex":0.000029013654,"about_ca_system_score_gemma":0.000039251412,"threshold_uncertainty_score":0.2429003},"labels":[],"label_agreement":null},{"id":"W2529882977","doi":"10.1145/2968478.2975584","title":"Lessons learned on assumptions and scalability with time-aware instrumentation","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instrumentation (computer programming); Computer science; Correctness; Debugging; Profiling (computer programming); Scalability; Key (lock); Software; Software engineering; Embedded system; Operating system; Programming language","score_opus":0.03150300072491407,"score_gpt":0.29654290965843616,"score_spread":0.2650399089335221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529882977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03038323,0.0000019020451,0.9570812,0.008652056,0.000015286723,0.000087506145,0.0000013721634,0.00050624774,0.0032711881],"genre_scores_gemma":[0.88812476,0.000013766233,0.11021044,0.00019956665,0.000007631748,0.000008322976,0.0000011990662,0.0000038315943,0.0014304655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.00005328857,0.00008804272,0.0002655498,0.00011695638,0.00010504281],"domain_scores_gemma":[0.9995111,0.0000866823,0.00003790988,0.00026365163,0.00005056577,0.0000500627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014125727,0.0000717962,0.00006812022,0.000058557835,0.00011241956,0.000072251045,0.00016082723,0.000029630119,0.000029915393],"category_scores_gemma":[0.000018210501,0.000041508803,0.000012082304,0.00012745723,0.000047968868,0.00025762568,0.00006641052,0.000035389134,0.000050752256],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031116713,0.00019668693,0.009070593,0.000009912259,0.00001802163,0.0000021002509,0.00022250864,0.0007177309,0.0016044739,0.10910412,0.003037622,0.8759851],"study_design_scores_gemma":[0.004875871,0.0026097856,0.22983189,0.0004938705,0.000029858375,0.00006077871,0.00005907158,0.62772393,0.06871677,0.05766008,0.0062013934,0.0017367072],"about_ca_topic_score_codex":0.000007773015,"about_ca_topic_score_gemma":0.0000038877297,"teacher_disagreement_score":0.8742484,"about_ca_system_score_codex":0.000027409764,"about_ca_system_score_gemma":0.000023804918,"threshold_uncertainty_score":0.16926798},"labels":[],"label_agreement":null},{"id":"W2531448852","doi":"10.1145/2968456.2968470","title":"Fast and cycle-accurate simulation of multi-threaded applications on SMP architectures using hybrid prototyping","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Emulation; Computer science; Virtual prototyping; Scalability; Embedded system; Rapid prototyping; Kernel (algebra); Co-simulation; Multi-core processor; Modeling and simulation; Computer architecture; Parallel computing; Simulation; Operating system; Engineering","score_opus":0.03778801950024099,"score_gpt":0.3113127230460413,"score_spread":0.27352470354580033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531448852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01576608,0.000020319594,0.98306006,0.00012694416,0.000013073333,0.0005144361,0.0000020901662,0.00028020685,0.00021675871],"genre_scores_gemma":[0.7497322,0.00000371264,0.25015226,0.000043965032,0.000011481289,0.000026005258,4.5789648e-7,0.000004782619,0.000025124602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.000041556792,0.0001867701,0.00024574148,0.00009615482,0.00011856599],"domain_scores_gemma":[0.999389,0.000117037096,0.00011548462,0.00026930805,0.00007037584,0.000038793107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010956043,0.000090472364,0.000101585545,0.00011567831,0.0000962698,0.000037333695,0.00020987583,0.000024851559,0.00000247354],"category_scores_gemma":[0.00002106602,0.000061993946,0.000023382741,0.00013089915,0.0000539729,0.00009478627,0.000090290836,0.000038028284,0.0000019674003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010208666,0.000055858563,0.00018300091,0.000017186925,0.000008368856,4.1467106e-7,0.00015211343,0.6952241,0.00577361,0.004196258,0.000004199449,0.29437464],"study_design_scores_gemma":[0.00020612465,0.000035025132,0.00039663963,0.000047766218,0.0000016537267,0.0000030297608,0.0000018987664,0.97213346,0.02486845,0.002148722,0.00006358901,0.000093639974],"about_ca_topic_score_codex":0.000012856075,"about_ca_topic_score_gemma":0.0000012482083,"teacher_disagreement_score":0.7339661,"about_ca_system_score_codex":0.000015245662,"about_ca_system_score_gemma":0.000019006113,"threshold_uncertainty_score":0.25280398},"labels":[],"label_agreement":null},{"id":"W2532048255","doi":"10.1145/2989081.2989089","title":"Analytical Study on Bandwidth Efficiency of Heterogeneous Memory Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Dram; Computer science; Bandwidth (computing); Memory bandwidth; Cache; Interleaved memory; Parallel computing; Semiconductor memory; Memory management; Computer hardware; Computer network","score_opus":0.023445310717572512,"score_gpt":0.2758726764466493,"score_spread":0.2524273657290768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532048255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09234865,0.000020726287,0.90026224,0.00009683646,0.00013279382,0.0001898203,4.4042633e-7,0.00033607372,0.0066124336],"genre_scores_gemma":[0.995014,0.000002352906,0.004104072,0.00004038143,0.000017686512,0.000005624069,7.022314e-8,0.0000044105086,0.0008113721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891114,0.00010489935,0.00025872287,0.0002884136,0.0002787807,0.00015801864],"domain_scores_gemma":[0.9990905,0.00014368846,0.00007348478,0.0005489452,0.00008444117,0.00005894037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003324445,0.000094887684,0.00017184904,0.00012636975,0.00004395943,0.000037296355,0.00059795304,0.000031575004,0.000008296382],"category_scores_gemma":[0.00004184989,0.00005407506,0.000046055873,0.00022115874,0.000030590007,0.00006739899,0.0001295159,0.00003195036,0.000027040116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023433927,0.016118325,0.05279806,0.00017126,0.0006471381,0.00040038282,0.00574028,0.29628986,0.0044500623,0.4388458,0.024201743,0.16010274],"study_design_scores_gemma":[0.0012936001,0.003022611,0.0016975683,0.000115036535,0.000014212474,0.0000317708,0.00006223843,0.96829647,0.024442412,0.00036242246,0.00020907543,0.0004525698],"about_ca_topic_score_codex":0.000013698246,"about_ca_topic_score_gemma":3.9508353e-7,"teacher_disagreement_score":0.9026654,"about_ca_system_score_codex":0.000022310844,"about_ca_system_score_gemma":0.000024972462,"threshold_uncertainty_score":0.22051169},"labels":[],"label_agreement":null},{"id":"W2532504761","doi":"10.1109/hpec.2012.6408666","title":"Ruggedization of MXM graphics modules","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Curtiss-Wright (Canada)","funders":"","keywords":"Graphics; Computer graphics (images); Computer science; Aerospace; Embedded system; Engineering; Aerospace engineering","score_opus":0.01855143308295202,"score_gpt":0.256981519826584,"score_spread":0.238430086743632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532504761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042970506,0.00008999553,0.98807675,0.00009531855,0.000099632336,0.000036156558,1.8103825e-7,0.0003260888,0.0069788243],"genre_scores_gemma":[0.6494727,0.000018965795,0.3503115,0.00008824391,0.00001971208,0.0000011598324,9.0701525e-7,0.0000018598431,0.00008495873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995517,0.000026357264,0.00012118365,0.00007589765,0.00011357696,0.00011125567],"domain_scores_gemma":[0.9995936,0.000026645008,0.00005659996,0.00021437847,0.00007032662,0.000038417253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020748997,0.000045334884,0.00006168297,0.00008531632,0.00003423176,0.000015712374,0.0002638858,0.00003065809,0.000006352622],"category_scores_gemma":[0.000022593264,0.000039205563,0.00002503397,0.0002837463,0.000016860058,0.00031272773,0.00007860087,0.000029824278,0.000004303942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.613031e-7,0.000065957065,0.006446552,0.000007193362,0.0000046353,6.54708e-8,0.00030501693,0.0015153373,0.00019570898,0.97785014,0.0033343583,0.010274485],"study_design_scores_gemma":[0.00017270618,0.00005658212,0.016335344,0.000019105097,0.000004453418,0.0000060958077,0.000019552617,0.91151893,0.053098157,0.015229645,0.003292487,0.00024691847],"about_ca_topic_score_codex":0.000008966957,"about_ca_topic_score_gemma":2.98781e-7,"teacher_disagreement_score":0.9626205,"about_ca_system_score_codex":0.000004450741,"about_ca_system_score_gemma":0.0000074268455,"threshold_uncertainty_score":0.15987565},"labels":[],"label_agreement":null},{"id":"W2532617160","doi":"10.1145/2989081.2989092","title":"Software Assisted Hardware Cache Coherence for Heterogeneous Processors","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Arm; Menzies School of Health Research; Advanced Micro Devices","keywords":"Computer science; Cache coherence; Cache; Computer architecture; Software; Parallel computing; MESI protocol; Embedded system; Operating system; CPU cache; Computer hardware; Cache algorithms","score_opus":0.031460387112723504,"score_gpt":0.2737850538843075,"score_spread":0.242324666771584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532617160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064006314,0.00005160579,0.9960182,0.00078432285,0.00009541078,0.00025556932,0.00000511755,0.0016084518,0.00054131285],"genre_scores_gemma":[0.31169924,0.0000060616517,0.68420076,0.0003693092,0.000028423885,0.000090223766,0.0000021183582,0.0000108230315,0.0035930222],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990006,0.000029870229,0.0001846967,0.00038333933,0.00014909734,0.00025239133],"domain_scores_gemma":[0.9990383,0.0001651624,0.00008498921,0.00039722456,0.00023523379,0.00007913728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015356537,0.00012603408,0.00013138542,0.00005961701,0.00012904365,0.00009878631,0.0007785287,0.00006654347,0.000021091859],"category_scores_gemma":[0.00018104496,0.00007985139,0.00006500496,0.00017240409,0.000029668201,0.00022659077,0.00013951342,0.000031775464,0.000024777786],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032535863,0.00019981839,0.002633383,0.00010520731,0.00006522158,0.000015158062,0.00033170302,0.0028671578,0.0017722058,0.008547396,0.042910103,0.9405201],"study_design_scores_gemma":[0.004655142,0.0016388093,0.003436457,0.0007140791,0.000044561217,0.0003147662,0.000021758113,0.38014236,0.455577,0.041062184,0.1091501,0.003242784],"about_ca_topic_score_codex":0.0000052520886,"about_ca_topic_score_gemma":0.0000045362194,"teacher_disagreement_score":0.9372773,"about_ca_system_score_codex":0.000034943143,"about_ca_system_score_gemma":0.000070830785,"threshold_uncertainty_score":0.3256245},"labels":[],"label_agreement":null},{"id":"W2533520058","doi":"10.1145/2989225.2989235","title":"Efficiently implementing the copy semantics of MATLAB's arrays in JavaScript","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"JavaScript; Computer science; Programming language; MATLAB; Leverage (statistics); Semantics (computer science); Code (set theory); Operating system; Artificial intelligence","score_opus":0.014213298486050999,"score_gpt":0.2553959548548673,"score_spread":0.24118265636881633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533520058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011097284,0.000014938327,0.9812478,0.0020615915,0.000067270485,0.00009730613,4.15089e-7,0.00014597052,0.0052674306],"genre_scores_gemma":[0.82164395,0.000012159858,0.17778233,0.00017355628,0.000009151835,0.0000031071772,1.632239e-7,0.0000035531834,0.00037206407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991509,0.00005758235,0.0002531396,0.00016666914,0.00016149879,0.00021025729],"domain_scores_gemma":[0.9993373,0.00011382948,0.00009643584,0.00038053488,0.00005200319,0.000019907326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005872596,0.00006909332,0.00009754039,0.00006646307,0.000056272645,0.00003845778,0.0006594099,0.000022781556,0.000030620842],"category_scores_gemma":[0.00004071488,0.000035864286,0.000033261003,0.00031973163,0.000035557718,0.0001069472,0.00032247324,0.000038010105,0.000013742941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015270873,0.00039901238,0.07062971,0.000060224946,0.000051506737,0.000013392244,0.0044779,0.012595645,0.022560706,0.6434876,0.09305389,0.15265514],"study_design_scores_gemma":[0.0015197435,0.00019801843,0.007498623,0.00024402395,0.000009146495,0.00001589484,0.0001527143,0.6412731,0.31087324,0.01581664,0.021814538,0.00058430433],"about_ca_topic_score_codex":0.00004063449,"about_ca_topic_score_gemma":0.000012055702,"teacher_disagreement_score":0.81054664,"about_ca_system_score_codex":0.00001618741,"about_ca_system_score_gemma":0.000020127189,"threshold_uncertainty_score":0.14625031},"labels":[],"label_agreement":null},{"id":"W2534499326","doi":"10.1145/2998415.2998419","title":"Rebuilding an airliner in flight: a retrospective on refactoring IBM testarossa production compiler for Eclipse OMR","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Code refactoring; Eclipse; Compiler; Computer science; IBM; Java; Programming language; Software engineering; Operating system; Source lines of code; Software","score_opus":0.03191646776455295,"score_gpt":0.29712374168524336,"score_spread":0.26520727392069043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534499326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09907995,0.000005566815,0.8951443,0.001858255,0.0005749209,0.00040803998,0.000001840692,0.0008346883,0.0020924644],"genre_scores_gemma":[0.76685923,0.000007835151,0.23146194,0.00013223456,0.00040326777,0.000037384732,0.0000015305852,0.000013029156,0.0010835195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985534,0.00006218178,0.00026805152,0.00064445456,0.00018639314,0.0002854985],"domain_scores_gemma":[0.99902153,0.0000999211,0.000102292826,0.00054640067,0.00016526788,0.000064572414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005546603,0.00015223281,0.00017379508,0.00022637522,0.0001357221,0.00008692662,0.00041334098,0.000071185736,0.000007545285],"category_scores_gemma":[0.00024497273,0.00010386979,0.00004395959,0.00034576416,0.000025003332,0.00067468325,0.00009187592,0.000097769065,0.000008447286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003877807,0.0017083702,0.10937126,0.000084578576,0.00006742554,0.000021461272,0.004851851,0.03409823,0.057846304,0.60617757,0.051325962,0.1340592],"study_design_scores_gemma":[0.0035425834,0.0030344815,0.057853065,0.0010378715,0.000013330348,0.000032838034,0.00008688575,0.4019504,0.44014058,0.070561975,0.019561676,0.002184336],"about_ca_topic_score_codex":0.000012821219,"about_ca_topic_score_gemma":0.000019539637,"teacher_disagreement_score":0.6677793,"about_ca_system_score_codex":0.00021483502,"about_ca_system_score_gemma":0.00003258329,"threshold_uncertainty_score":0.42356873},"labels":[],"label_agreement":null},{"id":"W2535213992","doi":"10.1109/iwsoc.2006.348232","title":"Parallel Processing on FPGAs: The Effect of Profiling on Performance","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Speedup; Field-programmable gate array; Parallel computing; Profiling (computer programming); Fast Fourier transform; Multiprocessing; Algorithm; Embedded system; Operating system","score_opus":0.00884712636035723,"score_gpt":0.24392780753420965,"score_spread":0.23508068117385242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2535213992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11293683,0.000049884085,0.83310324,0.00023836891,0.00005405301,0.00025018063,1.2305438e-7,0.00046396404,0.052903373],"genre_scores_gemma":[0.92387986,0.000003551418,0.07560348,0.00012567206,0.000034662437,0.0000148777635,7.740368e-7,0.0000049330265,0.00033217182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992115,0.00006643107,0.0001682702,0.00019535836,0.00020898381,0.0001494646],"domain_scores_gemma":[0.99942034,0.0001255096,0.00009556178,0.00030660763,0.000037824964,0.0000141532355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039138677,0.00010385152,0.00011098068,0.00006107887,0.00014623554,0.000063887725,0.0005004427,0.000031927924,0.0000013424482],"category_scores_gemma":[0.000016762277,0.000056993595,0.00003682608,0.00023831398,0.000030296376,0.00011563441,0.000059208403,0.000100983016,0.000010200371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064369364,0.00008761005,0.004598414,0.00010840471,0.000006713049,0.0000017825115,0.000095048235,0.84258103,0.00030821472,0.06570278,0.0022444087,0.08420122],"study_design_scores_gemma":[0.00017598698,0.00057520246,0.00082379504,0.00007305258,0.0000016875489,0.0000020405525,0.0000011712735,0.8814452,0.11632293,0.00034046362,0.00015205223,0.00008637533],"about_ca_topic_score_codex":0.000009891151,"about_ca_topic_score_gemma":3.0973666e-7,"teacher_disagreement_score":0.81094307,"about_ca_system_score_codex":0.000014061571,"about_ca_system_score_gemma":0.00001758529,"threshold_uncertainty_score":0.23241313},"labels":[],"label_agreement":null},{"id":"W2536543316","doi":"10.1109/epc.2008.4763372","title":"An introduction to open-source linear algebra tools and parallelisation for power system applications","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computation; Open source; Linear algebra; Power (physics); Cluster (spacecraft); Computer cluster; Computational science; Distributed computing; Supercomputer; Parallel computing; Computer engineering; Operating system; Algorithm; Software; Mathematics","score_opus":0.02742835724246909,"score_gpt":0.2840252893173587,"score_spread":0.2565969320748896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536543316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023767753,0.000012919958,0.99262834,0.0023614273,0.00006170384,0.0010417482,0.0000021335002,0.00080760947,0.00070733606],"genre_scores_gemma":[0.30246338,0.000004340705,0.6961951,0.00037759612,0.00017204709,0.00027494816,0.000017644716,0.000008429822,0.00048649608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990857,0.00004267781,0.00020097641,0.00043270347,0.00009993018,0.00013800613],"domain_scores_gemma":[0.9991181,0.00004498675,0.000063575266,0.00050309865,0.00016906095,0.00010121371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029817122,0.00009336667,0.00012024799,0.0000901998,0.0003352249,0.00024216333,0.00059868884,0.000046741032,0.0000030963922],"category_scores_gemma":[0.000025602916,0.000088401335,0.000019127678,0.00025509094,0.000018410816,0.0007021804,0.00016392856,0.00003979856,0.000011023337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003584936,0.00019734028,0.00026941788,0.000037811253,0.000021022166,8.178079e-7,0.0019655142,0.054459736,0.0010449047,0.8519893,0.040817726,0.04916051],"study_design_scores_gemma":[0.00045925338,0.00041382504,0.0008384706,0.0000107272945,0.000005365158,0.00007985499,0.00011321755,0.798552,0.004250674,0.0007841966,0.1941101,0.00038231857],"about_ca_topic_score_codex":0.000013428775,"about_ca_topic_score_gemma":0.0000012686897,"teacher_disagreement_score":0.85120517,"about_ca_system_score_codex":0.000033721375,"about_ca_system_score_gemma":0.00003024519,"threshold_uncertainty_score":0.3604902},"labels":[],"label_agreement":null},{"id":"W2536584158","doi":"10.1145/2989081.2989097","title":"Challenges of Programming a System with Heterogeneous Memories and Heterogeneous Processors","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Exploit; Computer science; Symmetric multiprocessor system; Focus (optics); Heterogeneous network; Distributed computing; Parallel computing; Computer architecture; Operating system; Computer security","score_opus":0.0185853046459709,"score_gpt":0.23615057596104086,"score_spread":0.21756527131506997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536584158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022605838,0.0010581249,0.9738094,0.00035163274,0.00002572347,0.0002053228,4.573857e-7,0.00086192496,0.0010815691],"genre_scores_gemma":[0.8487035,0.000106340536,0.15108585,0.000011707414,0.000010952868,0.00002294277,8.496071e-8,0.000008249286,0.000050382605],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905854,0.000039416613,0.0001904975,0.00033807656,0.00017844758,0.00019504562],"domain_scores_gemma":[0.99930286,0.000054166787,0.000121337034,0.00032209375,0.0001340329,0.00006549073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015082161,0.00013248407,0.00019054572,0.000081215694,0.00006240874,0.00004980789,0.00033244322,0.00004359037,6.5890845e-7],"category_scores_gemma":[0.000011967401,0.00007344319,0.000023913455,0.00012237988,0.00007718195,0.0001672939,0.00013722281,0.000024586647,0.0000011872177],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006203541,0.00015392176,0.001157771,0.0008732015,0.00014867976,0.00008573305,0.002438538,0.0023473266,0.0006301761,0.09948443,0.000028737155,0.89258945],"study_design_scores_gemma":[0.003777489,0.0061509083,0.00071494916,0.0037438865,0.00007330979,0.0055793845,0.00068689685,0.20149781,0.7696511,0.0025659997,0.0029412468,0.002617028],"about_ca_topic_score_codex":0.0000059173803,"about_ca_topic_score_gemma":0.000012335574,"teacher_disagreement_score":0.88997245,"about_ca_system_score_codex":0.00001680908,"about_ca_system_score_gemma":0.000027690412,"threshold_uncertainty_score":0.29949263},"labels":[],"label_agreement":null},{"id":"W2543071820","doi":"10.1109/edtc.1994.326902","title":"Instruction-set matching and selection for DSP and ASIP code generation","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Instruction set; Compiler; Retargeting; Digital signal processing; Code generation; Set (abstract data type); Computer architecture; Selection (genetic algorithm); Code (set theory); Matching (statistics); Programming language; Parallel computing; Artificial intelligence; Computer hardware; Operating system; Key (lock)","score_opus":0.0381013443426415,"score_gpt":0.2619556862124389,"score_spread":0.2238543418697974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543071820","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056320217,0.000051521267,0.9422477,0.0004093595,0.00005917244,0.000099490666,5.434286e-7,0.00028538884,0.00052664895],"genre_scores_gemma":[0.49170163,0.000053074684,0.50774544,0.00015134676,0.000051040293,0.000008217545,0.0000013851864,0.000002976777,0.00028486463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957484,0.000018163035,0.000094279734,0.00018347733,0.00005104867,0.00007820481],"domain_scores_gemma":[0.9998132,0.00002326631,0.000034930465,0.00005739539,0.000042944277,0.000028289156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104745,0.00005506677,0.00005460035,0.00005952507,0.00019829451,0.00016488356,0.000060801773,0.0000346068,0.000004197157],"category_scores_gemma":[0.000010905515,0.00005236802,0.00000941514,0.00009344884,0.000010901043,0.0002877411,0.000033291486,0.000033431632,8.8298384e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007911671,0.000068592206,0.0030466386,0.000061964165,0.00003563739,6.197995e-7,0.0031491616,0.019287078,0.008986752,0.4274274,0.02862934,0.50929886],"study_design_scores_gemma":[0.00016909241,0.00004341539,0.00020399272,0.000003000772,0.000001555038,0.000027149472,0.00000517436,0.991959,0.0024168533,0.0038759254,0.0012223811,0.000072457115],"about_ca_topic_score_codex":0.000015402638,"about_ca_topic_score_gemma":0.000014313121,"teacher_disagreement_score":0.9726719,"about_ca_system_score_codex":0.000010172148,"about_ca_system_score_gemma":0.0000034821949,"threshold_uncertainty_score":0.2135506},"labels":[],"label_agreement":null},{"id":"W2546708860","doi":"10.1109/ccece.2016.7726759","title":"Effects of false sharing and locality on object layout optimization for multi-threaded applications","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; New Brunswick Innovation Foundation","keywords":"Locality; Computer science; Java; Latency (audio); IBM; Locality of reference; Parallel computing; Operating system; Distributed computing; Cache","score_opus":0.027920580633016993,"score_gpt":0.29378234601013486,"score_spread":0.26586176537711786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546708860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000926397,0.000037610953,0.9977962,0.00016448324,0.000022311382,0.0005638956,0.0000014912124,0.0003197824,0.0001678508],"genre_scores_gemma":[0.36579445,0.000021676382,0.63381237,0.00008211133,0.000010995772,0.000114485505,0.0000012660242,0.0000054882976,0.0001571415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993179,0.000023733775,0.000168493,0.00029704126,0.00007772877,0.000115098635],"domain_scores_gemma":[0.99930114,0.00019651916,0.00008544002,0.00027819638,0.00009521971,0.000043476026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017968731,0.0000841427,0.00011865505,0.00007543623,0.00007523326,0.00003341575,0.00027826882,0.000047852853,0.0000013385544],"category_scores_gemma":[0.000057984762,0.0000584951,0.000031253643,0.00013164947,0.00004054115,0.00013567526,0.00010750873,0.000022964296,0.0000015522611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700094,0.00082772406,0.0031397273,0.00055202236,0.00007917613,0.0000010329236,0.0006604686,0.13947943,0.0051714643,0.5772089,0.0005911017,0.27222195],"study_design_scores_gemma":[0.00058675266,0.00008237533,0.0002909329,0.000051030005,0.0000044214103,6.264936e-7,0.00000191948,0.95525897,0.041476075,0.0020653089,0.00007815275,0.00010344183],"about_ca_topic_score_codex":0.000008007891,"about_ca_topic_score_gemma":0.0000012607196,"teacher_disagreement_score":0.8157795,"about_ca_system_score_codex":0.000017964685,"about_ca_system_score_gemma":0.000014174639,"threshold_uncertainty_score":0.2385361},"labels":[],"label_agreement":null},{"id":"W2547022751","doi":"10.1109/ccece.2016.7726823","title":"Rapid design space exploration of multi-clock domain MPSoCs with hybrid prototyping","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"MPSoC; Embedded system; Emulation; Computer science; Rapid prototyping; Field-programmable gate array; Design space exploration; Software prototyping; Virtual prototyping; Software; Hardware emulation; Computer architecture; System on a chip; Engineering; Software development; Simulation","score_opus":0.05022947197884236,"score_gpt":0.2594386630341807,"score_spread":0.20920919105533836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547022751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038481495,0.00004298463,0.9969115,0.000926611,0.000028079416,0.0005733176,3.3166984e-7,0.0005150197,0.0006173114],"genre_scores_gemma":[0.1428684,0.000034985827,0.8566238,0.000053384643,0.00001234038,0.000056281682,3.3924016e-7,0.0000077652685,0.00034265238],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908376,0.00012297748,0.00019019225,0.00026405492,0.00017439338,0.0001646354],"domain_scores_gemma":[0.99921113,0.00008728812,0.00013566882,0.0003721904,0.00014742113,0.00004629409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038395173,0.00010963327,0.00012948504,0.00009621528,0.00006940831,0.000042520347,0.0003793395,0.000027406808,0.000008893345],"category_scores_gemma":[0.000029833973,0.000065319844,0.000026528058,0.00021241237,0.000042159947,0.0006970074,0.0000804198,0.000036397203,0.000010767829],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036494463,0.000957495,0.0008199597,0.0001476125,0.00015544341,0.00004273392,0.004717458,0.044377424,0.036486235,0.32393792,0.012515902,0.5754769],"study_design_scores_gemma":[0.0015225508,0.00069999363,0.000087929126,0.00024781984,0.000004462067,0.0000197883,0.000033459877,0.39578575,0.5903793,0.0074477256,0.0033465635,0.00042467835],"about_ca_topic_score_codex":0.0000062905824,"about_ca_topic_score_gemma":9.4507857e-7,"teacher_disagreement_score":0.5750522,"about_ca_system_score_codex":0.000024190975,"about_ca_system_score_gemma":0.00006425244,"threshold_uncertainty_score":0.2663666},"labels":[],"label_agreement":null},{"id":"W2547222329","doi":"10.1109/ccece.2016.7726760","title":"Thread-group based local heap garbage collection in a simulated runtime environment","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; Center for Advanced Study, University of Illinois at Urbana-Champaign; New Brunswick Innovation Foundation","keywords":"Garbage collection; Heap (data structure); Thread (computing); Computer science; Garbage; Java; Operating system; Virtual machine; Parallel computing; Implementation; Programming language","score_opus":0.00918750982576559,"score_gpt":0.21738779781952042,"score_spread":0.20820028799375484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547222329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027618941,0.000018341869,0.9934906,0.0008197775,0.00004825971,0.00016662407,2.854443e-7,0.0005305708,0.0021636426],"genre_scores_gemma":[0.8247934,0.000012719868,0.17390695,0.0003182504,0.000008406434,0.0000080791815,0.0000012212399,0.0000068601935,0.00094413647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896264,0.00008587858,0.00021644449,0.00034194443,0.00017560011,0.00021748921],"domain_scores_gemma":[0.99942064,0.000110875735,0.000049412967,0.00034611032,0.000016347165,0.0000566393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026602397,0.00011442646,0.00012339145,0.0001616047,0.00006492026,0.00004175872,0.00031076852,0.00007120269,0.000100280515],"category_scores_gemma":[0.000012537301,0.000081071696,0.0000381699,0.00030311345,0.00003898341,0.00017702898,0.000105021456,0.00005729725,0.00008049945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018891988,0.002008991,0.017922094,0.000034549506,0.000055648256,0.000102680926,0.0005867296,0.7305716,0.0078001968,0.0682475,0.017339498,0.15514158],"study_design_scores_gemma":[0.00075686525,0.00013291954,0.0019684946,0.000030963227,0.0000011522031,0.0000018172525,0.0000017566244,0.9883437,0.005266362,0.0018980628,0.0014323908,0.00016553006],"about_ca_topic_score_codex":0.00006450515,"about_ca_topic_score_gemma":0.000010510126,"teacher_disagreement_score":0.8220315,"about_ca_system_score_codex":0.00014769933,"about_ca_system_score_gemma":0.000028778053,"threshold_uncertainty_score":0.33060077},"labels":[],"label_agreement":null},{"id":"W2547231246","doi":"10.1109/ccece.2016.7726796","title":"Retargeting and enhancing a compact multitasking kernel for the Altera Nios II processor","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Human multitasking; Kernel (algebra); Operating system; Embedded system; Programming language","score_opus":0.01819828755636704,"score_gpt":0.2690465251066465,"score_spread":0.25084823755027946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547231246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028134135,0.0001906069,0.99121034,0.0043826727,0.000069226306,0.00025683554,7.258391e-7,0.00042367977,0.00065249763],"genre_scores_gemma":[0.751207,0.000025941203,0.24775834,0.00041317864,0.000050091945,0.000014479002,2.2802872e-7,0.0000063973093,0.00052434206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919397,0.000026441145,0.0001816146,0.00026969402,0.00010620314,0.00022206666],"domain_scores_gemma":[0.9989868,0.00054345676,0.000092819515,0.00023777812,0.00009565435,0.000043501303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139221,0.00010160841,0.000108723994,0.00004265686,0.00047036516,0.00012789949,0.00041742198,0.000029413162,0.000004025269],"category_scores_gemma":[0.00020519084,0.00005112305,0.000035394438,0.00010586191,0.000030329626,0.00028049215,0.00017690011,0.000044399265,0.0000019913186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008092084,0.00024120434,0.0037046592,0.0002669917,0.00020727809,0.000006098504,0.014049637,0.0056386776,0.0730262,0.157307,0.020189818,0.72528154],"study_design_scores_gemma":[0.00049488345,0.00010305961,0.0005898672,0.00015702697,0.000006254059,0.000012208048,0.000038474365,0.9391878,0.0519839,0.0029041606,0.0042867814,0.00023555434],"about_ca_topic_score_codex":0.000014253857,"about_ca_topic_score_gemma":0.00000465142,"teacher_disagreement_score":0.93354917,"about_ca_system_score_codex":0.000016965352,"about_ca_system_score_gemma":0.000025721067,"threshold_uncertainty_score":0.3617716},"labels":[],"label_agreement":null},{"id":"W2547589727","doi":"10.1109/ccece.2016.7726757","title":"Object layout optimization in the JVM based on affinity","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; New Brunswick Innovation Foundation","keywords":"Computer science; Java; Cache; Operating system; Locality; Object (grammar); Parallel computing; IBM; Artificial intelligence","score_opus":0.018952520087047633,"score_gpt":0.25375193985849787,"score_spread":0.23479941977145025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547589727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037017209,0.0000030912454,0.9670077,0.0034016797,0.00005357361,0.000108818764,3.6946093e-7,0.0003471469,0.028707445],"genre_scores_gemma":[0.72569174,0.000004111876,0.2720828,0.00201876,0.00001633694,0.000010554201,7.360223e-7,0.0000033079534,0.00017165515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.0001694064,0.00012981078,0.00020532745,0.00018352155,0.00013881468],"domain_scores_gemma":[0.9991605,0.00029193267,0.000042185628,0.0004468205,0.000037510512,0.000021041247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052318553,0.00007769961,0.000067170244,0.00010840942,0.000065299115,0.00008082251,0.000664863,0.00003819244,0.000028453327],"category_scores_gemma":[0.00009995111,0.000038376045,0.000029028522,0.00034464497,0.000017724411,0.00015313884,0.000049329592,0.00005429692,0.000025287396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008548796,0.00013331276,0.0011406472,0.0000022108998,0.0000016088087,0.000004840067,0.00021210984,0.95390856,0.000016792335,0.028207298,0.004942845,0.011421209],"study_design_scores_gemma":[0.00024033803,0.00006991464,0.00102672,0.000020491289,5.226181e-7,0.0000010384181,0.0000036052752,0.9969507,0.0006200285,0.0006439497,0.00033615058,0.00008654374],"about_ca_topic_score_codex":0.000013377964,"about_ca_topic_score_gemma":0.0000049235205,"teacher_disagreement_score":0.7253216,"about_ca_system_score_codex":0.00002597493,"about_ca_system_score_gemma":0.000038658232,"threshold_uncertainty_score":0.15649296},"labels":[],"label_agreement":null},{"id":"W2547636876","doi":"10.1109/ccece.2016.7726721","title":"Parallel implementation of image matching with MPI","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Message Passing Interface; Parallel computing; Matching (statistics); Image (mathematics); Grayscale; Computation; Domain (mathematical analysis); Parallel algorithm; Parallelism (grammar); Supercomputer; Message passing; Algorithm; Artificial intelligence","score_opus":0.011303108997411788,"score_gpt":0.2815395056826536,"score_spread":0.27023639668524185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547636876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00825402,0.0000056043523,0.9877355,0.0007895871,0.000015573289,0.000066589,4.4156698e-7,0.0002679781,0.002864677],"genre_scores_gemma":[0.4728355,0.000005188168,0.5269708,0.000055370565,0.000004591527,0.0000029217633,2.1173067e-7,0.0000022780596,0.00012314411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994777,0.000022915585,0.00013490646,0.00014078277,0.00011925625,0.000104467916],"domain_scores_gemma":[0.99958646,0.00002705347,0.0000797181,0.00021538569,0.00006641865,0.000024973011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012420182,0.000056164907,0.0000703503,0.000052907635,0.000032945947,0.000028117413,0.00027460075,0.000013074954,0.000030934512],"category_scores_gemma":[0.0000025082809,0.000031171243,0.000017425908,0.000111650705,0.000019547895,0.00034045608,0.00007438257,0.000016160555,0.00000847068],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027536802,0.00011202682,0.011490046,0.000041007796,0.000062487685,0.0000105202935,0.00202614,0.0012583502,0.031046629,0.67714125,0.007262573,0.26952145],"study_design_scores_gemma":[0.006766137,0.001609641,0.055845663,0.00045050372,0.000027308053,0.00009092103,0.00060536334,0.044344626,0.76835895,0.11757798,0.0026749338,0.0016479712],"about_ca_topic_score_codex":0.00005616908,"about_ca_topic_score_gemma":0.000009278805,"teacher_disagreement_score":0.7373123,"about_ca_system_score_codex":0.000010697824,"about_ca_system_score_gemma":0.000027646787,"threshold_uncertainty_score":0.12711264},"labels":[],"label_agreement":null},{"id":"W2548906624","doi":"10.1016/j.cpc.2017.05.020","title":"A hybrid algorithm for parallel molecular dynamics simulations","year":2017,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"Natural Sciences and Engineering Research Council of Canada; Shared Hierarchical Academic Research Computing Network; Laurentian University","keywords":"SIMD; Xeon Phi; Parallel computing; Computer science; Vectorization (mathematics); Thread (computing); Domain decomposition methods; Xeon; Multi-core processor; Molecular dynamics; Computational science; Physics; Chemistry; Finite element method; Computational chemistry","score_opus":0.035609518961471374,"score_gpt":0.3153830728982048,"score_spread":0.2797735539367334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548906624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004150857,0.00006876294,0.9950075,0.0025152199,0.00018885855,0.00044033054,0.000049331684,0.0005402962,0.0011481721],"genre_scores_gemma":[0.094961345,0.000026426966,0.9042507,0.00032069065,0.00009463366,0.00007838006,0.0001627336,0.000021243537,0.00008388881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00008282046,0.00029038292,0.00036991027,0.00015497685,0.00027043876],"domain_scores_gemma":[0.9932102,0.00024412849,0.00032102864,0.005768743,0.00036496794,0.00009095239],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00016388767,0.00019273398,0.00021916581,0.00006430161,0.0017880967,0.0008078313,0.0055791372,0.000048968202,6.856568e-7],"category_scores_gemma":[0.000028551018,0.00021970068,0.00015959529,0.00009949369,0.00016981152,0.00062797446,0.0022386387,0.0001820648,0.000011157505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.654831e-7,0.00017690536,0.00003563708,0.000005463482,0.000043096974,0.0000010105695,0.00012859417,0.04069645,0.000012238473,0.5337755,0.0008655144,0.42425895],"study_design_scores_gemma":[0.000295724,0.00003415482,0.000095981406,0.00001914286,0.000010199721,0.0000032552214,8.8493374e-7,0.88387287,0.00006424259,0.11328477,0.0020930262,0.00022576746],"about_ca_topic_score_codex":0.000018064702,"about_ca_topic_score_gemma":0.000003897599,"teacher_disagreement_score":0.8431764,"about_ca_system_score_codex":0.00008612319,"about_ca_system_score_gemma":0.00011807052,"threshold_uncertainty_score":0.99980116},"labels":[],"label_agreement":null},{"id":"W2551856227","doi":"10.1109/hotchips.2008.7476548","title":"Ready, fire, aim - 20 years of hits &amp; misses at Hot Chips","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reduced instruction set computing; Computer science; CMOS; Embedded system; Operating system; Computer hardware; Computer architecture; Parallel computing; Instruction set; Engineering; Electrical engineering","score_opus":0.04454465682709696,"score_gpt":0.2677559490137129,"score_spread":0.22321129218661595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551856227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14000085,0.00022348721,0.83533,0.00026250447,0.00012689653,0.000104836574,0.000002600746,0.00079701986,0.023151824],"genre_scores_gemma":[0.5278246,0.00019369586,0.45517078,0.00034328518,0.000034711473,0.000003736478,0.000010125414,0.000009719993,0.016409365],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991594,0.00003838616,0.00020410473,0.00023645091,0.00019813018,0.0001635591],"domain_scores_gemma":[0.999236,0.00007231501,0.00008398838,0.00046579103,0.00007795663,0.000063945554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011100324,0.00008820382,0.0001431873,0.00006599844,0.00009293326,0.000017603537,0.00055602187,0.00005298069,0.000054736985],"category_scores_gemma":[0.000042913838,0.000085385334,0.000046189958,0.0002660735,0.00005524423,0.00012919212,0.00023822312,0.00005881392,0.00009229739],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044484168,0.0005077303,0.0071435045,0.000052454692,0.00008336083,0.00007496263,0.00422056,0.017932462,0.0025607035,0.019819599,0.89617866,0.05138153],"study_design_scores_gemma":[0.001820076,0.0006523358,0.07495542,0.00018217938,0.000025248879,0.0007579794,0.000024074072,0.4343234,0.09192853,0.005477134,0.38769913,0.0021545046],"about_ca_topic_score_codex":0.000061261744,"about_ca_topic_score_gemma":0.00000929912,"teacher_disagreement_score":0.50847954,"about_ca_system_score_codex":0.000017830569,"about_ca_system_score_gemma":0.000041553747,"threshold_uncertainty_score":0.3481913},"labels":[],"label_agreement":null},{"id":"W2553746381","doi":"10.82308/25729","title":"Optimizing software-hardware interplay in efficient virtual machines","year":2009,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Just-in-time compilation; Compiler; Programming language; Interpreter; Python (programming language); Java; Copying; Virtual machine; Operating system; Bytecode; Machine code; Optimizing compiler; Compiled language; Software; Garbage collection; High-level programming language; Programming paradigm","score_opus":0.011843973983533583,"score_gpt":0.2491068334685904,"score_spread":0.2372628594850568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553746381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7950059,0.00047388655,0.1630272,0.00046950806,0.0016117,0.0011956015,0.000117481744,0.00641858,0.03168014],"genre_scores_gemma":[0.79702467,0.000026069898,0.20168176,0.0009453148,0.000020764497,0.00001815973,0.000010409716,0.000030787625,0.00024207155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996529,0.00033685376,0.00075090834,0.001047229,0.0005715571,0.0007644562],"domain_scores_gemma":[0.99812657,0.00022698221,0.00024920952,0.0009430048,0.00019064646,0.0002635638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010644778,0.00047663748,0.00047469095,0.00060219696,0.0006195291,0.00023616756,0.0018230239,0.0002319076,0.000024217085],"category_scores_gemma":[0.0005547899,0.00048295222,0.00019566446,0.0011415008,0.000049813072,0.00082497223,0.0005969036,0.0008113261,0.00009539835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005208238,0.0005023256,0.000097710115,0.000019901567,0.000027480688,0.00016828529,0.000060451886,0.20702992,0.0034905223,0.19636418,0.000026604157,0.5921605],"study_design_scores_gemma":[0.0041529555,0.0018104012,0.0035492266,0.0011829238,0.000045778488,0.0003348313,0.00007172078,0.8142267,0.086640134,0.06292429,0.020868741,0.00419233],"about_ca_topic_score_codex":0.000049770053,"about_ca_topic_score_gemma":0.000020525418,"teacher_disagreement_score":0.60719675,"about_ca_system_score_codex":0.00039029523,"about_ca_system_score_gemma":0.000033792978,"threshold_uncertainty_score":0.99976224},"labels":[],"label_agreement":null},{"id":"W2559156534","doi":"10.1109/jssc.2016.2621918","title":"Introduction to the December Special Issue on the 2016 IEEE International Solid-State Circuits Conference","year":2016,"lang":"en","type":"article","venue":"IEEE Journal of Solid-State Circuits","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireline; Solid-state; Electronic circuit; Computer science; State (computer science); Wireless; Telecommunications; Task (project management); Electrical engineering; Engineering; Systems engineering; Engineering physics","score_opus":0.03030601085608724,"score_gpt":0.29191135666398593,"score_spread":0.2616053458078987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559156534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015077873,0.000030828982,0.91772723,0.05313092,0.010043215,0.00034566663,0.000028390434,0.00012900661,0.0034868873],"genre_scores_gemma":[0.96090627,0.0007471591,0.0014597174,0.0037476595,0.024219852,0.000021354794,0.0000013239934,0.00005188457,0.008844759],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967107,0.00034030477,0.00093370944,0.0004852879,0.001002079,0.0005279225],"domain_scores_gemma":[0.99653107,0.00041908995,0.00080844434,0.00074288563,0.0012592028,0.00023933333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022503,0.000324208,0.00037209364,0.0003489712,0.00033948262,0.00041467312,0.002619142,0.00008334903,0.00022705519],"category_scores_gemma":[0.0003541355,0.0001723222,0.00019035708,0.00046090793,0.00014292786,0.0007918704,0.00013811068,0.0004508648,0.0005667061],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004147065,0.00013646562,0.000042382275,0.0000059487425,0.00014575268,0.0000501064,0.0026084573,0.02461961,0.00980251,0.0014900897,0.7485211,0.2125361],"study_design_scores_gemma":[0.0021006272,0.0011243094,0.001577593,0.0008687487,0.000054955297,0.0009881196,0.0001210762,0.014585671,0.20197104,0.02090759,0.75444305,0.0012571904],"about_ca_topic_score_codex":0.000005936254,"about_ca_topic_score_gemma":0.0000148691925,"teacher_disagreement_score":0.94582844,"about_ca_system_score_codex":0.00023718923,"about_ca_system_score_gemma":0.00032795785,"threshold_uncertainty_score":0.72840494},"labels":[],"label_agreement":null},{"id":"W2559901034","doi":"10.1145/2974022","title":"Microarchitecture and Circuits for a 200 MHz Out-of-Order Soft Processor Memory System","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Microarchitecture; Cache; Field-programmable gate array; Embedded system; Computer architecture; Out-of-order execution; Parallel computing; Pipeline burst cache; CPU cache; Computer hardware; Cache coloring","score_opus":0.01774130155481339,"score_gpt":0.24271252960455242,"score_spread":0.224971228049739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559901034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005436638,0.0010938378,0.9895849,0.0016016845,0.00035213892,0.0006439266,0.000022897972,0.0008892994,0.00037465233],"genre_scores_gemma":[0.9735391,0.00010372827,0.02471088,0.000035514582,0.000016554139,0.0002668007,7.4740933e-7,0.000016809156,0.0013098681],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987463,0.000054767555,0.00036196952,0.00047615814,0.000091894246,0.00026895732],"domain_scores_gemma":[0.9986723,0.00027783922,0.00017461415,0.0006093702,0.00020806715,0.00005780665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033387367,0.00018758615,0.00035037094,0.00053884863,0.00025872374,0.0000490313,0.00054538564,0.00031247275,0.00000236437],"category_scores_gemma":[0.00006832551,0.00013691201,0.000043438333,0.00039458682,0.00015431453,0.00013977924,0.000010519444,0.000146552,0.0000037021664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071656046,0.0001868897,0.00022935853,0.0017849694,0.0003006725,0.0000066127022,0.0010167691,0.0021969436,0.024589581,0.022730805,0.0004824282,0.9464033],"study_design_scores_gemma":[0.01648809,0.0065259524,0.0003158425,0.012374736,0.00048739815,0.0036709702,0.0046105585,0.24458496,0.60739684,0.050759207,0.04733355,0.00545188],"about_ca_topic_score_codex":0.000010626392,"about_ca_topic_score_gemma":0.00000529354,"teacher_disagreement_score":0.96810246,"about_ca_system_score_codex":0.00002796181,"about_ca_system_score_gemma":0.000060510833,"threshold_uncertainty_score":0.558311},"labels":[],"label_agreement":null},{"id":"W2560324125","doi":"10.1109/mascots.2016.49","title":"Experimental Calibration and Validation of a Speed Scaling Simulator","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Speedup; Scaling; Context (archaeology); Energy consumption; Simulation; Real-time computing; Parallel computing","score_opus":0.019521342017579612,"score_gpt":0.27398854788176114,"score_spread":0.25446720586418153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560324125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18693998,0.000017130471,0.81238824,0.00013875203,0.00002380462,0.000041817657,1.7610648e-7,0.00014036904,0.00030970408],"genre_scores_gemma":[0.8973735,0.0000020578075,0.102493465,0.000033956578,0.000009481981,5.9095447e-7,3.078892e-7,0.000001939794,0.00008467934],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996098,0.000023396977,0.00011539443,0.00011852305,0.00007949727,0.000053337983],"domain_scores_gemma":[0.99974227,0.000042332053,0.000046843696,0.000115824005,0.000028558154,0.0000241466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000091836926,0.00004015612,0.00005405157,0.00004483909,0.000027204082,0.000028726909,0.00010020323,0.000021011349,0.000009517516],"category_scores_gemma":[0.000016159425,0.000026890244,0.0000122182155,0.00007057695,0.000017303506,0.00030391818,0.000066797096,0.000009072395,9.30945e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019904666,0.00016466805,0.004563692,0.000017388793,0.000019303136,0.0000014286978,0.0014521223,0.0130100055,0.7852193,0.16330352,0.00083456363,0.031394072],"study_design_scores_gemma":[0.000112353366,0.000021699694,0.00006281796,0.000008929059,3.7339146e-7,7.836544e-7,0.000003651968,0.36389604,0.63537675,0.000469157,0.000013720282,0.000033683158],"about_ca_topic_score_codex":0.0000051581446,"about_ca_topic_score_gemma":3.7146417e-8,"teacher_disagreement_score":0.71043354,"about_ca_system_score_codex":0.0000081492335,"about_ca_system_score_gemma":0.000009326482,"threshold_uncertainty_score":0.10965523},"labels":[],"label_agreement":null},{"id":"W2561403425","doi":"","title":"Towards Comprehensive Parametric Code Generation Targeting Graphics Processing Units in Support of Scientific Computation","year":2016,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Graphics; Code (set theory); Computation; Parametric statistics; Programming language; Computer graphics (images); Computational science; Set (abstract data type); Mathematics","score_opus":0.14197210169201144,"score_gpt":0.33086051781242637,"score_spread":0.18888841612041493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561403425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5565473,0.00003330531,0.44283313,0.00012045477,0.00012584712,0.00013573354,0.0000066341436,0.0001694648,0.000028154256],"genre_scores_gemma":[0.9901832,0.00003439832,0.009339865,0.00011452706,0.000026003265,0.0000010078166,0.000028788301,0.000016385819,0.00025586484],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99768597,0.00035728814,0.0004411822,0.00065351056,0.0004935843,0.00036846683],"domain_scores_gemma":[0.9980231,0.0001166471,0.00042438947,0.00036931774,0.00094232673,0.00012420116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000696847,0.00022671283,0.000298241,0.0016824792,0.0002697406,0.00036110354,0.00097060075,0.0001520975,0.0000018991439],"category_scores_gemma":[0.000108376116,0.0002172914,0.00006322865,0.003678727,0.00017623302,0.0023225464,0.00039141122,0.00022493687,0.000010386605],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042952895,0.0002330445,0.9508598,0.00013984862,0.000033863107,0.00011756558,0.0012096077,0.007916846,0.012303906,0.0020257765,0.000021057467,0.025095735],"study_design_scores_gemma":[0.00427235,0.0006326376,0.889418,0.00086677924,0.000063555504,0.00005987353,0.00015066192,0.010296933,0.087252975,0.00192349,0.003296693,0.0017660502],"about_ca_topic_score_codex":0.000003820684,"about_ca_topic_score_gemma":0.00008890374,"teacher_disagreement_score":0.4336359,"about_ca_system_score_codex":0.00016176664,"about_ca_system_score_gemma":0.0003092737,"threshold_uncertainty_score":0.8860886},"labels":[],"label_agreement":null},{"id":"W2562506265","doi":"10.5555/3195638.3195690","title":"The bunker cache for spatio-value approximation","year":2016,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cache; Computer science; Parallel computing; Cache algorithms; Cache pollution; Cache coloring; Smart Cache; Cache invalidation; Page cache; Bunker; Cache-oblivious algorithm; CPU cache","score_opus":0.008961541499873363,"score_gpt":0.25387341801218455,"score_spread":0.2449118765123112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562506265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015343076,0.000030479046,0.9451411,0.049424496,0.00067206123,0.00031612717,0.000016714872,0.0002783685,0.0025863717],"genre_scores_gemma":[0.7478642,0.00009085701,0.24269608,0.0027971484,0.0007281362,0.00026922926,0.00003437711,0.000041173556,0.0054788487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885184,0.00007005604,0.0002316902,0.00034896156,0.00027976825,0.00021769549],"domain_scores_gemma":[0.9987351,0.0005009674,0.0001385558,0.00039375635,0.00018581066,0.000045844114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028083785,0.00014698175,0.000087325316,0.0000756382,0.00026855676,0.00021885507,0.0012201013,0.00007005696,0.000005590577],"category_scores_gemma":[0.00012677751,0.00007965173,0.000102094295,0.00010628253,0.00006186737,0.00012620924,0.00013596882,0.00009688551,0.000028359234],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016557102,0.00014408995,0.00021268232,0.0000124083,0.00012761004,0.0000024815831,0.0007567,0.018715521,0.08329682,0.51421845,0.027043646,0.355304],"study_design_scores_gemma":[0.0015193594,0.00032435136,0.00065484445,0.00014849857,0.000010266649,0.000054094573,0.000007948688,0.18138745,0.16002172,0.056468047,0.59882885,0.00057453377],"about_ca_topic_score_codex":0.0000078498,"about_ca_topic_score_gemma":0.0000049267956,"teacher_disagreement_score":0.74632984,"about_ca_system_score_codex":0.000101684665,"about_ca_system_score_gemma":0.000034123088,"threshold_uncertainty_score":0.32481033},"labels":[],"label_agreement":null},{"id":"W2563671492","doi":"","title":"Improving resource utilization by curbing speculative trace progression in simultaneous multi-threading CPUs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Threading (protein sequence); Speculative multithreading; TRACE (psycholinguistics); Parallel computing; Resource (disambiguation); Speculative execution; Superscalar; Multithreading; Distributed computing; Operating system; Computer network; Thread (computing); Chemistry","score_opus":0.02761494884928414,"score_gpt":0.3010432424920021,"score_spread":0.273428293642718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563671492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048382836,0.00020817289,0.9925227,0.00030489595,0.000054641114,0.00025512007,8.0782803e-7,0.00079094735,0.0010244392],"genre_scores_gemma":[0.7140353,0.00001714596,0.2849263,0.000054373326,0.000015632204,0.000009171335,0.0000017478852,0.000011860143,0.00092850113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985388,0.00012174976,0.00030961868,0.00049653416,0.00021867873,0.00031463],"domain_scores_gemma":[0.99899936,0.00037797558,0.00016172651,0.00031050178,0.0000768628,0.000073558134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035999523,0.00016206606,0.00015253057,0.00016172529,0.0001275644,0.000117061376,0.0004564771,0.00009145169,0.0000072052394],"category_scores_gemma":[0.00038273647,0.00011487714,0.000034459004,0.00042711123,0.000035434314,0.00048101004,0.00019875757,0.00009742853,0.000009356868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023811994,0.00018995059,0.0016660126,0.000017875564,0.000006364176,0.00003101144,0.0012755584,0.014676436,0.01993508,0.003558276,0.00071495917,0.95790464],"study_design_scores_gemma":[0.00045779947,0.000065736276,0.000045861336,0.00016442244,0.0000012010568,0.000004799589,0.000022858,0.95265186,0.044959433,0.00017376563,0.0012440453,0.00020824156],"about_ca_topic_score_codex":0.000030251189,"about_ca_topic_score_gemma":0.000007830098,"teacher_disagreement_score":0.95769644,"about_ca_system_score_codex":0.00012332962,"about_ca_system_score_gemma":0.00002846867,"threshold_uncertainty_score":0.4684554},"labels":[],"label_agreement":null},{"id":"W2563694094","doi":"10.12802/relime.13.17414","title":"CONJECTURES, POSTULATS ET VÉRIFICATIONS EXPÉRIMENTALES DANS LE PARADIGME DU GÉOMÈTRE-PHYSICIEN : COMMENT INTÉGRER LE TRAVAIL AVEC LES LGD ?","year":2016,"lang":"fr","type":"article","venue":"Revista Latinoamericana de Investigación en Matemática Educativa","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Work (physics); Physicist; Theoretical physics; Computer science; Physics; Quantum mechanics","score_opus":0.019733537997225416,"score_gpt":0.2726332861286762,"score_spread":0.2528997481314508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563694094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06510302,0.004689681,0.76145256,0.16014355,0.00042602367,0.001006606,0.00015440847,0.00070620194,0.0063179545],"genre_scores_gemma":[0.87095726,0.001184588,0.117821224,0.0040411483,0.00026154425,0.00016384828,0.00006655127,0.00010329833,0.0054005324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993608,0.002419425,0.0011043653,0.001200112,0.0005003876,0.0011677203],"domain_scores_gemma":[0.995608,0.0010742401,0.0008239763,0.0014907627,0.000268625,0.00073442806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012634707,0.0007065266,0.00082649523,0.00023052159,0.0008770567,0.0008596706,0.001690069,0.00022278949,0.00018935688],"category_scores_gemma":[0.0005647992,0.00066398404,0.00025671287,0.0009792637,0.0021708396,0.0007173453,0.00048946927,0.0004524607,0.00012008908],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017697459,0.0019148475,0.010187149,0.00034149433,0.00030458558,0.00004824985,0.03295617,0.0013300449,0.010802436,0.74618626,0.12562981,0.070281245],"study_design_scores_gemma":[0.0022995223,0.0009486993,0.11985462,0.00587191,0.0003733766,0.0011025079,0.006308818,0.05013172,0.028217988,0.023026815,0.75697905,0.0048849597],"about_ca_topic_score_codex":0.013182867,"about_ca_topic_score_gemma":0.000095847274,"teacher_disagreement_score":0.80585426,"about_ca_system_score_codex":0.0006930904,"about_ca_system_score_gemma":0.0028087304,"threshold_uncertainty_score":0.99958116},"labels":[],"label_agreement":null},{"id":"W2564142802","doi":"10.5555/3195638.3195698","title":"CHAINSAW: von-neumann accelerators to leverage fused instruction chains","year":2016,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parallel computing; Compiler; Microarchitecture; Dataflow; SIMD; Very long instruction word; Von Neumann architecture; Pipeline (software); Code generation; Computer architecture; Leverage (statistics); Instruction scheduling; Partition (number theory); Programming language; Operand; Key (lock); Computer hardware; Operating system; Schedule","score_opus":0.010291208689817694,"score_gpt":0.2465166505645503,"score_spread":0.2362254418747326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564142802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106787056,0.000011033204,0.8581976,0.029899197,0.0014493021,0.00025492365,0.00001978084,0.0007172737,0.0026637823],"genre_scores_gemma":[0.9594308,0.00002822403,0.034371752,0.003266133,0.00041286263,0.00003767854,0.00000803208,0.000027684277,0.0024168082],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817693,0.00008455656,0.0003109954,0.0006585247,0.00044330984,0.00032569753],"domain_scores_gemma":[0.9989134,0.00009094811,0.00013001777,0.00052829384,0.00017878524,0.00015853177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015716425,0.00026285273,0.00017284646,0.00038254535,0.00016493828,0.00021811799,0.0015098412,0.0001164015,0.000037778933],"category_scores_gemma":[0.000056280358,0.00019361217,0.00011269943,0.00033315207,0.00004417512,0.00023210945,0.00032605114,0.0001875535,0.00014459345],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023293619,0.00035030453,0.00096901535,0.000021065713,0.00017970777,0.00005226357,0.0030646976,0.033312537,0.5263194,0.08204582,0.011491807,0.34196046],"study_design_scores_gemma":[0.004214244,0.0011297101,0.008283265,0.0007101492,0.000013566193,0.0003092891,0.00002140911,0.029909914,0.6296655,0.0055429684,0.3180508,0.002149153],"about_ca_topic_score_codex":0.000020135478,"about_ca_topic_score_gemma":0.000009735419,"teacher_disagreement_score":0.8526438,"about_ca_system_score_codex":0.0002135625,"about_ca_system_score_gemma":0.000045100453,"threshold_uncertainty_score":0.78952754},"labels":[],"label_agreement":null},{"id":"W2567506438","doi":"10.1145/952532.952661","title":"Editorial message for the special track on embedded systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories; Instituto Superior Técnico; Universitat Politècnica de València; University of Massachusetts Amherst; Technische Universität Clausthal; SBA Research; Universitat Politècnica de Catalunya; National Institute of Informatics; Universität Innsbruck; Universidade Federal do Estado do Rio de Janeiro; Universität Duisburg-Essen; Universidade Federal do Rio de Janeiro; Université de La Réunion; Tarbiat Modares University; Institute of Software, Chinese Academy of Sciences; University at Albany; Pontifícia Universidade Católica do Rio de Janeiro; Haute école Spécialisée de Suisse Occidentale; Università degli Studi di Udine; Universidade Federal de Pernambuco; National Cheng Kung University; Universiteit Antwerpen; Scuola IMT Alti Studi Lucca; Università di Pisa; Korea Advanced Institute of Science and Technology; University of Isfahan; National University of Singapore; Universität Zürich; Uniwersytet Warszawski; Universidade Estadual de Campinas; Tunghai University; Feng Chia University; Universität Wien; Oulun Yliopisto; Tallinna Tehnikaülikool; Universiti Teknologi Petronas; Göteborgs Universitet; Universidade Federal Fluminense; University of Haifa; Rijksuniversiteit Groningen; Wuhan University; Univerza v Mariboru; Queen's University; Universidade de São Paulo; Háskóli Íslands; Università degli Studi di Trento; Università degli Studi dell'Insubria; Shiraz University; Universidade Federal do Rio Grande do Sul; Vrije Universiteit Brussel; Universitat de València; East China Normal University; Universidad Nacional de La Plata; Universidad de Sevilla; National Taiwan University; Technische Universiteit Eindhoven; University of Tehran; Tsinghua University; Università degli Studi di Milano-Bicocca; Korea University; Peking University; Universidad EAFIT; Seoul National University; KU Leuven; Konkuk University; Dongseo University; University of Twente; Chongqing University; Chinese Academy of Sciences; Université Pierre et Marie Curie; Univerzita Karlova v Praze; Microsoft Research; Technische Universiteit Delft; University of Wisconsin-Milwaukee; Universität Mannheim; University of Limerick; Università degli Studi di Salerno; Ludwig-Maximilians-Universität München; University of Waterloo; Pusan National University; Fundação para a Ciência e a Tecnologia; China University of Geosciences; Radboud Universiteit; TU Graz, Internationale Beziehungen und Mobilitätsprogramme; Università di Bologna; European Commission; University of Oxford; Università di Catania; Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa; Nanyang Technological University; Chalmers Tekniska Högskola; École Polytechnique Fédérale de Lausanne; Bond University; University of Nebraska-Lincoln; Indiana University Southeast; Nanjing University; Institut national de recherche en informatique et en automatique (INRIA); University of Seoul; Universidad Técnica Federico Santa María; Centre National de la Recherche Scientifique; Binghamton University; University College Cork; University of Toronto; University of Texas at San Antonio; Hansung University; Eberhard Karls Universität Tübingen; York University; Kuwait University; Universidad de Chile; Emory University; Indian Institute of Science; National Taiwan University of Science and Technology; DePaul University; Aarhus Universitet; Università degli Studi di Firenze; Università degli Studi di Milano; South Dakota State University; University of Illinois at Urbana-Champaign; Universität Stuttgart; Université Paris 13; Université de Lille; New Mexico State University; Universidad de Extremadura; Université de Nantes; Princeton University; State University of New York; Albert-Ludwigs-Universität Freiburg; Indiana University-Purdue University Indianapolis; University College Dublin; Purdue University; University of California, Santa Barbara; University of Wisconsin-Madison; Air Force Institute of Technology; Università degli Studi della Basilicata; Monash University; Williams College","keywords":"Computer science; Track (disk drive); Computer security; Computer network; Telecommunications; Operating system","score_opus":0.018185066893012358,"score_gpt":0.2665084177968344,"score_spread":0.24832335090382202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567506438","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010518344,0.00002414412,0.8911138,0.00014261299,0.06779372,0.00029322255,7.4542646e-7,0.0003095618,0.04031168],"genre_scores_gemma":[0.14024515,0.00006193943,0.41417387,0.001085669,0.4287388,0.00030109615,0.0000047442823,0.000048016165,0.015340727],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999152,0.00008917547,0.00015396971,0.00021551478,0.00022181556,0.00016753562],"domain_scores_gemma":[0.9990275,0.00041747416,0.000055464585,0.00037624498,0.00008835183,0.00003496709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006976202,0.000088666566,0.0000968283,0.000033973716,0.00019578655,0.00024139734,0.00053184386,0.000061058294,0.00001095858],"category_scores_gemma":[0.00014708273,0.0000557454,0.0000576238,0.00013988891,0.000016108044,0.000097957636,0.000026463926,0.00007777765,0.000020700754],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037948623,0.000018689801,9.740417e-7,0.0000019455151,0.000004765601,1.7061976e-7,0.000094698036,0.0065231915,0.0000055908913,0.30619594,0.68625444,0.0008957758],"study_design_scores_gemma":[0.00032748486,0.00010176231,0.0000026613914,0.000007431044,0.0000032774283,0.0000021023932,0.00003322682,0.2266691,0.0011483937,0.002030344,0.7695455,0.0001287461],"about_ca_topic_score_codex":0.000003994858,"about_ca_topic_score_gemma":5.9414464e-7,"teacher_disagreement_score":0.47693992,"about_ca_system_score_codex":0.000019833873,"about_ca_system_score_gemma":0.000041684343,"threshold_uncertainty_score":0.23278001},"labels":[],"label_agreement":null},{"id":"W2574022650","doi":"10.1090/dimacs/052/16","title":"Software implementation strategies for power-conscious systems","year":2000,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Variety (cybernetics); Software; Embedded system; Sorting; Compiler; Energy (signal processing); Power (physics); Distributed computing; Computer engineering; Algorithm; Engineering; Programming language; Artificial intelligence; Electrical engineering","score_opus":0.011154048499829294,"score_gpt":0.269717060057407,"score_spread":0.25856301155757766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574022650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008106051,0.00028776357,0.95935977,0.00014113163,0.00028749564,0.0007379662,0.000036241116,0.00029139282,0.03877719],"genre_scores_gemma":[0.043507274,0.00035712367,0.9547178,0.00015021389,0.00009452576,0.00007707471,0.000028392427,0.000056695368,0.0010109055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973673,0.00002480645,0.00070175156,0.00086851144,0.00052307313,0.00051451585],"domain_scores_gemma":[0.9983289,0.00029729377,0.00026157786,0.0007481752,0.00020414211,0.00015991076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00097155944,0.0004273308,0.0005392759,0.00034419942,0.00038692317,0.0015924594,0.0014385806,0.00016680724,0.00003551284],"category_scores_gemma":[0.00003199754,0.0003716186,0.000095127536,0.00019512212,0.0016722553,0.0007339214,0.00069524086,0.00022736676,0.0000047105364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055218898,0.000012934799,8.2366626e-7,0.00010763673,0.000009095879,0.0000064136157,0.0007309887,0.00045135853,0.0000018376176,0.9897506,0.00006597315,0.008856812],"study_design_scores_gemma":[0.00018244643,0.0002485939,0.000001920578,0.00025268676,0.000009496649,0.000047057514,0.000049113027,0.1985667,0.000026907916,0.79806954,0.0021380594,0.00040749827],"about_ca_topic_score_codex":0.0000037033851,"about_ca_topic_score_gemma":0.0000024547624,"teacher_disagreement_score":0.19811535,"about_ca_system_score_codex":0.00007129728,"about_ca_system_score_gemma":0.00021850002,"threshold_uncertainty_score":0.9998736},"labels":[],"label_agreement":null},{"id":"W2576359686","doi":"10.1109/uic-atc-scalcom-cbdcom-iop-smartworld.2016.0105","title":"Many-Thread Aware Compression in GPGPUs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Parallel computing; Cache; Thread (computing); CUDA; Data compression; Smart Cache; Graphics; CPU cache; Cache algorithms; Embedded system; Operating system; Algorithm","score_opus":0.017298526499136185,"score_gpt":0.2655595892048333,"score_spread":0.24826106270569712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576359686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002649318,0.00002620649,0.9861172,0.0012954754,0.00009412586,0.00006144564,2.5754204e-7,0.00060791144,0.009148092],"genre_scores_gemma":[0.8231648,0.000030417794,0.17434506,0.0002659084,0.000017752174,0.000006207626,3.8954786e-7,0.000004330737,0.002165112],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993074,0.00004170521,0.00014468626,0.00022848806,0.00011528357,0.00016242912],"domain_scores_gemma":[0.9994915,0.000062109175,0.000035921326,0.00033508538,0.000032984877,0.000042373053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013348235,0.00007252641,0.00008741316,0.00010200286,0.00003757029,0.000039058785,0.0005247458,0.000042085845,0.00003188738],"category_scores_gemma":[0.000013881982,0.000043774053,0.000022709924,0.00018022534,0.000016381478,0.00024006111,0.00021783548,0.000040667444,0.00006832735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001512744,0.00025189176,0.028746985,0.000017052,0.000008873062,0.000055286702,0.00038234665,0.0017010149,0.002922298,0.4421769,0.052697558,0.47102466],"study_design_scores_gemma":[0.0023330047,0.0002234626,0.039318368,0.0006272692,0.0000023440841,0.000042128297,0.00001495564,0.7947064,0.061171234,0.07367034,0.026863951,0.0010265321],"about_ca_topic_score_codex":0.000024421326,"about_ca_topic_score_gemma":0.000004743265,"teacher_disagreement_score":0.8205155,"about_ca_system_score_codex":0.00002629298,"about_ca_system_score_gemma":0.000017515431,"threshold_uncertainty_score":0.1785054},"labels":[],"label_agreement":null},{"id":"W25768723","doi":"10.1088/1741-2560/12/2/026011","title":"Adapting Operating Systems to Embedded Manycores: Scheduling and Inter-Process Communication","year":2014,"lang":"en","type":"article","venue":"Journal of Neural Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Computer science; Scheduling (production processes); Process (computing); Embedded system; Context switch; Context (archaeology); Operating system; Real-time computing; Engineering","score_opus":0.0139533838897195,"score_gpt":0.25717068258939574,"score_spread":0.24321729869967623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25768723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19088264,0.00019554787,0.8084167,0.00018573161,0.00014346933,0.000039929255,4.8221725e-8,0.00009046957,0.00004546298],"genre_scores_gemma":[0.7238377,0.000008523468,0.27602735,0.000050093946,0.00006430308,0.0000012191875,9.344117e-8,0.0000066159682,0.0000041175745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922585,0.000048294725,0.00035847272,0.000101695034,0.0001370212,0.00012867643],"domain_scores_gemma":[0.9992724,0.00012850162,0.00017204948,0.00017797908,0.000159412,0.00008967506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964862,0.0000919998,0.00016830502,0.00016700651,0.000080915175,0.0002673093,0.00049002754,0.000028974895,2.26425e-7],"category_scores_gemma":[0.00028856637,0.0000831628,0.000027805421,0.00014409517,0.0000052255195,0.00043043162,0.00014119357,0.00020966605,4.638689e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011055128,0.0000033375431,0.00006193922,0.000026498185,0.0000050514045,0.0000017541504,0.000627583,0.9929513,0.0019325336,0.0008480532,0.000010972201,0.0035299226],"study_design_scores_gemma":[0.000103443585,0.0000769109,0.000099134966,0.0003348822,0.0000025074712,0.00013122086,0.000062516854,0.99822354,0.00078936765,0.000024530584,0.00006186874,0.00009004904],"about_ca_topic_score_codex":0.0000031650677,"about_ca_topic_score_gemma":1.6011123e-7,"teacher_disagreement_score":0.53295505,"about_ca_system_score_codex":0.000021281312,"about_ca_system_score_gemma":0.000009807313,"threshold_uncertainty_score":0.33912805},"labels":[],"label_agreement":null},{"id":"W2577373033","doi":"","title":"Total-Kernel in Oriented Circular Ladder and Mobius Ladder.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Kernel (algebra); Pure mathematics","score_opus":0.008527677432932096,"score_gpt":0.23090681403188262,"score_spread":0.22237913659895053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577373033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69524735,0.0005207048,0.29685608,0.0014659867,0.0012454813,0.00033366706,0.0000020565149,0.00092913856,0.0033995695],"genre_scores_gemma":[0.9900806,0.00005763707,0.009356775,0.00013648072,0.000005360376,0.000016740558,9.0699933e-7,0.000011185995,0.00033431506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884206,0.0000821927,0.00021838944,0.00039806394,0.00018497472,0.0002743373],"domain_scores_gemma":[0.99920887,0.000102150065,0.000069374895,0.00045157666,0.00007717933,0.00009084727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025911976,0.00013985031,0.00016890005,0.0001306114,0.00007336644,0.00006762762,0.00036513252,0.000084110354,0.000010179599],"category_scores_gemma":[0.00007923489,0.00011125574,0.000032194574,0.00037844808,0.000052086536,0.00032040942,0.00027001486,0.000090201705,0.000024228888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641196,0.00014944846,0.011959829,0.000010066192,0.000021410537,0.000044487817,0.0004246624,0.00007095133,0.00090691436,0.97263324,0.0033336657,0.010438929],"study_design_scores_gemma":[0.0062106485,0.00042887818,0.05940269,0.00034074872,0.000016970836,0.00011952619,0.000044431352,0.070883006,0.010614708,0.8430262,0.00753627,0.0013759146],"about_ca_topic_score_codex":0.000029079154,"about_ca_topic_score_gemma":0.0000013551834,"teacher_disagreement_score":0.29483327,"about_ca_system_score_codex":0.000047000074,"about_ca_system_score_gemma":0.000041140313,"threshold_uncertainty_score":0.45368773},"labels":[],"label_agreement":null},{"id":"W2577467405","doi":"10.1109/les.2017.2654160","title":"Accurate Measurement of Small Execution Times—Getting Around Measurement Errors","year":2017,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Duration (music); Observational error; Simple (philosophy); Component (thermodynamics); Execution time; Reliability engineering; Real-time computing; Algorithm; Computer engineering; Statistics","score_opus":0.07152737250038309,"score_gpt":0.27652944878803576,"score_spread":0.20500207628765266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577467405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016377266,0.00016418859,0.9780389,0.0010296911,0.0020228187,0.0004893572,0.0000012571085,0.00061857165,0.0012579644],"genre_scores_gemma":[0.97699505,0.0000057234415,0.022436026,0.0002418865,0.00020417782,0.000043528413,8.89e-7,0.000027843733,0.00004488645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967295,0.00034559716,0.00071874005,0.00054945913,0.0012286174,0.00042806516],"domain_scores_gemma":[0.99657655,0.00003862879,0.0011038383,0.0015623657,0.0006062559,0.000112370246],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037336084,0.000279365,0.00040660883,0.00018100884,0.00044320032,0.0005669107,0.0017506463,0.000099787394,8.3665645e-7],"category_scores_gemma":[0.00021337057,0.00026941346,0.00014309838,0.0001301631,0.00008371578,0.0005060961,0.0001675754,0.00018352651,0.000014866186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048526068,0.00028239167,0.0009788004,0.00067213376,0.0004882945,0.000063213796,0.0035048549,0.5093782,0.42258388,0.0036189572,0.052722543,0.005658247],"study_design_scores_gemma":[0.0009365532,0.00010652715,0.00086347625,0.001136325,0.000042248717,0.000027573,0.000116308554,0.940718,0.053436417,0.00011796186,0.0016983566,0.0008002387],"about_ca_topic_score_codex":0.00029378105,"about_ca_topic_score_gemma":0.000012440783,"teacher_disagreement_score":0.9606178,"about_ca_system_score_codex":0.00031073895,"about_ca_system_score_gemma":0.00011010786,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2579372702","doi":"10.1090/dimacs/061/10","title":"Flipping: A supertree construction method","year":2003,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Supertree; Computer science; Chemistry; Biochemistry","score_opus":0.012126819843666859,"score_gpt":0.2587338422978282,"score_spread":0.24660702245416133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579372702","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021114558,0.00011459343,0.85680926,0.0004883794,0.00031116372,0.0002542343,0.000004051292,0.00021356327,0.14178362],"genre_scores_gemma":[0.0013700909,0.00020054023,0.99638134,0.00027736492,0.000050048366,0.000009689395,0.0000031593831,0.000031545907,0.0016762146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970977,0.000055389675,0.0006670677,0.0010265711,0.0006478278,0.0005054449],"domain_scores_gemma":[0.99808586,0.00026792975,0.00023819818,0.0009831913,0.00020698179,0.00021781998],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014700205,0.00047891776,0.0006329577,0.0004541133,0.00035469848,0.0007629676,0.0015014292,0.0002283674,0.000037297712],"category_scores_gemma":[0.00010765778,0.00041334247,0.00010697579,0.00033278746,0.0027925298,0.0005568583,0.0013210924,0.00044901355,0.000007441529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025849697,0.000015651436,0.000001939157,0.00006122898,0.000008861172,0.000014779323,0.00039404148,0.00010029338,0.000011073576,0.99098784,0.00003239463,0.00836932],"study_design_scores_gemma":[0.000116700285,0.00010359702,0.0000014533776,0.00023671145,0.000008784574,0.00021611773,0.000008205386,0.30033603,0.00029248136,0.69664323,0.0016372545,0.000399394],"about_ca_topic_score_codex":0.0000013003545,"about_ca_topic_score_gemma":7.6324346e-7,"teacher_disagreement_score":0.30023575,"about_ca_system_score_codex":0.00008031735,"about_ca_system_score_gemma":0.000111613095,"threshold_uncertainty_score":0.9999213},"labels":[],"label_agreement":null},{"id":"W2581712502","doi":"10.1186/s13639-016-0067-1","title":"Low-level trace correlation on heterogeneous embedded systems","year":2017,"lang":"en","type":"article","venue":"EURASIP Journal on Embedded Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tracing; Debugging; Computer science; TRACE (psycholinguistics); Synchronization (alternating current); Embedded system; Distributed computing; State (computer science); Operating system; Channel (broadcasting); Programming language; Telecommunications","score_opus":0.047552648766279584,"score_gpt":0.29806156056109745,"score_spread":0.2505089117948179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581712502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022489445,0.0004624904,0.9587856,0.00027414015,0.008455844,0.000573585,0.000009625802,0.0005862399,0.008363047],"genre_scores_gemma":[0.99204636,0.000062214975,0.004528291,0.00013950473,0.0008966931,0.000023389215,0.0000036031104,0.000050807546,0.0022491391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956258,0.0009467248,0.0010432798,0.0006674989,0.0011127593,0.00060394726],"domain_scores_gemma":[0.9953021,0.00033167726,0.0017373895,0.0018194221,0.00042959134,0.00037981555],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002436987,0.00045520856,0.0006062343,0.00038217503,0.001683184,0.0034790814,0.0024547,0.00025503396,0.0000071459544],"category_scores_gemma":[0.00046427385,0.00038788596,0.00024829095,0.00017846277,0.00006403892,0.0008172895,0.00015563279,0.0007773685,0.0003103469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008998556,0.00029469535,0.00025804716,0.0000813948,0.000106479776,0.00050472014,0.0012345718,0.9643105,0.00037299388,0.012121779,0.012428822,0.008195955],"study_design_scores_gemma":[0.00095040374,0.00058576,0.00044672308,0.0008647392,0.000015807589,0.0017244396,0.00009450384,0.9909338,0.0011091357,0.00019818007,0.0024914,0.0005851323],"about_ca_topic_score_codex":0.000019334377,"about_ca_topic_score_gemma":9.404505e-7,"teacher_disagreement_score":0.9695569,"about_ca_system_score_codex":0.0002480001,"about_ca_system_score_gemma":0.00012942847,"threshold_uncertainty_score":0.9998573},"labels":[],"label_agreement":null},{"id":"W2586960021","doi":"10.1109/trustcom.2016.0237","title":"Locality Protected Dynamic Cache Allocation Scheme on GPUs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache pollution; Cache algorithms; Locality; Cache coloring; Speedup; CPU cache; Page cache; Efficient energy use; Operating system; Embedded system","score_opus":0.015469615442777114,"score_gpt":0.26268012267407914,"score_spread":0.24721050723130203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586960021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055617536,0.000006406359,0.9868088,0.0028212275,0.00005657145,0.00024270377,4.0851856e-7,0.0013431746,0.0031589973],"genre_scores_gemma":[0.77537495,0.000004565133,0.22285138,0.0003040229,0.00001140796,0.00003536522,0.0000010632459,0.0000050262647,0.0014122305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991157,0.000074292046,0.00015558879,0.00031298038,0.00017421269,0.00016723345],"domain_scores_gemma":[0.99922025,0.0000512832,0.000061340084,0.0005103457,0.00010342366,0.00005338444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022269045,0.00009722501,0.00008149717,0.00007355747,0.000075669246,0.000054001037,0.00048455232,0.00006154246,0.000018801715],"category_scores_gemma":[0.00006369397,0.000061467596,0.0000299678,0.00024785826,0.000028271326,0.0001862549,0.00010370149,0.00006073652,0.00012299938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048613878,0.00045289082,0.00074441626,0.00003060631,0.000037803828,0.000007847662,0.00023541883,0.0015602688,0.022657529,0.2747363,0.007999891,0.69148844],"study_design_scores_gemma":[0.00045297714,0.00023662431,0.0037241024,0.000073650735,0.0000013384564,0.0000062274494,0.0000021818175,0.9430908,0.042977083,0.0072272196,0.001887822,0.0003199724],"about_ca_topic_score_codex":0.000014944591,"about_ca_topic_score_gemma":0.0000036691788,"teacher_disagreement_score":0.9415305,"about_ca_system_score_codex":0.00007664525,"about_ca_system_score_gemma":0.00004295795,"threshold_uncertainty_score":0.2506576},"labels":[],"label_agreement":null},{"id":"W2588449239","doi":"10.1145/3038228.3038236","title":"Launch-Time Optimization of OpenCL GPU Kernels","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Qualcomm","keywords":"Kernel (algebra); Computer science; Compiler; Constant (computer programming); Loop unrolling; Parallel computing; Computational science; Reduction (mathematics); CUDA; General-purpose computing on graphics processing units; Computer graphics (images); Operating system; Programming language; Geometry; Graphics; Mathematics","score_opus":0.020624229307307132,"score_gpt":0.2772195945092754,"score_spread":0.2565953652019683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588449239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002919495,0.0000143034495,0.9191442,0.00050650985,0.00007679267,0.000088591965,6.333453e-7,0.0002853131,0.07959169],"genre_scores_gemma":[0.2283887,0.000018965735,0.76642007,0.00010340647,0.000019974797,0.0000030593587,0.0000015874227,0.000005324899,0.005038896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927187,0.000029752173,0.0001948742,0.00021828667,0.00015765123,0.00012756106],"domain_scores_gemma":[0.99860764,0.000027707647,0.00022511843,0.0009535398,0.00014071955,0.00004528436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026731286,0.00008186818,0.0001380199,0.00006067852,0.00022892225,0.0002518448,0.0015660344,0.000048160953,0.000109798064],"category_scores_gemma":[0.00009234499,0.00007254155,0.00004199943,0.000072776566,0.00005074534,0.0006038835,0.0004798021,0.000043668344,0.000040509833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009990707,0.00019143953,0.0016232113,0.000028686392,0.000038748378,0.000008041502,0.00042059156,0.810529,0.00097125163,0.12769845,0.024675366,0.033805214],"study_design_scores_gemma":[0.00014158025,0.000036144593,0.0004893911,0.000015773325,0.0000015802824,0.0000026445537,0.0000010350387,0.9888855,0.008341808,0.0012797765,0.000700471,0.000104270526],"about_ca_topic_score_codex":0.000045634864,"about_ca_topic_score_gemma":5.6819874e-7,"teacher_disagreement_score":0.22809675,"about_ca_system_score_codex":0.000010430793,"about_ca_system_score_gemma":0.00003741914,"threshold_uncertainty_score":0.29581586},"labels":[],"label_agreement":null},{"id":"W2588724429","doi":"10.1109/isco.2017.7855984","title":"Cache coherency controller verification IP using SystemVerilog Assertions (SVA) and Universal Verification Methodologies (UVM)","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Functional verification; High-level verification; Intelligent verification; Verification; Software verification; Formal verification; Synchronization (alternating current); Runtime verification; Embedded system; Model checking; Computer architecture; Programming language; Software; Software development; Software construction","score_opus":0.1311944689048662,"score_gpt":0.3574867611536323,"score_spread":0.22629229224876612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588724429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010941243,0.00010317852,0.9831921,0.00056362175,0.00018423988,0.00024885248,0.0000014377074,0.00051776046,0.0042476044],"genre_scores_gemma":[0.62175727,0.000038268925,0.37785697,0.000034337823,0.000020537855,0.000008278742,0.0000020708117,0.000004806574,0.00027743808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883634,0.00023972635,0.00022675989,0.00038287262,0.00014093013,0.0001733834],"domain_scores_gemma":[0.99853283,0.00013344905,0.0003050832,0.0007819846,0.00018679239,0.000059845814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006740949,0.00013249952,0.00020112806,0.000100019846,0.0008141902,0.0005053719,0.0007426843,0.00010741201,0.000005021714],"category_scores_gemma":[0.00027278456,0.000121073244,0.000040821,0.00009657792,0.000098955396,0.00076740095,0.00020047634,0.00009459561,0.000006835842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093476054,0.00018620987,0.010356581,0.0001252013,0.00022150118,0.000009763054,0.0018463318,0.015150916,0.062782496,0.83826077,0.002869391,0.06809736],"study_design_scores_gemma":[0.00051829213,0.000060480485,0.02543748,0.000037943224,0.000025590325,0.000014154655,0.00011469038,0.96416044,0.005422902,0.0032238958,0.00071088166,0.00027325537],"about_ca_topic_score_codex":0.00025497624,"about_ca_topic_score_gemma":0.000006701707,"teacher_disagreement_score":0.94900954,"about_ca_system_score_codex":0.00006344577,"about_ca_system_score_gemma":0.00006303248,"threshold_uncertainty_score":0.6262175},"labels":[],"label_agreement":null},{"id":"W2590119245","doi":"10.23977/cpcs.2016.11006","title":"A Survey of Power Consumption Modeling for GPU Architecture","year":2016,"lang":"en","type":"article","venue":"Computing Performance and Communication systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Power consumption; Power demand; Power (physics); CUDA; General-purpose computing on graphics processing units; Consumption (sociology); Architecture; Dynamic demand; Supercomputer; Work (physics); Parallel computing; Computer architecture; Graphics; Computer graphics (images)","score_opus":0.05327753374932209,"score_gpt":0.29031427077934874,"score_spread":0.23703673703002665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590119245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23547645,0.00082765997,0.7630927,0.00008511367,0.00007187948,0.00019378136,0.0000029374526,0.0001474243,0.00010203809],"genre_scores_gemma":[0.9548804,0.0003196434,0.044702653,0.000025172181,0.000009748326,0.000013230126,0.0000061027217,0.000007630652,0.00003537483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989291,0.00018684923,0.00039657587,0.00020915811,0.000121802506,0.000156518],"domain_scores_gemma":[0.9982792,0.00040161295,0.0002469403,0.00070095033,0.00033235742,0.00003891038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012476197,0.00010852752,0.00020234475,0.00011433747,0.00022459448,0.00007091615,0.00066423364,0.000061802355,4.470703e-7],"category_scores_gemma":[0.000059813923,0.00008074556,0.00002952417,0.00015646633,0.000053767053,0.00019426901,0.0002569138,0.00006478764,0.0000019794938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013772644,0.00021082716,0.123660095,0.00073313684,0.00014235821,2.6524592e-7,0.005528228,0.41694862,0.0011345401,0.042561665,0.0015519289,0.40739062],"study_design_scores_gemma":[0.00031043848,0.00006401006,0.0067830835,0.00036729098,0.0000021609596,0.0000065461404,0.000007990103,0.991883,0.00012439585,0.00009678796,0.00023204487,0.00012224646],"about_ca_topic_score_codex":0.00003909667,"about_ca_topic_score_gemma":0.0000023934574,"teacher_disagreement_score":0.719404,"about_ca_system_score_codex":0.000019014964,"about_ca_system_score_gemma":0.00003203685,"threshold_uncertainty_score":0.3292708},"labels":[],"label_agreement":null},{"id":"W2591619740","doi":"10.1049/iet-cds.2016.0383","title":"MIPSfpga: using a commercial MIPS soft‐core in computer architecture education","year":2017,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Computer science; Debugging; Embedded system; Field-programmable gate array; Computer architecture; Instruction set; Microarchitecture; Software; Cache; Architecture; Interface (matter); Set (abstract data type); Operating system; Computer hardware; Programming language","score_opus":0.04838714251184928,"score_gpt":0.31017044400679744,"score_spread":0.26178330149494816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591619740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077936,0.00071129116,0.9167037,0.00028399905,0.002341588,0.00049053656,0.0000051535426,0.00036151512,0.0011662318],"genre_scores_gemma":[0.97324735,0.000009580904,0.025521984,0.00040209753,0.00068258785,0.000029569168,0.000009963389,0.000021822141,0.000075043434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805284,0.00013543601,0.0004938245,0.0005816315,0.00033221522,0.00040406323],"domain_scores_gemma":[0.9978219,0.00008415042,0.00053238356,0.0012521327,0.00018756672,0.00012181982],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005401869,0.00026118458,0.000385394,0.00026770442,0.0005583201,0.0010273132,0.0019957565,0.00016384131,0.000001887993],"category_scores_gemma":[0.000041175274,0.00025640486,0.00007761056,0.000265647,0.000066762004,0.0005700848,0.00033029632,0.00027858524,0.000018606095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010129708,0.00056238374,0.122617505,0.00069488003,0.00008862751,0.000066859066,0.0065479516,0.15865272,0.0003478724,0.015972441,0.005759082,0.6886795],"study_design_scores_gemma":[0.0004501061,0.00006408516,0.02552794,0.0009919226,0.000013259767,0.00017694924,0.00003948083,0.9609194,0.00006793178,0.0009966252,0.010138814,0.00061349844],"about_ca_topic_score_codex":0.0010236155,"about_ca_topic_score_gemma":0.00017252483,"teacher_disagreement_score":0.89531136,"about_ca_system_score_codex":0.00011681114,"about_ca_system_score_gemma":0.0002917409,"threshold_uncertainty_score":0.9999888},"labels":[],"label_agreement":null},{"id":"W2593518447","doi":"10.1007/978-3-319-54999-6_7","title":"A New Approach to Detecting Execution Phases Using Performance Monitoring Counters","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Real-time computing","score_opus":0.04579662572942246,"score_gpt":0.2934768732068506,"score_spread":0.24768024747742817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593518447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003731213,0.00015553908,0.992222,0.000063652275,0.0015043112,0.0003797228,8.689437e-7,0.00041038642,0.004890372],"genre_scores_gemma":[0.16214043,0.000026383796,0.8366586,0.00015842794,0.0005951574,0.000004662081,0.0000010416444,0.000027808454,0.0003874603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654406,0.000024352525,0.00045600868,0.0014865296,0.0008317965,0.0006572474],"domain_scores_gemma":[0.9974094,0.00013536056,0.00042040707,0.0015471862,0.00024107451,0.00024658238],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088402827,0.0005007556,0.00046437993,0.0009211843,0.0008276295,0.001270674,0.0037816039,0.00024668145,0.0000025020784],"category_scores_gemma":[0.000119087534,0.00050741294,0.00010190065,0.0003535395,0.00018935242,0.0009757581,0.0013520805,0.0006147543,0.00001181784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051136203,0.000011859926,0.00008098292,0.000025322275,0.00000629292,0.000008039248,0.0006788291,0.4649739,0.00021346803,0.00031560147,0.00001832052,0.53366226],"study_design_scores_gemma":[0.0001636963,0.00009415816,0.000042507127,0.0008582946,0.000006909047,0.00008210083,2.2491412e-7,0.98839426,0.0064767543,0.00290666,0.00035676057,0.00061768485],"about_ca_topic_score_codex":0.000075937256,"about_ca_topic_score_gemma":0.0000035886255,"teacher_disagreement_score":0.5330446,"about_ca_system_score_codex":0.0004965588,"about_ca_system_score_gemma":0.00060902385,"threshold_uncertainty_score":0.9997661},"labels":[],"label_agreement":null},{"id":"W2603574511","doi":"10.1109/vlsid.2017.4","title":"Towards a Better Lifetime for Non-volatile Caches in Chip Multiprocessors","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache; Static random-access memory; Parallel computing; CPU cache; Non-volatile memory; Embedded system; Multi-core processor; Set (abstract data type); Computer hardware","score_opus":0.025262849889757792,"score_gpt":0.29428628701208165,"score_spread":0.26902343712232385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603574511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02065488,0.0000112578755,0.9663829,0.002285481,0.000094041316,0.0002303256,0.0000010715263,0.00025510468,0.010084893],"genre_scores_gemma":[0.5639252,0.0000023281223,0.43509477,0.00034343806,0.0000385233,0.000034637855,0.0000010862348,0.000005472748,0.00055452203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991712,0.000013085552,0.00017865386,0.00030318045,0.00010850267,0.00022540399],"domain_scores_gemma":[0.9991329,0.000045563138,0.000107261025,0.000599833,0.000063567124,0.000050907718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028256798,0.00011020911,0.00014944897,0.00009241613,0.00023415107,0.00031958343,0.0011989684,0.00006651094,0.0000064914248],"category_scores_gemma":[0.00012443749,0.00009540701,0.00005070142,0.00006680399,0.000032442502,0.0004277276,0.0002570143,0.000075085496,0.000011105007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010623193,0.00085131056,0.13307938,0.00031977345,0.0000993048,0.00003639539,0.009717787,0.012940929,0.0014869742,0.027507192,0.059749253,0.75410545],"study_design_scores_gemma":[0.0004280387,0.00004488227,0.020420942,0.00002690757,0.000001310823,0.0000012318106,0.0000034941334,0.9674268,0.006644574,0.0036684712,0.0011576271,0.00017577095],"about_ca_topic_score_codex":0.00016495846,"about_ca_topic_score_gemma":0.000027750995,"teacher_disagreement_score":0.95448583,"about_ca_system_score_codex":0.000018294377,"about_ca_system_score_gemma":0.000057024645,"threshold_uncertainty_score":0.3890585},"labels":[],"label_agreement":null},{"id":"W2604203831","doi":"10.1038/ncomms15181","title":"Membraneless water filtration using CO2","year":2017,"lang":"en","type":"article","venue":"Nature Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Filtration (mathematics); Materials science; Pulp and paper industry; Chemical engineering; Chemistry; Chromatography; Mathematics; Statistics; Engineering","score_opus":0.04908482453233862,"score_gpt":0.34013063677959443,"score_spread":0.2910458122472558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604203831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006636929,0.00060445594,0.9630558,0.010082703,0.00036442408,0.00020691798,0.000003608604,0.0006187772,0.018426415],"genre_scores_gemma":[0.7107045,0.00007567085,0.28883925,0.00022588421,0.000025138414,0.0000063330863,0.000013755625,0.0000050980775,0.000104373954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929726,0.00009029249,0.00015288612,0.00017830261,0.00013125378,0.0001500234],"domain_scores_gemma":[0.99548775,0.000055866065,0.000119068194,0.0041153347,0.00018060645,0.000041367937],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0002816442,0.00008847765,0.00009703686,0.00006814162,0.0016388936,0.00052141835,0.0045342906,0.00016251905,0.000004610336],"category_scores_gemma":[0.00008742749,0.00007258208,0.000044115885,0.000064467036,0.000094998504,0.0006116138,0.0010570684,0.00042557679,0.000016065023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009593035,0.00043073538,0.0039770375,0.00003157339,0.00009570328,0.000006937159,0.0026131202,0.009279128,0.030761112,0.9171509,0.013601933,0.022042232],"study_design_scores_gemma":[0.00021224361,0.000014974442,0.0022641844,0.000032467502,0.000009962621,0.00001783918,0.000008543356,0.92960125,0.030246608,0.0044209445,0.032901745,0.0002692608],"about_ca_topic_score_codex":0.000030357623,"about_ca_topic_score_gemma":0.000033006683,"teacher_disagreement_score":0.9203221,"about_ca_system_score_codex":0.000028902188,"about_ca_system_score_gemma":0.00003510523,"threshold_uncertainty_score":0.99966085},"labels":[],"label_agreement":null},{"id":"W2604804981","doi":"10.1145/3132709","title":"Faster Base64 Encoding and Decoding Using AVX2 Instructions","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on the Web","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université TÉLUQ","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Encoding (memory); Software; XML; Code (set theory)","score_opus":0.042473060209782615,"score_gpt":0.27627207418699296,"score_spread":0.23379901397721034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604804981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038387798,0.000014725732,0.9582005,0.0015125772,0.00032514826,0.00008946524,0.0000018411997,0.0002993576,0.0011685456],"genre_scores_gemma":[0.7249561,0.000026445252,0.27446657,0.00037743666,0.000047814796,0.000005374333,1.4776509e-7,0.0000066471875,0.000113479386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924463,0.000073773204,0.00014856645,0.00024210277,0.00011791091,0.000173025],"domain_scores_gemma":[0.9990902,0.00016876323,0.000050447,0.00057721906,0.00006379625,0.000049580245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023439397,0.000105655694,0.00008347349,0.00015137064,0.0008593782,0.00017159336,0.0005388737,0.00004612898,0.00004406031],"category_scores_gemma":[0.000031953492,0.00008257283,0.0000419319,0.00037836694,0.00010630662,0.00029203726,0.00003147732,0.00015148082,0.000018050749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006804918,0.00043245894,0.0010014636,0.000058821006,0.000337338,0.000015923919,0.01153097,0.039558463,0.04135401,0.08015492,0.0031042665,0.8223833],"study_design_scores_gemma":[0.00020072472,0.000085470616,0.00008102737,0.00006396224,0.000016890966,0.000091525435,0.000095469375,0.97134244,0.020155266,0.005626788,0.002022081,0.00021834894],"about_ca_topic_score_codex":0.000014467579,"about_ca_topic_score_gemma":0.000010416342,"teacher_disagreement_score":0.931784,"about_ca_system_score_codex":0.000030586,"about_ca_system_score_gemma":0.000036651443,"threshold_uncertainty_score":0.6609729},"labels":[],"label_agreement":null},{"id":"W2608938540","doi":"10.1109/pdp.2017.42","title":"Parallelizing Soft-Synths with Soft Real-Time Requirements","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Modular design; Rendering (computer graphics); Multi-core processor; Digital audio; Software; Computer architecture; Digital signal processing; Embedded system; Operating system; Computer hardware; Audio signal; Computer graphics (images)","score_opus":0.029570343344788967,"score_gpt":0.28755082964459966,"score_spread":0.2579804862998107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608938540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014518098,0.000010989786,0.88432956,0.0008811496,0.00007473147,0.00012293096,3.3267693e-7,0.0011060906,0.112022415],"genre_scores_gemma":[0.31584692,0.000031726428,0.67743975,0.00029165647,0.0000536732,0.000013455373,0.0000019287959,0.000014879636,0.006306005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869776,0.000037483533,0.00020306728,0.0004374121,0.00029808158,0.000326206],"domain_scores_gemma":[0.9981379,0.00004391229,0.00022213867,0.0013775019,0.00011430759,0.00010427369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032741655,0.0001653101,0.00018136707,0.00006880751,0.0007395217,0.000706624,0.0017316043,0.000057974816,0.000041662217],"category_scores_gemma":[0.000059851358,0.00012991045,0.00004304178,0.000075719574,0.0000769837,0.00085359375,0.0004905529,0.00008259823,0.00014029145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016965996,0.00082364964,0.027193656,0.000120366094,0.00041825304,0.00036209682,0.002876782,0.022120453,0.0076458408,0.30186376,0.1633766,0.4730289],"study_design_scores_gemma":[0.0009840364,0.00032866764,0.0048309406,0.00014619509,0.000014980534,0.000036042955,0.0000141601,0.9713441,0.0062403968,0.007850713,0.007318974,0.00089075416],"about_ca_topic_score_codex":0.00012236988,"about_ca_topic_score_gemma":0.0000064045203,"teacher_disagreement_score":0.9492237,"about_ca_system_score_codex":0.000029042209,"about_ca_system_score_gemma":0.00006471101,"threshold_uncertainty_score":0.68139917},"labels":[],"label_agreement":null},{"id":"W2611998574","doi":"10.1109/hpca.2017.14","title":"Controlled Kernel Launch for Dynamic Parallelism in GPUs","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Parallel computing; Speedup; Spawn (biology); Kernel (algebra); Latency (audio)","score_opus":0.017627228478104925,"score_gpt":0.29992137732106866,"score_spread":0.2822941488429637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611998574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002774218,0.0000629562,0.98153675,0.0022142236,0.0002002243,0.0004558823,7.654769e-7,0.00032678322,0.012428181],"genre_scores_gemma":[0.6946882,0.000023473283,0.30009302,0.00027133245,0.000018187044,0.000079101854,0.0000012828564,0.000005658601,0.0048197517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910027,0.000029455672,0.00023162065,0.0002959037,0.00010637951,0.00023638415],"domain_scores_gemma":[0.9988634,0.00010917204,0.00014582118,0.0007604735,0.000074740776,0.000046416742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043435986,0.0001081519,0.0002466171,0.00008716938,0.00024105028,0.00036055938,0.0012820119,0.00006499635,0.000006573545],"category_scores_gemma":[0.00018386866,0.00009018994,0.00008271359,0.000045713525,0.000029772958,0.0002965277,0.00020464174,0.00006873832,0.000011748927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038191912,0.00054743706,0.0057811523,0.000071671886,0.000099148485,0.000044583616,0.0010454525,0.025896814,0.0004614364,0.81915027,0.02505141,0.121468715],"study_design_scores_gemma":[0.0032092622,0.000042773707,0.0027986255,0.000012275665,0.0000015640333,0.0000021825879,0.000002556849,0.9718749,0.00012717141,0.020026088,0.001762487,0.000140093],"about_ca_topic_score_codex":0.000068080735,"about_ca_topic_score_gemma":0.00005862166,"teacher_disagreement_score":0.9459781,"about_ca_system_score_codex":0.000028706736,"about_ca_system_score_gemma":0.000041768133,"threshold_uncertainty_score":0.3677839},"labels":[],"label_agreement":null},{"id":"W2612343211","doi":"10.23919/date.2017.7927041","title":"Performance impacts and limitations of hardware memory access trace collection","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Computer science; Memory bandwidth; Multi-core processor; Embedded system; Field-programmable gate array; Data collection; Software; TRACE (psycholinguistics); Computer hardware; Computer architecture; Operating system","score_opus":0.06952394000822558,"score_gpt":0.31089517203506695,"score_spread":0.24137123202684135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612343211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119602144,0.00006935234,0.8289217,0.0010755763,0.00012237944,0.00012795255,4.5580154e-7,0.0002520516,0.049828395],"genre_scores_gemma":[0.9302859,0.00039619018,0.068110235,0.000037452002,0.000010239622,0.0000039653855,3.455172e-7,0.0000025521774,0.0011531491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995674,0.000015999312,0.000110050394,0.0001344764,0.00008744664,0.00008462381],"domain_scores_gemma":[0.99928886,0.00006414388,0.00013414245,0.0003642287,0.00010971387,0.000038911036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014279714,0.000054498443,0.00007954112,0.000070616356,0.0003986019,0.0002731692,0.000554604,0.000029256222,0.0000021233434],"category_scores_gemma":[0.00015212595,0.000048714173,0.000016768126,0.00008456574,0.00004356457,0.0010191189,0.00019122969,0.00004154191,0.0000012872085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058596597,0.00038309096,0.08014697,0.0003786997,0.00010045864,0.0000068601666,0.0067318883,0.02934833,0.0024999527,0.023018228,0.05696368,0.80036324],"study_design_scores_gemma":[0.0002327249,0.000094509705,0.18652314,0.000041107414,0.0000037573398,0.000008733541,0.000013080347,0.789851,0.022282634,0.00031315428,0.000517622,0.00011850547],"about_ca_topic_score_codex":0.000034159068,"about_ca_topic_score_gemma":0.000017125618,"teacher_disagreement_score":0.8106837,"about_ca_system_score_codex":0.00000951755,"about_ca_system_score_gemma":0.000040163428,"threshold_uncertainty_score":0.30657637},"labels":[],"label_agreement":null},{"id":"W2612780647","doi":"10.1145/3078155.3078176","title":"Enabling FPGAs as a True Device in the OpenCL Standard","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Embedded system; Computer architecture; Computational science","score_opus":0.03746799573217468,"score_gpt":0.3302801688730575,"score_spread":0.2928121731408828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612780647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072796172,0.00004842189,0.872527,0.00449803,0.00008309403,0.00014526655,2.2215472e-7,0.0002010334,0.11521732],"genre_scores_gemma":[0.8415701,0.000026223373,0.1564612,0.0014248593,0.000028280514,0.000009353501,2.9112522e-7,0.0000034160253,0.00047628535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991934,0.00007230814,0.00014202745,0.00021767642,0.00020329037,0.0001713322],"domain_scores_gemma":[0.9988132,0.00007684739,0.000084241336,0.000942392,0.00005496605,0.000028329523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087644183,0.000075997115,0.00009573748,0.00005673476,0.00043115823,0.0009925193,0.0025043443,0.00003359275,0.000014374143],"category_scores_gemma":[0.0001782091,0.000049839175,0.000027830436,0.000115296025,0.000029922372,0.00047337913,0.00037203284,0.00011146856,0.00003176222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003075832,0.00014708661,0.004296559,0.000023944072,0.000020884818,0.00016025286,0.009427929,0.008966044,0.00013410205,0.744049,0.01696599,0.21577744],"study_design_scores_gemma":[0.0017423269,0.00044596568,0.008595511,0.00020816152,0.000008737512,0.00012123449,0.00055488106,0.7335932,0.014423704,0.0904976,0.14884205,0.00096660317],"about_ca_topic_score_codex":0.00028316156,"about_ca_topic_score_gemma":0.000061662045,"teacher_disagreement_score":0.8342905,"about_ca_system_score_codex":0.000018508113,"about_ca_system_score_gemma":0.00006711496,"threshold_uncertainty_score":0.95708865},"labels":[],"label_agreement":null},{"id":"W2613380095","doi":"10.1109/hpca.2017.40","title":"Efficient Sequential Consistency in GPUs via Relativistic Cache Coherence","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Consistency model; Parallel computing; Cache coherence; Sequential consistency; Thread (computing); Cache; CPU cache; Operating system; Data consistency","score_opus":0.031087932304830528,"score_gpt":0.2872818674615345,"score_spread":0.25619393515670397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613380095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008517011,0.00002892,0.93528944,0.0004156077,0.0002165325,0.00013018739,3.2948387e-7,0.00028429323,0.055117697],"genre_scores_gemma":[0.8668155,0.0000016896345,0.13198636,0.000076375065,0.000013930717,0.0000074541854,5.168185e-7,0.000003824612,0.0010943209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989956,0.00006670728,0.00022490889,0.00032644277,0.00017051375,0.00021585358],"domain_scores_gemma":[0.99881107,0.000066571694,0.00014650135,0.0008488068,0.00006835359,0.000058676513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035751838,0.000106367115,0.00013947078,0.00008142155,0.00031609024,0.00026438883,0.0010337834,0.000056757006,0.00001827115],"category_scores_gemma":[0.00016054162,0.00009560827,0.0000365594,0.00010080558,0.000101889156,0.00011299559,0.00036669755,0.0001337231,0.000051987514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027682667,0.0007198124,0.027808031,0.000063087806,0.000046331526,0.00036728778,0.0025840285,0.22184563,0.0015871839,0.64696765,0.0036464664,0.09433682],"study_design_scores_gemma":[0.00023413572,0.000033353794,0.008556543,0.00002878808,0.0000018769434,0.000013645947,0.0000026139123,0.9835753,0.000943712,0.0063634743,0.00008684114,0.00015975052],"about_ca_topic_score_codex":0.00021140778,"about_ca_topic_score_gemma":0.000028339946,"teacher_disagreement_score":0.8582985,"about_ca_system_score_codex":0.000045107023,"about_ca_system_score_gemma":0.00007541883,"threshold_uncertainty_score":0.38987923},"labels":[],"label_agreement":null},{"id":"W2613993827","doi":"10.1109/hpca.2017.59","title":"Needle: Leveraging Program Analysis to Analyze and Extract Accelerators from Whole Programs","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Dataflow; Control flow; Compiler; Hardware acceleration; Efficient energy use; Software; Workload; Embedded system; Parallel computing; Operating system; Programming language","score_opus":0.0339433189252699,"score_gpt":0.31183905797400924,"score_spread":0.2778957390487393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613993827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121829286,0.000043130894,0.87304366,0.00089910964,0.000058583886,0.00026151043,0.0000010569379,0.0009513928,0.002912261],"genre_scores_gemma":[0.588446,0.00000492583,0.4111141,0.00013897869,0.000026894033,0.000022608117,0.000005739569,0.0000048051247,0.0002359342],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987004,0.00003668487,0.00022266539,0.0005507259,0.00021337063,0.00027618808],"domain_scores_gemma":[0.99846,0.000028952316,0.00014744623,0.0010655513,0.00010181465,0.00019622518],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00025393922,0.00016098934,0.00024487497,0.00024069606,0.0005192282,0.002028709,0.0011864158,0.000058423833,0.000009741994],"category_scores_gemma":[0.000041815398,0.00014060871,0.00008955502,0.0005674485,0.000041659878,0.0006389832,0.0005490848,0.00010097742,0.000012950137],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033467436,0.0001646577,0.097423255,0.0000031086283,0.00029656274,0.000014928979,0.00067697203,0.0013916583,0.00010975088,0.00079646806,0.00095135893,0.8981679],"study_design_scores_gemma":[0.00018790504,0.000108542066,0.15409695,0.000017047409,0.00008363339,0.000001911007,0.000033431254,0.8386369,0.0007819172,0.0007873462,0.0048854514,0.0003789853],"about_ca_topic_score_codex":0.00077215786,"about_ca_topic_score_gemma":0.00007946781,"teacher_disagreement_score":0.89778894,"about_ca_system_score_codex":0.000019072982,"about_ca_system_score_gemma":0.000025504156,"threshold_uncertainty_score":0.9990073},"labels":[],"label_agreement":null},{"id":"W2614533249","doi":"10.1109/fpt.2016.7929181","title":"High density, low energy, magnetic tunnel junction based block RAMs for memory-rich FPGAs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Static random-access memory; Field-programmable gate array; Scalability; Computer science; Tunnel magnetoresistance; Embedded system; Block (permutation group theory); Magnetoresistive random-access memory; Non-volatile memory; Logic block; Computer hardware; Parallel computing; Materials science; Random access memory; Nanotechnology","score_opus":0.010074218046149677,"score_gpt":0.212886421227361,"score_spread":0.20281220318121135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614533249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036691392,0.000027669159,0.99149704,0.0022576158,0.00046112455,0.00016042979,9.0752354e-7,0.0010900052,0.00083604],"genre_scores_gemma":[0.6251911,0.0000126320665,0.36722693,0.0012485052,0.00009872971,0.00003523281,0.0000027595866,0.000013139109,0.006170954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875057,0.00006164286,0.00023520812,0.00044779084,0.00021010949,0.0002946646],"domain_scores_gemma":[0.9988607,0.00018829161,0.000086787615,0.0005346594,0.00023440029,0.00009512158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025660967,0.00016491266,0.00016725888,0.00014141841,0.00015131963,0.00011443222,0.00056285853,0.000093390976,0.000038563616],"category_scores_gemma":[0.000056299265,0.000115602175,0.00007901147,0.00026747936,0.00003608506,0.0001979652,0.00015510016,0.00003833569,0.000029081051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108054635,0.00062649604,0.00035866725,0.00007163387,0.00005082785,0.000016740723,0.00011890798,0.042204272,0.0143545065,0.122893944,0.1904865,0.62870944],"study_design_scores_gemma":[0.0015335925,0.0004805887,0.0005456304,0.00005183651,0.00001421539,0.000014300881,0.0000025176846,0.82533467,0.15644343,0.010524696,0.004576006,0.00047849133],"about_ca_topic_score_codex":0.00010842621,"about_ca_topic_score_gemma":0.000030877396,"teacher_disagreement_score":0.7831304,"about_ca_system_score_codex":0.00005090403,"about_ca_system_score_gemma":0.0000650426,"threshold_uncertainty_score":0.471412},"labels":[],"label_agreement":null},{"id":"W2614852291","doi":"","title":"A Hybrid Analytical DRAM Performance Model","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dram; Computer science; Bottleneck; CAS latency; Scheduling (production processes); Parallel computing; Dynamic random-access memory; Locality; Universal memory; Embedded system; Interleaved memory; Computer memory; Computer hardware; Semiconductor memory; Memory controller; Engineering","score_opus":0.04405270949363638,"score_gpt":0.2522056146393756,"score_spread":0.2081529051457392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614852291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063579963,0.0000064952524,0.857781,0.00005663544,0.000027078302,0.000034080014,9.702554e-8,0.0006758057,0.13506085],"genre_scores_gemma":[0.5554389,0.0000054417246,0.44322416,0.00023257469,0.0000054891343,0.0000020231234,2.0896948e-7,0.0000022066072,0.0010890289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993961,0.000011620198,0.000121205885,0.00019776692,0.00011072232,0.00016259434],"domain_scores_gemma":[0.9995087,0.00000830149,0.000025191908,0.0003444399,0.000050676255,0.00006270974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012838999,0.000070186026,0.00007531572,0.00006503927,0.00006323072,0.000040606767,0.0005654626,0.000020253405,0.00002529608],"category_scores_gemma":[0.000007990531,0.00005870349,0.00003168312,0.00011673973,0.000022979597,0.00027190996,0.00016500773,0.00006381309,0.000060953218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007943261,0.00017559603,0.0012493776,0.000010108807,0.000015148515,0.000010296058,0.0006580027,0.039659403,0.000010583387,0.8999337,0.01502661,0.04324324],"study_design_scores_gemma":[0.000048960097,0.000035461067,0.00023122125,0.0000032360745,0.0000011762068,0.000008604312,5.7936046e-7,0.9918084,0.002836348,0.0048130723,0.00012173542,0.00009121237],"about_ca_topic_score_codex":0.000006028022,"about_ca_topic_score_gemma":1.2684208e-7,"teacher_disagreement_score":0.952149,"about_ca_system_score_codex":0.00001060139,"about_ca_system_score_gemma":0.000033110173,"threshold_uncertainty_score":0.23938589},"labels":[],"label_agreement":null},{"id":"W2615460309","doi":"10.1504/ijhpcn.2017.10005140","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Computer hardware; Context (archaeology); Operating system; Transfer (computing)","score_opus":0.033200928290987794,"score_gpt":0.31594436080182037,"score_spread":0.28274343251083256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615460309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5159402,0.00023532906,0.4810774,0.00037456816,0.0021035536,0.00004625163,7.658282e-7,0.000101283455,0.000120683275],"genre_scores_gemma":[0.8504056,0.00016597287,0.14658676,0.0004220692,0.0023829436,4.5622028e-7,0.0000044538065,0.000017784876,0.000013965529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977335,0.00011932082,0.0007581587,0.0003668087,0.00064704876,0.00037519983],"domain_scores_gemma":[0.9972135,0.00009414852,0.0013489963,0.00045130448,0.00071905524,0.00017300388],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012937111,0.00025732783,0.00037790523,0.0002775939,0.0010848691,0.001931335,0.002461592,0.00009838554,0.0000024583628],"category_scores_gemma":[0.000051307572,0.0002406065,0.00010416993,0.00010777162,0.000104928,0.0013163547,0.00063006143,0.00043939624,0.0000013273115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055078446,0.00007893518,0.014194088,0.000016069496,0.00007494219,0.00009533857,0.00046123055,0.15018535,0.00009839571,0.0007903374,0.00022685122,0.83372337],"study_design_scores_gemma":[0.0008574692,0.00021471166,0.021143332,0.00056983484,0.000011354101,0.00024345104,0.000010511427,0.9728253,0.0021366533,0.00024383045,0.001449106,0.00029444537],"about_ca_topic_score_codex":0.00004594905,"about_ca_topic_score_gemma":0.0000019246572,"teacher_disagreement_score":0.8334289,"about_ca_system_score_codex":0.000091909606,"about_ca_system_score_gemma":0.00017032407,"threshold_uncertainty_score":0.99910474},"labels":[],"label_agreement":null},{"id":"W2619165057","doi":"","title":"Customizing the Solution Process of COIN-OR's Linear Solvers with Python","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Python (programming language); Computer science; Scripting language; Programming language; Linear programming; Integer programming; Implementation; Theoretical computer science; Algorithm","score_opus":0.014265331737770377,"score_gpt":0.248946404975519,"score_spread":0.23468107323774864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619165057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016311165,0.00044894006,0.9790527,0.0017220561,0.0000932716,0.0005115206,0.000003071538,0.001208953,0.0006482864],"genre_scores_gemma":[0.6486999,0.000055678203,0.350324,0.00055186613,0.00007915071,0.00010388558,0.0000030649774,0.000024945613,0.00015749679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979816,0.00016524957,0.0004065944,0.0003204473,0.00044368318,0.00068239804],"domain_scores_gemma":[0.99815136,0.0001582996,0.00038324864,0.0008999831,0.0002208698,0.00018622822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472469,0.0002656656,0.00029299606,0.00026090487,0.0003486678,0.000104246195,0.0011194407,0.00016205022,0.0000056626864],"category_scores_gemma":[0.00012368198,0.00017472634,0.0000945967,0.00096007204,0.00013776802,0.00081078225,0.00026301912,0.00034013463,0.0000050918434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015458361,0.0030446365,0.14375067,0.00066470954,0.00055574754,0.000087353066,0.026033815,0.3977877,0.015227174,0.25166342,0.024410957,0.135228],"study_design_scores_gemma":[0.00053323084,0.00028580046,0.0042318585,0.0001360633,0.000033140193,0.00018835804,0.00017189453,0.93454134,0.057145823,0.0006314816,0.0016293463,0.0004716552],"about_ca_topic_score_codex":0.00084658025,"about_ca_topic_score_gemma":0.00014477073,"teacher_disagreement_score":0.6323887,"about_ca_system_score_codex":0.00015400893,"about_ca_system_score_gemma":0.00026022393,"threshold_uncertainty_score":0.7125134},"labels":[],"label_agreement":null},{"id":"W2620282837","doi":"10.1145/3053679","title":"Microarchitectural Comparison of the MXP and Octavo Soft-Processor FPGA Overlays","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Overlay; Verilog; Embedded system; Parallel computing; Computer hardware; Computer architecture; Operating system","score_opus":0.025317810919695073,"score_gpt":0.2779658604078253,"score_spread":0.2526480494881302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620282837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18269588,0.0014215781,0.8084599,0.0046091354,0.00055063085,0.0004336913,0.0000100274765,0.0005237839,0.0012953588],"genre_scores_gemma":[0.9938854,0.000056655965,0.005453844,0.00003352532,0.0000075862454,0.000027689395,2.7835722e-7,0.0000069000316,0.00052815216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901795,0.00005371246,0.00029610214,0.00032971962,0.00010610454,0.00019641806],"domain_scores_gemma":[0.9982287,0.00010635838,0.00029712255,0.001250983,0.00007934299,0.000037492835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021471486,0.00014720332,0.0002947442,0.0002265674,0.0010159843,0.00016469788,0.0013587347,0.0002095523,0.0000028630666],"category_scores_gemma":[0.0000768862,0.000109020744,0.00004586166,0.00019629845,0.00036808563,0.00016634107,0.0000393775,0.00032887657,0.0000022295294],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006499273,0.0003120325,0.015444042,0.00044640788,0.00025664814,0.000005480856,0.0018959924,0.009721739,0.00824969,0.032799907,0.0006097208,0.93019336],"study_design_scores_gemma":[0.0028823453,0.0012020094,0.012743903,0.0014541268,0.00012932773,0.0010748561,0.0012928445,0.48801336,0.4430836,0.04016265,0.0064659207,0.0014950677],"about_ca_topic_score_codex":0.00008070039,"about_ca_topic_score_gemma":0.00001815386,"teacher_disagreement_score":0.9286983,"about_ca_system_score_codex":0.0000130787475,"about_ca_system_score_gemma":0.000031220898,"threshold_uncertainty_score":0.7814233},"labels":[],"label_agreement":null},{"id":"W2624632852","doi":"10.1145/3092255.3092256","title":"Analyzing memory management methods on integrated CPU-GPU systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Astellas Pharma US","keywords":"Computer science; CUDA; Central processing unit; Memory management; Shared memory; Multi-core processor; Parallel computing; CPU shielding; Software; Uniform memory access; General-purpose computing on graphics processing units; Computer architecture; Embedded system; Operating system; Graphics; Overlay","score_opus":0.039523312378876206,"score_gpt":0.35247343750984844,"score_spread":0.31295012513097226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624632852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000893254,0.000046003082,0.83956355,0.0003022338,0.00042108196,0.00013332018,1.963908e-7,0.0007154732,0.15872882],"genre_scores_gemma":[0.14967492,0.000028212888,0.84172946,0.0001407531,0.00003268784,0.000014748573,0.0000011189896,0.0000074711616,0.008370629],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989074,0.0001663396,0.00020917229,0.00036702448,0.00014986066,0.00020020433],"domain_scores_gemma":[0.9983066,0.000056830042,0.00016749483,0.0013259258,0.00007726042,0.00006591568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094011583,0.00013242228,0.00016906863,0.00016979447,0.00044425187,0.00083465414,0.0016130065,0.00004846741,0.000008033681],"category_scores_gemma":[0.00003705155,0.00010466633,0.000054612963,0.00013586946,0.000030249408,0.00026070423,0.0004180264,0.000108451684,0.00004187357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007312935,0.000087807464,0.00021343442,0.00004567379,0.00011115464,0.00004340138,0.00016333508,0.029852714,0.00010412312,0.36685607,0.017683493,0.5848315],"study_design_scores_gemma":[0.00016503237,0.000047122077,0.0005686881,0.00007954635,0.000006637328,0.000004073449,0.000024149469,0.9885665,0.0022511263,0.0009921032,0.007088437,0.00020656746],"about_ca_topic_score_codex":0.000110619665,"about_ca_topic_score_gemma":0.0000015414994,"teacher_disagreement_score":0.9587138,"about_ca_system_score_codex":0.000045318364,"about_ca_system_score_gemma":0.000013911861,"threshold_uncertainty_score":0.8048589},"labels":[],"label_agreement":null},{"id":"W2625335332","doi":"10.48550/arxiv.1706.03162","title":"LazyPIM: Efficient Support for Cache Coherence in Processing-in-Memory Architectures","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; MESI protocol; Parallel computing; Cache; Cache coherence; MESIF protocol; Bus sniffing; Computer architecture; CPU cache; Cache algorithms","score_opus":0.06568021278862862,"score_gpt":0.23132540158032444,"score_spread":0.16564518879169582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625335332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103876665,0.0000776974,0.89125293,0.00009312405,0.00021412612,0.00063762284,0.000007716966,0.00032237338,0.0035177332],"genre_scores_gemma":[0.9786807,0.00001760054,0.020113373,0.00006289612,0.000032125565,0.000007773054,0.000010461438,0.0000149524485,0.0010601582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804676,0.000098769466,0.0002536505,0.0010908741,0.000093161034,0.00041677925],"domain_scores_gemma":[0.99826235,0.00008267629,0.0003547447,0.0010722731,0.00013410655,0.00009384974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005357899,0.0002883927,0.00037102503,0.0004756256,0.0001699008,0.00018766051,0.0025401195,0.00026431974,0.000004039108],"category_scores_gemma":[0.00009319443,0.00032561494,0.00012423442,0.00029975193,0.000121607525,0.00009096585,0.0012877717,0.00054030074,0.000006220626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000238979,0.000106239575,0.0019381572,0.00012158246,0.000005397601,0.0001136827,0.00046573966,0.99071336,0.0000060943853,0.0026449247,0.00013933201,0.003721613],"study_design_scores_gemma":[0.00052052434,0.00005180703,0.0025515752,0.00024484892,0.0000087892495,0.000003595689,0.000015530435,0.9823733,0.00020015064,0.013505924,0.0001355359,0.0003884315],"about_ca_topic_score_codex":0.00019302541,"about_ca_topic_score_gemma":0.0001392693,"teacher_disagreement_score":0.874804,"about_ca_system_score_codex":0.00018455238,"about_ca_system_score_gemma":0.00048755202,"threshold_uncertainty_score":0.9999196},"labels":[],"label_agreement":null},{"id":"W2625340222","doi":"10.6028/nist.ir.7671","title":"Mathematical and Computational Sciences Division :","year":2010,"lang":"en","type":"report","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Jacobs University; Universidad de Valladolid; Universidad de Cantabria; Università degli Studi di Palermo; University of Illinois at Urbana-Champaign; Sichuan University; Universidade Federal do Rio Grande do Sul; Dalhousie University; Seoul National University; Technische Universiteit Delft; Universiteit van Amsterdam; Rijksuniversiteit Groningen; University of Bristol; University of Leeds; University of St Andrews; University of Missouri; York University; New Mexico State University; North Carolina State University; Iowa State University; George Washington University; Louisiana State University; Drexel University; Technische Universität Berlin; University of Waikato; Georgetown University; Vrije Universiteit Amsterdam; Pennsylvania State University; University of Washington; Johns Hopkins University; University of Texas at Arlington; State University of New York; Ohio State University; Justus Liebig Universität Gießen; Tulane University; University of Wisconsin-Milwaukee; University of Pennsylvania; Macalester College; Utah State University; George Mason University","keywords":"Division (mathematics); Mathematical sciences; Computer science; Mathematics; Mathematics education; Arithmetic","score_opus":0.04592962009550633,"score_gpt":0.3390904303849576,"score_spread":0.2931608102894513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625340222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013168587,0.00011766105,0.859943,0.00038046052,0.00022957216,0.00010064699,0.0000011480258,0.000497742,0.13859813],"genre_scores_gemma":[0.02808836,0.00010011007,0.9689118,0.00012700859,0.000071844166,0.0000062691406,0.000007287386,0.000009249817,0.0026780518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980949,0.000035309964,0.00030214657,0.0004971311,0.00088767527,0.00018280325],"domain_scores_gemma":[0.9989564,0.00024388183,0.00016255748,0.00027817648,0.00027651546,0.00008248157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011528775,0.00017646274,0.0002478738,0.00020996804,0.0002585073,0.0004153035,0.0007168693,0.00022141534,0.00005010271],"category_scores_gemma":[0.00018744064,0.00013590006,0.000051266117,0.00021416144,0.00019134965,0.00017993926,0.0005976476,0.00031459014,0.000024408053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.757288e-7,0.00019933116,0.000514525,0.00027683855,0.0000440198,0.000022675978,0.00027947273,0.009863843,0.00001436952,0.7049369,0.1239385,0.15990855],"study_design_scores_gemma":[0.00006439488,0.00006592371,0.00041221987,0.00010450827,0.0000048771612,0.0001420649,0.0000018059767,0.8475053,0.000035834233,0.13432738,0.017028015,0.0003077231],"about_ca_topic_score_codex":0.000015127537,"about_ca_topic_score_gemma":0.0000011119574,"teacher_disagreement_score":0.8376414,"about_ca_system_score_codex":0.000022423776,"about_ca_system_score_gemma":0.0005360577,"threshold_uncertainty_score":0.5541844},"labels":[],"label_agreement":null},{"id":"W2625482784","doi":"10.29069/forscience.2016v4n1.e164","title":"Avaliação de desempenho e consumo energético para configurações de Wavefront pools de uma GPU AMD","year":2016,"lang":"pt","type":"article","venue":"ForScience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Energy consumption; Power consumption; Parallel computing; Computational science; Physics; Power (physics)","score_opus":0.034976115836315776,"score_gpt":0.2943089933915203,"score_spread":0.2593328775552045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625482784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056795556,0.0004660557,0.936651,0.0024164103,0.0004554264,0.00032608438,0.000023437595,0.00064391026,0.0022221056],"genre_scores_gemma":[0.836189,0.00034993057,0.15367177,0.0014500176,0.000116192605,0.000043769283,0.0000017183972,0.000029048977,0.008148559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951819,0.0005088614,0.0006493859,0.0011175062,0.0006972367,0.0018451179],"domain_scores_gemma":[0.9967869,0.0006382588,0.00040866106,0.001144971,0.00031016817,0.00071102264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002484677,0.00047358993,0.00046045586,0.00027239491,0.0007334265,0.00067823794,0.0030504295,0.00027947547,0.00014914015],"category_scores_gemma":[0.00091602816,0.00037783507,0.00019826462,0.0007620458,0.0008091476,0.00080739555,0.00062334974,0.00027751492,0.000268212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024831455,0.0014157576,0.055374857,0.00038257692,0.00023275836,0.00075208006,0.03216164,0.024293449,0.22422123,0.191777,0.121493675,0.34764665],"study_design_scores_gemma":[0.0011939147,0.00059682986,0.0151560595,0.0010345253,0.000052368876,0.00048349387,0.00018366169,0.7892011,0.16528223,0.013417026,0.011895665,0.0015031248],"about_ca_topic_score_codex":0.00037455224,"about_ca_topic_score_gemma":0.00004426895,"teacher_disagreement_score":0.78297925,"about_ca_system_score_codex":0.00060781295,"about_ca_system_score_gemma":0.0015434006,"threshold_uncertainty_score":0.9998674},"labels":[],"label_agreement":null},{"id":"W2626245353","doi":"10.1145/3062341.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Divide and conquer algorithms; Computer science; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Code generation; Theoretical computer science; Operating system; Set (abstract data type)","score_opus":0.024886371938090526,"score_gpt":0.28475674663951955,"score_spread":0.25987037470142904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626245353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001606094,0.000040890132,0.9886951,0.0011798701,0.000046497964,0.000100885154,9.4810486e-7,0.00011548772,0.008214261],"genre_scores_gemma":[0.66257894,0.000028054417,0.33682147,0.0000813289,0.00001253186,0.000012432803,1.7554238e-7,0.000002468414,0.00046261455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995563,0.000012893745,0.00011645611,0.00015758662,0.00006135047,0.00009540162],"domain_scores_gemma":[0.99915236,0.00016230425,0.000113258924,0.0004677554,0.00007148674,0.000032858272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020331083,0.000056725137,0.000117749805,0.000030982996,0.00017905756,0.00012551153,0.0005550414,0.00003274264,0.0000031537118],"category_scores_gemma":[0.00020947694,0.00004691624,0.000028527222,0.000015242947,0.0000607579,0.00019976022,0.00020476908,0.000020399779,0.0000011065981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013478578,0.00007072424,0.0046347477,0.00007644055,0.00004668039,0.0000020705895,0.00027685598,0.0005138272,0.00039885068,0.7785409,0.018488437,0.19693698],"study_design_scores_gemma":[0.0007532829,0.00016230723,0.017980553,0.0001096044,0.000021715206,0.0000114604445,0.000009968784,0.77034503,0.11276674,0.08315826,0.014178907,0.00050217914],"about_ca_topic_score_codex":0.000035747147,"about_ca_topic_score_gemma":0.0000024919166,"teacher_disagreement_score":0.7698312,"about_ca_system_score_codex":0.0000027802942,"about_ca_system_score_gemma":0.00001354084,"threshold_uncertainty_score":0.19131888},"labels":[],"label_agreement":null},{"id":"W2635077637","doi":"10.1109/ccece.2017.7946808","title":"DCM: A Python-based middleware for parallel processing applications on small scale devices","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Speedup; Python (programming language); Parallel computing; Programming paradigm; Software; Middleware (distributed applications); Distributed computing; Data-intensive computing; Supercomputer; Source lines of code; Programming language; Grid computing","score_opus":0.04701666260966375,"score_gpt":0.306532974702192,"score_spread":0.25951631209252823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2635077637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023810923,0.000045359702,0.9875357,0.00205225,0.00004016056,0.00055483653,0.0000027116707,0.00087161723,0.008659264],"genre_scores_gemma":[0.25540903,0.0000021637004,0.742659,0.00085525506,0.0000564366,0.00034703084,0.0000069438165,0.000011164585,0.0006530116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989977,0.000019009181,0.0001864428,0.000432038,0.00012847096,0.00023634046],"domain_scores_gemma":[0.9985138,0.00008817701,0.00021450903,0.00091788976,0.00018519041,0.00008043327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022160955,0.00013661954,0.00014139545,0.00008195349,0.0010438049,0.00069966645,0.0014831023,0.0000678796,0.0000022434745],"category_scores_gemma":[0.000035393274,0.00012202397,0.00007068204,0.000090140355,0.00005045461,0.00022437579,0.000120716046,0.0000694464,0.00001544672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007118662,0.0008656862,0.0064651896,0.0005173062,0.000034048906,0.0000037129412,0.00058377604,0.06560669,0.00022132519,0.092047684,0.0067971,0.8267863],"study_design_scores_gemma":[0.0004073787,0.00008695562,0.0011638144,0.000071679286,0.0000054041097,0.0000012256467,0.000007678098,0.97850287,0.0029933793,0.0042474074,0.0122553455,0.00025686718],"about_ca_topic_score_codex":0.000019853429,"about_ca_topic_score_gemma":0.000030484818,"teacher_disagreement_score":0.91289616,"about_ca_system_score_codex":0.000022514216,"about_ca_system_score_gemma":0.00010425776,"threshold_uncertainty_score":0.8028209},"labels":[],"label_agreement":null},{"id":"W2646720510","doi":"10.1109/ccece.2017.7946659","title":"SAPPP: The Software-Aware Power and Performance Profiler","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Profiling (computer programming); Computer science; Source code; Workload; Software; Overhead (engineering); Code (set theory); Operating system; Embedded system; Power demand; Power (physics); Power consumption; Programming language","score_opus":0.015704240165246852,"score_gpt":0.2542231473462601,"score_spread":0.23851890718101326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2646720510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016077263,0.00003612899,0.96920985,0.0015989245,0.00012024469,0.00010726343,2.5441116e-7,0.0004269491,0.012423096],"genre_scores_gemma":[0.868348,0.000027406648,0.1288719,0.00043717568,0.000016948798,0.0000076087995,2.2473513e-7,0.0000035422831,0.002287179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994881,0.000015785032,0.00007968802,0.00018037294,0.0001056753,0.00013038874],"domain_scores_gemma":[0.9990568,0.000028573264,0.00006781956,0.0007611758,0.000052950792,0.000032658027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019588677,0.000070852104,0.00006149075,0.000019689665,0.000726509,0.00044866352,0.00096852425,0.000029536477,0.000013931071],"category_scores_gemma":[0.00003698629,0.000042273947,0.00001721356,0.000032567717,0.00007493287,0.00038913367,0.00047045143,0.00007440817,0.000020048317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022398455,0.00012964512,0.20099887,0.00006495763,0.000059808335,0.000013906136,0.0029840444,0.0009611199,0.00006225309,0.10885624,0.13529591,0.5505508],"study_design_scores_gemma":[0.0003648644,0.00019881222,0.30467847,0.000053404387,0.000004421051,0.00004467746,0.000017917459,0.66841626,0.0033377507,0.0028003405,0.019619113,0.00046397487],"about_ca_topic_score_codex":0.000010883326,"about_ca_topic_score_gemma":9.473113e-7,"teacher_disagreement_score":0.8522707,"about_ca_system_score_codex":0.0000050513263,"about_ca_system_score_gemma":0.00002000278,"threshold_uncertainty_score":0.55877936},"labels":[],"label_agreement":null},{"id":"W2671880942","doi":"","title":"A Quantitative Approach to Non-Intrusive Computing","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Deliverable; Focus (optics); Ubiquitous computing; Software; Human–computer interaction; Intrusion; Computer security; Data science; Internet privacy; Engineering","score_opus":0.01815597908544437,"score_gpt":0.28654602922484695,"score_spread":0.2683900501394026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2671880942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010087332,0.0000022374134,0.89052117,0.000352896,0.00020882217,0.00017677498,2.6321672e-7,0.0006608571,0.09798964],"genre_scores_gemma":[0.41459405,2.5402565e-7,0.5845832,0.00057969446,0.000027331702,0.0000041039666,7.245483e-7,0.0000043418218,0.00020626243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.00002825207,0.00017370493,0.0003793826,0.00016199108,0.00023684216],"domain_scores_gemma":[0.99912685,0.0001088049,0.000057639012,0.0004283392,0.0001555776,0.00012280578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306625,0.0001175311,0.00013736392,0.0001437334,0.0001532207,0.00018061181,0.00086491887,0.00005379773,0.0000070844426],"category_scores_gemma":[0.00010467613,0.000103103775,0.0000419506,0.00051209447,0.000026590607,0.00017705484,0.00038485663,0.00020027898,0.00013194844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053547706,0.00014251495,0.0001570669,0.000008282096,0.00001492784,0.0000028880138,0.004077193,0.01576059,0.0037743999,0.9483948,0.0124549875,0.015206994],"study_design_scores_gemma":[0.00009505376,0.00007288859,0.0004106034,0.0000052324085,0.0000010028143,0.000010385171,0.000049051047,0.99309754,0.003653837,0.001543774,0.0008807902,0.00017983641],"about_ca_topic_score_codex":0.00002551349,"about_ca_topic_score_gemma":0.0000024736185,"teacher_disagreement_score":0.97733694,"about_ca_system_score_codex":0.000010082013,"about_ca_system_score_gemma":0.000040860017,"threshold_uncertainty_score":0.420445},"labels":[],"label_agreement":null},{"id":"W2686886550","doi":"10.1109/ccece.2017.7946727","title":"Exploiting non-uniformity of write accesses for designing a high-endurance hybrid Last Level Cache in 3D CMPs","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Parsec; Computer science; Cache; Static random-access memory; Embedded system; Leakage power; Energy consumption; Power consumption; Latency (audio); Parallel computing; Operating system; Computer hardware; Power (physics); Electrical engineering; Engineering","score_opus":0.06918220370446736,"score_gpt":0.307866190104608,"score_spread":0.2386839864001406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2686886550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054720394,0.0000135612,0.9427308,0.00017584318,0.00009404294,0.00022911608,0.0000046431496,0.00017212419,0.001859503],"genre_scores_gemma":[0.54193884,0.000011061045,0.45787755,0.00004109703,0.000021624586,0.000020355834,0.000001290768,0.0000054828665,0.00008270703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998861,0.000031309253,0.00034413784,0.00033053185,0.00015371149,0.0002793138],"domain_scores_gemma":[0.99861467,0.00019125309,0.00034288276,0.000633319,0.00017123234,0.000046656427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188437,0.00013704067,0.00024608418,0.00012808072,0.00033837598,0.0002744639,0.0014372236,0.00004370716,0.000002077495],"category_scores_gemma":[0.00028514097,0.00012892333,0.00005128706,0.00011409399,0.000051963525,0.0010845594,0.00038993976,0.00010451222,0.0000018226202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018918092,0.0011073466,0.17017056,0.0013819574,0.00016754506,0.000099436606,0.0050984113,0.14822483,0.025211755,0.09179008,0.00842276,0.5481361],"study_design_scores_gemma":[0.0007586265,0.00006742022,0.023466948,0.00023361688,0.0000037352654,0.000007635168,0.00003065999,0.8013607,0.17107522,0.0025912677,0.000097663295,0.00030647803],"about_ca_topic_score_codex":0.00033165634,"about_ca_topic_score_gemma":0.00005771569,"teacher_disagreement_score":0.6531359,"about_ca_system_score_codex":0.000027287819,"about_ca_system_score_gemma":0.00007420506,"threshold_uncertainty_score":0.5257341},"labels":[],"label_agreement":null},{"id":"W2721246439","doi":"10.1145/3079856.3080218","title":"Fractal","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Kwanjeong Educational Foundation; Massachusetts Institute of Technology; National Science Foundation","keywords":"Computer science; Parallel computing; Parallelism (grammar); Focus (optics); Transactional memory; Fractal; Programming language; Database transaction; Mathematics","score_opus":0.02217878120554556,"score_gpt":0.2898910139531854,"score_spread":0.26771223274763983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2721246439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054480776,0.000004371539,0.8092206,0.0009613732,0.00007779258,0.000014336232,2.8154826e-8,0.00035433093,0.18882234],"genre_scores_gemma":[0.63058174,0.0000023060995,0.36760014,0.00017258276,0.000016818161,7.4807133e-7,7.0864196e-8,9.68357e-7,0.0016246428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973124,0.0000052418927,0.00004187989,0.00009797874,0.000056183195,0.00006749535],"domain_scores_gemma":[0.99931395,0.0000079590445,0.00003902362,0.0005933349,0.000021522343,0.000024209778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007178504,0.000029219946,0.000032508913,0.00001600546,0.00027131688,0.00033956912,0.0009493705,0.000015567102,0.000012921339],"category_scores_gemma":[0.000031481573,0.000024351499,0.00001576058,0.000013134014,0.00001493984,0.00032857736,0.00023552099,0.00002799127,0.00006046354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.963484e-7,0.00003485422,0.0035638977,0.0000018186017,0.0000056927433,0.000011372578,0.00010854802,0.00022006173,0.00012100476,0.7826441,0.035888195,0.17739965],"study_design_scores_gemma":[0.000184149,0.000039552982,0.023680128,0.0000075578773,8.054838e-7,0.0000119035885,0.0000016986398,0.9050651,0.00936108,0.027173905,0.034255754,0.00021836371],"about_ca_topic_score_codex":0.000015707968,"about_ca_topic_score_gemma":7.082496e-7,"teacher_disagreement_score":0.90484506,"about_ca_system_score_codex":0.0000031454729,"about_ca_system_score_gemma":0.000009147146,"threshold_uncertainty_score":0.32744727},"labels":[],"label_agreement":null},{"id":"W2725356428","doi":"","title":"Automatic streamization in GCC","year":2009,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science","score_opus":0.011572723811008252,"score_gpt":0.2347553735325484,"score_spread":0.22318264972154017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2725356428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007942451,0.00046065022,0.94937575,0.00612902,0.00013865149,0.00040514383,0.000005215509,0.0017587391,0.033784356],"genre_scores_gemma":[0.34687382,0.00035264753,0.65110844,0.00016110917,0.000013321715,0.000041004107,0.00014555923,0.000023457505,0.0012806582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934289,0.004195362,0.00067883515,0.00090076524,0.0004305641,0.00036560086],"domain_scores_gemma":[0.99518305,0.0006511529,0.0005412947,0.0024180058,0.0010775008,0.00012901681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044515477,0.00034047,0.00039875926,0.0004699824,0.0001904977,0.0007009696,0.002507886,0.00032793666,0.00003100848],"category_scores_gemma":[0.00087842427,0.00038478724,0.00014234985,0.00078080135,0.00007706557,0.00026858252,0.0015347106,0.00061570917,0.000024774092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039050155,0.0012625223,0.0019348628,0.0002459669,0.00004769319,0.00002269191,0.011432439,0.020053698,0.0001480908,0.37662375,0.0042204238,0.584004],"study_design_scores_gemma":[0.00027788896,3.8371388e-7,0.0035334248,0.0014211753,0.000007177643,0.0000057208777,0.000007049847,0.9544996,0.003742756,0.035518765,0.0006016454,0.00038438858],"about_ca_topic_score_codex":0.0004175737,"about_ca_topic_score_gemma":0.0003121415,"teacher_disagreement_score":0.9344459,"about_ca_system_score_codex":0.00017568828,"about_ca_system_score_gemma":0.00032650735,"threshold_uncertainty_score":0.9998604},"labels":[],"label_agreement":null},{"id":"W2726518598","doi":"","title":"Improving GNU compiler collection infrastructure for streamization","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Compiler; Programming language; Operating system","score_opus":0.010952723524002148,"score_gpt":0.22548536002584724,"score_spread":0.2145326365018451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726518598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002398814,0.00025781864,0.98468524,0.0023283826,0.0004231824,0.0008338578,0.00003254649,0.001611944,0.0074282065],"genre_scores_gemma":[0.12062435,0.00057949097,0.8743363,0.00014006512,0.000051916893,0.00015918353,0.000559901,0.00004978894,0.0034990336],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555916,0.0020118991,0.0006179316,0.0010370816,0.00039458735,0.00037931837],"domain_scores_gemma":[0.993289,0.00085656485,0.0008186512,0.0019233068,0.0029664778,0.00014600957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021983662,0.0003941613,0.0004096169,0.0003558241,0.0007494051,0.00067147426,0.0019054551,0.000437448,0.000012586428],"category_scores_gemma":[0.0010294213,0.000440582,0.00022972787,0.0006074369,0.00012456145,0.00028336784,0.0015580585,0.0005605394,0.0000054914904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006692891,0.0015002507,0.0029205203,0.001095091,0.00035825022,0.000011774043,0.03110549,0.12796895,0.0022861534,0.2604151,0.10220766,0.47006384],"study_design_scores_gemma":[0.0004630975,9.743915e-7,0.00074134866,0.0004274355,0.000017196597,0.000014653791,0.000012388828,0.973135,0.013281686,0.00699298,0.004466085,0.00044716147],"about_ca_topic_score_codex":0.00037016993,"about_ca_topic_score_gemma":0.00010855311,"teacher_disagreement_score":0.845166,"about_ca_system_score_codex":0.00022019034,"about_ca_system_score_gemma":0.0005213528,"threshold_uncertainty_score":0.9998046},"labels":[],"label_agreement":null},{"id":"W2727027585","doi":"10.1109/isorc.2017.1","title":"A Cache-Coherent Heterogeneous Architecture for Low Latency Real Time Applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Virtualization; Distributed computing; Cache; Embedded system; Polling; Operating system","score_opus":0.01489717458919638,"score_gpt":0.27498374441894974,"score_spread":0.26008656982975337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727027585","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007143636,0.000016131384,0.98731214,0.0008191127,0.000041369465,0.0004960597,0.0000036896859,0.0006712413,0.009925866],"genre_scores_gemma":[0.19506735,0.000018958794,0.80001223,0.00019187776,0.00010912485,0.00031348158,0.000010595039,0.000014521767,0.004261887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921626,0.000017326953,0.00014778906,0.00031990546,0.00009898147,0.00019974221],"domain_scores_gemma":[0.99867696,0.000042808922,0.00012141841,0.0010045285,0.000081529506,0.00007277463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118541546,0.000109018125,0.00011944079,0.000046244873,0.0004992811,0.0002873563,0.0012604635,0.000058196012,0.000012098152],"category_scores_gemma":[0.000017946984,0.00009275495,0.00007681096,0.000042297674,0.000035462905,0.000102198384,0.0002301869,0.0000576603,0.000045321205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004006009,0.00077238336,0.0009617868,0.00016402153,0.0001742676,0.000017109436,0.0012027115,0.07181148,0.007236131,0.14090815,0.03514355,0.7415683],"study_design_scores_gemma":[0.000553626,0.0001807515,0.00059988175,0.00002873952,0.000011233411,0.000033954395,0.0000012037916,0.9333576,0.013979944,0.03155958,0.019181386,0.000512086],"about_ca_topic_score_codex":0.00004177126,"about_ca_topic_score_gemma":0.000009024573,"teacher_disagreement_score":0.86154616,"about_ca_system_score_codex":0.000018159883,"about_ca_system_score_gemma":0.000035936264,"threshold_uncertainty_score":0.3840117},"labels":[],"label_agreement":null},{"id":"W2727732801","doi":"10.1145/3093338.3093352","title":"Interactive Code Adaptation Tool for Modernizing Applications for Intel Knights Landing Processors","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Theoretical Astrophysics; National Science Foundation","keywords":"Computer science; Supercomputer; Adaptation (eye); Computer architecture; Code (set theory); Memory hierarchy; Operating system; Embedded system; Parallel computing; Programming language","score_opus":0.06185161494151615,"score_gpt":0.3429722554698583,"score_spread":0.2811206405283422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727732801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016806152,0.000008665687,0.99462783,0.00050985854,0.00005521865,0.0009025316,0.0000057755874,0.00038702806,0.0033350333],"genre_scores_gemma":[0.40301841,0.0000024465146,0.59522814,0.000046649788,0.00004857396,0.0005959665,0.000007870655,0.0000066792027,0.0010452373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993147,0.0000094610095,0.00016591023,0.00028690815,0.00007556956,0.00014740365],"domain_scores_gemma":[0.99893284,0.00017980929,0.00020762948,0.00037883926,0.00027179366,0.000029113926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020649127,0.00008839259,0.00010518243,0.00006914455,0.0007241751,0.00044998567,0.0007202302,0.00004213565,0.0000018440229],"category_scores_gemma":[0.00015558132,0.00007930279,0.000051389125,0.000040830237,0.000019126419,0.0007185732,0.000108010245,0.000048476322,0.000005506312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012094311,0.00025240958,0.0001860079,0.0002388433,0.00010482027,5.2856547e-7,0.009206708,0.054796394,0.00074751594,0.56719464,0.006491985,0.36065918],"study_design_scores_gemma":[0.00022501367,0.000037686863,0.00002426297,0.000023122717,0.0000037183668,0.0000010176068,0.000032887816,0.95884264,0.0041671623,0.026979659,0.009544891,0.00011795081],"about_ca_topic_score_codex":0.000008080744,"about_ca_topic_score_gemma":0.000010826283,"teacher_disagreement_score":0.90404624,"about_ca_system_score_codex":0.00003602646,"about_ca_system_score_gemma":0.000035515408,"threshold_uncertainty_score":0.55698425},"labels":[],"label_agreement":null},{"id":"W2728809642","doi":"10.1145/3079856.3080251","title":"There and Back Again","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Computer science; Scalability; Memory management; Server; Cube (algebra); Interleaved memory; Memory architecture; Distributed memory; Uniform memory access; Registered memory; Flat memory model; Distributed computing; Memory map; Parallel computing; Computer architecture; Architecture; Network topology; Semiconductor memory; Computer hardware; Operating system; Shared memory","score_opus":0.024817173723239175,"score_gpt":0.2757072159399943,"score_spread":0.25089004221675515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2728809642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001506063,0.0000336561,0.82676095,0.0011948647,0.00003415849,0.000025356063,5.35923e-8,0.00015436736,0.17029056],"genre_scores_gemma":[0.5501647,0.000031878888,0.4433124,0.0002740627,0.000015106958,8.08557e-7,9.628013e-8,0.0000019113565,0.006199048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971855,0.000010336985,0.000043256598,0.0001193552,0.000041292988,0.0000672101],"domain_scores_gemma":[0.9994638,0.0000120306795,0.00003461315,0.00044475181,0.000017149214,0.000027685612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094360716,0.000036470905,0.00004092936,0.000013401288,0.00019253032,0.00033303862,0.0005070456,0.000018647817,0.000019624407],"category_scores_gemma":[0.000016476528,0.0000285607,0.000009535668,0.000013090875,0.000025489828,0.00020256234,0.00025128355,0.00002616558,0.00005361451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025337429,0.000047453035,0.012354164,0.000015446347,0.000016213724,0.00001479629,0.00044314482,0.00028838112,0.00021346129,0.5519642,0.06509581,0.36954436],"study_design_scores_gemma":[0.00034268986,0.00006512104,0.030728374,0.000026755573,0.0000013679116,0.000014883812,0.0000066420594,0.9000458,0.004100928,0.026556108,0.037812434,0.0002988906],"about_ca_topic_score_codex":0.00001791639,"about_ca_topic_score_gemma":0.0000014741764,"teacher_disagreement_score":0.89975744,"about_ca_system_score_codex":0.000002232158,"about_ca_system_score_gemma":0.00000640534,"threshold_uncertainty_score":0.32114992},"labels":[],"label_agreement":null},{"id":"W2729399671","doi":"10.1109/ipdps.2017.122","title":"The SEPO Model of Computation to Enable Larger-Than-Memory Hash Tables for GPU-Accelerated Big Data Analytics","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hash table; Hash function; Parallel computing; Big data; Speedup; Analytics; Double hashing; Database; Operating system; Programming language","score_opus":0.20078275751766195,"score_gpt":0.3475083482209742,"score_spread":0.14672559070331226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729399671","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009942487,0.000031112955,0.99457747,0.0011450154,0.00019903894,0.00031372308,0.00003469997,0.00019380485,0.002510892],"genre_scores_gemma":[0.41989604,0.000023906794,0.5775997,0.0002041585,0.000053750588,0.000012114001,0.00004436928,0.000010053457,0.0021558988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988238,0.000030672916,0.0003113544,0.00037757852,0.00020410327,0.00025249698],"domain_scores_gemma":[0.99739593,0.0001621434,0.00026594737,0.0017102292,0.0003968241,0.000068893845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170232,0.00011993865,0.00018228746,0.00007876192,0.0008303398,0.00070284517,0.002761537,0.00005269849,0.0000011737013],"category_scores_gemma":[0.00025318764,0.00008974587,0.00003919105,0.0001624707,0.00005506902,0.0004574328,0.0010184215,0.00005741011,0.0000032362311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014716559,0.00006818063,0.00010157338,0.00002370437,0.000035370416,5.147936e-7,0.00015735615,0.8939038,0.00085675006,0.009043216,0.056675017,0.0391198],"study_design_scores_gemma":[0.00018912478,0.00004053582,0.0000372753,0.000016675505,0.00000651383,6.5070446e-7,0.000011982037,0.9855335,0.008119671,0.004370108,0.0015511342,0.00012284415],"about_ca_topic_score_codex":0.00014363849,"about_ca_topic_score_gemma":0.00008881911,"teacher_disagreement_score":0.4189018,"about_ca_system_score_codex":0.000018305356,"about_ca_system_score_gemma":0.00015489243,"threshold_uncertainty_score":0.67775524},"labels":[],"label_agreement":null},{"id":"W2730174870","doi":"10.1109/ipdpsw.2017.46","title":"A Sampling Based Strategy to Automatic Performance Tuning of GPU Programs","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Benchmark (surveying); Tree (set theory); Heuristic; Sampling (signal processing); Regression; Process (computing); Tree traversal; Algorithm; Artificial intelligence; Mathematics; Statistics; Computer vision","score_opus":0.06094296319494637,"score_gpt":0.3151331971192142,"score_spread":0.25419023392426787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730174870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744799,0.000004677566,0.9202508,0.00014672536,0.000042012933,0.00013843583,1.01743204e-7,0.00047364426,0.004463719],"genre_scores_gemma":[0.53042954,5.679755e-7,0.46944702,0.000043755106,0.0000058564565,0.0000060525576,3.3361152e-7,0.0000025454883,0.0000643559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928564,0.000017059003,0.00018624622,0.00018786006,0.00015213892,0.00017103428],"domain_scores_gemma":[0.99896485,0.00002642428,0.00014230139,0.0007117775,0.000092292634,0.0000623313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029678474,0.00008091947,0.00012282177,0.00007783541,0.00024771085,0.00029209573,0.001070743,0.000028912795,0.0000061654296],"category_scores_gemma":[0.000044902783,0.00007074596,0.000030925778,0.00011052221,0.00002653575,0.0002900381,0.00019411721,0.00005135921,0.000008118705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030221324,0.000084666804,0.0053389166,0.00008607622,0.000008829594,0.0000015401663,0.00029698713,0.0902269,0.00044893273,0.008182672,0.0001537913,0.89516765],"study_design_scores_gemma":[0.00009161187,0.00017683671,0.004344962,0.00010295153,0.0000011772263,0.000001174609,0.0000041370745,0.9917253,0.0032154454,0.00015589257,0.00008429883,0.00009616976],"about_ca_topic_score_codex":0.00003374044,"about_ca_topic_score_gemma":0.0000024367262,"teacher_disagreement_score":0.90149844,"about_ca_system_score_codex":0.0000120007835,"about_ca_system_score_gemma":0.000060631104,"threshold_uncertainty_score":0.28849366},"labels":[],"label_agreement":null},{"id":"W2731280337","doi":"10.1145/3062341.3062371","title":"Low overhead dynamic binary translation on ARM","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Royal Society of Canada","keywords":"Binary translation; Computer science; ARM architecture; Instruction set; Architecture; Overhead (engineering); Implementation; Compatibility (geochemistry); Parallel computing; Embedded system; Binary number; Computer architecture; Operating system; Programming language; Software; Arithmetic; Engineering","score_opus":0.024442146303605767,"score_gpt":0.2953209687064649,"score_spread":0.27087882240285915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731280337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043122414,0.000015805395,0.9401698,0.0016424659,0.0001707173,0.000078567944,3.9007472e-7,0.00055589125,0.05305409],"genre_scores_gemma":[0.83801293,0.000021099991,0.16086356,0.0002517739,0.000014907432,0.000002972429,0.0000015638751,0.000004277662,0.0008269145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993927,0.000020807935,0.00010310168,0.00022502261,0.00013297037,0.00012539109],"domain_scores_gemma":[0.9991095,0.000030281943,0.00007337316,0.0007217631,0.000027325683,0.00003775078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013024049,0.0000789444,0.00007461514,0.000063468484,0.00032567143,0.00024972763,0.0007621275,0.000043656084,0.00001413198],"category_scores_gemma":[0.000015238595,0.00006958631,0.00003916176,0.000045459772,0.000024637142,0.0003439131,0.00007177937,0.00006918712,0.00005735248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029998617,0.00057222927,0.00041368228,0.000028757051,0.000023275816,0.000030272004,0.00056757685,0.03644478,0.0015412814,0.14713298,0.008166604,0.8050486],"study_design_scores_gemma":[0.00016388761,0.00012431864,0.0033030717,0.000023834438,8.597835e-7,0.0000019797476,9.5063547e-7,0.9894651,0.002625993,0.0034866233,0.00068835146,0.00011502128],"about_ca_topic_score_codex":0.000012048956,"about_ca_topic_score_gemma":0.000004079047,"teacher_disagreement_score":0.95302033,"about_ca_system_score_codex":0.00001834007,"about_ca_system_score_gemma":0.00001894509,"threshold_uncertainty_score":0.28376472},"labels":[],"label_agreement":null},{"id":"W2731391612","doi":"10.1145/3079757","title":"Reducing the Performance Gap between Soft Scalar CPUs and Custom Hardware with TILT","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Datapath; Computer science; Field-programmable gate array; Benchmark (surveying); Parallel computing; Throughput; Embedded system; Computer hardware","score_opus":0.026581017701235183,"score_gpt":0.2510548389281125,"score_spread":0.22447382122687728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731391612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14964,0.0006353312,0.8412762,0.005184399,0.00024247938,0.0004175172,0.000006934435,0.0008989386,0.0016981851],"genre_scores_gemma":[0.99228925,0.0002603672,0.0063681896,0.000034107386,0.000021070915,0.000062346815,7.658685e-7,0.000010882315,0.0009530292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895257,0.000050472197,0.00021449896,0.0004124342,0.00011640478,0.000253647],"domain_scores_gemma":[0.9981578,0.00011051709,0.00018055466,0.0014135014,0.000083808234,0.000053809792],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003945331,0.00016986659,0.00024585208,0.0002442212,0.0019862612,0.00037591238,0.0011164141,0.00020643097,0.0000028439424],"category_scores_gemma":[0.00003095925,0.00011703932,0.000023475304,0.00020016973,0.00030604037,0.000373071,0.000024749788,0.0004041434,0.0000078226085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347326,0.000090294736,0.01826116,0.00026969466,0.0003106184,0.000023125214,0.00093075924,0.012111188,0.00046446914,0.009573056,0.000626956,0.9572952],"study_design_scores_gemma":[0.004650625,0.0036205645,0.02849165,0.0041779587,0.0003693999,0.0033219624,0.0016209513,0.7912299,0.11000638,0.010151131,0.038950775,0.003408692],"about_ca_topic_score_codex":0.00006989071,"about_ca_topic_score_gemma":0.000005270558,"teacher_disagreement_score":0.9538865,"about_ca_system_score_codex":0.00001862681,"about_ca_system_score_gemma":0.00003644627,"threshold_uncertainty_score":0.999313},"labels":[],"label_agreement":null},{"id":"W2733045287","doi":"10.4230/lipics.ecrts.2017.24","title":"WCET-Driven Dynamic Data Scratchpad Management With Compiler-Directed Prefetching","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Worst-case execution time; Parallel computing; Latency (audio); CAS latency; Scheme (mathematics); Embedded system; Operating system; Execution time; Memory controller; Semiconductor memory","score_opus":0.030260485462023687,"score_gpt":0.29869695360681403,"score_spread":0.26843646814479033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2733045287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007715644,0.000021782276,0.97614795,0.00054115633,0.0004790585,0.001195585,0.00022219769,0.001381454,0.012295169],"genre_scores_gemma":[0.31101936,0.0000689171,0.6870788,0.00047597152,0.000052754112,0.00006916395,0.0006886004,0.00004198391,0.00050449924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972752,0.00004919538,0.00081879075,0.0005667001,0.0005681648,0.0007219639],"domain_scores_gemma":[0.9943829,0.00007047893,0.00086973375,0.0042257383,0.00025853564,0.00019257242],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006253181,0.00043727443,0.00046234162,0.0002594926,0.0013998318,0.0019113305,0.0065210206,0.00014317094,0.00000746902],"category_scores_gemma":[0.000052522937,0.00037146802,0.00009916533,0.0002005006,0.00016008654,0.0035801097,0.0032032744,0.00037971773,0.00005650598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011439614,0.003998578,0.04305464,0.0061176196,0.0047823233,0.00029030174,0.034195464,0.049430512,0.000098109675,0.1487395,0.1518491,0.55629987],"study_design_scores_gemma":[0.0019559427,0.00016133401,0.0025695362,0.0003487089,0.00003831936,0.000034122422,0.00011619682,0.9738129,0.0000740162,0.0007610748,0.019563714,0.00056416244],"about_ca_topic_score_codex":0.00002426324,"about_ca_topic_score_gemma":0.000036710244,"teacher_disagreement_score":0.9243824,"about_ca_system_score_codex":0.00010777984,"about_ca_system_score_gemma":0.000066456196,"threshold_uncertainty_score":0.9999002},"labels":[],"label_agreement":null},{"id":"W2734180996","doi":"10.4230/lipics.ecoop.2017.23","title":"Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Compiler; Computer science; Programming language; Interprocedural optimization; Compile time; Function (biology); Register allocation; Optimizing compiler; Parallel computing; Functional programming; Just-in-time compilation; Static analysis; Identity (music); Loop optimization","score_opus":0.011184281094810195,"score_gpt":0.31666544997271834,"score_spread":0.30548116887790816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734180996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029361382,0.000026882275,0.9653204,0.000286279,0.00032653328,0.00042833696,0.000086679865,0.0002801789,0.003883343],"genre_scores_gemma":[0.81773406,0.000022592934,0.18116672,0.0002524308,0.00004139376,0.000025279169,0.00015197834,0.000017708928,0.00058782223],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980618,0.00003437459,0.0008960836,0.00024975196,0.0003771823,0.0003808313],"domain_scores_gemma":[0.9970911,0.00005965447,0.0010950089,0.0011887364,0.00046595206,0.00009950649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003793986,0.0002689289,0.0005161361,0.00043704527,0.0004111166,0.0006136542,0.0017329241,0.00012863526,0.000022915889],"category_scores_gemma":[0.00015626146,0.0002422323,0.00022498367,0.00042373,0.0001425642,0.0014811386,0.00047231143,0.00015957224,0.00001495833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059950014,0.0024347128,0.5186764,0.00476817,0.0068832273,0.000028361257,0.07177087,0.08198561,0.00039384986,0.19595619,0.018281192,0.09822196],"study_design_scores_gemma":[0.001002188,0.00013244024,0.010425408,0.000114881404,0.00013239772,0.0000056059594,0.00018769191,0.9833889,0.0007098029,0.0009246255,0.0025942086,0.00038186397],"about_ca_topic_score_codex":0.00003920659,"about_ca_topic_score_gemma":0.0000524778,"teacher_disagreement_score":0.9014033,"about_ca_system_score_codex":0.00007286491,"about_ca_system_score_gemma":0.000067734996,"threshold_uncertainty_score":0.98779464},"labels":[],"label_agreement":null},{"id":"W2734640206","doi":"10.1007/978-3-319-61982-8_3","title":"Hard Faults and Soft-Errors: Possible Numerical Remedies in Linear Algebra Solvers","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robustness (evolution); Solver; Interpolation (computer graphics); Linear algebra; Numerical analysis; Implementation; Orthogonalization; Linear system; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02253761667050196,"score_gpt":0.272529710113193,"score_spread":0.24999209344269102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734640206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012679357,0.0005004657,0.9949128,0.0011410532,0.0010191317,0.0002959564,0.0000024225783,0.00033542016,0.0016659743],"genre_scores_gemma":[0.07253195,0.00020217376,0.92501533,0.0010062429,0.0003057671,0.000009198995,0.0000049526493,0.000035808123,0.00088855514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963741,0.000044743563,0.0005462122,0.0016019733,0.00075406383,0.0006789165],"domain_scores_gemma":[0.9975114,0.00031667235,0.00038217191,0.001397996,0.00019645746,0.00019528989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095201354,0.00052736397,0.0006493482,0.0008871084,0.0004143894,0.0005411932,0.003193678,0.00038225477,0.0000055674755],"category_scores_gemma":[0.0002598469,0.0004907929,0.00009846916,0.00029726909,0.00084143726,0.00077203003,0.0018491225,0.00090527924,0.0000163926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027107282,0.00008549837,0.0014343415,0.00011396862,0.000026552874,0.00034194352,0.0037776497,0.13036166,0.00008530809,0.008939294,0.00033869705,0.854468],"study_design_scores_gemma":[0.00030437743,0.0001566844,0.00061891763,0.00058325235,0.0000041469066,0.000055780805,2.3901939e-7,0.94061106,0.00041961187,0.055467095,0.0011297863,0.0006490541],"about_ca_topic_score_codex":0.00007895568,"about_ca_topic_score_gemma":0.000053675547,"teacher_disagreement_score":0.8538189,"about_ca_system_score_codex":0.00017689622,"about_ca_system_score_gemma":0.0004363979,"threshold_uncertainty_score":0.99975437},"labels":[],"label_agreement":null},{"id":"W2735037263","doi":"10.1109/ispass.2017.7975272","title":"Fast IPC estimation for performance projections using proxy suites and decision trees","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Workload; Computer science; Proxy (statistics); Schedule; x86; Software; Machine learning; Operating system","score_opus":0.03786151506803649,"score_gpt":0.3255989206938777,"score_spread":0.2877374056258412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735037263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09725453,0.000012659126,0.9015239,0.00010735349,0.000077100034,0.00024803827,5.1528195e-7,0.00023000083,0.00054589467],"genre_scores_gemma":[0.43228292,0.000008364369,0.567555,0.0000135309,0.000014397966,0.000011626432,6.0314676e-7,0.000002607384,0.00011091451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994717,0.0000065649756,0.00011970376,0.0002041593,0.00008345495,0.000114402545],"domain_scores_gemma":[0.999361,0.000074230426,0.00010230025,0.0003386877,0.00009508807,0.000028714976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019152414,0.00007131331,0.00007575846,0.000080551734,0.0009164361,0.0005207227,0.00032834258,0.000033779095,9.370085e-7],"category_scores_gemma":[0.000123778,0.000059399976,0.000019727304,0.000055509867,0.000035030338,0.0008386895,0.00014751896,0.000032285338,0.0000010508247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001400716,0.000059320577,0.017295416,0.000037933227,0.000009429652,3.6125925e-7,0.0004338344,0.05160138,0.00037723852,0.01371959,0.00067020167,0.91578126],"study_design_scores_gemma":[0.00014400788,0.00006151273,0.0061788033,0.000037869984,0.0000024688893,0.000007915085,0.0000034420439,0.9891846,0.0021740713,0.0020105087,0.000110781795,0.00008399278],"about_ca_topic_score_codex":0.00002210376,"about_ca_topic_score_gemma":0.000005604607,"teacher_disagreement_score":0.93758327,"about_ca_system_score_codex":0.000015279502,"about_ca_system_score_gemma":0.000031123494,"threshold_uncertainty_score":0.7048578},"labels":[],"label_agreement":null},{"id":"W2735571801","doi":"10.1109/ispass.2017.7975281","title":"DARTS: Performance-counter driven sampling using binary translators","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Suite; Workload; Spec#; Computer science; Key (lock); Sampling (signal processing); Binary number; Binary translation; Real-time computing; Operating system; Software; Programming language; Arithmetic","score_opus":0.0610289018090522,"score_gpt":0.3141697958581161,"score_spread":0.2531408940490639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735571801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14004377,0.0000225122,0.85178626,0.00020919465,0.00022392946,0.000065717075,3.18604e-7,0.0004150745,0.00723322],"genre_scores_gemma":[0.6309145,0.000014159602,0.36880136,0.00010613147,0.000037412963,0.0000013986863,4.5304387e-7,0.000005422038,0.00011913567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.000015799986,0.00016125455,0.00026228683,0.00014891062,0.00021276723],"domain_scores_gemma":[0.99901456,0.000016346818,0.00010147292,0.00075796444,0.000055178843,0.00005446015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017689896,0.000110246256,0.000115970055,0.000084102365,0.00075333554,0.00045894363,0.0011178114,0.000051051917,0.000015613727],"category_scores_gemma":[0.000010426243,0.00009749172,0.00006517296,0.000061195315,0.000050667033,0.0009537231,0.00021554097,0.00009121665,0.000015460708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051981242,0.0004338017,0.15131159,0.00021049788,0.00023313175,0.00006176344,0.0072159036,0.49822178,0.008664372,0.044317454,0.0064461464,0.28283158],"study_design_scores_gemma":[0.000132462,0.00003323903,0.0030915865,0.00004281239,0.0000032591065,0.000009131831,0.0000043995537,0.9932856,0.0015255021,0.00021201093,0.001496687,0.00016332556],"about_ca_topic_score_codex":0.000028539149,"about_ca_topic_score_gemma":0.0000013760673,"teacher_disagreement_score":0.4950638,"about_ca_system_score_codex":0.00002303307,"about_ca_system_score_gemma":0.00004065042,"threshold_uncertainty_score":0.5794124},"labels":[],"label_agreement":null},{"id":"W2740692692","doi":"10.1007/978-3-319-64203-1_7","title":"NVIDIA Jetson Platform Characterization","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Central processing unit; Frequency scaling; Multi-core processor; Scaling; Floating point; Multiplication (music); Matrix multiplication; Parallel computing; Power (physics); Reduction (mathematics); ARM architecture; Embedded system; Operating system","score_opus":0.024061243784927105,"score_gpt":0.2603455689629966,"score_spread":0.2362843251780695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740692692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035505363,0.00011685855,0.9856865,0.00055863865,0.0015760541,0.00034176244,0.0000052675978,0.00047249996,0.0112069305],"genre_scores_gemma":[0.08706317,0.00027021387,0.90615255,0.0017006808,0.00096001517,0.000016959064,0.00005172603,0.00007499731,0.0037096944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996632,0.000020319301,0.0005094989,0.001414854,0.0008239698,0.00059936167],"domain_scores_gemma":[0.99667305,0.00016061748,0.00061399664,0.0021076424,0.0002775739,0.00016711993],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007997423,0.0005226798,0.00051432924,0.00082793663,0.0005979708,0.0012855857,0.0047306377,0.00041135174,0.000022243483],"category_scores_gemma":[0.00010700412,0.0005031066,0.00012722082,0.00021723306,0.00045715214,0.0012327645,0.0014968503,0.0006848911,0.0000864595],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040242217,0.000021534412,0.00004472533,0.000026363405,0.000008251679,0.00005059528,0.0004296595,0.009785473,0.0002477018,0.022239903,0.00004069818,0.9671011],"study_design_scores_gemma":[0.00021953868,0.0001382105,0.00036405574,0.000480487,0.00000597238,0.000057038083,2.1303126e-8,0.88781685,0.0027110877,0.099627696,0.0077095386,0.00086948683],"about_ca_topic_score_codex":0.000011115334,"about_ca_topic_score_gemma":0.000013216383,"teacher_disagreement_score":0.9662316,"about_ca_system_score_codex":0.00025272873,"about_ca_system_score_gemma":0.0004682616,"threshold_uncertainty_score":0.99975115},"labels":[],"label_agreement":null},{"id":"W2741420915","doi":"10.1109/asap.2017.7995283","title":"A fast and accurate logarithm accelerator for scientific applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Lookup table; Thrashing; Parallel computing; Logarithm; Bottleneck; Polynomial; Interpolation (computer graphics); Elementary function; Cache; Table (database); Single-precision floating-point format; Arithmetic; Computational science; Algorithm; Embedded system; Mathematics; Programming language; Artificial intelligence","score_opus":0.04638744491632563,"score_gpt":0.3182489311315415,"score_spread":0.2718614862152159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741420915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030967058,0.00002358622,0.9941257,0.0009368735,0.00008517645,0.00029234937,0.0000027841375,0.0002891346,0.003934681],"genre_scores_gemma":[0.3022963,0.00000636042,0.6947128,0.00013414229,0.000038424034,0.00013109433,0.0000026414289,0.000004223379,0.0026739636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999399,0.000007239117,0.00009433863,0.00030266104,0.00006630069,0.00013044283],"domain_scores_gemma":[0.9990168,0.00003175186,0.00008584966,0.0006816458,0.00012842393,0.000055518114],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00020650729,0.000062538835,0.000068882284,0.000053404532,0.0012769676,0.0014067284,0.000845815,0.000029471737,0.0000025109937],"category_scores_gemma":[0.000029520985,0.000054761986,0.000021242662,0.000059513015,0.000094456336,0.00045273674,0.00030141478,0.000031844713,0.000007975794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041056646,0.00009630951,0.0008368792,0.000033202923,0.000017484334,9.544068e-7,0.00031206835,0.0003811893,0.00089340267,0.6526441,0.018557027,0.32622328],"study_design_scores_gemma":[0.0002974942,0.000033167795,0.0014627692,0.000007965634,0.0000031668924,0.0000052812675,0.000006948956,0.9189903,0.005571746,0.016164027,0.057260368,0.00019672501],"about_ca_topic_score_codex":0.0000050265267,"about_ca_topic_score_gemma":0.000004655921,"teacher_disagreement_score":0.91860914,"about_ca_system_score_codex":0.000006533814,"about_ca_system_score_gemma":0.000036054378,"threshold_uncertainty_score":0.9996299},"labels":[],"label_agreement":null},{"id":"W2743410165","doi":"10.1109/isie.2017.8001406","title":"Tensor product-based model transformation for position control of magnetic levitation systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Magnetic levitation; Levitation; Position (finance); Transformation (genetics); Tensor product; Control theory (sociology); Tensor (intrinsic definition); Computer science; Control (management); Mathematics; Engineering; Mechanical engineering; Artificial intelligence; Magnet; Geometry; Pure mathematics","score_opus":0.022590877331054034,"score_gpt":0.26784118230977655,"score_spread":0.24525030497872252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743410165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000790581,0.000045054683,0.9957189,0.0013675041,0.000081413964,0.0007200264,0.000007023973,0.00018475972,0.0010847577],"genre_scores_gemma":[0.7815065,0.0000018869267,0.21824154,0.00006149596,0.000013324727,0.000055889024,0.000006611601,0.0000035068874,0.000109261586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935454,0.000027485814,0.00023222833,0.00015734501,0.00012827027,0.00010015415],"domain_scores_gemma":[0.9990232,0.00003625413,0.00019993522,0.0004017347,0.00031552292,0.000023353308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088217,0.00007036959,0.000120283265,0.000076357304,0.00019939183,0.00016397177,0.00036463252,0.000032478718,5.020854e-7],"category_scores_gemma":[0.000048283444,0.000062346226,0.00004519822,0.00003523921,0.0000229266,0.00047514224,0.000008589507,0.000024539426,0.0000011727509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029167246,0.000055498513,0.000039713777,0.00013777956,0.000005432818,9.547761e-8,0.00018556861,0.8911166,0.0037500695,0.0960356,0.0004445046,0.0081999665],"study_design_scores_gemma":[0.0006263186,0.00013268054,0.00018866447,0.00003053196,0.0000074252375,8.852779e-7,0.0000031044722,0.9899636,0.00773952,0.0011975097,0.000032796357,0.000076994045],"about_ca_topic_score_codex":0.0000177689,"about_ca_topic_score_gemma":0.0000013471571,"teacher_disagreement_score":0.7807159,"about_ca_system_score_codex":0.000016085258,"about_ca_system_score_gemma":0.000044968077,"threshold_uncertainty_score":0.2542405},"labels":[],"label_agreement":null},{"id":"W2751058182","doi":"","title":"Janus: A Post-processor for VecTor Analysis Software","year":2013,"lang":"en","type":"dissertation","venue":"Library and Archives Canada (Government of Canada)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Janus; Computer science; Software; Software engineering; Programming language","score_opus":0.00336427766453478,"score_gpt":0.16749185230623007,"score_spread":0.16412757464169528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751058182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031547043,0.0031759301,0.8164369,0.0084611215,0.0018496724,0.0026177666,0.001547429,0.000572688,0.13379143],"genre_scores_gemma":[0.55528504,0.00027777176,0.34171587,0.0026727563,0.0001457411,0.00020424507,0.0008109497,0.00008074389,0.09880686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777985,0.000037935813,0.0003611451,0.0004375363,0.0010979194,0.00028564347],"domain_scores_gemma":[0.99880284,0.00028761613,0.00037510035,0.00034074683,0.0000052674154,0.00018840331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000011393184,0.00026473758,0.00042697776,0.00009504203,0.00020120427,0.00009879851,0.00073673803,0.000066189874,0.000013943038],"category_scores_gemma":[0.000013188032,0.0002588318,0.00009240564,0.00026737235,0.00001891433,0.00041400723,0.00010334092,0.00012784237,2.3073037e-9],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002094528,0.00043289753,0.010763156,0.0081752185,0.0077033183,0.00015612447,0.004031769,0.018776,0.011462493,0.66347617,0.04271044,0.2302179],"study_design_scores_gemma":[0.0013915091,0.0006778203,0.09524337,0.00089257926,0.0009994989,0.00000644593,0.0032655282,0.62425244,0.22705841,0.0100689735,0.032839105,0.003304332],"about_ca_topic_score_codex":0.002090071,"about_ca_topic_score_gemma":0.016548948,"teacher_disagreement_score":0.65340716,"about_ca_system_score_codex":0.0000070771716,"about_ca_system_score_gemma":0.001978422,"threshold_uncertainty_score":0.9999864},"labels":[],"label_agreement":null},{"id":"W2751901133","doi":"10.1145/3124452","title":"MiCOMP","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Horizon 2020 Framework Programme; City University of New York","keywords":"Computer science; Compiler; Optimizing compiler; Parallel computing; Heuristics; Speedup; Program optimization; Code (set theory); Sequence (biology); Set (abstract data type); Algorithm; Programming language","score_opus":0.016976133347568218,"score_gpt":0.26363595127099554,"score_spread":0.2466598179234273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751901133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002776965,0.000032436226,0.99264544,0.004301288,0.0001364148,0.00012649503,0.0000053147446,0.00038330982,0.0020915961],"genre_scores_gemma":[0.29986352,0.0001329688,0.6992134,0.0004175422,0.000022433007,0.000014125281,0.0000031454654,0.000010256029,0.00032263272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991825,0.00004191726,0.0001432091,0.00033587826,0.00013614363,0.00016035387],"domain_scores_gemma":[0.9985555,0.00005589973,0.000105751824,0.0011550016,0.000052535084,0.00007535522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010526259,0.0001393271,0.00012021207,0.00013611217,0.0010364425,0.0004210682,0.000958884,0.0000729724,0.000015299715],"category_scores_gemma":[0.00003832119,0.00012790502,0.000047815967,0.00008618621,0.00006707256,0.00029740855,0.000038129994,0.00017485778,0.000005445321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009257702,0.000037155645,0.000018147543,0.00000447501,0.000011186316,0.0000016502357,0.00018529405,0.796595,0.00002770055,0.0010861149,0.00005728866,0.20196672],"study_design_scores_gemma":[0.0004525917,0.00013185108,0.0003922858,0.000037982536,0.000012738689,0.000033114135,0.0000056343815,0.98597825,0.0019717338,0.008091355,0.0026181643,0.00027427537],"about_ca_topic_score_codex":0.000010007054,"about_ca_topic_score_gemma":0.000012267978,"teacher_disagreement_score":0.29958582,"about_ca_system_score_codex":0.0000127097455,"about_ca_system_score_gemma":0.000021447355,"threshold_uncertainty_score":0.7971582},"labels":[],"label_agreement":null},{"id":"W2751908113","doi":"10.1145/3086504","title":"Fast Power and Energy Management for Future Many-Core Systems","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Center for Discrete Mathematics and Theoretical Computer Science; National Science Foundation","keywords":"Computer science; Frequency scaling; Power management; Power budget; Power (physics); Flexibility (engineering); Server; Multi-core processor; Queueing theory; Set (abstract data type); Efficient energy use; Distributed computing; Energy (signal processing); Electric power system; Real-time computing; Parallel computing; Operating system; Computer network; Electrical engineering; Engineering","score_opus":0.051299590729460554,"score_gpt":0.30865910391129947,"score_spread":0.2573595131818389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751908113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09121295,0.00048414894,0.90631086,0.00013310056,0.00096396275,0.00032431923,0.0000037094028,0.00013557113,0.0004313576],"genre_scores_gemma":[0.95831,0.00029031554,0.041086968,0.000021388048,0.00009246741,0.00005349656,0.0000034870811,0.0000131908755,0.00012865043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841714,0.00008059164,0.00043071806,0.0003992055,0.00046988603,0.00020246286],"domain_scores_gemma":[0.9982195,0.00006530028,0.00032420177,0.0008628698,0.00046621688,0.00006190804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017120488,0.00018265442,0.00025683478,0.00020034109,0.001073562,0.00036767792,0.0005909014,0.00009589977,5.128331e-7],"category_scores_gemma":[0.000014566293,0.00017304844,0.00005121005,0.00007849858,0.00003792095,0.0003404827,0.000041215837,0.000097371194,5.2726665e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011889141,0.000021626138,0.000049926904,0.00012986628,0.000037381848,1.1377339e-7,0.00045172832,0.8936643,0.000003988398,0.0048664883,0.000019503072,0.10074319],"study_design_scores_gemma":[0.00064130005,0.00015529104,0.0003043605,0.00039655273,0.000042175772,0.000013021309,0.00017797764,0.9976888,0.000031686097,0.00025699384,0.00010937464,0.00018249557],"about_ca_topic_score_codex":0.00004492986,"about_ca_topic_score_gemma":9.195616e-7,"teacher_disagreement_score":0.8670971,"about_ca_system_score_codex":0.00004110942,"about_ca_system_score_gemma":0.000036498324,"threshold_uncertainty_score":0.825708},"labels":[],"label_agreement":null},{"id":"W2754990314","doi":"10.1109/hpcs.2017.69","title":"Optimum Power-Performance GPU Configuration Prediction Based on Code Attributes","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid","keywords":"Computer science; Parallel computing; CUDA; Code (set theory); Power (physics); Parallelism (grammar); General-purpose computing on graphics processing units; Execution time; Speedup; Graphics; Computer graphics (images); Programming language","score_opus":0.024885072105707447,"score_gpt":0.26478469605283184,"score_spread":0.23989962394712439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754990314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030324643,0.0000039581396,0.94423664,0.0020801162,0.000300967,0.00013866312,0.0000039531606,0.0008535754,0.049349666],"genre_scores_gemma":[0.90222013,0.00000960297,0.096401505,0.00059760874,0.000035790454,0.000011960544,0.0000104775345,0.0000057405205,0.00070717564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906456,0.00003263277,0.0001847168,0.0003029648,0.00023453636,0.00018056658],"domain_scores_gemma":[0.998658,0.000046492467,0.00017015955,0.0009295276,0.00013640468,0.000059403723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030253176,0.000118135125,0.0001064293,0.00008454208,0.00064172235,0.00047501494,0.0008497133,0.000070346345,0.000029501698],"category_scores_gemma":[0.000078884106,0.00010436152,0.00003708,0.000070546426,0.0000425223,0.0006664672,0.00008609195,0.00009874416,0.000061693645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010939636,0.00053218665,0.023054713,0.000054489177,0.00004233337,0.000014639947,0.00033462374,0.68226105,0.0017149312,0.11134129,0.11665083,0.06388954],"study_design_scores_gemma":[0.00026060495,0.00022964498,0.015708504,0.000031351112,0.0000014619768,0.0000015485124,9.872296e-7,0.96075785,0.019856514,0.00014075538,0.0028923906,0.000118373224],"about_ca_topic_score_codex":0.000006793534,"about_ca_topic_score_gemma":7.281079e-7,"teacher_disagreement_score":0.8991877,"about_ca_system_score_codex":0.000035195713,"about_ca_system_score_gemma":0.000051061415,"threshold_uncertainty_score":0.49356744},"labels":[],"label_agreement":null},{"id":"W2755550711","doi":"10.5281/zenodo.889713","title":"odarbelaeze/vegas-lattice-rs: 0.13.0","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Las vegas; Geology; Geography; Archaeology","score_opus":0.025895134550951205,"score_gpt":0.2621246386748638,"score_spread":0.23622950412391258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755550711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005430311,0.00010036979,0.6977634,0.0016492249,0.0001250368,0.00020182153,0.000008551878,0.0027869123,0.29682165],"genre_scores_gemma":[0.83406186,0.00027645685,0.14842957,0.002931847,0.00025682207,2.1128801e-7,0.0005329135,0.0013510894,0.012159247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831253,0.00028788758,0.00026695916,0.00049518794,0.0002843132,0.00035311817],"domain_scores_gemma":[0.9984836,0.000039229773,0.00009009889,0.00077139976,0.00050073845,0.000114959155],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006808167,0.0001425078,0.0001436033,0.00037112564,0.0018988147,0.0013504812,0.0023895341,0.000072067116,0.0008197955],"category_scores_gemma":[0.0004132983,0.00015290035,0.00005667937,0.0011922297,0.00009754889,0.0004029343,0.0020663047,0.0002504417,0.0021774704],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017530794,0.00017113728,0.000008049869,0.000055545075,0.00004979653,0.000013592638,0.00071716984,0.0010484596,0.00063611794,0.21613128,0.48527604,0.29587528],"study_design_scores_gemma":[0.00032452645,0.00009788839,0.00024485798,0.000050324674,0.0000065145805,0.00003229376,0.000032102438,0.033859584,0.0009945815,0.0042499485,0.95992225,0.000185109],"about_ca_topic_score_codex":0.000011257474,"about_ca_topic_score_gemma":1.18315874e-7,"teacher_disagreement_score":0.8335188,"about_ca_system_score_codex":0.000106253996,"about_ca_system_score_gemma":0.000008698895,"threshold_uncertainty_score":0.99968624},"labels":[],"label_agreement":null},{"id":"W2759010960","doi":"10.1109/waccpd.2016.009","title":"OpenACC Cache Directive: Opportunities and Optimizations","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; CUDA; Parallel computing; Compiler; Cache algorithms; Smart Cache; Operating system; Cache pollution; Cache invalidation; Cache coloring; CPU cache","score_opus":0.043506819199233854,"score_gpt":0.2685195588531648,"score_spread":0.22501273965393095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759010960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018137645,0.00006203122,0.9382817,0.004253798,0.000047485097,0.00006429395,9.2530297e-7,0.0006244441,0.056483954],"genre_scores_gemma":[0.21355936,0.000701985,0.7624452,0.0006938559,0.000027005803,0.000019902185,9.693971e-7,0.000009244023,0.022542503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944705,0.000045313558,0.000106613465,0.00020040372,0.000079346486,0.000121271536],"domain_scores_gemma":[0.9994774,0.00009810257,0.00003461786,0.00024309197,0.00007791424,0.00006886038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014439036,0.00007385448,0.00007769775,0.000078787576,0.00011981329,0.0001040751,0.00029968334,0.000029399016,0.000037241465],"category_scores_gemma":[0.000042037675,0.00004649092,0.000015735584,0.00011121153,0.000044523535,0.00045284128,0.0002272629,0.000022622171,0.000007973822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002097342,0.00003990393,0.000429311,0.000003763659,0.000017493487,0.0000065346717,0.00035355805,0.0005470984,0.0001795778,0.7625006,0.01940077,0.21651931],"study_design_scores_gemma":[0.0021265843,0.00039012724,0.005330411,0.00022112209,0.000024761777,0.00018292543,0.00025144717,0.72008353,0.026028994,0.043843184,0.19959505,0.0019218824],"about_ca_topic_score_codex":0.000011620459,"about_ca_topic_score_gemma":0.0000020514224,"teacher_disagreement_score":0.7195364,"about_ca_system_score_codex":0.000013726901,"about_ca_system_score_gemma":0.00003475334,"threshold_uncertainty_score":0.18958448},"labels":[],"label_agreement":null},{"id":"W2759804946","doi":"10.1109/nanoarch.2017.8053709","title":"Design and operational assessment of an intra-cell hybrid L2 cache","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cache; Computer science; Macrocell; Dram; Static random-access memory; Phase-change memory; CPU cache; Cache pollution; Embedded system; Cache coloring; Cache algorithms; Computer architecture; Parallel computing; Computer hardware; Operating system; Engineering","score_opus":0.030579034606433044,"score_gpt":0.30914692114339337,"score_spread":0.27856788653696035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759804946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008991532,0.000009943227,0.98373353,0.0003080575,0.000039573104,0.00008810939,3.40025e-7,0.000091616384,0.006737285],"genre_scores_gemma":[0.48892108,0.000005842424,0.51086605,0.000066528875,0.000007498642,0.000002113528,7.437515e-7,0.0000014340424,0.00012869468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994539,0.000058558217,0.00011658643,0.00017701654,0.000116217045,0.0000777282],"domain_scores_gemma":[0.9993444,0.000034132892,0.000082088925,0.0004198721,0.000074057265,0.000045421682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037671722,0.000058012007,0.000079665086,0.00003285988,0.00021201449,0.00026736886,0.00054520974,0.000018364708,0.000009524484],"category_scores_gemma":[0.000012839143,0.000049480564,0.000010759509,0.000018686052,0.00003959981,0.00042849552,0.00015379363,0.000044402335,8.5622605e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023002767,0.001423452,0.010709389,0.000089266905,0.000078169534,0.000052722324,0.0012702227,0.2582776,0.02521378,0.49277368,0.018900631,0.19118811],"study_design_scores_gemma":[0.00013684499,0.00008912767,0.0026028012,0.0000036250017,0.0000011975895,0.0000055453725,0.000001506083,0.9579458,0.03779908,0.0012722841,0.00007424544,0.00006792323],"about_ca_topic_score_codex":0.000029256713,"about_ca_topic_score_gemma":6.756972e-7,"teacher_disagreement_score":0.6996682,"about_ca_system_score_codex":0.000008341371,"about_ca_system_score_gemma":0.00007404678,"threshold_uncertainty_score":0.25782442},"labels":[],"label_agreement":null},{"id":"W2760016093","doi":"10.1109/ahs.2017.8046356","title":"Run-time adaptation method for mitigation of hardware faults and power budget variations in space-borne FPGA-based systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Embedded system; Field-programmable gate array; Overhead (engineering); Task (project management); Adaptation (eye); Design space exploration; Workload; Spare part; Distributed computing; Power (physics); Power budget; Real-time computing; Electric power system; Operating system; Engineering","score_opus":0.019152156199282996,"score_gpt":0.29401917326047716,"score_spread":0.27486701706119415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760016093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007830312,0.000027642924,0.9960067,0.0012318529,0.00009664314,0.00042511104,0.0000102324775,0.00014553322,0.0012732041],"genre_scores_gemma":[0.47309828,0.0000015656253,0.5266426,0.000027732158,0.0000079036445,0.000024469997,0.000008901159,0.000004080218,0.00018445108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991122,0.00009494359,0.00026729613,0.00026378312,0.00013651427,0.00012528722],"domain_scores_gemma":[0.9987522,0.00021783153,0.00029886723,0.00044009843,0.0002504711,0.000040537372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006675146,0.00009576518,0.00017757049,0.00015692475,0.000181651,0.00016648446,0.00034388056,0.0000739724,0.0000026864423],"category_scores_gemma":[0.00024317906,0.00009212848,0.000033851633,0.00010643561,0.000024290128,0.00039421,0.000062282255,0.00004435176,0.0000015785122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007514875,0.0003186721,0.001866951,0.00030125544,0.000053913816,0.000003020727,0.003364421,0.41876802,0.005707593,0.5457762,0.0036087818,0.020156026],"study_design_scores_gemma":[0.00051326834,0.000073063966,0.0043871654,0.000060155806,0.0000046101013,8.946438e-7,0.000016049868,0.9876891,0.0050221444,0.001956924,0.00016930468,0.000107348336],"about_ca_topic_score_codex":0.00025505942,"about_ca_topic_score_gemma":0.000015645055,"teacher_disagreement_score":0.5689211,"about_ca_system_score_codex":0.000026163087,"about_ca_system_score_gemma":0.00007220507,"threshold_uncertainty_score":0.37568903},"labels":[],"label_agreement":null},{"id":"W2761010195","doi":"10.23919/fpl.2017.8056785","title":"FISH: Linux system calls for FPGA accelerators","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Operating system; Embedded system; System call; Software; Linux kernel; Kernel (algebra); Interface (matter); Fish <Actinopterygii>; Central processing unit","score_opus":0.039033676277207115,"score_gpt":0.298075772034994,"score_spread":0.2590420957577869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761010195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080745283,0.000008048315,0.96997535,0.000767924,0.00035210315,0.00019745925,0.0000018237382,0.0009537218,0.026936093],"genre_scores_gemma":[0.63001776,0.0000034065945,0.3677198,0.00034884576,0.000095188494,0.000028588043,0.0000012686571,0.000006935123,0.001778183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925995,0.000016746622,0.00016047149,0.00026578156,0.000108313194,0.00018874476],"domain_scores_gemma":[0.99874765,0.000050225364,0.00013020831,0.0008785214,0.00012573165,0.00006764396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025278964,0.00009255831,0.00012749723,0.000045166576,0.0005504394,0.0007145936,0.0015134285,0.00006066612,0.0000032323553],"category_scores_gemma":[0.00006442968,0.00007841309,0.0000613293,0.000040485626,0.000021687581,0.0003640283,0.0002675815,0.000047462203,0.000016331938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017150136,0.00011977465,0.0011892777,0.00019856653,0.00006512416,0.000017967512,0.00058715243,0.003029356,0.00013161302,0.63619536,0.1942198,0.16422884],"study_design_scores_gemma":[0.00054220983,0.00007986353,0.0011904654,0.000058941532,0.0000046786945,0.000009374023,0.000012039959,0.9396112,0.019735835,0.0011270881,0.03730795,0.0003203631],"about_ca_topic_score_codex":0.000033568638,"about_ca_topic_score_gemma":0.000004707756,"teacher_disagreement_score":0.93658185,"about_ca_system_score_codex":0.000028708106,"about_ca_system_score_gemma":0.000034404187,"threshold_uncertainty_score":0.68908423},"labels":[],"label_agreement":null},{"id":"W2761012364","doi":"10.1109/icnets2.2017.8067887","title":"Token based energy aware scheduling algorithms for heterogeneous multi-core","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Security token; Scheduling (production processes); Dynamic priority scheduling; Distributed computing; Fair-share scheduling; Round-robin scheduling; Fixed-priority pre-emptive scheduling; Two-level scheduling; Rate-monotonic scheduling; Efficient energy use; Multi-core processor; Energy consumption; Parallel computing; Algorithm; Mathematical optimization; Computer network; Quality of service; Engineering","score_opus":0.0791476886955363,"score_gpt":0.33038424993995064,"score_spread":0.25123656124441435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761012364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019095394,0.000039234157,0.9979021,0.00046775007,0.00023349113,0.00011668237,0.0000028037332,0.00070445356,0.00034256114],"genre_scores_gemma":[0.3104114,0.000005037881,0.6885086,0.0005015086,0.000055878943,0.000028568093,0.000004815062,0.000009605301,0.000474557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904156,0.00001656748,0.00017659969,0.00037907148,0.00012662601,0.00025955896],"domain_scores_gemma":[0.9986387,0.00005579602,0.0001425715,0.0009202049,0.00015488826,0.00008785318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017147342,0.00013794067,0.00014626473,0.000069206035,0.000636243,0.0004224412,0.0012650104,0.00007728161,0.0000058571827],"category_scores_gemma":[0.000049782862,0.00012515445,0.00010058537,0.00004449204,0.0000363781,0.00024079543,0.00025619235,0.000048796213,0.000004347124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027323636,0.0004029848,0.0010605351,0.000064562686,0.00008185057,0.000049675033,0.00020653152,0.5727306,0.0005113756,0.025638403,0.0041154977,0.39511064],"study_design_scores_gemma":[0.00042209495,0.00005175976,0.00004256586,0.000015964268,0.000002343281,0.0000042073466,0.000001237632,0.98072237,0.015814282,0.0005687689,0.0021747495,0.00017967036],"about_ca_topic_score_codex":0.00008847697,"about_ca_topic_score_gemma":0.00001469739,"teacher_disagreement_score":0.40799174,"about_ca_system_score_codex":0.000022541677,"about_ca_system_score_gemma":0.000058495505,"threshold_uncertainty_score":0.510365},"labels":[],"label_agreement":null},{"id":"W2761125724","doi":"10.1145/3126519","title":"Managing the Performance/Error Tradeoff of Floating-point Intensive Applications","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"Office of Science; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Computer science; Speedup; Floating point; Process (computing); Implementation; Point (geometry); Computer engineering; Cache; Real-time computing; Artificial intelligence; Algorithm; Parallel computing","score_opus":0.03012356736936864,"score_gpt":0.2877324534114762,"score_spread":0.2576088860421075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761125724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050576287,0.000082332765,0.989881,0.0015346555,0.0006500525,0.0006413182,0.0000031551208,0.00054742565,0.0016024546],"genre_scores_gemma":[0.9322585,0.00003136212,0.06723803,0.00015348608,0.00008936193,0.000045575147,0.0000016002317,0.000020284107,0.00016183117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806494,0.00014394455,0.00060272426,0.00048644457,0.00036188393,0.00034008757],"domain_scores_gemma":[0.99559206,0.000335655,0.00066909444,0.0029230127,0.0004048407,0.000075327625],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00078027206,0.00023840668,0.00033223393,0.00018888924,0.0019798153,0.0004726873,0.003347506,0.000090478075,0.0000025796012],"category_scores_gemma":[0.00007445728,0.00019177969,0.00015489575,0.00028439838,0.00016449983,0.000380273,0.00010327901,0.00037940152,0.00001878025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015023896,0.00014720546,0.00014750316,0.00018514734,0.00014940645,0.0000033981664,0.0056590564,0.8482314,0.00028654735,0.008581887,0.00043327102,0.13616021],"study_design_scores_gemma":[0.00029817873,0.00010994533,0.0002525612,0.00027392508,0.000022352338,0.00004835475,0.0007235539,0.9937647,0.0031584166,0.0005804161,0.0005289017,0.00023870202],"about_ca_topic_score_codex":0.000095136464,"about_ca_topic_score_gemma":0.0000019746246,"teacher_disagreement_score":0.92720085,"about_ca_system_score_codex":0.000063296335,"about_ca_system_score_gemma":0.0000614127,"threshold_uncertainty_score":0.9993195},"labels":[],"label_agreement":null},{"id":"W2761175401","doi":"10.1109/cibcb.2017.8058548","title":"An algebraic generalization for graph and tensor-based neural networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Western University","funders":"","keywords":"Computer science; Theoretical computer science; Artificial neural network; Graph; Linear algebra; Algebra over a field; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.022051840559822383,"score_gpt":0.2856189482948429,"score_spread":0.2635671077350205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761175401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065545514,0.000031479034,0.991858,0.000664782,0.00011230511,0.00014982773,4.4609897e-7,0.00042100018,0.00020762409],"genre_scores_gemma":[0.666654,0.0000056775425,0.3325811,0.00064020976,0.000045629113,0.000010779224,0.00000581377,0.0000050407643,0.000051716175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.000028596614,0.00010533,0.00025456963,0.00006408687,0.000146817],"domain_scores_gemma":[0.9991762,0.000027558255,0.00009097947,0.00055526523,0.000085697095,0.00006429675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016319948,0.00008267876,0.000083386585,0.000055676668,0.0005128451,0.000555893,0.0005612062,0.000048358743,0.0000016234492],"category_scores_gemma":[0.000024963218,0.00007214395,0.000028265466,0.000047869158,0.000040001083,0.00041128747,0.000059660884,0.0000328189,2.2852802e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014330751,0.000073563024,0.01322024,0.000014395199,0.000010797895,0.0000021644619,0.00007771354,0.7576763,0.00016267302,0.14955483,0.0048425402,0.07435045],"study_design_scores_gemma":[0.00022211525,0.00008653473,0.0041649784,0.0000031282314,0.0000021435262,0.000001424752,6.253103e-7,0.9920162,0.00038296,0.0028826187,0.00012959208,0.00010768265],"about_ca_topic_score_codex":0.00002194965,"about_ca_topic_score_gemma":0.0000062668773,"teacher_disagreement_score":0.66009945,"about_ca_system_score_codex":0.0000042138045,"about_ca_system_score_gemma":0.000010087488,"threshold_uncertainty_score":0.5360489},"labels":[],"label_agreement":null},{"id":"W2762605937","doi":"10.1145/3133879","title":"The VM already knew that: leveraging compile-time knowledge to optimize gradual typing","year":2017,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; Compile time; Programmer; Soundness; JavaScript; Code (set theory); Compiler; Object (grammar); Parallel computing; Artificial intelligence","score_opus":0.035711187798949794,"score_gpt":0.30850801259024285,"score_spread":0.2727968247912931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762605937","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6262939,0.0056902026,0.12807901,0.123877,0.0038246147,0.008023119,0.000014844049,0.0088713,0.09532601],"genre_scores_gemma":[0.80087346,0.000020391806,0.19719,0.00023724405,0.00012367546,0.0000514654,5.308301e-7,0.000026848886,0.0014764072],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984575,0.000025147761,0.00027837354,0.00044946143,0.00032225606,0.00046727812],"domain_scores_gemma":[0.99754,0.00018998446,0.00047919678,0.0014221758,0.0002685937,0.00010005604],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001034436,0.00023931143,0.0002591835,0.00009579308,0.0016002656,0.001347448,0.008086819,0.000068974376,0.0000013992544],"category_scores_gemma":[0.0017733526,0.00015019497,0.00013672777,0.00023635245,0.00016101846,0.00035541775,0.0034890417,0.0002576232,0.000023226808],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010434693,0.0003982994,0.008273966,0.00021211655,0.00021974147,0.0000048909096,0.014330605,0.0007571725,0.0034555346,0.052412864,0.032790303,0.88704014],"study_design_scores_gemma":[0.005762378,0.0026391272,0.052758716,0.009258096,0.00034954768,0.00029959044,0.005354677,0.20068397,0.48840597,0.049377218,0.17894071,0.0061699864],"about_ca_topic_score_codex":0.000045533096,"about_ca_topic_score_gemma":0.0000023305379,"teacher_disagreement_score":0.88087016,"about_ca_system_score_codex":0.000046929257,"about_ca_system_score_gemma":0.00003702522,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W2763812888","doi":"10.1145/3132402.3132428","title":"Task replication and control for highly parallel in-memory stores","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Replication (statistics); Von Neumann architecture; Task (project management); Architecture; Computer architecture; Class (philosophy); Distributed computing; Control (management); Parallel computing; Operating system; Embedded system; Engineering","score_opus":0.015234232984545732,"score_gpt":0.2611896718994404,"score_spread":0.2459554389148947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763812888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.671868,0.00045307356,0.22349605,0.050215673,0.0060718497,0.0050550182,0.000055301934,0.00065778405,0.042127203],"genre_scores_gemma":[0.9946797,0.000021648631,0.0038947193,0.00017054504,0.00014742099,0.00014488984,9.412752e-7,0.000009536498,0.00093062065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877805,0.000011309886,0.0003466616,0.00040264407,0.00032589413,0.0001354551],"domain_scores_gemma":[0.9983937,0.000097494776,0.00067292363,0.00043196682,0.00036689697,0.000037028523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008443687,0.00012289059,0.00018829605,0.00009009151,0.00023065197,0.00039855822,0.0020323459,0.000064772146,2.702071e-7],"category_scores_gemma":[0.00030810953,0.00009549798,0.00006276645,0.00004639455,0.000068842994,0.0004401419,0.00023246554,0.00009021782,0.0000011296409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000727786,0.0006277694,0.06878189,0.00081866124,0.00035102386,0.000002718318,0.0033394683,0.041702606,0.23805852,0.60849637,0.02790386,0.00918935],"study_design_scores_gemma":[0.0032987015,0.00030809842,0.025067098,0.000841994,0.00002260219,0.000043629436,0.00010788694,0.90903026,0.049871616,0.0058600167,0.0050397115,0.00050839153],"about_ca_topic_score_codex":0.000101790465,"about_ca_topic_score_gemma":0.0000020046123,"teacher_disagreement_score":0.86732763,"about_ca_system_score_codex":0.00007588403,"about_ca_system_score_gemma":0.000022196284,"threshold_uncertainty_score":0.38942945},"labels":[],"label_agreement":null},{"id":"W2764252782","doi":"10.23919/fpl.2017.8056766","title":"TAIGA: A new RISC-V soft-processor framework enabling high performance CPU architectural features","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx","keywords":"Computer science; Pipeline (software); Field-programmable gate array; Embedded system; ARM architecture; Reduced instruction set computing; Computer architecture; Coprocessor; Processor design; Bridging (networking); Instruction set; Computer hardware; Operating system","score_opus":0.016834565088674053,"score_gpt":0.2709465471875301,"score_spread":0.25411198209885605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764252782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022284325,0.00014554444,0.9684518,0.003069445,0.00040082715,0.00012493184,4.5398914e-7,0.0011002556,0.004422396],"genre_scores_gemma":[0.55412847,0.000025479527,0.44048238,0.00046987206,0.0002020189,0.000005195653,9.3100954e-7,0.00000893429,0.0046767425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856824,0.000026816957,0.00021495917,0.00048582465,0.00029601104,0.0004081763],"domain_scores_gemma":[0.9982264,0.00009123054,0.00022244638,0.0012060801,0.000101683065,0.00015216332],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021644685,0.00021239948,0.0002127066,0.00011337646,0.0009526674,0.0011229592,0.0024687424,0.00012862518,0.000040455074],"category_scores_gemma":[0.00024847742,0.00016969547,0.00006494022,0.000108373046,0.00007114082,0.0006723815,0.00065132533,0.0003880922,0.00008625667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056716683,0.0001054513,0.0045106015,0.00011313229,0.00007546581,0.000028820667,0.0029024489,0.05475649,0.00022946914,0.07406028,0.033912685,0.8292484],"study_design_scores_gemma":[0.0010486224,0.00039485554,0.05223503,0.0004937396,0.000021254427,0.00016623756,0.000024611736,0.79466236,0.043183394,0.09626843,0.009882586,0.0016188732],"about_ca_topic_score_codex":0.0001754787,"about_ca_topic_score_gemma":0.000008667306,"teacher_disagreement_score":0.82762957,"about_ca_system_score_codex":0.00002336845,"about_ca_system_score_gemma":0.00011464563,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W2765149243","doi":"10.1109/pact.2017.37","title":"SAM: Optimizing Multithreaded Cores for Speculative Parallelism","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Speculative multithreading; Speculation; Multithreading; Computer science; Speculative execution; Parallel computing; Commit; Transactional memory; Speedup; Parallelism (grammar); Thread (computing); Multi-core processor; Task parallelism; Out-of-order execution; Simultaneous multithreading; Distributed computing; Operating system; Programming language; Database transaction; Database","score_opus":0.05744971918940797,"score_gpt":0.3309524704106309,"score_spread":0.2735027512212229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765149243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054544484,0.000029462337,0.9794835,0.0012148265,0.00020081365,0.000279138,0.0000012871427,0.0005718837,0.017673662],"genre_scores_gemma":[0.22238325,0.000014038027,0.7757722,0.00022294346,0.00006159525,0.000025603402,0.0000022222484,0.000007454203,0.0015106706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990943,0.000020209704,0.00017532561,0.00034607248,0.0001244576,0.00023963675],"domain_scores_gemma":[0.9986705,0.00009464766,0.00018058161,0.00084696966,0.00013869442,0.000068570625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020786088,0.00012931372,0.00016345608,0.00005874875,0.00068129075,0.0005449573,0.0013087253,0.00005943721,0.000008611766],"category_scores_gemma":[0.00014706238,0.000111443,0.00008390566,0.000038661678,0.000065591834,0.0005050831,0.0003255095,0.000065073844,0.000013347775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037228932,0.00014223317,0.0010979539,0.000028522145,0.000083127954,0.000013875847,0.0016257874,0.043502994,0.00054681895,0.864962,0.029439805,0.058519658],"study_design_scores_gemma":[0.0005688725,0.00006286138,0.0016710536,0.000022317598,0.000003766979,0.000003868525,0.0000117448835,0.97235763,0.0060639074,0.01568129,0.003310154,0.00024253989],"about_ca_topic_score_codex":0.00005592685,"about_ca_topic_score_gemma":0.0000070236633,"teacher_disagreement_score":0.92885464,"about_ca_system_score_codex":0.000020296484,"about_ca_system_score_gemma":0.00002926671,"threshold_uncertainty_score":0.5255036},"labels":[],"label_agreement":null},{"id":"W2765340675","doi":"10.1145/3149412.3149422","title":"Scalable performance bounding under multiple constrained renewable resources","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bounding overwatch; Scalability; Computer science; Distributed computing; Database; Artificial intelligence","score_opus":0.027437842332083878,"score_gpt":0.2631654287142135,"score_spread":0.23572758638212962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765340675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039931115,0.000026514563,0.85984087,0.0006052033,0.00016467371,0.00007794743,3.058048e-7,0.0006888635,0.09866452],"genre_scores_gemma":[0.749177,0.000022624941,0.24420199,0.00018082219,0.000034977595,0.0000043323685,5.951622e-7,0.0000053061653,0.0063723517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990587,0.000025577696,0.00016612253,0.0003008986,0.00017034958,0.00027833646],"domain_scores_gemma":[0.9987422,0.000061315644,0.00014143437,0.00090638135,0.00007209041,0.000076568904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036605378,0.00011044839,0.00012736606,0.00007145778,0.0012630859,0.0009795105,0.0013156276,0.000055442815,0.00002262646],"category_scores_gemma":[0.00008874182,0.00009770969,0.00003637677,0.00008079757,0.00011788877,0.00075000164,0.0003955935,0.000079091544,0.00003331803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006168822,0.00050908513,0.20949335,0.0002497615,0.00017316191,0.0000440087,0.003131531,0.41808742,0.008206447,0.18748985,0.073123924,0.099429764],"study_design_scores_gemma":[0.00032292784,0.0000419597,0.0043026023,0.000046641628,0.0000017766447,0.000010624967,0.00001687372,0.97580224,0.010813093,0.001770072,0.006669843,0.00020133241],"about_ca_topic_score_codex":0.00023610219,"about_ca_topic_score_gemma":0.000023129307,"teacher_disagreement_score":0.70924586,"about_ca_system_score_codex":0.000026663893,"about_ca_system_score_gemma":0.00004460249,"threshold_uncertainty_score":0.97147626},"labels":[],"label_agreement":null},{"id":"W2765580993","doi":"","title":"Building a Better Tor Experimentation Platform from the Magic of Dynamic ELFs","year":2017,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"MAGIC (telescope); Computer science; Physics; Astronomy","score_opus":0.012487180886745589,"score_gpt":0.24295424928357395,"score_spread":0.23046706839682837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765580993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94274735,0.00017190228,0.05515945,0.0006294455,0.0003478884,0.0002351362,0.000019306968,0.00012764601,0.0005618824],"genre_scores_gemma":[0.49455014,0.0001758491,0.42078227,0.00006690782,0.00005715393,0.0000011070923,0.00040068864,0.000030728774,0.083935134],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.000041671232,0.0001410771,0.00032222774,0.00026689787,0.00015521368],"domain_scores_gemma":[0.99851596,0.00005963272,0.0005868102,0.0006654221,0.00013667384,0.00003549913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001299221,0.0001706481,0.00027390424,0.00013204072,0.00027138722,0.0000702342,0.0015554203,0.00016249219,0.000036595713],"category_scores_gemma":[0.000010449725,0.000161957,0.00013441575,0.00009223304,0.00006782233,0.00044083013,0.00014082275,0.00015875578,0.000008588786],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039143817,0.00034090225,0.0011907354,0.00043938414,0.0007583804,0.00006809869,0.6911378,0.0011553759,0.073211014,0.008403205,0.012972837,0.20993082],"study_design_scores_gemma":[0.005864099,0.0011241944,0.08529806,0.0042619696,0.000780988,0.00001344709,0.14656879,0.4875132,0.23195024,0.028774647,0.0039157593,0.00393457],"about_ca_topic_score_codex":0.015994994,"about_ca_topic_score_gemma":0.0026917872,"teacher_disagreement_score":0.544569,"about_ca_system_score_codex":0.000059802216,"about_ca_system_score_gemma":0.000060672744,"threshold_uncertainty_score":0.99055755},"labels":[],"label_agreement":null},{"id":"W2766389817","doi":"10.23638/lmcs-15(2:10)2019","title":"A Denotational Semantics for SPARC TSO","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Scheme for Promotion of Academic and Research Collaboration","keywords":"Denotational semantics of the Actor model; Normalisation by evaluation; Denotational semantics; Programming language; Computer science; Modular design; Semantics (computer science); Axiom; Principle of compositionality; Operational semantics; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.11159582628953735,"score_gpt":0.43319702869152665,"score_spread":0.3216012024019893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766389817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037795442,0.000118486976,0.99377084,0.0010218224,0.0029364126,0.00088158174,0.0000044415283,0.00048473774,0.0004036971],"genre_scores_gemma":[0.018062826,0.000025715935,0.98053974,0.0010058584,0.00021518685,0.00009015177,0.0000052844725,0.000013536093,0.00004170478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955815,0.00048524336,0.00071007875,0.0018221573,0.00069503987,0.00070599886],"domain_scores_gemma":[0.995829,0.0017641044,0.00037190362,0.0013769852,0.0004891377,0.00016887773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005800433,0.00037878682,0.00062136835,0.0006085263,0.0002202161,0.00086527114,0.0053092134,0.00031771688,0.0000042888933],"category_scores_gemma":[0.000632976,0.0003381685,0.00019504692,0.001203326,0.00038017918,0.00034119407,0.0057441974,0.0007054634,0.000010250838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008007434,0.00015261068,0.0003610267,0.00011941658,0.000009643109,0.000009248195,0.00037343748,0.66053134,0.00017118112,0.11524832,0.0003805415,0.22263522],"study_design_scores_gemma":[0.00017359089,0.00010510301,0.0012711162,0.000108648965,0.0000030865685,0.000010065297,7.4354875e-7,0.7942411,0.0008054601,0.20255709,0.00036859766,0.0003553976],"about_ca_topic_score_codex":0.000008077063,"about_ca_topic_score_gemma":7.248535e-7,"teacher_disagreement_score":0.22227982,"about_ca_system_score_codex":0.00018595034,"about_ca_system_score_gemma":0.0006377338,"threshold_uncertainty_score":0.999907},"labels":[],"label_agreement":null},{"id":"W2766748441","doi":"10.1145/3149412.3149415","title":"Execution Phase Prediction Based on Phase Precursors and Locality","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Locality; Computer science; Workload; Phase (matter); Overhead (engineering); Power (physics); Locality of reference; Real-time computing; Parallel computing; Operating system","score_opus":0.027967853739426955,"score_gpt":0.3297933651926018,"score_spread":0.3018255114531748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766748441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009928915,0.000007726547,0.9779475,0.00079533324,0.00013964863,0.0001472823,0.000004092834,0.00057888834,0.010450619],"genre_scores_gemma":[0.92918926,0.000008344842,0.07031428,0.0002550199,0.000033182525,0.000009130682,0.0000056001018,0.0000036164527,0.00018157954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922395,0.00005172021,0.00013585463,0.00030509438,0.00015688033,0.00012647404],"domain_scores_gemma":[0.9990509,0.000031957596,0.00010472513,0.0006769203,0.000056361816,0.00007911171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332573,0.000093345676,0.00008906078,0.00006687336,0.00044384695,0.000318774,0.00039059407,0.000053517775,0.000009365336],"category_scores_gemma":[0.000080796664,0.00008231414,0.000026270653,0.00004940161,0.000063448286,0.00040270024,0.000087517685,0.0000739862,0.0000060532093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035428113,0.0037315516,0.002476522,0.00006696248,0.000033523807,0.000025445686,0.00052872486,0.021042217,0.0010205428,0.081966616,0.036148436,0.85260516],"study_design_scores_gemma":[0.0015732514,0.00042487125,0.00052177033,0.000020845391,0.0000028833433,0.0000017578493,0.000001496213,0.9891111,0.0058848993,0.0009899861,0.0013772482,0.00008987972],"about_ca_topic_score_codex":0.000026329595,"about_ca_topic_score_gemma":0.0000011303453,"teacher_disagreement_score":0.9680689,"about_ca_system_score_codex":0.000022315415,"about_ca_system_score_gemma":0.000027164768,"threshold_uncertainty_score":0.34137568},"labels":[],"label_agreement":null},{"id":"W2767106296","doi":"10.1145/3232521","title":"CODA","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices; National Science Foundation","keywords":"Thread (computing); Scalability; Exploit; Multithreading; Scheduling (production processes); Data structure; CAS latency; Distributed memory; Shared memory","score_opus":0.012651797860617523,"score_gpt":0.2498807854999817,"score_spread":0.23722898763936417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767106296","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018811425,0.000029895707,0.99493116,0.0018501836,0.00013783171,0.00012847385,0.000004759258,0.0005899746,0.002139635],"genre_scores_gemma":[0.21731685,0.00008258002,0.7812621,0.0009625326,0.000047299498,0.0000138723835,0.0000040737896,0.000011287989,0.00029939422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991299,0.000058217076,0.0001552162,0.0003392297,0.00014656622,0.00017086454],"domain_scores_gemma":[0.99915564,0.00007261094,0.000051948788,0.00054713176,0.00009615106,0.00007650911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010653946,0.0001361837,0.00010622546,0.00020322255,0.00037938953,0.0001247477,0.00045049482,0.00007374688,0.0000414819],"category_scores_gemma":[0.00001833423,0.00012477081,0.000037206104,0.00042654248,0.00008351202,0.00016844565,0.000020287245,0.00014373247,0.000013015988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019197143,0.00005475801,0.000008380505,0.0000047374556,0.000015338253,0.0000011247922,0.00058664166,0.7662878,0.00005017443,0.0016436136,0.00018749398,0.2311407],"study_design_scores_gemma":[0.00034180007,0.00037292406,0.000056132292,0.000026674577,0.000011264117,0.00003727534,0.00000943892,0.9842404,0.0032268947,0.006432632,0.0049929586,0.00025157642],"about_ca_topic_score_codex":0.000004920739,"about_ca_topic_score_gemma":0.0000120535815,"teacher_disagreement_score":0.23088913,"about_ca_system_score_codex":0.0000143989,"about_ca_system_score_gemma":0.000025755402,"threshold_uncertainty_score":0.50880057},"labels":[],"label_agreement":null},{"id":"W2767423966","doi":"10.5281/zenodo.1045315","title":"nnadeau/pybotics: 0.4.1","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Installation; Computer science; Operating system","score_opus":0.046101555532518816,"score_gpt":0.27345563568743614,"score_spread":0.22735408015491732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767423966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071269716,0.000030359399,0.7878968,0.0018852231,0.000142017,0.00016483197,0.000009990969,0.00222498,0.20693307],"genre_scores_gemma":[0.9440531,0.00008169671,0.052882787,0.00032581596,0.00017976326,2.6845024e-8,0.000120506586,0.00065442274,0.0017018858],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871886,0.00014596811,0.0001751853,0.0003883764,0.0002744546,0.00029717386],"domain_scores_gemma":[0.9979909,0.000014209193,0.00015893379,0.0012967841,0.00039994976,0.00013921745],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005873576,0.000109321605,0.00010932302,0.0001409158,0.0053139273,0.0033621262,0.0040449197,0.000052852207,0.0007072375],"category_scores_gemma":[0.0005846472,0.00011555173,0.00004435049,0.00016070524,0.00013626281,0.0006071078,0.0027406332,0.00018154083,0.0030450611],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014541088,0.00015356009,0.00001254021,0.000035464767,0.000037957052,0.000033247583,0.0012472789,0.000838549,0.0008664469,0.2302755,0.30099666,0.46548826],"study_design_scores_gemma":[0.00027490026,0.000112750175,0.00077236746,0.000023752362,0.0000033421534,0.00007079711,0.00001748934,0.030486798,0.0008092243,0.0032374253,0.9639884,0.00020272144],"about_ca_topic_score_codex":0.000010853045,"about_ca_topic_score_gemma":7.7299326e-8,"teacher_disagreement_score":0.9433404,"about_ca_system_score_codex":0.000057857505,"about_ca_system_score_gemma":0.0000034025663,"threshold_uncertainty_score":0.9977312},"labels":[],"label_agreement":null},{"id":"W2767887452","doi":"10.1007/s11227-017-2185-5","title":"Data-type specific cache compression in GPGPUs","year":2017,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; Smart Cache; Cache algorithms; Cache pollution; General-purpose computing on graphics processing units; Cache invalidation; CPU cache; Operating system; Graphics","score_opus":0.10683008991284698,"score_gpt":0.3358702260270575,"score_spread":0.22904013611421054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767887452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2184901,0.0011254443,0.7763603,0.001637671,0.0009993488,0.000089060995,9.349577e-7,0.00007000246,0.0012271643],"genre_scores_gemma":[0.8934211,0.00021638926,0.106004916,0.000086633954,0.00024217238,6.150578e-8,0.0000010184322,0.000007314542,0.000020360214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985854,0.00022747435,0.00048981706,0.00016788453,0.00030665097,0.0002227439],"domain_scores_gemma":[0.9975835,0.00024814755,0.000458346,0.001484052,0.00016756558,0.000058366244],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0028926304,0.00011519918,0.00022779613,0.00012394154,0.00053111714,0.00034169358,0.0055980613,0.000048512105,0.0000041382887],"category_scores_gemma":[0.0001880974,0.000075838805,0.00003823236,0.00014832367,0.000073558855,0.00096297974,0.0015475771,0.0004345096,0.000007214417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025383328,0.00073817227,0.06145686,0.00008391165,0.00015843016,0.0005953005,0.014495776,0.27777094,0.011934591,0.00972586,0.07821627,0.5445701],"study_design_scores_gemma":[0.0007615429,0.00013675964,0.03270602,0.00042486654,0.000010582273,0.00048809993,0.0001251181,0.9530334,0.0013384162,0.0019124816,0.008800491,0.0002622478],"about_ca_topic_score_codex":0.000049582508,"about_ca_topic_score_gemma":0.0000050734325,"teacher_disagreement_score":0.67526245,"about_ca_system_score_codex":0.00003535296,"about_ca_system_score_gemma":0.00006543291,"threshold_uncertainty_score":0.99978215},"labels":[],"label_agreement":null},{"id":"W2768196954","doi":"10.1109/iccd.2017.39","title":"A High-Performance Deeply Pipelined Architecture for Elementary Transcendental Function Evaluation","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transcendental function; Computer science; Logarithm; Elementary function; Transcendental number; Software; Throughput; Range (aeronautics); Lookup table; Parallel computing; Function (biology); Table (database); Decoding methods; Transcendental equation; Computer architecture; Computational science; Theoretical computer science; Algorithm; Operating system; Mathematics","score_opus":0.02322052613801723,"score_gpt":0.28340053831601336,"score_spread":0.26018001217799613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768196954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034490705,0.000018038338,0.96195734,0.0012357176,0.00041358022,0.00049361365,0.000002034143,0.00035149424,0.0010375116],"genre_scores_gemma":[0.6901282,0.0000056548233,0.30924302,0.00031454666,0.00008968296,0.00005789663,0.000018933684,0.0000052678342,0.00013676292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990455,0.000032518055,0.00018341954,0.00029476816,0.00026382905,0.00017995675],"domain_scores_gemma":[0.99911773,0.000024071307,0.00012651905,0.00055138924,0.00013950076,0.000040779243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005455299,0.000109862754,0.00009896905,0.000069757814,0.000572549,0.00023048527,0.00068048947,0.000045376655,0.000022904245],"category_scores_gemma":[0.000027071617,0.00009675893,0.000051293362,0.000048072277,0.000023635277,0.00047159393,0.00006666413,0.00006872621,0.000007063691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008464166,0.0000800217,0.0005571179,0.00002730078,0.000031236206,3.5079816e-7,0.00017574201,0.042367842,0.0010285995,0.00919248,0.0043323888,0.9421223],"study_design_scores_gemma":[0.0010092563,0.00024312414,0.0051346566,0.000014597072,0.000017942088,0.0000031554907,0.000004481882,0.97475666,0.0111451335,0.006374977,0.0011364515,0.00015954803],"about_ca_topic_score_codex":0.000036870842,"about_ca_topic_score_gemma":0.000022862187,"teacher_disagreement_score":0.9419627,"about_ca_system_score_codex":0.000038428007,"about_ca_system_score_gemma":0.000045524983,"threshold_uncertainty_score":0.4403642},"labels":[],"label_agreement":null},{"id":"W2768292657","doi":"10.1145/3129457.3129501","title":"Building the Reconfigurable Cloud Ecosystem","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Cloud computing; Field-programmable gate array; Computer science; Software deployment; Reconfigurable computing; Software; Embedded system; Scale (ratio); Computer architecture; Operating system","score_opus":0.025588096425919266,"score_gpt":0.2790039063489458,"score_spread":0.25341580992302654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768292657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012913762,0.000023635706,0.8709714,0.0028551014,0.0004406509,0.0000726634,1.8574144e-7,0.00043192963,0.12391309],"genre_scores_gemma":[0.78831625,0.0000102323675,0.2093232,0.00025746843,0.00009657613,0.000005863793,8.397612e-8,0.0000036527476,0.0019866815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940705,0.000039773367,0.00011843946,0.00018489128,0.0000987053,0.0001511333],"domain_scores_gemma":[0.99857605,0.000054284366,0.00012175743,0.001165049,0.00005014123,0.00003270772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004972526,0.00006492565,0.00007539304,0.00002250921,0.00092385086,0.0008534861,0.0021518944,0.000029094857,0.000013926092],"category_scores_gemma":[0.00006434904,0.00004050515,0.00003705453,0.0000410095,0.000018656943,0.00030313604,0.00019152426,0.0000717698,0.000049556704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8677086e-7,0.0000110944175,0.00019483664,0.0000054491447,0.000010153078,0.0000033669246,0.00010777407,0.001561965,0.0001501099,0.92826796,0.031017974,0.038668416],"study_design_scores_gemma":[0.00015171124,0.000030136676,0.0006007865,0.000039145878,0.0000024500891,0.000028938382,0.000007874679,0.83938515,0.019312656,0.024894748,0.11532986,0.00021654129],"about_ca_topic_score_codex":0.00004331128,"about_ca_topic_score_gemma":0.000008443659,"teacher_disagreement_score":0.90337324,"about_ca_system_score_codex":0.000013388058,"about_ca_system_score_gemma":0.00002151942,"threshold_uncertainty_score":0.82301867},"labels":[],"label_agreement":null},{"id":"W2768414512","doi":"","title":"Work-in-progress: heterogeneous redundancy to address performance and cost in multi-core SIMT","year":2017,"lang":"en","type":"article","venue":"International Conference on Hardware/Software Codesign and System Synthesis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Redundancy (engineering); Computer science; Core (optical fiber); Yield (engineering); Many core; Parallel computing; Distributed computing; Computer architecture; Telecommunications; Materials science; Operating system","score_opus":0.10499501981910926,"score_gpt":0.3262458722754042,"score_spread":0.22125085245629494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768414512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16902909,0.0003115652,0.8235341,0.0017391208,0.00086809904,0.001479527,0.00005657383,0.0007449121,0.0022370121],"genre_scores_gemma":[0.95263624,0.00013392819,0.046695087,0.000082200175,0.00002642532,0.00024372546,0.000002541175,0.000016693955,0.00016317121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980659,0.00012098201,0.00043579563,0.0007051747,0.00035856228,0.00031357136],"domain_scores_gemma":[0.9985126,0.00023576067,0.00023968947,0.0006363308,0.00022322014,0.00015234854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000561873,0.0002700581,0.0003740446,0.0003654249,0.0002632929,0.00080333074,0.0012839108,0.0001212086,0.0000097532675],"category_scores_gemma":[0.00041205616,0.00025892034,0.00004094041,0.00011917047,0.000093754905,0.00039000474,0.00037666288,0.00017175465,0.000017657117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068238936,0.00047681128,0.3768056,0.00045064298,0.00012742098,0.0005612547,0.002950646,0.007545113,0.00024071413,0.020351468,0.0007229495,0.589085],"study_design_scores_gemma":[0.0012380616,0.00021917782,0.09304538,0.006985527,0.000010893948,0.00010201627,0.00009750312,0.8932915,0.0031387692,0.00017771365,0.0006760143,0.0010174625],"about_ca_topic_score_codex":0.00007384036,"about_ca_topic_score_gemma":0.000039702303,"teacher_disagreement_score":0.88574636,"about_ca_system_score_codex":0.00013742564,"about_ca_system_score_gemma":0.00006602399,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W2769715556","doi":"10.1109/lca.2017.2777834","title":"The EH Model: Analytical Exploration of Energy-Harvesting Architectures","year":2017,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Energy harvesting; Computation; Focus (optics); Work (physics); Energy (signal processing); Distributed computing; Industrial engineering; Embedded system; Engineering","score_opus":0.030331696311428267,"score_gpt":0.27121694397506013,"score_spread":0.24088524766363187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769715556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006335345,0.000028501143,0.97933906,0.012775764,0.00044741985,0.00011633071,0.000001527113,0.00034752072,0.000608518],"genre_scores_gemma":[0.5639917,0.000007113473,0.43369967,0.0018770341,0.00031408208,0.000012628805,0.0000016759055,0.00001788857,0.00007816723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812007,0.00016399754,0.00041190584,0.0004900103,0.00041121393,0.00040283092],"domain_scores_gemma":[0.99748987,0.00030201106,0.00040365456,0.0016077335,0.00009340113,0.00010334167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039209728,0.00025680126,0.00026244603,0.00016166994,0.0010299291,0.00069347693,0.0028263298,0.0000686016,3.5840304e-7],"category_scores_gemma":[0.00005725427,0.00018405152,0.00016925191,0.00014075251,0.00031219443,0.0003101416,0.000508905,0.0003077831,0.0000015896537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099716835,0.000017525092,0.000063421736,0.000009445463,0.000031139283,0.0000068869485,0.0005520608,0.8797836,0.00061877543,0.012931683,0.0021301128,0.10384541],"study_design_scores_gemma":[0.00017639823,0.000050780687,0.00025450642,0.00004570809,0.0000072515627,0.00001771804,7.088102e-7,0.98127604,0.0029752487,0.013841995,0.0011344944,0.0002191627],"about_ca_topic_score_codex":0.000050994964,"about_ca_topic_score_gemma":0.00002384722,"teacher_disagreement_score":0.5576564,"about_ca_system_score_codex":0.00002313558,"about_ca_system_score_gemma":0.00005667314,"threshold_uncertainty_score":0.79214865},"labels":[],"label_agreement":null},{"id":"W2771835118","doi":"10.1109/pacrim.2017.8121911","title":"Improving the performance of JVM startup using the shared class cache","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"Atlantic Canada Opportunities Agency; New Brunswick Innovation Foundation","keywords":"Computer science; Operating system; Java; Bottleneck; Just-in-time compilation; Cache; Virtual machine; Benchmark (surveying); Class (philosophy); Parallel computing; IBM; Programming language; Embedded system","score_opus":0.039623676166159735,"score_gpt":0.2788424047368294,"score_spread":0.23921872857066967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771835118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11511698,0.000041969717,0.8806975,0.00094546605,0.00012886197,0.00012184336,6.666646e-7,0.0001312605,0.0028154305],"genre_scores_gemma":[0.8982938,0.000008161649,0.101170346,0.00018041885,0.000031622516,0.000002561832,2.2403047e-7,0.0000037480365,0.00030913146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999338,0.000043466127,0.00015265518,0.00015286054,0.00016352847,0.00014954184],"domain_scores_gemma":[0.9984563,0.00006057451,0.00022853569,0.0011390322,0.00009579773,0.000019763564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005191981,0.0000738707,0.00008175011,0.000022089673,0.00085791963,0.00033147717,0.0020248753,0.000029064802,0.000005997022],"category_scores_gemma":[0.000058539787,0.0000375608,0.000039244736,0.00006886587,0.00010168622,0.00039156454,0.0005839631,0.0001049484,0.0000021802744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006772922,0.00031825475,0.05232356,0.00028812443,0.00025216126,0.000012175593,0.013948147,0.31318596,0.044103578,0.16161534,0.022743247,0.39114174],"study_design_scores_gemma":[0.00005862557,0.000023431698,0.001756217,0.000013310778,0.0000029580044,0.0000032834332,0.000015657952,0.98519135,0.012481314,0.00007882401,0.0003153276,0.000059702],"about_ca_topic_score_codex":0.00025211272,"about_ca_topic_score_gemma":0.000008304983,"teacher_disagreement_score":0.7831768,"about_ca_system_score_codex":0.00001504589,"about_ca_system_score_gemma":0.00005747901,"threshold_uncertainty_score":0.6598511},"labels":[],"label_agreement":null},{"id":"W2773964847","doi":"10.1109/vlsi-soc.2017.8203453","title":"Targeting inter set write variation to improve the lifetime of non-volatile cache using fellow sets","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Cache; Computer science; Variation (astronomy); Set (abstract data type); Hierarchy; Parallel computing; Non-volatile memory; Reduction (mathematics); CPU cache; Cache algorithms; Computer hardware; Programming language; Mathematics","score_opus":0.02177742441909241,"score_gpt":0.29834562590771746,"score_spread":0.27656820148862504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773964847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017878678,0.0000066970715,0.97876054,0.0008286214,0.00022988212,0.00020632774,0.0000020221676,0.000120128854,0.0019671149],"genre_scores_gemma":[0.621928,0.0000010712952,0.37753692,0.00023093513,0.000043113458,0.0000032637026,0.0000011023246,0.000005321743,0.00025030118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910796,0.000053318352,0.00025250504,0.00025573102,0.00015576454,0.00017473943],"domain_scores_gemma":[0.99868417,0.000068211804,0.00026205322,0.00078066223,0.00015580043,0.000049116785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006359587,0.000105268235,0.0001331124,0.000062101455,0.0003848977,0.00032435465,0.001128572,0.000053152296,0.000012213654],"category_scores_gemma":[0.0001508724,0.000075785516,0.00004739945,0.00010135797,0.000028529068,0.00036414154,0.00063654414,0.00009740336,0.00001201263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009386598,0.00040714745,0.019841317,0.00019171806,0.00032777895,0.000017731474,0.04207472,0.4111736,0.30346859,0.012135761,0.07088104,0.13938673],"study_design_scores_gemma":[0.00009006114,0.00003769544,0.0018931275,0.000024928635,0.0000039484466,9.955925e-7,0.000011164844,0.9890653,0.008195157,0.00033343444,0.00023934705,0.000104828854],"about_ca_topic_score_codex":0.00037931447,"about_ca_topic_score_gemma":0.0000038643107,"teacher_disagreement_score":0.6040493,"about_ca_system_score_codex":0.000026394404,"about_ca_system_score_gemma":0.00004760437,"threshold_uncertainty_score":0.31277594},"labels":[],"label_agreement":null},{"id":"W2775727119","doi":"10.1145/3151034","title":"CG-OoO","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Compiler; Instruction scheduling; Out-of-order execution; Code (set theory); Operating system; Dynamic priority scheduling; Programming language; Schedule","score_opus":0.017094421243348288,"score_gpt":0.26500517816495206,"score_spread":0.24791075692160378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775727119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013357884,0.000035280013,0.99205035,0.004471053,0.00014643396,0.00014054436,0.000005897914,0.00041363656,0.002603252],"genre_scores_gemma":[0.3148765,0.00017540403,0.6839872,0.00044683166,0.000026498732,0.000017684826,0.0000036706672,0.000011835284,0.00045438134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00004594518,0.00015515606,0.0003631179,0.00015625928,0.00017519415],"domain_scores_gemma":[0.9984644,0.0000629667,0.000112957205,0.0012159942,0.00006064749,0.00008302788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012341783,0.00015026185,0.00012868905,0.0001463931,0.0010964981,0.00044999472,0.000974896,0.000083547035,0.00001901093],"category_scores_gemma":[0.000052644118,0.00013813116,0.000052112162,0.000101916514,0.00007201214,0.00033195372,0.00004000025,0.0001912833,0.0000060475368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009461255,0.000034993845,0.000017797343,0.0000038527633,0.000011421126,0.0000018789908,0.00020537738,0.7668969,0.000016307504,0.000991212,0.0000660722,0.2317447],"study_design_scores_gemma":[0.00043652795,0.0001433994,0.00036703603,0.000038384653,0.00001430899,0.000031611038,0.000006439695,0.98729825,0.0021025906,0.0071333027,0.002148229,0.00027990172],"about_ca_topic_score_codex":0.000011667192,"about_ca_topic_score_gemma":0.000014718601,"teacher_disagreement_score":0.31474292,"about_ca_system_score_codex":0.000014000546,"about_ca_system_score_gemma":0.000025862406,"threshold_uncertainty_score":0.8433488},"labels":[],"label_agreement":null},{"id":"W2776640723","doi":"10.15760/etd.5858","title":"Enhancements to the scalable coherent interface cache protocol","year":2000,"lang":"en","type":"report","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"MESI protocol; Computer science; Cache coherence; Protocol (science); MESIF protocol; Cache; Scalability; Interface (matter); Computer network; Parallel computing; Cache algorithms; Operating system; CPU cache","score_opus":0.04450486595576195,"score_gpt":0.35967531227568417,"score_spread":0.3151704463199222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776640723","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014496082,0.000022890013,0.6783609,0.0005227928,0.00025620603,0.038496908,0.0000017716897,0.0005630854,0.281774],"genre_scores_gemma":[0.00093719363,0.00008773235,0.3118369,0.0012584041,0.0004923428,0.22338332,0.000014810979,0.00006803195,0.46192124],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973885,0.00011574914,0.0005134799,0.0006805947,0.0009189718,0.00038269738],"domain_scores_gemma":[0.9979673,0.000040382747,0.00021632641,0.0013203534,0.0003388377,0.00011680187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008486519,0.00031754313,0.0003160539,0.00013016959,0.0001889312,0.00042053458,0.0024078006,0.00017049136,0.00051774946],"category_scores_gemma":[0.000051228715,0.00020069399,0.0001012559,0.00044653594,0.000023652188,0.00015606645,0.00078125007,0.00034686492,0.0005195205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061862756,0.00008464365,0.000008865313,0.00004923065,0.00003259956,0.0000027501098,0.00012819203,0.0043259715,0.0000076558645,0.00015630707,0.91140544,0.08379216],"study_design_scores_gemma":[0.00009552575,0.00011943294,0.000010539468,0.00018490967,0.000004696918,0.000012473726,0.0000018550683,0.01581358,0.003414056,0.00012685898,0.97993284,0.00028324747],"about_ca_topic_score_codex":0.0002749322,"about_ca_topic_score_gemma":0.000027712742,"teacher_disagreement_score":0.36652398,"about_ca_system_score_codex":0.00024983913,"about_ca_system_score_gemma":0.0006652429,"threshold_uncertainty_score":0.81840634},"labels":[],"label_agreement":null},{"id":"W2778969831","doi":"10.23919/date.2018.8342184","title":"Non-intrusive program tracing of non-preemptive multitasking systems using power consumption","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Human multitasking; Tracing; Control flow graph; Control flow; Embedded system; Block (permutation group theory); Real-time computing; Operating system; Programming language","score_opus":0.026935095025326233,"score_gpt":0.31989177530005597,"score_spread":0.29295668027472976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778969831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12014078,0.000028115186,0.8756649,0.000009681775,0.00032400858,0.00044492874,8.210998e-7,0.0004130458,0.002973722],"genre_scores_gemma":[0.6161752,0.0000021995052,0.3837168,0.000019188634,0.00003679945,0.000008446203,6.920362e-7,0.0000063017796,0.0000344066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880075,0.000048384383,0.00034435114,0.00033929403,0.00021833625,0.0002488803],"domain_scores_gemma":[0.9988336,0.000057298632,0.00025174886,0.00038087956,0.0004159844,0.0000604752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264991,0.0001444036,0.00021794684,0.0001768489,0.00015895184,0.0001406555,0.00044086415,0.00008457276,0.000010131118],"category_scores_gemma":[0.000026895768,0.00013148249,0.000058194055,0.00030453812,0.00011027543,0.00038462202,0.00019395098,0.00008893312,0.000018124932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032315575,0.0038446302,0.07707271,0.0017060242,0.0012440892,0.00013503703,0.08629129,0.38032737,0.15613681,0.07344972,0.008072482,0.21139668],"study_design_scores_gemma":[0.00020956299,0.00021608647,0.0011203482,0.00019817198,0.000006134806,0.000015429383,0.00006727752,0.9771747,0.020742219,0.000049750404,0.000034221288,0.00016607843],"about_ca_topic_score_codex":0.00014527823,"about_ca_topic_score_gemma":0.0000031740758,"teacher_disagreement_score":0.59684736,"about_ca_system_score_codex":0.0000543505,"about_ca_system_score_gemma":0.000051977528,"threshold_uncertainty_score":0.53617},"labels":[],"label_agreement":null},{"id":"W2782868422","doi":"10.1145/3093741","title":"High-Performance Instruction Scheduling Circuits for Superscalar Out-of-Order Soft Processors","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Debugging; Scheduling (production processes); Processor design; Parallel computing; Out-of-order execution; Soft error; Superscalar; Embedded system; Electronic circuit; Computer architecture; Operating system","score_opus":0.02202369458145535,"score_gpt":0.25132756893974745,"score_spread":0.2293038743582921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782868422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12733524,0.00014152202,0.87001705,0.00044032442,0.000840523,0.00035364224,0.000004297118,0.0006836729,0.00018372986],"genre_scores_gemma":[0.9327687,0.00008520814,0.06672746,0.00003302951,0.000034238445,0.00012238404,0.0000017281312,0.000012198416,0.000215025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883324,0.000030322251,0.00036984787,0.0004048331,0.00010716163,0.00025456783],"domain_scores_gemma":[0.9987533,0.00008445319,0.00015644955,0.00056034804,0.00040560597,0.000039815943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031902507,0.00015979205,0.0002743564,0.00058549154,0.0004360696,0.000055078486,0.0005813615,0.0003020388,0.0000046804835],"category_scores_gemma":[0.00006925496,0.00015334065,0.00003354609,0.0007612014,0.00018847306,0.00032806353,0.0000076479855,0.0001977837,0.000008036705],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007494172,0.00024138983,0.00075028907,0.0006834975,0.00023455879,0.00000138508,0.0011315042,0.04467784,0.0059930864,0.03789087,0.000112994516,0.90820765],"study_design_scores_gemma":[0.0016713429,0.0015698824,0.00010281005,0.00050411554,0.00004188956,0.00010323945,0.0003736444,0.6782199,0.30584884,0.009025254,0.0019385085,0.00060059247],"about_ca_topic_score_codex":0.000012127217,"about_ca_topic_score_gemma":0.000003806952,"teacher_disagreement_score":0.9076071,"about_ca_system_score_codex":0.000025098123,"about_ca_system_score_gemma":0.000059570066,"threshold_uncertainty_score":0.625305},"labels":[],"label_agreement":null},{"id":"W2782940767","doi":"10.1109/asicon.2017.8252627","title":"Near-threshold processor design techniques for power-constrained computing devices","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Ultra low power; Power consumption; Computer architecture; Processor design; Wearable computer; Low-power electronics; Power (physics); Embedded system; Circuit design; Wearable technology; Architecture; Logic gate","score_opus":0.039857612401504726,"score_gpt":0.3121898320965679,"score_spread":0.2723322196950632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782940767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000510047,0.000036717654,0.98073447,0.0012764557,0.000106858475,0.0006602726,0.0000011020182,0.002115053,0.014559053],"genre_scores_gemma":[0.45123607,0.000002197099,0.5481958,0.0003296483,0.000030434903,0.00002425927,8.437693e-7,0.000009459849,0.00017130721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998585,0.000031968026,0.0003117556,0.0005024876,0.0001885944,0.00038022464],"domain_scores_gemma":[0.9982357,0.00015528344,0.0003323639,0.000904333,0.00027908303,0.00009325464],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00084298645,0.00020011875,0.00023784552,0.00008059567,0.001365947,0.0016476145,0.0022102576,0.00010834225,0.0000058799264],"category_scores_gemma":[0.00018809931,0.00018123811,0.000084523475,0.000100523175,0.0001377959,0.00070589845,0.00039754916,0.000108686865,0.000006757829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010727856,0.0005731188,0.0054405783,0.00034433184,0.00018613935,0.00003930051,0.0026217215,0.012344742,0.0022943215,0.44648257,0.045102358,0.48446354],"study_design_scores_gemma":[0.00028868226,0.00022238406,0.000392869,0.00008292594,0.0000054629845,0.000015541014,0.000010437529,0.9544481,0.032650903,0.008439474,0.0030666462,0.00037657577],"about_ca_topic_score_codex":0.000013664345,"about_ca_topic_score_gemma":0.000002333938,"teacher_disagreement_score":0.9421033,"about_ca_system_score_codex":0.000023283206,"about_ca_system_score_gemma":0.00014577468,"threshold_uncertainty_score":0.99993414},"labels":[],"label_agreement":null},{"id":"W2783614532","doi":"10.1145/3197978","title":"A Survey on Compiler Autotuning using Machine Learning","year":2018,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":224,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Optimizing compiler; Loop optimization; Leverage (statistics); Interprocedural optimization; Pace; Parallel computing; Artificial intelligence; Programming language","score_opus":0.14938650114853463,"score_gpt":0.37375704087074435,"score_spread":0.22437053972220972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783614532","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000118428925,0.4611945,0.53596604,0.0000095944715,0.00077125686,0.00032467395,0.000016718013,0.0015197457,0.00018566524],"genre_scores_gemma":[0.000288128,0.72535896,0.27247876,0.0001985573,0.0005762164,0.0000074934646,0.0005799245,0.0002274139,0.00028451192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9842545,0.010979221,0.0014080147,0.0016833367,0.00068566704,0.000989252],"domain_scores_gemma":[0.99061257,0.0047743763,0.0014558155,0.0025079392,0.00041698283,0.00023233234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.012941906,0.0010498216,0.0023771063,0.000836907,0.0009923284,0.00074954994,0.005059957,0.00053426035,0.000011452511],"category_scores_gemma":[0.0026236915,0.0009717431,0.0005484887,0.0021101448,0.00013186506,0.00020444955,0.0034442148,0.0015977948,0.00017501508],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018105471,0.00010524563,0.0006785855,0.0011107567,0.00019706896,0.000033763663,0.00014729849,0.0069595757,1.03492305e-7,0.00015842008,0.002343517,0.98826385],"study_design_scores_gemma":[0.00019546019,0.00020955919,0.0004082438,0.009041241,0.00006601941,0.00005700695,7.6244146e-7,0.71114826,0.0000016142113,0.00006473729,0.2774907,0.0013163869],"about_ca_topic_score_codex":0.00074004615,"about_ca_topic_score_gemma":0.000032096614,"teacher_disagreement_score":0.9869475,"about_ca_system_score_codex":0.000292391,"about_ca_system_score_gemma":0.0003505079,"threshold_uncertainty_score":0.9992733},"labels":[],"label_agreement":null},{"id":"W2783801469","doi":"","title":"MicroJIT: a lightweight, just-in-time compiler to improve startup times.","year":2017,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Compiler; Computer science; Operating system; Programming language; Parallel computing; Embedded system","score_opus":0.09053787834855652,"score_gpt":0.4094208643837855,"score_spread":0.31888298603522897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783801469","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25545236,0.0050397334,0.28420886,0.32448733,0.008156531,0.04288508,0.001714426,0.001337396,0.07671827],"genre_scores_gemma":[0.90412116,0.00037866452,0.08094545,0.00022120212,0.000076634904,0.00030059114,0.0000030784743,0.000028030858,0.013925205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753517,0.00029629908,0.00037765686,0.0006211182,0.0005982496,0.0005715067],"domain_scores_gemma":[0.99394846,0.00068148685,0.00029499273,0.0013721539,0.0035941496,0.00010874684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011584115,0.00021761816,0.00046033575,0.00020957924,0.0010278779,0.00029290578,0.003042808,0.00006343629,0.0000068011664],"category_scores_gemma":[0.0022759177,0.00015444204,0.00007725466,0.0006614422,0.00041757312,0.000304651,0.0016409779,0.00027337394,0.000027367554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029096494,0.002143092,0.0022311697,0.00075334444,0.0008432095,0.00003713636,0.048459843,0.017948052,0.088940725,0.5166938,0.23841903,0.080620974],"study_design_scores_gemma":[0.0050464245,0.0025438787,0.0016540169,0.0024386835,0.000019848034,9.956283e-7,0.0033143372,0.06317343,0.8093699,0.037152044,0.07410205,0.0011843446],"about_ca_topic_score_codex":0.00000604775,"about_ca_topic_score_gemma":0.000059825237,"teacher_disagreement_score":0.72042924,"about_ca_system_score_codex":0.00020822464,"about_ca_system_score_gemma":0.000370838,"threshold_uncertainty_score":0.790571},"labels":[],"label_agreement":null},{"id":"W2783882539","doi":"","title":"Compiler-driven performance","year":2017,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Computer science; Programming language; Scripting language; Dynamic compilation; Optimizing compiler; Just-in-time compilation; Compiler construction; Program optimization; Parallel computing; Computer architecture","score_opus":0.013387692308230038,"score_gpt":0.2290644658620153,"score_spread":0.21567677355378526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783882539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05062317,0.000039830204,0.947815,0.00012433212,0.00055348256,0.00006538317,2.6145477e-7,0.0006850035,0.00009353536],"genre_scores_gemma":[0.50540704,0.000020274849,0.4944172,0.000076372715,0.000060893668,0.0000028343206,1.724493e-7,0.0000039717656,0.000011282573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987967,0.0000071254626,0.00013611127,0.00042104305,0.00031742803,0.00032158307],"domain_scores_gemma":[0.9986979,0.00004905029,0.00007679,0.0008598517,0.00017563325,0.00014081917],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005349954,0.00013304918,0.00013558808,0.00016151328,0.0010601399,0.0011845019,0.0021398796,0.000034842727,6.7110705e-7],"category_scores_gemma":[0.0001664769,0.00012789552,0.00002253804,0.00019590966,0.00018960395,0.001525419,0.0011939042,0.000121118894,0.0000073886918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002043325,0.000044540695,0.036306873,0.00008731153,0.000015110595,0.000027859824,0.0010307708,0.17735644,0.00037159104,0.016608367,0.0011046355,0.7670445],"study_design_scores_gemma":[0.00008907098,0.000038248618,0.05094649,0.00004652782,8.743384e-7,0.000021477688,2.9858404e-7,0.94689393,0.00065244193,0.0000393022,0.0010991918,0.00017212852],"about_ca_topic_score_codex":0.000003944299,"about_ca_topic_score_gemma":1.5893981e-7,"teacher_disagreement_score":0.7695375,"about_ca_system_score_codex":0.000033913675,"about_ca_system_score_gemma":0.000076195916,"threshold_uncertainty_score":0.99985236},"labels":[],"label_agreement":null},{"id":"W2786533309","doi":"10.14459/2018md1428538","title":"A Case Study for a New Invasive Extension of Intel’s Threading Building Blocks","year":2018,"lang":"en","type":"article","venue":"Open Research Exeter (University of Exeter)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Deutsche Forschungsgemeinschaft; Durham University; European Commission","keywords":"Computer science; Parallel computing; Concurrency; Exploit; Threading (protein sequence); Code (set theory); Extension (predicate logic); Rank (graph theory); Node (physics); Multi-core processor; Programming language","score_opus":0.19507108814164595,"score_gpt":0.3964641705096979,"score_spread":0.20139308236805195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786533309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40275148,0.000012551273,0.59490365,0.00017063167,0.00004826598,0.0010072631,0.0000024352828,0.000047130405,0.0010566348],"genre_scores_gemma":[0.6955419,0.000007321527,0.30378506,0.000014139358,0.000025165278,0.0000016802788,7.473892e-7,0.0000069970974,0.0006169408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981963,0.00027137314,0.00021153035,0.0005669038,0.00039232356,0.0003615427],"domain_scores_gemma":[0.99735945,0.00050729164,0.00017759948,0.00080696255,0.0009869193,0.00016178732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019292949,0.00012478071,0.000320689,0.0005110766,0.0005432144,0.00017792406,0.0024553025,0.00007064343,0.000037422335],"category_scores_gemma":[0.00021944343,0.00013709016,0.000089079316,0.0007296142,0.0002137625,0.00084169087,0.0032163963,0.00017699478,0.0000048459606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004109059,0.0048888903,0.008640238,0.0006224981,0.001155785,0.0078862365,0.33136812,0.0009798396,0.07296899,0.029910201,0.14793433,0.3895358],"study_design_scores_gemma":[0.020016717,0.047984768,0.002133507,0.0033920615,0.00021805378,0.002331118,0.08582565,0.64546657,0.13546622,0.04579985,0.008389052,0.0029764273],"about_ca_topic_score_codex":0.0038342755,"about_ca_topic_score_gemma":0.00042693157,"teacher_disagreement_score":0.6444867,"about_ca_system_score_codex":0.00006471303,"about_ca_system_score_gemma":0.0002702417,"threshold_uncertainty_score":0.5796303},"labels":[],"label_agreement":null},{"id":"W2786927865","doi":"10.1109/fpt.2017.8280124","title":"A state machine block for high-level synthesis","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Field-programmable gate array; Computer science; Finite-state machine; Block (permutation group theory); Logic block; Successor cardinal; State (computer science); Efficient energy use; Acceleration; Logic synthesis; Embedded system; Computer architecture; Architecture; Parallel computing; Distributed computing; Logic gate; Algorithm; Engineering","score_opus":0.03681735483546032,"score_gpt":0.2831970959105573,"score_spread":0.24637974107509697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786927865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005782204,0.000012353463,0.9899481,0.0020181146,0.00012219294,0.00013379207,0.000008981102,0.00048278586,0.0066954894],"genre_scores_gemma":[0.41267386,0.00000829214,0.58217686,0.00015399746,0.00001871021,0.000024196619,5.533063e-7,0.000005108929,0.004938451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993448,0.000016279677,0.00012835654,0.00024058546,0.00009652598,0.00017341522],"domain_scores_gemma":[0.99884635,0.00011486932,0.0001122254,0.0007968004,0.000079374804,0.000050366252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023993445,0.00008823752,0.00011739637,0.00004874856,0.00043325775,0.00036518273,0.0012291584,0.000027946193,0.0000069092694],"category_scores_gemma":[0.00017617356,0.00007300601,0.000042372536,0.000031725907,0.000025352438,0.00023461551,0.00027132564,0.000037285463,0.000014891971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030003714,0.00020605732,0.0010480189,0.000050307935,0.00008629366,0.000011667834,0.00024114251,0.005136624,0.0004439153,0.2490241,0.051250953,0.6924709],"study_design_scores_gemma":[0.00034073077,0.00007468149,0.0035119122,0.000024355058,0.000006144384,0.000006415542,9.92129e-7,0.9266574,0.04309363,0.02005055,0.005924114,0.00030912433],"about_ca_topic_score_codex":0.000102696366,"about_ca_topic_score_gemma":0.000016132924,"teacher_disagreement_score":0.9215207,"about_ca_system_score_codex":0.000011328126,"about_ca_system_score_gemma":0.000025066998,"threshold_uncertainty_score":0.35214657},"labels":[],"label_agreement":null},{"id":"W2788343971","doi":"","title":"Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'05): Foreword","year":2005,"lang":"en","type":"article","venue":"Journal of International Crisis and Risk Communication Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; Concordia University","funders":"","keywords":"Computer science; Distributed computing; Parallel computing","score_opus":0.05440171886925508,"score_gpt":0.39167586761304346,"score_spread":0.33727414874378836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788343971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009542835,0.0036961793,0.96749634,0.01726363,0.000015969606,0.00022478335,0.000009277175,0.00006814667,0.0016828661],"genre_scores_gemma":[0.74837554,0.036729727,0.21466179,0.00008548562,0.00007057972,0.000022989107,0.000004938845,0.0000051029488,0.000043861917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865246,0.0002485284,0.00037629163,0.00017351338,0.0004211292,0.00012808268],"domain_scores_gemma":[0.99792445,0.0002662459,0.00031735722,0.00029563025,0.0010962351,0.00010006492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977636,0.00009017032,0.00013977959,0.00033943154,0.00042227277,0.0004464132,0.00080896396,0.000064521024,0.0000037863826],"category_scores_gemma":[0.00009771366,0.000072729614,0.000027084758,0.00021184949,0.00015266288,0.0004852674,0.0004166713,0.0005194467,8.496653e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008803844,0.00028510837,0.00543453,0.000025843785,0.000071210394,0.0000035752373,0.0010560079,0.000827876,0.00005493542,0.1534294,0.008924915,0.8297986],"study_design_scores_gemma":[0.0015564613,0.00082509994,0.014639054,0.0005714943,0.000030030713,0.0005097186,0.0010856622,0.5673961,0.001316556,0.097998016,0.3135631,0.0005086831],"about_ca_topic_score_codex":0.00003028811,"about_ca_topic_score_gemma":0.000008563174,"teacher_disagreement_score":0.82928985,"about_ca_system_score_codex":0.00005028319,"about_ca_system_score_gemma":0.000058462145,"threshold_uncertainty_score":0.4304773},"labels":[],"label_agreement":null},{"id":"W2791450498","doi":"10.5539/mas.v12n3p74","title":"Measuring the Performance of Parallel Information Processing in Solving Linear Equation Using Multiprocessor Supercomputer","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Speedup; Parallel computing; Supercomputer; Multiprocessing; Matrix (chemical analysis); Parallel algorithm; Message Passing Interface; Algorithm; Message passing","score_opus":0.04536053429430523,"score_gpt":0.26350171132541905,"score_spread":0.21814117703111383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791450498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24368608,0.000014177309,0.75552666,0.00004309964,0.000047176825,0.00017071636,1.1450116e-7,0.000107518084,0.00040445031],"genre_scores_gemma":[0.6651525,0.0000024536416,0.33471888,0.00008847482,0.000024976509,0.000007810084,3.2426183e-7,0.0000031497163,0.0000014539415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839276,0.000021631191,0.00039599024,0.00029183246,0.00057312514,0.0003246339],"domain_scores_gemma":[0.9990086,0.000026764614,0.00020998006,0.00035811053,0.00035620047,0.000040372528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015055947,0.00012217026,0.00013038846,0.00030669174,0.0005233874,0.00023134825,0.0012824781,0.000043529497,6.526884e-7],"category_scores_gemma":[0.000047477562,0.00009594611,0.000018678495,0.0013105703,0.0003296046,0.0022353602,0.00035937916,0.00012978015,0.000005326233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021066318,0.00005261793,0.0016455837,0.00008898036,0.0000019018905,2.173645e-7,0.018413585,0.7649075,0.07436103,0.0026145629,0.0000040811424,0.13788888],"study_design_scores_gemma":[0.00015818402,0.000022953913,0.0012940894,0.00006312378,0.0000011440025,0.0000026969267,0.000029496507,0.9687389,0.029129127,0.00043164525,0.0000083737505,0.000120266675],"about_ca_topic_score_codex":0.000020470376,"about_ca_topic_score_gemma":0.0000026023276,"teacher_disagreement_score":0.42146638,"about_ca_system_score_codex":0.00008543957,"about_ca_system_score_gemma":0.00025392292,"threshold_uncertainty_score":0.40255255},"labels":[],"label_agreement":null},{"id":"W2793377509","doi":"10.1145/3154425","title":"Enhancing FPGAs with Magnetic Tunnel Junction-Based Block RAMs","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Static random-access memory; Field-programmable gate array; Computer science; Scalability; Magnetoresistive random-access memory; Tunnel magnetoresistance; Block (permutation group theory); Embedded system; Transistor; Logic block; Computer hardware; Non-volatile memory; Electrical engineering; Random access memory; Materials science; Voltage; Nanotechnology; Engineering","score_opus":0.01211371524792153,"score_gpt":0.22261954629119857,"score_spread":0.21050583104327703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793377509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0105555635,0.00034005844,0.98355407,0.001398552,0.00042654,0.00031158136,0.0000015665174,0.0017322721,0.0016797793],"genre_scores_gemma":[0.95788705,0.00003996986,0.040421493,0.0001900022,0.000028762277,0.00010579203,9.603297e-7,0.000015946029,0.0013100423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986229,0.00007142943,0.0003064551,0.00052712095,0.00014656712,0.00032552003],"domain_scores_gemma":[0.9985322,0.00012891364,0.0001153757,0.0009515733,0.00019788744,0.0000740571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028289293,0.0002120939,0.0002596887,0.00068911124,0.0005784055,0.00013513154,0.0006323047,0.00026284665,0.00002629772],"category_scores_gemma":[0.000026051466,0.00018164766,0.000036653284,0.0010312074,0.0002322446,0.00016041961,0.0000070891306,0.0003009208,0.0000536005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005668361,0.0017093519,0.002246948,0.0006981528,0.00071266573,0.00015130496,0.0018760341,0.16762123,0.025062405,0.06494628,0.0029805722,0.7314282],"study_design_scores_gemma":[0.0030679617,0.007031569,0.00034491904,0.00097628665,0.00010584136,0.0011168533,0.00058915355,0.72218895,0.23822941,0.0059585352,0.018755767,0.0016347617],"about_ca_topic_score_codex":0.00007158564,"about_ca_topic_score_gemma":0.00005419739,"teacher_disagreement_score":0.9473315,"about_ca_system_score_codex":0.00003762093,"about_ca_system_score_gemma":0.00008051836,"threshold_uncertainty_score":0.7407377},"labels":[],"label_agreement":null},{"id":"W2793742595","doi":"10.4316/aece.2018.01004","title":"An Automatic Instruction-Level Parallelization of Machine Code","year":2018,"lang":"en","type":"article","venue":"Advances in Electrical and Computer Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Automatic parallelization; Code (set theory); Programming language; Compiler; Set (abstract data type)","score_opus":0.0070288078139005864,"score_gpt":0.2447830014800868,"score_spread":0.23775419366618622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793742595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020316215,0.00052190997,0.97864586,0.000019969193,0.00012297637,0.00005939594,4.975139e-7,0.00026698256,0.00004621157],"genre_scores_gemma":[0.5754946,0.00012353083,0.42430022,0.000027499493,0.000044269113,0.0000030432818,0.0000012494738,0.0000039106035,0.0000016745632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992631,0.000023547957,0.00022992743,0.00021959879,0.000104050494,0.000159749],"domain_scores_gemma":[0.9996276,0.000046943955,0.000055683195,0.00017181263,0.0000519939,0.00004595894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009669257,0.00009918763,0.00014744389,0.00017842701,0.000036906073,0.00003178109,0.00028136253,0.000038296213,0.0000010949996],"category_scores_gemma":[0.000012223883,0.00009507198,0.000015336589,0.00053636957,0.000024785124,0.00048649684,0.000060085666,0.00008121124,5.7957664e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004791101,0.00007745113,0.0022170208,0.00003743755,0.0000067744845,0.0000024441938,0.00022362293,0.2538231,0.00017815887,0.053982228,0.000014033704,0.6894329],"study_design_scores_gemma":[0.00019851736,0.00021260839,0.0038411606,0.000027682823,0.0000010859957,0.000015103041,3.2500503e-7,0.9928203,0.00096718187,0.001479075,0.00032538013,0.00011158675],"about_ca_topic_score_codex":0.0000049116193,"about_ca_topic_score_gemma":0.0000031593615,"teacher_disagreement_score":0.73899716,"about_ca_system_score_codex":0.000017132726,"about_ca_system_score_gemma":0.000011223785,"threshold_uncertainty_score":0.38769227},"labels":[],"label_agreement":null},{"id":"W2794524168","doi":"10.5281/zenodo.1206917","title":"STEllAR-GROUP/hpx: HPX V1.1.0: The C++ Standards Library for Parallelism and Concurrency","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Concurrency; Parallelism (grammar); Computer science; Group (periodic table); Parallel computing; Programming language; Chemistry","score_opus":0.027149598922635014,"score_gpt":0.2607378732098302,"score_spread":0.2335882742871952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794524168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011369447,0.00033504498,0.94539547,0.0027645873,0.00017631713,0.0006202632,0.00015016025,0.0021874737,0.047233716],"genre_scores_gemma":[0.8782249,0.0011346001,0.11049097,0.0026401423,0.0012034344,8.2030584e-7,0.0010195199,0.0019271142,0.003358489],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983419,0.00028484996,0.00024180258,0.00045111848,0.00034429302,0.0003360052],"domain_scores_gemma":[0.99857473,0.00007099298,0.00011450926,0.00056966936,0.0005376817,0.00013242755],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00088145566,0.00014574162,0.00013615935,0.0001268307,0.0025123497,0.0016369297,0.0017016338,0.000063411164,0.00065304316],"category_scores_gemma":[0.0002984774,0.000120682394,0.000045029745,0.00046535037,0.0002806136,0.0005398109,0.0016673768,0.00017231767,0.00024680188],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004148608,0.000057959365,0.0000055073547,0.00003754062,0.00002947759,0.0000027239485,0.0017370787,0.000039307477,0.00014724284,0.09352199,0.705804,0.1985757],"study_design_scores_gemma":[0.0003941369,0.0003862869,0.00011539056,0.00002446382,0.0000058018804,0.000038961767,0.000043628894,0.025749665,0.00044837163,0.0027748095,0.9698533,0.00016522012],"about_ca_topic_score_codex":0.0000029695937,"about_ca_topic_score_gemma":1.085483e-7,"teacher_disagreement_score":0.87708795,"about_ca_system_score_codex":0.000039666193,"about_ca_system_score_gemma":0.000011015326,"threshold_uncertainty_score":0.9993995},"labels":[],"label_agreement":null},{"id":"W2794649098","doi":"10.1109/hpca.2018.00066","title":"NACHOS: Software-Driven Hardware-Assisted Memory Disambiguation for Accelerators","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Alias; Compiler; Parallel computing; Serialization; Cache; Optimizing compiler; Computer hardware; Embedded system; Programming language","score_opus":0.034565239884587304,"score_gpt":0.2932364728327292,"score_spread":0.25867123294814187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794649098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019207273,0.00001558192,0.9916386,0.00038049027,0.00040112395,0.00029718978,0.000002014078,0.0017591114,0.0035851817],"genre_scores_gemma":[0.24406338,0.0000032048295,0.75373185,0.0007195742,0.00015542937,0.000051339135,0.000010554212,0.000012393202,0.0012522745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889463,0.000046297577,0.00023876691,0.00039086796,0.00018561303,0.00024380066],"domain_scores_gemma":[0.9989104,0.000101714526,0.000103371625,0.000470296,0.00033490124,0.00007928928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002352221,0.00013445092,0.00014099566,0.000119955526,0.00029513444,0.00022321306,0.0007171421,0.00007737068,0.00003122108],"category_scores_gemma":[0.00014838635,0.00012149993,0.00007508637,0.00033318624,0.000055568325,0.00044141395,0.0001639915,0.000055715278,0.000046344576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052807856,0.00036096046,0.001685621,0.000060552058,0.00009970557,0.0000034619725,0.0021318663,0.0027377564,0.0013432419,0.046766534,0.1903928,0.75436467],"study_design_scores_gemma":[0.0010128028,0.00046602628,0.0032187179,0.00004337772,0.000013540409,0.000008894911,0.000026021957,0.9282638,0.036929753,0.0053285607,0.024097484,0.00059103355],"about_ca_topic_score_codex":0.000021474707,"about_ca_topic_score_gemma":0.000011392978,"teacher_disagreement_score":0.925526,"about_ca_system_score_codex":0.000048943682,"about_ca_system_score_gemma":0.00006731935,"threshold_uncertainty_score":0.49546233},"labels":[],"label_agreement":null},{"id":"W2795326547","doi":"10.5539/mas.v12n4p143","title":"Parallel Processing of Sorting and Searching Algorithms Comparative Study","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Supercomputer; Sorting algorithm; Parallel computing; Merge sort; Merge (version control); sort; Sorting; Algorithm; Software; Merge algorithm; Operating system; Database","score_opus":0.047668525987765095,"score_gpt":0.334203868515683,"score_spread":0.2865353425279179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795326547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11338803,0.000025374487,0.8784528,0.000024676816,0.000019053146,0.00024471112,1.5916434e-7,0.00018878863,0.0076564443],"genre_scores_gemma":[0.6888123,0.0000010636306,0.31111532,0.00002966233,0.000016256605,0.000008719137,9.404388e-8,0.0000029537407,0.000013639997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983548,0.00003458286,0.00025931367,0.0005581778,0.0004897955,0.00030335382],"domain_scores_gemma":[0.9992361,0.00003878046,0.00014801351,0.00033020892,0.00015848828,0.00008840719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010814775,0.000116987496,0.00018919865,0.0001834776,0.0006327918,0.00026277755,0.00096878124,0.000020728661,0.0000012949154],"category_scores_gemma":[0.000014746043,0.00010411061,0.000012797453,0.0007864631,0.00066854345,0.00041269613,0.0004786802,0.000108794025,0.0000031532647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004803554,0.0006057709,0.0024392905,0.000042494088,0.000019469078,0.0000044383564,0.15235077,0.015190735,0.07778202,0.021593068,0.000045963377,0.72987795],"study_design_scores_gemma":[0.00018035462,0.000114044524,0.0013456019,0.000014827286,0.0000017707895,0.0000028533532,0.00027619125,0.9833534,0.006080552,0.008502324,0.0000044709523,0.00012365276],"about_ca_topic_score_codex":0.00001304345,"about_ca_topic_score_gemma":0.000002332722,"teacher_disagreement_score":0.9681626,"about_ca_system_score_codex":0.000018739926,"about_ca_system_score_gemma":0.00012642179,"threshold_uncertainty_score":0.48669866},"labels":[],"label_agreement":null},{"id":"W2798422034","doi":"10.1145/3183713.3183734","title":"Pipelined Query Processing in Coprocessor Environments","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto","keywords":"Coprocessor; Computer science; Throughput; Bandwidth (computing); Parallel computing; Computer architecture; Data processing; Database; Operating system; Computer network","score_opus":0.01411943387027256,"score_gpt":0.26235489180019844,"score_spread":0.24823545792992588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798422034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034427815,0.000043531538,0.98306847,0.00029660147,0.000046302266,0.00006560438,6.817783e-8,0.000320668,0.012716003],"genre_scores_gemma":[0.68857133,0.0000064680294,0.3096928,0.00054504606,0.000038005775,0.000005445465,5.175355e-7,0.000004049131,0.0011363473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992462,0.000023406898,0.00017023298,0.00025257643,0.00013327783,0.00017429993],"domain_scores_gemma":[0.9996688,0.000009754158,0.000050422295,0.00020969941,0.000024747122,0.000036601316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001966309,0.00007724739,0.00008175067,0.00009809518,0.000071319024,0.00007943037,0.00044957243,0.00004040997,0.00001685811],"category_scores_gemma":[0.000021737915,0.00006895015,0.000013140801,0.00029870635,0.000041870207,0.00031059954,0.00013764044,0.000056556095,0.00006567761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054996784,0.001063956,0.021904226,0.00010377412,0.000013337325,0.000048023147,0.006772577,0.005786999,0.007907311,0.03360469,0.022753235,0.89998686],"study_design_scores_gemma":[0.00026951023,0.000066596105,0.0023611179,0.00003533799,7.4443204e-7,0.0000049697087,0.000011165841,0.9733059,0.015816087,0.0026909453,0.0052466206,0.00019100697],"about_ca_topic_score_codex":0.000013478618,"about_ca_topic_score_gemma":0.000006527529,"teacher_disagreement_score":0.9675189,"about_ca_system_score_codex":0.000026473208,"about_ca_system_score_gemma":0.000035796937,"threshold_uncertainty_score":0.28117055},"labels":[],"label_agreement":null},{"id":"W2798804265","doi":"10.23919/date.2018.8341974","title":"Sensei: An area-reduction advisor for FPGA high-level synthesis","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; High-level synthesis; Provisioning; Reduction (mathematics); Abstraction; Convolutional neural network; Ranking (information retrieval); Inefficiency; Computer architecture; Computer engineering; Embedded system; Operating system; Artificial intelligence","score_opus":0.04976697727552691,"score_gpt":0.28241082734991063,"score_spread":0.2326438500743837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798804265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005881128,0.000005138575,0.98993075,0.00089597335,0.00034032407,0.00017580381,0.0000034668321,0.0011138212,0.0016535906],"genre_scores_gemma":[0.42452475,0.0000025337897,0.57420594,0.00014749539,0.00016248939,0.000025052532,0.000002406614,0.0000069590405,0.00092236086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906516,0.00004600444,0.00017282684,0.00037518595,0.00012504013,0.00021577952],"domain_scores_gemma":[0.99904925,0.00007600789,0.000070404814,0.00048351564,0.00024354977,0.00007726671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025896737,0.000115346826,0.00012329983,0.00011244675,0.00023000757,0.00013107847,0.00047012494,0.00006664957,0.00003056705],"category_scores_gemma":[0.00007603053,0.00010153422,0.000038400914,0.00021112729,0.00004746699,0.00039291478,0.000081221966,0.000038562735,0.000028669647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071996226,0.00050454016,0.00004587893,0.000038166465,0.00007498359,0.0000030258423,0.0018059724,0.004063394,0.010674679,0.15120566,0.15802298,0.67348874],"study_design_scores_gemma":[0.00021013734,0.00047921966,0.00033922069,0.00002255085,0.000009920066,0.000029267814,0.000037940263,0.72526544,0.25621316,0.010964935,0.006062557,0.00036564487],"about_ca_topic_score_codex":0.00005167894,"about_ca_topic_score_gemma":0.000006175659,"teacher_disagreement_score":0.7212021,"about_ca_system_score_codex":0.000025851576,"about_ca_system_score_gemma":0.000041646792,"threshold_uncertainty_score":0.41404453},"labels":[],"label_agreement":null},{"id":"W2800041898","doi":"10.1155/2018/6093054","title":"A Strategy for Automatic Performance Tuning of Stencil Computations on GPUs","year":2018,"lang":"en","type":"article","venue":"Scientific Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stencil; Computer science; Computation; Parallel computing; Graphics; Heuristic; CUDA; Set (abstract data type); Algorithm; Computational science; Artificial intelligence; Computer graphics (images)","score_opus":0.04995517516243535,"score_gpt":0.3031897655030896,"score_spread":0.25323459034065426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800041898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07012089,0.000028875402,0.9277008,0.00005038841,0.00048818276,0.00037165268,0.0000016826588,0.00052875315,0.000708746],"genre_scores_gemma":[0.594773,3.8749292e-7,0.40496334,0.000015848289,0.000025155648,0.000025292778,0.000004134877,0.0000047137287,0.0001881457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865603,0.00003766883,0.00030457444,0.00039025064,0.00030219232,0.0003092618],"domain_scores_gemma":[0.99875194,0.00010269181,0.00019100415,0.00044028755,0.00045119386,0.00006288936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095848355,0.00010907733,0.00014072047,0.00024600906,0.000593439,0.0003964505,0.0006878791,0.000038093403,0.0000031733791],"category_scores_gemma":[0.00008371835,0.00010175172,0.000058764614,0.0008873729,0.0002387836,0.00028990023,0.00010798015,0.0000635219,0.000013700676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004141104,0.00011554997,0.000120762874,0.00008883411,0.000012032192,5.11409e-7,0.0014844573,0.008045792,0.00035269963,0.012864944,0.00079374114,0.97611654],"study_design_scores_gemma":[0.0001678153,0.00044677974,0.00015184178,0.00011398676,0.0000039915717,0.000003163484,0.000041822674,0.98962486,0.0057749995,0.001033032,0.0025156047,0.0001221028],"about_ca_topic_score_codex":0.0000037164284,"about_ca_topic_score_gemma":0.000002309171,"teacher_disagreement_score":0.98157907,"about_ca_system_score_codex":0.000032965905,"about_ca_system_score_gemma":0.00014693453,"threshold_uncertainty_score":0.45643127},"labels":[],"label_agreement":null},{"id":"W2801455238","doi":"10.1109/iscas.2018.8351128","title":"NIZCache: Energy-efficient Non-uniform Cache Architecture for Chip-multiprocessors Based on Invalid and Zero Lines","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cache; Parallel computing; Computer science; Cache algorithms; Cache pollution; Static random-access memory; Cache-only memory architecture; Cache coloring; CPU cache; Smart Cache; Page cache; Energy consumption; Leakage (economics); Embedded system; Computer hardware; Engineering; Electrical engineering","score_opus":0.016296195964496375,"score_gpt":0.2587527436566252,"score_spread":0.24245654769212882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801455238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048080124,0.000016747703,0.9895712,0.0009343658,0.000118417855,0.00020532994,0.0000027686847,0.000514434,0.0038287365],"genre_scores_gemma":[0.56807125,0.0000023848652,0.42993164,0.0015215742,0.000081615384,0.00002561674,0.000005068475,0.00001069944,0.00035018453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988011,0.0000300072,0.00020844738,0.00047327485,0.00019999749,0.0002871779],"domain_scores_gemma":[0.9990182,0.0001666308,0.000091808346,0.00042194242,0.00019077004,0.000110667344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029993328,0.00019977165,0.00017207926,0.00019437396,0.0002718829,0.0001523733,0.00055268937,0.00009621828,0.000004268876],"category_scores_gemma":[0.00008719975,0.00015219986,0.000055790795,0.00032874543,0.00008577301,0.00006481081,0.00014231389,0.00008952542,0.0000034544778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017531222,0.0006175293,0.0004380822,0.00014682181,0.0000424858,0.0000044351927,0.0022431079,0.7663311,0.001328682,0.03738984,0.017908277,0.17337434],"study_design_scores_gemma":[0.00042563648,0.00034041665,0.000082025144,0.000032909287,0.000003567881,0.000003084382,0.0000043723744,0.96120316,0.032361627,0.0013403276,0.0039920406,0.00021082451],"about_ca_topic_score_codex":0.000046881323,"about_ca_topic_score_gemma":0.000016155567,"teacher_disagreement_score":0.56326324,"about_ca_system_score_codex":0.000020271375,"about_ca_system_score_gemma":0.00006390915,"threshold_uncertainty_score":0.62065303},"labels":[],"label_agreement":null},{"id":"W2803818408","doi":"10.1016/j.future.2018.05.030","title":"PiCo: High-performance data analytics pipelines in modern <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi mathvariant=\"normal\">C</mml:mi><mml:mo>+</mml:mo><mml:mo>+</mml:mo></mml:math>","year":2018,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scalability; Analytics; Pipeline (software); Pipeline transport; Algorithm; Programming language; Computational science; Parallel computing; Database","score_opus":0.02394367527927626,"score_gpt":0.24397898535821666,"score_spread":0.2200353100789404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803818408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39196357,0.0004907814,0.59855163,0.0003519687,0.0075930273,0.00011416032,0.000096831856,0.00048795095,0.0003500794],"genre_scores_gemma":[0.8914377,0.00031517466,0.08784972,0.0011704611,0.017947271,0.00016939444,0.00084376504,0.00015429438,0.0001122109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944413,0.0003005415,0.0014845293,0.001523201,0.0012659235,0.000984542],"domain_scores_gemma":[0.99595207,0.00021379371,0.0010864479,0.0020740947,0.00034252077,0.00033104766],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015359441,0.00064039987,0.00043739396,0.0003780593,0.0009960479,0.0017466528,0.0025844686,0.0008505164,0.000017335578],"category_scores_gemma":[0.00010198068,0.0007855402,0.00027693805,0.00086870283,0.00022516809,0.0017061669,0.0017512843,0.00068358926,0.00036556518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075574535,0.0001519629,0.000024392464,0.0002698817,0.00018531442,0.000074341166,0.00093327207,0.10964516,0.0004087867,0.8487695,0.035603378,0.0038584638],"study_design_scores_gemma":[0.0007422754,0.00047039532,0.00006156847,0.00039283303,0.00010063295,0.0003854227,0.000069662834,0.9833639,0.005761563,0.00011413191,0.007806102,0.00073149457],"about_ca_topic_score_codex":0.00044512597,"about_ca_topic_score_gemma":0.00022012422,"teacher_disagreement_score":0.87371874,"about_ca_system_score_codex":0.000040170584,"about_ca_system_score_gemma":0.00045989538,"threshold_uncertainty_score":0.99945956},"labels":[],"label_agreement":null},{"id":"W2804866494","doi":"10.1109/mc.2018.2381114","title":"Exploiting Typical Values to Accelerate Deep Learning","year":2018,"lang":"en","type":"article","venue":"Computer","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Exploit; Computer science; Deep learning; Computation; Artificial intelligence; Computer architecture; Machine learning; Computer engineering; Embedded system; Data science; Computer security","score_opus":0.02797206352300208,"score_gpt":0.2836419058607506,"score_spread":0.25566984233774853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804866494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144682815,0.000021214239,0.98038536,0.0005252286,0.0004604702,0.00009050463,6.736541e-8,0.0012511705,0.0027977151],"genre_scores_gemma":[0.4134699,0.0000024715118,0.58428067,0.0014477794,0.0005986899,0.000005421322,8.406588e-7,0.000009764962,0.00018447677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987677,0.0001027211,0.00020813117,0.00042716612,0.0001732993,0.00032100827],"domain_scores_gemma":[0.9991807,0.000075390395,0.000058730577,0.00035876845,0.00019188205,0.00013457873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026821427,0.00013795443,0.00014707312,0.00013337898,0.00029757517,0.00034156677,0.00082955527,0.000054843014,0.00002431725],"category_scores_gemma":[0.00003938482,0.00013241154,0.000047800455,0.0003944361,0.000037919755,0.0002656746,0.00071099255,0.00015357377,0.00046862708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024870797,0.000095902695,0.0017760942,0.000014720733,0.00003362363,0.000026509964,0.00540049,0.03389462,0.00047399764,0.024473459,0.027262319,0.9065234],"study_design_scores_gemma":[0.000113803864,0.0002566443,0.0016833963,0.000033163833,0.000001546251,0.000012112578,0.0000059217523,0.9739923,0.0024766633,0.0014317674,0.019764682,0.00022799389],"about_ca_topic_score_codex":0.0000025086406,"about_ca_topic_score_gemma":6.9361533e-7,"teacher_disagreement_score":0.9400977,"about_ca_system_score_codex":0.000025729605,"about_ca_system_score_gemma":0.000017734938,"threshold_uncertainty_score":0.60234094},"labels":[],"label_agreement":null},{"id":"W2805261386","doi":"","title":"DRAFT – Cold Start Knowledge Base Population with the Knowledge Resolver System for TAC-KBP 2015 – DRAFT.","year":2015,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Resolver; Knowledge base; Population; Computer science; Medicine; Telecommunications; Artificial intelligence","score_opus":0.017102696960564746,"score_gpt":0.2730996170518621,"score_spread":0.2559969200912973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805261386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016871019,0.0012082952,0.9912723,0.00031597484,0.000043131917,0.0007192573,0.000010896436,0.00029344618,0.0044496385],"genre_scores_gemma":[0.9764854,0.0000102516915,0.021569753,0.000027937002,0.00008422884,0.00045223034,0.000021515953,0.000012396852,0.001336324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909043,0.00016349876,0.00021881457,0.0002566829,0.00010886546,0.00016167808],"domain_scores_gemma":[0.9983723,0.00036943052,0.00016074716,0.0005623775,0.00044972147,0.00008538496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013627389,0.00013382648,0.00017760899,0.000085691536,0.00030895995,0.00009417715,0.0004841195,0.000055681467,8.194683e-7],"category_scores_gemma":[0.000030228292,0.00009175873,0.00003141306,0.00037877983,0.0001742792,0.00023579464,0.00012454258,0.000066618835,0.0000053126446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043726122,0.000050319486,0.000053721284,0.00006371022,0.000013559359,7.734413e-8,0.0013861775,0.00044954952,0.00004726542,0.99254835,0.0034320848,0.0019114903],"study_design_scores_gemma":[0.0035682742,0.0013664964,0.0006138722,0.00029501144,0.00027915626,0.000050630577,0.0071786945,0.116337456,0.039406437,0.4667907,0.36253953,0.0015737391],"about_ca_topic_score_codex":0.00001545732,"about_ca_topic_score_gemma":0.000013550217,"teacher_disagreement_score":0.97479826,"about_ca_system_score_codex":0.00003690702,"about_ca_system_score_gemma":0.0001240188,"threshold_uncertainty_score":0.37418127},"labels":[],"label_agreement":null},{"id":"W2805845793","doi":"10.14288/1.0367029","title":"Time-travel programming: programming language support for interacting with past executions","year":2018,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Programming language; Computer science; First-generation programming language; Fifth-generation programming language; Programming paradigm","score_opus":0.008892859602442552,"score_gpt":0.2141350761050739,"score_spread":0.20524221650263136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805845793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114373535,0.00001155526,0.88322705,0.00008313125,0.000070262715,0.0004282827,0.000013814413,0.0004489381,0.0013434478],"genre_scores_gemma":[0.6338736,0.0000016275168,0.3647205,0.0000224681,0.000040325467,0.000002288508,0.000016143189,0.000008925272,0.0013141071],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99902296,0.00002976434,0.00011621439,0.0003821094,0.00016200263,0.00028696907],"domain_scores_gemma":[0.9990416,0.000058633614,0.00016584057,0.00029322808,0.00035061227,0.00009005746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022353262,0.0000501197,0.00017596436,0.00006031603,0.0003992824,0.0002575111,0.0005802168,0.00006018535,0.00001547906],"category_scores_gemma":[0.000028424194,0.00014230348,0.000074664415,0.0003687523,0.00023976072,0.0004454141,0.00017558018,0.000086173,0.000011094915],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008933264,0.00014307852,0.0006944522,0.000039394065,0.000034214227,0.000040566898,0.0017435912,0.000020062427,0.00013638061,0.00001454965,0.003944125,0.99318063],"study_design_scores_gemma":[0.008783139,0.008891929,0.52467096,0.0029053586,0.00030993455,0.0017481605,0.019403327,0.36777347,0.00034738673,0.00048345746,0.061051782,0.0036310777],"about_ca_topic_score_codex":0.0044399076,"about_ca_topic_score_gemma":0.008346854,"teacher_disagreement_score":0.9895496,"about_ca_system_score_codex":0.00003936532,"about_ca_system_score_gemma":0.00007893894,"threshold_uncertainty_score":0.6711842},"labels":[],"label_agreement":null},{"id":"W2806882590","doi":"","title":"Unsupervised Multi-Lingual Cold Start Slot Filler Ensembling with the Knowledge Resolver System for TAC-KBP 2016.","year":2016,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Filler (materials); Resolver; Computer science; Artificial intelligence; Materials science; Composite material; Telecommunications","score_opus":0.018505732775567465,"score_gpt":0.26238469206693965,"score_spread":0.24387895929137218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806882590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045779967,0.0005393699,0.9929286,0.000322019,0.000025036727,0.0005404209,0.000010971323,0.00024410315,0.00081146637],"genre_scores_gemma":[0.95511,0.00004426467,0.042655047,0.000039100625,0.000058710775,0.00036714727,0.000002842125,0.000011804127,0.0017110421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923104,0.00009824695,0.00019100402,0.00024585222,0.00008149266,0.00015238932],"domain_scores_gemma":[0.9983351,0.000741929,0.00011918789,0.00048324655,0.00027901024,0.000041497267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007476008,0.000118139345,0.00014975561,0.000063749496,0.0003529487,0.00005671362,0.00048281692,0.000045638648,0.0000018765924],"category_scores_gemma":[0.000026270252,0.00006296228,0.000032605276,0.00020902243,0.00021740596,0.00013943668,0.000103113,0.000043832526,0.000003874917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052131152,0.000040817104,0.000013914834,0.000050851133,0.000023150937,1.037285e-7,0.0012494442,0.00011075416,0.0018965339,0.98391384,0.0004930574,0.012155398],"study_design_scores_gemma":[0.0067783426,0.0011519997,0.0003607976,0.0007805834,0.00022183903,0.00004359032,0.0061369385,0.04824833,0.61783093,0.09668056,0.21994092,0.001825162],"about_ca_topic_score_codex":0.0000040599075,"about_ca_topic_score_gemma":0.000002268443,"teacher_disagreement_score":0.950532,"about_ca_system_score_codex":0.0000141830005,"about_ca_system_score_gemma":0.00007491141,"threshold_uncertainty_score":0.27146316},"labels":[],"label_agreement":null},{"id":"W2807345617","doi":"","title":"RPI BLENDER TAC-KBP2015 system description","year":2015,"lang":"en","type":"article","venue":"Theory and applications of categories","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.021603933809669417,"score_gpt":0.2534892568962807,"score_spread":0.2318853230866113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807345617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017383941,0.0005483226,0.9872816,0.0000921677,0.000040478793,0.00015865797,0.0000015930458,0.00037380971,0.0097649675],"genre_scores_gemma":[0.9594243,0.000021255004,0.039962225,0.000030992243,0.000038421495,0.00007195328,0.0000049659984,0.0000047332223,0.0004411487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935424,0.00009795707,0.00017439318,0.0001694539,0.000109994435,0.00009398323],"domain_scores_gemma":[0.9992196,0.00006538242,0.0001012155,0.0003613901,0.00018494346,0.000067460154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073292124,0.000077979916,0.00011437569,0.00007668591,0.000101875805,0.00006278228,0.00033087225,0.000041879703,0.0000010419632],"category_scores_gemma":[0.000020565012,0.000070046925,0.000018809209,0.00023916033,0.00010685536,0.0002627918,0.000104776635,0.0000469571,0.000008650273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006836624,0.000016804643,0.000041497933,0.000020181757,0.0000053726594,1.275438e-7,0.0004657181,0.00026120813,0.000074316406,0.99226576,0.00045869363,0.006383505],"study_design_scores_gemma":[0.0003233275,0.000086816966,0.00013605904,0.000025958187,0.000020505078,0.000034922905,0.0015588545,0.013050094,0.012700316,0.95785475,0.013952266,0.00025613932],"about_ca_topic_score_codex":0.000009034412,"about_ca_topic_score_gemma":3.282869e-7,"teacher_disagreement_score":0.9576859,"about_ca_system_score_codex":0.000018283126,"about_ca_system_score_gemma":0.000051332863,"threshold_uncertainty_score":0.28564307},"labels":[],"label_agreement":null},{"id":"W2809194293","doi":"10.1145/3183440.3194971","title":"Recommending exception handling patterns with ExAssist","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.020647420565240875,"score_gpt":0.2620377594431323,"score_spread":0.2413903388778914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809194293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011380652,0.0000035297394,0.9739058,0.0004546603,0.00011370681,0.00004917145,1.5480606e-7,0.00078118977,0.013311163],"genre_scores_gemma":[0.64999795,0.0000034827115,0.34933242,0.00028560933,0.000078358644,0.0000030576039,8.09907e-7,0.000003904657,0.00029442742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937505,0.000030174604,0.000107217056,0.0002257044,0.00010805791,0.00015382175],"domain_scores_gemma":[0.99953836,0.00002477789,0.000052656582,0.00026537818,0.00007625901,0.000042548836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017325669,0.0000758418,0.00006973365,0.00007770555,0.00018294397,0.00017250415,0.0003201883,0.000026987198,0.000055004723],"category_scores_gemma":[0.000006843663,0.000058220365,0.000016544,0.00018796432,0.000022707734,0.00026864998,0.00010113962,0.000050476367,0.000034533634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028353117,0.00018240519,0.06036892,0.000030797666,0.000052446183,0.000015706013,0.0022805468,0.0011240771,0.0007136582,0.052041434,0.019322224,0.86383945],"study_design_scores_gemma":[0.00075401337,0.00087972044,0.02059251,0.00023014956,0.000008383412,0.000067455534,0.00004470638,0.93405586,0.028804969,0.0028641368,0.010936122,0.0007619772],"about_ca_topic_score_codex":0.000025942109,"about_ca_topic_score_gemma":0.000016589658,"teacher_disagreement_score":0.9329318,"about_ca_system_score_codex":0.000022866392,"about_ca_system_score_gemma":0.000013669222,"threshold_uncertainty_score":0.23741576},"labels":[],"label_agreement":null},{"id":"W2809361502","doi":"10.1007/978-3-662-43799-5_24","title":"POLY: A New Polynomial Data Structure for Maple 17","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Maple; Speedup; Kernel (algebra); Computer science; Scalability; Parallel computing; Polynomial; Overhead (engineering); Mathematics; Discrete mathematics; Operating system; Botany","score_opus":0.041692571021807213,"score_gpt":0.27418317349596116,"score_spread":0.23249060247415396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809361502","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.981754e-8,0.0003487298,0.8043052,0.00086406793,0.0003586824,0.00024963528,0.00009190222,0.00068252126,0.19309923],"genre_scores_gemma":[0.000036091744,0.000013972351,0.48494697,0.00087918545,0.00061178155,0.0000011537602,0.00024781513,0.000025956802,0.51323706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832916,0.000010392263,0.00031747948,0.00085526484,0.00022459755,0.00026312392],"domain_scores_gemma":[0.9971256,0.00009458686,0.00023159354,0.0023236927,0.00007708454,0.00014741447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015567862,0.00032801076,0.00036820356,0.00015373259,0.0001193615,0.00026486852,0.0034740248,0.00035037578,0.00018832678],"category_scores_gemma":[0.000028712893,0.00029467672,0.00010019998,0.000030966876,0.0000300748,0.00016161411,0.0012887107,0.000218616,0.000028203553],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039105043,0.0000014612899,2.738874e-7,0.000008608937,0.00001966818,6.928071e-7,0.000013990003,0.000029847173,0.0000018572431,0.20868695,0.72729534,0.06393738],"study_design_scores_gemma":[0.00021027285,0.00006184972,7.52185e-7,0.000034354704,0.000014139071,0.000010421673,1.6639216e-7,0.102597386,0.000062072715,0.029580671,0.86707246,0.00035547247],"about_ca_topic_score_codex":0.000043038533,"about_ca_topic_score_gemma":0.000029883595,"teacher_disagreement_score":0.32013783,"about_ca_system_score_codex":0.000030978816,"about_ca_system_score_gemma":0.0002677765,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W2842591198","doi":"10.1109/tcad.2018.2855168","title":"A Lifetime Reliability-Constrained Runtime Mapping for Throughput Optimization in Many-Core Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Nova; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Throughput; Reliability (semiconductor); Constraint (computer-aided design); Computation; Distributed computing; Multi-core processor; Task (project management); Time constraint; Scheme (mathematics); Computer engineering; Parallel computing; Algorithm; Power (physics); Engineering; Wireless; Mathematics","score_opus":0.04215419102446877,"score_gpt":0.2596485821550559,"score_spread":0.2174943911305871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2842591198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012114861,0.00014039986,0.99455106,0.00006109104,0.001484908,0.0018481445,0.000030793446,0.0005283202,0.00014376728],"genre_scores_gemma":[0.7739844,0.000047883663,0.22547697,0.000060503473,0.000107977634,0.00017165743,0.000007704294,0.000031349693,0.00011159215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682176,0.00039954262,0.001179243,0.00083605474,0.00032339612,0.00044002454],"domain_scores_gemma":[0.9973968,0.00058603036,0.00041540057,0.0006592804,0.0008121009,0.0001303807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013830828,0.00039589268,0.0007255103,0.000722345,0.00029123947,0.00033851457,0.00064347556,0.0002834712,0.0000040611108],"category_scores_gemma":[0.00002948695,0.00036362433,0.00012486687,0.0010661739,0.00017775875,0.00042951351,0.000007736654,0.00026484355,0.0000047305416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031771102,0.00018342519,0.000011714305,0.00015393787,0.00006164559,0.0000038683083,0.00074742787,0.98667777,0.00070201396,0.0024146165,0.00026783222,0.0087439995],"study_design_scores_gemma":[0.0009459332,0.00092254527,0.000011753798,0.0008814568,0.000016601065,0.000060172264,0.00010731825,0.995055,0.0013653402,0.00016509918,0.00010981137,0.00035895227],"about_ca_topic_score_codex":0.00026278925,"about_ca_topic_score_gemma":0.0000020896798,"teacher_disagreement_score":0.77277285,"about_ca_system_score_codex":0.00015477343,"about_ca_system_score_gemma":0.0002130956,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W2883343776","doi":"10.1186/s13639-018-0086-1","title":"A novel power model for future heterogeneous 3D chip-multiprocessors in the dark silicon age","year":2018,"lang":"en","type":"article","venue":"EURASIP Journal on Embedded Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Chip; Interconnection; Cache; Very-large-scale integration; Exploit; Power consumption; Power (physics); Embedded system; Hierarchy; Computer architecture; Memory hierarchy; Silicon chip; Parallel computing; Silicon; Telecommunications; Materials science","score_opus":0.03164740645985994,"score_gpt":0.2928438131473978,"score_spread":0.2611964066875379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883343776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016808871,0.0003063009,0.9788636,0.00055655127,0.0011326112,0.0004816082,0.0000053049826,0.00017052307,0.0016746167],"genre_scores_gemma":[0.9290016,0.00002144091,0.068604164,0.0014485624,0.00073160557,0.0000338921,0.000001712399,0.000024551044,0.0001324318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777293,0.00027803236,0.00059728697,0.00039564582,0.0005255241,0.00043056425],"domain_scores_gemma":[0.998387,0.00021282898,0.0003773662,0.0005727825,0.00033778092,0.00011229176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019523794,0.00025395214,0.0003014178,0.00022985053,0.0003914485,0.0006397493,0.0015709614,0.00012991915,0.0000011436588],"category_scores_gemma":[0.00016050025,0.00016906529,0.00013628045,0.00038761273,0.00004779384,0.0003117485,0.000068744084,0.00038440537,0.00001057125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022764389,0.00068550307,0.00006549244,0.000068412584,0.00009488193,0.00018293403,0.045626774,0.9233993,0.0016339151,0.011124069,0.0112714255,0.0056196107],"study_design_scores_gemma":[0.00067548483,0.00038433974,0.00003501453,0.00012271844,0.0000051352467,0.00085597567,0.00035994127,0.99465656,0.0001739554,0.00031020757,0.0021880723,0.00023256778],"about_ca_topic_score_codex":0.0000040948958,"about_ca_topic_score_gemma":0.0000038005624,"teacher_disagreement_score":0.91219276,"about_ca_system_score_codex":0.000075820564,"about_ca_system_score_gemma":0.00008643767,"threshold_uncertainty_score":0.6894282},"labels":[],"label_agreement":null},{"id":"W2883965613","doi":"10.1145/3203217.3203243","title":"Taming irregular applications via advanced dynamic parallelism on GPUs","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Kernel (algebra); Bottleneck; Overhead (engineering); Parallelism (grammar); Parallel computing; Workload; CUDA; Data parallelism; Computer architecture; Embedded system; Operating system","score_opus":0.007174581648149097,"score_gpt":0.26297625810074643,"score_spread":0.2558016764525973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883965613","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006276367,0.000040485273,0.9770942,0.00061300036,0.00011732453,0.0002292485,3.684557e-7,0.0012614755,0.020016283],"genre_scores_gemma":[0.459852,0.000012909954,0.5377734,0.0007314544,0.00004824119,0.000054484583,0.0000032038506,0.0000083233135,0.0015159711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896663,0.000033476495,0.00018528228,0.0004043391,0.00017954838,0.0002306977],"domain_scores_gemma":[0.99897295,0.00004697626,0.00007567695,0.0007162881,0.00011638896,0.00007174104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014157032,0.00012745836,0.00011204287,0.000114848066,0.0002498503,0.00008597001,0.000764426,0.000055352673,0.000019284194],"category_scores_gemma":[0.0000094436355,0.00011717416,0.000043968066,0.00037407296,0.000060007682,0.00019168382,0.00015779663,0.00008355178,0.00024174861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008627951,0.00015213081,0.00001988882,0.00000932789,0.000017976061,0.0000025877368,0.00044782305,0.007431892,0.0017047965,0.2155429,0.0028995732,0.7717625],"study_design_scores_gemma":[0.00021687118,0.00015561098,0.00019161425,0.000016297068,0.000002319021,0.0000073868955,0.000007639197,0.94526225,0.0055334875,0.017330784,0.03101566,0.00026009162],"about_ca_topic_score_codex":0.0000059495187,"about_ca_topic_score_gemma":0.0000023938314,"teacher_disagreement_score":0.9378303,"about_ca_system_score_codex":0.00004196571,"about_ca_system_score_gemma":0.000022420518,"threshold_uncertainty_score":0.47782236},"labels":[],"label_agreement":null},{"id":"W2884245241","doi":"10.1515/itit-2018-0012","title":"Dual-pivot and beyond: The potential of multiway partitioning in quicksort","year":2018,"lang":"en","type":"article","venue":"it - Information Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quicksort; Computer science; Parallel computing; Sorting; Algorithm; Sorting algorithm","score_opus":0.006651832624758269,"score_gpt":0.23924594134956362,"score_spread":0.23259410872480535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884245241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041575063,0.000026594813,0.95156085,0.0041733803,0.000106767235,0.00013014792,0.0000010386082,0.0003245031,0.0021016363],"genre_scores_gemma":[0.90163445,0.000024782765,0.09777417,0.0005236312,0.000013061703,0.000013837253,0.0000021128158,0.0000017913297,0.000012154516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992816,0.000022568593,0.00035316276,0.00009184438,0.00010953122,0.00014132814],"domain_scores_gemma":[0.9993692,0.000024333927,0.00017930483,0.00027768966,0.00013435975,0.000015133939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604456,0.00006776512,0.00009712106,0.000383281,0.00011928353,0.000050078987,0.00033661933,0.00010642737,0.0000059746467],"category_scores_gemma":[0.000083341314,0.000054939115,0.000015248433,0.0005507736,0.00021129343,0.0006652574,0.00022277982,0.00011498952,0.000016870003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026475107,0.000104237704,0.0064400854,0.00005929959,0.000034214827,0.000006232718,0.010520392,0.008847076,0.0008569446,0.5615601,0.011406787,0.40013814],"study_design_scores_gemma":[0.00070129277,0.00029150664,0.0069003934,0.000043024043,0.000004667431,0.0001030535,0.0006929817,0.9284001,0.017395934,0.035619196,0.009614485,0.0002333367],"about_ca_topic_score_codex":0.000024043902,"about_ca_topic_score_gemma":0.000010729093,"teacher_disagreement_score":0.91955304,"about_ca_system_score_codex":0.000014785908,"about_ca_system_score_gemma":0.000027981176,"threshold_uncertainty_score":0.22403522},"labels":[],"label_agreement":null},{"id":"W2884343737","doi":"10.1109/isca.2018.00027","title":"A Case for Richer Cross-Layer Abstractions: Bridging the Semantic Gap with Expressive Memory","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Toronto","funders":"","keywords":"Computer science; Software portability; Bridging (networking); Computer architecture; Semantic gap; Semantics (computer science); Distributed computing; Programming language; Computer network","score_opus":0.04477366523209216,"score_gpt":0.3220718718456535,"score_spread":0.27729820661356136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884343737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014021643,0.000025651527,0.97714424,0.0006380432,0.000118538796,0.00028490787,7.126924e-7,0.00049306185,0.007273204],"genre_scores_gemma":[0.76108336,0.0000015452496,0.23594737,0.0006033759,0.00015443163,0.00004895755,4.209569e-7,0.000008306298,0.0021522408],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920297,0.000031484946,0.00015170929,0.00028262244,0.00012103905,0.00021016438],"domain_scores_gemma":[0.99894077,0.00016500356,0.00010128697,0.00047092303,0.00027938347,0.00004266691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028111812,0.000106853644,0.00008686839,0.0000525429,0.0005559855,0.0003511363,0.0004030075,0.000037316167,0.000025214342],"category_scores_gemma":[0.000038048427,0.000064225635,0.00003965951,0.00017059757,0.00010949874,0.00034439572,0.00010333447,0.00008088245,0.00002735084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041188282,0.0013124482,0.0035258727,0.0003466131,0.000818057,0.0026628678,0.030705817,0.17854181,0.0051192157,0.12717347,0.47601053,0.1733714],"study_design_scores_gemma":[0.00037677138,0.00014700995,0.00022148195,0.000026368374,0.000011103027,0.0016667495,0.000077725184,0.97665393,0.017531402,0.0012420787,0.0018151955,0.00023016073],"about_ca_topic_score_codex":0.00007791295,"about_ca_topic_score_gemma":0.000020411204,"teacher_disagreement_score":0.79811215,"about_ca_system_score_codex":0.0000172236,"about_ca_system_score_gemma":0.000045051227,"threshold_uncertainty_score":0.4276247},"labels":[],"label_agreement":null},{"id":"W2885000039","doi":"10.1109/isca.2018.00025","title":"Scheduling Page Table Walks for Irregular GPU Applications","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Australian School of Taxation, University of New South Wales; Society for the Study of School Psychology","keywords":"Computer science; SIMD; Thread (computing); Bottleneck; Scheduling (production processes); Parallel computing; Speedup; Compiler; Multithreading; Operating system; Embedded system","score_opus":0.019521208641658103,"score_gpt":0.27862848510473287,"score_spread":0.25910727646307474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885000039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009313578,0.00004522269,0.9844488,0.00050737406,0.000073035546,0.00030229305,8.292097e-7,0.0009289352,0.013600399],"genre_scores_gemma":[0.09252155,0.000004733873,0.90444773,0.00045413483,0.00014786611,0.000118244214,0.000003645769,0.0000067851734,0.0022953071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992901,0.00001312779,0.00014184733,0.0002775326,0.000082160455,0.00019524204],"domain_scores_gemma":[0.9992609,0.0000489839,0.00004949974,0.0004547487,0.0001329981,0.000052866628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018392733,0.000076183416,0.00008216295,0.00006340649,0.00032733672,0.00013197484,0.0005894616,0.00004574121,0.000015571444],"category_scores_gemma":[0.000015334925,0.000070454305,0.000034241068,0.0003106836,0.00003652726,0.00018742438,0.00013211973,0.000038546154,0.000038667076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003431532,0.0000807715,0.000059758207,0.000017789145,0.0000153077,3.044296e-7,0.00019885771,0.0022593508,0.0027797746,0.9238228,0.014349075,0.056412745],"study_design_scores_gemma":[0.00012078674,0.000052105614,0.000015774653,0.0000063655034,0.0000022690701,0.000002314428,0.0000068491654,0.8835451,0.020080207,0.019170325,0.076867804,0.0001300977],"about_ca_topic_score_codex":0.0000035422358,"about_ca_topic_score_gemma":8.2951954e-7,"teacher_disagreement_score":0.90465254,"about_ca_system_score_codex":0.000010193838,"about_ca_system_score_gemma":0.000034070756,"threshold_uncertainty_score":0.28730434},"labels":[],"label_agreement":null},{"id":"W2885253887","doi":"10.1109/ipdpsw.2018.00112","title":"Mitigating Critical Path Decompression Latency in Compressed L1 Data Caches Via Prefetching","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; Latency (audio); Energy consumption; Cache algorithms; Cache pollution; Speedup; CPU cache; CAS latency; Critical path method; Embedded system; Computer hardware; Semiconductor memory; Memory controller","score_opus":0.05185325566285349,"score_gpt":0.3353142840272037,"score_spread":0.2834610283643502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885253887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010556902,0.000070714836,0.9821077,0.00055664335,0.00018938122,0.00011351116,0.0000016595116,0.0007028299,0.005700681],"genre_scores_gemma":[0.5687894,0.00000407258,0.43089727,0.00020716347,0.000057150868,0.0000029151895,0.000007431698,0.0000060643815,0.0000285277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982699,0.00017700919,0.00036709048,0.00061100675,0.00023457254,0.0003404062],"domain_scores_gemma":[0.99832064,0.0003044798,0.000070065726,0.0011034898,0.00010426961,0.000097033546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005617951,0.00015025471,0.0001830612,0.00011742638,0.00022025856,0.00020473232,0.0018765718,0.00008165221,0.000030805495],"category_scores_gemma":[0.00024124498,0.00013147347,0.000023341185,0.00031223704,0.000088738765,0.0008724045,0.0014869994,0.00019706873,0.000027726372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012312122,0.003016768,0.07643868,0.00057460065,0.00011884326,0.00030251415,0.02143536,0.020297164,0.04502139,0.18343922,0.057708934,0.5915234],"study_design_scores_gemma":[0.0001652405,0.000048113372,0.0019551036,0.0001359825,0.000001802026,0.0000076107262,0.000013867801,0.9861685,0.004739072,0.0063393717,0.00023874774,0.00018660504],"about_ca_topic_score_codex":0.00021992161,"about_ca_topic_score_gemma":0.00002508539,"teacher_disagreement_score":0.96587133,"about_ca_system_score_codex":0.000021790152,"about_ca_system_score_gemma":0.00004353707,"threshold_uncertainty_score":0.5361333},"labels":[],"label_agreement":null},{"id":"W2885364395","doi":"10.1137/1.9781611975215.7","title":"Multi-criteria Graph Partitioning with Scotch","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Polygon mesh; Computer science; Graph partition; Monte Carlo method; Task (project management); Graph; Mathematical optimization; Algorithm; Theoretical computer science; Mathematics; Engineering; Statistics","score_opus":0.07030585657788034,"score_gpt":0.2676367760326233,"score_spread":0.19733091945474296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885364395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056248336,0.000027282766,0.90861183,0.000043637272,0.00011958699,0.00096332986,0.000025157786,0.0004508603,0.08970203],"genre_scores_gemma":[0.00039728358,0.000014029907,0.94523406,0.00015560469,0.00040315822,0.000112693386,0.000027247064,0.000059060705,0.053596843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858856,0.0000036972715,0.0003917327,0.00048890914,0.00022452771,0.00030254317],"domain_scores_gemma":[0.9988908,0.00010549281,0.00037159224,0.00039984,0.00012311134,0.000109176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040130175,0.0003628712,0.00044650486,0.00005271087,0.0003861065,0.0002949953,0.0004005836,0.00049933046,0.000012444366],"category_scores_gemma":[0.0000076302995,0.00030579205,0.00022742109,0.000028279648,0.00023916255,0.000047329617,0.00021035523,0.00030791134,0.0000053050785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023435477,0.000052198746,3.502172e-7,0.00024308346,0.00034543403,0.0000010412256,0.0036543114,0.000028385737,0.00016274305,0.9580573,0.02995859,0.0074731237],"study_design_scores_gemma":[0.004812533,0.00066149805,2.4044522e-7,0.0017548692,0.00037364187,0.000036407026,0.00020688206,0.052613236,0.0042883335,0.8481193,0.08495881,0.00217423],"about_ca_topic_score_codex":9.923192e-7,"about_ca_topic_score_gemma":0.0000011140271,"teacher_disagreement_score":0.10993798,"about_ca_system_score_codex":0.00002969194,"about_ca_system_score_gemma":0.00010590769,"threshold_uncertainty_score":0.99993944},"labels":[],"label_agreement":null},{"id":"W2885732802","doi":"10.1145/3233182","title":"An Analytical Cache Performance Evaluation Framework for Embedded Out-of-Order Processors Using Software Characteristics","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache algorithms; Cache coloring; Cache pollution; Suite; Cache invalidation; Cache-oblivious algorithm; CPU cache; Software; Smart Cache; Operating system","score_opus":0.07488792703293126,"score_gpt":0.3688907058631187,"score_spread":0.29400277883018744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885732802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08650207,0.000021424137,0.9106203,0.00005239253,0.0013345565,0.0007734221,0.000010465843,0.0006447521,0.00004061736],"genre_scores_gemma":[0.5462823,0.0000025364468,0.45343456,0.00006937347,0.00014424283,0.000023960452,0.000008711319,0.000023119315,0.000011215974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970828,0.00034443752,0.0008018714,0.00069801847,0.000632505,0.00044035134],"domain_scores_gemma":[0.99582803,0.0005456297,0.0005150208,0.0013161427,0.0016626115,0.00013257984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017849173,0.00031162307,0.00046168218,0.00032449505,0.00057353836,0.00027086548,0.0012132266,0.0002434863,0.000005913593],"category_scores_gemma":[0.00046387513,0.0003131047,0.0001165062,0.0008150905,0.00010939733,0.00046322728,0.000030028345,0.00031110714,0.0000071547015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102756516,0.0005913102,0.00039781383,0.00032874805,0.00017454059,0.0000011040624,0.010324939,0.8793672,0.00030131414,0.003894437,0.000049397142,0.104466476],"study_design_scores_gemma":[0.00037813053,0.00053890666,0.0001646222,0.0004425668,0.00006684953,0.000010610214,0.00015549162,0.9955914,0.0016071899,0.00066601555,0.000036353435,0.00034184087],"about_ca_topic_score_codex":0.000012364041,"about_ca_topic_score_gemma":0.0000012979856,"teacher_disagreement_score":0.45978022,"about_ca_system_score_codex":0.00014235044,"about_ca_system_score_gemma":0.00032749478,"threshold_uncertainty_score":0.9999321},"labels":[],"label_agreement":null},{"id":"W2886113345","doi":"10.1109/ipdps.2018.00058","title":"Work-Stealing, Locality-Aware Actor Scheduling","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Locality; Scalability; Scheduling (production processes); Distributed computing; Schedule; Operating system","score_opus":0.024853899938381253,"score_gpt":0.28229695187212245,"score_spread":0.2574430519337412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886113345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002992779,0.000026165557,0.9835664,0.00059010944,0.00025031532,0.00006639922,1.8851836e-7,0.0015387892,0.010968879],"genre_scores_gemma":[0.5365811,0.0000030507617,0.461868,0.00068488787,0.00012959394,0.0000022664237,7.8948784e-7,0.000005189815,0.00072514196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990225,0.00005035682,0.00018761274,0.00031918922,0.00017749323,0.0002428622],"domain_scores_gemma":[0.9991277,0.00004489555,0.000062348714,0.0005024949,0.00017338086,0.00008917015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029125396,0.0001075764,0.00010988075,0.00008009213,0.00017733847,0.00018623382,0.0007576656,0.00006788988,0.000061641396],"category_scores_gemma":[0.000030454295,0.000093922405,0.00004364333,0.00046657494,0.000059812708,0.00023261442,0.00027798914,0.00010006602,0.00018375584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048915095,0.00053588353,0.017952066,0.0000782895,0.00013947915,0.000039724215,0.004733758,0.012417177,0.00043015822,0.41833338,0.09879185,0.44649932],"study_design_scores_gemma":[0.00017200176,0.00009273673,0.0002968753,0.00005088888,0.0000025582797,0.0000053856343,0.000016568125,0.97166985,0.010382604,0.0030133429,0.013987494,0.00030966577],"about_ca_topic_score_codex":0.00001844824,"about_ca_topic_score_gemma":0.0000024481428,"teacher_disagreement_score":0.9592527,"about_ca_system_score_codex":0.000024495934,"about_ca_system_score_gemma":0.000044991655,"threshold_uncertainty_score":0.38300446},"labels":[],"label_agreement":null},{"id":"W2887131903","doi":"10.1145/3150928.3150958","title":"Fast Min-plus Convolution and Deconvolution on GPUs","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia","keywords":"Deconvolution; Convolution (computer science); Computer science; Speedup; Computation; Parallel computing; Set (abstract data type); Algorithm; Computational science; Blind deconvolution; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.021364033269066066,"score_gpt":0.2744745736674216,"score_spread":0.25311054039835557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887131903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012934553,0.000043003693,0.95856583,0.0008829285,0.00021613696,0.00008849443,4.070739e-7,0.00038038247,0.026888289],"genre_scores_gemma":[0.89324695,0.000032393582,0.104572564,0.00024593176,0.00003713325,0.00000459544,0.0000010693248,0.000003643736,0.0018557053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934673,0.00002537637,0.00010966327,0.00026469413,0.00010841655,0.00014512781],"domain_scores_gemma":[0.99918723,0.000027482407,0.00010234472,0.0005684404,0.000054796466,0.000059721926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017450452,0.00008584861,0.000091053895,0.000061670245,0.00049658335,0.00033919173,0.00048519508,0.000051017403,0.000005716645],"category_scores_gemma":[0.00005208158,0.000077217206,0.000022423817,0.000033276854,0.000060994917,0.0003685552,0.0002037694,0.00006264868,0.000036984413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027110702,0.00009403191,0.004642776,0.000020444999,0.000023053268,0.00001326786,0.0004575236,0.0035073778,0.00050721277,0.77363586,0.021015184,0.19605617],"study_design_scores_gemma":[0.00042350392,0.00012525317,0.024516769,0.00002563511,0.0000025178165,0.00001566069,0.0000062261843,0.9642986,0.0031973333,0.005314361,0.0018812233,0.00019293914],"about_ca_topic_score_codex":0.000067030975,"about_ca_topic_score_gemma":0.000009348727,"teacher_disagreement_score":0.96079123,"about_ca_system_score_codex":0.00003709422,"about_ca_system_score_gemma":0.000027200711,"threshold_uncertainty_score":0.3819368},"labels":[],"label_agreement":null},{"id":"W2888171537","doi":"10.1007/978-3-319-92792-3_2","title":"Building the Infrastructure for Deploying FPGAs in the Cloud","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Provisioning; Cloud computing; Field-programmable gate array; Data center; Computer science; Server; Software deployment; Software; Resource (disambiguation); Embedded system; Computer architecture; Operating system; Computer network","score_opus":0.021312089287942485,"score_gpt":0.2693358765406408,"score_spread":0.2480237872526983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888171537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010701109,0.00012575684,0.87298256,0.00095707783,0.00031250468,0.0004332663,0.0000013982269,0.00029072232,0.12488601],"genre_scores_gemma":[0.0042705694,0.000082607105,0.93581754,0.004703931,0.0010878048,0.00005119178,0.0000050891913,0.00005278956,0.053928502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884456,0.000038701095,0.0002801238,0.00037541514,0.0002335467,0.00022766649],"domain_scores_gemma":[0.9985633,0.00035984238,0.00017291747,0.0007814154,0.000099581,0.000022926248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007387461,0.0002282539,0.00018744638,0.00011024692,0.0002580394,0.0002938263,0.0022808246,0.00019145902,0.000028223434],"category_scores_gemma":[0.00004482471,0.000121363315,0.00011464119,0.00007757737,0.000075496064,0.00009635826,0.00033659904,0.00033818305,0.000009177517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019517997,0.0000022941801,0.0000022336167,0.000008774194,0.000010587428,0.0000015387582,0.0005437921,0.002107516,0.0000014306381,0.9290895,0.05854206,0.009688335],"study_design_scores_gemma":[0.00009768945,0.000048848873,0.000009546831,0.00007743643,0.000007547615,0.00001966417,0.0000089953055,0.11825944,0.000052930536,0.46963727,0.41156194,0.00021869638],"about_ca_topic_score_codex":0.0000069032762,"about_ca_topic_score_gemma":0.000009073456,"teacher_disagreement_score":0.4594522,"about_ca_system_score_codex":0.000038551945,"about_ca_system_score_gemma":0.0000612053,"threshold_uncertainty_score":0.49490523},"labels":[],"label_agreement":null},{"id":"W2888279336","doi":"10.1504/ijhpcn.2019.097051","title":"Performance evaluation of OpenMP's target construct on GPUs - exploring compiler optimisations","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; CUDA; Parallel computing; Fortran; Programming language; Programming paradigm; Implementation; Construct (python library); Set (abstract data type); IBM; Supercomputer","score_opus":0.06125931175195404,"score_gpt":0.3097343786552617,"score_spread":0.24847506690330767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888279336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82607853,0.00014777418,0.16995995,0.00012953,0.002504362,0.00007759008,6.176409e-7,0.000048979247,0.001052648],"genre_scores_gemma":[0.90436786,0.00034073676,0.09413649,0.00009686729,0.0010404327,0.0000017386274,0.000002297387,0.00000890804,0.000004635556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793893,0.000117777294,0.0006651676,0.00021107643,0.00086525164,0.0002017703],"domain_scores_gemma":[0.9972853,0.0001593508,0.0007526261,0.00018690566,0.0015519119,0.00006389473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018063905,0.00015291804,0.00024825003,0.0003495841,0.0002500401,0.00013561301,0.00079717115,0.00004747249,0.000009597028],"category_scores_gemma":[0.000041381063,0.000140728,0.000054412263,0.00025407036,0.00012489394,0.0006605773,0.00023342457,0.00022706922,0.0000025818065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007179487,0.00006536778,0.018299479,0.000010410158,0.000106569605,0.0000029339717,0.00091136695,0.43864828,0.00007873903,0.0012885219,0.00027166918,0.5402449],"study_design_scores_gemma":[0.0007325653,0.00038456605,0.015779642,0.00071326835,0.000015143412,0.00011214679,0.000019990657,0.97735626,0.004137785,0.00021024312,0.0003895604,0.00014882744],"about_ca_topic_score_codex":0.000004690631,"about_ca_topic_score_gemma":3.5883517e-7,"teacher_disagreement_score":0.54009604,"about_ca_system_score_codex":0.0000880719,"about_ca_system_score_gemma":0.000117712756,"threshold_uncertainty_score":0.57387215},"labels":[],"label_agreement":null},{"id":"W2889264321","doi":"10.1145/3237009.3237020","title":"Sparse matrices on the web","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sparse matrix; Physics","score_opus":0.026229127451675677,"score_gpt":0.2637854605819529,"score_spread":0.23755633313027721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889264321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025899576,0.00001154911,0.8121996,0.004136958,0.00012072803,0.00005101453,1.01553326e-7,0.000633125,0.18025698],"genre_scores_gemma":[0.8284318,0.000016345437,0.16583535,0.0033039995,0.00010840805,0.0000035697026,1.1404777e-7,0.0000029416897,0.0022974736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995525,0.000034179047,0.00006855456,0.00013584264,0.00010792218,0.000101034035],"domain_scores_gemma":[0.99945873,0.00007759329,0.000028432536,0.00036612785,0.00004774402,0.000021368993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020201333,0.000049015354,0.000037610153,0.0000407953,0.00013621527,0.00011333708,0.0006677667,0.000018230026,0.00007222928],"category_scores_gemma":[0.000022428016,0.000027156935,0.000018927849,0.00023916825,0.000035140056,0.00007575837,0.000118523705,0.00004146523,0.00043836294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016835421,0.0000264671,0.00008785915,8.0781456e-7,0.000004062412,0.000001164363,0.00015545645,0.00015011271,0.00006488643,0.742281,0.24705642,0.010170042],"study_design_scores_gemma":[0.00007179427,0.00016564374,0.00022850418,0.0000110650535,0.0000010869213,0.000004668881,0.000007591844,0.8900481,0.010635677,0.009696845,0.08899807,0.00013095883],"about_ca_topic_score_codex":0.000005654397,"about_ca_topic_score_gemma":0.000001679795,"teacher_disagreement_score":0.889898,"about_ca_system_score_codex":0.0000058689284,"about_ca_system_score_gemma":0.000017202861,"threshold_uncertainty_score":0.5634415},"labels":[],"label_agreement":null},{"id":"W2889271070","doi":"10.1109/ispdc2018.2018.00021","title":"Global Application States Monitoring Applied to Graph Partitioning Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Asynchronous communication; Graph; Benchmark (surveying); Distributed computing; Parallel computing; Theoretical computer science","score_opus":0.011646267004468594,"score_gpt":0.27160515798036666,"score_spread":0.2599588909758981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889271070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010572198,0.0000071817485,0.98452574,0.00029501558,0.00013301718,0.00019592627,6.3882715e-7,0.0012790647,0.012506211],"genre_scores_gemma":[0.44932446,0.0000043248815,0.5503247,0.00019087175,0.00008602586,0.00003582957,0.0000039845977,0.0000035449184,0.00002629573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990797,0.00001928914,0.00018554913,0.00034053664,0.00017049817,0.00020444965],"domain_scores_gemma":[0.9993074,0.00001715799,0.00006136024,0.00034714382,0.00017372581,0.000093245835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017049412,0.00010054585,0.00008475786,0.000083306724,0.00023148536,0.00019950084,0.00042769837,0.000040486913,0.000007650058],"category_scores_gemma":[0.0000121455805,0.00010165773,0.000021158996,0.0008847169,0.000024927645,0.00021486449,0.00015353765,0.000029435108,0.000060889568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048516,0.00002058669,0.002000719,0.0000028300847,0.000006299711,2.0667954e-7,0.00022481733,0.8981125,0.00011926981,0.07911819,0.0015411746,0.01884858],"study_design_scores_gemma":[0.000110290515,0.00006504906,0.0010607553,0.000011317295,0.000002392071,0.0000019033101,0.00001995194,0.9781352,0.009199291,0.010560109,0.0006344879,0.00019921438],"about_ca_topic_score_codex":0.00003218817,"about_ca_topic_score_gemma":0.0000033097517,"teacher_disagreement_score":0.44826722,"about_ca_system_score_codex":0.00005345613,"about_ca_system_score_gemma":0.000019016776,"threshold_uncertainty_score":0.4145482},"labels":[],"label_agreement":null},{"id":"W2889319417","doi":"10.1109/ccece.2018.8447736","title":"An Energy-Efficient Cache Architecture for Chip-Multiprocessors Based on Non-Uniformity Accesses","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache-only memory architecture; Embedded system; Parsec; System on a chip; Energy consumption; Chip; Cache algorithms; Efficient energy use; Memory architecture; CPU cache; Computer architecture; Cache coloring; Engineering; Electrical engineering","score_opus":0.015361396698092883,"score_gpt":0.28279447580970946,"score_spread":0.26743307911161657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889319417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067755003,0.0000037563593,0.9860963,0.00040701692,0.00011849396,0.0001887522,0.0000032315254,0.00084523944,0.0055617034],"genre_scores_gemma":[0.63233733,7.387219e-7,0.36612737,0.0013081675,0.000093116956,0.000026569674,0.000006533378,0.000008967968,0.00009119983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872845,0.00004326662,0.00018875829,0.000498894,0.00023141789,0.00030918405],"domain_scores_gemma":[0.9987583,0.00012495878,0.00009383253,0.00065988675,0.0002397459,0.00012328182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029054776,0.00018439404,0.00014932879,0.00018743766,0.00033142234,0.0002096704,0.0011803806,0.00008538182,0.0000096832055],"category_scores_gemma":[0.00005807673,0.00014149916,0.000064423584,0.00040942166,0.0000637847,0.00014106679,0.00009059319,0.000083852676,0.000005329906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006470726,0.0006566773,0.00021341516,0.00003353678,0.000010403778,0.0000013933324,0.00043643804,0.9104365,0.00029608468,0.013201536,0.0027739299,0.071875356],"study_design_scores_gemma":[0.00028648681,0.00045349737,0.00024765302,0.00001708075,0.0000023272673,0.000001224313,0.000004468348,0.94936085,0.046747874,0.0009074678,0.0017669536,0.00020413086],"about_ca_topic_score_codex":0.00006265198,"about_ca_topic_score_gemma":0.00003773782,"teacher_disagreement_score":0.62556183,"about_ca_system_score_codex":0.000026705944,"about_ca_system_score_gemma":0.00009937398,"threshold_uncertainty_score":0.57701683},"labels":[],"label_agreement":null},{"id":"W2892310816","doi":"10.1109/fccm.2018.00010","title":"Evaluating the Performance Efficiency of a Soft-Processor, Variable-Length, Parallel-Execution-Unit Architecture for FPGAs Using the RISC-V ISA","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx","keywords":"Datapath; Computer science; Parallel computing; Pipeline (software); Speedup; Field-programmable gate array; Microarchitecture; Computer architecture; Instruction set; Architecture; Variable (mathematics); Latency (audio); Embedded system; Operating system","score_opus":0.060988008237633354,"score_gpt":0.34397888134115906,"score_spread":0.2829908731035257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892310816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037279375,0.00010153041,0.9595019,0.00057379383,0.00016115037,0.0005374675,0.0000016499121,0.0002517009,0.0015914273],"genre_scores_gemma":[0.41280317,0.000006012667,0.5863661,0.00035624977,0.000115697374,0.000033848162,0.0000012342082,0.000009911272,0.0003077966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828684,0.00016350034,0.00039857934,0.00037333783,0.00040325327,0.0003745067],"domain_scores_gemma":[0.99776185,0.00053087925,0.00029588657,0.0007623097,0.0006083258,0.00004077071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018503156,0.00018610619,0.00018570466,0.000087172986,0.0010436695,0.00014792335,0.0016825164,0.000074137344,0.000020508085],"category_scores_gemma":[0.00029698963,0.00010200472,0.00007993417,0.00079814484,0.00025346526,0.00019042911,0.00031488496,0.00018690535,0.0000047571925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004122898,0.00008472226,0.00014078357,0.000080244776,0.000036763373,1.2462819e-7,0.0033650917,0.952263,0.0012067059,0.022564037,0.00076992915,0.019447386],"study_design_scores_gemma":[0.00024533662,0.0003414303,0.000041543513,0.00006156592,0.000017403889,0.000015563746,0.00004645957,0.9894672,0.0044395663,0.004368635,0.0008044247,0.00015084831],"about_ca_topic_score_codex":0.000039081508,"about_ca_topic_score_gemma":0.0000036553442,"teacher_disagreement_score":0.37552378,"about_ca_system_score_codex":0.00002186344,"about_ca_system_score_gemma":0.00021682079,"threshold_uncertainty_score":0.8027168},"labels":[],"label_agreement":null},{"id":"W2893723147","doi":"10.1002/cpe.4862","title":"Communication‐aware message matching in MPI","year":2018,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Message queue; Message passing; Message Passing Interface; Speedup; Asynchronous communication; Scalability; Parallel computing; Queue; Matching (statistics); Distributed computing; Computer network; Operating system","score_opus":0.024626881156139355,"score_gpt":0.3474426032332346,"score_spread":0.32281572207709525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2893723147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049035262,0.0010388062,0.9448367,0.0012134735,0.00010858998,0.000104698476,4.2951723e-7,0.00016799576,0.003494048],"genre_scores_gemma":[0.9124656,0.0005128775,0.08628633,0.0006721709,0.00001849323,0.000016461374,0.0000024508224,0.0000035481924,0.000022100003],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989963,0.00017796627,0.00024099853,0.00030773884,0.0001286402,0.00014831666],"domain_scores_gemma":[0.9990749,0.00034959323,0.00014239407,0.00022150288,0.00015178147,0.000059872946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037053466,0.000105459985,0.00011484995,0.00009444348,0.00031912889,0.0002616895,0.00030282594,0.00004519691,0.0000047416706],"category_scores_gemma":[0.00012949079,0.00010749772,0.000011025525,0.00031960034,0.00016083171,0.0015962386,0.00025278097,0.00013876233,0.0000060950747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047066867,0.0002960853,0.002913997,0.000060853898,0.00002061726,0.000024771136,0.17271787,0.0011805048,0.00019269386,0.2507152,0.0012547754,0.57057554],"study_design_scores_gemma":[0.0010005877,0.00029439773,0.0054618036,0.00025744713,0.000010095094,0.00018689294,0.0066068587,0.93836856,0.0007919394,0.03435651,0.011987975,0.0006769445],"about_ca_topic_score_codex":0.000065089036,"about_ca_topic_score_gemma":0.000005149377,"teacher_disagreement_score":0.937188,"about_ca_system_score_codex":0.000012298771,"about_ca_system_score_gemma":0.000036295027,"threshold_uncertainty_score":0.438363},"labels":[],"label_agreement":null},{"id":"W2895677426","doi":"10.1145/3241793.3241805","title":"Use of CPU Performance Counters for Accelerator Selection in HLS-Generated CPU-Accelerator Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Central processing unit; Workload; CPU shielding; Computer science; Embedded system; Software; Selection (genetic algorithm); Computer performance; Computer hardware; Parallel computing; Operating system; Artificial intelligence","score_opus":0.05861109184145542,"score_gpt":0.2763250489781322,"score_spread":0.2177139571366768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895677426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33480743,0.000019113353,0.6640207,0.000034547527,0.00027222632,0.00032270417,0.0000024385577,0.0003030796,0.00021776724],"genre_scores_gemma":[0.8880366,0.000019797173,0.11125478,0.00016040893,0.00009040576,0.000039418635,0.0000039276324,0.000011205908,0.0003834677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998779,0.00005878615,0.00040457703,0.00033358159,0.00016652759,0.00025752667],"domain_scores_gemma":[0.99895674,0.000054944216,0.00016116757,0.00023182195,0.0005433209,0.000052025644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031310698,0.00014389894,0.00021403661,0.00022498284,0.00012056555,0.00024209794,0.00040941435,0.00009115991,0.000007942948],"category_scores_gemma":[0.000030419415,0.00013141768,0.000035737758,0.0007297962,0.000042964784,0.0007822226,0.00007201132,0.00007022259,0.000006296736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080576324,0.0015476907,0.10224884,0.0011402334,0.00032978583,0.0000071286836,0.0061323284,0.34424692,0.22825642,0.06406281,0.2121597,0.039062396],"study_design_scores_gemma":[0.0002416735,0.00027339114,0.00091558247,0.00004384181,0.0000019622184,0.0000038010455,0.000008325348,0.9062854,0.089202024,0.000009337636,0.0028605661,0.00015407937],"about_ca_topic_score_codex":0.000129823,"about_ca_topic_score_gemma":0.0000226616,"teacher_disagreement_score":0.5620385,"about_ca_system_score_codex":0.00007723515,"about_ca_system_score_gemma":0.00011069049,"threshold_uncertainty_score":0.5359057},"labels":[],"label_agreement":null},{"id":"W2897878462","doi":"10.1109/access.2018.2876597","title":"A Hybrid Architecture With Low Latency Interfaces Enabling Dynamic Cache Management","year":2018,"lang":"en","type":"article","venue":"IEEE Access","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Xeon; PCI Express; Cache; Field-programmable gate array; Embedded system; Latency (audio); Parallel computing; Computer architecture; Operating system","score_opus":0.011755215991084254,"score_gpt":0.27683929265047363,"score_spread":0.2650840766593894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897878462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091914065,0.00004941673,0.903662,0.00026303183,0.00027924683,0.00016685625,7.4973883e-7,0.0006091935,0.0030554435],"genre_scores_gemma":[0.89228266,0.000023830167,0.10694284,0.0003265172,0.000055722758,0.000015240317,0.0000013419815,0.000011777954,0.00034005902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989026,0.000043366283,0.00016162981,0.00041749197,0.00020365731,0.00027126496],"domain_scores_gemma":[0.9992044,0.000024431762,0.00009770918,0.00052068674,0.0000964237,0.00005635279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001530664,0.00015477175,0.0001286886,0.00018606137,0.00016443453,0.0004402279,0.0016463255,0.000028260747,0.000009574612],"category_scores_gemma":[0.0000049402133,0.00011888253,0.000026317775,0.00036539108,0.00006993891,0.0004210827,0.000342464,0.00012802692,0.000024033729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015828821,0.0005015438,0.0014885404,0.00037196622,0.00041465438,0.00046328973,0.0042686495,0.21825849,0.0014179713,0.0049101864,0.013078522,0.75466794],"study_design_scores_gemma":[0.0008026639,0.0004512222,0.0012620656,0.0005150105,0.00002731974,0.00011682005,0.000020609374,0.88820314,0.093282185,0.011471034,0.0029621301,0.0008857743],"about_ca_topic_score_codex":0.000027118713,"about_ca_topic_score_gemma":0.000015484471,"teacher_disagreement_score":0.8003686,"about_ca_system_score_codex":0.000032278036,"about_ca_system_score_gemma":0.000022552447,"threshold_uncertainty_score":0.4847889},"labels":[],"label_agreement":null},{"id":"W2898048683","doi":"10.1145/3243176.3243179","title":"ComP-net","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa; Fundação para a Ciência e a Tecnologia; U.S. Department of Energy; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Stencil; Scalability; Latency (audio); Kernel (algebra); Energy consumption; Cache; Host (biology); Parallel computing; Efficient energy use; Cache coherence; Distributed computing; CPU cache; Operating system; Computational science; Cache algorithms; Telecommunications","score_opus":0.01756234828340047,"score_gpt":0.26793790486917934,"score_spread":0.25037555658577887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898048683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003212057,0.0000066921566,0.83354324,0.00044496884,0.00010324846,0.00002320484,4.8383832e-8,0.0008265017,0.1647309],"genre_scores_gemma":[0.3983644,0.0000015480886,0.59884596,0.00087481,0.000059837355,9.774908e-7,2.7710686e-7,0.0000017211854,0.0018505167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996017,0.000016676096,0.000069707006,0.00013470958,0.00007564211,0.000101561716],"domain_scores_gemma":[0.9995958,0.00001549974,0.00001829479,0.00027084159,0.00006664228,0.000032912838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097400014,0.000040490613,0.000043164615,0.000039250826,0.00007584531,0.000070493465,0.00047199594,0.000018363586,0.00005407969],"category_scores_gemma":[0.000008796659,0.00003387395,0.000014333336,0.0001731824,0.000032038894,0.00011556171,0.00014422106,0.000026397789,0.00026197915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013331272,0.000038218437,0.0005776317,0.0000017625317,0.0000056538615,0.00000229658,0.00027493044,0.000155756,0.000119144206,0.72816557,0.23485756,0.03580013],"study_design_scores_gemma":[0.00010085268,0.00010447745,0.000946603,0.000004432602,5.2921075e-7,0.00000895405,0.000002115361,0.90418243,0.008654259,0.011754238,0.07410836,0.00013275385],"about_ca_topic_score_codex":0.000008735112,"about_ca_topic_score_gemma":0.0000014428941,"teacher_disagreement_score":0.9040267,"about_ca_system_score_codex":0.000005569605,"about_ca_system_score_gemma":0.000012561843,"threshold_uncertainty_score":0.33672994},"labels":[],"label_agreement":null},{"id":"W2898977042","doi":"","title":"Design and Analysis of Efficient Inter-core Communication in GPUs","year":2018,"lang":"en","type":"article","venue":"International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Core (optical fiber); Parallel computing; Multi-core processor; Computer architecture; Telecommunications","score_opus":0.014238400297660853,"score_gpt":0.27583450085834393,"score_spread":0.26159610056068305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898977042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13131231,0.000041487147,0.86615705,0.001270933,0.00008780768,0.00011812229,0.0000039236365,0.000070815244,0.00093752693],"genre_scores_gemma":[0.85200036,0.000019225748,0.14766686,0.00023878379,0.000014547693,0.0000065978775,0.000011013015,0.000004704312,0.000037894974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905825,0.00011164226,0.00026223794,0.0002791405,0.00017528985,0.0001134587],"domain_scores_gemma":[0.9991119,0.00017587133,0.00013801409,0.00039571564,0.00014746362,0.00003107369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028547255,0.00010825071,0.00016219166,0.0005880559,0.000049102044,0.000058199024,0.0008542329,0.00005704511,0.000010481561],"category_scores_gemma":[0.000030192683,0.00009796463,0.000054503176,0.0006676538,0.000115303155,0.00004312737,0.00025469676,0.00013592256,0.0000030909107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019802962,0.00044144847,0.005876504,0.000012661439,0.0005048702,0.000006454251,0.009649011,0.8711485,0.0562906,0.01902633,0.0004958792,0.036349695],"study_design_scores_gemma":[0.0002296497,0.00012763546,0.0043544117,0.00005333514,0.000016321836,0.0000065765007,0.000006726667,0.9732485,0.020687541,0.00079642644,0.0003533817,0.000119526674],"about_ca_topic_score_codex":0.00004596321,"about_ca_topic_score_gemma":0.000016857006,"teacher_disagreement_score":0.72068805,"about_ca_system_score_codex":0.000050787054,"about_ca_system_score_gemma":0.000016059816,"threshold_uncertainty_score":0.39948815},"labels":[],"label_agreement":null},{"id":"W2899399853","doi":"10.1109/cluster.2018.00029","title":"Scalable Shared-Memory Parallelization of the Block Recursive Inversion Algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Parallel computing; Computer science; Block (permutation group theory); Shared memory; Inversion (geology); Inverse; Distributed memory; Parallel algorithm; Reduction (mathematics); Computational complexity theory; Execution time; Algorithm; Block size; Mathematics; Key (lock)","score_opus":0.012297222746157126,"score_gpt":0.23932869852574062,"score_spread":0.2270314757795835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899399853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001353784,0.000029228982,0.98267406,0.00065792917,0.00026436575,0.00014289867,0.0000010155724,0.0002512092,0.014625517],"genre_scores_gemma":[0.18260697,0.000025174313,0.8129916,0.00089621736,0.00009974646,0.000005045571,0.0000029166358,0.000008193107,0.0033641164],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991778,0.00006905634,0.00017903045,0.000220537,0.00021367984,0.00013987596],"domain_scores_gemma":[0.9990251,0.000030127161,0.00012526983,0.00048643808,0.00029611905,0.000036919722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017618157,0.00008160356,0.00009272331,0.00006448738,0.0001718505,0.00004558631,0.0008040526,0.0000578737,0.000035117904],"category_scores_gemma":[0.000043388423,0.000057454665,0.000048273767,0.000536866,0.00009082491,0.00023067386,0.00036209513,0.000058607322,0.000029554913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023110995,0.0004386632,0.002569684,0.000059587328,0.0000796688,0.000003827793,0.0056193857,0.017319422,0.001911749,0.07811212,0.66273564,0.23112713],"study_design_scores_gemma":[0.00018798457,0.0001019042,0.00056333817,0.000047751328,0.000003817453,0.0000049148716,0.000021386822,0.93147814,0.059937604,0.0043114796,0.0032146685,0.00012698436],"about_ca_topic_score_codex":0.00003976301,"about_ca_topic_score_gemma":0.0000031309557,"teacher_disagreement_score":0.91415876,"about_ca_system_score_codex":0.000023954368,"about_ca_system_score_gemma":0.000053210242,"threshold_uncertainty_score":0.23429333},"labels":[],"label_agreement":null},{"id":"W2900091459","doi":"10.1145/3274281","title":"Exposing Implementation Details of Embedded DRAM Memory Controllers through Latency-based Analysis","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dram; Compiler; CAS latency; Latency (audio); Memory controller; Embedded system; Reverse engineering; Operating system; Computer architecture; Parallel computing; Computer hardware","score_opus":0.02432357727265661,"score_gpt":0.31388011552449024,"score_spread":0.28955653825183364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900091459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025025906,0.000080116326,0.9717628,0.00015390533,0.0007460188,0.00058077375,0.000009982581,0.0009387638,0.0007017297],"genre_scores_gemma":[0.72966635,0.000004395267,0.27001706,0.00015775564,0.00006978158,0.000020771582,0.0000106453435,0.000020534048,0.00003271729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656075,0.0004207751,0.0011290126,0.0007619436,0.0006151604,0.0005123491],"domain_scores_gemma":[0.9965247,0.00049699616,0.0007085403,0.0015834385,0.0005754256,0.00011089943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091670424,0.00035500707,0.000711963,0.0007482507,0.00062141166,0.00025636758,0.0013331551,0.00015883388,0.00002817613],"category_scores_gemma":[0.000041870564,0.000357453,0.0004013115,0.0024004646,0.00015053313,0.00040091234,0.000034474535,0.00022911961,0.000018099146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050995422,0.00022060958,0.00016074022,0.00006299923,0.0008211226,0.0000044866715,0.00580253,0.97190934,0.0013196168,0.0012836757,0.00020516104,0.018158719],"study_design_scores_gemma":[0.0013174925,0.0003875141,0.00012583028,0.00011740551,0.0002513484,0.000007248945,0.0008248485,0.9676981,0.028510632,0.0003212098,0.000054214815,0.0003841411],"about_ca_topic_score_codex":0.00030728447,"about_ca_topic_score_gemma":0.000024597937,"teacher_disagreement_score":0.70464045,"about_ca_system_score_codex":0.00014292629,"about_ca_system_score_gemma":0.00017536455,"threshold_uncertainty_score":0.99988776},"labels":[],"label_agreement":null},{"id":"W2900224194","doi":"10.1109/mm.2018.2877288","title":"Accelerators and Coherence: An SoC Perspective","year":2018,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation of Sri Lanka; Defense Advanced Research Projects Agency; Ministère de l'Économie, de la Science et de l'Innovation - Québec; University of Illinois at Chicago; Politecnico di Torino","keywords":"Computer science; Computer architecture; Memory hierarchy; System on a chip; Embedded system; Coherence (philosophical gambling strategy); Variety (cybernetics); Perspective (graphical); Isolation (microbiology); Operating system","score_opus":0.02276054028272846,"score_gpt":0.29678628881643376,"score_spread":0.2740257485337053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900224194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21798101,0.00011165284,0.7758849,0.0003056793,0.00027296366,0.000094998664,0.0000011083367,0.00052158313,0.004826099],"genre_scores_gemma":[0.84285265,0.000009746828,0.15632755,0.00044646033,0.00014083816,0.0000031268248,3.3371947e-7,0.000005452497,0.00021384077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993729,0.000040974315,0.000083220315,0.00028654427,0.00007150968,0.0001448408],"domain_scores_gemma":[0.9994514,0.000016669146,0.000039152193,0.00025608548,0.00017313287,0.000063562205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120526085,0.0000814782,0.00007866169,0.00005735921,0.00016447257,0.00017778407,0.00038273886,0.000045397006,0.000010966756],"category_scores_gemma":[0.000009452903,0.00007669427,0.000015143344,0.00016902873,0.00010320553,0.0002706293,0.000074058684,0.00006670484,0.000025506462],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072223906,0.00079827727,0.0099019995,0.000042741434,0.0001636751,0.00006489951,0.07522523,0.000302909,0.4039009,0.15587379,0.19646984,0.15718354],"study_design_scores_gemma":[0.0007033188,0.0009684361,0.004225108,0.00004497307,0.000009721725,0.00008295295,0.00040013224,0.08094848,0.87619716,0.027268428,0.008305517,0.00084577047],"about_ca_topic_score_codex":0.000049553448,"about_ca_topic_score_gemma":0.000006830118,"teacher_disagreement_score":0.6248717,"about_ca_system_score_codex":0.000026495187,"about_ca_system_score_gemma":0.000040781506,"threshold_uncertainty_score":0.31275016},"labels":[],"label_agreement":null},{"id":"W2900365206","doi":"10.1145/3240765.3243484","title":"Machine learning for performance and power modeling of heterogeneous systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.019252283442337426,"score_gpt":0.24880978843640453,"score_spread":0.2295575049940671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900365206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03658788,0.00016752191,0.96114546,0.00001830156,0.00006664084,0.000086431784,2.0356674e-7,0.00018807882,0.0017395045],"genre_scores_gemma":[0.85450184,0.000023343777,0.14523903,0.000023055047,0.000014401725,0.000003602916,4.2770517e-7,0.0000036503682,0.0001906639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954915,0.000015273201,0.00013333689,0.00014030068,0.00006322534,0.00009869465],"domain_scores_gemma":[0.99965733,0.000022039027,0.000047564874,0.00012799965,0.00012116366,0.000023891416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018471599,0.00005385372,0.00008759357,0.00004954056,0.00009559732,0.000040939514,0.0001709005,0.000024534827,0.0000012833929],"category_scores_gemma":[0.000013002711,0.00004524623,0.000015796631,0.000065441214,0.000018567074,0.000097624055,0.000084746105,0.000029404873,9.348783e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001013898,0.000015459409,0.0008714164,0.000048829294,0.0000115056355,2.2175733e-7,0.00042718742,0.9854524,0.00015575651,0.008233715,0.0000800209,0.004693359],"study_design_scores_gemma":[0.00008371253,0.00021850468,0.000005525159,0.000017050592,9.714084e-7,0.000009487748,0.0000028322777,0.9980178,0.0011641398,0.00007974639,0.00034256087,0.000057656413],"about_ca_topic_score_codex":0.000015715517,"about_ca_topic_score_gemma":3.8441522e-7,"teacher_disagreement_score":0.81791395,"about_ca_system_score_codex":0.0000046465943,"about_ca_system_score_gemma":0.000008381684,"threshold_uncertainty_score":0.18450877},"labels":[],"label_agreement":null},{"id":"W2900766348","doi":"10.1109/ispass.2019.00016","title":"Modeling Deep Learning Accelerator Enabled GPUs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; CUDA; General-purpose computing on graphics processing units; Graphics processing unit; Parallel computing; Titan (rocket family); Tensor (intrinsic definition); Graphics; Multi-core processor; Deep learning; Turing; Architecture; Computational science; Computer architecture; Computer graphics (images); Artificial intelligence; Programming language; Mathematics","score_opus":0.028497941407294062,"score_gpt":0.2693901509174634,"score_spread":0.24089220951016932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900766348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029493026,0.00033301467,0.97580296,0.0001607776,0.00065231393,0.00027748258,2.6170235e-7,0.0026703791,0.017153513],"genre_scores_gemma":[0.5465665,0.00013332846,0.45085558,0.00022577953,0.000090545276,0.00002047516,0.0000106230655,0.000021590384,0.0020755832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979536,0.00013367474,0.00038872715,0.0008467399,0.00031088118,0.00036639321],"domain_scores_gemma":[0.99846196,0.000052886207,0.00015741432,0.0009901228,0.00024412326,0.00009348596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043283275,0.000306449,0.0003749089,0.00022608401,0.00015601801,0.0007419383,0.0018790175,0.00032786146,0.00003648949],"category_scores_gemma":[0.00005698979,0.000294002,0.00014591725,0.00019967763,0.000010219425,0.00023271011,0.0030357975,0.0009365995,0.00012404849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013004702,0.000014225488,0.00005434785,0.000032717933,0.000015853282,0.0000026086439,0.00021404367,0.99096084,0.000014286631,0.0032201475,0.00025694087,0.005212669],"study_design_scores_gemma":[0.0001075075,0.00002237275,0.0000043685445,0.00006472355,0.0000047872572,0.0000031838201,0.000009137123,0.99514496,0.0005222224,0.003285725,0.00045585315,0.00037512826],"about_ca_topic_score_codex":0.00007884527,"about_ca_topic_score_gemma":0.0000020873215,"teacher_disagreement_score":0.5436172,"about_ca_system_score_codex":0.00007961854,"about_ca_system_score_gemma":0.00016692131,"threshold_uncertainty_score":0.9999512},"labels":[],"label_agreement":null},{"id":"W2901073342","doi":"10.1109/ispass.2019.00028","title":"Analyzing Machine Learning Workloads Using a Detailed GPU Simulator","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; General-purpose computing on graphics processing units; Architecture; Code (set theory); Deep learning; FLOPS; Computer architecture; CUDA; Source code; Artificial intelligence; Parallel computing; Operating system; Programming language; Graphics","score_opus":0.016855592853522495,"score_gpt":0.26417113385239543,"score_spread":0.24731554099887293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901073342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094886445,0.00014235174,0.90094066,0.000061547886,0.00009732285,0.00009573904,7.638225e-8,0.00092241436,0.0028534255],"genre_scores_gemma":[0.69034034,0.000006406319,0.30840793,0.000097654076,0.000018471941,7.306716e-7,8.0746133e-7,0.000007813893,0.001119865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897116,0.00008403812,0.00020801908,0.00033252168,0.00015573675,0.00024853006],"domain_scores_gemma":[0.99931395,0.000087279135,0.00009681913,0.00036441546,0.00006945435,0.00006807863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031069742,0.00012733234,0.0001747025,0.00016253853,0.00013491644,0.00019180907,0.0005009827,0.000056042023,0.0000832046],"category_scores_gemma":[0.00003669954,0.000113760005,0.00006975901,0.00053593004,0.000010422916,0.00031254554,0.00027669957,0.0001792261,0.00008706224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034182765,0.000020326243,0.07762082,0.0000072782814,0.000016885357,0.0000034494556,0.00011537367,0.9120245,0.0009602506,0.0036298374,0.00003981235,0.0055580745],"study_design_scores_gemma":[0.00017158748,0.000031167823,0.0003098874,0.000024883406,0.0000030594229,0.0000047118747,0.000003878821,0.9973428,0.001101131,0.00019640714,0.0006457099,0.00016472916],"about_ca_topic_score_codex":0.000028191145,"about_ca_topic_score_gemma":0.0000017888061,"teacher_disagreement_score":0.59545386,"about_ca_system_score_codex":0.000038699432,"about_ca_system_score_gemma":0.000035772966,"threshold_uncertainty_score":0.46389982},"labels":[],"label_agreement":null},{"id":"W2901612323","doi":"10.1109/nocarc.2018.8541207","title":"Value-Based Deep Learning Hardware Acceleration","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exploit; Computer science; Deep learning; Retraining; Hardware acceleration; Acceleration; Efficient energy use; Energy (signal processing); Artificial neural network; Computer engineering; Artificial intelligence; Computer architecture; Embedded system; Field-programmable gate array","score_opus":0.020112730786629465,"score_gpt":0.2688489871341832,"score_spread":0.24873625634755375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901612323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006079718,0.000013341682,0.9714,0.00043462196,0.00011144022,0.000058639587,4.7218347e-8,0.0013994131,0.025974529],"genre_scores_gemma":[0.5021661,0.0000015027616,0.49647656,0.0006295228,0.00007008572,0.000003523813,0.0000025383522,0.000004043554,0.0006461417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993044,0.000066413384,0.00011831898,0.00022377486,0.00014248177,0.00014457307],"domain_scores_gemma":[0.9994826,0.00003568147,0.000048607275,0.00023996303,0.00015071478,0.000042434986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019888899,0.000073462375,0.00006526566,0.0000796149,0.00023870659,0.00020731577,0.00039855842,0.00004067195,0.000063641295],"category_scores_gemma":[0.000048429225,0.000066701665,0.000028943226,0.00025475546,0.000025664387,0.000246896,0.00008476669,0.00007511145,0.00011868286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001846642,0.00017452055,0.004645767,0.000023389079,0.00002665709,0.000009192024,0.0016602387,0.26443774,0.0026488898,0.29639414,0.018311469,0.41164953],"study_design_scores_gemma":[0.00009852473,0.000096168704,0.00031229245,0.00000600977,8.723669e-7,0.0000012118863,0.0000030120668,0.974367,0.016057948,0.00073608744,0.00822346,0.00009738309],"about_ca_topic_score_codex":0.000011709918,"about_ca_topic_score_gemma":0.0000025052186,"teacher_disagreement_score":0.7099293,"about_ca_system_score_codex":0.000020037813,"about_ca_system_score_gemma":0.000031046136,"threshold_uncertainty_score":0.27200148},"labels":[],"label_agreement":null},{"id":"W2901967734","doi":"10.2175/193864718824828498","title":"Thermal Hydrolysis Full Scale System Performance","year":2018,"lang":"en","type":"article","venue":"Proceedings of the Water Environment Federation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Jacobs (Canada)","funders":"","keywords":"Scale (ratio); Hydrolysis; Thermal; Environmental science; Materials science; Process engineering; Chemistry; Thermodynamics; Engineering; Physics; Organic chemistry","score_opus":0.005883819668870252,"score_gpt":0.17475356042626913,"score_spread":0.16886974075739888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901967734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9087477,0.0000050832714,0.08628132,0.00060499413,0.00009412217,0.00017274177,1.9858183e-7,0.00016792573,0.003925955],"genre_scores_gemma":[0.9753204,0.00000499423,0.024104172,0.00005245482,0.00008181234,0.0000152544035,6.719524e-7,0.0000067377855,0.000413473],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915487,0.000009844116,0.00020576248,0.00022024145,0.00024980312,0.0001595129],"domain_scores_gemma":[0.99965394,0.0000034135282,0.00011354032,0.00016008405,0.000044462264,0.000024544473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028238219,0.00010015952,0.00009622937,0.000040398685,0.00037405387,0.00013976321,0.00052771845,0.000043251486,0.000008092582],"category_scores_gemma":[0.0000021512985,0.000053898737,0.000045296547,0.00006390642,0.00006618665,0.0004073832,0.0002993952,0.000053767486,0.000042555803],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043385517,0.0001359903,0.008182832,0.00014106162,0.000043120024,1.2406603e-7,0.0055376724,0.011643237,0.9608157,0.002147558,0.0008016311,0.01050764],"study_design_scores_gemma":[0.00008079887,0.000081626,0.0013383926,0.00002474312,0.0000057436077,0.0000032132773,0.000015246951,0.33860064,0.65942067,0.000046541874,0.00030466725,0.00007772647],"about_ca_topic_score_codex":0.0000023346513,"about_ca_topic_score_gemma":1.7129098e-7,"teacher_disagreement_score":0.3269574,"about_ca_system_score_codex":0.000055971257,"about_ca_system_score_gemma":0.0000036619572,"threshold_uncertainty_score":0.28769577},"labels":[],"label_agreement":null},{"id":"W2902399661","doi":"10.1109/hpec.2018.8547546","title":"Scalable RMA-based Communication Library Featuring Node-local NVMs","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Lawrence Berkeley National Laboratory; Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Scalability; Dram; Bottleneck; Cache; Exploit; Node (physics); Non-volatile memory; Embedded system; Distributed computing; Computer network; Operating system; Computer hardware","score_opus":0.013520784736245179,"score_gpt":0.241299534091976,"score_spread":0.2277787493557308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902399661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008056559,0.00006425419,0.93122977,0.0021328775,0.00007143281,0.00007270934,3.0009963e-7,0.001860454,0.063762575],"genre_scores_gemma":[0.455567,0.000007335521,0.54202855,0.0011795029,0.000029127395,0.000004524465,0.000005017508,0.0000068808476,0.0011720614],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991797,0.00008520178,0.00016090593,0.00023720917,0.00014216907,0.00019478754],"domain_scores_gemma":[0.9988766,0.00007048462,0.000058622118,0.00084005564,0.00008604703,0.000068248635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017386483,0.000098826655,0.000094984454,0.000100519435,0.0002583038,0.00024892038,0.001142356,0.000062826235,0.00007285213],"category_scores_gemma":[0.000013529874,0.00008990751,0.000032476783,0.00047504157,0.000105676525,0.00066575373,0.00040454822,0.00010633788,0.00012315235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057883877,0.0006142042,0.007206432,0.00006881334,0.00005065075,0.000012560907,0.0012307313,0.068382405,0.00069479266,0.2640414,0.471226,0.18641412],"study_design_scores_gemma":[0.00015717631,0.000045360885,0.00053319195,0.000029812449,0.0000012232384,0.0000028504921,0.0000042826655,0.94181573,0.046229534,0.0013856003,0.009654931,0.00014027988],"about_ca_topic_score_codex":0.000024093375,"about_ca_topic_score_gemma":0.0000019109043,"teacher_disagreement_score":0.87343335,"about_ca_system_score_codex":0.00001788092,"about_ca_system_score_gemma":0.00007082348,"threshold_uncertainty_score":0.3666322},"labels":[],"label_agreement":null},{"id":"W2903065227","doi":"10.1007/978-3-319-99322-5_20","title":"Approximate Cache Architectures","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Cache pollution; Parallel computing; Cache coloring; Cache algorithms; Page cache; CPU cache; Smart Cache; Cache-only memory architecture; Operating system; Embedded system","score_opus":0.021496640829810225,"score_gpt":0.2461222572733634,"score_spread":0.22462561644355317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903065227","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.755848e-7,0.00007257829,0.5045557,0.000121058176,0.00009038354,0.000078498706,0.0000010082774,0.0009172095,0.4941631],"genre_scores_gemma":[0.0001456052,0.00003171945,0.4079029,0.00059341046,0.00016904698,0.0000037139316,0.0000059637505,0.000024114792,0.5911235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987835,0.000014860398,0.00023440429,0.0005143672,0.00024398128,0.00020887723],"domain_scores_gemma":[0.9987794,0.000041628507,0.00014612195,0.00085334695,0.00010133545,0.00007814068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013359077,0.00027526336,0.00024272397,0.00019057469,0.00009452719,0.0001525618,0.0011848015,0.00022642156,0.0003795587],"category_scores_gemma":[0.000010692527,0.00022810746,0.000115160874,0.00003474012,0.00008020881,0.000041584055,0.00048938097,0.00023906305,0.000304654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022233824,0.000009378409,0.0000012870288,0.000022404178,0.000039024824,0.000012080765,0.00020006183,0.00030596112,0.0000027042902,0.86673856,0.10251957,0.03014673],"study_design_scores_gemma":[0.00011058129,0.00012220076,0.0000019874258,0.000103851155,0.00001113875,0.000045363464,8.1298174e-7,0.08444071,0.00050760136,0.515098,0.39883745,0.0007203476],"about_ca_topic_score_codex":0.0000069179614,"about_ca_topic_score_gemma":0.0000041817193,"teacher_disagreement_score":0.3516406,"about_ca_system_score_codex":0.000025856696,"about_ca_system_score_gemma":0.00005676263,"threshold_uncertainty_score":0.9301952},"labels":[],"label_agreement":null},{"id":"W2904014149","doi":"","title":"Finding Flatter Minima with SGD","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Maxima and minima; Computer science; Artificial intelligence; Mathematics; Mathematical analysis","score_opus":0.0514478710076336,"score_gpt":0.3483785570925074,"score_spread":0.29693068608487383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904014149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014591397,0.0000019785384,0.8108089,0.0050795823,0.0002584369,0.000087099914,0.0000011501487,0.00045987812,0.16871159],"genre_scores_gemma":[0.91530854,0.0000059101612,0.078551896,0.00041400755,0.00015220756,0.000020875366,0.00001417453,0.000009171077,0.0055232137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880487,0.00007712637,0.00019082364,0.00039248413,0.00036313105,0.00017158643],"domain_scores_gemma":[0.9989278,0.00011622199,0.00014098547,0.00029248095,0.00046410775,0.000058460555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014957464,0.00011747068,0.00009028044,0.0002339667,0.00027754557,0.0003745242,0.00071065465,0.000039933137,0.00032658636],"category_scores_gemma":[0.000127414,0.00010516283,0.0000349432,0.00025957706,0.00009802163,0.0003720422,0.00013600347,0.00021108621,0.00027663255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011938559,0.00027696794,0.049181912,0.000008984355,0.00022735496,0.00006790343,0.010069911,0.020244172,0.0030319574,0.85189617,0.019087015,0.045788255],"study_design_scores_gemma":[0.00058641314,0.0005294085,0.012464699,0.00014002783,0.000007353925,0.000051318413,0.000228669,0.96236897,0.00517142,0.0057022017,0.012342072,0.0004074706],"about_ca_topic_score_codex":0.000025496656,"about_ca_topic_score_gemma":0.000007007877,"teacher_disagreement_score":0.9421248,"about_ca_system_score_codex":0.000037716854,"about_ca_system_score_gemma":0.00006699921,"threshold_uncertainty_score":0.42884156},"labels":[],"label_agreement":null},{"id":"W2904066832","doi":"10.1504/ijhpcn.2019.10018085","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Cache; Parallel computing; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904066832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066374,0.00012526075,0.29126096,0.00015089707,0.0013976147,0.00004244601,4.3446133e-7,0.00002951951,0.00035547136],"genre_scores_gemma":[0.9707931,0.0001089403,0.028103942,0.0001337936,0.00084676844,4.0283075e-7,7.867632e-7,0.000005793418,0.0000064305254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988013,0.000061471044,0.00045330529,0.00015523013,0.00037875344,0.00014993767],"domain_scores_gemma":[0.9985469,0.0001328506,0.00060824153,0.000106300366,0.0005622064,0.00004351321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.00010306245,0.00017192325,0.00022883149,0.00013638058,0.00009095839,0.00055958075,0.000031986427,0.0000034188104],"category_scores_gemma":[0.000013098215,0.00008947385,0.000043634187,0.00018331107,0.000055368317,0.00012199482,0.0002021479,0.00014343525,0.0000013347399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009240693,0.00008618272,0.013171628,0.000010079363,0.00013103175,0.000010559735,0.0022962878,0.13406332,0.00019160082,0.002666976,0.00050269876,0.84677726],"study_design_scores_gemma":[0.0007410528,0.00066286296,0.026555767,0.00043721384,0.0000091266475,0.00010989251,0.000051695293,0.9572979,0.01304689,0.00025006995,0.0006867768,0.00015072663],"about_ca_topic_score_codex":0.000023844601,"about_ca_topic_score_gemma":0.0000012891899,"teacher_disagreement_score":0.8466265,"about_ca_system_score_codex":0.000060154332,"about_ca_system_score_gemma":0.000051049898,"threshold_uncertainty_score":0.36486375},"labels":[],"label_agreement":null},{"id":"W2905372857","doi":"10.1109/micro.2018.00028","title":"TAPAS: Generating Parallel Accelerators from Parallel Programs","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Toolchain; Computer science; Parallel computing; Compiler; Xeon Phi; Instruction-level parallelism; Concurrency; Multithreading; Speedup; Data parallelism; Software; Programming language; Parallelism (grammar); Thread (computing)","score_opus":0.03179908922811905,"score_gpt":0.2706739740714183,"score_spread":0.23887488484329925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905372857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012328398,0.00008488015,0.97455925,0.0004443089,0.00030257375,0.00022117859,7.0525726e-7,0.0021361178,0.009922586],"genre_scores_gemma":[0.24232055,0.000013300459,0.7555403,0.0010687718,0.00037032098,0.00003284567,0.000011593996,0.00001384137,0.0006284365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819016,0.000094732524,0.00036724043,0.00062533433,0.0002929797,0.0004295736],"domain_scores_gemma":[0.99871534,0.00005011731,0.00013413599,0.00074626156,0.0002023672,0.00015177246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002473764,0.00022786683,0.00021281336,0.00008903637,0.00034665255,0.0005853416,0.0012368278,0.00011355373,0.00008786265],"category_scores_gemma":[0.00003270254,0.00019603415,0.00007949346,0.00043975265,0.00009243427,0.0005063615,0.00040324198,0.00013818007,0.00020685654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038581267,0.00070839183,0.0127935605,0.000018565182,0.00021108137,0.00004544423,0.0048951674,0.010579363,0.0018960813,0.17399696,0.10166235,0.69315445],"study_design_scores_gemma":[0.00036235809,0.00019939894,0.0004248538,0.000022825234,0.000004451368,0.0000050395593,0.00002445654,0.9806181,0.0022213499,0.005061474,0.010629184,0.0004264774],"about_ca_topic_score_codex":0.0001965596,"about_ca_topic_score_gemma":0.000035442383,"teacher_disagreement_score":0.9700388,"about_ca_system_score_codex":0.00003115519,"about_ca_system_score_gemma":0.000068131805,"threshold_uncertainty_score":0.799404},"labels":[],"label_agreement":null},{"id":"W2907785891","doi":"10.1145/3286475.3286484","title":"Challenges of High-Capacity DRAM Stacks and Potential Directions","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Dram; Computer science; Non-volatile random-access memory; Bandwidth (computing); Semiconductor memory; Memory bandwidth; Stacking; Universal memory; Registered memory; Embedded system; Computer memory; Interleaved memory; Parallel computing; Computer architecture; Computer hardware; Memory refresh; Computer network","score_opus":0.025278732357558408,"score_gpt":0.25717849604817006,"score_spread":0.23189976369061166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907785891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016953306,0.00010680638,0.96398,0.00066471094,0.00015323046,0.00004541056,5.458523e-7,0.00038573408,0.01771026],"genre_scores_gemma":[0.74237585,0.00015775558,0.25726295,0.000035447774,0.000039840266,0.0000013064806,1.494114e-7,0.0000020096443,0.00012469268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994785,0.000035736226,0.0001093016,0.0001879384,0.00009279158,0.00009572508],"domain_scores_gemma":[0.9995341,0.000022961012,0.000046463196,0.00023781163,0.000121327,0.000037369187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366595,0.000057483605,0.0000884201,0.00006955811,0.00009268962,0.000034073935,0.00020694808,0.000037914586,0.000010037278],"category_scores_gemma":[0.000016590293,0.000050276376,0.000018230698,0.00011388511,0.000094588315,0.00014871616,0.00013928908,0.000039694907,0.000004289266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055794394,0.00014010366,0.00013523476,0.0000192966,0.00003100029,0.0000011096236,0.0010683964,0.00019464362,0.00070992496,0.80873454,0.0024370116,0.18652315],"study_design_scores_gemma":[0.0011100455,0.0016114305,0.05032721,0.000098198085,0.0000270754,0.0000951806,0.00011470006,0.6291723,0.14274907,0.16334757,0.010406451,0.0009407056],"about_ca_topic_score_codex":0.00006551178,"about_ca_topic_score_gemma":0.000014465677,"teacher_disagreement_score":0.72542256,"about_ca_system_score_codex":0.0000052935748,"about_ca_system_score_gemma":0.000011275542,"threshold_uncertainty_score":0.20502111},"labels":[],"label_agreement":null},{"id":"W2909133023","doi":"10.1109/iccd.2018.00086","title":"Minimizing Thermal Variation in Heterogeneous HPC Systems with FPGA Nodes","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Field-programmable gate array; Computer science; Rack; Thermal; Node (physics); Task (project management); Variation (astronomy); Process (computing); Cluster (spacecraft); Supercomputer; Distributed computing; Embedded system; Parallel computing; Operating system; Engineering; Systems engineering; Mechanical engineering","score_opus":0.014854140354870522,"score_gpt":0.23587783381997393,"score_spread":0.22102369346510342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909133023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046345763,0.000030107369,0.9459886,0.00009136974,0.00011112873,0.00010966812,1.4635147e-7,0.00044739287,0.0068758023],"genre_scores_gemma":[0.80136544,0.0000018332972,0.19830157,0.000115952505,0.000054613698,0.000008458828,4.237041e-7,0.000005491185,0.00014621187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991902,0.000070817216,0.00016791422,0.0002514251,0.00014170013,0.00017791825],"domain_scores_gemma":[0.9994804,0.000037474907,0.0000679296,0.00029220938,0.00008883595,0.00003313411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022075784,0.000091190544,0.00010443007,0.00011006628,0.00007700585,0.00017074074,0.00037005346,0.00004401814,0.0000054082698],"category_scores_gemma":[0.000009203087,0.00006988422,0.000014623071,0.0002748207,0.000026140031,0.00022185613,0.00008248559,0.000048106573,0.000018361516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104770275,0.00042911907,0.00921303,0.00008022607,0.00009664227,0.000103290986,0.01088108,0.863835,0.006955965,0.07886102,0.0011474834,0.028292421],"study_design_scores_gemma":[0.00018873389,0.00012170955,0.0016686787,0.00003470728,0.0000013246964,0.000023647275,0.0000082321185,0.9932434,0.004336031,0.00010245923,0.00013469832,0.00013636127],"about_ca_topic_score_codex":0.00014306584,"about_ca_topic_score_gemma":0.000013086558,"teacher_disagreement_score":0.75501966,"about_ca_system_score_codex":0.00002908783,"about_ca_system_score_gemma":0.000029737439,"threshold_uncertainty_score":0.28497958},"labels":[],"label_agreement":null},{"id":"W2910240344","doi":"10.2514/6.2019-2222","title":"The Mosaic CGNS Dataflow Platform","year":2019,"lang":"en","type":"article","venue":"AIAA Scitech 2019 Forum","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Dataflow; Mosaic; Computer science; Embedded system; Programming language; History","score_opus":0.009831651047282952,"score_gpt":0.23982602145164225,"score_spread":0.2299943704043593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910240344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003435441,0.00037317973,0.9799397,0.00438553,0.0011268598,0.00041617133,0.000009879853,0.0011378037,0.009175458],"genre_scores_gemma":[0.72784704,0.00043262544,0.23667285,0.003973438,0.0001860135,0.00005090568,0.00007806819,0.000063716725,0.030695312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984728,0.000028773371,0.00024179814,0.00040131845,0.00033661904,0.00051868387],"domain_scores_gemma":[0.9981802,0.0001603431,0.000117306845,0.0013814465,0.00008154327,0.00007916288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053109997,0.00016001958,0.00014399625,0.000092523806,0.00038190503,0.00040933772,0.002197114,0.000088252615,0.000017707564],"category_scores_gemma":[0.000036068857,0.00011125672,0.0000748915,0.00046082248,0.000053263662,0.00067106896,0.00074560964,0.0002064773,0.00092946726],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015227704,0.00006542961,0.0034588922,0.000014566032,0.000041873314,0.000005213023,0.00028106244,0.0031547337,0.00047516503,0.30983365,0.57277566,0.10987851],"study_design_scores_gemma":[0.00039453196,0.00018821123,0.00034490624,0.000040464147,0.0000037916802,0.00002514979,0.000059335496,0.44840539,0.0034235928,0.023559622,0.5231356,0.00041940348],"about_ca_topic_score_codex":0.000027447855,"about_ca_topic_score_gemma":0.000008715424,"teacher_disagreement_score":0.7432668,"about_ca_system_score_codex":0.000039594303,"about_ca_system_score_gemma":0.00007192572,"threshold_uncertainty_score":0.9998484},"labels":[],"label_agreement":null},{"id":"W2911338810","doi":"10.1007/978-3-642-37051-9_12","title":"Refactoring MATLAB","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Leverhulme Trust","keywords":"Code refactoring; Scripting language; MATLAB; Computer science; Programming language; Compiler; Software engineering; Identifier; Code (set theory); Software; Source code; Set (abstract data type)","score_opus":0.019848291822083385,"score_gpt":0.2515606221234342,"score_spread":0.23171233030135083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911338810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022900183,0.00029465288,0.97618914,0.0004473559,0.0013027631,0.00030186673,0.0000014344799,0.0007685571,0.02067135],"genre_scores_gemma":[0.03355741,0.00007928969,0.9632008,0.0009450431,0.00039703585,0.000010452431,0.000003244304,0.000039934486,0.001766805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965621,0.000029387596,0.0005186539,0.001409094,0.00083105604,0.0006497087],"domain_scores_gemma":[0.99740195,0.000259329,0.0002978262,0.0015717889,0.0002866925,0.0001824383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000609793,0.00050555356,0.00047661207,0.00084666087,0.00025535372,0.00087717874,0.0038561274,0.00033416235,0.000055133005],"category_scores_gemma":[0.000068071466,0.00046563498,0.000115572104,0.0005370923,0.00033499772,0.0007239217,0.0016540051,0.00077030796,0.00020210774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013401843,0.000019118792,0.000026662186,0.000029707855,0.000008895193,0.000044251712,0.00037643578,0.057111286,0.00007140547,0.0476012,0.0002633025,0.8944464],"study_design_scores_gemma":[0.0001369094,0.00010072725,0.000052375966,0.00036130872,0.0000033975653,0.000049956463,3.4088323e-8,0.76817566,0.0017992405,0.2220506,0.006487832,0.0007819828],"about_ca_topic_score_codex":0.000022984628,"about_ca_topic_score_gemma":0.0000075221933,"teacher_disagreement_score":0.8936644,"about_ca_system_score_codex":0.00030064277,"about_ca_system_score_gemma":0.0003381337,"threshold_uncertainty_score":0.9997795},"labels":[],"label_agreement":null},{"id":"W2912699192","doi":"10.1145/3232850","title":"Hierarchical Matrix Operations on GPUs","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Qatar National Research Fund; Nvidia","keywords":"Computer science; Data structure; Matrix multiplication; Linear algebra; Block (permutation group theory); Parallel computing; Theoretical computer science; Matrix (chemical analysis); Algebraic operation; Algorithm; Mathematics; Algebraic number","score_opus":0.01684977558226441,"score_gpt":0.2808800898770193,"score_spread":0.2640303142947549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912699192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026131677,0.0000056371755,0.98470795,0.010620341,0.000115352756,0.00030888172,0.0000048893985,0.0012711622,0.00035264104],"genre_scores_gemma":[0.07915437,0.0000048262,0.91521865,0.003900609,0.000025976935,0.0000485464,0.000003341326,0.00001935078,0.0016243551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856734,0.000084852305,0.00028680818,0.00041344296,0.00036799867,0.00027953603],"domain_scores_gemma":[0.9978005,0.00079745596,0.000030550313,0.0011926794,0.00006685089,0.0001119202],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016637766,0.00018520266,0.00021490877,0.0001581172,0.00024114914,0.00016980516,0.0010042443,0.0001377716,0.0003422785],"category_scores_gemma":[0.00019851021,0.00015706546,0.00013200485,0.00036072647,0.00003898023,0.00021097876,0.000027089402,0.00046648073,0.001729469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060131886,0.0023091831,0.00009529344,0.00023344801,0.00015018827,0.000051439158,0.0014616925,0.4923214,0.00022647453,0.2086381,0.002211755,0.2922409],"study_design_scores_gemma":[0.0008638271,0.00095887634,0.00014185293,0.00024060585,0.000024845056,0.00008217701,0.000021870514,0.30327573,0.0048906244,0.68512416,0.0035841917,0.0007912293],"about_ca_topic_score_codex":0.0000021066526,"about_ca_topic_score_gemma":3.1823257e-7,"teacher_disagreement_score":0.47648606,"about_ca_system_score_codex":0.000049380677,"about_ca_system_score_gemma":0.000045091114,"threshold_uncertainty_score":0.9990478},"labels":[],"label_agreement":null},{"id":"W2913066962","doi":"10.1142/s0218126619502244","title":"An Energy-Efficient Reliable Heterogeneous Uncore Architecture for Future 3D Chip-Multiprocessors","year":2019,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Embedded system; Static random-access memory; Interconnection; Energy consumption; Cache-only memory architecture; Chip; Reliability (semiconductor); Parallel computing; Memory hierarchy; Efficient energy use; CPU cache; Throughput; Computer architecture; Power (physics); Computer hardware; Engineering; Cache coloring; Computer network; Electrical engineering; Operating system; Wireless","score_opus":0.008272065007640635,"score_gpt":0.224607325596474,"score_spread":0.21633526058883337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913066962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04058012,0.001990832,0.9547904,0.0001861185,0.0020047752,0.00021533211,0.000002536604,0.0001110062,0.000118882344],"genre_scores_gemma":[0.93269914,0.00006414543,0.06617276,0.00040449286,0.0005893459,0.000005464243,0.0000021658398,0.000019699308,0.00004280222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835694,0.00009358531,0.0005517183,0.0003401973,0.0003700332,0.000287503],"domain_scores_gemma":[0.99830186,0.0001002473,0.0005706963,0.00037442785,0.00045451964,0.00019822351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052260846,0.00021537904,0.00042443987,0.00024572283,0.00014058717,0.00035545643,0.0008183023,0.0001181921,5.618316e-7],"category_scores_gemma":[0.000009291057,0.00017019849,0.00012556219,0.00023297238,0.000021567155,0.00024655825,0.00006907954,0.0001664247,7.5680884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147489045,0.00007701931,0.00008549593,0.00008905509,0.000046139143,0.000013614614,0.00083399826,0.9609354,0.00016422648,0.004532631,0.00052690116,0.032680754],"study_design_scores_gemma":[0.00073839095,0.0008610674,0.00007070957,0.00023578377,0.000013219287,0.00093625026,0.000097943645,0.98009586,0.00017583004,0.0002508967,0.016264034,0.00026000082],"about_ca_topic_score_codex":0.000012090667,"about_ca_topic_score_gemma":5.524837e-7,"teacher_disagreement_score":0.892119,"about_ca_system_score_codex":0.000045111257,"about_ca_system_score_gemma":0.00009270776,"threshold_uncertainty_score":0.6940493},"labels":[],"label_agreement":null},{"id":"W2915470884","doi":"10.1145/3289602.3293909","title":"A Modular Heterogeneous Stack for Deploying FPGAs and CPUs in the Data Center","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software portability; Modular design; Field-programmable gate array; Scalability; Protocol stack; Software deployment; Latency (audio); Computer architecture; Embedded system; Stack (abstract data type); Distributed computing; Parallel computing; Operating system","score_opus":0.041799654680469776,"score_gpt":0.28868727337356404,"score_spread":0.24688761869309425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915470884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040668827,0.00008931121,0.9576144,0.0005417204,0.000055914425,0.00031224743,0.000002995312,0.0001390001,0.0005755607],"genre_scores_gemma":[0.77153534,0.000018176153,0.22750494,0.000837929,0.0000117863965,0.000007551647,0.000007019541,0.0000046710234,0.00007256934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931973,0.000042852313,0.000111855705,0.00029002436,0.00008969088,0.00014584853],"domain_scores_gemma":[0.99909234,0.00008005082,0.000028338703,0.00076088036,0.00001988621,0.000018500434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035004932,0.00006550199,0.0000766074,0.000042181473,0.000043459368,0.00015319331,0.0010336017,0.000023886323,0.0000025293364],"category_scores_gemma":[0.000016063177,0.00004452838,0.000014079081,0.000092146605,0.000008887332,0.00021716845,0.00040867296,0.0000453414,0.000004491835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015546223,0.0014806611,0.08343446,0.0005352699,0.00022340247,0.00011702765,0.014166615,0.32314587,0.002519171,0.15191562,0.053189125,0.36911732],"study_design_scores_gemma":[0.00024140597,0.000041061332,0.0002346555,0.000009250247,8.9231287e-7,0.000018984068,0.000009894759,0.99410015,0.00019474913,0.0009802426,0.004095351,0.000073346324],"about_ca_topic_score_codex":0.000015276544,"about_ca_topic_score_gemma":0.00000778486,"teacher_disagreement_score":0.73086655,"about_ca_system_score_codex":0.000006501841,"about_ca_system_score_gemma":0.000010589596,"threshold_uncertainty_score":0.19207062},"labels":[],"label_agreement":null},{"id":"W2918358968","doi":"10.1553/cia157s155","title":"Session3B: STARS − Opacity driving, levitation, opacity data","year":2009,"lang":"en","type":"article","venue":"Communications in Asteroseismology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Humanities; Physics; Political science; Art","score_opus":0.09776955605250319,"score_gpt":0.3682573796681138,"score_spread":0.2704878236156106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918358968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080983825,0.00033326654,0.9747917,0.011928927,0.00014008218,0.0002148274,0.000006821062,0.0004612702,0.004024721],"genre_scores_gemma":[0.5931352,0.000141872,0.40529978,0.0012037645,0.0000097416305,0.000009367061,0.00007734978,0.000004176538,0.000118766664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978971,0.00067562086,0.0004812551,0.00049969304,0.00015061247,0.00029572894],"domain_scores_gemma":[0.9930258,0.000323857,0.00020596114,0.0062390715,0.0001305927,0.00007474866],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009726093,0.00016100565,0.00024121664,0.00027018497,0.00031269857,0.00013573353,0.0073366635,0.00012348448,0.000007019962],"category_scores_gemma":[0.00035578638,0.00017087701,0.000030081354,0.0006802584,0.00017358674,0.00083648367,0.002409935,0.00040385823,0.000026034928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020191797,0.0022310445,0.046690904,0.000023744098,0.0000459732,0.000023885394,0.005565867,0.00757168,0.001267035,0.43109167,0.042078152,0.46338984],"study_design_scores_gemma":[0.0007803107,0.00021961598,0.11610898,0.0001120513,0.000008084763,0.00006622324,0.00007499618,0.77744806,0.00027126254,0.054489423,0.049837448,0.0005835289],"about_ca_topic_score_codex":0.00004230364,"about_ca_topic_score_gemma":0.000043163167,"teacher_disagreement_score":0.7698764,"about_ca_system_score_codex":0.000069550835,"about_ca_system_score_gemma":0.000103420876,"threshold_uncertainty_score":0.9980341},"labels":[],"label_agreement":null},{"id":"W2919203267","doi":"","title":"Feasibility of internal object pools to reduce memory management activity.","year":2018,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Object (grammar); Artificial intelligence","score_opus":0.13563494457788725,"score_gpt":0.4459881441417481,"score_spread":0.31035319956386087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919203267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36926052,0.00044614746,0.57708055,0.015915316,0.001825499,0.009825818,0.00016058076,0.0002632692,0.02522232],"genre_scores_gemma":[0.9454649,0.00008158488,0.052125648,0.000044001416,0.000031029675,0.00008191003,3.2805036e-7,0.0000074360646,0.0021631338],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997757,0.00046217407,0.0003079299,0.0005056957,0.00060379226,0.00036337986],"domain_scores_gemma":[0.99308825,0.0005615235,0.00022434925,0.00082444004,0.005229498,0.00007195103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012473337,0.00015625086,0.00033955218,0.0001911148,0.00033616734,0.000049400314,0.0014383253,0.000035004716,0.000003839181],"category_scores_gemma":[0.0015292917,0.00011239027,0.00007311707,0.001472614,0.0005236259,0.00016619248,0.0012025377,0.00015979886,0.0000039280267],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0080502,0.002579084,0.0013006482,0.00156847,0.0016369891,0.000009739907,0.056088183,0.015966212,0.09861315,0.36729935,0.07595992,0.37092808],"study_design_scores_gemma":[0.001054953,0.0015440991,0.0009530714,0.00085537625,0.000009521377,3.738374e-7,0.004323944,0.0067172027,0.97011524,0.011982407,0.0022095102,0.0002342966],"about_ca_topic_score_codex":0.000004456968,"about_ca_topic_score_gemma":0.000036673995,"teacher_disagreement_score":0.8715021,"about_ca_system_score_codex":0.00021465508,"about_ca_system_score_gemma":0.00022630996,"threshold_uncertainty_score":0.45831424},"labels":[],"label_agreement":null},{"id":"W2920795722","doi":"10.1145/2694344","title":"Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems","year":2015,"lang":"en","type":"paratext","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Oak Ridge National Laboratory; University of Illinois at Urbana-Champaign; Stony Brook University; Argonne National Laboratory; University of Massachusetts Amherst; Koç Üniversitesi; Indian Institute of Technology Delhi; University of California, Riverside; Korea Advanced Institute of Science and Technology; Technion-Israel Institute of Technology; Universiteit Gent; École Polytechnique Fédérale de Lausanne; University of California, San Diego; University of Toronto; University of New South Wales; University at Buffalo; University of Alberta; Indian Institute of Technology Kanpur; VMware; University of Texas at Austin; Rice University; National Science Foundation; Uppsala Universitet; Princeton University; Lehigh University; University of Washington; University of Rochester; North Carolina State University; Carnegie Mellon University; Indian Institute of Science; Chinese Academy of Sciences; Purdue University; State University of New York; Microsoft Research; Simon Fraser University; University of Wisconsin-Madison","keywords":"Computer science; Compiler; Civilization; Architecture; Beauty; Library science; World Wide Web; History; Programming language; Political science; Law; Archaeology","score_opus":0.033764043351706206,"score_gpt":0.3227441862332148,"score_spread":0.28898014288150864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920795722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051585335,0.00018245465,0.76315355,0.0008645551,0.0018974048,0.0017384216,0.000045186283,0.00026733824,0.23133525],"genre_scores_gemma":[0.14532138,0.00004811606,0.61133015,0.00030538064,0.0004535699,0.00031736566,0.000085026615,0.000046493944,0.24209252],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988898,0.000014817378,0.00028483462,0.000341072,0.00030108375,0.00016839866],"domain_scores_gemma":[0.998922,0.00003748641,0.0002991726,0.00015323251,0.0005438169,0.00004427898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034377852,0.00017924495,0.00024745672,0.00009832729,0.00008961667,0.0004764159,0.0009789822,0.0001048406,0.000011534716],"category_scores_gemma":[0.000053572363,0.00011430767,0.000053582364,0.00010520166,0.000055278542,0.00010985465,0.0003694783,0.00017551548,0.0000050514222],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029368251,0.00013570739,0.000115413146,0.0011612851,0.00023676115,0.0000011016801,0.004530861,0.0059050503,0.00038965396,0.2660406,0.68498445,0.036469758],"study_design_scores_gemma":[0.0010378761,0.000961802,0.000036855756,0.0011636886,0.000058896017,0.00012625949,0.00086858537,0.8160965,0.0046105217,0.0005541746,0.173405,0.0010798703],"about_ca_topic_score_codex":0.000033940087,"about_ca_topic_score_gemma":9.954236e-7,"teacher_disagreement_score":0.8101914,"about_ca_system_score_codex":0.000030382678,"about_ca_system_score_gemma":0.00011680914,"threshold_uncertainty_score":0.46613318},"labels":[],"label_agreement":null},{"id":"W2922481349","doi":"10.1007/s00521-019-04121-z","title":"Optimizing partitioned CSR-based SpGEMM on the Sunway TaihuLight","year":2019,"lang":"en","type":"article","venue":"Neural Computing and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Young Scientists Fund; International Cooperation and Exchange Programme; Major Research Plan; National Outstanding Youth Foundation of China; Hunan Provincial Innovation Foundation for Postgraduate","keywords":"Supercomputer; Computer science; Scalability; Exploit; Parallel computing; Memory footprint; Computational Science and Engineering; Multiplication (music); Computational science; Mathematics; Operating system","score_opus":0.01831816674553053,"score_gpt":0.2601157779192243,"score_spread":0.24179761117369378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922481349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03153351,0.00005892069,0.95716816,0.0053948527,0.00008103427,0.0005495163,0.0000015132141,0.00074213144,0.004470334],"genre_scores_gemma":[0.95663625,0.0000048079587,0.041016176,0.0020791641,0.00007838857,0.0000499956,0.000006129365,0.000009996212,0.000119069984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988805,0.00008972254,0.00021174246,0.00041311092,0.00017447527,0.00023045107],"domain_scores_gemma":[0.9987363,0.00041403898,0.00011996442,0.0005902911,0.000072398005,0.00006697556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026486456,0.00014664495,0.00013147309,0.00007452279,0.00054964965,0.00024837817,0.00056253007,0.000046588022,0.000009560709],"category_scores_gemma":[0.000015727446,0.00010906662,0.00005459781,0.0003985082,0.000047033944,0.00008834804,0.0001483077,0.00019839972,0.00007025072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009613791,0.00018410188,0.0012103873,0.000036596906,0.000019858184,0.0000018869518,0.00039449873,0.44268268,0.0011011407,0.51182264,0.003623602,0.038912993],"study_design_scores_gemma":[0.00016759498,0.00006705159,0.0004644813,0.000027050632,0.000003383684,0.000004494229,0.000011319931,0.98680776,0.0022665795,0.0013352624,0.008678745,0.00016629667],"about_ca_topic_score_codex":0.0000050317135,"about_ca_topic_score_gemma":3.6600915e-7,"teacher_disagreement_score":0.9251028,"about_ca_system_score_codex":0.000016799013,"about_ca_system_score_gemma":0.000023613355,"threshold_uncertainty_score":0.44476077},"labels":[],"label_agreement":null},{"id":"W2929273575","doi":"10.48550/arxiv.1904.01031","title":"Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nested loop join; Parallel computing; Loop fusion; Divide and conquer algorithms; Loop tiling; Correctness; Modular design; Loop (graph theory); Abstraction; Parallelism (grammar); Loop fission; Programming language; Traverse; Automatic parallelization; Theoretical computer science; Compiler; Mathematics","score_opus":0.043976033199468655,"score_gpt":0.1957794254449125,"score_spread":0.15180339224544384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929273575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043744937,0.00009957249,0.9540817,0.00014272562,0.00028234665,0.00052517647,0.000020131914,0.00034118138,0.000762217],"genre_scores_gemma":[0.96556854,0.0002648154,0.033092808,0.0000689267,0.000028134064,0.000003664376,0.000017268594,0.00001950149,0.00093636493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822533,0.00014241475,0.00027509494,0.0009686003,0.000101301,0.00028726354],"domain_scores_gemma":[0.99765384,0.00038853806,0.0003929369,0.0011425732,0.00031088488,0.00011120721],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003370653,0.00030102782,0.00051380834,0.0003061132,0.00011870597,0.000071611634,0.0014259773,0.0003330278,0.000008624828],"category_scores_gemma":[0.00011651129,0.00033767673,0.00023947755,0.0002903965,0.0001026668,0.00026017101,0.0015700564,0.00025081213,0.000013896234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066753244,0.00011737149,0.0010658716,0.00030751404,0.00017363648,0.000024981493,0.00014973512,0.86888283,0.00006059956,0.12643826,0.001018614,0.0016938252],"study_design_scores_gemma":[0.00042929378,0.00006362772,0.0012609569,0.00017983573,0.00008874879,0.0000025649153,0.000012360069,0.96149015,0.001021268,0.034480907,0.0005637356,0.00040657562],"about_ca_topic_score_codex":0.00007665016,"about_ca_topic_score_gemma":0.000002131151,"teacher_disagreement_score":0.92182356,"about_ca_system_score_codex":0.00007145779,"about_ca_system_score_gemma":0.0001416726,"threshold_uncertainty_score":0.99990755},"labels":[],"label_agreement":null},{"id":"W2932024076","doi":"10.11575/prism/36155","title":"Accelerating Sequence Calculations on Parallel GPU Architecture","year":2019,"lang":"en","type":"dissertation","venue":"PRISM (University of Calgary)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates","keywords":"Parallel computing; Architecture; Computer science; Sequence (biology); CUDA; Computational science; Computer architecture; Chemistry; Geography","score_opus":0.021796679536587756,"score_gpt":0.24373517747809287,"score_spread":0.2219384979415051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932024076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056374604,0.00007189708,0.95514196,0.00022027167,0.00021828088,0.0002944626,6.464529e-7,0.0003219925,0.038093016],"genre_scores_gemma":[0.028761959,0.00008222372,0.9507569,0.00011024489,0.000017110327,0.0000010555249,0.00026282037,0.000022246253,0.019985458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986244,0.000091103415,0.00018555188,0.00050471205,0.00037113857,0.00022313092],"domain_scores_gemma":[0.998695,0.00009745489,0.0003729147,0.0006109327,0.00014429931,0.00007938848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013035195,0.00023095432,0.0003287083,0.00032908257,0.00027175626,0.000054578293,0.0011987679,0.00029361516,0.000030863997],"category_scores_gemma":[0.000030013758,0.00027871656,0.00017159453,0.0002856271,0.000036723075,0.00021465572,0.00013443381,0.00046535148,0.00004296655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015952991,0.00028803438,0.00020966945,0.00046055313,0.00022633067,0.000105263985,0.015851228,0.02368648,0.00083597534,0.111014925,0.0071455576,0.8400164],"study_design_scores_gemma":[0.00038189781,0.0001389103,0.002020982,0.0002977879,0.000029818004,0.000003918735,0.000049960596,0.99002516,0.00021534025,0.002311066,0.004034974,0.00049020565],"about_ca_topic_score_codex":0.00026441796,"about_ca_topic_score_gemma":0.000013565797,"teacher_disagreement_score":0.96633863,"about_ca_system_score_codex":0.00006663715,"about_ca_system_score_gemma":0.00020375027,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W2932807114","doi":"10.1007/s00037-019-00180-9","title":"Correction to: Query-to-Communication Lifting for PNP","year":2019,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Image (mathematics); Theoretical computer science; Information retrieval; Discrete mathematics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.04433134717812037,"score_gpt":0.3166030198724693,"score_spread":0.27227167269434893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2932807114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015630266,0.000018853018,0.97617966,0.002274172,0.00090220093,0.0008013614,0.0000060180664,0.0007165337,0.003470953],"genre_scores_gemma":[0.47832558,4.155021e-7,0.51994216,0.0012402713,0.000042189844,0.000041465282,0.00004126014,0.000009523184,0.00035714172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852747,0.00011297278,0.0003404803,0.00047604507,0.00028350783,0.00025953833],"domain_scores_gemma":[0.9980414,0.000619782,0.0001325258,0.0005511813,0.0005118118,0.00014333706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503799,0.00015825781,0.00020131461,0.00023341985,0.00032697635,0.00022326948,0.0009596115,0.00004361351,0.000016758355],"category_scores_gemma":[0.00023251105,0.00017894903,0.00008558843,0.0006298019,0.000023102504,0.00028373234,0.0004075407,0.00013140914,0.0002564658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024239636,0.000067159424,0.0008234461,0.00001590939,0.000012848494,1.8543628e-7,0.00057740207,0.8223897,0.0000919466,0.13249269,0.032049987,0.011454433],"study_design_scores_gemma":[0.00022710625,0.00014345051,0.01064648,0.000056660814,0.0000020489533,0.0000059171994,0.000010157372,0.9320054,0.00022775898,0.050611738,0.0058308626,0.00023241433],"about_ca_topic_score_codex":0.00004297309,"about_ca_topic_score_gemma":0.0000108849335,"teacher_disagreement_score":0.46269533,"about_ca_system_score_codex":0.00011994294,"about_ca_system_score_gemma":0.0000968445,"threshold_uncertainty_score":0.729733},"labels":[],"label_agreement":null},{"id":"W2943426458","doi":"","title":"Beagle as a HOL4 external ATP method","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Beagle; Computer science; Biology; Ecology","score_opus":0.024866418680265474,"score_gpt":0.3279997923623752,"score_spread":0.30313337368210974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943426458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001510791,0.00013061162,0.9538522,0.0008947451,0.00058546383,0.00019171833,8.19922e-7,0.001975698,0.042217694],"genre_scores_gemma":[0.015549367,0.000035064917,0.9770924,0.0018921839,0.00019654835,0.000031089345,0.000004497222,0.000018302417,0.005180555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792033,0.00023407646,0.00036382274,0.0008307382,0.00035986782,0.000291179],"domain_scores_gemma":[0.9979522,0.00014121961,0.00024695267,0.0013709731,0.00015561514,0.00013300912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008456917,0.0002835275,0.0003626272,0.00018702883,0.00009975909,0.0004924923,0.0024267929,0.00028157988,0.0000616212],"category_scores_gemma":[0.000075704986,0.00025743223,0.00018792352,0.00014344802,0.000024752539,0.000109923865,0.003188377,0.0005200062,0.00018372807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012507638,0.00022568076,0.00017176119,0.00017376668,0.0001173161,0.00005426534,0.0016684097,0.3209561,0.00022350013,0.3443467,0.04643316,0.28561682],"study_design_scores_gemma":[0.00010622415,0.000051340976,0.00007121802,0.00009778403,0.0000069815183,0.00003104464,0.0000010739515,0.90284634,0.0031836159,0.078805394,0.014418491,0.00038049373],"about_ca_topic_score_codex":0.00022722097,"about_ca_topic_score_gemma":0.0000012466531,"teacher_disagreement_score":0.5818902,"about_ca_system_score_codex":0.000044610217,"about_ca_system_score_gemma":0.00014653396,"threshold_uncertainty_score":0.9999878},"labels":[],"label_agreement":null},{"id":"W2944778070","doi":"10.1145/3343211.3343219","title":"Implementing efficient message logging protocols as MPI application extensions","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Rollback; Logging; Implementation; Message passing; Protocol (science); Distributed computing; Database; Software engineering","score_opus":0.027758297745759754,"score_gpt":0.34110905991211554,"score_spread":0.31335076216635577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944778070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031112393,0.000027917435,0.952077,0.00051048404,0.0001487787,0.014325534,0.000002353825,0.00200647,0.030590395],"genre_scores_gemma":[0.26718146,0.000010437013,0.71783006,0.00072094705,0.000112606635,0.0121427225,0.000052943422,0.00004168493,0.0019071441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972497,0.00012299835,0.0005677699,0.0010727899,0.0004456002,0.0005411483],"domain_scores_gemma":[0.9972538,0.0000978519,0.0004854622,0.0018253422,0.00024280623,0.00009476425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011458145,0.00031648672,0.00035046428,0.0002490566,0.00029597981,0.0004905437,0.0017717306,0.00021111938,0.000028557568],"category_scores_gemma":[0.00005159485,0.00029742054,0.00015164306,0.00025140157,0.000024144956,0.000092248614,0.00512899,0.0004750971,0.00017350851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055518526,0.00024750992,0.00041901824,0.00034608095,0.00005092792,0.000007506823,0.00059639494,0.81511855,0.00075082004,0.13328107,0.008217366,0.040959194],"study_design_scores_gemma":[0.00014615676,0.000026946404,0.00012773709,0.00019061453,0.000006349048,0.0000067746746,0.00001231769,0.9769863,0.002578465,0.005212713,0.014327971,0.0003776826],"about_ca_topic_score_codex":0.00009358161,"about_ca_topic_score_gemma":0.0000017832045,"teacher_disagreement_score":0.26687032,"about_ca_system_score_codex":0.00009927107,"about_ca_system_score_gemma":0.00023691787,"threshold_uncertainty_score":0.9999478},"labels":[],"label_agreement":null},{"id":"W2945329411","doi":"10.1145/3316781.3317924","title":"Thread Weaving","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Thread (computing); Parallel computing; Multithreading; Scheduling (production processes); Yarn; Software; Weaving; Schedule; Distributed computing; Operating system","score_opus":0.010374880977938629,"score_gpt":0.2407383752886265,"score_spread":0.23036349431068787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945329411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027144405,0.000017403876,0.8706457,0.00027711585,0.00010827857,0.000041547944,2.2171925e-8,0.00073127926,0.12546419],"genre_scores_gemma":[0.4241718,0.000003843825,0.57032394,0.00042310345,0.00001113394,0.0000010919545,2.2833001e-7,0.0000022886757,0.0050625745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996144,0.000011232829,0.00006407945,0.00013986116,0.00007669059,0.00009369342],"domain_scores_gemma":[0.9996261,0.000022101796,0.000019234132,0.00028730082,0.000023440742,0.000021830114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009394281,0.00003981462,0.000048135276,0.000036478872,0.000025211873,0.000066293935,0.00039075204,0.00001874472,0.000055235098],"category_scores_gemma":[0.000004907907,0.00003327184,0.000019300616,0.00012744709,0.000003828915,0.00017340375,0.00012688518,0.00003519963,0.000419738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6798044e-7,0.000016335536,0.004250518,0.000003414381,0.0000033039698,0.0000011292649,0.00011296038,0.0021798264,0.0001903958,0.9703114,0.006106866,0.016823357],"study_design_scores_gemma":[0.00025603638,0.000090663285,0.0034084294,0.000025666832,0.0000010403644,0.000015155025,0.000010224107,0.9105219,0.010311722,0.05152253,0.02349838,0.0003382495],"about_ca_topic_score_codex":0.0000065288864,"about_ca_topic_score_gemma":2.6701292e-7,"teacher_disagreement_score":0.9187889,"about_ca_system_score_codex":0.0000069988682,"about_ca_system_score_gemma":0.00001180838,"threshold_uncertainty_score":0.5395023},"labels":[],"label_agreement":null},{"id":"W2946501795","doi":"10.1007/978-3-030-15663-3_3","title":"Lifetime Enhancement of Non-Volatile Caches by Exploiting Dynamic Associativity Management Techniques","year":2019,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache; Parallel computing; Set (abstract data type); Hierarchy; Reduction (mathematics); Non-volatile memory; Computer hardware; Programming language; Mathematics","score_opus":0.005102574544337718,"score_gpt":0.24769696136410116,"score_spread":0.24259438681976345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946501795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006155864,0.004291702,0.7441727,0.0005434371,0.00004660874,0.0006895864,0.000012853624,0.0005041438,0.24967742],"genre_scores_gemma":[0.1167817,0.11903269,0.74265146,0.00047014435,0.000007609536,0.00032795893,0.0003905282,0.000044035678,0.020293849],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984164,0.0000363083,0.0008783046,0.00024086189,0.00024151274,0.00018659874],"domain_scores_gemma":[0.9974627,0.00010815975,0.001196323,0.0010385233,0.00016962389,0.00002466164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004662945,0.00025502747,0.0004165578,0.0008058172,0.00010726147,0.000059032427,0.0012360956,0.00037063076,0.000009667014],"category_scores_gemma":[0.000022540646,0.00028363135,0.00004845579,0.00022054114,0.00015660032,0.0013094577,0.00090939715,0.00043110657,0.000015498563],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005709286,0.000034412195,0.000060044,0.00018317153,0.000027109036,2.7908163e-7,0.000290166,0.00007882095,0.000029526025,0.28208485,0.0004702195,0.7167357],"study_design_scores_gemma":[0.0009614654,0.00038335042,0.000054261847,0.002220862,0.00003228266,0.0000118016305,0.00032520556,0.0963748,0.010044565,0.20002548,0.68824893,0.0013170202],"about_ca_topic_score_codex":0.000004931382,"about_ca_topic_score_gemma":0.0000048320503,"teacher_disagreement_score":0.7154187,"about_ca_system_score_codex":0.00017343563,"about_ca_system_score_gemma":0.00004627017,"threshold_uncertainty_score":0.99996156},"labels":[],"label_agreement":null},{"id":"W2946549375","doi":"10.1007/978-1-4842-4533-0_22","title":"Game Project: Memory","year":2019,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Regional Municipality of Niagara","funders":"","keywords":"Row; Set (abstract data type); Computer science; Operating system; Embedded system; Computer hardware; Programming language","score_opus":0.029427079047374093,"score_gpt":0.25273288855666215,"score_spread":0.22330580950928805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946549375","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015090112,0.00019757276,0.24845725,0.000021975982,0.00033487217,0.0003880198,0.000004227971,0.0009099932,0.7496846],"genre_scores_gemma":[0.00071647513,0.000028976005,0.03866015,0.0004469803,0.00015603214,0.00001622722,0.00001127439,0.00005431488,0.95990956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983733,0.000026932112,0.00031847428,0.0006548945,0.00035364818,0.00027269195],"domain_scores_gemma":[0.9981792,0.00007241967,0.00026568366,0.0012957099,0.00012611468,0.00006088442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016271746,0.00034938788,0.00037385395,0.00023572441,0.000066755754,0.00018037822,0.0015133109,0.00033551952,0.000017256792],"category_scores_gemma":[0.0000070150318,0.00034041647,0.00015959624,0.000014334803,0.00006610216,0.000089081936,0.00068392616,0.00039179449,0.00023246354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005235541,0.000009471369,0.0000010500482,0.00009712662,0.00006171944,0.000029961244,0.0005089129,0.00023281094,0.000019838055,0.92077255,0.021996703,0.0562646],"study_design_scores_gemma":[0.0002779821,0.000108595865,0.0000014912582,0.00042193642,0.000024823576,0.00005246572,0.0000013184548,0.017933419,0.0009433329,0.045460314,0.9338739,0.0009004255],"about_ca_topic_score_codex":0.000018013729,"about_ca_topic_score_gemma":0.000001365444,"teacher_disagreement_score":0.9118772,"about_ca_system_score_codex":0.000040692175,"about_ca_system_score_gemma":0.00024003873,"threshold_uncertainty_score":0.9999048},"labels":[],"label_agreement":null},{"id":"W2949595835","doi":"10.48550/arxiv.0707.2347","title":"Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Matrix multiplication; Multiplication algorithm; Computer science; Scheduling (production processes); Multiplication (music); Matrix (chemical analysis); Constant (computer programming); Algorithm; Arithmetic; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.02053359651592145,"score_gpt":0.30819847105194936,"score_spread":0.2876648745360279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949595835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002123415,0.00043888978,0.99255526,0.0001379596,0.0004288036,0.0004709644,0.0000048990414,0.0012165069,0.002623299],"genre_scores_gemma":[0.18128406,0.000054880406,0.81831807,0.00004411152,0.0000788363,0.000014760509,0.000021698055,0.000015115709,0.00016845322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976627,0.0000824187,0.0007070409,0.000734279,0.0005010531,0.00031249647],"domain_scores_gemma":[0.9975754,0.00013706843,0.00053732196,0.0012346786,0.00040951394,0.000106027546],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000978914,0.0002883324,0.0003771006,0.00047049607,0.00008918564,0.00013798353,0.0015302582,0.00034467244,0.000008153563],"category_scores_gemma":[0.000048297738,0.0002855146,0.00019235283,0.00042737837,0.000060011706,0.000072597635,0.0014272631,0.00047351286,0.000012604341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021512028,0.00016831527,0.00002668313,0.00009062673,0.000030103802,0.0000031674742,0.00027561476,0.8036644,0.00014730856,0.0028914951,0.00016532099,0.19253485],"study_design_scores_gemma":[0.00015038109,0.000023370454,0.00025652285,0.00011706206,0.000009086175,0.000005047961,0.000017526085,0.9771399,0.021044802,0.000889225,0.00006037248,0.000286737],"about_ca_topic_score_codex":0.00010824343,"about_ca_topic_score_gemma":0.0000010314318,"teacher_disagreement_score":0.19224812,"about_ca_system_score_codex":0.00008103973,"about_ca_system_score_gemma":0.00016847733,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W2950304479","doi":"10.48550/arxiv.cs/0407058","title":"Communication-Aware Processor Allocation for Supercomputers","year":2004,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Parallel computing","score_opus":0.047623147467966746,"score_gpt":0.3002801407793901,"score_spread":0.25265699331142333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950304479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020930396,0.0004076492,0.9721326,0.0035507143,0.0003881299,0.0008962439,0.000008126381,0.0014311973,0.0002549038],"genre_scores_gemma":[0.68375427,0.00017224088,0.31472865,0.0006005766,0.00009865747,0.00029697057,0.00018700698,0.000028466926,0.00013318591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980758,0.000093440394,0.0004920496,0.0007786385,0.00023463304,0.00032545626],"domain_scores_gemma":[0.9971262,0.0001429693,0.00031724144,0.0017662499,0.00054891675,0.00009840786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041446995,0.0003289994,0.0003402031,0.00018740221,0.00031028938,0.00027378256,0.002939978,0.00031277342,0.00000263935],"category_scores_gemma":[0.000080087804,0.00035004847,0.00017014568,0.00026521715,0.00006748398,0.00033532153,0.0015055513,0.00044000582,0.0000279786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000474597,0.0012180548,0.036883436,0.002230613,0.0004220415,0.000009957779,0.008129001,0.84690815,0.0002234926,0.052961722,0.021059811,0.029906265],"study_design_scores_gemma":[0.0011125344,0.00017458505,0.015721167,0.001072561,0.000047620808,0.0000138782525,0.0000442644,0.9364215,0.0047395467,0.03428441,0.00481516,0.0015527889],"about_ca_topic_score_codex":0.00007042698,"about_ca_topic_score_gemma":0.0000118979315,"teacher_disagreement_score":0.66282386,"about_ca_system_score_codex":0.00019513571,"about_ca_system_score_gemma":0.00039561512,"threshold_uncertainty_score":0.99989516},"labels":[],"label_agreement":null},{"id":"W2950480563","doi":"10.1145/3307650.3322221","title":"Emerald","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graphics; OpenGL; Shader; General-purpose computing on graphics processing units; Computer graphics (images); Android (operating system); Encoder; Computer architecture; Embedded system; Operating system; Visualization","score_opus":0.009316148992798472,"score_gpt":0.23734149257531878,"score_spread":0.2280253435825203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950480563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014206744,0.0000093423,0.8848504,0.00088952883,0.00007836965,0.000036315505,1.8456367e-8,0.0006326539,0.11208268],"genre_scores_gemma":[0.37956116,0.0000037054524,0.6045183,0.0024089976,0.000011477432,0.0000013116078,2.9822868e-7,0.0000022048314,0.013492577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996926,0.000009201434,0.00005221981,0.00011148276,0.000061537066,0.00007295849],"domain_scores_gemma":[0.9996911,0.000011192723,0.000013377714,0.00024567865,0.000019871995,0.000018752911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006151183,0.000030874267,0.000037163612,0.000028650093,0.000016760461,0.000043411266,0.0003309663,0.000013945892,0.00009193309],"category_scores_gemma":[0.0000027896567,0.000025538868,0.00001608839,0.000112948284,0.0000026698754,0.00013434328,0.000087626235,0.000025981277,0.0004924339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.129225e-7,0.000026145208,0.002006596,0.0000040989266,0.0000048267043,0.000001373655,0.0001336218,0.0031598888,0.0003848533,0.8979129,0.07227622,0.02408874],"study_design_scores_gemma":[0.0001346882,0.000051340245,0.001092802,0.0000049402806,3.5229706e-7,0.0000050506965,0.0000015053364,0.91068417,0.005332912,0.008591984,0.073947474,0.00015280531],"about_ca_topic_score_codex":0.000008567827,"about_ca_topic_score_gemma":1.32958e-7,"teacher_disagreement_score":0.9075242,"about_ca_system_score_codex":0.0000040368177,"about_ca_system_score_gemma":0.000008166031,"threshold_uncertainty_score":0.6329406},"labels":[],"label_agreement":null},{"id":"W2950484198","doi":"10.1109/fpt.2018.00082","title":"LeFlow: Automatic Compilation of TensorFlow Machine Learning Applications to FPGAs","year":2018,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Verilog; Field-programmable gate array; Python (programming language); Computer architecture; Register-transfer level; Compiler; Software; Hardware description language; Computation; Artificial intelligence; Programming language; Machine translation; Code generation; Embedded system; Computer engineering; Logic synthesis; Algorithm; Logic gate; Operating system; Key (lock)","score_opus":0.01847001742614825,"score_gpt":0.2823632741166452,"score_spread":0.26389325669049696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950484198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017827597,0.000013722586,0.98757154,0.00058175984,0.000035079174,0.00021329793,8.791174e-7,0.0008939726,0.008907017],"genre_scores_gemma":[0.44558796,0.0000018245485,0.5534541,0.00022016697,0.0000298032,0.000014564556,0.0000038070343,0.0000044547724,0.00068332854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922544,0.000047964786,0.00023282616,0.00021151411,0.00015458258,0.00012768563],"domain_scores_gemma":[0.9992351,0.000057508983,0.00008976572,0.00035010037,0.0002082902,0.000059220245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022047709,0.00007917481,0.00011961524,0.0001578361,0.00014599544,0.00004902347,0.00045620638,0.00003150805,0.000051299034],"category_scores_gemma":[0.000039781393,0.00007223755,0.000030164274,0.0005497297,0.000032690703,0.00015401791,0.00015583611,0.000059886577,0.00012143329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010724907,0.00036761293,0.008488792,0.00008724825,0.000057662775,0.0000013037484,0.002320144,0.1512839,0.0075086635,0.26861942,0.0120993275,0.5491552],"study_design_scores_gemma":[0.000069969276,0.00010982715,0.0014249441,0.00001266508,0.0000020863963,0.0000027263895,0.0000031542545,0.9843344,0.0061946423,0.0009837198,0.0067712297,0.00009059892],"about_ca_topic_score_codex":0.000022126424,"about_ca_topic_score_gemma":0.000004262539,"teacher_disagreement_score":0.83305055,"about_ca_system_score_codex":0.000016639347,"about_ca_system_score_gemma":0.000021864977,"threshold_uncertainty_score":0.29457617},"labels":[],"label_agreement":null},{"id":"W2951091066","doi":"10.1145/3307650.3322212","title":"Opportunistic computing in GPU architectures","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Defense Advanced Research Projects Agency; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Overhead (engineering); Parallel computing; Cache; General-purpose computing on graphics processing units; Multi-core processor; Reduction (mathematics); Computation; Von Neumann architecture; CUDA; Embedded system; Graphics; Operating system; Algorithm","score_opus":0.016554153469895777,"score_gpt":0.26044033859255694,"score_spread":0.24388618512266116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951091066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039610703,0.000014766409,0.91658175,0.00030443785,0.00010995924,0.000105936924,1.2461082e-7,0.0005202898,0.042752035],"genre_scores_gemma":[0.76834095,0.0000019156118,0.2306301,0.00053390383,0.00001133337,8.0016594e-7,8.789764e-7,0.000003602628,0.00047650948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992192,0.000045571873,0.00017151127,0.00025446314,0.000119691475,0.00018960644],"domain_scores_gemma":[0.99946874,0.00008906394,0.000043970165,0.00033266476,0.000022440534,0.000043112843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018902759,0.00008150598,0.00011402769,0.00015250842,0.00002885742,0.00007265183,0.000541053,0.000032601354,0.000027084538],"category_scores_gemma":[0.000020384618,0.000072231145,0.000026860593,0.00027025965,0.000010929572,0.000054185988,0.0002136796,0.00010594046,0.000066593595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008285752,0.00017184578,0.08749001,0.000050949606,0.00001541634,0.000056157212,0.0013702292,0.2236504,0.0006364806,0.51211506,0.0033297972,0.17110536],"study_design_scores_gemma":[0.00016433354,0.000038416885,0.0063489187,0.000023498284,3.6949254e-7,0.000011389527,0.000007972416,0.98795813,0.00032796385,0.0042423015,0.00072840357,0.00014829167],"about_ca_topic_score_codex":0.000043820706,"about_ca_topic_score_gemma":0.0000057764278,"teacher_disagreement_score":0.76430774,"about_ca_system_score_codex":0.000017217748,"about_ca_system_score_gemma":0.00003492483,"threshold_uncertainty_score":0.29455006},"labels":[],"label_agreement":null},{"id":"W2951734477","doi":"10.48550/arxiv.1005.1349","title":"On Holant Theorem and Its Proof","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Range (aeronautics); Tensor (intrinsic definition); Proof of concept; Component (thermodynamics); Holography; Analytic proof; Mathematics; Theoretical physics; Computer science; Algebra over a field; Pure mathematics; Physics; Mathematical proof; Quantum mechanics; Geometry; Engineering","score_opus":0.04696998440898185,"score_gpt":0.19296526989827759,"score_spread":0.14599528548929575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951734477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15442143,0.00004507697,0.8386725,0.0001092709,0.00027398946,0.00023658497,0.0000042921765,0.0005120228,0.0057248115],"genre_scores_gemma":[0.9923929,0.00010037161,0.0064055803,0.00013488163,0.00003538745,6.867514e-7,0.0000044605927,0.000010985464,0.0009147452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987083,0.00009315312,0.00011363293,0.0008084619,0.000067158275,0.00020926264],"domain_scores_gemma":[0.99877805,0.00009075241,0.0001563544,0.0007504159,0.000110113666,0.00011429999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023942787,0.00022195703,0.00020469584,0.00020198435,0.00013922609,0.0001285071,0.0011812997,0.00028184528,0.000008310896],"category_scores_gemma":[0.000043629923,0.00022728716,0.00007315575,0.00021588698,0.000053567845,0.00014514533,0.0014516831,0.0007028805,0.000021893567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011918129,0.000053933407,0.00007803651,0.000028992403,0.000019075793,0.0000758108,0.00011969431,0.09964885,0.000027571201,0.89888215,0.00030041384,0.00075353385],"study_design_scores_gemma":[0.00015698603,0.000055852954,0.00015896074,0.000065496664,0.000010109788,0.000004959958,0.0000023648897,0.8475709,0.0010844549,0.15042344,0.00019421134,0.00027228406],"about_ca_topic_score_codex":0.000009636998,"about_ca_topic_score_gemma":0.0000032253588,"teacher_disagreement_score":0.83797145,"about_ca_system_score_codex":0.000037735655,"about_ca_system_score_gemma":0.000080387406,"threshold_uncertainty_score":0.92685014},"labels":[],"label_agreement":null},{"id":"W2952192686","doi":"10.48550/arxiv.1709.00700","title":"Generating Custom Code for Efficient Query Execution on Heterogeneous Processors","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banting and Best Diabetes Centre, University of Toronto; Deutsche Forschungsgemeinschaft; Technische Universität Berlin; European Commission","keywords":"Computer science; Code (set theory); Parallel computing; Multi-core processor; Process (computing); Programming language","score_opus":0.076601834118263,"score_gpt":0.2299586069697806,"score_spread":0.1533567728515176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952192686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10238258,0.000047717323,0.8950463,0.000075329604,0.0004892015,0.00050614856,0.000022989141,0.0006904941,0.00073922507],"genre_scores_gemma":[0.9652428,0.00005485582,0.033579797,0.00011935556,0.00011437262,0.000006922451,0.000026319747,0.000022544498,0.00083300646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980609,0.00009487741,0.00021844366,0.0011636085,0.000108718836,0.00035347816],"domain_scores_gemma":[0.9977348,0.000088867964,0.00050522806,0.001271309,0.00028323536,0.00011655184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034267164,0.00031887688,0.0003051389,0.0002429027,0.00063462334,0.00031726772,0.0018942622,0.00028925683,0.0000017088956],"category_scores_gemma":[0.00008807681,0.0003615522,0.00021291991,0.00014536567,0.00007045356,0.0001211743,0.0009805469,0.00033027848,0.0000140350085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020477682,0.0000710741,0.00003386247,0.000060341423,0.00002527621,0.00003234423,0.000115020855,0.98343915,0.000021480244,0.014966816,0.00039469113,0.0008194832],"study_design_scores_gemma":[0.0002695669,0.00008805477,0.000013127002,0.00015704223,0.000022975068,0.000004051325,0.000004978673,0.9924438,0.0017045329,0.0044042636,0.00049696985,0.0003906605],"about_ca_topic_score_codex":0.00002630957,"about_ca_topic_score_gemma":0.000010803069,"teacher_disagreement_score":0.86286026,"about_ca_system_score_codex":0.00022218801,"about_ca_system_score_gemma":0.00020177313,"threshold_uncertainty_score":0.99988365},"labels":[],"label_agreement":null},{"id":"W2954733970","doi":"10.1145/3314221.3314612","title":"Modular divide-and-conquer parallelization of nested loops","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nested loop join; Loop fusion; Correctness; Divide and conquer algorithms; Loop tiling; Parallel computing; Modular design; Loop (graph theory); Automatic parallelization; Loop fission; Abstraction; Programming language; Traverse; Theoretical computer science; Compiler; Mathematics","score_opus":0.007286280866716614,"score_gpt":0.2186633518350398,"score_spread":0.21137707096832317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954733970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04521104,0.000070370115,0.9486368,0.00025455683,0.00006335964,0.00012444981,1.9187695e-7,0.00028921457,0.005350044],"genre_scores_gemma":[0.8542188,0.000027913362,0.14460294,0.00018937398,0.00000736938,0.000002307128,0.000002213419,0.0000041581966,0.00094492885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993474,0.000039005834,0.00017717227,0.0002054504,0.00012752893,0.000103428356],"domain_scores_gemma":[0.9994341,0.00003841447,0.00007525157,0.00032407124,0.000094517505,0.00003364987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015797184,0.00007327844,0.00012379243,0.00007820062,0.000025490932,0.000040393126,0.00028377768,0.000045649933,0.000025275227],"category_scores_gemma":[0.000017611404,0.000063510175,0.000024162802,0.00020661604,0.000017630482,0.00024217705,0.00015009283,0.00003814736,0.000020198155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009545877,0.00012494175,0.04535389,0.00008763719,0.000039707706,0.0000025740405,0.0007906238,0.091104195,0.005569439,0.8231685,0.0021465325,0.031602405],"study_design_scores_gemma":[0.00025371538,0.00007020629,0.010740566,0.000021723583,0.000002628395,0.000004932598,0.000004320091,0.97416836,0.006150023,0.0072399834,0.0011964196,0.00014712579],"about_ca_topic_score_codex":0.00002448939,"about_ca_topic_score_gemma":6.723256e-7,"teacher_disagreement_score":0.88306415,"about_ca_system_score_codex":0.000005912139,"about_ca_system_score_gemma":0.000017464248,"threshold_uncertainty_score":0.25898698},"labels":[],"label_agreement":null},{"id":"W2955467592","doi":"10.1145/3295500.3356180","title":"Etalumis","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Lawrence Berkeley National Laboratory; Multidisciplinary University Research Initiative; Office of Science; Engineering and Physical Sciences Research Council; Defense Advanced Research Projects Agency; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Energy Research Scientific Computing Center; U.S. Department of Energy; National Science Foundation","keywords":"Scalability; Probabilistic logic; Supercomputer; Inference; Bayesian inference; Rewriting; Frame (networking); Protocol (science)","score_opus":0.008954138399730721,"score_gpt":0.2342671677115079,"score_spread":0.22531302931177719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955467592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017576661,0.000009381147,0.7677686,0.0002461044,0.000071306,0.00003136258,1.6962778e-8,0.000552425,0.2295631],"genre_scores_gemma":[0.57159907,0.0000025452193,0.42125925,0.00053175795,0.0000069674934,8.5297125e-7,2.1329024e-7,0.0000015854984,0.0065977313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969244,0.000009482452,0.00005001016,0.00011292717,0.00006445196,0.00007069607],"domain_scores_gemma":[0.9996849,0.000012874895,0.000013270569,0.00025011125,0.00001946556,0.000019436467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006719617,0.000030746687,0.000037617105,0.000029263012,0.000015871545,0.000044471533,0.00032565635,0.000015430474,0.00005900958],"category_scores_gemma":[0.0000033165866,0.000025704096,0.000017316337,0.00011376141,0.0000032966477,0.00012358192,0.00008469337,0.000025399708,0.00060743844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.780743e-7,0.000033557513,0.0027131657,0.0000054096963,0.000006306657,0.0000019827366,0.00015735126,0.00283613,0.0007960446,0.9139013,0.04091719,0.038630765],"study_design_scores_gemma":[0.0001526449,0.000054949905,0.0015766795,0.0000055611868,4.6308804e-7,0.0000080518375,0.000003358995,0.9445452,0.0099218665,0.0075838836,0.035978045,0.00016929413],"about_ca_topic_score_codex":0.0000035852354,"about_ca_topic_score_gemma":8.3188986e-8,"teacher_disagreement_score":0.9417091,"about_ca_system_score_codex":0.0000044944004,"about_ca_system_score_gemma":0.000009153925,"threshold_uncertainty_score":0.7807595},"labels":[],"label_agreement":null},{"id":"W2962987007","doi":"10.1145/3293611.3338025","title":"Tutorial","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Fault tolerance; Memory management; Concurrency; Memory address; Operating system; State (computer science); Construct (python library); Persistent data structure; Programming language; Embedded system; Parallel computing; Overlay; Semiconductor memory","score_opus":0.00792934323107843,"score_gpt":0.23292569007510858,"score_spread":0.22499634684403014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962987007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014648224,0.0000050092667,0.8511136,0.00016787805,0.0004995997,0.00003576431,2.0505743e-8,0.00061386666,0.14609942],"genre_scores_gemma":[0.49504998,0.0000016892684,0.4970501,0.00036009343,0.00006702874,0.0000011518354,2.778319e-7,0.0000019842287,0.007467688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996903,0.000010073198,0.000050794628,0.00010920535,0.000070578375,0.00006908159],"domain_scores_gemma":[0.9997067,0.000015787138,0.00001312563,0.00022482677,0.000021319342,0.000018226661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007194206,0.00002960634,0.00003729282,0.000025923868,0.000016062122,0.00005290915,0.00031843458,0.000017188975,0.000064578766],"category_scores_gemma":[0.0000048615166,0.000024634503,0.000015836875,0.00009841674,0.000002723718,0.00012807253,0.00008560679,0.000025681436,0.00043306235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001081726,0.000016367698,0.0009231443,0.0000019904876,0.0000028501836,8.603029e-7,0.00007808724,0.0015801884,0.0002831873,0.96231663,0.023576304,0.0112193255],"study_design_scores_gemma":[0.0003266062,0.00009229135,0.0006889739,0.000005762984,5.8500984e-7,0.0000061055753,0.0000025149002,0.8352671,0.008032082,0.013941891,0.14141767,0.00021836822],"about_ca_topic_score_codex":0.0000045282836,"about_ca_topic_score_gemma":8.8653564e-8,"teacher_disagreement_score":0.94837475,"about_ca_system_score_codex":0.0000056530785,"about_ca_system_score_gemma":0.00001326386,"threshold_uncertainty_score":0.55662847},"labels":[],"label_agreement":null},{"id":"W2962989815","doi":"10.1145/3333060","title":"Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP Loops","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmark (surveying); Parallel computing; Compiler; Speedup; Software portability; Programmer; Kernel (algebra); Suite; Loop unrolling; Static analysis; Control flow; Performance improvement; Operating system; Programming language","score_opus":0.018152986027342766,"score_gpt":0.2768442974359539,"score_spread":0.2586913114086111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962989815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064990963,0.000041237196,0.99099827,0.0011034472,0.000053995613,0.00085138256,0.000062497056,0.00015709101,0.00023299684],"genre_scores_gemma":[0.7911054,0.00016072611,0.20842923,0.00013964277,0.000006976526,0.00004319446,0.000050316896,0.000010882342,0.0000536551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879473,0.00008487601,0.00037254638,0.00041810438,0.00016989403,0.00015986788],"domain_scores_gemma":[0.9989255,0.000173929,0.00014574114,0.0005151362,0.00017387977,0.000065804794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028657285,0.00017369362,0.00030257585,0.00035573274,0.0002543454,0.0001740399,0.00042734886,0.00010263323,0.00002630551],"category_scores_gemma":[0.000017524531,0.00015907135,0.000100234465,0.00079649943,0.00005514083,0.0005743095,0.000022725077,0.00012746762,4.360742e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010538522,0.00005070723,0.0001799667,0.00006936799,0.000089845606,6.324537e-8,0.0007524206,0.9526318,0.000040362112,0.00039595165,0.000002391943,0.04568178],"study_design_scores_gemma":[0.00077038055,0.00023373043,0.0011866771,0.000027181766,0.00011826219,0.0000037629923,0.000045281355,0.9911081,0.0043710773,0.0017839515,0.00013217216,0.00021942965],"about_ca_topic_score_codex":0.000019454994,"about_ca_topic_score_gemma":0.000037502243,"teacher_disagreement_score":0.7846063,"about_ca_system_score_codex":0.000023150527,"about_ca_system_score_gemma":0.00004486399,"threshold_uncertainty_score":0.6486742},"labels":[],"label_agreement":null},{"id":"W2963419150","doi":"10.4230/lipics.disc.2017.4","title":"Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Global Affairs Canada; Israel Science Foundation; University of Toronto","keywords":"Computer science; Algorithm; Overhead (engineering); Reuse; Lock (firearm); Artificial intelligence; Machine learning; Programming language","score_opus":0.03523850705275347,"score_gpt":0.28125691022323734,"score_spread":0.24601840317048387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963419150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011208747,0.00007082886,0.97224,0.0015056593,0.0015372514,0.0010681023,0.00012959824,0.0010549701,0.0111848675],"genre_scores_gemma":[0.3502434,0.00023280061,0.64666164,0.0011847754,0.00027775753,0.00015211738,0.00012364368,0.000083843646,0.0010400461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965997,0.000050490053,0.0010780338,0.0004998401,0.0007293171,0.0010426678],"domain_scores_gemma":[0.99416685,0.00011845127,0.0008632563,0.004197513,0.00034547513,0.0003084306],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010679303,0.0005605217,0.00060089264,0.0003237427,0.0018767824,0.00205855,0.007564529,0.00035375124,0.000017262586],"category_scores_gemma":[0.00034810588,0.000512634,0.0003554442,0.0002241331,0.00023531946,0.004634153,0.0016621944,0.00055622536,0.000046730405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042207533,0.0019048849,0.034783587,0.0025268244,0.001316563,0.000109353816,0.082925,0.0045279977,0.00040934875,0.08379642,0.3031086,0.48416933],"study_design_scores_gemma":[0.0068369377,0.000644365,0.0019307925,0.00078995933,0.0000811589,0.00021307911,0.0008022868,0.6807198,0.022491444,0.014104815,0.2690631,0.002322286],"about_ca_topic_score_codex":0.00007792841,"about_ca_topic_score_gemma":0.000028338784,"teacher_disagreement_score":0.6761918,"about_ca_system_score_codex":0.0001675625,"about_ca_system_score_gemma":0.00013053005,"threshold_uncertainty_score":0.99973255},"labels":[],"label_agreement":null},{"id":"W2963523287","doi":"10.1145/3330999","title":"Polyhedral Compilation for Multi-dimensional Stream Processing","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Xeon; Affine transformation; Code (set theory); Parallelism (grammar); Stream processing; Schedule; Transformation (genetics); Throughput; Polytope model; Xeon Phi; Digital signal processing; Algorithm; Programming language; Computer hardware; Mathematics","score_opus":0.02054009118434834,"score_gpt":0.27325854166869296,"score_spread":0.2527184504843446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963523287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012168076,0.000056727218,0.99669254,0.000915651,0.00011440858,0.0004720644,0.000023097773,0.0004092382,0.000099453304],"genre_scores_gemma":[0.22583689,0.000012558023,0.77344555,0.00036147065,0.000016346981,0.000030760664,0.000038689304,0.00001429926,0.00024343099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990082,0.00004321358,0.00020353735,0.00040141703,0.0001576694,0.00018595521],"domain_scores_gemma":[0.99928766,0.00009727,0.000093563496,0.00034523688,0.00011266185,0.00006359452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011391621,0.00016426964,0.00014778595,0.00020310999,0.00030178353,0.00013077987,0.00029097148,0.00008966069,0.00001387531],"category_scores_gemma":[0.000014707054,0.00015302126,0.000058126036,0.0002609499,0.000026487185,0.00026775908,0.000015437046,0.00014095276,0.000003601108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029359002,0.00006623905,0.000033628337,0.000017124532,0.000008430037,1.5751276e-7,0.00021384665,0.9021222,0.0001043642,0.00027391154,0.000015368447,0.097115375],"study_design_scores_gemma":[0.00068114157,0.00017720122,0.00014997531,0.000043423275,0.000010476469,0.000011254247,0.0000088170145,0.9966022,0.001115278,0.00078017457,0.0002359214,0.00018417889],"about_ca_topic_score_codex":0.0000030924234,"about_ca_topic_score_gemma":0.0000055462547,"teacher_disagreement_score":0.22462009,"about_ca_system_score_codex":0.000023439072,"about_ca_system_score_gemma":0.000046884954,"threshold_uncertainty_score":0.6240026},"labels":[],"label_agreement":null},{"id":"W2963722571","doi":"10.48550/arxiv.hep-ph/0202033","title":"From novel mathematics to efficient algorithms. Do we have proper SD foundation to build future?","year":2002,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pascal (unit); Component (thermodynamics); Java; Computer science; Software; Programming language; Thread (computing); Algorithm; Software engineering","score_opus":0.04838405444000686,"score_gpt":0.28783153708093856,"score_spread":0.23944748264093169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963722571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03821139,0.0001931398,0.95169485,0.005398195,0.0018317011,0.0010288234,0.000019640585,0.0008950245,0.00072721095],"genre_scores_gemma":[0.07833377,0.00008020332,0.9183556,0.00074490125,0.0011197646,0.00015435363,0.000025858537,0.000052967123,0.0011326022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970043,0.00006455426,0.0006449904,0.0012392545,0.00060110766,0.00044579344],"domain_scores_gemma":[0.9972249,0.000075171905,0.00030575105,0.0017622018,0.00036805664,0.00026389604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004025232,0.0004738839,0.00048359658,0.00033075374,0.00019830005,0.00054854114,0.0020345014,0.00030770103,0.000056200046],"category_scores_gemma":[0.00009836993,0.0004360423,0.00015272632,0.00042789982,0.000028880519,0.00011192967,0.0025073655,0.0005116422,0.0006893733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002159118,0.0019426817,0.0021113558,0.00035681043,0.00024809813,0.000038114344,0.03389723,0.80291516,0.0013064147,0.004412983,0.034586556,0.118163005],"study_design_scores_gemma":[0.00030164802,0.00010904934,0.0016848004,0.00073894433,0.000028415618,0.000007784832,0.00009357551,0.9519518,0.0032775993,0.0013214502,0.039455283,0.0010296743],"about_ca_topic_score_codex":0.000106710504,"about_ca_topic_score_gemma":0.000005286614,"teacher_disagreement_score":0.14903662,"about_ca_system_score_codex":0.00021647822,"about_ca_system_score_gemma":0.000098959405,"threshold_uncertainty_score":0.99980915},"labels":[],"label_agreement":null},{"id":"W2964204686","doi":"10.1142/s0129626417400035","title":"A Comparison of Big Data Frameworks on a Layered Dataflow Model","year":2017,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dataflow; Computer science; SPARK (programming language); Abstraction; Big data; Semantics (computer science); Programming paradigm; Analytics; Programming language; Data modeling; Execution model; Theoretical computer science; Software engineering; Data science; Data mining","score_opus":0.15044143720392847,"score_gpt":0.3750884397476739,"score_spread":0.22464700254374545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964204686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026635954,0.0001214561,0.9902742,0.004873535,0.00018267141,0.00013380912,0.0000092590835,0.00033581734,0.0014056871],"genre_scores_gemma":[0.5961292,0.0000073653,0.40253517,0.0011963563,0.00006629259,0.0000059781187,0.000018230063,0.000012083433,0.00002933361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998073,0.000052101488,0.0004135607,0.00071444723,0.000411995,0.00033492962],"domain_scores_gemma":[0.99571943,0.00006427954,0.00064301695,0.0034004457,0.00008702037,0.0000858095],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004177902,0.00022114936,0.00036616946,0.00013205576,0.00060477946,0.0006881669,0.0057138996,0.00015660955,0.0000011101264],"category_scores_gemma":[0.00019376377,0.00020799533,0.000047637197,0.00012826748,0.00015876158,0.0008738552,0.0012846043,0.00047976567,0.000010049731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054852597,0.00035394446,0.0021328295,0.00014146917,0.000040771825,0.000009127045,0.0015080842,0.76976496,0.0010971987,0.001955559,0.04003434,0.18290687],"study_design_scores_gemma":[0.00028826654,0.000032951877,0.00028862775,0.00020319001,0.00000746493,0.0000019454749,0.000006294069,0.99706584,0.00051686313,0.00087638554,0.00046979694,0.00024235203],"about_ca_topic_score_codex":0.000026334139,"about_ca_topic_score_gemma":0.0000030805327,"teacher_disagreement_score":0.59346557,"about_ca_system_score_codex":0.00002199647,"about_ca_system_score_gemma":0.00009578006,"threshold_uncertainty_score":0.9996657},"labels":[],"label_agreement":null},{"id":"W2964334533","doi":"10.1016/j.entcs.2018.03.025","title":"A Denotational Semantics for SPARC TSO","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Denotational semantics; Programming language; Modular design; Semantics (computer science); Denotational semantics of the Actor model; Normalisation by evaluation; Computer science; Operational semantics; Principle of compositionality; Theoretical computer science; Artificial intelligence","score_opus":0.00968326086108321,"score_gpt":0.2832651843296394,"score_spread":0.27358192346855614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964334533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060595246,0.000038371436,0.990897,0.0016731903,0.00031083316,0.0002607386,6.6668423e-7,0.00028384614,0.0004758203],"genre_scores_gemma":[0.5686285,0.000003762896,0.43077955,0.00043157226,0.00013476395,0.0000121585035,7.1325087e-7,0.000005477548,0.0000034846532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975103,0.00007435655,0.00030862828,0.00072816527,0.00045999893,0.00091855595],"domain_scores_gemma":[0.9982647,0.0006220752,0.00007770405,0.00055587,0.00036380865,0.00011585805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018214084,0.00016985617,0.00018252418,0.0002992684,0.00040415186,0.00031898884,0.0021210804,0.0000611248,0.000013349482],"category_scores_gemma":[0.0003613058,0.00015670969,0.000057682824,0.0013554486,0.0016803513,0.00040250516,0.0005230131,0.00019596434,0.000022112608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008670522,0.000044815002,0.000082587,0.000003561859,0.0000023615667,0.0000011042862,0.00020753722,0.0010169208,0.00016324461,0.9775177,0.000043088952,0.020908386],"study_design_scores_gemma":[0.00016976509,0.0003186282,0.00015146655,0.000014697493,0.0000011876843,0.000012621339,4.2788002e-7,0.6075853,0.008173897,0.38326508,0.00017026128,0.00013667585],"about_ca_topic_score_codex":0.000002294526,"about_ca_topic_score_gemma":0.0000042045926,"teacher_disagreement_score":0.60656834,"about_ca_system_score_codex":0.00016312649,"about_ca_system_score_gemma":0.00043639148,"threshold_uncertainty_score":0.63904357},"labels":[],"label_agreement":null},{"id":"W2965627508","doi":"10.4230/lipics.ecrts.2019.4","title":"PREM-Based Optimal Task Segmentation Under Fixed Priority Scheduling","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Compiler; Computation; Parallel computing; Scheduling (production processes); Task (project management); Task analysis; Theoretical computer science; Algorithm; Programming language; Mathematical optimization","score_opus":0.012539583983443844,"score_gpt":0.26311127491193836,"score_spread":0.2505716909284945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965627508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109076016,0.000022224012,0.88678765,0.00029775084,0.0006073015,0.0011456048,0.000043490894,0.0007376367,0.0012823244],"genre_scores_gemma":[0.43896666,0.0000067586307,0.55946857,0.0010527191,0.00005141806,0.000053468797,0.00021149231,0.000024151683,0.00016477777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974884,0.00006282621,0.0009012475,0.0003781448,0.00054355006,0.0006258714],"domain_scores_gemma":[0.99797857,0.00015350957,0.0004972936,0.0008593082,0.00034510557,0.00016623859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006956856,0.00036025597,0.0003744407,0.00028904475,0.00030771238,0.00060554664,0.0011590814,0.00021976972,0.0000245337],"category_scores_gemma":[0.0000517336,0.00034896604,0.00020960177,0.00041275684,0.00005569498,0.0017275725,0.00034221695,0.00035126522,0.00017297339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025513573,0.00095976575,0.015555911,0.0013115508,0.00030721546,0.0000048825877,0.009679244,0.9104272,0.0018673935,0.034407284,0.004289962,0.020934444],"study_design_scores_gemma":[0.0022205594,0.00024253436,0.00047605712,0.00011928571,0.000015404334,0.000011904001,0.00019564576,0.98734146,0.005064616,0.00038270673,0.003455431,0.0004744167],"about_ca_topic_score_codex":0.000009118323,"about_ca_topic_score_gemma":0.0000016550387,"teacher_disagreement_score":0.32989067,"about_ca_system_score_codex":0.00018461328,"about_ca_system_score_gemma":0.00017915436,"threshold_uncertainty_score":0.9998962},"labels":[],"label_agreement":null},{"id":"W2965782179","doi":"10.1109/ipdpsw.2019.00103","title":"AHEAD: A Tool for Projecting Next-Generation Hardware Enhancements on GPU-Accelerated Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Office of Science; Institute for Computing, Information and Cognitive Systems; U.S. Department of Energy","keywords":"Titan (rocket family); Supercomputer; Computer science; Profiling (computer programming); Node (physics); Computer architecture; Petascale computing; Exascale computing; Summit; Parallel computing; Operating system","score_opus":0.086933549285561,"score_gpt":0.3050382320768458,"score_spread":0.2181046827912848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965782179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028400805,0.000023372013,0.9653239,0.00010092271,0.0006633442,0.001118052,0.000001358213,0.00072670676,0.0036415346],"genre_scores_gemma":[0.80561584,0.0000053394147,0.18819332,0.00036196614,0.00013501856,0.00016027907,0.000026019025,0.000013090418,0.005489147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884367,0.000054502918,0.0002673972,0.00041380562,0.00019319572,0.00022740653],"domain_scores_gemma":[0.9992332,0.000054506603,0.00011926649,0.0003620315,0.00020055834,0.000030476327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032201916,0.00013292303,0.00015219804,0.00010495406,0.00015168093,0.00051904866,0.00036196975,0.000062508494,0.000012577003],"category_scores_gemma":[0.00003612649,0.00011591338,0.000042135485,0.00024623287,0.000004559793,0.0004525345,0.00006759542,0.00006440004,0.00006234723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013856568,0.000817876,0.0027612222,0.00064990745,0.00020887482,0.000006099997,0.002554874,0.34998176,0.19295882,0.21910954,0.09789801,0.13291447],"study_design_scores_gemma":[0.0002863593,0.00023815579,0.000024701298,0.000049463004,0.0000015856144,0.0000017195119,0.000013426636,0.96460456,0.031707723,0.000038713544,0.0028622877,0.00017129499],"about_ca_topic_score_codex":0.000023451234,"about_ca_topic_score_gemma":0.0000012981442,"teacher_disagreement_score":0.777215,"about_ca_system_score_codex":0.000060292212,"about_ca_system_score_gemma":0.000060418988,"threshold_uncertainty_score":0.5005198},"labels":[],"label_agreement":null},{"id":"W2967343999","doi":"10.1109/iccad45719.2019.8942115","title":"Workload-Aware Opportunistic Energy Efficiency in Multi-FPGA Platforms","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; University of Toronto; National Science Foundation","keywords":"Computer science; Scalability; Cloud computing; Workload; Field-programmable gate array; Energy consumption; Efficient energy use; Stratix; Data center; Frequency scaling; Big data; Embedded system; Distributed computing; Real-time computing; Database; Computer network; Operating system; Engineering","score_opus":0.05024632628245485,"score_gpt":0.28849625472867607,"score_spread":0.23824992844622123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967343999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034261867,0.00022565456,0.9873144,0.00012252467,0.00080968114,0.0002715335,0.000004144954,0.0011648101,0.009744613],"genre_scores_gemma":[0.74362534,0.00036125712,0.24912451,0.00061236764,0.000048526257,0.000034590917,0.000048430305,0.000032061882,0.006112916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974406,0.000050670315,0.0006189208,0.0010299275,0.00036920814,0.00049069343],"domain_scores_gemma":[0.99787486,0.00011356847,0.00028689066,0.0014604514,0.00012793476,0.00013627892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004344108,0.00040330793,0.00049177627,0.000503401,0.000074644115,0.00029399534,0.0025281,0.0004384147,0.000040333704],"category_scores_gemma":[0.000047389512,0.0003583903,0.00014567938,0.00044139204,0.00004268364,0.00017752268,0.0028357622,0.0005762271,0.000040084335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020037558,0.00049566344,0.00075397117,0.00015473344,0.00003096008,0.00010371092,0.00046934845,0.88832515,0.0000042323522,0.05537866,0.0047139535,0.049549583],"study_design_scores_gemma":[0.00025212474,0.00007652016,0.0001497381,0.00029080224,0.000002962471,0.0000062847034,0.000008627224,0.99366355,0.0001499406,0.004325904,0.0005746016,0.0004989499],"about_ca_topic_score_codex":0.00019342941,"about_ca_topic_score_gemma":0.000042314103,"teacher_disagreement_score":0.74328274,"about_ca_system_score_codex":0.0001455389,"about_ca_system_score_gemma":0.00042739836,"threshold_uncertainty_score":0.9998868},"labels":[],"label_agreement":null},{"id":"W2970058891","doi":"10.1109/tpds.2019.2937029","title":"Energy and Task-Aware Partitioning on Single-ISA Clustered Heterogeneous Processors","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Frequency scaling; Energy consumption; Scheduling (production processes); Embedded system; Cache; Efficient energy use; Exploit; Parallel computing; Software; Symmetric multiprocessor system; Distributed computing; Multi-core processor; Reduction (mathematics); Operating system","score_opus":0.015953920145428197,"score_gpt":0.22302964595911495,"score_spread":0.20707572581368675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970058891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013416991,0.00019760462,0.98476815,0.00017454928,0.00037643837,0.00025704154,0.00006761353,0.0004929867,0.00024861025],"genre_scores_gemma":[0.9980294,0.000076511606,0.0012044925,0.00015416881,0.000025471685,0.00007058261,0.000028049682,0.000015361487,0.00039596367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841774,0.00012322619,0.00034451694,0.0005621995,0.0002464067,0.0003059176],"domain_scores_gemma":[0.9991247,0.00010661574,0.00013840123,0.00037662566,0.00009282668,0.00016082726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012804999,0.00025076646,0.0002922236,0.00014117765,0.00030356657,0.00033740775,0.00023869329,0.00014165194,0.0000049921036],"category_scores_gemma":[0.0000028004183,0.00023158232,0.00006189993,0.00026684924,0.000044381784,0.00023372936,0.0000070066026,0.00013090954,0.000014020306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005245672,0.00017560774,0.000054219396,0.00007387517,0.000044456072,0.000010101265,0.00017661435,0.9951832,0.00015974978,0.0007823327,0.00035639596,0.002930942],"study_design_scores_gemma":[0.00080306194,0.00055570394,0.000031168434,0.00020638239,0.0000147977225,0.00011977757,0.00005653713,0.994676,0.0010892968,0.00017518854,0.0018839847,0.00038809178],"about_ca_topic_score_codex":0.00006559216,"about_ca_topic_score_gemma":0.000011448101,"teacher_disagreement_score":0.9846124,"about_ca_system_score_codex":0.000053198197,"about_ca_system_score_gemma":0.000028713912,"threshold_uncertainty_score":0.9443653},"labels":[],"label_agreement":null},{"id":"W2971398112","doi":"10.1002/spe.2746","title":"Fast and flexible tracepoints in x86","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Google","keywords":"Thread (computing); Computer science; Jump; Tracing; x86; Parallel computing; Offset (computer science); Operating system; Embedded system; Software","score_opus":0.01072286284567254,"score_gpt":0.28202385039854405,"score_spread":0.2713009875528715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971398112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16509615,0.00073355617,0.8302179,0.0008866205,0.00013348028,0.00016799303,3.355096e-7,0.00037924064,0.002384708],"genre_scores_gemma":[0.5968839,0.00029475093,0.40169153,0.00079742906,0.000011102775,0.000014810908,4.4849367e-7,0.0000052090763,0.000300819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913365,0.000055532153,0.00014404324,0.00035531478,0.00013260043,0.00017884687],"domain_scores_gemma":[0.9993209,0.00023943672,0.00007379994,0.00025807507,0.000046346184,0.00006144401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024760384,0.00009309215,0.000111556044,0.000076869,0.00007311889,0.00017987989,0.00023303625,0.000047505393,0.000008810482],"category_scores_gemma":[0.0002886168,0.00008950191,0.000010853755,0.00024781827,0.00004293107,0.0015364945,0.00020446957,0.00012393162,0.000019523777],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014789414,0.000489077,0.11246689,0.00016184652,0.000025424848,0.00014262879,0.1829677,0.0033350785,0.0012737057,0.035127684,0.0013452468,0.66251683],"study_design_scores_gemma":[0.006355665,0.0022902132,0.079586655,0.0010595054,0.000034025772,0.0024607647,0.035616234,0.6432184,0.026104128,0.023480328,0.17503297,0.0047611073],"about_ca_topic_score_codex":0.000052814692,"about_ca_topic_score_gemma":0.0000016741874,"teacher_disagreement_score":0.65775573,"about_ca_system_score_codex":0.000012369739,"about_ca_system_score_gemma":0.000028050887,"threshold_uncertainty_score":0.3649782},"labels":[],"label_agreement":null},{"id":"W2971516936","doi":"10.1016/j.parco.2019.102547","title":"A dynamic, unified design for dedicated message matching engines for collective and point-to-point communications","year":2019,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Government of Ontario; University of Toronto; Canada Foundation for Innovation; Ontario Research Foundation; U.S. Department of Energy","keywords":"Message queue; Computer science; Queue; Point-to-point; Message passing; Message Passing Interface; Scalability; Speedup; Computer network; Distributed computing; Matching (statistics); Priority queue; Queueing theory; Point (geometry); Parallel computing; Operating system","score_opus":0.027555898189565452,"score_gpt":0.2919306506323945,"score_spread":0.26437475244282904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971516936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031237465,0.00021021962,0.9907514,0.0020372306,0.00015119048,0.002421171,0.00000646643,0.0007942066,0.0005043608],"genre_scores_gemma":[0.3417169,0.000015171215,0.6574879,0.0003668644,0.000014811988,0.00010239826,0.000014923418,0.000024204553,0.00025681584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809843,0.00018437022,0.00046025062,0.000613923,0.0001699324,0.00047310127],"domain_scores_gemma":[0.9964911,0.0018490438,0.00023729922,0.0008642004,0.00041367311,0.00014472986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013706128,0.00026361182,0.0003909249,0.0002743854,0.00059143396,0.00027925058,0.001318698,0.0001104682,0.0000018397268],"category_scores_gemma":[0.0002444894,0.000273028,0.000088259185,0.0006020355,0.00004392894,0.00024669332,0.00073421095,0.00018543618,0.000012943145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021752749,0.00026526782,0.0002671575,0.00028516952,0.00024294117,0.0000022250874,0.012588535,0.8712105,0.0022726548,0.08667764,0.0060656224,0.019904742],"study_design_scores_gemma":[0.000929239,0.0002227359,0.00020089185,0.0001094207,0.000012949614,0.000010917511,0.000086863256,0.9820887,0.00023069556,0.015042053,0.0007252913,0.00034027552],"about_ca_topic_score_codex":0.000013026617,"about_ca_topic_score_gemma":0.000003776088,"teacher_disagreement_score":0.33859316,"about_ca_system_score_codex":0.00011381697,"about_ca_system_score_gemma":0.00015669077,"threshold_uncertainty_score":0.99997216},"labels":[],"label_agreement":null},{"id":"W2972198038","doi":"10.1109/asap.2019.00013","title":"Understanding Performance Gains of Accelerator-Rich Architectures","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Exploit; Speedup; Parallel computing; Pipeline (software); Memory hierarchy; Overhead (engineering); Performance improvement; Personalization; Computation; Efficient energy use; Computer architecture; Supercomputer; Focus (optics); Operating system; Cache","score_opus":0.07925868752093863,"score_gpt":0.2776258451146219,"score_spread":0.19836715759368329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972198038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1951914,0.0000116798,0.7637659,0.000083272695,0.000066534594,0.00006781722,1.2276581e-7,0.00024319306,0.040570088],"genre_scores_gemma":[0.8991947,0.000011757758,0.100416385,0.00015358042,0.000008768934,0.0000010965468,3.3164832e-7,0.000003579886,0.00020980505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993919,0.000022019178,0.00013678134,0.00016833242,0.00014693798,0.00013403026],"domain_scores_gemma":[0.99952525,0.000045039724,0.0000611446,0.00030644282,0.000034593948,0.000027558279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114504204,0.00006999841,0.00010203785,0.00011206501,0.000042851265,0.000040889874,0.00047674292,0.000030101159,0.000026902524],"category_scores_gemma":[0.000006269461,0.000057649264,0.000026368401,0.00027719158,0.00001562209,0.00010442796,0.00013556551,0.0000664783,0.0000168041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019105315,0.00013565487,0.1557147,0.00014805414,0.000052293068,0.000002276979,0.0023533932,0.20167874,0.0033368734,0.61799496,0.004066268,0.014497659],"study_design_scores_gemma":[0.00027475995,0.00018644975,0.005108689,0.000044672994,0.0000017913198,0.0000066625953,0.000046940506,0.9400387,0.045909666,0.007904997,0.0002357359,0.00024096444],"about_ca_topic_score_codex":0.0000055046476,"about_ca_topic_score_gemma":8.9963453e-7,"teacher_disagreement_score":0.7383599,"about_ca_system_score_codex":0.000027118058,"about_ca_system_score_gemma":0.000030412371,"threshold_uncertainty_score":0.23508689},"labels":[],"label_agreement":null},{"id":"W2975017074","doi":"10.1145/3313231.3352362","title":"UBERNoC","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.008486051169310328,"score_gpt":0.23256137273729616,"score_spread":0.22407532156798582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975017074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022096843,0.0000094902325,0.7974374,0.00028927476,0.000085946405,0.000032487136,1.842386e-8,0.0006032825,0.19933239],"genre_scores_gemma":[0.5535105,0.0000027384335,0.43457642,0.0006505219,0.000009398424,0.0000010156601,2.2948836e-7,0.0000019028131,0.011247296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968743,0.0000092813925,0.00005059656,0.00011484997,0.000064492044,0.00007332228],"domain_scores_gemma":[0.9996742,0.00001463331,0.000013386879,0.0002580149,0.000020055626,0.000019688574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006531925,0.000031146737,0.000037488895,0.00002903152,0.000015957457,0.00004645572,0.00034787582,0.00001509685,0.00007174455],"category_scores_gemma":[0.0000032887192,0.000025786452,0.000015900923,0.00010906302,0.0000029685614,0.00012520491,0.00009659927,0.000025750951,0.0006907757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.541713e-7,0.000023303215,0.0029253862,0.0000036831782,0.0000042551505,0.0000014364281,0.00010973038,0.003625207,0.00029355867,0.9426487,0.021780966,0.028583085],"study_design_scores_gemma":[0.00011953711,0.00004176784,0.00096494454,0.0000047008048,3.218919e-7,0.000006106676,0.000002302062,0.94994926,0.0050910176,0.007963745,0.035725337,0.00013092763],"about_ca_topic_score_codex":0.0000042251568,"about_ca_topic_score_gemma":1.2602881e-7,"teacher_disagreement_score":0.9463241,"about_ca_system_score_codex":0.000004949473,"about_ca_system_score_gemma":0.000009490525,"threshold_uncertainty_score":0.88787544},"labels":[],"label_agreement":null},{"id":"W2977925615","doi":"","title":"Design and Implementation of a VLIW DSP Compiler","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Very long instruction word; Computer science; Compiler; Interprocedural optimization; Parallel computing; Code generation; SIMD; Instruction scheduling; Optimizing compiler; Digital signal processing; Compiler correctness; Programming language; Loop optimization; Computer hardware; Operating system; Schedule; Key (lock)","score_opus":0.013213921953368924,"score_gpt":0.28810431928522656,"score_spread":0.27489039733185766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977925615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007765662,0.00010802374,0.99744886,0.00067375065,0.0000052232135,0.00055162143,0.0000011997927,0.000263481,0.00017129272],"genre_scores_gemma":[0.13601422,0.00003645028,0.8634237,0.00043456693,0.000020996396,0.000049686372,0.0000057256298,0.0000036301458,0.000011007672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992204,0.000042421012,0.00024781044,0.00026784916,0.00008682848,0.00013473845],"domain_scores_gemma":[0.9994236,0.000048193924,0.000115562885,0.0002728673,0.000092118644,0.000047604997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015676062,0.000097892385,0.00012371888,0.000115530085,0.00010462484,0.00007193164,0.0004121266,0.000034483546,0.0000031745728],"category_scores_gemma":[1.6569994e-7,0.000100536156,0.000027466876,0.00029765588,0.000025423396,0.00015404346,0.00009408926,0.000053281576,0.0000057454663],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023038128,0.00012315153,0.0001789239,0.000013114345,0.000015129138,4.901881e-7,0.0009173443,0.0027064388,0.01069022,0.087413095,0.0051905653,0.89274925],"study_design_scores_gemma":[0.002230039,0.00075634185,0.034061104,0.00006913344,0.00004238714,0.00012061329,0.000067810055,0.55357814,0.19482102,0.10366496,0.10937965,0.0012087995],"about_ca_topic_score_codex":0.0000061246487,"about_ca_topic_score_gemma":2.8255795e-7,"teacher_disagreement_score":0.8915404,"about_ca_system_score_codex":0.000014076555,"about_ca_system_score_gemma":0.00003012147,"threshold_uncertainty_score":0.40997452},"labels":[],"label_agreement":null},{"id":"W2979150964","doi":"","title":"A Dual-Issue Embedded Processor for Low Power Devices","year":2015,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Embedded system; Efficient energy use; Instruction scheduling; Field-programmable gate array; Energy consumption; Very long instruction word; Superscalar; Power consumption; Computer architecture; Power (physics); Parallel computing; Operating system; Engineering; Electrical engineering; Dynamic priority scheduling; Schedule","score_opus":0.025759065841728206,"score_gpt":0.296784762946851,"score_spread":0.2710256971051228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979150964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008140416,0.00006596462,0.9769024,0.001184189,0.0001651616,0.00023995264,6.221836e-7,0.0010088639,0.019618798],"genre_scores_gemma":[0.26893124,0.0000014381711,0.7259468,0.001239715,0.00006188714,0.00004556273,0.000002322763,0.000008422232,0.0037626466],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991713,0.000021769347,0.0001647359,0.00027265077,0.00016696956,0.00020258452],"domain_scores_gemma":[0.9991606,0.000050584946,0.000068808724,0.00029533706,0.0003116542,0.000113036185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031313463,0.00009883239,0.00012101505,0.00007116331,0.00006501616,0.0001725873,0.00047247877,0.000050178063,0.000011923648],"category_scores_gemma":[0.000101311125,0.000082765604,0.000035795478,0.00024248575,0.000015366915,0.00033509906,0.00012562126,0.000039713595,0.00005592331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058029556,0.00051582087,0.00042021106,0.00015697436,0.00006353143,0.000015499718,0.008660439,0.013501426,0.00019890697,0.13069466,0.8185783,0.027136207],"study_design_scores_gemma":[0.00082661177,0.00036065603,0.000061542785,0.000039302504,0.000004844956,0.000018076555,0.000117296986,0.87308306,0.014074635,0.012212321,0.09876227,0.00043937837],"about_ca_topic_score_codex":0.000005645134,"about_ca_topic_score_gemma":0.000002694745,"teacher_disagreement_score":0.85958165,"about_ca_system_score_codex":0.000017352346,"about_ca_system_score_gemma":0.000104834915,"threshold_uncertainty_score":0.33750835},"labels":[],"label_agreement":null},{"id":"W2979310116","doi":"10.1145/3358196","title":"Cache Locking Content Selection Algorithms for ARINC-653 Compliant RTOS","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Partition (number theory); Embedded system; Cache algorithms; Multi-core processor; Software; Operating system; Avionics; Real-time operating system; AUTOSAR; Parallel computing; CPU cache; Distributed computing","score_opus":0.06373398383966881,"score_gpt":0.2953478563070581,"score_spread":0.2316138724673893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979310116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061622164,0.00009015976,0.987595,0.00024673043,0.0022135775,0.001394166,0.000007694879,0.001756451,0.0005339687],"genre_scores_gemma":[0.7663995,0.000005982482,0.2325487,0.00018011252,0.00012946012,0.000066181274,0.000008175929,0.000036889698,0.00062503025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971165,0.00020837283,0.0007269407,0.0009006651,0.00044388828,0.0006036156],"domain_scores_gemma":[0.997425,0.0005682693,0.00035565544,0.0011008674,0.00040791952,0.00014229225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007944924,0.000369889,0.0005054092,0.00034733722,0.0006142752,0.00044288946,0.0013310069,0.00019070347,0.000005767166],"category_scores_gemma":[0.000041311956,0.00037032226,0.00024238741,0.00066328415,0.00003068222,0.0002999095,0.000046879963,0.00038895302,0.00007304062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000364323,0.00025851003,0.00022642128,0.00016670293,0.00016661461,0.0000030226352,0.0011363971,0.9462493,0.0011633642,0.0060925363,0.00046190334,0.044038795],"study_design_scores_gemma":[0.00094569917,0.0003698348,0.00011137585,0.00026804817,0.00002060004,0.00008951388,0.0001945808,0.9931951,0.0027515623,0.00024086502,0.0013687116,0.00044406668],"about_ca_topic_score_codex":0.00015941086,"about_ca_topic_score_gemma":0.000003966283,"teacher_disagreement_score":0.7602373,"about_ca_system_score_codex":0.0002553724,"about_ca_system_score_gemma":0.00009834238,"threshold_uncertainty_score":0.9998749},"labels":[],"label_agreement":null},{"id":"W2979729662","doi":"10.1109/ccece.2019.8861876","title":"Reconfigurable Hybrid Cache Hierarchy in 3D Chip-Multi Processors Based on a Convex optimization Method","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Static random-access memory; Cache coloring; Parallel computing; Embedded system; Cache-only memory architecture; Cache algorithms; Dram; Cache pollution; Universal memory; CPU cache; Control reconfiguration; Computer architecture; Memory hierarchy; Interleaved memory; Memory management; Semiconductor memory; Computer hardware","score_opus":0.01879084866766153,"score_gpt":0.2790873450033338,"score_spread":0.2602964963356723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979729662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034496532,0.000020821275,0.96482754,0.00075220905,0.000114506176,0.00043818122,9.985656e-7,0.00064391474,0.032856848],"genre_scores_gemma":[0.12658446,0.000009552532,0.87035495,0.0017549844,0.000010734824,0.00003019588,0.00001042053,0.000014721445,0.0012299934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825805,0.0002677297,0.00032868498,0.00057804486,0.00026003976,0.00030744507],"domain_scores_gemma":[0.9988337,0.00026163383,0.00012459212,0.00054594275,0.00015717131,0.00007691697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094253937,0.00018647214,0.00025648423,0.00036449792,0.00006609341,0.00014805651,0.00068083836,0.00007630544,0.00011511163],"category_scores_gemma":[0.0001494658,0.00016888265,0.00004866786,0.000642269,0.000016407883,0.00039569358,0.000055491084,0.0001635192,0.000064103835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014803928,0.00011044662,0.00027040602,0.000015393374,0.0000034579657,0.0000035650683,0.000118500066,0.9905865,0.000033262706,0.0016058683,0.0002349919,0.007002811],"study_design_scores_gemma":[0.00071901263,0.00012641778,0.00008191758,0.000053365267,0.0000016632034,0.0000048985144,0.0000080961945,0.99026036,0.0077926824,0.00013594376,0.0005853262,0.00023029573],"about_ca_topic_score_codex":0.00006850889,"about_ca_topic_score_gemma":0.0000021751323,"teacher_disagreement_score":0.1262395,"about_ca_system_score_codex":0.00007604219,"about_ca_system_score_gemma":0.00014021329,"threshold_uncertainty_score":0.6886834},"labels":[],"label_agreement":null},{"id":"W2979900520","doi":"10.1145/3352460.3358301","title":"DynaSprint","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Semiconductor Research Corporation; National Science Foundation","keywords":"Sprint; Computer science; Cache; Software; Simulation; Operating system; Software engineering","score_opus":0.008122020047612871,"score_gpt":0.23241371926292603,"score_spread":0.22429169921531317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979900520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002627154,0.0000069553284,0.84991205,0.00029568878,0.000086142354,0.000037220027,1.3585383e-8,0.0006141553,0.14642063],"genre_scores_gemma":[0.50714827,0.0000018243023,0.48898858,0.00032799973,0.0000046121627,9.1003534e-7,1.14971506e-7,0.00000124294,0.003526455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996889,0.000009000951,0.000052273565,0.00011733536,0.00006110318,0.000071343624],"domain_scores_gemma":[0.9996608,0.000011971914,0.00001349412,0.0002736796,0.000020132346,0.000019917625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006949355,0.00003103911,0.000037136877,0.000029125127,0.000014793096,0.000033585868,0.00029729435,0.00001411817,0.00006220522],"category_scores_gemma":[0.0000031983245,0.000025610523,0.000016643977,0.00009785387,0.0000029872742,0.000099604884,0.00012234383,0.00002676243,0.0005706157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.572848e-7,0.000011451621,0.0012178712,0.0000016281875,0.0000018815966,6.268446e-7,0.000041220304,0.0020564878,0.00015722934,0.97833365,0.0020324006,0.016145267],"study_design_scores_gemma":[0.00008822795,0.00003323546,0.0018149567,0.0000037270497,2.2439363e-7,0.0000039229553,0.0000022351483,0.9683054,0.0048545874,0.0050295317,0.019761762,0.000102200975],"about_ca_topic_score_codex":0.000004581932,"about_ca_topic_score_gemma":1.5892591e-7,"teacher_disagreement_score":0.97330415,"about_ca_system_score_codex":0.0000067438214,"about_ca_system_score_gemma":0.000009684478,"threshold_uncertainty_score":0.73343},"labels":[],"label_agreement":null},{"id":"W2979921829","doi":"10.1109/ccece.2019.8861762","title":"Power-Management based on Reconfigurable Last-Cache level on Non-volatile Memories in Chip-Multi processors","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Embedded system; Computer architecture; Cache-only memory architecture; Static random-access memory; System on a chip; CPU cache; Context (archaeology); Power management; Chip; Parallel computing; Cache coloring; Power (physics); Computer hardware","score_opus":0.02229204172461162,"score_gpt":0.2561847432994992,"score_spread":0.23389270157488756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979921829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012641438,0.0000060950115,0.71060914,0.0006311605,0.00022899012,0.00053041877,0.0000013902403,0.00049731194,0.27485406],"genre_scores_gemma":[0.8342559,0.0000036371732,0.15606089,0.0011785291,0.000008446748,0.000031294596,0.0000036706203,0.000012909714,0.008444743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985713,0.000053724027,0.0002591592,0.0005270508,0.00028896026,0.0002998479],"domain_scores_gemma":[0.9990888,0.00009632893,0.000093205854,0.0006057549,0.000058458107,0.000057420566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003989961,0.00019435032,0.00019844572,0.00031122443,0.00007386573,0.00014027077,0.0007301963,0.00007093265,0.000109859204],"category_scores_gemma":[0.000024906156,0.0001667468,0.000047047877,0.0005270473,0.000015448995,0.00022383357,0.00007468116,0.00017074008,0.00024979646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014296669,0.0015094045,0.010160145,0.0002288573,0.00004644833,0.000030239944,0.0017965633,0.90465903,0.00027325557,0.033268552,0.020714622,0.027169887],"study_design_scores_gemma":[0.0007664074,0.0002901249,0.0067934035,0.0001420971,0.0000011691374,5.0797e-7,0.00003029794,0.979226,0.010659304,0.0002804087,0.0015356984,0.00027460724],"about_ca_topic_score_codex":0.000018247049,"about_ca_topic_score_gemma":0.000010409188,"teacher_disagreement_score":0.82161444,"about_ca_system_score_codex":0.00006719531,"about_ca_system_score_gemma":0.00005626032,"threshold_uncertainty_score":0.6799737},"labels":[],"label_agreement":null},{"id":"W2982752203","doi":"10.5753/wscad.2019.8681","title":"Performance Evaluation of Compiler Optimizations in FPGA Accelerators","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Loop unrolling; Field-programmable gate array; Compiler; Parallel computing; Speedup; Kernel (algebra); Matrix multiplication; Multiplication (music); Computation; Microprocessor; Code (set theory); Embedded system; Computer architecture; Operating system; Algorithm; Programming language","score_opus":0.03428472202872639,"score_gpt":0.2901570094271263,"score_spread":0.2558722873983999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982752203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41616735,0.00002382194,0.5240234,0.00008122818,0.0001244491,0.00030514432,2.8593223e-7,0.00017060703,0.059103712],"genre_scores_gemma":[0.878137,0.000013384072,0.121619605,0.00006067842,0.000004569673,0.000008854057,0.000002654853,0.000003218758,0.00015006428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911046,0.00007626996,0.00022796959,0.00017766161,0.00029940376,0.00010822406],"domain_scores_gemma":[0.99929833,0.000031763822,0.00007829688,0.0003228779,0.000247953,0.000020783598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006468269,0.00006490709,0.00010757377,0.00018457457,0.00002490947,0.000028991755,0.00038725566,0.0000372957,0.00012229115],"category_scores_gemma":[0.000018647761,0.000060454946,0.000020877706,0.0005530373,0.00001181099,0.00037528522,0.0000948465,0.000054758406,0.00002834113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013681478,0.000045820187,0.0207749,0.000005697678,0.0000026754326,4.7995666e-8,0.00017155113,0.95921373,0.00004929309,0.0041672965,0.00024464994,0.015322966],"study_design_scores_gemma":[0.00033333575,0.000030436766,0.01880308,0.000018164197,0.0000015318507,5.744781e-7,0.000006471079,0.9772207,0.0033063688,0.00013674558,0.0000686471,0.000073953015],"about_ca_topic_score_codex":0.000010335403,"about_ca_topic_score_gemma":0.0000019818146,"teacher_disagreement_score":0.4619696,"about_ca_system_score_codex":0.000036853275,"about_ca_system_score_gemma":0.000087856046,"threshold_uncertainty_score":0.24652812},"labels":[],"label_agreement":null},{"id":"W2984139344","doi":"10.1109/pact.2019.00028","title":"Analyzing and Leveraging Remote-Core Bandwidth for Enhanced Performance in GPUs","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Bandwidth (computing); Exploit; Memory bandwidth; Multi-core processor; Graphics; General-purpose computing on graphics processing units; Parallel computing; Computer architecture; Operating system; Computer network","score_opus":0.018642293545309642,"score_gpt":0.258099745046452,"score_spread":0.23945745150114237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984139344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30208942,0.00003711856,0.694713,0.00007894117,0.000053664167,0.00013024326,6.845763e-8,0.00014210709,0.0027554666],"genre_scores_gemma":[0.66475,0.000030917243,0.33462062,0.00009434993,0.00000808044,0.0000019949962,6.0898515e-7,0.0000032637938,0.0004901823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932957,0.000011264465,0.00014621903,0.00027195786,0.00006333896,0.00017767733],"domain_scores_gemma":[0.99960285,0.00006706551,0.000044365715,0.00021792679,0.000038960898,0.000028836466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026401662,0.000079275036,0.000120641394,0.0001249114,0.000053257954,0.00007046321,0.00024721667,0.00003291814,0.0000039260485],"category_scores_gemma":[0.000015949576,0.0000722592,0.000020097857,0.0002211076,0.000008295988,0.000264062,0.00009986919,0.00006199101,0.0000042856077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006725692,0.00008315642,0.13208817,0.0003378049,0.000032537908,0.0000036954452,0.0040417993,0.098988704,0.009418978,0.025167117,0.000834392,0.7289364],"study_design_scores_gemma":[0.00031145973,0.00005088513,0.005541833,0.00004773845,7.125931e-7,0.0000028011925,0.000006692348,0.98286164,0.009897542,0.0009700914,0.00018862667,0.000119961565],"about_ca_topic_score_codex":0.000013267575,"about_ca_topic_score_gemma":0.0000025250768,"teacher_disagreement_score":0.8838729,"about_ca_system_score_codex":0.00002033594,"about_ca_system_score_gemma":0.00001984051,"threshold_uncertainty_score":0.29466444},"labels":[],"label_agreement":null},{"id":"W2984946966","doi":"10.1109/pact.2019.00033","title":"Adaptive Task Aggregation for High-Performance Sparse Solvers on GPUs","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Speedup; Parallel computing; Scheduling (production processes); Computation; Massively parallel; Task (project management); CUDA; Latency (audio); Algorithm","score_opus":0.016313616223151715,"score_gpt":0.23189728494492087,"score_spread":0.21558366872176915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984946966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048051253,0.000007076484,0.9429991,0.00023227163,0.00031563907,0.00033730405,0.0000010580276,0.00051021756,0.007546067],"genre_scores_gemma":[0.73422265,0.000009172156,0.2636185,0.00041581033,0.000025753527,0.000016366348,0.0000036444007,0.0000054105385,0.0016826689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922913,0.000018043143,0.00013447161,0.00029062314,0.00014797586,0.00017978196],"domain_scores_gemma":[0.9993725,0.000079481375,0.00008076388,0.00034109698,0.00008977457,0.000036381207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016550484,0.0001012027,0.00010549079,0.00009047104,0.000082156905,0.00006130164,0.00039005425,0.000049044982,0.000011534439],"category_scores_gemma":[0.0000119144715,0.000088310815,0.00003186302,0.00017138668,0.00001252548,0.00031491727,0.00006276743,0.000059244125,0.00014835011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001184402,0.00015530693,0.0008434602,0.000035003453,0.00003830544,0.0000014036531,0.00052890007,0.2982622,0.00048298205,0.51466703,0.023690753,0.16117616],"study_design_scores_gemma":[0.00038424763,0.00051167095,0.00044930278,0.00003153626,0.0000017549912,0.0000010635312,0.000005712117,0.97050273,0.024695424,0.001983231,0.0012720736,0.00016123844],"about_ca_topic_score_codex":0.000012731759,"about_ca_topic_score_gemma":7.756313e-7,"teacher_disagreement_score":0.6861714,"about_ca_system_score_codex":0.000041001855,"about_ca_system_score_gemma":0.000033675613,"threshold_uncertainty_score":0.36012104},"labels":[],"label_agreement":null},{"id":"W2985229340","doi":"10.1145/3357526.3357532","title":"Co-ML: a case for <u>Co</u> llaborative <u>ML</u> acceleration using near-data processing","year":2019,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Byte; Computation; Parallel computing; Bandwidth (computing); Acceleration; Focus (optics); Computational science; Algorithm; Operating system; Telecommunications","score_opus":0.04889868365628411,"score_gpt":0.3239617906846056,"score_spread":0.2750631070283215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985229340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70168304,0.00015182355,0.2676639,0.0027542866,0.0038262226,0.003597219,0.00014122434,0.00067904725,0.019503249],"genre_scores_gemma":[0.9761279,0.0000037881946,0.02276321,0.00016348866,0.00024575338,0.00004410919,0.000015227197,0.000024349123,0.0006121654],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805784,0.00002397961,0.00051909446,0.000584715,0.000605334,0.00020901184],"domain_scores_gemma":[0.997619,0.00009692771,0.00076643203,0.00036592898,0.0011008022,0.00005091546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009369074,0.00020239652,0.00025049876,0.00011367752,0.00030685897,0.0009590491,0.0023299628,0.00009546186,0.0000032936732],"category_scores_gemma":[0.000114401075,0.00016116221,0.00007396231,0.00031577842,0.000048051737,0.0013287698,0.00029646402,0.00015010178,0.000007067747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005582724,0.0011582804,0.0136981495,0.0030101705,0.0007561222,0.0000339675,0.015154427,0.3051154,0.5352444,0.07084719,0.044291727,0.0101318965],"study_design_scores_gemma":[0.0003912288,0.00009874387,0.000021137048,0.00032878492,0.000011141987,0.0002425595,0.00021291603,0.949982,0.04648939,0.00009090932,0.0019366656,0.00019450656],"about_ca_topic_score_codex":0.0000787818,"about_ca_topic_score_gemma":0.0000013227767,"teacher_disagreement_score":0.6448666,"about_ca_system_score_codex":0.00018124863,"about_ca_system_score_gemma":0.00014896685,"threshold_uncertainty_score":0.9248133},"labels":[],"label_agreement":null},{"id":"W2986344129","doi":"10.1109/fpl.2019.00057","title":"A Dynamic Memory Allocation Library for High-Level Synthesis","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; C dynamic memory allocation; Allocator; High-level synthesis; Software portability; Suite; Benchmark (surveying); Memory management; Software; Embedded system; Register allocation; Computer architecture; Operating system; Overlay; Compiler; Field-programmable gate array","score_opus":0.013956221183696679,"score_gpt":0.23318413292329615,"score_spread":0.21922791173959946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986344129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029239745,0.000022763603,0.9875695,0.0017456154,0.00016582613,0.0002798077,0.0000030602794,0.0011935531,0.006095887],"genre_scores_gemma":[0.39700472,0.000007753812,0.5963661,0.00040219683,0.00000910601,0.000034730074,0.000006461861,0.000008411431,0.0061605335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999316,0.000028129765,0.00014383651,0.000270825,0.00009739535,0.00014383162],"domain_scores_gemma":[0.9992698,0.00019574503,0.000057185367,0.00040407083,0.00003791685,0.000035318615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013025265,0.00008526316,0.00010749364,0.000095491174,0.00005294308,0.000110675865,0.00058648054,0.000050995728,0.000054918575],"category_scores_gemma":[0.000026880796,0.000076410695,0.000042016385,0.00017397187,0.000008716674,0.0005356454,0.00013023234,0.000036115845,0.00008620403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030353458,0.00021105654,0.00034763626,0.00014221441,0.000064205036,0.0000017342993,0.0003795511,0.019946314,0.0021234064,0.6550293,0.058799155,0.26292506],"study_design_scores_gemma":[0.000137358,0.000045817444,0.0006357543,0.000020032554,0.0000028199254,0.000001995484,0.000006483959,0.97199714,0.017915828,0.008001479,0.0010709476,0.00016433916],"about_ca_topic_score_codex":0.0000070398296,"about_ca_topic_score_gemma":6.600624e-7,"teacher_disagreement_score":0.9520508,"about_ca_system_score_codex":0.000015242083,"about_ca_system_score_gemma":0.0000510991,"threshold_uncertainty_score":0.31159377},"labels":[],"label_agreement":null},{"id":"W2987123212","doi":"10.1109/pact.2019.00034","title":"EDGE: Event-Driven GPU Execution","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Preemption; Parallel computing; Latency (audio); Scheduling (production processes); Computer multitasking; Execution time; General-purpose computing on graphics processing units; Central processing unit; Operating system; Graphics","score_opus":0.010811408492569756,"score_gpt":0.253525247236229,"score_spread":0.24271383874365923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987123212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003932836,0.0000205876,0.94793797,0.00042399645,0.00023417575,0.000100741796,1.175486e-7,0.0007630955,0.046586473],"genre_scores_gemma":[0.732212,0.00000855904,0.26053727,0.00039077495,0.00002588099,0.0000034931113,0.0000018128153,0.0000037175596,0.006816473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939543,0.00002971746,0.00011149302,0.00020989963,0.00012213358,0.00013130491],"domain_scores_gemma":[0.99949515,0.000019641044,0.000039715025,0.00035595635,0.000052192005,0.000037349408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010771987,0.00006418869,0.000072147996,0.000060323877,0.000043015818,0.00007363933,0.00044986344,0.000037893165,0.00008049983],"category_scores_gemma":[0.000007107935,0.000056583605,0.000035984314,0.00019261893,0.000007555054,0.00024948805,0.00014995325,0.00005505021,0.0005094016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066532953,0.00016638562,0.0064104055,0.000024801813,0.000024320216,0.0000061304504,0.0005888112,0.058238886,0.0034137948,0.7674227,0.11022253,0.053474586],"study_design_scores_gemma":[0.00015792392,0.00006379172,0.0010812434,0.000012163656,9.567265e-7,0.000006102723,0.0000049842433,0.97632796,0.0048256903,0.002603367,0.0147665255,0.00014928542],"about_ca_topic_score_codex":0.000007654645,"about_ca_topic_score_gemma":4.8612037e-7,"teacher_disagreement_score":0.9180891,"about_ca_system_score_codex":0.000020187457,"about_ca_system_score_gemma":0.000025722753,"threshold_uncertainty_score":0.6547497},"labels":[],"label_agreement":null},{"id":"W2989165654","doi":"10.1109/pact.2019.00014","title":"Deepframe: A Profile-Driven Compiler for Spatial Hardware Accelerators","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compiler; Computer science; Optimizing compiler; Parallel computing; Computer architecture; Computer hardware; Programming language; Embedded system","score_opus":0.017846466539300634,"score_gpt":0.26480504971846025,"score_spread":0.2469585831791596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989165654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003966195,0.000009894524,0.9841751,0.0003180708,0.00033315347,0.0006319365,0.0000034701116,0.0009605331,0.0096016545],"genre_scores_gemma":[0.45969826,0.0000019942186,0.53805155,0.000601526,0.000055443783,0.000047196263,0.00001107567,0.000010866265,0.0015221068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990056,0.000031480817,0.00019165945,0.0003674805,0.00015843807,0.0002453533],"domain_scores_gemma":[0.99917847,0.00007395304,0.00007603863,0.00044085376,0.00016326706,0.000067391775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118410535,0.00012808213,0.000166533,0.00008442283,0.00009016135,0.0001817619,0.00073530443,0.000075770695,0.00012465093],"category_scores_gemma":[0.000020396314,0.00011119287,0.000076685385,0.00018410162,0.000014658914,0.000255911,0.0002074757,0.00008468689,0.0001709815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012629856,0.0006411373,0.032905556,0.00028840938,0.00018892795,0.000010153164,0.0018504044,0.05586494,0.0029823266,0.4002921,0.24137498,0.26347476],"study_design_scores_gemma":[0.00049306615,0.00014531762,0.0008098985,0.000016578591,0.0000022320396,0.00000258399,0.0000060248285,0.9718859,0.0060318075,0.0007407587,0.019647498,0.00021829322],"about_ca_topic_score_codex":0.000020348316,"about_ca_topic_score_gemma":0.0000029693122,"teacher_disagreement_score":0.916021,"about_ca_system_score_codex":0.000025487914,"about_ca_system_score_gemma":0.00006186121,"threshold_uncertainty_score":0.45343137},"labels":[],"label_agreement":null},{"id":"W2989945918","doi":"10.1145/3365660","title":"Hyperqueues","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Concurrency; Thread (computing); Scalability; POSIX Threads; Programming language; Concurrent data structure; Linearizability; Parallel computing; Data structure; Queue; Distributed computing; Operating system; Correctness","score_opus":0.017958829395511893,"score_gpt":0.26077548639037174,"score_spread":0.24281665699485985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989945918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013209605,0.0000577552,0.9773346,0.0008851915,0.0005064488,0.00025158582,8.828128e-7,0.0016514317,0.006102496],"genre_scores_gemma":[0.60410076,0.000015940746,0.39456958,0.0005997013,0.00002624017,0.000004603998,0.0000014366344,0.000014088351,0.0006676288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824196,0.00010392597,0.00034159602,0.0005943545,0.00031248768,0.00040568874],"domain_scores_gemma":[0.99804384,0.0003078951,0.00011423753,0.0013350217,0.00009406565,0.0001049372],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030661267,0.00023629052,0.0002527343,0.00024555108,0.00030390118,0.00019328317,0.001626325,0.000102728445,0.0000803924],"category_scores_gemma":[0.000024256673,0.0002353865,0.00015103356,0.0005374205,0.000028396531,0.00034989588,0.000060989147,0.00034027634,0.00085818826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015568037,0.00019210327,0.00036998186,0.000021823786,0.000050005856,0.000008163743,0.00053164095,0.84029573,0.00021405464,0.010269181,0.00056182535,0.14746991],"study_design_scores_gemma":[0.00071322935,0.0002686772,0.0009305448,0.00008499359,0.0000081861635,0.000046324778,0.000035625995,0.9853842,0.0016364347,0.006075701,0.004263272,0.0005527937],"about_ca_topic_score_codex":0.000014968627,"about_ca_topic_score_gemma":9.93439e-7,"teacher_disagreement_score":0.5908912,"about_ca_system_score_codex":0.00005496172,"about_ca_system_score_gemma":0.000052072,"threshold_uncertainty_score":0.9999198},"labels":[],"label_agreement":null},{"id":"W2990393348","doi":"10.1002/spe.2777","title":"Base64 encoding and decoding at almost the speed of a memory copy","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; JSON; Encoding (memory); Executable; ENCODE; Porting; Decoding methods; XML; Parallel computing; Operating system; Programming language; Artificial intelligence; Software","score_opus":0.01497585577914075,"score_gpt":0.2824211651749347,"score_spread":0.267445309395794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990393348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52702415,0.0013548014,0.4664929,0.0011785951,0.00022698625,0.00027044158,9.917391e-7,0.00025420674,0.0031969424],"genre_scores_gemma":[0.84239364,0.00034560668,0.15631709,0.0007273645,0.000014714658,0.000005104642,4.4759958e-7,0.000005076129,0.0001909956],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991006,0.000086345935,0.00017278185,0.00029530676,0.00018421857,0.00016070451],"domain_scores_gemma":[0.9983941,0.0009369908,0.00017646351,0.00034895685,0.000089557354,0.000053949272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044248425,0.00009874138,0.00012676438,0.00004181104,0.0002296476,0.000113719165,0.000346304,0.000038590937,0.000014923076],"category_scores_gemma":[0.00060232816,0.000074771604,0.000020320034,0.00019594983,0.0000978365,0.0008468899,0.0004532215,0.00009768621,0.0000073146934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005836294,0.0004940043,0.19161265,0.00058606704,0.0001928364,0.00014661954,0.42551687,0.0044643693,0.037373174,0.043340806,0.007891519,0.28779745],"study_design_scores_gemma":[0.0036243694,0.0015936724,0.009087757,0.0010312706,0.00011782234,0.0025400564,0.035236094,0.60549027,0.25354457,0.0035324378,0.081277445,0.0029242213],"about_ca_topic_score_codex":0.000048741036,"about_ca_topic_score_gemma":0.0000011431681,"teacher_disagreement_score":0.60102594,"about_ca_system_score_codex":0.00001670209,"about_ca_system_score_gemma":0.000029921268,"threshold_uncertainty_score":0.30490977},"labels":[],"label_agreement":null},{"id":"W2991137062","doi":"10.1109/hpec.2019.8916325","title":"On Computing with Diagonally Structured Matrices","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Diagonal; Matrix (chemical analysis); Diagonal matrix; Band matrix; Computer science; Scheme (mathematics); Diagonally dominant matrix; Triangular matrix; Symmetric matrix; Square matrix; Sparse matrix; Block matrix; Algorithm; Mathematics; Algebra over a field; Pure mathematics; Invertible matrix; Geometry; Mathematical analysis; Physics; Eigenvalues and eigenvectors","score_opus":0.005901031948300948,"score_gpt":0.22583747247251762,"score_spread":0.21993644052421668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991137062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05960109,0.000015884376,0.91367006,0.00019092808,0.00009329156,0.00011839963,2.0041377e-7,0.0007740392,0.025536094],"genre_scores_gemma":[0.6730832,0.0000015478245,0.32595545,0.00051728083,0.000013442059,6.2479796e-7,8.90346e-7,0.0000046610935,0.0004229021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991908,0.00002852112,0.00011332137,0.0002857713,0.00021457067,0.00016699836],"domain_scores_gemma":[0.99936473,0.000112542475,0.00006995261,0.00035309678,0.00005667462,0.00004301202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010866019,0.0001044668,0.00011015972,0.00009330291,0.00006368352,0.0001443222,0.00055785605,0.00003253846,0.000034476554],"category_scores_gemma":[0.000006956636,0.00007234027,0.000023868744,0.00028207028,0.000010565177,0.00014696954,0.00011318623,0.000087191846,0.00008807325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024711044,0.0000652739,0.006001896,0.000023291554,0.000031837862,0.000012161012,0.00039197825,0.24750666,0.00015178071,0.71149445,0.004761558,0.029534426],"study_design_scores_gemma":[0.0004429644,0.000392845,0.005923959,0.000050995455,0.0000021657577,0.000019334086,0.00000876132,0.9836192,0.0023714437,0.006065887,0.00078482943,0.00031760175],"about_ca_topic_score_codex":0.000007652425,"about_ca_topic_score_gemma":0.0000012195268,"teacher_disagreement_score":0.73611253,"about_ca_system_score_codex":0.000014958783,"about_ca_system_score_gemma":0.00002950825,"threshold_uncertainty_score":0.29499504},"labels":[],"label_agreement":null},{"id":"W2998159825","doi":"","title":"Deep Learning Inference Frameworks for ARM CPU","year":2019,"lang":"en","type":"article","venue":"Journal of Computational Vision and Imaging Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Inference; Server; Usability; Enhanced Data Rates for GSM Evolution; Central processing unit; Adaptation (eye); Edge device; Deep learning; Artificial intelligence; Edge computing; Machine learning; Human–computer interaction; Cloud computing; Operating system","score_opus":0.008470528831988292,"score_gpt":0.2939385152586868,"score_spread":0.2854679864266985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998159825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058259466,0.0008507047,0.9916762,0.0005544583,0.0006130521,0.00013085474,2.3767426e-7,0.000066210516,0.00028231725],"genre_scores_gemma":[0.81668884,0.000024311024,0.18294398,0.00017630152,0.00008220169,0.0000014107862,0.000001422868,0.000006335804,0.00007519458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988728,0.000092874994,0.00045054755,0.00013975658,0.0003122369,0.00013175758],"domain_scores_gemma":[0.9981029,0.0006345455,0.0004809409,0.00009434934,0.00061046745,0.000076807046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069562456,0.00010469613,0.00022986568,0.00021330605,0.0001183082,0.00041424323,0.0003004544,0.00005546232,0.0000031304767],"category_scores_gemma":[0.00012905813,0.00008595621,0.00007230673,0.00015247821,0.000019682579,0.00051135593,0.00007232149,0.0002978952,0.0000048263264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011820597,0.00003445673,0.0027802517,0.00004275466,0.00001535503,0.0000021675526,0.0003922343,0.9467404,0.000036114347,0.021383496,0.000678377,0.02788258],"study_design_scores_gemma":[0.00039681597,0.00019197322,0.001665952,0.00023569554,0.0000034980096,0.00011623428,0.00006728048,0.98606783,0.0000095419055,0.00785939,0.003281696,0.00010409896],"about_ca_topic_score_codex":0.0000019382412,"about_ca_topic_score_gemma":2.5327436e-8,"teacher_disagreement_score":0.8108629,"about_ca_system_score_codex":0.00002640383,"about_ca_system_score_gemma":0.000057739737,"threshold_uncertainty_score":0.39945573},"labels":[],"label_agreement":null},{"id":"W2998780350","doi":"10.1145/3093334.2989235","title":"Efficiently implementing the copy semantics of MATLAB's arrays in JavaScript","year":2016,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; JavaScript; Programming language; Unobtrusive JavaScript; Compiler; MATLAB; Semantics (computer science); Source code; Program transformation; Leverage (statistics); Operating system; Rich Internet application; Artificial intelligence","score_opus":0.020773338509530243,"score_gpt":0.26858708977815793,"score_spread":0.24781375126862767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998780350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13408998,0.000079610116,0.85988665,0.0037021372,0.00018828643,0.00017970263,0.0000035650967,0.00019617063,0.0016739374],"genre_scores_gemma":[0.89705396,0.000016593947,0.10265212,0.0001642151,0.000023200168,0.000003974065,8.232927e-7,0.0000057480765,0.000079390484],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00009340438,0.00030662285,0.00022715905,0.00022236674,0.00027525966],"domain_scores_gemma":[0.9985019,0.0005090022,0.00020362157,0.0007017306,0.000055159424,0.00002861177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663001,0.00010253409,0.00014259823,0.00008744776,0.000088507586,0.00006984835,0.0015100684,0.00003594216,0.000018774945],"category_scores_gemma":[0.0002451578,0.000058898826,0.00003686259,0.00032347816,0.00005541425,0.00018560296,0.00056801445,0.00006319221,0.000019658737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009147561,0.0008687327,0.41389275,0.00035556982,0.00021364856,0.00008866692,0.022116046,0.047254257,0.038528316,0.16133906,0.08200437,0.23324713],"study_design_scores_gemma":[0.004162502,0.00078482414,0.059867207,0.0013307929,0.00007917082,0.00003954734,0.00075718825,0.49489883,0.35911205,0.029910682,0.047088996,0.0019682015],"about_ca_topic_score_codex":0.00006757709,"about_ca_topic_score_gemma":0.000032537515,"teacher_disagreement_score":0.76296395,"about_ca_system_score_codex":0.000016506992,"about_ca_system_score_gemma":0.000024472934,"threshold_uncertainty_score":0.2806108},"labels":[],"label_agreement":null},{"id":"W2998812396","doi":"10.1145/3332466.3374544","title":"&lt;u&gt;G&lt;/u&gt;PU &lt;u&gt;i&lt;/u&gt;nitiated &lt;u&gt;O&lt;/u&gt;penSHMEM","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Latency (audio); Kernel (algebra); Code (set theory); Parallel computing; Operating system; Telecommunications; Discrete mathematics; Mathematics","score_opus":0.025938306784823312,"score_gpt":0.25292210052736985,"score_spread":0.22698379374254654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998812396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018901099,0.003792753,0.8013149,0.011782436,0.0030572037,0.00330463,0.00017448489,0.015549648,0.14212286],"genre_scores_gemma":[0.7301343,0.0018999913,0.23404385,0.012655064,0.0021332114,0.00040710164,0.0005731921,0.00063936476,0.017513938],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9807713,0.0015270028,0.004060182,0.0054742894,0.003886397,0.004280844],"domain_scores_gemma":[0.9872241,0.0012254997,0.001878862,0.0049775797,0.0021156282,0.002578311],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0028647804,0.0030734546,0.0031738186,0.0015988713,0.002043563,0.0027300713,0.008909635,0.001739428,0.001908465],"category_scores_gemma":[0.0012731783,0.003067946,0.0014808192,0.0062720603,0.00084658945,0.0028588227,0.0043525216,0.0018018546,0.0037067274],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047530205,0.001837382,0.0003903316,0.0005328455,0.0009448461,0.0012112255,0.0040665325,0.022001484,0.1136213,0.19429423,0.637665,0.022959543],"study_design_scores_gemma":[0.004004951,0.0014721293,0.0014727758,0.00049198925,0.00025399018,0.0003312897,0.000038556933,0.46580982,0.020796247,0.0034149361,0.4971087,0.004804636],"about_ca_topic_score_codex":0.000052519066,"about_ca_topic_score_gemma":0.00022888511,"teacher_disagreement_score":0.7112332,"about_ca_system_score_codex":0.00075013144,"about_ca_system_score_gemma":0.0012821258,"threshold_uncertainty_score":0.99955654},"labels":[],"label_agreement":null},{"id":"W2999617569","doi":"10.1145/3247696","title":"Session details: Memory aspects in system design","year":2001,"lang":"en","type":"article","venue":"International Symposium on Systems Synthesis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; Computer architecture; World Wide Web","score_opus":0.02355692852068894,"score_gpt":0.25628325077924585,"score_spread":0.2327263222585569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999617569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039692367,0.000100127436,0.92645055,0.0010716474,0.0016296221,0.00038907328,0.0000022968125,0.0009058237,0.065481625],"genre_scores_gemma":[0.98647803,0.000039900046,0.0123639675,0.000086898675,0.00018350566,0.00016747118,0.0000014840864,0.000020297763,0.0006584442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997541,0.00044746939,0.00054302707,0.0005490565,0.00063423975,0.00028518224],"domain_scores_gemma":[0.99835074,0.0006343969,0.00024409303,0.0005183934,0.00016119101,0.00009118882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009810381,0.00022345869,0.00028746302,0.00038808645,0.00010805214,0.00032802322,0.0013083651,0.00012589153,0.000009610665],"category_scores_gemma":[0.00011724463,0.00020326165,0.00008262348,0.0003900091,0.000019998506,0.00039898133,0.00014539559,0.00013705833,0.00017499518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021075505,0.00074421905,0.00437627,0.00016778453,0.00021757637,0.0010558247,0.0014996782,0.7868663,0.00790807,0.1704481,0.0039727967,0.022532599],"study_design_scores_gemma":[0.00032704556,0.00007568121,0.00054529146,0.0012534382,0.000006686435,0.00028706287,0.000121497,0.98044944,0.013641163,0.0001549293,0.0027237239,0.00041402152],"about_ca_topic_score_codex":0.0002097012,"about_ca_topic_score_gemma":0.000004095177,"teacher_disagreement_score":0.9825088,"about_ca_system_score_codex":0.0006532147,"about_ca_system_score_gemma":0.00007872176,"threshold_uncertainty_score":0.8288769},"labels":[],"label_agreement":null},{"id":"W3000259868","doi":"10.14778/3372716.3372728","title":"Evaluating persistent memory range indexes","year":2019,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Benchmarking; Index (typography); Dram; Range (aeronautics); Tree (set theory); Key (lock); Data structure; Focus (optics); Persistent data structure; Database; Operating system; Computer hardware; Programming language","score_opus":0.03028429458173998,"score_gpt":0.2794155407627558,"score_spread":0.24913124618101584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000259868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432056,0.0004350843,0.009034029,0.002227383,0.0006686972,0.0012210986,0.0000011297042,0.0005109197,0.042696062],"genre_scores_gemma":[0.9390992,0.000013335327,0.059463408,0.00022202427,0.00002788967,0.00002240793,1.485438e-7,0.000007409551,0.0011442042],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881095,0.000012138024,0.00023628458,0.0002743096,0.00047082608,0.00019550086],"domain_scores_gemma":[0.99926144,0.000034578807,0.00024236625,0.00021906642,0.00020489203,0.000037680613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062808767,0.00011565216,0.0001554544,0.00007573659,0.000095629635,0.00007921404,0.0011515063,0.000037616588,0.000014419749],"category_scores_gemma":[0.000062548104,0.00008094182,0.00014781568,0.0002757289,0.000029063209,0.000220792,0.0005968669,0.00010771523,0.000015710935],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018444717,0.0013497014,0.13213705,0.0016162097,0.0007245926,0.0000016234399,0.031649023,0.053953152,0.3542597,0.24044444,0.028669862,0.15501021],"study_design_scores_gemma":[0.0023475988,0.00097631256,0.006835184,0.00065647933,0.00007178848,0.000043051085,0.00059881766,0.5122238,0.46441534,0.0094032595,0.0016300791,0.00079832715],"about_ca_topic_score_codex":0.000014628991,"about_ca_topic_score_gemma":1.2359116e-7,"teacher_disagreement_score":0.4582706,"about_ca_system_score_codex":0.00006310275,"about_ca_system_score_gemma":0.000029760473,"threshold_uncertainty_score":0.33007118},"labels":[],"label_agreement":null},{"id":"W3000335563","doi":"10.1145/3332466.3374542","title":"Non-blocking interpolation search trees with doubly-logarithmic running time","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"FP7 Ideas: European Research Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Interpolation (computer graphics); Logarithm; Computer science; Key (lock); Algorithm; Running time; Mathematics; Artificial intelligence; Computer network","score_opus":0.01982339414437483,"score_gpt":0.25242058855314525,"score_spread":0.2325971944087704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000335563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068527744,0.000009680588,0.9774183,0.002127814,0.000019738864,0.00012326062,1.5741993e-7,0.00094823824,0.0125000235],"genre_scores_gemma":[0.64422005,0.0000012487878,0.35493553,0.0005396246,0.00003982191,0.000002815967,0.0000020163714,0.0000067465908,0.00025215466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908656,0.000023111661,0.00015195164,0.00032671215,0.00021529607,0.00019635641],"domain_scores_gemma":[0.99952996,0.00003177342,0.000048954786,0.00021140528,0.00008466461,0.00009325711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015826955,0.000110492234,0.00012424112,0.00009167525,0.00012765208,0.00023112279,0.0005553827,0.00003955845,0.00003417953],"category_scores_gemma":[0.000008264979,0.00008911212,0.00002865948,0.0004679813,0.000025024947,0.0003486649,0.00023865749,0.00013756477,0.00007713649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028245538,0.00032389828,0.043705426,0.00013513489,0.00026089957,0.00016849028,0.033600796,0.68785745,0.029133875,0.040521596,0.037557974,0.12645203],"study_design_scores_gemma":[0.00020750325,0.00015179027,0.00054385886,0.000026363454,0.0000018418716,0.000006485052,0.000015552594,0.99465775,0.003941982,0.000058582606,0.00025380062,0.00013449255],"about_ca_topic_score_codex":0.000029927825,"about_ca_topic_score_gemma":0.0000017905421,"teacher_disagreement_score":0.63736725,"about_ca_system_score_codex":0.000018096549,"about_ca_system_score_gemma":0.000049668128,"threshold_uncertainty_score":0.3633887},"labels":[],"label_agreement":null},{"id":"W3002536493","doi":"10.1109/tse.2020.2968061","title":"<i>MoMIT</i>: Porting a JavaScript Interpreter on a Quarter Coin","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Porting; JavaScript; Interpreter; Programming language; Unobtrusive JavaScript; Quarter (Canadian coin); Operating system; Software engineering; World Wide Web; Rich Internet application; Software","score_opus":0.01290825836886121,"score_gpt":0.2126756645624824,"score_spread":0.1997674061936212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002536493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001337362,0.0000185528,0.9947602,0.00040352592,0.00047594696,0.00013786367,0.0000041493936,0.0027499404,0.00011243526],"genre_scores_gemma":[0.7537269,0.000004239011,0.24470554,0.0014238879,0.000048126985,0.000027391045,7.0928655e-7,0.000024830544,0.00003839627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876046,0.000028010743,0.0003006357,0.00041507726,0.00021848048,0.00027734716],"domain_scores_gemma":[0.99927974,0.00011934989,0.000060638005,0.00034054994,0.000043973138,0.00015572534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010560058,0.00021964559,0.00019745411,0.00015585037,0.00010294802,0.00012529524,0.00044580028,0.00007884029,0.000019456755],"category_scores_gemma":[0.000036312354,0.00022890503,0.00013976161,0.00038171932,0.000010568777,0.00025972386,0.0000049329,0.00037627123,0.00006721953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024208082,0.00007690252,0.000020957967,0.00004629665,0.000053137905,0.000032333704,0.0020288527,0.97864914,0.00093367853,0.00026142749,0.002103805,0.01576924],"study_design_scores_gemma":[0.00026396764,0.00027825346,0.000024373461,0.00011982835,0.000007952535,0.000014420993,0.000010658578,0.9795861,0.01792779,0.000011999209,0.0014310795,0.0003235804],"about_ca_topic_score_codex":0.000004000226,"about_ca_topic_score_gemma":3.221253e-7,"teacher_disagreement_score":0.7523895,"about_ca_system_score_codex":0.000046197718,"about_ca_system_score_gemma":0.000023206701,"threshold_uncertainty_score":0.93344766},"labels":[],"label_agreement":null},{"id":"W3003171358","doi":"10.1145/871656.859643","title":"Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor","year":2003,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Multiprocessing; Computer science; Profiling (computer programming); Parallel computing; Interconnection; Alpha (finance); Embedded system; Clock rate; Key (lock); Computer architecture; Operating system; Chip","score_opus":0.012973778827077936,"score_gpt":0.2451543054494663,"score_spread":0.23218052662238836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003171358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06218295,0.000073333045,0.9351074,0.0009677928,0.00024702103,0.0003031204,0.0000033272916,0.00034684446,0.00076819427],"genre_scores_gemma":[0.5734261,0.000006926916,0.42532632,0.0011284407,0.000037049584,0.000014264793,0.0000035780843,0.000011966839,0.000045335953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972769,0.00042271992,0.0005219062,0.0006722662,0.00063187757,0.00047433027],"domain_scores_gemma":[0.9965127,0.00056520506,0.00030186868,0.0022562528,0.00023533881,0.00012863765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054358516,0.00031683335,0.0004910148,0.00057416066,0.00028179173,0.00011618658,0.0035275456,0.00011055761,0.0000126660825],"category_scores_gemma":[0.00023186923,0.00022237463,0.00038267087,0.0030923248,0.00015481978,0.00014423337,0.00067702064,0.0004162409,0.0000048104507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012116827,0.00014354782,0.017422047,0.00005130741,0.0002727115,0.0000036121144,0.0011433534,0.8825654,0.0003160054,0.001125671,0.0008128419,0.09613143],"study_design_scores_gemma":[0.00046939775,0.00014770974,0.013846597,0.000053117175,0.0000966662,0.0000108978375,0.0000025000568,0.96811455,0.011445096,0.00085916225,0.0046434863,0.00031084442],"about_ca_topic_score_codex":0.000030399602,"about_ca_topic_score_gemma":0.000025716387,"teacher_disagreement_score":0.51124316,"about_ca_system_score_codex":0.00003960926,"about_ca_system_score_gemma":0.00020865448,"threshold_uncertainty_score":0.9068174},"labels":[],"label_agreement":null},{"id":"W3003529770","doi":"10.14288/1.0384819","title":"Software-hardware co-design for energy efficient datacenter computing","year":2019,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Software; Embedded system; Computer hardware; Operating system","score_opus":0.012289826151601818,"score_gpt":0.19982284954204943,"score_spread":0.1875330233904476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003529770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05908168,0.0000573408,0.93957657,0.000038847407,0.00016860069,0.00027260827,0.000045731296,0.00040211558,0.00035650082],"genre_scores_gemma":[0.72714007,0.000015049645,0.27207184,0.00009681153,0.000016797945,3.9812477e-7,0.000029527506,0.00001046119,0.0006190749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987743,0.00007516986,0.00013928833,0.0005129794,0.00022061486,0.00027767985],"domain_scores_gemma":[0.9989109,0.00014722627,0.00016477791,0.00047483476,0.0002174735,0.000084788546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003033047,0.000053985663,0.00024029853,0.000061736864,0.0002360489,0.0001972293,0.0010220931,0.000079762154,0.000018812189],"category_scores_gemma":[0.00002336459,0.00017904045,0.000114097245,0.00023980689,0.00006438141,0.0002442916,0.00033098145,0.00007113912,0.000015589741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023129203,0.00033414838,0.004189224,0.00016280636,0.000082327555,0.00004773883,0.00045495297,0.08481287,0.00014233173,0.00017918948,0.06478828,0.844783],"study_design_scores_gemma":[0.0014646879,0.00022322299,0.08264797,0.00023146885,0.000013433558,0.000037030048,0.0001028395,0.9101838,0.000028580827,0.00036626012,0.0042912364,0.00040948996],"about_ca_topic_score_codex":0.003587369,"about_ca_topic_score_gemma":0.0006548949,"teacher_disagreement_score":0.8443735,"about_ca_system_score_codex":0.00005428912,"about_ca_system_score_gemma":0.00007699628,"threshold_uncertainty_score":0.73010576},"labels":[],"label_agreement":null},{"id":"W3003730485","doi":"10.1145/2168696.2047858","title":"Bootstrapping a self-hosted research virtual machine for JavaScript","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Programming language; Rich Internet application; Virtual machine; Bytecode; Bootstrapping (finance); Operating system; Interpreter; Web application","score_opus":0.14326264038785352,"score_gpt":0.34024353194325196,"score_spread":0.19698089155539844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003730485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011552545,0.00027563653,0.9752388,0.000492487,0.00036542155,0.0005264245,0.000007930132,0.0018209934,0.009719781],"genre_scores_gemma":[0.6548859,0.00001717992,0.34450686,0.00019569648,0.00007159232,0.00003649255,0.000007510823,0.000013315232,0.0002654854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833316,0.0001600534,0.00026343833,0.00045601666,0.00032504371,0.00046232084],"domain_scores_gemma":[0.9981077,0.0005732524,0.000100959136,0.00086118566,0.00024568354,0.0001112438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011363433,0.0001476471,0.00017258253,0.00026799875,0.0003399374,0.00018230916,0.0021084005,0.000092826456,0.000015589629],"category_scores_gemma":[0.00040716233,0.0001360351,0.00006101503,0.00044895028,0.000053686388,0.00040715132,0.00051254994,0.00021415825,0.000038300983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005718782,0.0026827022,0.013989699,0.00065466354,0.0008444692,0.00022685505,0.07807303,0.0053693485,0.00442645,0.5208956,0.1497161,0.22254917],"study_design_scores_gemma":[0.0010646303,0.0014822218,0.0023479275,0.000116909476,0.000024958186,0.00002066214,0.00019335884,0.93890315,0.01433447,0.017784683,0.023014132,0.0007129041],"about_ca_topic_score_codex":0.0001361491,"about_ca_topic_score_gemma":0.000015779277,"teacher_disagreement_score":0.9335338,"about_ca_system_score_codex":0.000028816576,"about_ca_system_score_gemma":0.000071952854,"threshold_uncertainty_score":0.55473506},"labels":[],"label_agreement":null},{"id":"W3004399614","doi":"10.1109/icfpt47387.2019.00046","title":"ASAP: Automatic Sizing and Partitioning for Dynamic Memory Heaps in High-Level Synthesis","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heap (data structure); Computer science; Parallel computing; C dynamic memory allocation; Dynamic random-access memory; Sizing; Suite; Embedded system; Memory management; Computer hardware; Overlay; Operating system; Algorithm; Semiconductor memory","score_opus":0.01564638500214893,"score_gpt":0.2515090246905054,"score_spread":0.23586263968835647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004399614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116490595,0.000060275288,0.8815067,0.0005208226,0.000079658705,0.00023018611,9.996787e-7,0.00042450137,0.00068628066],"genre_scores_gemma":[0.59073794,0.0000067226792,0.40888092,0.00012208,0.000004057851,0.000027435275,8.7957716e-7,0.000004663903,0.00021529497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992232,0.00004200611,0.00019755212,0.00026271545,0.0000891035,0.00018544467],"domain_scores_gemma":[0.99928236,0.0003648464,0.000057490048,0.0002300738,0.00003049387,0.00003475715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036634904,0.00008824521,0.00015500754,0.00012978957,0.000068074936,0.000111533715,0.000234237,0.000044130997,0.00001323086],"category_scores_gemma":[0.00007695232,0.00008378145,0.000024953935,0.00016458968,0.00001314888,0.0002665601,0.00010319195,0.000050521656,0.000012187545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023065944,0.0003494317,0.015485566,0.00082675985,0.00008757152,0.000013693725,0.0028995015,0.10899302,0.0029372855,0.15793021,0.0019624936,0.7084914],"study_design_scores_gemma":[0.00017632192,0.000029327028,0.006504511,0.00008804488,0.0000019764161,0.000003747808,0.000020169648,0.9877098,0.0014131422,0.0038934327,0.000032995435,0.0001265107],"about_ca_topic_score_codex":0.000033653534,"about_ca_topic_score_gemma":0.000016183565,"teacher_disagreement_score":0.8787168,"about_ca_system_score_codex":0.000036019344,"about_ca_system_score_gemma":0.000027206026,"threshold_uncertainty_score":0.34165084},"labels":[],"label_agreement":null},{"id":"W3006309927","doi":"10.1145/3140587.3062355","title":"Synthesis of divide and conquer parallelism for loops","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Computer science; Divide and conquer algorithms; Joins; Parallel computing; Programmer; Traverse; Code (set theory); Parallelism (grammar); Programming language; Theoretical computer science; Set (abstract data type)","score_opus":0.033256249219077605,"score_gpt":0.29474834922124826,"score_spread":0.26149210000217066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006309927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204522,0.00031489998,0.9455483,0.0035074356,0.00022722487,0.00029939375,0.000012847932,0.00025521353,0.0036301403],"genre_scores_gemma":[0.78806454,0.00003660789,0.21165821,0.00009013415,0.000034567438,0.000014325787,0.0000010597992,0.0000046594037,0.00009587894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993402,0.000026559326,0.0001624036,0.0002259722,0.000100283774,0.00014458717],"domain_scores_gemma":[0.9980036,0.0007354851,0.00025108075,0.00088684115,0.00007648964,0.00004651141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027569846,0.00009080988,0.00017565791,0.00004705188,0.0002602573,0.00021224472,0.0013809428,0.000051692816,0.0000025927893],"category_scores_gemma":[0.0011222068,0.00007910764,0.00003353158,0.00002351116,0.0000919616,0.00033255425,0.00040796836,0.000039089155,0.0000022764596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015929657,0.00037010477,0.074451596,0.00087755325,0.00038838235,0.000034249664,0.0038989116,0.005683405,0.0022042287,0.34240678,0.036779236,0.53274626],"study_design_scores_gemma":[0.0022817927,0.0006721967,0.12503718,0.00067527784,0.00017884703,0.000029449227,0.0000749843,0.57789624,0.14139254,0.119506806,0.030514695,0.0017400006],"about_ca_topic_score_codex":0.000063884894,"about_ca_topic_score_gemma":0.000008731606,"teacher_disagreement_score":0.74186003,"about_ca_system_score_codex":0.0000037130178,"about_ca_system_score_gemma":0.00001819598,"threshold_uncertainty_score":0.3225916},"labels":[],"label_agreement":null},{"id":"W3007003693","doi":"10.1145/3373087.3375307","title":"StateMover","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Debugging; Computer science; Field-programmable gate array; Embedded system; Porting; Overhead (engineering); Background debug mode interface; Visibility; State (computer science); Controllability; Software; Computer hardware; Operating system","score_opus":0.024875129548790748,"score_gpt":0.2497477086299184,"score_spread":0.22487257908112765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007003693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012030254,0.000009866198,0.95174915,0.005146375,0.000021091353,0.000021221495,6.9614906e-8,0.00093139,0.042000562],"genre_scores_gemma":[0.3095149,0.00000436793,0.68225974,0.007807267,0.000020659476,8.002925e-7,2.8189336e-7,0.0000019230476,0.00039004505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997043,0.000010178938,0.00005425144,0.000108952154,0.000060503808,0.00006183605],"domain_scores_gemma":[0.99980897,0.000009300711,0.0000125953175,0.0001007505,0.000017748858,0.000050621853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002994673,0.00002979062,0.00003428211,0.000009918418,0.000021898226,0.00004881424,0.00029680014,0.000009890511,0.00002649437],"category_scores_gemma":[0.000011280496,0.000025078141,0.000013083098,0.00013729985,0.0000041704297,0.00012682755,0.0000982101,0.000026030295,0.00010608588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027403676,0.000024574403,0.0004469931,0.000007636393,0.000008461484,0.0000130256685,0.0011343735,0.0084663825,0.00035442485,0.6334388,0.30524802,0.050854567],"study_design_scores_gemma":[0.00006282754,0.000030131388,0.00010017392,8.5951183e-7,2.4801818e-7,9.393742e-7,0.0000022349666,0.9526706,0.0036005562,0.0018097133,0.041653913,0.00006784266],"about_ca_topic_score_codex":0.0000018485149,"about_ca_topic_score_gemma":4.5419625e-8,"teacher_disagreement_score":0.94420415,"about_ca_system_score_codex":0.0000025848676,"about_ca_system_score_gemma":0.000010122092,"threshold_uncertainty_score":0.13635547},"labels":[],"label_agreement":null},{"id":"W3007153607","doi":"10.1145/3156685.3092256","title":"Analyzing memory management methods on integrated CPU-GPU systems","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; CUDA; Central processing unit; Shared memory; Memory management; Multi-core processor; Parallel computing; Software; CPU shielding; Embedded system; Computer architecture; Operating system; Overlay","score_opus":0.04683664990969114,"score_gpt":0.3514376544596579,"score_spread":0.30460100454996675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007153607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020843882,0.00018794047,0.96374506,0.00059893297,0.0008360737,0.00020697924,0.0000017843342,0.00068592245,0.031652912],"genre_scores_gemma":[0.44547632,0.00003174511,0.55321676,0.00012727949,0.00006760502,0.000014160052,0.000004409103,0.00001036188,0.0010513315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985477,0.00023622862,0.00026408746,0.0004648943,0.00021443737,0.0002726622],"domain_scores_gemma":[0.9970402,0.0002889672,0.0003430284,0.0021634114,0.000079868754,0.00008448945],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010045064,0.00018700113,0.00023563282,0.00020041791,0.0005723175,0.0010987673,0.0034345328,0.00007178786,0.0000059337704],"category_scores_gemma":[0.00023878687,0.00015646116,0.000058017777,0.00015182699,0.000049874918,0.0004167127,0.0007397866,0.00016403674,0.000055106757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050379225,0.00024330096,0.0027778614,0.00028871183,0.00043650242,0.00026231635,0.0012841135,0.10224782,0.00035646302,0.099247016,0.019848904,0.7729566],"study_design_scores_gemma":[0.00049944676,0.00018576607,0.0052284836,0.0004024878,0.000050288432,0.00000991924,0.00012506498,0.97287804,0.003775283,0.0021148683,0.014076032,0.0006543162],"about_ca_topic_score_codex":0.00016288499,"about_ca_topic_score_gemma":0.0000054382376,"teacher_disagreement_score":0.8706302,"about_ca_system_score_codex":0.000040653173,"about_ca_system_score_gemma":0.000018306837,"threshold_uncertainty_score":0.9999382},"labels":[],"label_agreement":null},{"id":"W3007439791","doi":"10.1145/3155284.3018762","title":"Contention in Structured Concurrency","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Concurrency; Data structure; Concurrent data structure; Theoretical computer science; Isolation (microbiology); Key (lock); Parallel computing; Directed acyclic graph; Distributed computing; Programming language; Algorithm","score_opus":0.039003094431741485,"score_gpt":0.3089167678228088,"score_spread":0.2699136733910673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007439791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34166563,0.00040992541,0.63413197,0.0032065408,0.0018075014,0.00041032518,0.0000071384343,0.0009034231,0.017457532],"genre_scores_gemma":[0.9391079,0.000012479462,0.06064637,0.00008913038,0.000036581445,0.0000037371863,0.000003485212,0.0000032925198,0.00009701753],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99927765,0.000041189465,0.00016177149,0.00023661446,0.0001232389,0.00015954302],"domain_scores_gemma":[0.9986739,0.00007704518,0.00019516115,0.00096931926,0.000046971458,0.00003758658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019027111,0.0000860715,0.00011749893,0.000076523465,0.00020851793,0.00038736095,0.0019939318,0.000051704243,0.000008581252],"category_scores_gemma":[0.00041418482,0.00007889163,0.00002604664,0.000055230914,0.000042319483,0.00056945335,0.00035689937,0.00009634222,0.000016178814],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047469242,0.00024421953,0.34190893,0.00011711447,0.000061885825,0.00017243571,0.003984462,0.0056286305,0.0025222853,0.22784297,0.009865284,0.40760434],"study_design_scores_gemma":[0.0016938369,0.00017801787,0.60338694,0.00019392626,0.0000105631725,0.000013610073,0.00004506274,0.33888802,0.0071001006,0.043828025,0.0039477395,0.0007141628],"about_ca_topic_score_codex":0.00012537614,"about_ca_topic_score_gemma":0.00007473629,"teacher_disagreement_score":0.59744227,"about_ca_system_score_codex":0.000012954409,"about_ca_system_score_gemma":0.00002162796,"threshold_uncertainty_score":0.37353307},"labels":[],"label_agreement":null},{"id":"W3012547936","doi":"10.1109/iiswc47752.2019.9042134","title":"Optimizing Hyperplane Sweep Operations Using Asynchronous Multi-grain GPU Tasks","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Speedup; Parallel computing; Hyperplane; Asynchronous communication; Kernel (algebra); Graphics; Computational science; Scheduling (production processes); General-purpose computing on graphics processing units; Computer graphics (images); Mathematical optimization; Mathematics","score_opus":0.025904709344822745,"score_gpt":0.2804295382885471,"score_spread":0.25452482894372436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012547936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016443074,0.00008512928,0.97716343,0.0001888835,0.00027933327,0.00024213502,0.0000012692117,0.00089461834,0.0047021415],"genre_scores_gemma":[0.3485964,0.00000729693,0.65005493,0.0003388214,0.000025522386,0.000003858703,0.0000051086404,0.000009544205,0.0009585061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988494,0.000071527196,0.00025490348,0.00035470547,0.00017334036,0.00029615714],"domain_scores_gemma":[0.99914867,0.00004361455,0.00005014052,0.00057380844,0.000097909426,0.00008585034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024857718,0.00016136371,0.00018388814,0.0002063777,0.00021114315,0.0002878509,0.00067027006,0.00008149116,0.000076236094],"category_scores_gemma":[0.000021410617,0.0001501454,0.000058887294,0.00041387154,0.000022152082,0.00046508943,0.0002616045,0.00013741343,0.00015746626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016147944,0.000084391344,0.00036356293,0.000008338808,0.000016767028,0.0000053914946,0.0007941466,0.97361016,0.0039288364,0.015621199,0.00030929814,0.005256262],"study_design_scores_gemma":[0.0002794543,0.00004458762,0.00008221511,0.000019226876,0.0000030479782,0.000031932523,0.000036893547,0.9962199,0.002393166,0.000042540265,0.0006196939,0.00022736749],"about_ca_topic_score_codex":0.0002026176,"about_ca_topic_score_gemma":0.000012725016,"teacher_disagreement_score":0.33215332,"about_ca_system_score_codex":0.000059703954,"about_ca_system_score_gemma":0.00009015969,"threshold_uncertainty_score":0.6122752},"labels":[],"label_agreement":null},{"id":"W3013744194","doi":"10.1145/384285.379250","title":"Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processors","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Multithreading; Instruction prefetch; Thread (computing); Speedup; Speculative multithreading; Parallel computing; Simultaneous multithreading; Software; Instruction set; Speculative execution; Latency (audio); Operating system; Cache","score_opus":0.013729695413583843,"score_gpt":0.27089923931859,"score_spread":0.2571695439050062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013744194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053994454,0.00025624802,0.9410335,0.0011567138,0.0003444935,0.0010925557,0.0000010083539,0.0014823434,0.00063871685],"genre_scores_gemma":[0.39304218,0.000048222024,0.60548705,0.00091637735,0.00025779713,0.00007195518,0.0000083247105,0.000029361949,0.00013874145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616677,0.0004037034,0.0008747137,0.001103125,0.0005812391,0.00087043346],"domain_scores_gemma":[0.9960865,0.0019991326,0.00030828317,0.0012485248,0.0001985935,0.00015898624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005720462,0.00050622696,0.000716254,0.0004282659,0.00034074578,0.0003656761,0.002340646,0.00020337354,0.000009177903],"category_scores_gemma":[0.0010983611,0.00044777404,0.00019174491,0.0010861241,0.00008078883,0.0005482804,0.0010053812,0.0007523892,0.000016196407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010474804,0.00013915688,0.0014552836,0.000032289314,0.000027957063,0.00014267034,0.0067074713,0.75262433,0.00014915672,0.00022356505,0.00017018068,0.2382232],"study_design_scores_gemma":[0.0030040825,0.00029979672,0.00049853016,0.0002186625,0.000009587455,0.00013561669,0.00001375467,0.98083174,0.0005231482,0.01300427,0.0008961536,0.0005646361],"about_ca_topic_score_codex":0.00031854794,"about_ca_topic_score_gemma":0.00017848387,"teacher_disagreement_score":0.33904773,"about_ca_system_score_codex":0.00012899199,"about_ca_system_score_gemma":0.00014509309,"threshold_uncertainty_score":0.9997974},"labels":[],"label_agreement":null},{"id":"W3014424508","doi":"10.1145/3251519","title":"Session details: Safe programming languages for the multicore era (I)","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Session (web analytics); Programming language; Multi-core processor; Parallel computing; World Wide Web","score_opus":0.01826587241627746,"score_gpt":0.29410801693974514,"score_spread":0.27584214452346767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014424508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003128722,0.00008185347,0.9952944,0.0013742788,0.00008565713,0.00025466896,1.5715675e-7,0.00064454065,0.001951587],"genre_scores_gemma":[0.2988925,0.000005647572,0.6998765,0.00045552856,0.00005648567,0.000037171056,0.0000011821908,0.0000048210777,0.00067017024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993823,0.000040436564,0.0001176992,0.0001879789,0.00010388934,0.00016766627],"domain_scores_gemma":[0.9991413,0.00035848108,0.00005106929,0.00034757215,0.000068477755,0.000033145818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039620223,0.00007698315,0.00007529693,0.000032698008,0.00023067107,0.00017378062,0.00056282507,0.000034804456,0.000004697057],"category_scores_gemma":[0.00012521508,0.000044437344,0.00004728134,0.000118961536,0.00001990841,0.00012389863,0.00012684565,0.00006246212,0.000008069135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024280998,0.000025235819,0.00022788224,0.000010880961,0.0000064399005,2.8631618e-7,0.0003026697,0.0025091602,0.000103467275,0.039908636,0.0035949668,0.9533079],"study_design_scores_gemma":[0.00014848307,0.000047190315,0.000318466,0.000014099044,0.0000031294508,0.000002408795,0.00003381944,0.9580885,0.0023319013,0.0006586829,0.038261477,0.000091831906],"about_ca_topic_score_codex":0.000016735277,"about_ca_topic_score_gemma":0.000005278149,"teacher_disagreement_score":0.95557934,"about_ca_system_score_codex":0.000008272622,"about_ca_system_score_gemma":0.000013880459,"threshold_uncertainty_score":0.18121022},"labels":[],"label_agreement":null},{"id":"W3015018880","doi":"10.1109/iceic49074.2020.9051258","title":"High-performance RISC-V processor with improved dispatch and commit schemes","year":2020,"lang":"en","type":"article","venue":"2020 International Conference on Electronics, Information, and Communication (ICEIC)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Reduced instruction set computing; Commit; Microarchitecture; Instructions per cycle; Out-of-order execution; Superscalar; Instruction set; Parallel computing; Branch predictor; Processor design; Throughput; Scheme (mathematics); Multi-core processor; Speculative execution; Architecture; Embedded system; Computer architecture; Operating system; Central processing unit","score_opus":0.011952701805573427,"score_gpt":0.22751395353984905,"score_spread":0.21556125173427562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015018880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076991424,0.0006643498,0.8534459,0.05430099,0.000096803924,0.00071984314,0.000023747678,0.0008892411,0.012867687],"genre_scores_gemma":[0.9568179,0.0040455596,0.036487125,0.0023560636,0.000026312617,0.00005369339,0.00012041517,0.000007772142,0.00008514685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988066,0.000056329005,0.0004070208,0.0002352672,0.00028885392,0.00020596026],"domain_scores_gemma":[0.99853796,0.000056776265,0.00033482912,0.00040920463,0.00054931565,0.00011192478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022030834,0.0001974778,0.00018127337,0.00008821034,0.00030901388,0.00054291234,0.0011124039,0.0000710984,0.0000233527],"category_scores_gemma":[0.000058383615,0.0001761519,0.000019155688,0.0002453733,0.00009730317,0.00187397,0.00028472117,0.00034560784,0.000021235845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028011514,0.000119201395,0.0033824076,0.00013275248,0.00014141221,5.34453e-7,0.0046161665,0.00215609,0.00022204571,0.9032879,0.0028509162,0.08281045],"study_design_scores_gemma":[0.0008381729,0.00045016553,0.0016377342,0.00007353366,0.000009132338,0.00001099094,0.0001368427,0.97235155,0.0020409094,0.0021851675,0.019942923,0.00032288782],"about_ca_topic_score_codex":0.000033490032,"about_ca_topic_score_gemma":0.000016417587,"teacher_disagreement_score":0.9701955,"about_ca_system_score_codex":0.000053452753,"about_ca_system_score_gemma":0.00017792678,"threshold_uncertainty_score":0.71832657},"labels":[],"label_agreement":null},{"id":"W3015598440","doi":"10.1145/3140587.3062371","title":"Low overhead dynamic binary translation on ARM","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Royal Society of Canada","keywords":"Computer science; Binary translation; Spec#; ARM architecture; Instruction set; Overhead (engineering); Parallel computing; Benchmark (surveying); Embedded system; Out-of-order execution; Operating system; Software; Programming language","score_opus":0.03242167568277721,"score_gpt":0.30312088790763136,"score_spread":0.27069921222485416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015598440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18709005,0.00024836988,0.77119005,0.007971307,0.0012196812,0.00041722154,0.000011138992,0.0016915388,0.03016062],"genre_scores_gemma":[0.90528977,0.000030133404,0.09420518,0.0002540168,0.000043174485,0.000004428527,0.000007614163,0.000008009863,0.00015765484],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907154,0.00004354268,0.00015478233,0.00032567643,0.0002086727,0.00019577116],"domain_scores_gemma":[0.99815357,0.00019223144,0.0001855285,0.001377059,0.000035218167,0.000056388573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019838173,0.00012936775,0.00012639925,0.00009233695,0.00046196522,0.0004139573,0.001960025,0.00007063764,0.000010313571],"category_scores_gemma":[0.0001329383,0.00011915109,0.000046722,0.0000639749,0.000045261302,0.0005600217,0.00018051527,0.00012061131,0.00007712144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016325212,0.0011265525,0.004628162,0.00019073133,0.00011065964,0.00018685595,0.0036421565,0.10799527,0.0034074509,0.03373412,0.009270607,0.83554417],"study_design_scores_gemma":[0.00041623448,0.00036186972,0.019067949,0.00012615646,0.000007904982,0.0000044545764,0.0000071075797,0.9695354,0.003624712,0.0049143075,0.0015974195,0.0003364619],"about_ca_topic_score_codex":0.000026529784,"about_ca_topic_score_gemma":0.000014543968,"teacher_disagreement_score":0.86154014,"about_ca_system_score_codex":0.000020143336,"about_ca_system_score_gemma":0.000025793288,"threshold_uncertainty_score":0.48588404},"labels":[],"label_agreement":null},{"id":"W3016005794","doi":"10.1016/j.jss.2020.110589","title":"Multilevel analysis of the java virtual machine based on kernel and userspace traces","year":2020,"lang":"en","type":"article","venue":"Journal of Systems and Software","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Java; Operating system; Java concurrency; Tracing; Virtual machine; Real time Java; strictfp; Thread (computing); Source code; Kernel (algebra); Linux kernel; Java annotation; Programming language; Embedded system","score_opus":0.018670406610857344,"score_gpt":0.23978956133459078,"score_spread":0.22111915472373345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016005794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06529307,0.00043559828,0.9304967,0.0036095222,0.00006606107,0.00005514879,0.000005864018,0.000028518667,0.000009511197],"genre_scores_gemma":[0.9806841,0.00002141377,0.018298287,0.0009368105,0.000031810825,3.8918625e-7,2.1444417e-7,0.0000033760105,0.000023608238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991993,0.00010125815,0.00027601258,0.00011258897,0.00024285784,0.0000679918],"domain_scores_gemma":[0.9991148,0.00017239567,0.00038441445,0.00013397969,0.00012752418,0.000066861554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028092662,0.00007807309,0.00027016478,0.000114975934,0.000100805904,0.00006556227,0.00028072688,0.00004337074,8.171973e-7],"category_scores_gemma":[0.00013417275,0.000047410755,0.00008929105,0.0003164664,0.000027938173,0.00010511201,0.000071505005,0.00013695552,7.312856e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006967123,0.000102465005,0.105097406,0.00016643925,0.0005874778,0.000037364418,0.007032109,0.8709456,0.00017726408,0.001175581,0.003969928,0.010638722],"study_design_scores_gemma":[0.0002463005,0.0001946239,0.012708648,0.0000817024,0.00006241279,0.000010364995,0.000055678283,0.98606634,0.00007814818,0.000008798475,0.00042678317,0.000060175335],"about_ca_topic_score_codex":0.00002448194,"about_ca_topic_score_gemma":0.000001012286,"teacher_disagreement_score":0.915391,"about_ca_system_score_codex":0.000008355061,"about_ca_system_score_gemma":0.000030574985,"threshold_uncertainty_score":0.19333546},"labels":[],"label_agreement":null},{"id":"W3016367849","doi":"10.1109/lascas45839.2020.9069014","title":"Efficient Power Consumption using Hybrid Emerging Memory Technology for 3D CMPs","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Power consumption; Computer science; Consumption (sociology); Memory management; Power (physics); Power demand; Computer architecture; Embedded system; Semiconductor memory; Computer hardware; Sociology","score_opus":0.03229786391598488,"score_gpt":0.2852960094699684,"score_spread":0.25299814555398353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016367849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019660832,0.000097766104,0.97578347,0.0020417932,0.0001455686,0.00023166464,0.0000012442559,0.0014980434,0.0005396121],"genre_scores_gemma":[0.41734254,0.0000025074212,0.58196706,0.0006334866,0.000017963424,0.0000064685764,9.3597333e-7,0.000006308963,0.000022752874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990844,0.000021516933,0.00020347726,0.0003533115,0.00011549508,0.0002217877],"domain_scores_gemma":[0.9994714,0.000038876573,0.00008311906,0.00024255675,0.00010145526,0.00006257782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015613963,0.00010719929,0.00012981273,0.00014543768,0.0001571743,0.00006125738,0.00043724905,0.00004732964,0.00001942476],"category_scores_gemma":[0.000066001136,0.00010438435,0.000047233243,0.00029456388,0.000036258534,0.00006348438,0.00022893415,0.0000811643,0.000018456587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003800316,0.00019133356,0.000670142,0.00012123159,0.000068526664,0.000027874961,0.0017243149,0.8223808,0.01695699,0.07907394,0.011257907,0.06748894],"study_design_scores_gemma":[0.00018723583,0.000054541135,0.0000071963104,0.00001071492,0.0000033383956,0.000012029705,0.00001321338,0.9847786,0.012904698,0.00028784198,0.0016040495,0.00013658586],"about_ca_topic_score_codex":0.0000020347293,"about_ca_topic_score_gemma":8.8514085e-8,"teacher_disagreement_score":0.3976817,"about_ca_system_score_codex":0.000028415814,"about_ca_system_score_gemma":0.000035007866,"threshold_uncertainty_score":0.42566702},"labels":[],"label_agreement":null},{"id":"W3017116334","doi":"10.1145/3392032","title":"SIMT-X","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Mitacs","keywords":"Computer science; Thread (computing); Parallel computing; Microarchitecture; SIMD; Instruction set; Out-of-order execution; Computer architecture; Latency (audio); Operating system","score_opus":0.01752328159174395,"score_gpt":0.23791624642776107,"score_spread":0.2203929648360171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017116334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000078476194,0.00004781797,0.9846918,0.013500568,0.000049593797,0.00013651048,0.0000058383926,0.0007012434,0.00078813],"genre_scores_gemma":[0.19989316,0.00012405786,0.79607046,0.003782664,0.000029989113,0.0000127711555,0.000005666849,0.00001246318,0.00006875058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914414,0.00005652729,0.00015681723,0.00035181525,0.00014485586,0.00014585497],"domain_scores_gemma":[0.9993589,0.000073778414,0.000048932903,0.00034789697,0.000045049856,0.00012545487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057849822,0.00013727527,0.00011927604,0.00009689066,0.00021958529,0.000115455296,0.0004504611,0.000065255714,0.000025977512],"category_scores_gemma":[0.000033833603,0.00012819521,0.00004504273,0.00040793215,0.000029690387,0.0001657787,0.000021007787,0.00018937983,0.000007852193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011573105,0.000020509391,0.0000033568479,0.0000057760026,0.000008354512,0.0000013048812,0.00053007226,0.90611255,0.00003103192,0.0005186337,0.000106076266,0.092650734],"study_design_scores_gemma":[0.0002563218,0.00018285678,0.000014568418,0.000011568505,0.000008503379,0.000010239172,0.000009564044,0.9935752,0.0013442644,0.00152898,0.0028847256,0.00017319381],"about_ca_topic_score_codex":0.000001989305,"about_ca_topic_score_gemma":0.0000017153941,"teacher_disagreement_score":0.19981469,"about_ca_system_score_codex":0.0000091232405,"about_ca_system_score_gemma":0.000022883101,"threshold_uncertainty_score":0.5227649},"labels":[],"label_agreement":null},{"id":"W3021432891","doi":"10.1145/3358960.3379131","title":"A Fully Structure-Driven Performance Analysis of Sparse Matrix-Vector Multiplication","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sparse matrix; Kernel (algebra); Reuse; Multiplication (music); Matrix multiplication; Parallel computing; Matrix (chemical analysis); Performance improvement; Code (set theory); Computer engineering; Theoretical computer science; Programming language","score_opus":0.018403824114561818,"score_gpt":0.2577812367414464,"score_spread":0.23937741262688456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021432891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097631045,0.000014803137,0.90092576,0.00059047714,0.000017944849,0.00008624419,0.0000032266723,0.00035582078,0.00037466217],"genre_scores_gemma":[0.6779129,0.000008130615,0.32185677,0.00017114489,0.000011819055,0.0000018672648,0.0000061393434,0.0000025492036,0.000028678285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992079,0.00002967298,0.00023085007,0.00025855948,0.00016494478,0.00010807851],"domain_scores_gemma":[0.9993203,0.000028735365,0.00013744444,0.00033149912,0.00011641548,0.000065605054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055091954,0.000084421976,0.00018891043,0.00015441045,0.000043904765,0.000037663023,0.000573172,0.00003908844,0.0000360057],"category_scores_gemma":[0.000025539846,0.000074128926,0.0000771738,0.0014757559,0.000017984341,0.00017960402,0.00013537442,0.00005716218,0.000007134582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019014258,0.000050958424,0.025439387,0.000043304426,0.00032563458,0.0000011172586,0.0016621905,0.9309471,0.011119976,0.016486775,0.0012821754,0.012622317],"study_design_scores_gemma":[0.00008108245,0.00004877755,0.01513209,0.0000024870849,0.000037891863,4.094896e-7,0.0000032928542,0.9731762,0.011228492,0.000024606376,0.00017918595,0.00008552977],"about_ca_topic_score_codex":0.000012900165,"about_ca_topic_score_gemma":0.0000029046716,"teacher_disagreement_score":0.58028185,"about_ca_system_score_codex":0.0000123590335,"about_ca_system_score_gemma":0.000025567902,"threshold_uncertainty_score":0.30228898},"labels":[],"label_agreement":null},{"id":"W3023407106","doi":"10.1145/384264.379242","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Exploit; Computer architecture; Parallelism (grammar); Architecture; Addressing mode; Processor register; Pace; Parallel computing; Operating system; Instructions per cycle; Memory address","score_opus":0.036100879116026253,"score_gpt":0.29157684621792007,"score_spread":0.2554759671018938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023407106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023410874,0.18320355,0.7862425,0.017822478,0.00026279816,0.0057344884,0.000006809184,0.00031483406,0.0040714876],"genre_scores_gemma":[0.82060707,0.0059755356,0.16738072,0.0054300195,0.00006929286,0.00023239311,0.0000022587794,0.000016649825,0.00028603576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759984,0.0013169965,0.0005014515,0.00023165163,0.00020827245,0.00014178321],"domain_scores_gemma":[0.9981199,0.0007229696,0.00013110037,0.00092898816,0.00007440848,0.000022662263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014384072,0.00013131571,0.00029453592,0.00002984793,0.0002460898,0.00018376029,0.000909873,0.0000397671,0.000014515837],"category_scores_gemma":[0.00048878556,0.00006960944,0.000044414977,0.00037412904,0.000056249493,0.00010235355,0.00012269753,0.00018818432,0.0000043218806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035796916,0.0002889844,0.0021059082,0.004644003,0.00009534021,0.000030972944,0.013246163,0.7082442,0.00054925523,0.069063164,0.08614669,0.11558171],"study_design_scores_gemma":[0.0014831733,0.00052827504,0.003092939,0.042855766,0.00013187436,0.0019587637,0.00019106631,0.8761252,0.00057638716,0.007851486,0.063529305,0.0016757532],"about_ca_topic_score_codex":0.00005436887,"about_ca_topic_score_gemma":0.000004058502,"teacher_disagreement_score":0.81826603,"about_ca_system_score_codex":0.000010613171,"about_ca_system_score_gemma":0.00006557694,"threshold_uncertainty_score":0.28385907},"labels":[],"label_agreement":null},{"id":"W3028423784","doi":"10.1109/isca45697.2020.00089","title":"The Virtual Block Interface: A Flexible Alternative to the Conventional Virtual Memory Framework","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"VMware","keywords":"Computer science; Virtual memory; Physical address; Memory management; Interface (matter); Block (permutation group theory); Workaround; Operating system; Memory protection; Key (lock); Computer architecture; Embedded system; Distributed computing; Overlay","score_opus":0.030492130659587644,"score_gpt":0.3099541458090831,"score_spread":0.2794620151494954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028423784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002698165,0.00017754547,0.9582118,0.032040585,0.0023695305,0.0006446248,0.00001132617,0.0010469251,0.005227859],"genre_scores_gemma":[0.7035604,0.00016725124,0.2724244,0.009314338,0.0012757132,0.00032451493,0.000014539841,0.00005395323,0.01286489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721295,0.00034162996,0.0005047042,0.0008825658,0.0006931813,0.00036498898],"domain_scores_gemma":[0.9972123,0.0007746107,0.0002744433,0.0012891914,0.0002778512,0.0001716392],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007819848,0.00036389116,0.00030151143,0.00009404902,0.000553112,0.001040807,0.005097482,0.00021663074,0.000040259132],"category_scores_gemma":[0.00038756855,0.00022070241,0.00022811498,0.0003938653,0.00014542292,0.000103045866,0.00703778,0.0013158129,0.00030322775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033613458,0.000050758124,0.000004521812,0.0000073473993,0.00016360873,0.000005591222,0.0026820542,0.46294188,0.000011515619,0.36388102,0.15990928,0.010308788],"study_design_scores_gemma":[0.00016566478,0.00031906785,0.000034112927,0.00020552162,0.000015221579,0.000011905894,0.00022113138,0.88253117,0.0042033526,0.07121356,0.04054413,0.0005351428],"about_ca_topic_score_codex":0.00004883808,"about_ca_topic_score_gemma":0.00000577527,"teacher_disagreement_score":0.7032906,"about_ca_system_score_codex":0.00009797185,"about_ca_system_score_gemma":0.00028832728,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W3029224773","doi":"10.1145/3393691.3394226","title":"User-level Threading","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Huawei Technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Concurrency; Threading (protein sequence); Scalability; Thread (computing); Multithreading; Server; Programming paradigm; POSIX Threads; Concurrent object-oriented programming; Distributed computing; Parallel computing; Operating system; Programming language; Reactive programming; Inductive programming","score_opus":0.06205047941904483,"score_gpt":0.27515830751932346,"score_spread":0.21310782810027862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029224773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001945616,0.000014252547,0.9676534,0.004654048,0.00003851719,0.000034626457,1.8159949e-7,0.0011849342,0.0262255],"genre_scores_gemma":[0.3045819,0.000004163366,0.6913448,0.0035642881,0.000033177817,0.0000013073625,4.040989e-7,0.0000029220175,0.0004670476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953794,0.000014148202,0.00008518121,0.00017294311,0.00008729878,0.00010249062],"domain_scores_gemma":[0.9997027,0.000021521659,0.000022236452,0.00015412278,0.000027919741,0.00007152031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005774785,0.000051661016,0.000060182763,0.000020875073,0.000052229967,0.00008902796,0.00050065224,0.000020436315,0.000014787593],"category_scores_gemma":[0.000025927953,0.00004522866,0.000023399596,0.0002210851,0.0000068262993,0.00018525416,0.00017256066,0.000047140933,0.00007296071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003315434,0.000025127418,0.0010372198,0.0000095229225,0.0000113888855,0.00001048238,0.0010250221,0.005790312,0.0005165372,0.85396045,0.09849296,0.039117653],"study_design_scores_gemma":[0.00010395328,0.000059496702,0.0003253952,0.000004559273,8.52904e-7,0.0000032257583,0.000006136858,0.9699548,0.008847636,0.002285149,0.01826414,0.00014467348],"about_ca_topic_score_codex":0.0000045026986,"about_ca_topic_score_gemma":2.608574e-7,"teacher_disagreement_score":0.9641645,"about_ca_system_score_codex":0.0000054034913,"about_ca_system_score_gemma":0.000015804697,"threshold_uncertainty_score":0.18443711},"labels":[],"label_agreement":null},{"id":"W3030108406","doi":"10.1145/3387902.3394029","title":"StoneCutter","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories","funders":"U.S. Department of Defense","keywords":"Application-specific integrated circuit; Computer science; Field-programmable gate array; Computer architecture; Implementation; Reuse; Embedded system; Construct (python library); High-level synthesis; Design space exploration; Reconfigurable computing; Distributed computing; Software engineering; Engineering; Programming language","score_opus":0.02420458051183987,"score_gpt":0.24681154589657614,"score_spread":0.22260696538473626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030108406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017034663,0.0000091926195,0.9512711,0.01207206,0.00002204922,0.000021527596,3.716626e-8,0.000945251,0.035488393],"genre_scores_gemma":[0.4013278,0.0000017822623,0.5850727,0.0133241145,0.000024352672,9.681581e-7,1.940059e-7,0.0000016841572,0.00024644166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996998,0.000010468921,0.000052246683,0.0001163731,0.00005815819,0.000063008156],"domain_scores_gemma":[0.99980164,0.000008579879,0.000011531103,0.00011264963,0.000016544158,0.0000490358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000028074472,0.000031510204,0.000035867502,0.000011593682,0.000023978564,0.000046577985,0.00033582235,0.00001197024,0.000027820954],"category_scores_gemma":[0.000009688645,0.000026569183,0.000015232242,0.00013085984,0.0000049126406,0.00010716212,0.000107650776,0.000030363237,0.00013263352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002664242,0.00003150895,0.0006754171,0.00000786641,0.000010639475,0.00001651704,0.0015324143,0.004830228,0.0007949134,0.518367,0.41770408,0.05602677],"study_design_scores_gemma":[0.0000741709,0.00004107961,0.00015491978,0.0000012109582,4.1260222e-7,0.0000021554695,0.0000024897392,0.95432985,0.0065178177,0.0013563934,0.037425708,0.00009376564],"about_ca_topic_score_codex":0.000001349971,"about_ca_topic_score_gemma":3.4622555e-8,"teacher_disagreement_score":0.94949967,"about_ca_system_score_codex":0.0000022324048,"about_ca_system_score_gemma":0.000007380127,"threshold_uncertainty_score":0.17047797},"labels":[],"label_agreement":null},{"id":"W3032902986","doi":"10.1109/tcad.2020.3012210","title":"Dynamic Memory Bandwidth Allocation for Real-Time GPU-Based SoC Platforms","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems; National Science Foundation","keywords":"Computer science; Memory bandwidth; Bandwidth (computing); Bandwidth throttling; Parallel computing; Central processing unit; Profiling (computer programming); Kernel (algebra); Embedded system; Operating system; Computer network","score_opus":0.033058374834083935,"score_gpt":0.24583730397931516,"score_spread":0.21277892914523122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032902986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014841396,0.00006787272,0.9958024,0.00018146349,0.00045374208,0.0011170936,0.000036173264,0.0007802229,0.00007687087],"genre_scores_gemma":[0.8691103,0.00006356848,0.1303214,0.00022030166,0.00003734865,0.00009738775,0.000020231884,0.000034272198,0.00009520669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978825,0.00015849053,0.00072242634,0.0006257959,0.00030587587,0.0003049215],"domain_scores_gemma":[0.99817866,0.0004693233,0.0003188826,0.00041315344,0.00042691955,0.00019303474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053067843,0.000331768,0.000541621,0.00028848823,0.00027073018,0.00021303569,0.00058421184,0.00019648818,0.0000048110996],"category_scores_gemma":[0.000009880849,0.0002903233,0.00014904,0.0005678064,0.00006550742,0.000304177,0.000002895341,0.00020806534,0.000008454737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006137428,0.00014346818,0.0000010331361,0.00016199109,0.00009549788,0.0000035144894,0.00057526305,0.9437633,0.010572827,0.000741525,0.00068707595,0.04319314],"study_design_scores_gemma":[0.0008928369,0.0011122588,0.00000455047,0.00022430925,0.000026680946,0.000012992862,0.000030208625,0.98023045,0.016981978,0.00012278192,0.000056497327,0.0003044464],"about_ca_topic_score_codex":0.000079735815,"about_ca_topic_score_gemma":0.0000016765872,"teacher_disagreement_score":0.86762613,"about_ca_system_score_codex":0.00009343762,"about_ca_system_score_gemma":0.0002863362,"threshold_uncertainty_score":0.9999549},"labels":[],"label_agreement":null},{"id":"W3033124768","doi":"10.1145/3366708","title":"Demystifying Complex Workload-DRAM Interactions","year":2019,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"VMware; Semiconductor Research Corporation; National Science Foundation","keywords":"Dram; Computer science; Workload; Dynamic random-access memory; Embedded system; Universal memory; Locality; Key (lock); Parallel computing; Memory management; Computer hardware; Operating system; Semiconductor memory; Interleaved memory","score_opus":0.056317129295860274,"score_gpt":0.2804748909063884,"score_spread":0.2241577616105281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033124768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672644,0.00037998825,0.12499302,0.0012967286,0.00047575825,0.0005560351,0.0000016970839,0.00029298288,0.004739372],"genre_scores_gemma":[0.9800573,0.000009537865,0.019785875,0.00005098673,0.000027053216,0.0000024865321,4.8478705e-7,0.000006818618,0.00005948539],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980925,0.000039141967,0.00059004565,0.00034754627,0.00074339606,0.00018741985],"domain_scores_gemma":[0.9977322,0.00012877576,0.0008242336,0.00054120045,0.0007271824,0.00004636737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014511826,0.00016354371,0.0005168015,0.0004640662,0.00015866649,0.00016262801,0.0018132564,0.00004145202,0.0000018859159],"category_scores_gemma":[0.0003084072,0.00012147654,0.000223051,0.0014637453,0.000039672188,0.0001608896,0.0007122115,0.00013814618,0.0000016763695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006490457,0.0005895318,0.55470806,0.0012440336,0.005526902,3.5558432e-7,0.0046503386,0.2334757,0.11065387,0.06840264,0.004925411,0.015758265],"study_design_scores_gemma":[0.00021548638,0.00006650883,0.032779567,0.0008697977,0.00025782155,0.0000022020995,0.00014609843,0.961045,0.0038777227,0.00037972347,0.00017419955,0.00018581943],"about_ca_topic_score_codex":0.0000301293,"about_ca_topic_score_gemma":8.187826e-7,"teacher_disagreement_score":0.72756934,"about_ca_system_score_codex":0.00005762932,"about_ca_system_score_gemma":0.000019563608,"threshold_uncertainty_score":0.49536696},"labels":[],"label_agreement":null},{"id":"W3033163771","doi":"10.1007/s12652-020-02086-9","title":"Requirements-preserving design automation for multiprocessor embedded system applications","year":2020,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Multiprocessing; Abstraction layer; Scheduling (production processes); Distributed computing; Quality of service; Embedded system; Parallel computing; Programming language; Software","score_opus":0.09842030587998997,"score_gpt":0.3241221050016479,"score_spread":0.22570179912165794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033163771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014716552,0.00026749467,0.99706584,0.00030673362,0.00010912075,0.00045865224,5.0189703e-7,0.00024534253,0.00007467658],"genre_scores_gemma":[0.49478972,0.000018210028,0.504863,0.00017572401,0.00013349792,0.0000068283507,6.6396984e-7,0.000007153874,0.000005155689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998391,0.00008447771,0.00078165875,0.0002617334,0.00027585484,0.00020529963],"domain_scores_gemma":[0.998019,0.00025985687,0.000793948,0.00017082291,0.0006265901,0.00012977657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157019,0.00014261401,0.00027909796,0.0001436247,0.0003646459,0.00030836483,0.000827167,0.00004990102,0.0000019761935],"category_scores_gemma":[0.00014525156,0.0001322921,0.0000894987,0.00030521126,0.000025551964,0.0004517425,0.00020421999,0.0001418135,0.0000034137754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020876965,0.00030055747,0.00016632873,0.0013984431,0.0002533767,0.000020793366,0.024031341,0.55924875,0.008882679,0.13215865,0.002606255,0.27072403],"study_design_scores_gemma":[0.00023974538,0.00028710658,0.0000125843135,0.0001889402,0.00001718815,0.000025947247,0.0003812157,0.9850154,0.011824422,0.0014633677,0.00040566668,0.00013842895],"about_ca_topic_score_codex":0.0000012618627,"about_ca_topic_score_gemma":7.687675e-8,"teacher_disagreement_score":0.49331805,"about_ca_system_score_codex":0.0000559419,"about_ca_system_score_gemma":0.00006682009,"threshold_uncertainty_score":0.53947157},"labels":[],"label_agreement":null},{"id":"W3033938031","doi":"10.1145/2076021.2048077","title":"Kind analysis for MATLAB","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Programming language; Compiler; Scripting language; MATLAB; Identifier; Syntax; Variety (cybernetics); Artificial intelligence","score_opus":0.06272742362140878,"score_gpt":0.28008440688772573,"score_spread":0.21735698326631697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033938031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007817168,0.000053139305,0.98702615,0.00018031464,0.00010295867,0.000109487366,0.0000035749838,0.00043652358,0.0042706938],"genre_scores_gemma":[0.5181404,0.0000030545807,0.48151037,0.0001613532,0.000021867396,0.000009031484,0.0000055775336,0.0000034942443,0.00014487619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992315,0.000030650863,0.0001634893,0.00027556365,0.00011018371,0.00018859585],"domain_scores_gemma":[0.9988842,0.00018960386,0.00011006495,0.0006860869,0.00007547968,0.000054569045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002225279,0.0000948081,0.00015335881,0.00019885799,0.000103277074,0.00009847101,0.0013307241,0.000048691323,0.000025125997],"category_scores_gemma":[0.000111226684,0.00008397495,0.00009074275,0.00051615445,0.000019971034,0.00023657025,0.00019580862,0.000044265435,0.00002242443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022916049,0.0013179551,0.21600622,0.00029923287,0.0043295873,0.00010006598,0.032378055,0.049331356,0.0007421064,0.48354396,0.05492352,0.15679878],"study_design_scores_gemma":[0.0006470492,0.0004038268,0.051739454,0.000027461652,0.00042165458,0.0000058720966,0.00007299607,0.8853277,0.016545432,0.03225353,0.011650393,0.00090464647],"about_ca_topic_score_codex":0.00006214211,"about_ca_topic_score_gemma":0.000015532747,"teacher_disagreement_score":0.8359963,"about_ca_system_score_codex":0.000008130472,"about_ca_system_score_gemma":0.000016552736,"threshold_uncertainty_score":0.3424399},"labels":[],"label_agreement":null},{"id":"W3034464722","doi":"10.1145/3394898","title":"Exploiting Errors for Efficiency","year":2020,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; University of Twente; École Polytechnique Fédérale de Lausanne; Royal Society; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Alan Turing Institute; National Science Foundation","keywords":"Computer science; Compiler; Distributed computing; Exploit; Correctness; Computer architecture; Abstraction layer; Computer engineering; Embedded system; Software; Programming language","score_opus":0.10403300565709951,"score_gpt":0.362428854379578,"score_spread":0.2583958487224785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034464722","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.1145765e-7,0.46206927,0.53524685,0.00005866626,0.00048089208,0.0005585897,0.000007256544,0.0013706451,0.00020759655],"genre_scores_gemma":[0.00003378194,0.5761629,0.42309833,0.00009706242,0.00035346302,0.000042966083,0.00007053112,0.00007976357,0.00006125301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99475473,0.0015059103,0.0012029201,0.0013860925,0.00038584406,0.0007645018],"domain_scores_gemma":[0.9936038,0.00330717,0.0009733898,0.001680989,0.000228353,0.00020627823],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.004072812,0.0007031326,0.0019540968,0.00034338623,0.0005024125,0.00044379948,0.0055110445,0.00032607839,0.0000024151966],"category_scores_gemma":[0.0025482366,0.0006623536,0.00076581526,0.0014518121,0.000054418997,0.0001861077,0.0023088548,0.0005616617,0.00007058195],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3866002e-7,0.000026451438,0.0000022288827,0.001968666,0.000043043798,0.000009044328,0.00012791902,0.00034397005,4.527436e-8,0.0013098363,0.001598311,0.99457026],"study_design_scores_gemma":[0.00015753579,0.00011326621,0.0000022771446,0.004005428,0.00007009546,0.00003959303,0.00000437524,0.14212365,0.0000028383488,0.0005698626,0.85202146,0.00088962936],"about_ca_topic_score_codex":0.000013047814,"about_ca_topic_score_gemma":6.9441796e-7,"teacher_disagreement_score":0.9936806,"about_ca_system_score_codex":0.00012803506,"about_ca_system_score_gemma":0.0004440064,"threshold_uncertainty_score":0.99986964},"labels":[],"label_agreement":null},{"id":"W3034772905","doi":"10.1109/fccm48280.2020.00025","title":"Exploring Writeback Designs for Efficiently Leveraging Parallel-Execution Units in FPGA-Based Soft-Processors","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Field-programmable gate array; Throughput; Processor design; Lookup table; Embedded system; Multiplexer; Parallel computing; Computer architecture; Multiplexing; Operating system","score_opus":0.25867688730205773,"score_gpt":0.29089201876520426,"score_spread":0.03221513146314653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034772905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011118856,0.000039782957,0.9850711,0.0018906418,0.00008963052,0.00035794632,9.1047093e-7,0.0010233845,0.00040773296],"genre_scores_gemma":[0.64591354,0.0000071682225,0.35269067,0.0012300451,0.00003192747,0.000074240495,0.00000724643,0.000011977035,0.00003321351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985126,0.00006938591,0.00032934546,0.0005076061,0.00021328557,0.00036774538],"domain_scores_gemma":[0.999181,0.00017794242,0.00009286404,0.00023669719,0.00018925371,0.00012229513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003519208,0.0001774307,0.00019628483,0.00018364834,0.00015211877,0.00016851442,0.0006763885,0.000050681814,0.000004357474],"category_scores_gemma":[0.00019379647,0.00018013912,0.000051338528,0.0013118391,0.000021096212,0.00053221005,0.000111946276,0.00013068526,0.000012082548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030755862,0.000053805783,0.00025066125,0.00006269023,0.00000502482,0.0000048576567,0.0017207202,0.9819267,0.00023601906,0.005129748,0.00095572416,0.009623306],"study_design_scores_gemma":[0.0006477419,0.00011266865,0.00011714548,0.00004936818,0.0000024670098,8.16539e-7,0.00007216859,0.98617595,0.011471624,0.0003444274,0.00076357886,0.00024203905],"about_ca_topic_score_codex":0.000015091427,"about_ca_topic_score_gemma":0.0000023873208,"teacher_disagreement_score":0.63479465,"about_ca_system_score_codex":0.00005633458,"about_ca_system_score_gemma":0.00013900895,"threshold_uncertainty_score":0.734586},"labels":[],"label_agreement":null},{"id":"W3035177949","doi":"10.1109/fccm48280.2020.00072","title":"AIgean: An Open Framework for Machine Learning on Heterogeneous Clusters","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Stack (abstract data type); Focus (optics); Domain (mathematical analysis); Artificial intelligence; Computation; Field (mathematics); Machine learning; Layer (electronics); Cluster (spacecraft); Distributed computing; Operating system; Algorithm","score_opus":0.05308443618640125,"score_gpt":0.3181829672508705,"score_spread":0.26509853106446923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035177949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000445158,0.000016197031,0.9925129,0.0038355498,0.00006816046,0.00031110027,0.0000010460955,0.00089831144,0.0019115952],"genre_scores_gemma":[0.29249865,0.0000046697696,0.6987809,0.008495157,0.000051913845,0.000014777447,0.0000065565378,0.000011482193,0.0001358696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999067,0.00007574492,0.00015722722,0.00040176837,0.000115654264,0.00018258237],"domain_scores_gemma":[0.9993348,0.00012884794,0.000066289234,0.00028990608,0.00004067075,0.00013948882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018191012,0.000112712165,0.0001395309,0.000033753204,0.00018941582,0.00041464512,0.001496047,0.00005964098,0.00002012925],"category_scores_gemma":[0.000113964066,0.000100129444,0.000037761092,0.0001690899,0.000010412937,0.00023204289,0.00047137076,0.00015503449,0.000020730298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010996808,0.00013411704,0.0002704154,0.0000221305,0.000030634146,0.000012202066,0.0017302505,0.73921925,0.000066441644,0.18866722,0.0040660608,0.06567132],"study_design_scores_gemma":[0.00017188312,0.00093339663,0.000007438301,0.000010585294,0.0000015134688,0.0000025462994,0.000005146612,0.98587596,0.0017629234,0.0043579964,0.006721645,0.00014896592],"about_ca_topic_score_codex":0.00001709342,"about_ca_topic_score_gemma":0.0000017237169,"teacher_disagreement_score":0.29373196,"about_ca_system_score_codex":0.00001371759,"about_ca_system_score_gemma":0.00001912182,"threshold_uncertainty_score":0.40831602},"labels":[],"label_agreement":null},{"id":"W3041518155","doi":"10.1016/j.softx.2021.100901","title":"ACORNS: An easy-to-use code generator for gradients and Hessians","year":2022,"lang":"en","type":"article","venue":"SoftwareX","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Python (programming language); Computer science; Automatic differentiation; Computation; Programming language; Code (set theory); Ranging; Generator (circuit theory); Code generation; Computational science; Source code; Parallel computing; Theoretical computer science; Algorithm; Operating system; Set (abstract data type)","score_opus":0.030911843699870264,"score_gpt":0.27560548785610495,"score_spread":0.24469364415623468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041518155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028172953,0.000045940218,0.97019714,0.0002203378,0.00022364376,0.00027127593,0.000038588656,0.0008001181,0.000030028865],"genre_scores_gemma":[0.32088435,0.0000054134994,0.6763994,0.001997066,0.000040444174,0.00016253725,0.00001803882,0.000017326935,0.00047541657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.00007224207,0.00013652159,0.00039386723,0.00015731837,0.00022651495],"domain_scores_gemma":[0.9993041,0.00006856394,0.000050888288,0.00037859788,0.00005827733,0.00013958472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022717267,0.00010226555,0.00011196794,0.00010561876,0.0004666607,0.00017764106,0.0005686303,0.000023931741,0.0000067139495],"category_scores_gemma":[0.00006357927,0.00010798142,0.000031048152,0.0002455725,0.000015991845,0.00027993854,0.0003756075,0.00007613177,0.0000027936483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002834694,0.001977801,0.082307175,0.00018762729,0.00021331711,0.00011415381,0.027716247,0.18454933,0.002761929,0.12110838,0.24225579,0.33652478],"study_design_scores_gemma":[0.0010708674,0.0013459387,0.006754375,0.00002172383,0.0000129969785,0.000050077717,0.000065623644,0.8013774,0.0015619532,0.013420571,0.17343874,0.0008797141],"about_ca_topic_score_codex":0.000012849342,"about_ca_topic_score_gemma":0.0000029202804,"teacher_disagreement_score":0.6168281,"about_ca_system_score_codex":0.000039224455,"about_ca_system_score_gemma":0.00004536906,"threshold_uncertainty_score":0.44033545},"labels":[],"label_agreement":null},{"id":"W3041919703","doi":"10.1109/lca.2020.3008288","title":"MCsim: An Extensible DRAM Memory Controller Simulator","year":2020,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Computer science; Extensibility; Dram; Embedded system; Computer architecture simulator; Memory controller; CAS latency; Scheduling (production processes); Interface (matter); Computer architecture; Operating system; Computer hardware","score_opus":0.015918679296096194,"score_gpt":0.23536594872781405,"score_spread":0.21944726943171786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041919703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018385137,0.000044438442,0.958737,0.019563029,0.0005926912,0.00036017474,0.000002689056,0.0021798587,0.00013496999],"genre_scores_gemma":[0.48552844,0.0000017463757,0.4224537,0.09094241,0.0010117787,0.000010319539,0.0000046545247,0.000032782566,0.000014161944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973558,0.00027298572,0.00040781195,0.0009576814,0.00042671556,0.00057899556],"domain_scores_gemma":[0.99843055,0.00016770902,0.00015147991,0.0007398174,0.00009712324,0.00041331234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021332371,0.00039014118,0.0004461906,0.00018278231,0.00022382141,0.00037146558,0.0017559277,0.00010704695,0.000008175741],"category_scores_gemma":[0.000018196894,0.0003559394,0.00018236629,0.0005124177,0.0001015591,0.00036701336,0.0002989236,0.0004864126,0.00005791626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027966165,0.000047774527,0.00003113808,0.000018246641,0.000041634194,0.000063184736,0.002146071,0.92555654,0.005583346,0.0002394097,0.023396855,0.042847823],"study_design_scores_gemma":[0.0008652141,0.0002481051,0.00013731344,0.000020587686,0.000009279689,0.000034887213,0.000002316996,0.98848194,0.002985766,0.0004170057,0.0063149636,0.00048259646],"about_ca_topic_score_codex":0.0000121569365,"about_ca_topic_score_gemma":9.866213e-7,"teacher_disagreement_score":0.5362833,"about_ca_system_score_codex":0.000030540363,"about_ca_system_score_gemma":0.00004372688,"threshold_uncertainty_score":0.99988925},"labels":[],"label_agreement":null},{"id":"W3043202537","doi":"10.1007/s00500-020-05152-8","title":"A load balance multi-scheduling model for OpenCL kernel tasks in an integrated cluster","year":2020,"lang":"en","type":"article","venue":"Soft Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Høgskulen på Vestlandet","keywords":"Computer science; Feature selection; Naive Bayes classifier; Classifier (UML); Machine learning; Artificial intelligence; Random forest; Multi-core processor; Scheduling (production processes); Parallel computing; Support vector machine","score_opus":0.05515235681134787,"score_gpt":0.3121857470609684,"score_spread":0.2570333902496205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043202537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018435663,0.00007050218,0.97917914,0.00078008603,0.00010451023,0.000426048,0.0000031143693,0.0009320059,0.000068926536],"genre_scores_gemma":[0.48608184,0.0000013060456,0.5123015,0.0015214008,0.000044804623,0.000007744933,0.0000063215166,0.000013880634,0.000021201673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803984,0.00009837608,0.00048057284,0.0007260534,0.00020921527,0.00044594347],"domain_scores_gemma":[0.9988886,0.00016767714,0.0001698126,0.00035645196,0.00025498983,0.00016243805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006414805,0.0002333676,0.00030927267,0.00008581721,0.00017990565,0.000290882,0.0012266155,0.000109439046,0.0000013860898],"category_scores_gemma":[0.00034401406,0.00023898852,0.00007689583,0.0005298742,0.00003158216,0.0004643664,0.000491707,0.00030108352,0.000011030084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016104404,0.000055859946,0.0009065902,0.000026375039,0.000004857497,0.000003137294,0.0037655102,0.97936755,0.00018910893,0.0004413863,0.00020654565,0.015016998],"study_design_scores_gemma":[0.00091464404,0.00007066191,0.00008091194,0.00008803989,0.0000024455765,0.0000027051146,0.00004995937,0.99772054,0.00029323855,0.00037749068,0.00010125424,0.00029813638],"about_ca_topic_score_codex":0.000021942158,"about_ca_topic_score_gemma":0.000009654644,"teacher_disagreement_score":0.46764618,"about_ca_system_score_codex":0.00009237178,"about_ca_system_score_gemma":0.00021017983,"threshold_uncertainty_score":0.97456694},"labels":[],"label_agreement":null},{"id":"W3043382192","doi":"10.1109/isca45697.2020.00024","title":"T4: Compiling Sequential Code for Effective Speculative Parallelization in Hardware","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Compiler; Scalability; Speedup; Exploit; Task parallelism; Automatic parallelization; Spawn (biology); Speculative execution; Multi-core processor; Optimizing compiler; Register file; Computer architecture; Instruction set; Programming language; Parallelism (grammar); Operating system","score_opus":0.038492518740147495,"score_gpt":0.3009201967051305,"score_spread":0.262427677964983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043382192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014940643,0.000026038142,0.9943021,0.0014169428,0.000072113966,0.00063834415,0.0000045495126,0.00053524756,0.0015105784],"genre_scores_gemma":[0.5993064,0.000004576583,0.39972278,0.0008053784,0.000055272438,0.000042204345,0.000015546766,0.0000074599666,0.00004039338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990509,0.00008398843,0.00021002177,0.00036220232,0.000118700154,0.00017416758],"domain_scores_gemma":[0.9994943,0.00012028899,0.000071643124,0.00013986538,0.00011047054,0.00006340903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016167125,0.000112431786,0.00016670173,0.0000647239,0.000076606666,0.00009139777,0.00035392825,0.000049655504,0.000008814094],"category_scores_gemma":[0.000101270554,0.00010990693,0.000055558357,0.00031275564,0.000017663551,0.00032010805,0.00012819539,0.00007978677,0.000010559711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008232959,0.00009397561,0.002035728,0.00007589767,0.000036957445,0.000012850587,0.0046615736,0.70774525,0.0008898829,0.26509777,0.0042398525,0.015027912],"study_design_scores_gemma":[0.00050567964,0.00010707287,0.00045856088,0.000018333696,0.000002185541,9.547218e-7,0.00001624801,0.98871064,0.0054797544,0.002911058,0.0016451762,0.00014434787],"about_ca_topic_score_codex":0.000008489651,"about_ca_topic_score_gemma":0.000009244644,"teacher_disagreement_score":0.5978123,"about_ca_system_score_codex":0.000044318233,"about_ca_system_score_gemma":0.000032234708,"threshold_uncertainty_score":0.44818744},"labels":[],"label_agreement":null},{"id":"W3047630436","doi":"10.1145/3407947.3407948","title":"Computational Experience with Diagonally Structured Linear Algebra in Java","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Java; Linear algebra; Diagonal; Diagonally dominant matrix; Computer science; Matrix (chemical analysis); Matrix multiplication; Numerical linear algebra; Algebra over a field; Computation; Parallel computing; Algorithm; Theoretical computer science; Computational science; Linear system; Mathematics; Programming language; Pure mathematics; Geometry","score_opus":0.016418135701155013,"score_gpt":0.25359784326250273,"score_spread":0.2371797075613477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047630436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021871194,0.000016770075,0.97432977,0.0019003726,0.00002299325,0.00009838825,5.663968e-7,0.0004585346,0.0013014352],"genre_scores_gemma":[0.5488139,0.0000013102996,0.44942704,0.0017125832,0.000016539649,0.000004493646,0.0000025864138,0.000003485618,0.000018092845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906033,0.00003557778,0.00018292408,0.0003283671,0.00023625273,0.00015651791],"domain_scores_gemma":[0.9995786,0.000051755746,0.000049686954,0.00015463006,0.00007113036,0.00009422375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005616154,0.00010592315,0.000118409116,0.000057042063,0.00004971857,0.000075625554,0.0005551596,0.000033125165,0.000027800426],"category_scores_gemma":[0.000026531103,0.0000854792,0.000019461586,0.00050426746,0.00003624868,0.00026248727,0.00013623218,0.000101731726,0.000012362397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022800592,0.000043093973,0.008855354,0.000009132844,0.00000871436,0.000040995343,0.005415907,0.905369,0.00007120629,0.07331412,0.0011415964,0.005708073],"study_design_scores_gemma":[0.00026634967,0.0000840896,0.0056088846,0.000007747966,4.8466103e-7,0.000007045278,0.000024460347,0.9910836,0.0007840506,0.0016726016,0.00031515,0.00014553161],"about_ca_topic_score_codex":0.000012062269,"about_ca_topic_score_gemma":0.0000041527305,"teacher_disagreement_score":0.5269427,"about_ca_system_score_codex":0.000013882761,"about_ca_system_score_gemma":0.00007173957,"threshold_uncertainty_score":0.34857404},"labels":[],"label_agreement":null},{"id":"W3048458458","doi":"10.1145/3386569.3392486","title":"NASOQ","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Innovative Research Group Project of the National Natural Science Foundation of China","keywords":"Computer science; Solver; Scalability; Benchmark (surveying); Quadratic programming; General-purpose computing on graphics processing units; Algorithm; Set (abstract data type); Graphics; Mathematical optimization; Mathematics","score_opus":0.034560357211684004,"score_gpt":0.25990707108116623,"score_spread":0.22534671386948224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048458458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025923652,0.000027883312,0.9850306,0.012693136,0.00010344927,0.00006975079,0.0000018746401,0.0010763613,0.00073771575],"genre_scores_gemma":[0.6825738,0.00010643606,0.30982047,0.0074129864,0.000024026624,0.000009826465,0.0000010790137,0.000008926704,0.000042447704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926484,0.000037137597,0.00013109086,0.00026008405,0.00016841217,0.00013845686],"domain_scores_gemma":[0.999222,0.000077619276,0.000031932035,0.00050829083,0.00005181141,0.00010834909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007331314,0.00009568161,0.000088866764,0.00009920832,0.00017875934,0.00007248765,0.0009003568,0.000058401023,0.000014535831],"category_scores_gemma":[0.00002724882,0.00009549875,0.00008379151,0.00078439,0.000028639924,0.0001759369,0.00001266115,0.00021248452,0.000044577257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008061015,0.0009135664,0.000426334,0.000097121396,0.00025839623,0.00006836248,0.006307256,0.14142023,0.0010276166,0.34238073,0.028201237,0.47881854],"study_design_scores_gemma":[0.00083567377,0.00082070025,0.00051962514,0.0000418974,0.000026279955,0.00002326639,0.000034426823,0.8745318,0.01943737,0.044909988,0.05798066,0.00083828886],"about_ca_topic_score_codex":0.0000037179282,"about_ca_topic_score_gemma":0.000001078161,"teacher_disagreement_score":0.73311156,"about_ca_system_score_codex":0.0000070494625,"about_ca_system_score_gemma":0.000025465471,"threshold_uncertainty_score":0.3894326},"labels":[],"label_agreement":null},{"id":"W3083013455","doi":"10.1145/1647300.1658422","title":"Maximizing Power Efficiency with Asymmetric Multicore Systems","year":2009,"lang":"en","type":"article","venue":"Queue","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multi-core processor; Computer science; Power consumption; Power (physics); Central processing unit; Architecture; Energy consumption; Efficient energy use; Embedded system; Parallel computing; Core (optical fiber); Computer architecture; Operating system; Telecommunications; Electrical engineering; Engineering","score_opus":0.010527408604574462,"score_gpt":0.23443657355862152,"score_spread":0.22390916495404706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083013455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034558247,0.00031802518,0.97735405,0.00027170285,0.00013856322,0.00015734858,3.0469585e-7,0.0008722599,0.017431933],"genre_scores_gemma":[0.8480372,0.000007176914,0.15145467,0.00025353648,0.000021214024,0.0000039834636,7.4250323e-7,0.0000055669443,0.00021594984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989647,0.00004903486,0.00017539223,0.0003133935,0.00024147159,0.0002559835],"domain_scores_gemma":[0.99923134,0.000048343067,0.00008983279,0.00044775897,0.00010712722,0.00007561611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021935762,0.00012720763,0.00014690164,0.00022867978,0.00012533285,0.00021221799,0.0006034189,0.000052620242,0.0000015577189],"category_scores_gemma":[0.000037872298,0.00009921692,0.00003111744,0.00090476294,0.000017875898,0.00020747793,0.000051508185,0.0001123917,0.000025263158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000441291,0.0009544839,0.003257864,0.000059834052,0.00005358171,0.00028483258,0.0030187236,0.3476471,0.0005423071,0.51744807,0.011326801,0.11536229],"study_design_scores_gemma":[0.00040596628,0.00053240533,0.0030094609,0.00009056021,0.0000043897057,0.00008412491,0.0000249691,0.99206394,0.0011419822,0.00042889387,0.0018438774,0.00036940834],"about_ca_topic_score_codex":0.000022631053,"about_ca_topic_score_gemma":3.0363256e-7,"teacher_disagreement_score":0.8445813,"about_ca_system_score_codex":0.00003875073,"about_ca_system_score_gemma":0.000041943666,"threshold_uncertainty_score":0.40459487},"labels":[],"label_agreement":null},{"id":"W3083624021","doi":"10.1145/1698223.1709862","title":"Managing Contention for Shared Resources on Multicore Processors","year":2010,"lang":"en","type":"article","venue":"Queue","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multi-core processor; Memory hierarchy; Shared memory; Shared resource; Hierarchy; Computer architecture; Resource (disambiguation); Parallel computing; Distributed computing; Operating system; Computer network; Cache","score_opus":0.02154502129187181,"score_gpt":0.27652729046998065,"score_spread":0.25498226917810884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083624021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02318379,0.000013162902,0.9711682,0.0013132099,0.00023756038,0.00025718327,0.0000018122741,0.00069409446,0.0031309633],"genre_scores_gemma":[0.76267135,0.0000027307458,0.23592661,0.00038577395,0.000071749426,0.000050899594,0.0000055008413,0.00000893743,0.00087645237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.000015002523,0.00012002168,0.00024505108,0.000101909194,0.00014621217],"domain_scores_gemma":[0.99947023,0.00006481181,0.00007190841,0.00025798607,0.000095457726,0.00003960277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019238095,0.00007848187,0.000079591395,0.00008621131,0.00013679678,0.00014873949,0.000437855,0.00005028366,0.0000047754734],"category_scores_gemma":[0.00009676183,0.000071074006,0.00004061362,0.000115732444,0.000017617518,0.00015917362,0.00005480748,0.00010696137,0.000009943945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017474114,0.00063307234,0.0029175107,0.0003492907,0.00007848614,0.00002025672,0.009161191,0.018136187,0.016648838,0.46638677,0.040338032,0.44515562],"study_design_scores_gemma":[0.00035888073,0.00010583032,0.00090800214,0.000050262843,0.0000027970675,0.000003204567,0.000017217579,0.9691337,0.008534767,0.009081846,0.01163042,0.00017310567],"about_ca_topic_score_codex":0.000012496457,"about_ca_topic_score_gemma":0.000008298469,"teacher_disagreement_score":0.9509975,"about_ca_system_score_codex":0.000008702783,"about_ca_system_score_gemma":0.000011586544,"threshold_uncertainty_score":0.2898314},"labels":[],"label_agreement":null},{"id":"W3083871806","doi":"10.1109/hpcs48598.2019.9188052","title":"Design Space Exploration of Embedded Applications on Heterogeneous CPU-GPU Platforms","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Central processing unit; Parallel computing; CPU shielding; Benchmark (surveying); Design space exploration; Symmetric multiprocessor system; Embedded system; Operating system","score_opus":0.03736323191583305,"score_gpt":0.2708000266063417,"score_spread":0.23343679469050868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083871806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013966389,0.000011647393,0.99221677,0.00013049622,0.000049279843,0.00045164092,3.4514255e-7,0.00045042718,0.005292737],"genre_scores_gemma":[0.5553997,0.000010558564,0.44381166,0.00015064997,0.000011691512,0.00004027968,0.0000028749835,0.000006049239,0.00056654646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992253,0.000022192853,0.00019261657,0.00025231898,0.0001800043,0.00012753095],"domain_scores_gemma":[0.99911773,0.00007858078,0.00011408414,0.0005611288,0.00008843321,0.00004006622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016952402,0.00009552996,0.00012043219,0.00011180573,0.00004960206,0.00004647923,0.00045171395,0.000051481835,0.000019121178],"category_scores_gemma":[0.000005530928,0.00008045492,0.000037979862,0.00027501603,0.000013310459,0.0003500165,0.0000752361,0.00005431788,0.00015613211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017338405,0.0001443183,0.0000541814,0.000016907064,0.000016076974,7.6836415e-7,0.0006241349,0.79317886,0.0020910557,0.19115645,0.001325089,0.01137485],"study_design_scores_gemma":[0.00019900044,0.00023687721,0.000015384307,0.000014272457,0.0000019049291,0.000003487119,0.000015810025,0.84235895,0.14020483,0.0161245,0.00066162396,0.00016333236],"about_ca_topic_score_codex":0.0000040318187,"about_ca_topic_score_gemma":3.9914295e-7,"teacher_disagreement_score":0.55400306,"about_ca_system_score_codex":0.000020354952,"about_ca_system_score_gemma":0.000032160024,"threshold_uncertainty_score":0.32808566},"labels":[],"label_agreement":null},{"id":"W3088770438","doi":"10.1145/3407904","title":"Approximate Cache in GPGPUs","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache algorithms; Cache pollution; Cache invalidation; Cache coloring; Smart Cache; Cache-oblivious algorithm; Page cache; Thread (computing); CPU cache; Operating system","score_opus":0.034497854592266376,"score_gpt":0.2679640858403253,"score_spread":0.2334662312480589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088770438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039702547,0.00011468434,0.9911476,0.0012780672,0.0005049802,0.00037287222,0.0000023575765,0.001652507,0.00095668813],"genre_scores_gemma":[0.85515225,0.000010398728,0.14408503,0.0005852856,0.000073795985,0.00001871145,0.0000020715183,0.000021255859,0.0000511694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772847,0.00025964656,0.0005711246,0.0006791583,0.00033917764,0.0004224509],"domain_scores_gemma":[0.99850744,0.00021835013,0.00013711392,0.0008841775,0.00008168065,0.00017121785],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044202476,0.00025684334,0.0003603364,0.00023431315,0.00021856574,0.0002672714,0.001571135,0.00012698921,0.000003938189],"category_scores_gemma":[0.000064306776,0.0002631047,0.00010630412,0.0011172185,0.000029678604,0.00023747467,0.00005093374,0.00043300612,0.000058187783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118092885,0.00010298826,0.000050931885,0.00006020557,0.000023040322,0.000022633747,0.0036100291,0.97597426,0.00012620924,0.0024201558,0.00028063258,0.017317098],"study_design_scores_gemma":[0.00047377506,0.000120964825,0.00003671691,0.00010376408,0.000004650463,0.000025881567,0.0001631515,0.9973541,0.0008254455,0.00020824178,0.00039690826,0.00028640407],"about_ca_topic_score_codex":0.00008042382,"about_ca_topic_score_gemma":0.0000022523002,"teacher_disagreement_score":0.85118204,"about_ca_system_score_codex":0.00009126209,"about_ca_system_score_gemma":0.00006393649,"threshold_uncertainty_score":0.9999821},"labels":[],"label_agreement":null},{"id":"W3090859402","doi":"10.1007/s00542-020-05048-5","title":"Improving power-performance via hybrid cache for chip many cores based on neural network prediction technique","year":2020,"lang":"en","type":"article","venue":"Microsystem Technologies","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Cache algorithms; Cache pollution; Control reconfiguration; Static random-access memory; Embedded system; Speedup; Chip; Parallel computing; Cache coloring; Latency (audio); Computer architecture; Energy consumption; CPU cache; Smart Cache; Computer hardware; Engineering","score_opus":0.013363694851001723,"score_gpt":0.2136601532721965,"score_spread":0.20029645842119478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090859402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008071876,0.0002658236,0.9778733,0.001192953,0.00022973753,0.0012383395,0.000018977495,0.011001029,0.00010792594],"genre_scores_gemma":[0.7814623,0.000012312709,0.21778573,0.00032507587,0.000050591258,0.00031996839,0.0000103772745,0.000023177372,0.000010461335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981052,0.000050466326,0.0004451235,0.0006928652,0.00021661105,0.0004897217],"domain_scores_gemma":[0.99866396,0.0001322492,0.00029119317,0.0007359537,0.00012747195,0.000049173734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045445934,0.00029842192,0.00031729322,0.00016797124,0.0003720899,0.00020238166,0.001481537,0.00023008394,7.782211e-7],"category_scores_gemma":[0.00014496526,0.00027095067,0.00011182098,0.00054935564,0.000076604156,0.00025467435,0.000371889,0.00035302603,0.0000066957627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042107358,0.00028436453,0.008468059,0.0026433277,0.000099906545,0.00008298087,0.0003790275,0.5251958,0.14488585,0.01133362,0.037454344,0.26875168],"study_design_scores_gemma":[0.000214475,0.0006214033,0.0000889489,0.00011814244,0.0000047174844,0.000023303193,0.00001101321,0.7880685,0.20961279,0.00016043078,0.000850475,0.00022583887],"about_ca_topic_score_codex":0.00000734257,"about_ca_topic_score_gemma":6.7998496e-7,"teacher_disagreement_score":0.7733904,"about_ca_system_score_codex":0.00009055107,"about_ca_system_score_gemma":0.000049616072,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W3091803291","doi":"10.1109/dls51937.2020.00008","title":"Towards a Scalable and Distributed Infrastructure for Deep Learning Applications","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Deep learning; Scalability; Python (programming language); Concurrency; Deep neural networks; Artificial neural network; Multithreading; Scripting language","score_opus":0.011153809024992911,"score_gpt":0.24592373517426397,"score_spread":0.23476992614927106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091803291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000095213516,0.00006155456,0.9956793,0.0022285318,0.0000086773425,0.0002011924,0.0000022022457,0.00067643984,0.0010468722],"genre_scores_gemma":[0.25778195,0.000015787733,0.74145204,0.00060260535,0.00003192555,0.00004900277,0.000015375099,0.0000040494924,0.00004725421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995078,0.000013973684,0.00009555701,0.00021487258,0.000058085097,0.00010970387],"domain_scores_gemma":[0.9996815,0.000033078235,0.0000361832,0.00010138422,0.00006653322,0.000081355945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058544654,0.00006323344,0.000079914644,0.000019430761,0.00014486162,0.00011915476,0.00024718553,0.000035747464,0.0000055367227],"category_scores_gemma":[0.000048542097,0.000056693403,0.000019927073,0.00023775193,0.00001589189,0.00011143966,0.00014255235,0.00006939994,0.000002223674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012757707,0.00003157023,0.0021668337,0.000100176265,0.000032337346,9.4282626e-7,0.0012419858,0.14023848,0.00043983295,0.290904,0.016110614,0.5487205],"study_design_scores_gemma":[0.0001201302,0.000044086977,0.00038561397,0.0000017267081,0.000002010974,0.000001795619,0.0000137256275,0.9439436,0.00048800177,0.0044530476,0.050467644,0.000078582154],"about_ca_topic_score_codex":0.0000023740718,"about_ca_topic_score_gemma":2.2198135e-7,"teacher_disagreement_score":0.80370516,"about_ca_system_score_codex":0.0000078761705,"about_ca_system_score_gemma":0.000018869352,"threshold_uncertainty_score":0.231189},"labels":[],"label_agreement":null},{"id":"W3092300773","doi":"10.1002/spe.2907","title":"Practical dynamic reconstruction of control flow graphs","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Executable; Computer science; Debugging; Spec#; Programming language; Control flow graph; Dataflow; Control flow; Symbolic execution; Static analysis; Machine code; Scripting language; Binary number; Data-flow analysis; Control flow analysis; Code (set theory); Theoretical computer science; Compiler; Data flow diagram; Software; Arithmetic; Programming paradigm; Declarative programming","score_opus":0.01764990418475308,"score_gpt":0.2980036989792894,"score_spread":0.2803537947945363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092300773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034969558,0.00018274094,0.9901022,0.00546424,0.00010911939,0.00010661547,0.0000014101022,0.0003377437,0.0001990043],"genre_scores_gemma":[0.44840202,0.00013858502,0.5503592,0.0010758738,0.000009199887,0.000008195095,4.739911e-7,0.0000033521355,0.0000031246761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989905,0.00011654067,0.00023122865,0.00032713456,0.00018773877,0.00014690773],"domain_scores_gemma":[0.9988298,0.00045911947,0.00020961805,0.00021531647,0.0001721,0.00011408315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001871524,0.00010087114,0.00015466218,0.00004257677,0.00011051288,0.00008690783,0.00023545901,0.0000579102,0.000007480581],"category_scores_gemma":[0.0020945577,0.00009697256,0.00003436543,0.00031144393,0.00011067259,0.0014936657,0.000101718106,0.00015208792,0.000005067795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006542108,0.00050286803,0.007968256,0.00022160198,0.00017838743,0.00016658194,0.059275974,0.004458285,0.0032106682,0.05412954,0.00398919,0.86524445],"study_design_scores_gemma":[0.0009101283,0.00060386414,0.00045073385,0.000060867293,0.000034969114,0.0006489,0.0017690781,0.9833658,0.0025382163,0.0030724278,0.0060694655,0.0004755562],"about_ca_topic_score_codex":0.000010705848,"about_ca_topic_score_gemma":3.214763e-7,"teacher_disagreement_score":0.9789075,"about_ca_system_score_codex":0.000009145886,"about_ca_system_score_gemma":0.000063739004,"threshold_uncertainty_score":0.3954426},"labels":[],"label_agreement":null},{"id":"W3092504998","doi":"10.1109/dac18072.2020.9218728","title":"Late Breaking Results: Building an On-Chip Deep Learning Memory Hierarchy Brick by Brick","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Memory footprint; Computer science; Chip; Footprint; Energy consumption; Lossless compression; Memory hierarchy; Embedded system; Data compression; Artificial intelligence; Engineering; Parallel computing; Electrical engineering; Operating system; Geology; Telecommunications","score_opus":0.020470912358895046,"score_gpt":0.26033190459719757,"score_spread":0.23986099223830254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092504998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013001102,0.00009543637,0.96741784,0.0025794927,0.00008864439,0.0001248579,0.000001290214,0.0026129317,0.014078428],"genre_scores_gemma":[0.65288067,0.00003554111,0.34236565,0.0039722654,0.0001284005,0.000004305482,0.000011546467,0.000024062878,0.00057753327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978522,0.00024236087,0.00038697515,0.00075994164,0.00035067947,0.0004078421],"domain_scores_gemma":[0.9988574,0.00019663355,0.00017661849,0.00042436342,0.00008634809,0.00025866888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985693,0.00022036307,0.00022496878,0.00012027844,0.0003466817,0.0004072862,0.0011150271,0.00008808936,0.000012829967],"category_scores_gemma":[0.00023928357,0.00021527633,0.00007226376,0.0006756894,0.00003403438,0.0005403447,0.0003674252,0.00042548505,0.000046124682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102385806,0.00017055582,0.00039961742,0.000034378845,0.00005162481,0.00007187717,0.006669048,0.59022725,0.004302177,0.013742032,0.021842835,0.3623862],"study_design_scores_gemma":[0.00040089714,0.00031353874,0.0001226462,0.000029454495,0.000003137587,0.000008037262,0.000026773983,0.9836772,0.0056453655,0.0004027669,0.009034325,0.00033582596],"about_ca_topic_score_codex":0.000086604334,"about_ca_topic_score_gemma":0.0000017230622,"teacher_disagreement_score":0.6398796,"about_ca_system_score_codex":0.000042659616,"about_ca_system_score_gemma":0.000031795465,"threshold_uncertainty_score":0.8778714},"labels":[],"label_agreement":null},{"id":"W3094383542","doi":"","title":"Scalable Parallel DFPN Search","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scalability; Heuristics; Parallel computing; Domain (mathematical analysis); Transposition (logic); Parallel algorithm; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.019906809131584758,"score_gpt":0.26610858988248415,"score_spread":0.24620178075089938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094383542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036824006,0.000013870293,0.87751985,0.00094282744,0.00005980826,0.00004907169,4.8770158e-8,0.0009263431,0.12011996],"genre_scores_gemma":[0.28384888,0.0000074628515,0.71055806,0.0007539683,0.00003467486,0.0000038301414,7.0664277e-7,0.000004347767,0.0047880975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.0000730994,0.00011921475,0.00024363662,0.0001769852,0.0002207011],"domain_scores_gemma":[0.9993184,0.000062110834,0.000020648373,0.0004506674,0.00006889288,0.00007928225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000424032,0.00007362799,0.00008894933,0.00007169716,0.00010913621,0.00014629048,0.00071252906,0.000038666243,0.000037768805],"category_scores_gemma":[0.0000271593,0.00006239029,0.000031930053,0.00024869575,0.000021701508,0.00019468453,0.00022610038,0.000076697776,0.00024104665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020145455,0.00005661509,0.0008148507,0.0000076254964,0.000006268699,0.0000014573378,0.00014529136,0.030494839,0.00009741902,0.8756474,0.039140772,0.053585447],"study_design_scores_gemma":[0.00012240671,0.000044227192,0.00038739486,0.000004604034,4.922808e-7,0.0000041086105,0.0000017122957,0.9735669,0.0016600916,0.007293692,0.016802551,0.000111810725],"about_ca_topic_score_codex":0.000030122334,"about_ca_topic_score_gemma":0.0000011279608,"teacher_disagreement_score":0.9430721,"about_ca_system_score_codex":0.000011425176,"about_ca_system_score_gemma":0.000022110757,"threshold_uncertainty_score":0.30982473},"labels":[],"label_agreement":null},{"id":"W3100153641","doi":"","title":"AutoSync: Learning to Synchronize for Data-Parallel Distributed Deep Learning","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Distributed learning; Distributed computing; Parallel computing; Computer architecture","score_opus":0.03669615027792841,"score_gpt":0.28148668118525455,"score_spread":0.24479053090732614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100153641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041453226,0.00015342978,0.9946345,0.0016586762,0.00017696661,0.00053434534,0.000008824207,0.0020568224,0.0003618939],"genre_scores_gemma":[0.8756098,0.000005856545,0.1225098,0.0010149201,0.00015727872,0.000085382584,0.0005217494,0.000016207168,0.00007899822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821,0.000095833035,0.0006528606,0.0003494494,0.00034025798,0.00035161458],"domain_scores_gemma":[0.9985784,0.000087710425,0.00043994217,0.0003180673,0.00037807823,0.00019778595],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046550395,0.00020091154,0.00026190424,0.00011787382,0.0005721771,0.0014954356,0.0012698313,0.00008852826,0.0000017431197],"category_scores_gemma":[0.0006559049,0.00019390415,0.000040793104,0.00067064626,0.00001659035,0.0038911188,0.00042376952,0.00027237504,0.000052423624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142796935,0.00000593518,0.00010773854,0.0002778173,0.0000072643506,6.407308e-7,0.0024846848,0.92246634,0.000031762196,0.00061484985,0.0028147362,0.07117393],"study_design_scores_gemma":[0.00026493258,0.00013792845,0.00003354765,0.000064022264,0.000005192276,0.000011683565,0.00018938136,0.9241727,0.000049612394,0.000010710885,0.07483647,0.00022381982],"about_ca_topic_score_codex":0.000013873973,"about_ca_topic_score_gemma":3.143433e-7,"teacher_disagreement_score":0.87519526,"about_ca_system_score_codex":0.000058755508,"about_ca_system_score_gemma":0.000086643,"threshold_uncertainty_score":0.9995411},"labels":[],"label_agreement":null},{"id":"W3101982753","doi":"","title":"Quantifying the Effect of Matrix Structure on Multithreaded Performance of the SpMV Kernel","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Kernel (algebra); Parallel computing; Sparse matrix; Matrix (chemical analysis); Mathematics; Discrete mathematics","score_opus":0.02140943832622194,"score_gpt":0.2936849782469232,"score_spread":0.27227553992070125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101982753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5721433,0.00012862033,0.4236,0.00064218085,0.0008644959,0.0007936183,0.000012779534,0.0002849219,0.0015300724],"genre_scores_gemma":[0.97827643,0.000028992892,0.021271698,0.00004042141,0.00004190684,0.000008374463,0.0000010317697,0.000010533175,0.0003206205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850047,0.00025234863,0.00035552986,0.00035132078,0.00037204247,0.00016829443],"domain_scores_gemma":[0.9975134,0.00035263482,0.0005155186,0.0014953373,0.00010171395,0.000021401733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049982214,0.00023222728,0.00033118407,0.00007934175,0.00010870939,0.0000479772,0.002517159,0.00017657726,0.000007995366],"category_scores_gemma":[0.00007532335,0.0000925616,0.0001796055,0.00017495202,0.000110792644,0.00005700577,0.0014784588,0.0003888275,0.0000027704693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003535449,0.00014789545,0.10074993,0.0036376356,0.00049791485,0.0000028615225,0.0031158095,0.6996122,0.0136017,0.079076946,0.0070223664,0.0921812],"study_design_scores_gemma":[0.0003345816,0.0002372352,0.008193562,0.00093141984,0.000019034283,0.0000042656798,0.0000024543401,0.5602312,0.4287549,0.00096262747,0.00009162685,0.00023705489],"about_ca_topic_score_codex":0.000031799937,"about_ca_topic_score_gemma":0.0000023441878,"teacher_disagreement_score":0.4151532,"about_ca_system_score_codex":0.00002531856,"about_ca_system_score_gemma":0.000060697803,"threshold_uncertainty_score":0.467755},"labels":[],"label_agreement":null},{"id":"W3107081217","doi":"10.1002/spe.2925","title":"Advanced control‐flow and concurrency in C∀","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; POSIX Threads; Mutual exclusion; Programming language; Control flow; Concurrency control; Compiler; Synchronization (alternating current); Programmer; Concurrent object-oriented programming; Concurrent computing; Deadlock; Exception handling; Non-lock concurrency control; Distributed computing; Reactive programming; Distributed concurrency control; Programming paradigm; Thread (computing); Inductive programming","score_opus":0.01409728627202044,"score_gpt":0.2831058411201934,"score_spread":0.26900855484817293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107081217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00937776,0.0015545023,0.98429734,0.0040260553,0.000057768,0.00011663045,8.5554854e-7,0.00029413414,0.00027497526],"genre_scores_gemma":[0.65579236,0.0004114449,0.34034032,0.0034154402,0.000014025051,0.000017318987,4.203798e-7,0.0000033285394,0.000005355046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914896,0.00007075859,0.00015652213,0.000349928,0.00011393789,0.00015990449],"domain_scores_gemma":[0.99928135,0.00032757307,0.000079946025,0.00014194139,0.00005811136,0.00011109336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013365917,0.000096394484,0.00012969613,0.000031282438,0.00008575197,0.0001235271,0.00022820542,0.000036449397,0.0000029550151],"category_scores_gemma":[0.0012457926,0.0000940172,0.000011017536,0.00023346065,0.000059017133,0.0012569409,0.00014299346,0.00013085558,0.000003583463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019681307,0.00015155537,0.017136073,0.0000802723,0.000017573639,0.00017037967,0.09512536,0.0034392437,0.00052592246,0.013571464,0.0009988644,0.8685865],"study_design_scores_gemma":[0.003675742,0.0008481583,0.004247752,0.00014036593,0.000014413513,0.00017280212,0.003055922,0.90887016,0.0013719362,0.0023934979,0.07412001,0.0010892652],"about_ca_topic_score_codex":0.000012984547,"about_ca_topic_score_gemma":6.344366e-7,"teacher_disagreement_score":0.9054309,"about_ca_system_score_codex":0.0000071811724,"about_ca_system_score_gemma":0.000030046289,"threshold_uncertainty_score":0.38339102},"labels":[],"label_agreement":null},{"id":"W3107243966","doi":"10.1109/ccece47787.2020.9255748","title":"Learning-Based Reconfigurable Cache for Heterogeneous Chip Multiprocessors","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Control reconfiguration; Parallel computing; Cache algorithms; Latency (audio); Energy consumption; Computer architecture; Embedded system; Cache pollution; Multiprocessing; Smart Cache; Chip; CPU cache","score_opus":0.032106485352916624,"score_gpt":0.25877852059985934,"score_spread":0.2266720352469427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107243966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012049743,0.000041502983,0.9915437,0.002980034,0.000044433913,0.00020107327,7.016989e-7,0.0015064446,0.0024771248],"genre_scores_gemma":[0.7118095,0.0000030610036,0.2850845,0.0026298633,0.000035590783,0.00002848803,0.000005041157,0.000010444846,0.00039348842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991216,0.000040851417,0.00016908563,0.000351664,0.00010332685,0.00021346037],"domain_scores_gemma":[0.9994312,0.00010635617,0.00007486602,0.00017186013,0.000101344696,0.00011439405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000143119,0.00011283912,0.00013306653,0.000039788236,0.00015117835,0.00012062915,0.00054528384,0.0000543789,0.000021687945],"category_scores_gemma":[0.00016984963,0.0001033246,0.00007208944,0.00021575682,0.000014028958,0.000108136155,0.00003494876,0.00009847153,0.000025625868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017353941,0.00003377119,0.00016677484,0.000041877614,0.000010894101,0.0000026532962,0.0004126873,0.9791248,0.00035178484,0.0008519742,0.003443614,0.0155418115],"study_design_scores_gemma":[0.00027541464,0.00023198931,0.0000064868655,0.000005293629,0.0000018540228,0.0000015393787,0.000004623451,0.931002,0.057327308,0.00016482902,0.010837583,0.00014105513],"about_ca_topic_score_codex":0.000008520828,"about_ca_topic_score_gemma":0.0000010590751,"teacher_disagreement_score":0.71060455,"about_ca_system_score_codex":0.000012221908,"about_ca_system_score_gemma":0.000054949967,"threshold_uncertainty_score":0.4213455},"labels":[],"label_agreement":null},{"id":"W3107936220","doi":"10.1109/pdcat.2009.87","title":"Balanced Dense Polynomial Multiplication on Multi-Cores","year":2009,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Science Foundation","keywords":"Speedup; Multiplication (music); Matrix multiplication; Computer science; Parallel computing; Computation; Multiplication algorithm; Univariate; Fast Fourier transform; Bivariate analysis; Polynomial; Algorithm; Arithmetic; Mathematics; Multivariate statistics","score_opus":0.020841277886534067,"score_gpt":0.2799358269007453,"score_spread":0.25909454901421125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107936220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006215351,0.000013677717,0.9864842,0.0013347273,0.00007434752,0.00011784507,2.7877215e-7,0.0011343159,0.0046252254],"genre_scores_gemma":[0.61008096,0.000005991541,0.38801855,0.0013789901,0.00002901989,0.0000033268798,0.0000014596513,0.00000227823,0.00047942725],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.00003126263,0.00014175157,0.00027650548,0.00011700233,0.00015496796],"domain_scores_gemma":[0.99939185,0.0000381192,0.000054538847,0.00040906295,0.000051749517,0.000054666536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001023944,0.00009372928,0.00008565155,0.00008495903,0.00009220699,0.00008695589,0.00045687414,0.0000477814,0.000004507242],"category_scores_gemma":[0.000038261922,0.00008103239,0.00003680762,0.00017556568,0.000011173839,0.00014201907,0.000039550498,0.00006703562,0.000065320026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000977875,0.0013414976,0.0021539105,0.0000072684375,0.000022437576,0.000017594713,0.0011387323,0.05081466,0.020485768,0.11858001,0.10409372,0.7012466],"study_design_scores_gemma":[0.00046079588,0.00015461218,0.020027807,0.000009463506,9.316537e-7,0.0000038948506,0.0000019245322,0.9528186,0.024473393,0.00045784723,0.001415498,0.00017527494],"about_ca_topic_score_codex":0.000010328725,"about_ca_topic_score_gemma":0.0000012872661,"teacher_disagreement_score":0.9020039,"about_ca_system_score_codex":0.000025690466,"about_ca_system_score_gemma":0.000017417737,"threshold_uncertainty_score":0.3304405},"labels":[],"label_agreement":null},{"id":"W3108022219","doi":"10.1145/3400286.3418248","title":"Overheating-Avoidance Remapping Scheme for Reliability Enhancement of 3D PCM Storage Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Overheating (electricity); Phase-change memory; Computer science; Embedded system; Computer data storage; Computer hardware; Phase change; Engineering; Electrical engineering","score_opus":0.028317535739856854,"score_gpt":0.2646215286221807,"score_spread":0.23630399288232384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108022219","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036994794,0.00011338295,0.9920885,0.0007380914,0.00011359802,0.00044715416,0.000001835927,0.00045186916,0.0023460663],"genre_scores_gemma":[0.3862131,0.0000066176776,0.61330247,0.00024225687,0.000037888487,0.000027531994,0.000001469415,0.000004875498,0.00016377715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873036,0.00005648633,0.00041223777,0.00039873828,0.00021552709,0.00018665363],"domain_scores_gemma":[0.99893314,0.0001364634,0.00020599767,0.00043094868,0.00022148665,0.0000719843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049332104,0.00011320129,0.00023119892,0.000031964686,0.000087256594,0.000060982686,0.00056048075,0.000039162693,0.000005128656],"category_scores_gemma":[0.0002606914,0.00010580489,0.000056351368,0.0002678827,0.000024549207,0.00019404646,0.00019320149,0.00007252613,0.0000036158685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015264397,0.0006992951,0.003238817,0.0044492004,0.00012532037,0.0000072083994,0.00685723,0.54763484,0.08710968,0.27753332,0.06135824,0.010834215],"study_design_scores_gemma":[0.00017930477,0.00016087503,0.000027584436,0.00008440226,0.0000015777456,7.12021e-7,0.000015846521,0.98174906,0.015171881,0.00016441024,0.002318394,0.00012594926],"about_ca_topic_score_codex":0.000020491385,"about_ca_topic_score_gemma":2.1591678e-7,"teacher_disagreement_score":0.43411422,"about_ca_system_score_codex":0.000042648928,"about_ca_system_score_gemma":0.000057089146,"threshold_uncertainty_score":0.4314598},"labels":[],"label_agreement":null},{"id":"W3108779999","doi":"10.1145/3426422.3426980","title":"DelayRepay: delayed execution for kernel fusion in Python","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Python (programming language); Computer science; Programming language; Parallel computing; CUDA; Operating system; Computational science","score_opus":0.025703567666808317,"score_gpt":0.2684383783499196,"score_spread":0.2427348106831113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108779999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003996678,0.000044288503,0.99084854,0.0022319607,0.000060584774,0.00022148406,6.8908554e-7,0.00078085385,0.0018148915],"genre_scores_gemma":[0.50523424,0.000013941344,0.49309236,0.0014887609,0.000024369427,0.00001691277,0.0000049607524,0.0000055140763,0.00011893598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992331,0.000031596104,0.00019159087,0.0002873331,0.00010027887,0.00015609435],"domain_scores_gemma":[0.99961764,0.000045770736,0.000048720016,0.00016777367,0.0000559999,0.000064103246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001691514,0.000080070065,0.00009978154,0.000059106,0.00005319096,0.00005734477,0.0003477303,0.000053770975,0.000005537544],"category_scores_gemma":[0.00005188054,0.00007438965,0.000041883606,0.0003237475,0.000007935921,0.00019665941,0.0001349789,0.000059079834,0.000011984148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003946769,0.00047593273,0.0026262861,0.00013129548,0.000045077446,0.000045427245,0.008643583,0.17305458,0.015326213,0.35687298,0.20953181,0.23285215],"study_design_scores_gemma":[0.00028258626,0.00012851396,0.00026365375,0.0000064847964,0.0000010457005,0.0000018052433,0.000008631294,0.99043924,0.0028611412,0.0024865374,0.0034122483,0.00010813794],"about_ca_topic_score_codex":0.000030462908,"about_ca_topic_score_gemma":0.000005817256,"teacher_disagreement_score":0.81738466,"about_ca_system_score_codex":0.000024218094,"about_ca_system_score_gemma":0.00002947849,"threshold_uncertainty_score":0.30335218},"labels":[],"label_agreement":null},{"id":"W3109527654","doi":"10.1109/vlsitechnology18217.2020.9265100","title":"ExaNoDe: Combined Integration of Chiplets on Active Interposer with Bare Dice in a Multi-Chip-Module for Heterogeneous and Scalable High Performance Compute Nodes","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche","keywords":"Scalability; Computer science; Modular design; Interposer; Dice; Node (physics); Computer architecture; Field-programmable gate array; Context (archaeology); Parallel computing; Supercomputer; Chip; Efficient energy use; Routing (electronic design automation); Embedded system; Computational science; Engineering; Materials science; Electrical engineering; Nanotechnology; Operating system; Layer (electronics)","score_opus":0.032169098843495586,"score_gpt":0.2678285027556492,"score_spread":0.2356594039121536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109527654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29755092,0.000022090575,0.70102686,0.00025893084,0.00008988893,0.00071691995,0.000015406325,0.00023745949,0.00008151026],"genre_scores_gemma":[0.6416054,0.00003074669,0.35801896,0.00017089464,0.0000113549195,0.00007535495,0.000043524415,0.000017065737,0.000026718773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981983,0.00009885498,0.0004299748,0.0008149483,0.0002200893,0.00023783452],"domain_scores_gemma":[0.9987913,0.00014531786,0.00023925764,0.0005121707,0.0002311722,0.000080792626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018653923,0.00036007186,0.00055333,0.00024675613,0.00007161914,0.00014366866,0.0007275128,0.00018080494,0.0000019692382],"category_scores_gemma":[0.00003805773,0.00029597493,0.00006061694,0.00023182259,0.000070087925,0.00020102573,0.00080377003,0.00039391438,0.0000010849345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00202765,0.0013965047,0.0034387065,0.001635145,0.00030239834,0.000020267302,0.006776398,0.9012288,0.0018002135,0.0072847907,0.00031950988,0.07376961],"study_design_scores_gemma":[0.0011034663,0.00081987306,0.005281671,0.0007125497,0.000009321698,0.0000046986584,0.000010634671,0.943046,0.048231658,0.00045760733,0.0000074493532,0.00031507862],"about_ca_topic_score_codex":0.00014641523,"about_ca_topic_score_gemma":0.000053124175,"teacher_disagreement_score":0.34405446,"about_ca_system_score_codex":0.000078426216,"about_ca_system_score_gemma":0.000091210764,"threshold_uncertainty_score":0.9999492},"labels":[],"label_agreement":null},{"id":"W3110465280","doi":"10.1109/mic.2020.3026245","title":"Rethinking Divide and Conquer—Towards Holistic Interfaces of the Computing Stack","year":2020,"lang":"en","type":"article","venue":"IEEE Internet Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Divide and conquer algorithms; Stack (abstract data type); Interface (matter); Distributed computing; Architecture; Resilience (materials science); Extensibility; Supercomputer; Computer architecture; Operating system; Programming language","score_opus":0.06171610226848376,"score_gpt":0.2899511092772362,"score_spread":0.22823500700875246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110465280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.320368,0.00013016713,0.67713326,0.0008617876,0.00043976825,0.00012985278,0.0000012379363,0.00036722285,0.0005687383],"genre_scores_gemma":[0.94469017,0.0000052764067,0.053898968,0.0012046857,0.00015093444,6.403061e-7,7.4597654e-7,0.0000175191,0.00003103541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979287,0.00024718553,0.0006154591,0.000538867,0.000342046,0.00032778108],"domain_scores_gemma":[0.9985081,0.00033478375,0.00047564151,0.00039625648,0.00017380569,0.00011142948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056098436,0.00024413693,0.00036688734,0.000073653726,0.00016079388,0.0002774755,0.0016415237,0.00008651211,0.0000037990176],"category_scores_gemma":[0.00028387224,0.00019718763,0.000092856244,0.00041584126,0.00017755471,0.00018973564,0.0015623267,0.00042369435,0.000006052858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010201147,0.0002972098,0.044910513,0.0014721052,0.0006059958,0.00014047156,0.18519562,0.30599838,0.008750225,0.072830684,0.021096284,0.3586005],"study_design_scores_gemma":[0.00023334935,0.00009648097,0.001313161,0.00040643796,0.000010299564,0.000031797423,0.000042896514,0.97312236,0.022547817,0.0016958035,0.00026804907,0.00023152093],"about_ca_topic_score_codex":0.000089313726,"about_ca_topic_score_gemma":0.0000027978688,"teacher_disagreement_score":0.667124,"about_ca_system_score_codex":0.000036278634,"about_ca_system_score_gemma":0.00006084881,"threshold_uncertainty_score":0.80410784},"labels":[],"label_agreement":null},{"id":"W3111941241","doi":"10.48550/arxiv.2012.06281","title":"Trash Talk: Accelerating Garbage Collection on Integrated GPUs is Worthless","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Garbage collection; Computer science; Garbage; Programmer; Embedded system; Variety (cybernetics); Mobile device; Task (project management); Memory bandwidth; Parallel computing; Computer architecture; Operating system; Programming language; Systems engineering","score_opus":0.09747982097487073,"score_gpt":0.20904691112793847,"score_spread":0.11156709015306773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111941241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056727152,0.000016657144,0.9325453,0.000371473,0.0004689967,0.0003373172,0.000010519299,0.0014524197,0.008070141],"genre_scores_gemma":[0.97821987,0.00011005997,0.018973593,0.0006495826,0.000072031,0.0000019796996,0.000029509602,0.000024577865,0.0019188266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977702,0.00019757514,0.00027267856,0.0013162335,0.00013002621,0.0003132933],"domain_scores_gemma":[0.99834394,0.00009256031,0.00033376855,0.0008458734,0.00021432001,0.00016951094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018965143,0.00038154848,0.00037906776,0.0003404928,0.00032024094,0.00034894876,0.0016197053,0.00045483414,0.000038976556],"category_scores_gemma":[0.00005273708,0.00044313943,0.00020690764,0.0013445419,0.000054018332,0.00025071102,0.001091183,0.001236813,0.000045214027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010318547,0.00027738983,0.0012598267,0.00011988954,0.0002016005,0.0005908947,0.001588313,0.9039146,0.00014353669,0.06762548,0.019919684,0.0042556482],"study_design_scores_gemma":[0.0003017613,0.00010784211,0.00024681215,0.00015589691,0.000023143497,0.0000037641291,0.0000380708,0.9880834,0.0017941133,0.008046504,0.0007271067,0.0004715904],"about_ca_topic_score_codex":0.00014279946,"about_ca_topic_score_gemma":0.000022246462,"teacher_disagreement_score":0.9214927,"about_ca_system_score_codex":0.00027841146,"about_ca_system_score_gemma":0.00024613302,"threshold_uncertainty_score":0.99980205},"labels":[],"label_agreement":null},{"id":"W3113922003","doi":"10.1109/pesgm41954.2020.9281598","title":"Adaptive Time-Stepping Universal Line and Machine Models for Real-Time and Faster-Than-Real-Time Hardware Emulation","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Emulation; Computer science; Embedded system; Universal Time; Line (geometry); Computer hardware; Field-programmable gate array; Time stepping; Stepping stone; Hardware emulation; Real-time computing; Engineering","score_opus":0.033647335530916,"score_gpt":0.2464236717033271,"score_spread":0.2127763361724111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113922003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039644754,0.0000376116,0.9895923,0.000982493,0.000015029936,0.000383429,0.000020131225,0.0008514326,0.0041530756],"genre_scores_gemma":[0.20105046,0.00010494222,0.7951722,0.0002995481,0.00008292533,0.000007906098,0.0000604551,0.00002779141,0.0031937566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885815,0.000063568994,0.00022793231,0.00049571553,0.00014316209,0.00021147414],"domain_scores_gemma":[0.9992515,0.00014832574,0.000111988025,0.00019648866,0.00013587509,0.00015583324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016150397,0.00018986872,0.00025734145,0.00009327446,0.00016586593,0.00014526959,0.00025372437,0.00008133597,0.000015399008],"category_scores_gemma":[0.00002180915,0.00018227758,0.000042754436,0.00020060636,0.000036216472,0.00060543395,0.0002988593,0.00007147182,0.0000135699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044359514,0.00014956188,0.00014209037,0.00014444717,0.00020573863,0.00002439502,0.007956622,0.87609017,0.01895584,0.022663027,0.007370047,0.0658545],"study_design_scores_gemma":[0.0005164788,0.00031542048,0.00004991674,0.00003059337,0.000012342695,0.0000043802174,0.000013239091,0.9971032,0.00083444023,0.0008219454,0.000080648606,0.00021738108],"about_ca_topic_score_codex":0.000091578826,"about_ca_topic_score_gemma":0.000002131024,"teacher_disagreement_score":0.19708599,"about_ca_system_score_codex":0.000024972176,"about_ca_system_score_gemma":0.000033702083,"threshold_uncertainty_score":0.7433064},"labels":[],"label_agreement":null},{"id":"W3114172975","doi":"10.1109/rtss49844.2020.00029","title":"The Best of All Worlds: Improving Predictability at the Performance of Conventional Coherence with No Protocol Modifications","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Cache coherence; Coherence (philosophical gambling strategy); Predictability; Correctness; Protocol (science); Distributed computing; Avionics; MESIF protocol; Architecture; Embedded system; Real-time computing; Computer network; Cache; CPU cache; Algorithm; Engineering","score_opus":0.026954238975677502,"score_gpt":0.26844546321870494,"score_spread":0.24149122424302744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114172975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017050965,0.0000115114,0.9586983,0.0022320275,0.000024340476,0.017492784,0.000004983226,0.0001860164,0.0042991075],"genre_scores_gemma":[0.91523457,0.0000026354314,0.07633395,0.0001374853,0.00001701506,0.007596188,0.0000017133231,0.0000045263405,0.00067193457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999098,0.00006259254,0.00030081344,0.00018831022,0.00024462971,0.00010567621],"domain_scores_gemma":[0.99882716,0.00014871583,0.000247813,0.0004233754,0.0003176492,0.000035297635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003420629,0.000071630944,0.000086506,0.0000116012125,0.0001852134,0.000034696423,0.00080077816,0.000019134377,0.000016374204],"category_scores_gemma":[0.00005787044,0.000036140475,0.000032284835,0.00023343757,0.00021989601,0.00013217819,0.00023814366,0.00007938951,0.0000061785504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018399806,0.002495824,0.26651594,0.0027265898,0.00050663133,0.0000022578406,0.009497782,0.38825476,0.03243779,0.1910181,0.032872517,0.07183183],"study_design_scores_gemma":[0.00021268982,0.0003387076,0.0015011609,0.000024485631,0.000003975427,0.000001313978,0.000016783875,0.9798605,0.016079249,0.00005037477,0.0018465883,0.00006417836],"about_ca_topic_score_codex":0.000022778459,"about_ca_topic_score_gemma":0.000008421447,"teacher_disagreement_score":0.8981836,"about_ca_system_score_codex":0.00001546051,"about_ca_system_score_gemma":0.00010691285,"threshold_uncertainty_score":0.14880584},"labels":[],"label_agreement":null},{"id":"W3115641744","doi":"10.1145/3445814.3446749","title":"SIMDRAM: a framework for bit-serial SIMD processing using DRAM","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dram; Computer science; Operand; SIMD; Parallel computing; Speedup; Overhead (engineering); Embedded system; Efficient energy use; Computer hardware; Engineering; Operating system","score_opus":0.05420915059371823,"score_gpt":0.3422242025966734,"score_spread":0.2880150520029552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115641744","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010131967,0.00034792535,0.99346566,0.00032787994,0.0013066721,0.0006157872,0.000003433794,0.0017221532,0.0011972853],"genre_scores_gemma":[0.063544415,0.000028711751,0.9351024,0.0005508112,0.0005185867,0.00006294193,0.000025826575,0.000037428727,0.00012887652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753577,0.00009522656,0.00051618996,0.0010779024,0.00032133123,0.00045360974],"domain_scores_gemma":[0.99782425,0.00018639166,0.00038382955,0.000997675,0.00049090973,0.000116930234],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042026903,0.00037801953,0.0005010058,0.00018998393,0.00031160485,0.0020780484,0.0015326663,0.00062046084,0.000010435146],"category_scores_gemma":[0.0002961291,0.0003818002,0.00024554585,0.00042089308,0.000045098346,0.0003139098,0.0021991576,0.0005892798,0.000001829025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032325202,0.00032811644,0.000055690638,0.001089056,0.000121095945,0.00002134466,0.0026006578,0.8294976,0.0003641834,0.053938843,0.0025745635,0.10937656],"study_design_scores_gemma":[0.00012711593,0.000035131216,0.0000038478993,0.00056414277,0.000017377999,0.000007580979,0.00002231025,0.941527,0.0022342696,0.054356456,0.0006280412,0.00047674615],"about_ca_topic_score_codex":0.00005119324,"about_ca_topic_score_gemma":0.000003742877,"teacher_disagreement_score":0.11202941,"about_ca_system_score_codex":0.00010707923,"about_ca_system_score_gemma":0.00082699675,"threshold_uncertainty_score":0.9998634},"labels":[],"label_agreement":null},{"id":"W3118725232","doi":"10.1109/tpds.2020.3048373","title":"Partitioning-Based Scheduling of OpenMP Task Systems With Tied Tasks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Processor scheduling; Parallel computing; Scheduling (production processes); Distributed computing; Task (project management); Task analysis; Operating system; Schedule","score_opus":0.02394696952466485,"score_gpt":0.23492347764144825,"score_spread":0.2109765081167834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118725232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020727094,0.00026871043,0.99579716,0.00044515613,0.0001991022,0.0004563772,0.0001262927,0.0004898577,0.0001446511],"genre_scores_gemma":[0.9852994,0.000019907691,0.014370989,0.00010836255,0.000028393242,0.00009742515,0.00003200469,0.000014728207,0.000028803384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00016048168,0.0004876715,0.00046221886,0.00033201126,0.00026275558],"domain_scores_gemma":[0.9988652,0.000107407956,0.00024438213,0.00036343266,0.00019377962,0.00022579262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020335283,0.0002344266,0.00040642126,0.0000991853,0.00025866352,0.00024914776,0.0003812698,0.000112329864,0.0000026834366],"category_scores_gemma":[0.00000788295,0.00020001877,0.000070185844,0.0005606947,0.000078178186,0.00024110734,0.000004501292,0.00019974033,0.000009335372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006837818,0.000082097264,0.00006667381,0.00012404128,0.0000457243,0.0000074460895,0.00012811758,0.9979714,0.00014183701,0.0009944575,0.0002464502,0.00012337763],"study_design_scores_gemma":[0.00093546306,0.0004140486,0.0000325883,0.00021387542,0.00002611759,0.000017309518,0.00010292382,0.9969391,0.00060310203,0.00001166405,0.0004494979,0.0002542768],"about_ca_topic_score_codex":0.000108758686,"about_ca_topic_score_gemma":0.0000029985922,"teacher_disagreement_score":0.98322666,"about_ca_system_score_codex":0.00003178678,"about_ca_system_score_gemma":0.00010676348,"threshold_uncertainty_score":0.81565285},"labels":[],"label_agreement":null},{"id":"W3118782677","doi":"10.1155/2021/8818788","title":"A Method for Run-Time Prediction of On-Chip Thermal Conditions in Dynamically Reconfigurable SOPCs","year":2021,"lang":"en","type":"article","venue":"International Journal of Reconfigurable Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Task (project management); Embedded system; Transient (computer programming); Field (mathematics); Power (physics); Die (integrated circuit); Set (abstract data type); Real-time computing","score_opus":0.019761692433794067,"score_gpt":0.3026732967534537,"score_spread":0.28291160431965967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118782677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038954712,0.000094473406,0.9506842,0.0015286631,0.000941338,0.00014798375,0.00003135729,0.00007038183,0.007546883],"genre_scores_gemma":[0.61198545,0.000033619686,0.38710654,0.00034655575,0.00022317025,0.0000042257957,0.000027328482,0.000016725511,0.0002563683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773955,0.00024143435,0.0010770694,0.00028831404,0.00041728417,0.00023634026],"domain_scores_gemma":[0.9961969,0.0010518247,0.00089876784,0.00022135105,0.0015535891,0.000077524375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014318833,0.00015998333,0.0003931161,0.00047091147,0.00008434785,0.00014480972,0.0009354596,0.000103080376,0.00007149989],"category_scores_gemma":[0.00043690883,0.0001619331,0.00023208451,0.00031875342,0.000029535662,0.00036925246,0.000050981434,0.0003096819,0.0000058188552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021169428,0.0008055816,0.001232329,0.00006826224,0.0005305099,0.00015524629,0.0011482912,0.7214839,0.086168095,0.034449633,0.003546528,0.15019996],"study_design_scores_gemma":[0.0013247543,0.00026590712,0.0016135073,0.0006209591,0.000012794221,0.00036292078,0.000042780477,0.93203133,0.055042926,0.0075452374,0.0009715439,0.00016532524],"about_ca_topic_score_codex":0.000009636768,"about_ca_topic_score_gemma":0.0000015232852,"teacher_disagreement_score":0.57303077,"about_ca_system_score_codex":0.00015097555,"about_ca_system_score_gemma":0.00035408334,"threshold_uncertainty_score":0.66034406},"labels":[],"label_agreement":null},{"id":"W3120587606","doi":"10.1145/3429440","title":"Reducing Energy in GPGPUs through Approximate Trivial Bypassing","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Register file; Parallel computing; General-purpose computing on graphics processing units; Exploit; Operand; Efficient energy use; Graphics processing unit; Energy consumption; Operating system; Graphics; Instruction set","score_opus":0.02612718248430757,"score_gpt":0.27582897298829,"score_spread":0.24970179050398245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120587606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029570023,0.0003905865,0.99120116,0.00034804767,0.0016511533,0.00015681161,0.0000027759993,0.0010961893,0.0021962884],"genre_scores_gemma":[0.7401594,0.00003746867,0.25915167,0.00019379525,0.00011495598,0.000018353701,0.0000069058497,0.000027749255,0.00028969158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967416,0.0005545647,0.0007888917,0.0009111718,0.00042737022,0.0005764108],"domain_scores_gemma":[0.9976307,0.00043874024,0.00024357266,0.0014086693,0.00018174252,0.00009656281],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005735334,0.0003168546,0.0004762553,0.00030177264,0.00044048912,0.0005288909,0.0010896993,0.00018410612,0.0000058179485],"category_scores_gemma":[0.000076888144,0.0003469842,0.00015848035,0.0015042578,0.000047388694,0.00043486353,0.00007257898,0.00040539965,0.000009660048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001156374,0.0002782833,0.000017310322,0.00005678951,0.00004724104,0.00009467531,0.0027198691,0.94332814,0.00083215,0.010920825,0.00028580142,0.04140732],"study_design_scores_gemma":[0.00070290663,0.00006499678,0.00001548466,0.0004730981,0.000009816446,0.00020878627,0.00024434258,0.9850732,0.010080237,0.0017819193,0.00092041946,0.00042477524],"about_ca_topic_score_codex":0.00044312436,"about_ca_topic_score_gemma":0.000014811359,"teacher_disagreement_score":0.7372024,"about_ca_system_score_codex":0.00026195802,"about_ca_system_score_gemma":0.00023123622,"threshold_uncertainty_score":0.9998982},"labels":[],"label_agreement":null},{"id":"W3124041911","doi":"10.1109/hpca51647.2021.00031","title":"SynCron: Efficient Synchronization Support for Near-Data-Processing Architectures","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache coherence; Synchronization (alternating current); Cache; Shared memory; Data synchronization; Multi-core processor; Embedded system; Leverage (statistics); Distributed computing; Parallel computing; CPU cache; Computer network; Cache algorithms; Wireless sensor network","score_opus":0.03108179201175694,"score_gpt":0.3041031678150307,"score_spread":0.2730213758032738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124041911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004642295,0.00057841756,0.99433494,0.00058210373,0.00061063777,0.00053662865,0.000019588333,0.0014550555,0.001418392],"genre_scores_gemma":[0.27287182,0.000019156045,0.7256044,0.000458962,0.00012413315,0.000046987137,0.0005958259,0.000026172156,0.00025251514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973634,0.000088391265,0.00047420192,0.0013287981,0.0003686143,0.00037662184],"domain_scores_gemma":[0.99723494,0.00010317042,0.00030049536,0.0018564251,0.00040539278,0.000099601544],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050918665,0.0003268772,0.00038069734,0.0001372365,0.00032707254,0.0017923639,0.002690029,0.00026034375,0.000026220396],"category_scores_gemma":[0.00015300783,0.00031266612,0.000117545234,0.0002921818,0.000060262653,0.00010558092,0.0043891794,0.00034982272,0.0000046207288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021876929,0.00006935952,0.000022626682,0.00029751612,0.000024010955,0.0000064787796,0.00037191616,0.83765686,0.0000061048536,0.00068572833,0.0031473665,0.15770985],"study_design_scores_gemma":[0.00012902578,0.000033909746,0.000036394063,0.00015356635,0.000018547187,0.00001720646,0.0000108267495,0.996794,0.0005039283,0.00047311457,0.0014536325,0.00037589215],"about_ca_topic_score_codex":0.000040825274,"about_ca_topic_score_gemma":0.000010835604,"teacher_disagreement_score":0.2724076,"about_ca_system_score_codex":0.000080314734,"about_ca_system_score_gemma":0.0010076961,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W3124823369","doi":"10.22215/etd/2014-10483","title":"Scalable Parallel Simulation of General Electrical Circuits","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scalability; Computer science; Multi-core processor; Parallel computing; Cloud computing; Computer engineering; Domain (mathematical analysis); Performance improvement; Distributed computing; Engineering","score_opus":0.015447369825752597,"score_gpt":0.2821240189957637,"score_spread":0.2666766491700111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124823369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013682767,0.00011651008,0.94333667,0.000019315088,0.00024129328,0.00017727849,4.934157e-7,0.00047769625,0.05426245],"genre_scores_gemma":[0.6500889,0.00006009499,0.31255358,0.00017872835,0.0001641315,0.00002367389,0.00026940624,0.000037017573,0.03662444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983749,0.0000903182,0.0004772874,0.00043694294,0.0003756699,0.00024487462],"domain_scores_gemma":[0.9986408,0.00011843346,0.0003476332,0.000499457,0.00032531115,0.00006841256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024405426,0.00021717051,0.00036447367,0.0002805539,0.00007776945,0.00008295739,0.00078958314,0.00029808466,0.000026466163],"category_scores_gemma":[0.000078488505,0.00020898956,0.0001231084,0.00046573445,0.00001141667,0.00015771571,0.00004448493,0.00018991441,0.000023843302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011999465,0.00011243835,0.00008702438,0.000086843575,0.00004036473,0.0000015149703,0.00019967784,0.8402719,0.00032900117,0.086879164,0.0073607205,0.06461936],"study_design_scores_gemma":[0.00015001181,0.00007982231,0.0004550065,0.000033902466,0.000009198876,8.3585405e-7,0.0000011189492,0.9913329,0.0030132087,0.003512922,0.0011701746,0.00024092544],"about_ca_topic_score_codex":0.00003995015,"about_ca_topic_score_gemma":0.0000060233783,"teacher_disagreement_score":0.6487206,"about_ca_system_score_codex":0.000034414723,"about_ca_system_score_gemma":0.00012413634,"threshold_uncertainty_score":0.85223466},"labels":[],"label_agreement":null},{"id":"W3125008876","doi":"10.1007/s10766-021-00691-5","title":"A Power-Aware Hybrid Cache for Chip-Multi Processors Based on Neural Network Prediction Technique","year":2021,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Artificial neural network; Parallel computing; Theory of computation; Branch predictor; Power (physics); Chip; Cache algorithms; Computer architecture; Smart Cache; Cache pollution; CPU cache; Embedded system; Artificial intelligence; Algorithm; Telecommunications","score_opus":0.021409134177746036,"score_gpt":0.2970786902296174,"score_spread":0.2756695560518714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125008876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090825796,0.0001566269,0.99559605,0.0017403414,0.0009073402,0.0003474067,0.0000067786223,0.0002241119,0.00011307984],"genre_scores_gemma":[0.46673724,0.000010769552,0.5324592,0.00038193355,0.00027301387,0.000056938596,0.000016125026,0.000014741493,0.000050009185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800825,0.00011416677,0.00063744246,0.00031768807,0.00062013,0.0003023231],"domain_scores_gemma":[0.9974536,0.00017020125,0.00059139275,0.00023057233,0.0014403902,0.00011388285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075212255,0.00019413266,0.00024008071,0.00022504007,0.00014440405,0.00035953548,0.0010521411,0.00007942177,0.000007405758],"category_scores_gemma":[0.00026178002,0.00018067108,0.00025294055,0.00027365764,0.000032210497,0.00041382344,0.00011893444,0.00032500396,0.0000013153392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020232933,0.00059719186,0.0015848731,0.00003356191,0.00015486835,0.000288335,0.00022459576,0.9373091,0.00019086897,0.0018493513,0.0030043847,0.054560576],"study_design_scores_gemma":[0.0011918383,0.00049652916,0.0002958155,0.00027605818,0.000012805585,0.00042725145,0.000017548262,0.9819045,0.0028796424,0.00089127396,0.011395307,0.00021140712],"about_ca_topic_score_codex":0.000002635639,"about_ca_topic_score_gemma":0.0000013880259,"teacher_disagreement_score":0.46582898,"about_ca_system_score_codex":0.00012372356,"about_ca_system_score_gemma":0.00026756796,"threshold_uncertainty_score":0.73675525},"labels":[],"label_agreement":null},{"id":"W3126960560","doi":"10.1145/3439803","title":"Gretch","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Speedup; Cache; Embedded system; Computer architecture; Parallel computing","score_opus":0.012528226448284595,"score_gpt":0.24269104803251423,"score_spread":0.23016282158422963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126960560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001667001,0.0001203613,0.9935804,0.004188937,0.00010879818,0.00008118249,0.000005367772,0.0004527182,0.0012955271],"genre_scores_gemma":[0.091755465,0.00030013602,0.9062434,0.001115777,0.000020408714,0.0000147217515,0.000011488382,0.000011974241,0.0005266332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908787,0.0000814177,0.00015602163,0.00036652148,0.00015219866,0.00015594426],"domain_scores_gemma":[0.9991154,0.00008982729,0.000043180156,0.0005758298,0.000102029706,0.00007371297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081169004,0.00012946155,0.00011686201,0.00012638906,0.00026014858,0.00014855264,0.00031771543,0.00007529713,0.00004450095],"category_scores_gemma":[0.000032279728,0.00012614827,0.000049766117,0.00046483034,0.000028223832,0.00015641625,0.00002316566,0.00018090481,0.0000048213496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004753746,0.000044631433,0.0000058541436,0.000005155178,0.000011421421,0.000005460234,0.00023574031,0.868294,0.00004743058,0.0011271167,0.00006457984,0.13015383],"study_design_scores_gemma":[0.00039918005,0.00010424647,0.000063226624,0.00003726719,0.00001610391,0.000131136,0.000018587223,0.9779966,0.008175994,0.009076154,0.0036940984,0.0002873904],"about_ca_topic_score_codex":0.0000024437413,"about_ca_topic_score_gemma":0.000009067341,"teacher_disagreement_score":0.12986644,"about_ca_system_score_codex":0.000014930627,"about_ca_system_score_gemma":0.000051351577,"threshold_uncertainty_score":0.5144177},"labels":[],"label_agreement":null},{"id":"W3127327396","doi":"10.1145/3379483","title":"User-level Threading","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Threading (protein sequence); Concurrency; Thread (computing); Scalability; Multithreading; POSIX Threads; Server; Concurrent object-oriented programming; Programming paradigm; Benchmark (surveying); Software; Distributed computing; Parallel computing; Operating system; Programming language; Reactive programming; Inductive programming","score_opus":0.07892585313572882,"score_gpt":0.26366466845526626,"score_spread":0.18473881531953745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127327396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4712177,0.00055398315,0.52094126,0.0042615137,0.00021451473,0.00046082088,0.000003863607,0.00038874953,0.001957618],"genre_scores_gemma":[0.9762587,0.000010369037,0.023532402,0.00013658691,0.000040146937,0.00000154571,3.2053754e-7,0.000006452573,0.000013511563],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812883,0.00002840704,0.00052835466,0.00034050443,0.00080680434,0.00016711868],"domain_scores_gemma":[0.99817276,0.00006962855,0.0006879518,0.00036478275,0.0006341194,0.00007078045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012651648,0.00015410071,0.0004960303,0.00023103891,0.00014143805,0.00013176691,0.0021069369,0.00004519078,3.163637e-7],"category_scores_gemma":[0.0006875103,0.00011143528,0.0001987507,0.0015218257,0.000041222742,0.00012662527,0.0007705897,0.00010737819,3.8971365e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012202684,0.00046934318,0.4077752,0.0020102023,0.0074776975,0.0000010643311,0.014347477,0.21694978,0.08680941,0.23632534,0.015334989,0.012377487],"study_design_scores_gemma":[0.0002528713,0.00014909705,0.01371313,0.0004129341,0.00035965192,0.0000010047878,0.00013308179,0.9665176,0.01776191,0.00034014712,0.00014212896,0.00021640847],"about_ca_topic_score_codex":0.000018181077,"about_ca_topic_score_gemma":2.699777e-7,"teacher_disagreement_score":0.74956787,"about_ca_system_score_codex":0.00002778318,"about_ca_system_score_gemma":0.000020358191,"threshold_uncertainty_score":0.45441988},"labels":[],"label_agreement":null},{"id":"W3128328316","doi":"","title":"De l'énergie plein son bac | ICI radio-canada.ca","year":2015,"lang":"fr","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geology","score_opus":0.03824436008317331,"score_gpt":0.26384465884500985,"score_spread":0.22560029876183654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128328316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00083113817,0.0030327209,0.88668966,0.014110902,0.0015954991,0.00012326955,0.0000038494854,0.00044185045,0.09317108],"genre_scores_gemma":[0.16429082,0.00019420726,0.6879254,0.004475042,0.0005838674,0.000010636593,0.00001049688,0.000033543525,0.142476],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977667,0.00024929098,0.00035969017,0.00046662276,0.00046650734,0.0006912322],"domain_scores_gemma":[0.99832696,0.00010992411,0.00012342345,0.00061773026,0.00027689783,0.0005450538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007628972,0.0002505298,0.000263665,0.00008800537,0.000150176,0.0003544205,0.0010174587,0.00016174043,0.00025567386],"category_scores_gemma":[0.0001646541,0.0002610247,0.000066543435,0.0005128656,0.00008246942,0.00035960635,0.00033783817,0.00024670077,0.00011944936],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049119926,0.000060960763,0.00018599798,0.000014858578,0.000018510758,0.000059686336,0.0005549144,0.06361971,0.000013213948,0.064442575,0.8524316,0.018593062],"study_design_scores_gemma":[0.00024007309,0.00007961038,0.00014543108,0.00003878341,0.0000072183843,0.00005741203,0.000038817925,0.6309474,0.0013299073,0.0026475126,0.3642037,0.000264118],"about_ca_topic_score_codex":0.309483,"about_ca_topic_score_gemma":0.042959783,"teacher_disagreement_score":0.5673277,"about_ca_system_score_codex":0.00057989144,"about_ca_system_score_gemma":0.0035038996,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W3130123519","doi":"10.1145/3431920.3439305","title":"Interactive Debugging at IP Block Interfaces in FPGAs","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Debugging; Debugger; Field-programmable gate array; Computer science; Block (permutation group theory); Embedded system; Background debug mode interface; Controllability; Operating system; Computer architecture","score_opus":0.013914143625870304,"score_gpt":0.2676358709090515,"score_spread":0.2537217272831812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130123519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038395703,0.00021455874,0.9272136,0.0014499598,0.00018376017,0.0000564,2.11443e-7,0.00063806964,0.031847704],"genre_scores_gemma":[0.83645093,0.00001935841,0.16061603,0.0004469262,0.000011523103,0.000004165808,9.3155535e-7,0.000004034736,0.0024460866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919105,0.00007315156,0.00016998651,0.00029810818,0.00010041644,0.00016732037],"domain_scores_gemma":[0.99947226,0.00009969284,0.000044781045,0.0002733728,0.00007326417,0.000036640402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001222669,0.000085436535,0.00011111234,0.00009695069,0.000054494783,0.00011162499,0.0003661043,0.000033799024,0.000047553982],"category_scores_gemma":[0.000055564262,0.00008077007,0.000028998691,0.00034118354,0.000013031003,0.00025738022,0.00062409905,0.00010421658,0.00004535162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111367575,0.0016893345,0.031436745,0.00013674739,0.00029597725,0.0016258337,0.034879737,0.2793316,0.026167173,0.10470358,0.0970037,0.4226182],"study_design_scores_gemma":[0.0002505609,0.00003461038,0.0012991298,0.00008763693,0.0000018085024,0.0000813258,0.000072058625,0.7803874,0.21161032,0.0021239708,0.0038085096,0.00024267304],"about_ca_topic_score_codex":0.000028082912,"about_ca_topic_score_gemma":0.000082011626,"teacher_disagreement_score":0.79805523,"about_ca_system_score_codex":0.000082717,"about_ca_system_score_gemma":0.000043138185,"threshold_uncertainty_score":0.3293708},"labels":[],"label_agreement":null},{"id":"W3132370594","doi":"10.1145/3431920.3439284","title":"Demystifying the Memory System of Modern Datacenter FPGAs for Software Programmers through Microbenchmarking","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Field-programmable gate array; Computer science; Software; Cloud computing; Embedded system; Operating system; Computer architecture","score_opus":0.033897143979641414,"score_gpt":0.27738912685760575,"score_spread":0.24349198287796434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132370594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003106325,0.00060665066,0.9964481,0.00050540286,0.00018856363,0.00029413946,0.0000036769939,0.0004542433,0.0011886037],"genre_scores_gemma":[0.21352968,0.000011440843,0.7859156,0.00026595456,0.000027664177,0.000029647668,0.000012977444,0.000009016161,0.00019798713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892205,0.00007774983,0.00027696794,0.0003340175,0.00015557364,0.00023364066],"domain_scores_gemma":[0.99884945,0.00017522996,0.00013550455,0.00059609377,0.00021667105,0.00002704588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033635917,0.00011261642,0.0001653529,0.000028115448,0.00019588789,0.00014785399,0.00074474583,0.00004712519,0.0000026661914],"category_scores_gemma":[0.000059926708,0.00008112557,0.00009595594,0.00024471694,0.000033891607,0.00025365074,0.00037907355,0.00007307579,0.0000011502912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048754115,0.00047610106,0.0013735824,0.0025038742,0.00047633747,0.000045322413,0.012570274,0.14332052,0.005991566,0.1822671,0.036189724,0.61473686],"study_design_scores_gemma":[0.00036562467,0.00003557076,0.000021424758,0.00026149378,0.000019840008,0.000059741466,0.00032231674,0.9420546,0.048898634,0.0024559398,0.0052724862,0.0002322846],"about_ca_topic_score_codex":0.000016883105,"about_ca_topic_score_gemma":0.0000048635006,"teacher_disagreement_score":0.7987341,"about_ca_system_score_codex":0.00003290519,"about_ca_system_score_gemma":0.000082884035,"threshold_uncertainty_score":0.33082044},"labels":[],"label_agreement":null},{"id":"W3133271864","doi":"10.1109/sc41405.2020.00057","title":"Compiler-Based Timing For Extremely Fine-Grain Preemptive Parallelism","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"National Science Foundation","keywords":"Computer science; Parallel computing; Compiler; Timer; Heap (data structure); Control flow; Granularity; Optimizing compiler; Scheduling (production processes); Compile time; Operating system; Programming language","score_opus":0.07880913403745692,"score_gpt":0.29043299085521934,"score_spread":0.2116238568177624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133271864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014209279,0.00004589107,0.9858511,0.0085611185,0.00007994578,0.00037212926,0.0000038957396,0.001296772,0.003647025],"genre_scores_gemma":[0.20560418,0.0000015863334,0.78982526,0.004127977,0.00007301691,0.000042694148,0.000011371489,0.000011096889,0.0003028095],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883956,0.00005291598,0.00024328748,0.00043473998,0.00016926833,0.0002602394],"domain_scores_gemma":[0.99917674,0.00017669135,0.000094656105,0.00028745725,0.00012833004,0.00013611687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017822566,0.0001562871,0.00018782188,0.000059795042,0.00014204752,0.00013224967,0.0007799632,0.00005948465,0.000025285746],"category_scores_gemma":[0.00010133448,0.00014427063,0.000105724095,0.00026877943,0.000027963048,0.00018129332,0.00014215251,0.00009037576,0.000023886576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016406951,0.00032790512,0.0006488576,0.00016134411,0.00008869424,0.0000315606,0.0033982222,0.19137433,0.001694987,0.22067745,0.49480775,0.08662481],"study_design_scores_gemma":[0.00048286273,0.00018526138,0.000067993395,0.000013440392,0.000003359311,0.000001035124,0.0000061409655,0.9782498,0.004668026,0.0013491818,0.014768033,0.00020484855],"about_ca_topic_score_codex":0.0000066972484,"about_ca_topic_score_gemma":0.0000021050855,"teacher_disagreement_score":0.7868755,"about_ca_system_score_codex":0.00001758785,"about_ca_system_score_gemma":0.00006938964,"threshold_uncertainty_score":0.5883185},"labels":[],"label_agreement":null},{"id":"W3136802169","doi":"10.5555/776261.776276","title":"Inlining of mathematical functions in HP-UX for Itanium® 2","year":2003,"lang":"en","type":"article","venue":"Symposium on Code Generation and Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"","keywords":"Compiler; Computer science; Programming language; Parallel computing; Interface (matter); Code (set theory); Optimizing compiler; Throughput; Computer architecture; Operating system","score_opus":0.02927424171415484,"score_gpt":0.2706069918587592,"score_spread":0.24133275014460437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136802169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001064985,0.00003321356,0.99479145,0.00043945265,0.0001487543,0.000282438,0.0000034082655,0.00010024197,0.0031360877],"genre_scores_gemma":[0.24774903,0.00005748562,0.75156665,0.00021338854,0.000034064342,0.00005215199,0.000029789899,0.000010607606,0.00028682515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990547,0.0000853899,0.00034190092,0.00026894422,0.00012273772,0.00012634242],"domain_scores_gemma":[0.99940544,0.00009056695,0.00011755354,0.0002008262,0.0001440807,0.000041525367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004092226,0.00010573157,0.00014710409,0.00019615213,0.000117461124,0.00007808653,0.000105822204,0.00008156032,0.000010280647],"category_scores_gemma":[0.00011378539,0.00010559671,0.000032514752,0.0002879935,0.000020811733,0.00020462555,0.000020195317,0.000056539808,0.0000013162958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049095024,0.00006116918,0.00006342622,0.000010821959,0.0000032925561,1.3256319e-7,0.0002080916,0.871795,0.00082494004,0.12636168,0.00033394631,0.00033261918],"study_design_scores_gemma":[0.00041638833,0.0001293539,0.000009697672,0.000021506317,0.0000042310894,0.0000031105371,0.000017476526,0.99140793,0.0065353527,0.0010372167,0.00030772737,0.00011002471],"about_ca_topic_score_codex":0.0000010043566,"about_ca_topic_score_gemma":0.0000030281112,"teacher_disagreement_score":0.24668404,"about_ca_system_score_codex":0.000027427228,"about_ca_system_score_gemma":0.000048468693,"threshold_uncertainty_score":0.43061087},"labels":[],"label_agreement":null},{"id":"W3136915194","doi":"10.5555/2561828.3260197","title":"Session details: Keeping kilo-core chips cool: new directions and emerging solutions","year":2013,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; Core (optical fiber); Many core; Parallel computing; Telecommunications; World Wide Web","score_opus":0.1017192428519151,"score_gpt":0.30789326090288377,"score_spread":0.2061740180509687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136915194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084682694,0.000059662307,0.9902703,0.003599199,0.0008938738,0.00031574126,0.0000016865639,0.00080470095,0.0032080163],"genre_scores_gemma":[0.4023486,0.00012897616,0.5956844,0.0010346986,0.00024886936,0.000042355205,0.000009819556,0.000015679516,0.00048661535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981544,0.00014614835,0.00039048505,0.00059751514,0.00037524733,0.00033620032],"domain_scores_gemma":[0.99859065,0.0002480217,0.00018159143,0.00038644025,0.00038854164,0.00020474519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002907919,0.0002493043,0.00021168083,0.00037538435,0.00039096017,0.0007759675,0.0009213797,0.00009309408,0.00012325177],"category_scores_gemma":[0.00006479381,0.00024336831,0.0000703004,0.00029270598,0.000054337168,0.0008614621,0.0004164394,0.00027102206,0.00012270069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028822242,0.00021107584,0.00032619946,0.000012679196,0.0001418844,0.000015837906,0.001329469,0.032248963,0.0021280493,0.42247245,0.056561787,0.4845228],"study_design_scores_gemma":[0.00030325697,0.000115767776,0.0015384351,0.00015676228,0.000004799605,0.000035276928,0.0000129048985,0.9606448,0.0004950016,0.03537194,0.0010381844,0.00028291642],"about_ca_topic_score_codex":0.00018005524,"about_ca_topic_score_gemma":0.000005002465,"teacher_disagreement_score":0.9283958,"about_ca_system_score_codex":0.00007730392,"about_ca_system_score_gemma":0.00014975066,"threshold_uncertainty_score":0.9924272},"labels":[],"label_agreement":null},{"id":"W3136946134","doi":"10.5555/2561828.3260213","title":"Session details: Efficient and secure embedded processors","year":2013,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; Cryptography; Programming language; Parallel computing; Computer security; World Wide Web","score_opus":0.04206556504103607,"score_gpt":0.28706274348707767,"score_spread":0.2449971784460416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136946134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070116594,0.00002096323,0.98703057,0.0018462209,0.00044295657,0.00037337973,0.0000010555408,0.00054064614,0.0027325682],"genre_scores_gemma":[0.6346055,0.000016655957,0.36439118,0.00068863464,0.000073558964,0.000044507902,0.000003605606,0.000008978901,0.00016731078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822664,0.00015361671,0.0003218982,0.0005865331,0.00045669865,0.00025458177],"domain_scores_gemma":[0.99866635,0.0001659506,0.00016343402,0.00034025701,0.0005273321,0.00013669702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027467072,0.00023524906,0.00019246372,0.00024812558,0.00013915997,0.00076863193,0.0010521754,0.00009286297,0.0000844751],"category_scores_gemma":[0.000038174578,0.00020220551,0.00004635807,0.00019962179,0.000053427848,0.00041609333,0.00032848222,0.00020190321,0.00013407081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007903864,0.000677538,0.00031150025,0.00005555862,0.00016623404,0.000057035424,0.0037100168,0.22319286,0.002808745,0.41369325,0.032170244,0.32307798],"study_design_scores_gemma":[0.00032242923,0.00016584428,0.00041324674,0.00011292398,0.0000022173324,0.000023775701,0.000013003127,0.9827954,0.0025854453,0.013169018,0.00015472606,0.00024194187],"about_ca_topic_score_codex":0.000012134372,"about_ca_topic_score_gemma":2.8884008e-7,"teacher_disagreement_score":0.75960255,"about_ca_system_score_codex":0.000048688653,"about_ca_system_score_gemma":0.000091258175,"threshold_uncertainty_score":0.8245701},"labels":[],"label_agreement":null},{"id":"W3137425157","doi":"10.1145/3247711","title":"Session details: Performance estimation in system design","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.02454333623943829,"score_gpt":0.2555634359329932,"score_spread":0.2310200996935549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137425157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00430971,0.000025589485,0.98396266,0.00002514201,0.00007093337,0.000106355255,1.554218e-8,0.0005719661,0.010927629],"genre_scores_gemma":[0.52076817,0.0000036712197,0.47910884,0.000023128247,0.0000013382443,0.000006172418,1.5098185e-7,0.0000017802323,0.00008676709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.00012983878,0.00016632295,0.00017220319,0.00011193043,0.0001313087],"domain_scores_gemma":[0.99962616,0.000044886277,0.00004631888,0.00022000937,0.000034256052,0.000028392786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005430856,0.000067850124,0.00007763528,0.000112150265,0.00006673212,0.000067736546,0.00023586435,0.000038313938,0.0000032816597],"category_scores_gemma":[0.0000312526,0.00005757156,0.000012505779,0.00034603037,0.0000063586876,0.0003653523,0.000029771229,0.000053353113,0.00003051905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025727143,0.00003993712,0.0024967475,0.0000400251,0.0000019832337,0.0000044960734,0.0002061912,0.8577016,0.00007650562,0.108997695,0.00044408787,0.029988134],"study_design_scores_gemma":[0.00010181566,0.0000194818,0.0006429205,0.000053270942,4.3026603e-7,0.000011549506,0.000008185297,0.9901981,0.008569092,0.0002692669,0.00004767658,0.000078206336],"about_ca_topic_score_codex":0.0000040135806,"about_ca_topic_score_gemma":2.0421096e-7,"teacher_disagreement_score":0.51645845,"about_ca_system_score_codex":0.000056935467,"about_ca_system_score_gemma":0.00004126041,"threshold_uncertainty_score":0.23477001},"labels":[],"label_agreement":null},{"id":"W3137917418","doi":"10.1145/1735971.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Thread (computing); Shared memory; Multi-core processor; Gang scheduling; Cache; Parallel computing; Fair-share scheduling; Quality of service; Two-level scheduling; Operating system; Computer network","score_opus":0.057632346588271835,"score_gpt":0.3106199538624083,"score_spread":0.2529876072741365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137917418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50462854,0.000108739456,0.49184394,0.0008331998,0.0002675928,0.00024007607,0.0000017322416,0.00081489776,0.001261295],"genre_scores_gemma":[0.69607973,0.0000014983107,0.30365974,0.00014759629,0.000047276924,0.000008600587,0.000008801224,0.000007948876,0.00003877637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.000059582024,0.0002787905,0.00038524173,0.00021252673,0.00026895368],"domain_scores_gemma":[0.99886584,0.00023281298,0.0001831355,0.00055700255,0.00009076084,0.00007043697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042673002,0.00013825852,0.00015834294,0.0001941663,0.0001503815,0.00030783712,0.0012436567,0.000113973736,0.000010254749],"category_scores_gemma":[0.00067979534,0.00013233648,0.00003462631,0.0003571717,0.00004179953,0.00059485884,0.00029081717,0.00034273116,0.000016643102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022958938,0.0012827003,0.1944523,0.00077778747,0.00011182623,0.00030839516,0.026093014,0.21176526,0.11909855,0.013448854,0.0025189114,0.4299128],"study_design_scores_gemma":[0.00043914717,0.00003611333,0.009221734,0.00016804835,0.000004707197,0.000009729604,0.00006368412,0.9819892,0.006106503,0.0011078761,0.00058348506,0.0002697948],"about_ca_topic_score_codex":0.00006651406,"about_ca_topic_score_gemma":0.00008889824,"teacher_disagreement_score":0.7702239,"about_ca_system_score_codex":0.0000146571965,"about_ca_system_score_gemma":0.000032294916,"threshold_uncertainty_score":0.5396525},"labels":[],"label_agreement":null},{"id":"W3138455952","doi":"10.1109/cgo51591.2021.9370323","title":"r3d3: Optimized Query Compilation on GPUs","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Query optimization; Parallel computing; Information retrieval","score_opus":0.020419485681983054,"score_gpt":0.2655941035786667,"score_spread":0.24517461789668366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138455952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007453996,0.00003543419,0.92979777,0.0020290308,0.00019525187,0.00005203059,5.275201e-7,0.00089711946,0.06624746],"genre_scores_gemma":[0.123367965,0.00003685977,0.87114364,0.0019561138,0.000042294916,0.000005586345,0.000012775154,0.0000065823965,0.003428172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991411,0.000085297936,0.0001632239,0.00029042433,0.00017611045,0.00014381912],"domain_scores_gemma":[0.9992326,0.000095484764,0.00004984036,0.00044176262,0.00012796813,0.000052364296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015190282,0.00008987073,0.000118384916,0.00006955151,0.0000980101,0.00015450726,0.00030779344,0.000047599566,0.00006024982],"category_scores_gemma":[0.000045544366,0.000083325074,0.0000520891,0.00031797044,0.000012031632,0.00017174009,0.00013611204,0.00008433827,0.000083647596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021490787,0.0003426765,0.0005225769,0.000013165763,0.00003452173,0.000082756036,0.00034675564,0.32357338,0.0008601246,0.57434636,0.059284817,0.04057136],"study_design_scores_gemma":[0.00034401222,0.000044428725,0.0005159454,0.000019014009,0.0000018465945,0.000016642476,0.0000056073577,0.9606777,0.02776042,0.0035374756,0.0069004567,0.00017644008],"about_ca_topic_score_codex":0.000006184856,"about_ca_topic_score_gemma":0.0000014238254,"teacher_disagreement_score":0.63710433,"about_ca_system_score_codex":0.000025920468,"about_ca_system_score_gemma":0.00005907036,"threshold_uncertainty_score":0.3397898},"labels":[],"label_agreement":null},{"id":"W3138559045","doi":"10.1145/2838344.2852078","title":"Challenges of Memory Management on Modern NUMA System","year":2015,"lang":"en","type":"article","venue":"Queue","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Computer science; Registered memory; Interleaved memory; Node (physics); Uniform memory access; Dram; Key (lock); Shared memory; Interconnection; Flat memory model; Latency (audio); Embedded system; Memory management; Operating system; Semiconductor memory; Computer network; Computer hardware; Telecommunications","score_opus":0.0526163387580963,"score_gpt":0.2708370863205612,"score_spread":0.2182207475624649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138559045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065345044,0.00040081207,0.7721187,0.00033670265,0.00016067582,0.00010526864,2.8379307e-7,0.00050151855,0.22572261],"genre_scores_gemma":[0.9150563,0.000039197246,0.084478386,0.000057864556,0.000025370538,0.000009774813,3.919076e-7,0.000005568194,0.00032714318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927527,0.000058673086,0.00014072291,0.0002059406,0.00021118889,0.000108197375],"domain_scores_gemma":[0.99932307,0.000017620318,0.00007112711,0.0004664648,0.00006690835,0.000054808108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030557252,0.00007460497,0.0001139482,0.00008824822,0.000023362662,0.000019955243,0.00048662975,0.000033454726,4.0414955e-7],"category_scores_gemma":[0.0000063113384,0.00006732654,0.00002766147,0.00009050227,0.000011813924,0.000075430595,0.0001392163,0.000042408767,0.00002499415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073923848,0.000075613316,0.000008913174,0.00011429955,0.00002096793,0.000018134493,0.0013604508,0.031184016,0.000006750049,0.86222893,0.0031429222,0.10183162],"study_design_scores_gemma":[0.00047324426,0.00024305393,0.00018616555,0.00026616314,0.000005647117,0.0000132303885,0.0002997466,0.9822608,0.0039321035,0.010920405,0.0011672518,0.00023214934],"about_ca_topic_score_codex":0.000008419586,"about_ca_topic_score_gemma":8.3106016e-7,"teacher_disagreement_score":0.9510768,"about_ca_system_score_codex":0.000044746124,"about_ca_system_score_gemma":0.000016078422,"threshold_uncertainty_score":0.27454966},"labels":[],"label_agreement":null},{"id":"W3138924132","doi":"10.1109/bigdata50022.2020.9378371","title":"Energy-Efficient Energy Analytics Using a General Purpose Graphics Processing Unit","year":2020,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Graphics processing unit; Smart meter; Raw data; Central processing unit; Efficient energy use; Electricity meter; Data analysis; Graphics; Big data; Data processing; Real-time computing; Database; Electricity; Power (physics); Data mining; Computer hardware; Operating system; Engineering; Electrical engineering","score_opus":0.048604263734521605,"score_gpt":0.2736028483004616,"score_spread":0.22499858456594002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138924132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017780714,0.00017726429,0.9941854,0.00070332905,0.000055642635,0.00003444203,5.6235706e-7,0.0009200934,0.002145179],"genre_scores_gemma":[0.57054025,0.00002572352,0.4251384,0.0039909217,0.000097577366,0.0000025835245,0.0000031838601,0.000013926215,0.00018741567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985887,0.00007246528,0.00029253145,0.0004374522,0.00030800913,0.0003008429],"domain_scores_gemma":[0.99916303,0.00002133768,0.00012581488,0.0002972343,0.00019546108,0.00019710066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012679145,0.00018001755,0.00018565531,0.00017198248,0.00022908697,0.0002977073,0.0007483656,0.00007778023,0.0000062614818],"category_scores_gemma":[0.000018066945,0.00016681498,0.00007789238,0.0014956164,0.000044446857,0.00017867112,0.0003466663,0.000098321136,0.0000014619768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044226335,0.000072924064,0.00010855226,0.000014102356,0.000015194174,0.000020696605,0.00032840826,0.69110173,0.00062072335,0.28446302,0.0008499047,0.022400327],"study_design_scores_gemma":[0.00011582899,0.000042424097,0.00000833249,0.0000129137225,0.0000072111734,0.000009984973,0.00000673849,0.98865545,0.0045283143,0.00092425564,0.0054618795,0.00022666485],"about_ca_topic_score_codex":0.00010615678,"about_ca_topic_score_gemma":0.0000039036277,"teacher_disagreement_score":0.569047,"about_ca_system_score_codex":0.000024406054,"about_ca_system_score_gemma":0.00014671392,"threshold_uncertainty_score":0.6802518},"labels":[],"label_agreement":null},{"id":"W3140162682","doi":"10.1145/543552.512542","title":"Profile-guided code compression","year":2002,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Executable; Memory footprint; Code (set theory); Overhead (engineering); Compression (physics); Software; Dead code; Embedded system; Set (abstract data type); Operating system; Programming language; Code generation; Redundant code; Key (lock)","score_opus":0.06253402740222241,"score_gpt":0.29262444176266994,"score_spread":0.23009041436044753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140162682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019713802,0.0006706445,0.9187426,0.0041036983,0.0006211237,0.00037758984,0.000008248131,0.0030361342,0.052726164],"genre_scores_gemma":[0.6358424,0.00003124193,0.36230662,0.00055454526,0.00007161298,0.000009312425,0.0000058122205,0.0000089713785,0.0011695154],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988816,0.00008091073,0.00021900581,0.00033515514,0.00024130174,0.00024204071],"domain_scores_gemma":[0.99867254,0.0002032575,0.00012826579,0.0008446306,0.00006868579,0.000082618775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015980893,0.00013288685,0.00014547016,0.00009305692,0.00017764389,0.00018049816,0.0016309752,0.00006754191,0.000110815665],"category_scores_gemma":[0.00015693784,0.00011425882,0.00003856897,0.0002450391,0.000032534546,0.0003578027,0.00042559762,0.000118973345,0.0002663269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014132977,0.0005334471,0.0076158256,0.000120993056,0.00006688861,0.000110525936,0.004052069,0.02475081,0.0025903375,0.029141698,0.8158642,0.11513904],"study_design_scores_gemma":[0.0002766239,0.000073533876,0.0009529956,0.000056271867,0.000005393171,0.000015857706,0.000007708836,0.97067046,0.006817631,0.0012011023,0.019644711,0.00027773296],"about_ca_topic_score_codex":0.000015739952,"about_ca_topic_score_gemma":0.0000019363727,"teacher_disagreement_score":0.94591963,"about_ca_system_score_codex":0.000014658284,"about_ca_system_score_gemma":0.000008721385,"threshold_uncertainty_score":0.46593398},"labels":[],"label_agreement":null},{"id":"W3142035783","doi":"10.1109/estmed.2006.321276","title":"Locality management using multiple SPMs on the Multi-Level Computing Architecture","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Locality; Exploit; Scheduling (production processes); Computer architecture; Distributed computing; Data access; Locality of reference; Architecture; Parallel computing; Embedded system; Cache; Database","score_opus":0.059398441057129346,"score_gpt":0.2773955407792227,"score_spread":0.21799709972209333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142035783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005568587,0.000014037056,0.98706967,0.0007140289,0.00010722624,0.0002557704,0.0000011828175,0.00068686635,0.005582641],"genre_scores_gemma":[0.48421434,6.150672e-7,0.51485604,0.00056782836,0.000033219694,0.0000017062697,0.0000011686506,0.00000544903,0.00031966466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871504,0.00012246238,0.0002428933,0.00038072886,0.00025328284,0.00028557444],"domain_scores_gemma":[0.99906933,0.0001676723,0.00009395951,0.00058467855,0.000048372913,0.00003597973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043341386,0.0001637163,0.000120564946,0.000089419846,0.00036009916,0.00018656418,0.0008228524,0.000045106743,0.0000053687886],"category_scores_gemma":[0.000017599104,0.00010869534,0.00006905474,0.0003239421,0.000047120353,0.00006335101,0.00040098638,0.00016320331,0.00001579244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003829588,0.00017824027,0.0009102013,0.000013701626,0.000016973427,0.000011505336,0.00011183621,0.84425896,0.00008484403,0.11107174,0.0016062579,0.041731924],"study_design_scores_gemma":[0.0002052228,0.000014372749,0.002451427,0.000028203984,0.0000024968908,0.0000056611875,0.000010669093,0.99270207,0.0015323622,0.0020563768,0.00083079305,0.00016035269],"about_ca_topic_score_codex":0.000192571,"about_ca_topic_score_gemma":0.00001657258,"teacher_disagreement_score":0.47864574,"about_ca_system_score_codex":0.000048291033,"about_ca_system_score_gemma":0.000012268887,"threshold_uncertainty_score":0.44324675},"labels":[],"label_agreement":null},{"id":"W3143400171","doi":"10.1109/superc.1994.344314","title":"Expressing cross-loop dependencies through hyperplane data dependence analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hyperplane; Linear subspace; Loop (graph theory); Dependence analysis; Computer science; Code (set theory); Space (punctuation); Source code; Algorithm; Theoretical computer science; Mathematics; Set (abstract data type); Combinatorics; Programming language; Pure mathematics","score_opus":0.09195660447506032,"score_gpt":0.32640012808519325,"score_spread":0.23444352361013293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143400171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034205627,0.0005260954,0.9716872,0.00021873323,0.00008937982,0.00006343781,0.0000057160146,0.0010554403,0.02293342],"genre_scores_gemma":[0.48761347,0.000100957055,0.5094868,0.00032222603,0.000029252198,0.000002689598,0.000015652995,0.000005857472,0.0024231235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981154,0.00007389896,0.00030866257,0.0007494966,0.000424134,0.00032837706],"domain_scores_gemma":[0.9974636,0.0001297597,0.00011886126,0.002109289,0.00010481417,0.00007370951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032891097,0.000168675,0.00023355316,0.00020599528,0.00030187125,0.0007549169,0.0032063613,0.000082552055,0.00028104047],"category_scores_gemma":[0.0000972777,0.00014859167,0.00007021523,0.0014761297,0.00006631856,0.001972424,0.0012432379,0.00014132046,0.00010311516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025172092,0.0013631992,0.15654539,0.000115932664,0.0021341883,0.00055672077,0.0076079224,0.40037417,0.0029482837,0.08671652,0.14760906,0.19400342],"study_design_scores_gemma":[0.000103959355,0.0000147405,0.0008320003,0.000007772391,0.000034922272,0.000025254958,0.00001209666,0.99437845,0.0020856152,0.0005208736,0.0017466906,0.00023763158],"about_ca_topic_score_codex":0.00015092158,"about_ca_topic_score_gemma":0.000025084946,"teacher_disagreement_score":0.5940043,"about_ca_system_score_codex":0.000020381432,"about_ca_system_score_gemma":0.000018513992,"threshold_uncertainty_score":0.72796816},"labels":[],"label_agreement":null},{"id":"W3143604116","doi":"10.1109/pact.2007.4336225","title":"Component-Based Lock Allocation","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... Conference on Parallel Architectures and Compilation Techniques/Proceedings of the Conference on Parallel Architectures and Compilation Techniques","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Thread (computing); Critical section; Allocator; Correctness; Lock (firearm); Distributed computing; Parallel computing; Component (thermodynamics); Java; Multithreading; Operating system; Programming language; Engineering","score_opus":0.018636222201490586,"score_gpt":0.25309242364097095,"score_spread":0.23445620143948037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143604116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28736252,0.00022896931,0.6299494,0.015895667,0.00028748013,0.005618874,0.00008990248,0.0029206313,0.0576466],"genre_scores_gemma":[0.87543786,0.0001378141,0.12309136,0.0009046743,0.00008194126,0.00012839043,0.000011093565,0.000054234064,0.000152641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99501646,0.00007395191,0.0015135485,0.0012776017,0.0013451298,0.0007733283],"domain_scores_gemma":[0.9954758,0.00028236432,0.001982729,0.00066470576,0.0013317979,0.00026255928],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015086138,0.00094540446,0.0009819575,0.0008963771,0.0008875477,0.00044424372,0.002834232,0.00045550428,0.0000150557],"category_scores_gemma":[0.00016048687,0.0006660206,0.00037393073,0.001054044,0.00096422073,0.0002686893,0.0010635752,0.0011783148,0.0000012185475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010944488,0.0005732207,0.007845569,0.00053031713,0.00011509028,7.928876e-7,0.0017112461,0.0024318297,0.064348936,0.8375233,0.0011239165,0.082701325],"study_design_scores_gemma":[0.0017933678,0.0024763183,0.062304053,0.0029410305,0.00013397467,0.000109938424,0.00032683616,0.1367711,0.47180003,0.31737763,0.0018015865,0.0021641348],"about_ca_topic_score_codex":0.000060211525,"about_ca_topic_score_gemma":0.000010806685,"teacher_disagreement_score":0.58807534,"about_ca_system_score_codex":0.00010120539,"about_ca_system_score_gemma":0.00013319074,"threshold_uncertainty_score":0.9995791},"labels":[],"label_agreement":null},{"id":"W3144164074","doi":"10.1109/cgo.2011.5764693","title":"Using machines to learn method-specific compilation strategies","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Compiler; Just-in-time compilation; Java; Programming language; Support vector machine; Artificial intelligence; IBM; Process (computing); Throughput; Machine learning; Operating system","score_opus":0.13861403225489516,"score_gpt":0.3508935760726819,"score_spread":0.21227954381778674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144164074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001158874,0.00002433113,0.95013046,0.000072961586,0.00011398119,0.000090688285,2.964525e-7,0.0007444882,0.04766393],"genre_scores_gemma":[0.13126858,0.000003332505,0.868298,0.00016693826,0.000025084084,0.0000019576003,8.253362e-7,0.0000055268383,0.00022978593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992274,0.000085341955,0.00016389109,0.00025219252,0.00012081361,0.00015038029],"domain_scores_gemma":[0.9994698,0.00003092532,0.00004891712,0.00030318485,0.000087773165,0.00005939819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782884,0.00009523362,0.00010247245,0.00029144928,0.00011547862,0.00016751858,0.0004500654,0.0000351192,0.000042943346],"category_scores_gemma":[0.0000064906444,0.00008366778,0.000030735082,0.0007394762,0.0000113019,0.00041553582,0.00015466438,0.00006194005,0.000035521865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008441198,0.00007086545,0.00094094314,0.000007261003,0.000011928746,0.000005238154,0.0033685302,0.078127496,0.0034187601,0.8287022,0.0032004283,0.082137905],"study_design_scores_gemma":[0.000064610795,0.000050316656,0.002660118,0.000009181419,0.0000014013541,0.000009868754,0.000037407284,0.9709091,0.007985535,0.016001908,0.0020844704,0.00018608538],"about_ca_topic_score_codex":0.00009485839,"about_ca_topic_score_gemma":0.0000038353046,"teacher_disagreement_score":0.8927816,"about_ca_system_score_codex":0.000017366254,"about_ca_system_score_gemma":0.000025934136,"threshold_uncertainty_score":0.3411873},"labels":[],"label_agreement":null},{"id":"W3145135885","doi":"10.1109/ipdps.2006.1639271","title":"Improving cache locality for thread-level speculation","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Uniprocessor system; Cache; Parallel computing; Speculative multithreading; Cache algorithms; Cache invalidation; Bus sniffing; Cache coloring; Cache pollution; Smart Cache; Locality; Scalability; Page cache; Thread (computing); Operating system; CPU cache; Multithreading; Embedded system; Multiprocessing","score_opus":0.033362146682569455,"score_gpt":0.26758230893849067,"score_spread":0.2342201622559212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145135885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000676377,0.000018878744,0.9919549,0.0003250968,0.00007322672,0.00016274254,0.0000012343622,0.00063351693,0.006154019],"genre_scores_gemma":[0.35661075,3.6048996e-7,0.6423769,0.00011646627,0.000056587065,0.000008017629,0.0000064246283,0.0000034504296,0.00082103634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933815,0.000018584362,0.00016548256,0.00022762643,0.000101129524,0.00014903299],"domain_scores_gemma":[0.99950796,0.00005209311,0.00006423612,0.00025613196,0.000096682605,0.00002290251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025753974,0.00007292345,0.000075602045,0.000043976615,0.00010260909,0.000107153865,0.00027565708,0.00004367996,0.0000036250397],"category_scores_gemma":[0.00002233151,0.000065030785,0.00004422231,0.00013683898,0.000013079294,0.00019768957,0.00007355623,0.000035071986,0.00000534129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040579116,0.00007562255,0.0013228153,0.000020860572,0.0000049679666,8.5643785e-7,0.000043309326,0.031871032,0.00072573574,0.89396805,0.009957791,0.062004924],"study_design_scores_gemma":[0.00014531401,0.000021400923,0.0022723991,0.000003151262,0.0000016687083,0.0000017138765,0.0000014986612,0.94522816,0.009528186,0.04168617,0.0009964622,0.000113849994],"about_ca_topic_score_codex":0.00032980688,"about_ca_topic_score_gemma":0.000024850462,"teacher_disagreement_score":0.91335714,"about_ca_system_score_codex":0.00003154356,"about_ca_system_score_gemma":0.000027653137,"threshold_uncertainty_score":0.26518783},"labels":[],"label_agreement":null},{"id":"W3145824319","doi":"10.1109/dsd.2007.4341465","title":"An Embedded Implementation of the Microsoft Common Language Infrastructure","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Abstraction; Abstraction layer; Layer (electronics); Architecture; Set (abstract data type); Instruction set; Embedded system; Operating system; Software engineering; Computer architecture; Software; Programming language","score_opus":0.005346757342479265,"score_gpt":0.3103910514006927,"score_spread":0.3050442940582134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145824319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2657451,0.000009046892,0.73285645,0.00008610682,0.000055760473,0.00007089166,7.625854e-7,0.00014786811,0.0010280142],"genre_scores_gemma":[0.81590277,6.5829636e-7,0.18361817,0.00042657446,0.000012760979,5.026903e-7,0.0000021207495,0.0000023919724,0.000034026634],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994772,0.000034332945,0.00016050595,0.00010849685,0.000113593,0.00010584497],"domain_scores_gemma":[0.9994375,0.000023039902,0.000088940935,0.00037548406,0.000041975196,0.000033035474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024253121,0.000053321943,0.000060082024,0.000040883373,0.000063024054,0.00003449839,0.0005837013,0.000028974648,0.000019578702],"category_scores_gemma":[0.0000061738306,0.000036009693,0.000026722691,0.00022392822,0.000020399968,0.00013707406,0.00009865927,0.00005286159,8.3119585e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014381902,0.00015146355,0.11064232,0.000035448058,0.000035075238,0.0000060498264,0.029313648,0.007695907,0.22187237,0.10490789,0.018829713,0.5064957],"study_design_scores_gemma":[0.0002615272,0.00007250191,0.11405301,0.000007293861,0.0000030862607,0.000009424835,0.0008228701,0.025525596,0.85679996,0.0019319394,0.00037635773,0.00013643251],"about_ca_topic_score_codex":0.00009361968,"about_ca_topic_score_gemma":0.00006952481,"teacher_disagreement_score":0.6349276,"about_ca_system_score_codex":0.000012582196,"about_ca_system_score_gemma":0.000028055356,"threshold_uncertainty_score":0.14684327},"labels":[],"label_agreement":null},{"id":"W3146588964","doi":"10.1109/ipdps.2006.1639497","title":"Towards MPI progression layer elimination with TCP and SCTP","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Computer science; Scalability; Component (thermodynamics); Transport layer; Computer network; Distributed computing; Protocol stack; Transmission Control Protocol; Middleware (distributed applications); Layer (electronics); Application layer; Operating system","score_opus":0.010661210844325841,"score_gpt":0.26303023009494186,"score_spread":0.252369019250616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146588964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062470064,0.000057879653,0.9641231,0.0011070967,0.000023368797,0.00009327252,1.0814253e-7,0.0005867607,0.027761428],"genre_scores_gemma":[0.5618539,0.0000049394457,0.43751928,0.000087810375,0.000016707498,0.0000052021724,0.0000013766401,0.0000028028403,0.0005079708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.000022559287,0.00009288337,0.00019995667,0.00016099018,0.00010962961],"domain_scores_gemma":[0.9996776,0.000012501431,0.000044382225,0.00015699782,0.00008046261,0.000028055842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012677668,0.00007195308,0.00006301741,0.00006789066,0.00008640597,0.00013353034,0.0001611836,0.000033102453,0.0000047129565],"category_scores_gemma":[0.000004855416,0.000049449805,0.00000963092,0.00018268052,0.000023540333,0.00023906305,0.00008457687,0.00004060369,0.0000034823736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002019353,0.00022339112,0.0054020616,0.000032204083,0.000009972489,0.000018341723,0.00032475498,0.004015699,0.0007298028,0.47996956,0.018998353,0.49025565],"study_design_scores_gemma":[0.000646304,0.00040416393,0.036294486,0.00008586824,0.0000059737604,0.00005419307,0.000011225063,0.8969793,0.04770736,0.010454441,0.006933034,0.00042367933],"about_ca_topic_score_codex":0.00003400892,"about_ca_topic_score_gemma":0.0000050073286,"teacher_disagreement_score":0.8929636,"about_ca_system_score_codex":0.000010795623,"about_ca_system_score_gemma":0.000021773345,"threshold_uncertainty_score":0.20165046},"labels":[],"label_agreement":null},{"id":"W3147663759","doi":"10.1109/date.2012.6176553","title":"An instruction scratchpad memory allocation for the precision timed architecture","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Register allocation; Architecture; Parallel computing; Control flow graph; Control flow; Scheme (mathematics); Binary number; Integer (computer science); Graph; Integer programming; Operating system; Theoretical computer science; Programming language; Compiler; Algorithm; Arithmetic","score_opus":0.01705061747061883,"score_gpt":0.27670410885544255,"score_spread":0.25965349138482374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147663759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021944244,0.00008469057,0.9943525,0.0010211611,0.00034992388,0.00032756245,2.7749041e-7,0.00052092166,0.0011484959],"genre_scores_gemma":[0.43551484,0.0000089237255,0.5636178,0.00032641308,0.00016796064,0.000036035184,0.0000048157713,0.0000054465236,0.00031775353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993213,0.00006591387,0.00013151341,0.00016812839,0.00014064554,0.00017250454],"domain_scores_gemma":[0.99920934,0.0001309278,0.00006265123,0.00045155265,0.00008698863,0.00005851642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053049787,0.00008095432,0.000062540996,0.000062821215,0.00023527668,0.00010174935,0.0005181191,0.00005173127,0.000007710204],"category_scores_gemma":[0.000041170337,0.00005131822,0.000035040466,0.00019327436,0.000021234448,0.0005070134,0.000058786387,0.00007862227,0.000007650221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017469458,0.00009010822,0.0001089134,0.0000074779227,0.000012228629,4.2425068e-8,0.0015041463,0.042414647,0.001172339,0.04143252,0.0063977106,0.9068424],"study_design_scores_gemma":[0.00026852926,0.0001040439,0.001398538,0.00000861524,0.000006549096,0.000011820067,0.000038765626,0.9621319,0.019209031,0.00903736,0.007620049,0.00016475997],"about_ca_topic_score_codex":0.000014227167,"about_ca_topic_score_gemma":0.0000028148804,"teacher_disagreement_score":0.9197173,"about_ca_system_score_codex":0.000018901974,"about_ca_system_score_gemma":0.000023264334,"threshold_uncertainty_score":0.20926963},"labels":[],"label_agreement":null},{"id":"W3148494124","doi":"10.1145/1218063.1217961","title":"Evaluating network processing efficiency with processor partitioning and asynchronous I/O","year":2006,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Packet processing; Asynchronous communication; Multi-core processor; Porting; Multiprocessing; Embedded system; Network processor; Operating system; Network packet; Network interface; Computer network; Software","score_opus":0.02793711213114862,"score_gpt":0.3117113404314646,"score_spread":0.28377422830031596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148494124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003497068,0.14657015,0.846454,0.00039272942,0.00007644711,0.0009970437,4.168195e-7,0.0007146466,0.0012974512],"genre_scores_gemma":[0.5654278,0.00075476576,0.4328677,0.000317617,0.00023802236,0.00025107485,0.0000075045523,0.00002655789,0.00010894241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764,0.0002864073,0.0006715169,0.0005912582,0.00039787023,0.00041294502],"domain_scores_gemma":[0.99844074,0.0001514782,0.0004069156,0.0005726416,0.00036219865,0.000066030574],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018025221,0.0002513263,0.00045162495,0.000045883156,0.0009490994,0.0010439078,0.00065366307,0.000053819134,0.0000020491611],"category_scores_gemma":[0.00033521216,0.0001919777,0.000031950236,0.0007504087,0.000057137004,0.00051982264,0.00022910224,0.00016388648,0.0000059707477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037852287,0.00015574694,0.00722704,0.0137316305,0.00003615878,0.00003598714,0.00072620565,0.82537425,0.00017862165,0.013719389,0.002846986,0.13596421],"study_design_scores_gemma":[0.0002672871,0.00028781695,0.00018587484,0.022364497,0.000036717604,0.00022083726,0.000013100267,0.9749345,0.0000650004,0.00021336444,0.00091575587,0.00049522694],"about_ca_topic_score_codex":0.000088226676,"about_ca_topic_score_gemma":0.0000051677166,"teacher_disagreement_score":0.5619307,"about_ca_system_score_codex":0.00004602606,"about_ca_system_score_gemma":0.00021831684,"threshold_uncertainty_score":0.9999931},"labels":[],"label_agreement":null},{"id":"W3148573243","doi":"10.1145/2858788.2688521","title":"On optimizing machine learning workloads via kernel fusion","year":2015,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"Nvidia","keywords":"Computer science; Kernel (algebra); Scalability; Locality; Parallel computing; Matrix multiplication; Computation; Range (aeronautics); Algorithm","score_opus":0.03233663507408029,"score_gpt":0.2699771110886107,"score_spread":0.23764047601453042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3148573243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806375,0.00034909527,0.9710273,0.0008483063,0.0003717444,0.00011349945,6.665e-7,0.001297684,0.008185295],"genre_scores_gemma":[0.6843567,0.000018364117,0.3147604,0.00040652018,0.0000706536,0.0000040288323,0.000008819362,0.000012467801,0.00036205866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986045,0.00014465023,0.00021881907,0.00039425062,0.00035085884,0.00028695253],"domain_scores_gemma":[0.99861056,0.00034459907,0.00016317319,0.0006311318,0.00009000061,0.00016054374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053631107,0.00017908915,0.00017802075,0.00015629992,0.00019697123,0.00023245094,0.0013118223,0.00008463556,0.000012484516],"category_scores_gemma":[0.0004703137,0.00015841077,0.00004484956,0.00032817153,0.000025898935,0.000334295,0.0005632535,0.00028673623,0.0001346564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007133963,0.00016304762,0.003961464,0.000020274983,0.000030972802,0.0000682125,0.002869463,0.90745103,0.0002930863,0.006462612,0.0065526273,0.07205588],"study_design_scores_gemma":[0.00036991131,0.00029439648,0.00020736891,0.00006974993,0.000005999413,0.000011162575,0.000023754532,0.99135286,0.00128385,0.0035141783,0.0025841256,0.00028263286],"about_ca_topic_score_codex":0.0000753057,"about_ca_topic_score_gemma":0.0000049738433,"teacher_disagreement_score":0.66655034,"about_ca_system_score_codex":0.000041306204,"about_ca_system_score_gemma":0.000035773905,"threshold_uncertainty_score":0.64598036},"labels":[],"label_agreement":null},{"id":"W3150299212","doi":"10.1109/dac18074.2021.9586304","title":"A Framework for Optimizing CPU-iGPU Communication on Embedded Platforms","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Education; Dipartimenti di Eccellenza","keywords":"Computer science; Cache coherence; Cache; Speedup; Parallel computing; Embedded system; Central processing unit; CPU cache; Copying; Cache algorithms; Computer hardware","score_opus":0.04186145759038562,"score_gpt":0.32033208694663906,"score_spread":0.27847062935625344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150299212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033342527,0.00009614903,0.9830091,0.0012046708,0.00011243786,0.00014890502,7.726699e-7,0.0007531349,0.01434143],"genre_scores_gemma":[0.06800813,0.0000646073,0.9292803,0.0020614376,0.000030264648,0.000034579374,0.00001293844,0.000009225568,0.00049850566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991411,0.000027702092,0.00020323852,0.00029124712,0.00014165851,0.00019504406],"domain_scores_gemma":[0.9983281,0.00042482355,0.00008217869,0.00093950523,0.00017057377,0.000054815097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002582513,0.000106594256,0.00013377788,0.00006529487,0.00023266624,0.00021918362,0.00070285995,0.0000962013,0.000015157774],"category_scores_gemma":[0.0001825841,0.000096090494,0.000075625925,0.00030854912,0.000016897997,0.00023426436,0.00018017997,0.00014962135,0.000017414271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005414163,0.00006184169,0.000007964465,0.000006864407,0.0000108241875,0.0000014123267,0.0005454474,0.010802575,0.00004469603,0.9720386,0.006366812,0.010107502],"study_design_scores_gemma":[0.00029805055,0.00009516694,0.000020133786,0.00011044721,0.0000036839158,0.00000956279,0.0001161904,0.7447726,0.03390482,0.21708433,0.0033311085,0.00025387818],"about_ca_topic_score_codex":0.0000021711664,"about_ca_topic_score_gemma":9.217777e-7,"teacher_disagreement_score":0.75495434,"about_ca_system_score_codex":0.0000341345,"about_ca_system_score_gemma":0.000058909063,"threshold_uncertainty_score":0.39184567},"labels":[],"label_agreement":null},{"id":"W3151261503","doi":"10.1109/iccad.2006.320077","title":"Mapping Arbitrary Logic Functions into Synchronous Embedded Memories For Area Reduction on FPGAs","year":2006,"lang":"en","type":"article","venue":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alterra Power (Canada)","funders":"","keywords":"Asynchronous communication; Field-programmable gate array; Computer science; Reduction (mathematics); Stratix; Programmable Array Logic; Programmable logic device; Embedded system; Asynchronous circuit; Logic synthesis; Set (abstract data type); Logic gate; Parallel computing; Computer hardware; Computer architecture; Logic family; Algorithm; Synchronous circuit","score_opus":0.050065429019165594,"score_gpt":0.2898320938402066,"score_spread":0.23976666482104098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151261503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003842132,0.00007444567,0.90558666,0.0036215936,0.0016010941,0.0017851297,0.000050185237,0.0021693034,0.08126948],"genre_scores_gemma":[0.7530327,0.0000792863,0.24569392,0.00031280742,0.00030312463,0.00023029142,0.00009031896,0.000047564397,0.00021001195],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9944519,0.00025285353,0.00179031,0.0015546652,0.0012520357,0.00069823465],"domain_scores_gemma":[0.99460894,0.0014277844,0.0010905087,0.0017401946,0.0009058967,0.00022668179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000934491,0.0008010192,0.0010880305,0.0008690107,0.0003897588,0.00023432882,0.0036456257,0.00060502277,0.00004698359],"category_scores_gemma":[0.0005689173,0.0007494426,0.00062697154,0.0008917073,0.00063387863,0.00047293928,0.00053821394,0.00081010244,0.00001689392],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076706195,0.0030570729,0.00013577682,0.00017145154,0.0002500312,0.00003934678,0.00014770699,0.08997519,0.57006085,0.31463906,0.009991073,0.010765374],"study_design_scores_gemma":[0.011804291,0.029894833,0.020903096,0.008663399,0.00041179618,0.0009776726,0.00041567846,0.17573498,0.4440921,0.28544423,0.012336117,0.009321792],"about_ca_topic_score_codex":0.000062924264,"about_ca_topic_score_gemma":0.000011457379,"teacher_disagreement_score":0.7491905,"about_ca_system_score_codex":0.0005233508,"about_ca_system_score_gemma":0.0003707241,"threshold_uncertainty_score":0.9994957},"labels":[],"label_agreement":null},{"id":"W31541170","doi":"10.1038/s41598-019-50088-1","title":"An Approach to Scheduling in a Hardware-Software Co-Design Toolchain","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Neurological Disorders and Stroke; National Cancer Institute; Canadian Institutes of Health Research","keywords":"Computer science; Compiler; Very long instruction word; Toolchain; Compile time; Digital subscriber line; Parallel computing; Optimizing compiler; Programming language; Instruction scheduling; Just-in-time compilation; Code generation; Scheduling (production processes); Domain-specific language; Computer architecture; Software; Schedule; Operating system; Dynamic priority scheduling","score_opus":0.042483053884045545,"score_gpt":0.29893075125347285,"score_spread":0.2564476973694273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31541170","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006643325,0.00006130871,0.97152394,0.000009757045,0.00017774811,0.0005799396,0.000001391002,0.0014312548,0.025550304],"genre_scores_gemma":[0.012838293,0.000012115247,0.9824823,0.0002763549,0.000043688913,0.00013538353,0.0001905609,0.00003780356,0.003983511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977951,0.0001950953,0.0004370174,0.0008902619,0.00030657405,0.0003759714],"domain_scores_gemma":[0.9986095,0.000057228444,0.00015555519,0.0008429053,0.00016364208,0.00017120012],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069753465,0.00033705722,0.00037944908,0.00065783656,0.00010755221,0.00028401279,0.0017859286,0.00032997702,0.000014326387],"category_scores_gemma":[0.00009527693,0.00033902857,0.00007122489,0.00064902764,0.000008951212,0.00038257884,0.000065808425,0.0003405446,0.00004526791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002300814,0.0018000327,0.0006488757,0.00042951546,0.000083723426,0.000050585793,0.031736948,0.7126298,0.00036626298,0.08554113,0.008816084,0.15766695],"study_design_scores_gemma":[0.00033855124,0.00028562953,0.0009732672,0.0002789401,0.000008773575,0.0000071134864,0.0003161125,0.98548305,0.006634334,0.0039258385,0.00044993454,0.0012984638],"about_ca_topic_score_codex":0.0001411224,"about_ca_topic_score_gemma":0.000018142297,"teacher_disagreement_score":0.27285323,"about_ca_system_score_codex":0.00006476482,"about_ca_system_score_gemma":0.00022107235,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null},{"id":"W3156620473","doi":"10.1145/3473593","title":"Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Google (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Search engine indexing; Benchmark (surveying); Associative property; Programming language; Parallel computing; Functional programming; Data parallelism; Programming style; Implicit parallelism; Function (biology); Point (geometry); Array data structure; Mathematics; Artificial intelligence","score_opus":0.01894816289790268,"score_gpt":0.2911922973149375,"score_spread":0.2722441344170348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156620473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.335123,0.004840177,0.54449916,0.09717654,0.0014829986,0.01162049,0.000027062148,0.003815251,0.0014153512],"genre_scores_gemma":[0.35144955,0.00003008858,0.6468522,0.0007377743,0.00016481741,0.0005620689,0.0000069172747,0.00005127228,0.00014528172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686015,0.000054807908,0.0006437496,0.0011207226,0.0006264375,0.0006941074],"domain_scores_gemma":[0.99644494,0.00036241612,0.00082006404,0.0015925185,0.00063879875,0.00014128245],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0017845186,0.0005109006,0.0005716433,0.00022287008,0.00055364025,0.0017514344,0.0066885594,0.00028512932,0.0000014962686],"category_scores_gemma":[0.0040114825,0.00034558625,0.00030978885,0.00057779945,0.00010935426,0.0002819416,0.009465948,0.00081723154,7.0047486e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109134366,0.0004803954,0.0055605606,0.0040443945,0.0005238885,0.000009086668,0.049324047,0.0063101766,0.003380245,0.008866552,0.010203508,0.911188],"study_design_scores_gemma":[0.0065063173,0.0036675646,0.019375982,0.038446117,0.001203379,0.00058677327,0.041378796,0.3474248,0.29403508,0.12007425,0.11462758,0.012673359],"about_ca_topic_score_codex":0.000101769954,"about_ca_topic_score_gemma":0.000011418345,"teacher_disagreement_score":0.8985146,"about_ca_system_score_codex":0.000074374024,"about_ca_system_score_gemma":0.000096206204,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W3157856659","doi":"10.48550/arxiv.2104.12350","title":"A PGAS Communication Library for Heterogeneous Clusters","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Partitioned global address space; Computer science; Programming language; Programming paradigm","score_opus":0.06169652555526881,"score_gpt":0.19875683426621232,"score_spread":0.13706030871094352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157856659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014970583,0.00027142084,0.9813687,0.000308148,0.0002131934,0.0003577022,0.000010285686,0.001073059,0.0014268992],"genre_scores_gemma":[0.82699615,0.0005128847,0.17085105,0.000346001,0.000029378722,0.000003781786,0.00013363993,0.00002270068,0.0011044377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985474,0.00019732903,0.00019332915,0.00077221124,0.000053771364,0.00023596428],"domain_scores_gemma":[0.9977509,0.00014614014,0.00023851734,0.0016326488,0.00012991286,0.000101903795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014464199,0.00022521648,0.00025967078,0.00017738598,0.0002067577,0.0003464791,0.00230286,0.00024589634,0.000010567728],"category_scores_gemma":[0.000021681537,0.00028503977,0.00023846963,0.00034746848,0.000057671703,0.00045262967,0.0031402616,0.00030096225,0.000005856163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001676501,0.00007905267,0.00015244856,0.00007706094,0.000071585004,0.000050369796,0.0003167896,0.9637936,0.0000040205623,0.03173743,0.0027478691,0.00095300685],"study_design_scores_gemma":[0.00024282673,0.000033420274,0.000024305056,0.0001103155,0.000023869688,0.0000064556784,0.00002092434,0.9804807,0.00046450566,0.016676193,0.0016020727,0.0003144327],"about_ca_topic_score_codex":0.000020306656,"about_ca_topic_score_gemma":0.0000056541667,"teacher_disagreement_score":0.81202555,"about_ca_system_score_codex":0.00007580155,"about_ca_system_score_gemma":0.00019292175,"threshold_uncertainty_score":0.9999602},"labels":[],"label_agreement":null},{"id":"W3159593435","doi":"10.48550/arxiv.2105.00613","title":"A C++17 Thread Pool for High-Performance Scientific Computing","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Thread (computing); Computer science; Software portability; Multithreading; Programmer; Parallel computing; Operating system; POSIX Threads; Simultaneous multithreading; Programming language; Computer architecture","score_opus":0.06436395702687998,"score_gpt":0.20537637502263287,"score_spread":0.14101241799575287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159593435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26924664,0.000060026832,0.7283179,0.00006266131,0.0008569975,0.00031770143,0.0000067400547,0.0006998866,0.00043142383],"genre_scores_gemma":[0.8839267,0.000046365418,0.11393997,0.00009669591,0.000083628256,0.0000016659367,0.0000681036,0.000019021712,0.0018178641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974889,0.00009702282,0.00028190366,0.0015266474,0.00012885703,0.0004766484],"domain_scores_gemma":[0.9974121,0.00013794417,0.00035021247,0.0014486117,0.00052101194,0.00013013987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054991903,0.00033269785,0.00039413988,0.00033976053,0.0006205871,0.00076133816,0.0022725554,0.0002644153,0.000008262576],"category_scores_gemma":[0.00004488609,0.00040171246,0.00019162647,0.0008725058,0.00014066987,0.00042890557,0.0025434524,0.0004270256,0.000012940404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009947488,0.00008241663,0.00050263654,0.00012459408,0.00005217945,0.00003857421,0.00024457034,0.94258976,0.000025779196,0.052562248,0.0015842544,0.002183048],"study_design_scores_gemma":[0.00033574397,0.000048951297,0.00047399686,0.00022598574,0.000029524645,0.000004661897,0.00002050696,0.98809034,0.0014342945,0.0085708415,0.00029713564,0.000467997],"about_ca_topic_score_codex":0.00004202565,"about_ca_topic_score_gemma":0.0000087993785,"teacher_disagreement_score":0.61468005,"about_ca_system_score_codex":0.00016817296,"about_ca_system_score_gemma":0.00038658502,"threshold_uncertainty_score":0.9998435},"labels":[],"label_agreement":null},{"id":"W3160898425","doi":"10.1145/3505250","title":"MetaSys: A Practical Open-source Metadata Management System to Implement and Evaluate Cross-layer Optimizations","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Metadata; Software; Interface (matter); Operating system; File system; Application layer; Embedded system; Computer architecture","score_opus":0.039247722767542396,"score_gpt":0.3404366622681214,"score_spread":0.301188939500579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160898425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011105952,0.00006257792,0.9921872,0.005068014,0.00012634367,0.001227067,0.00007629658,0.0004629592,0.0006784902],"genre_scores_gemma":[0.06482781,0.00009224327,0.93201214,0.0014431213,0.000013045097,0.00062382786,0.000047890513,0.000033110307,0.00090680755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975316,0.00040152363,0.0004245536,0.00083978556,0.00048101126,0.00032154738],"domain_scores_gemma":[0.9983644,0.00016251198,0.00014633726,0.0010212162,0.00010736935,0.00019818841],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00082581415,0.00027032895,0.00027354056,0.000433383,0.0015480234,0.0010690339,0.0010870127,0.000047438938,0.00006393604],"category_scores_gemma":[0.000030954045,0.00026553305,0.000056022953,0.0008848707,0.00003333047,0.00062237115,0.000640936,0.00029591512,0.0000027636106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059650392,0.000114916125,0.000005042476,0.000022813167,0.00009574427,0.0000062855624,0.0004482877,0.96438396,0.000006732313,0.006972127,0.00026983515,0.027614614],"study_design_scores_gemma":[0.00088627165,0.00035282262,0.000030204981,0.000027979633,0.00012026643,0.00017256169,0.00020413355,0.97900677,0.00015439728,0.00046336878,0.018216087,0.00036512784],"about_ca_topic_score_codex":0.000027978898,"about_ca_topic_score_gemma":0.000011027783,"teacher_disagreement_score":0.06471675,"about_ca_system_score_codex":0.00011185931,"about_ca_system_score_gemma":0.00006232806,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W3161455369","doi":"10.1145/949343.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Just-in-time compilation; Java; Suite; Programming language; Benchmark (surveying); Set (abstract data type); Metric (unit)","score_opus":0.026085039855794065,"score_gpt":0.28849246355163466,"score_spread":0.2624074236958406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161455369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021959068,0.00028535063,0.992269,0.0003573817,0.00028642308,0.00015951539,0.0000026990474,0.0004563574,0.003987402],"genre_scores_gemma":[0.38349393,0.000014498113,0.61591035,0.00024996194,0.000009728303,0.0000098024875,0.0000037759276,0.000006203598,0.00030174968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991465,0.000050190974,0.00016398054,0.00027382854,0.00014217867,0.00022331753],"domain_scores_gemma":[0.9985982,0.0005663252,0.00009696961,0.0005951803,0.000086335975,0.00005696218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036710507,0.00010408074,0.000121876525,0.00015520843,0.00013305321,0.00014963582,0.001035561,0.000056358644,0.000006066539],"category_scores_gemma":[0.0009661418,0.00009617789,0.00004800429,0.000430472,0.000017418444,0.00022554422,0.00010283917,0.00006199099,0.000021530113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029411487,0.00048162317,0.005539598,0.00023015242,0.00016537274,0.000031639713,0.0021327466,0.05244216,0.0007508338,0.7469526,0.055748083,0.13549578],"study_design_scores_gemma":[0.0005434999,0.0002332029,0.0005559557,0.0000238632,0.000018948385,0.000012945277,0.00002867125,0.8841853,0.0049221897,0.033993118,0.074990526,0.000491769],"about_ca_topic_score_codex":0.0000054540346,"about_ca_topic_score_gemma":0.0000034571303,"teacher_disagreement_score":0.8317431,"about_ca_system_score_codex":0.000021429425,"about_ca_system_score_gemma":0.000038567425,"threshold_uncertainty_score":0.39220205},"labels":[],"label_agreement":null},{"id":"W3163215105","doi":"","title":"IDEal: Efficient and Precise Alias-Aware Dataflow Analysis","year":2017,"lang":"en","type":"article","venue":"Conference on Object-Oriented Programming Systems, Languages, and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Alias; Computer science; Dataflow; Aliasing; Ideal (ethics); Programming language; Static analysis; Theoretical computer science; Parallel computing; Algorithm; Data mining; Artificial intelligence","score_opus":0.024022456787395396,"score_gpt":0.31973205233373947,"score_spread":0.2957095955463441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163215105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036741337,0.0009461702,0.9917127,0.00022734687,0.00008543207,0.00097477884,0.000047316084,0.00059593713,0.0017361705],"genre_scores_gemma":[0.9769032,0.00017043915,0.021748215,0.000031645035,0.000082289545,0.00052026665,0.00012064267,0.000013890176,0.00040941045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816585,0.000099993274,0.00035697836,0.00077465246,0.0002747948,0.00032771862],"domain_scores_gemma":[0.9975379,0.00009140076,0.00038656674,0.0015278709,0.00025875683,0.00019750126],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047581785,0.00023727206,0.00035694265,0.00024501313,0.0010244068,0.0013461383,0.0008361457,0.00010592395,0.000002977638],"category_scores_gemma":[0.00007833764,0.00021522463,0.00006001531,0.00040027747,0.00016328256,0.00017634836,0.00034546695,0.00016336603,0.000008528542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021538459,0.00054711394,0.0031490808,0.00025597416,0.00037386693,0.000017953796,0.0022179412,0.0015791376,0.000101193655,0.4784851,0.0009101851,0.5123409],"study_design_scores_gemma":[0.0013142786,0.00031573017,0.0029554472,0.00030786588,0.0003255937,0.00003539553,0.0013285627,0.91806614,0.0003035592,0.00032236608,0.0737349,0.000990167],"about_ca_topic_score_codex":0.00040831795,"about_ca_topic_score_gemma":0.00003426455,"teacher_disagreement_score":0.97322905,"about_ca_system_score_codex":0.000031045103,"about_ca_system_score_gemma":0.000059037255,"threshold_uncertainty_score":0.99969053},"labels":[],"label_agreement":null},{"id":"W3167435556","doi":"10.1145/966049.781532","title":"Using generative design patterns to generate parallel code for a distributed memory environment","year":2003,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Software design pattern; Programmer; Programming language; Design pattern; Code generation; Distributed memory; Code (set theory); Synchronization (alternating current); Set (abstract data type); Object-oriented programming; Java; Parallel computing; Distributed computing; Shared memory; Software; Operating system; Key (lock)","score_opus":0.0906055666464555,"score_gpt":0.3005933843122476,"score_spread":0.20998781766579208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167435556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01090823,0.00008832898,0.98760283,0.00034746114,0.00014670136,0.00057632267,0.00006640779,0.00021756848,0.000046177753],"genre_scores_gemma":[0.1914732,0.000011863268,0.80772,0.000579991,0.00005025726,0.00006496174,0.000024244588,0.000014244723,0.00006122567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984211,0.00023054406,0.00027258607,0.0005108681,0.0001951419,0.0003697674],"domain_scores_gemma":[0.99870354,0.00029264754,0.00014295599,0.00066053245,0.000057535042,0.00014281087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043708636,0.00021341717,0.00021407178,0.00008629189,0.00026545144,0.00019722006,0.0008622361,0.00006955382,0.000012505918],"category_scores_gemma":[0.00018767503,0.00020103605,0.00005540586,0.00014967112,0.000021083728,0.00020916328,0.00018205849,0.000073212446,0.0000152135935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013262272,0.000054058037,0.00021298381,0.000009748809,0.000028694809,0.00000754118,0.00049306534,0.99292004,0.0014568089,0.002065781,0.0016848118,0.0010532193],"study_design_scores_gemma":[0.00049114827,0.00021572,0.00014978806,0.00002586281,0.000022035287,0.000008671852,0.000037518264,0.9423512,0.051588956,0.0017977384,0.0028576592,0.00045368535],"about_ca_topic_score_codex":0.00001426572,"about_ca_topic_score_gemma":0.0000047800977,"teacher_disagreement_score":0.18056497,"about_ca_system_score_codex":0.00007397751,"about_ca_system_score_gemma":0.00005700493,"threshold_uncertainty_score":0.8198012},"labels":[],"label_agreement":null},{"id":"W3168206633","doi":"10.1109/syscon48628.2021.9447121","title":"System execution path profiling using hardware performance counters","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; Polytechnique Montréal","funders":"","keywords":"Computer science; Interrupt; Profiling (computer programming); Call stack; Microarchitecture; Machine code; Operating system; Parallel computing; Kernel (algebra); Embedded system; Stack (abstract data type)","score_opus":0.021936458599544288,"score_gpt":0.24820890349927346,"score_spread":0.22627244489972917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168206633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03874402,0.00007227605,0.95446616,0.000043885655,0.00024424985,0.000067716894,5.2812027e-7,0.0008960287,0.0054651075],"genre_scores_gemma":[0.57764316,0.000008864554,0.4220522,0.00008454465,0.000023612825,0.0000025280508,0.0000029610965,0.0000039036663,0.00017820152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916726,0.000047369394,0.00017166507,0.0002672858,0.00017733425,0.00016906623],"domain_scores_gemma":[0.999368,0.000013675565,0.000063020925,0.00031709718,0.00019808437,0.000040083716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019087442,0.00008631722,0.000102103804,0.000048968206,0.00017275718,0.00016393523,0.0002672287,0.00004064643,0.0000030674062],"category_scores_gemma":[0.00001080493,0.000081865204,0.000034991914,0.0002998388,0.000010631975,0.00035130655,0.00014935654,0.000067709065,0.0000101067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022582137,0.00025879746,0.017898161,0.0013640925,0.00010975726,0.00030093413,0.0023175864,0.56612563,0.024257734,0.34782586,0.004859243,0.034659598],"study_design_scores_gemma":[0.00007129255,0.000012495116,0.00008140775,0.00011065979,0.0000022072666,0.000068040725,0.00007112079,0.9595902,0.039648492,0.000015755635,0.00022003277,0.00010829773],"about_ca_topic_score_codex":0.0000075122803,"about_ca_topic_score_gemma":2.354292e-7,"teacher_disagreement_score":0.5388991,"about_ca_system_score_codex":0.00010107436,"about_ca_system_score_gemma":0.00010490163,"threshold_uncertainty_score":0.33383662},"labels":[],"label_agreement":null},{"id":"W3173842020","doi":"10.1109/ipdpsw52791.2021.00014","title":"A Streaming Accelerator for Heterogeneous CPU-FPGA Processing of Graph Applications","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Hardware acceleration; Parallel computing; Central processing unit; Software; Multi-core processor; CPU shielding; Field-programmable gate array; Cache; Graph; Thread (computing); Granularity; Embedded system; Symmetric multiprocessor system; Computer architecture; Operating system; Computer hardware; Theoretical computer science","score_opus":0.023796534023687203,"score_gpt":0.2853207233079341,"score_spread":0.2615241892842469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173842020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010530021,0.00025704651,0.9968332,0.00012513023,0.000019901896,0.00018096433,0.0000020715324,0.0003164978,0.0012121988],"genre_scores_gemma":[0.43120322,0.000009737349,0.56845355,0.00011207721,0.000017360593,0.00007092774,0.0000042062834,0.0000047804892,0.00012412824],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993098,0.000016427322,0.00019686561,0.00025233018,0.000093713075,0.00013090999],"domain_scores_gemma":[0.99923056,0.000046530535,0.00008974275,0.0002958889,0.00029853114,0.000038720085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008133039,0.00007308893,0.00011402859,0.00006435078,0.00011702128,0.000068752866,0.0003381679,0.0000357238,0.0000041928215],"category_scores_gemma":[0.000015034312,0.00007106313,0.000060233397,0.00039995025,0.000016808199,0.0001313945,0.00010409341,0.00003302709,8.841911e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008861783,0.00060475984,0.0006217785,0.000408518,0.00007323403,0.000007816785,0.0009124403,0.024709523,0.016174756,0.09035962,0.0016054639,0.8645132],"study_design_scores_gemma":[0.00030412196,0.0000660278,0.00007714381,0.0000478447,0.000010286513,0.000029615358,0.00003610961,0.45499235,0.52805805,0.011439379,0.004671695,0.00026733612],"about_ca_topic_score_codex":0.0000026899206,"about_ca_topic_score_gemma":0.000002289229,"teacher_disagreement_score":0.8642459,"about_ca_system_score_codex":0.000009723124,"about_ca_system_score_gemma":0.00010021931,"threshold_uncertainty_score":0.28978702},"labels":[],"label_agreement":null},{"id":"W3173867637","doi":"10.1145/3461648.3463856","title":"Cache abstraction for data race detection in heterogeneous systems with non-coherent accelerators","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache coherence; Synchronization (alternating current); Cache; Abstraction; Coherence (philosophical gambling strategy); CPU cache; Embedded system; MESI protocol; Power consumption; Parallel computing; Computer architecture; Power (physics); Cache algorithms; Computer network","score_opus":0.042221091268339485,"score_gpt":0.2876371118685665,"score_spread":0.24541602060022702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173867637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016292986,0.000082384504,0.98233235,0.000076239434,0.00023149044,0.00027487456,0.0000017175053,0.00024843792,0.00045950722],"genre_scores_gemma":[0.9042342,0.000017617953,0.09536839,0.00004763273,0.000038496695,0.000044551307,0.000020138981,0.000008318134,0.00022071112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990277,0.000044348308,0.0002018721,0.00043293144,0.00013116797,0.00016194147],"domain_scores_gemma":[0.9990148,0.0000712438,0.00008514318,0.00066553755,0.00012306776,0.000040216873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024296105,0.00009850404,0.00012656482,0.000071367336,0.00008113751,0.00024568944,0.00044553948,0.00005862928,0.0000025308457],"category_scores_gemma":[0.000026427813,0.00008484451,0.00001768314,0.0002903078,0.000007207122,0.00039907455,0.00015239477,0.00008198047,0.0000034734428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081369624,0.00047447527,0.0013473232,0.00019731265,0.00009661111,0.00009767998,0.00039395096,0.8063399,0.006081389,0.0008638634,0.0025902127,0.18143587],"study_design_scores_gemma":[0.00030375473,0.00006149541,0.00016877548,0.000025128638,0.0000032230373,0.000061938495,0.000020451296,0.9563121,0.04114144,0.000020370466,0.0017564719,0.00012483807],"about_ca_topic_score_codex":0.00014097069,"about_ca_topic_score_gemma":0.00026902417,"teacher_disagreement_score":0.8879412,"about_ca_system_score_codex":0.00005950136,"about_ca_system_score_gemma":0.00007716689,"threshold_uncertainty_score":0.3459859},"labels":[],"label_agreement":null},{"id":"W3174187495","doi":"10.1002/spe.3005","title":"Benchmarking and learning garbage collection delays for resource‐restricted graphical user interfaces","year":2021,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; IBM (Canada)","funders":"","keywords":"Computer science; Garbage collection; Benchmarking; Graphical user interface; Benchmark (surveying); Operating system; Resource (disambiguation); Cloud computing; Java; Interface (matter); Database; Garbage; Embedded system; Programming language","score_opus":0.01363180698335234,"score_gpt":0.2815275982120186,"score_spread":0.26789579122866625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174187495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0848806,0.00079960533,0.91299164,0.00060631364,0.000086326865,0.00010517651,3.894299e-7,0.00032786166,0.00020209604],"genre_scores_gemma":[0.36885077,0.00047211943,0.6299133,0.00048478856,0.0000376009,0.00004357661,0.000004149477,0.000008210872,0.00018549485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988616,0.00018322973,0.00017469998,0.00044102478,0.00014263747,0.00019682522],"domain_scores_gemma":[0.9983469,0.0010887203,0.000121046265,0.00017260094,0.00019382396,0.00007687091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027427697,0.00011233057,0.00012241809,0.00008039922,0.00060828216,0.00040161097,0.00015971264,0.00007788839,0.0000033633687],"category_scores_gemma":[0.0021894758,0.00011456437,0.000023626526,0.00046867295,0.00006338667,0.00080400414,0.0002450296,0.00022737963,4.3610427e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522772,0.0007044906,0.04077167,0.00033385484,0.00024071745,0.00034484055,0.1553613,0.008347325,0.0054416955,0.025941158,0.013222325,0.74863833],"study_design_scores_gemma":[0.0017932191,0.0014321988,0.006691705,0.00035401084,0.000078663965,0.0013546463,0.008760226,0.599092,0.014136491,0.002411562,0.36242235,0.001472928],"about_ca_topic_score_codex":0.000024831283,"about_ca_topic_score_gemma":0.0000027336828,"teacher_disagreement_score":0.74716544,"about_ca_system_score_codex":0.00001539357,"about_ca_system_score_gemma":0.000047062873,"threshold_uncertainty_score":0.46784762},"labels":[],"label_agreement":null},{"id":"W3174520665","doi":"10.1145/3409964.3461820","title":"PHPRX: An Efficient Hash Table for Persistent Memory","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Operating system; Memory management; Allocator; CAS latency; Interleaved memory; Memory map; Hash table; Hash function; Semiconductor memory; Embedded system; Memory controller; Programming language","score_opus":0.026441268887185756,"score_gpt":0.2667072151296781,"score_spread":0.24026594624249234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174520665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018180971,0.0001270601,0.9829009,0.0006240662,0.00019887705,0.00011973651,0.0000011231466,0.000586373,0.0136237275],"genre_scores_gemma":[0.15341556,0.0000055364862,0.8382346,0.000870856,0.00004757679,0.000020228772,0.000008954621,0.00000735028,0.0073893066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914616,0.000036876267,0.00013327203,0.00034339813,0.00013678308,0.00020348628],"domain_scores_gemma":[0.99916935,0.000042269796,0.000035101424,0.0004542772,0.00021765563,0.00008133434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022524632,0.00008058846,0.000102575075,0.000042768064,0.00016495584,0.00018117746,0.00040899825,0.00003633649,0.000030984975],"category_scores_gemma":[0.00003386167,0.00007496094,0.000080817976,0.00022805431,0.000014087436,0.00011532847,0.00015560293,0.00004130976,0.000009955061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071410113,0.0005731565,0.000035526158,0.000036908936,0.00003787901,0.000014140172,0.0010953286,0.8392724,0.001085791,0.09721949,0.034942154,0.025680108],"study_design_scores_gemma":[0.00018312389,0.000074197495,0.000015997926,0.0000068147538,0.0000034895704,0.00001175339,0.000058190006,0.9793796,0.013983468,0.00029226553,0.005871091,0.000119995166],"about_ca_topic_score_codex":0.000008611478,"about_ca_topic_score_gemma":0.0000026216367,"teacher_disagreement_score":0.15159747,"about_ca_system_score_codex":0.000027771886,"about_ca_system_score_gemma":0.00010230303,"threshold_uncertainty_score":0.30568182},"labels":[],"label_agreement":null},{"id":"W3175004880","doi":"10.1145/3459010","title":"KernelFaRer","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Compiler; x86; Parallel computing; Source code; Kernel (algebra); Programming language; SIMD; Linear algebra; Code (set theory); Overhead (engineering); Block (permutation group theory); Software","score_opus":0.01197056625438376,"score_gpt":0.24026094265087528,"score_spread":0.22829037639649152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175004880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014270449,0.000121045516,0.993272,0.0043324423,0.00010699859,0.00007999473,0.0000058132678,0.00045470337,0.0014842675],"genre_scores_gemma":[0.10225711,0.0002758332,0.89553076,0.001217575,0.000020441968,0.000015832462,0.0000122369065,0.000012836971,0.00065740483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.00007808768,0.00015522464,0.00037089107,0.00015078872,0.00015624275],"domain_scores_gemma":[0.99912214,0.00008097473,0.000042730684,0.00057872763,0.00010145699,0.00007399394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075230935,0.00013128133,0.00011577317,0.00012298678,0.00026277162,0.00014966237,0.0003123262,0.000074784526,0.000051347077],"category_scores_gemma":[0.000031474967,0.00012692004,0.000051001385,0.00042641466,0.000027501173,0.0001537216,0.000024011457,0.00017491945,0.0000053031968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049656105,0.000047968733,0.0000047977624,0.000004927526,0.000012278228,0.000005511957,0.00021908745,0.88860327,0.000052660384,0.001004687,0.000068130925,0.10997174],"study_design_scores_gemma":[0.00046986848,0.00010894504,0.000059545942,0.000040412684,0.000019020103,0.0001380623,0.000022162472,0.9760673,0.012194068,0.0061684484,0.0043739,0.00033828954],"about_ca_topic_score_codex":0.0000025331688,"about_ca_topic_score_gemma":0.00000788097,"teacher_disagreement_score":0.10963345,"about_ca_system_score_codex":0.000015078248,"about_ca_system_score_gemma":0.000045999375,"threshold_uncertainty_score":0.5175649},"labels":[],"label_agreement":null},{"id":"W3175620523","doi":"10.1145/3471485.3471506","title":"Scaling Dynamic Hash Tables on Real Persistent Memory","year":2021,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Hash function; Scalability; Emulation; Parallel computing; Hash table; Latency (audio); Embedded system; Operating system; Programming language","score_opus":0.021875223175109013,"score_gpt":0.2662600561580582,"score_spread":0.2443848329829492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175620523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07574878,0.0003380638,0.9008889,0.0030239592,0.0010531949,0.00015438843,0.0000029484167,0.0012024883,0.017587263],"genre_scores_gemma":[0.45931467,0.00042905033,0.5346201,0.0007828897,0.000096290525,0.000014240252,0.000018193063,0.000022570624,0.0047019897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986489,0.00010798479,0.00022419773,0.00050601223,0.00023617317,0.00027674675],"domain_scores_gemma":[0.9984357,0.00021707971,0.00008790912,0.0010439779,0.0001299273,0.000085444924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023239489,0.00014755833,0.00018435247,0.000095934854,0.00020161751,0.00017466069,0.0009462096,0.00008180818,0.000031468167],"category_scores_gemma":[0.0002241819,0.0001456991,0.0001375659,0.00034270587,0.000026454041,0.00016566327,0.00050195056,0.00014253684,0.00003382133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002917275,0.00039700777,0.00073420716,0.00006129863,0.00012402411,0.000203082,0.0013279377,0.05275566,0.0029121232,0.007122808,0.022733156,0.9115995],"study_design_scores_gemma":[0.0004126621,0.00022145193,0.00039537743,0.00016303238,0.00001618843,0.000050851013,0.000106163534,0.9780037,0.007481569,0.0053349235,0.0073082293,0.0005058943],"about_ca_topic_score_codex":0.00005211837,"about_ca_topic_score_gemma":0.000024755307,"teacher_disagreement_score":0.92524797,"about_ca_system_score_codex":0.00008436527,"about_ca_system_score_gemma":0.00010210542,"threshold_uncertainty_score":0.59414375},"labels":[],"label_agreement":null},{"id":"W3179405255","doi":"10.1109/rtas52030.2021.00017","title":"A Systematic Approach to Achieving Tight Worst-Case Latency and High-Performance Under Predictable Cache Coherence","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; MESI protocol; Cache coherence; Cache; MESIF protocol; Bus sniffing; Cache algorithms; Cache invalidation; Latency (audio); Predictability; Cache pollution; Speedup; Multi-core processor; Distributed computing; Coherence (philosophical gambling strategy); Parallel computing; Computer architecture; CPU cache; Telecommunications","score_opus":0.01703616651209438,"score_gpt":0.2244730477655414,"score_spread":0.207436881253447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179405255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037052702,0.0003030838,0.95254964,0.00022900017,0.00008003316,0.00033272785,5.104916e-7,0.0005450497,0.008907274],"genre_scores_gemma":[0.613346,0.000018713446,0.38468027,0.00028877176,0.000012861508,0.000038066064,0.000001419529,0.0000064385617,0.001607484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986002,0.00013416058,0.0003170449,0.00047121808,0.00020774941,0.0002696674],"domain_scores_gemma":[0.9989807,0.00009842892,0.00007872909,0.00056662795,0.0001356436,0.00013987618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042729804,0.00015800692,0.0002602174,0.00009163019,0.00022523888,0.0003105173,0.0003929456,0.00006535481,0.000007430572],"category_scores_gemma":[0.000059079153,0.00012895379,0.00002396513,0.0006113474,0.000021086013,0.00037833728,0.00041792725,0.00012308815,0.000015542153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033109605,0.0016725337,0.010026826,0.032044757,0.00055732724,0.0012377044,0.0123372115,0.42625147,0.0021890616,0.48472518,0.012941325,0.015983477],"study_design_scores_gemma":[0.00018680556,0.000059772075,0.0006781586,0.00091285043,0.000016010741,0.0011439256,0.0000750134,0.99440634,0.001861039,0.0003553465,0.000018536004,0.00028619124],"about_ca_topic_score_codex":0.000038460053,"about_ca_topic_score_gemma":0.000004030761,"teacher_disagreement_score":0.57629323,"about_ca_system_score_codex":0.000033680815,"about_ca_system_score_gemma":0.00007705989,"threshold_uncertainty_score":0.5258583},"labels":[],"label_agreement":null},{"id":"W3180326417","doi":"10.1109/rtas52030.2021.00016","title":"A Hardware Platform for Exploring Predictable Cache Coherence Protocols for Real-time Multicores","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache coherence; Embedded system; Memory hierarchy; Multi-core processor; Computer architecture; Latency (audio); Benchmark (surveying); Dataflow; Cache; Parallel computing; CPU cache; Cache algorithms","score_opus":0.10417391417346357,"score_gpt":0.3221558652333993,"score_spread":0.21798195105993573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180326417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047154445,0.00001170532,0.98661906,0.00019149257,0.0000678989,0.008555202,0.000013581437,0.0011263143,0.0029431903],"genre_scores_gemma":[0.0030471443,0.000007684983,0.95552903,0.00010735603,0.0000735754,0.036527853,0.00002359915,0.000017178783,0.00466656],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873734,0.000019177605,0.0002799812,0.00045598208,0.00016252651,0.00034501305],"domain_scores_gemma":[0.9986362,0.00029396513,0.00009282937,0.0004920731,0.0003968009,0.000088153734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029487276,0.00014631402,0.00021209756,0.000054936412,0.00022315989,0.00026758094,0.0005718804,0.000063673026,0.000022406184],"category_scores_gemma":[0.000232236,0.0001335977,0.000094559815,0.00021354498,0.000018085793,0.0005968726,0.00021278996,0.000056644654,0.0000073566503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048778037,0.0017734895,0.0025051318,0.002384984,0.00039413726,0.00005618323,0.00842781,0.07400833,0.06426346,0.26511234,0.32862306,0.25196326],"study_design_scores_gemma":[0.00075124134,0.00019658497,0.000058313555,0.00012758678,0.0000051947463,0.000006509408,0.000030063065,0.8403979,0.14097862,0.0029072608,0.0143025955,0.00023814],"about_ca_topic_score_codex":0.000020202217,"about_ca_topic_score_gemma":0.000004486455,"teacher_disagreement_score":0.76638955,"about_ca_system_score_codex":0.000042715244,"about_ca_system_score_gemma":0.00018332609,"threshold_uncertainty_score":0.54479563},"labels":[],"label_agreement":null},{"id":"W3181327668","doi":"10.1145/3465084.3467939","title":"An Efficient Adaptive Partial Snapshot Implementation","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Snapshot (computer storage); Computer science; Parallel computing; Algorithm; Theoretical computer science; Computer engineering; Distributed computing; Operating system","score_opus":0.025142563324742767,"score_gpt":0.3196502248659279,"score_spread":0.29450766154118513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181327668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008884726,0.00001786789,0.98542917,0.0002778892,0.00011297757,0.000059151575,7.3156923e-7,0.00035404976,0.0048634233],"genre_scores_gemma":[0.638383,0.0000020658886,0.36121997,0.00030655932,0.000025600692,0.0000053159633,0.0000153159,0.000002303018,0.000039913015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920106,0.00008609871,0.00013885974,0.00027224544,0.00015115738,0.00015059016],"domain_scores_gemma":[0.99943995,0.000019481718,0.00003854856,0.0003168592,0.00012209271,0.000063070926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014960706,0.00006594694,0.00006629046,0.000038258815,0.00009964083,0.00013169563,0.00025786288,0.000023037033,0.00020016535],"category_scores_gemma":[0.000005778688,0.00006297827,0.00002824993,0.00024702674,0.00001030696,0.00015607702,0.00009617389,0.000041466577,0.00001369523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007711174,0.00035498734,0.00058681844,0.0000039625133,0.00002426124,0.000042846183,0.0017752831,0.19510926,0.0028299005,0.72246224,0.008710012,0.068092726],"study_design_scores_gemma":[0.00014475084,0.00007684451,0.0005173112,0.0000020952102,0.0000017262729,0.0000073933043,0.000090186455,0.91254205,0.08510389,0.0006774377,0.0007318586,0.00010445275],"about_ca_topic_score_codex":0.000019567917,"about_ca_topic_score_gemma":0.000007815503,"teacher_disagreement_score":0.7217848,"about_ca_system_score_codex":0.000021331152,"about_ca_system_score_gemma":0.00007832651,"threshold_uncertainty_score":0.25681797},"labels":[],"label_agreement":null},{"id":"W3183627489","doi":"10.23919/date51398.2021.9474238","title":"Automated Synthesis of Predictable and High-Performance Cache Coherence Protocols","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache coherence; MESI protocol; Predictability; Correctness; Implementation; MESIF protocol; Protocol (science); Embedded system; Cache; Construct (python library); Multi-core processor; Computer architecture; Distributed computing; Parallel computing; Cache algorithms; CPU cache; Programming language","score_opus":0.016208936845032468,"score_gpt":0.2614073387136369,"score_spread":0.24519840186860445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183627489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057962567,0.000054906508,0.92555404,0.00031508674,0.000045334207,0.0022552358,0.0000028362722,0.0027040413,0.011105928],"genre_scores_gemma":[0.6541836,0.000011708981,0.34488586,0.000046299898,0.000004902283,0.0005187794,6.320869e-7,0.000003263399,0.00034496168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992679,0.000053566226,0.00018920525,0.00022084094,0.00013970319,0.00012880017],"domain_scores_gemma":[0.9993087,0.000086927364,0.00007594414,0.0003357511,0.00015245513,0.000040188435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018507829,0.00007569455,0.00014714285,0.000040536623,0.000060144077,0.00006453974,0.0002996315,0.00004410426,0.00001753913],"category_scores_gemma":[0.00007514067,0.00006583203,0.000012860812,0.00031930584,0.00003495765,0.00022730732,0.0002014036,0.00004666993,0.0000029788816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008953563,0.001887881,0.10584607,0.0027661151,0.00035202454,0.000110621935,0.0022435163,0.1044066,0.073123164,0.14394304,0.06209497,0.50313646],"study_design_scores_gemma":[0.000079380465,0.000037068672,0.003982128,0.00008649096,0.0000017825535,0.00000938812,0.0000025594484,0.63455105,0.3609215,0.000107429325,0.00015118814,0.00007006412],"about_ca_topic_score_codex":0.000023053628,"about_ca_topic_score_gemma":9.438075e-7,"teacher_disagreement_score":0.596221,"about_ca_system_score_codex":0.000009047689,"about_ca_system_score_gemma":0.00009464112,"threshold_uncertainty_score":0.2684552},"labels":[],"label_agreement":null},{"id":"W3184805929","doi":"","title":"{SKQ}: Event Scheduling for Optimizing Tail Latency in a Traditional {OS} Kernel","year":2021,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Latency (audio); Kernel (algebra); Scheduling (production processes); Distributed computing; Parallel computing; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.055024117004007264,"score_gpt":0.29660087628433773,"score_spread":0.24157675928033046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184805929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038907265,0.00014192956,0.9914381,0.0020058758,0.00013906442,0.00026830516,0.000023946182,0.0006921344,0.001399924],"genre_scores_gemma":[0.5108824,0.00004017129,0.48855883,0.00024368115,0.00004125952,0.00006183191,0.00001860065,0.000009686287,0.00014356399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978423,0.00010555892,0.00054620404,0.00072035036,0.00032895844,0.00045659015],"domain_scores_gemma":[0.9984418,0.00030619756,0.00013010549,0.0004977928,0.00048350616,0.00014058004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005191811,0.00022335614,0.0003146961,0.00016063868,0.00015229634,0.00019862011,0.0008965504,0.00020165501,0.00003317583],"category_scores_gemma":[0.00044795105,0.00023556087,0.00014838144,0.00057882944,0.00007315444,0.000476638,0.0003473556,0.00038331884,0.0000111390455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048171558,0.0008919308,0.0005570523,0.00009401294,0.000034415476,0.00016928563,0.0010079286,0.054749925,0.0058182725,0.90945995,0.003176221,0.023992844],"study_design_scores_gemma":[0.0011843082,0.00027973027,0.0019070694,0.00037926447,0.0000125893275,0.000115264185,0.00011547477,0.90309757,0.009274145,0.079604,0.0032014872,0.0008291091],"about_ca_topic_score_codex":0.000011969929,"about_ca_topic_score_gemma":0.0000146794755,"teacher_disagreement_score":0.8483476,"about_ca_system_score_codex":0.00008891586,"about_ca_system_score_gemma":0.00041373222,"threshold_uncertainty_score":0.96058935},"labels":[],"label_agreement":null},{"id":"W3185954029","doi":"10.4230/lipics.icalp.2021.44","title":"Lifting for Constant-Depth Circuits and Applications to MCSP","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Constant (computer programming); Electronic circuit; Computer science; Electrical engineering; Engineering","score_opus":0.024541543105000695,"score_gpt":0.2865105065907636,"score_spread":0.26196896348576293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185954029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015507012,0.000079389516,0.9897199,0.0006560922,0.00019890307,0.0013072405,0.00015039032,0.0004751589,0.005862214],"genre_scores_gemma":[0.2434498,0.00005871285,0.750925,0.0039138948,0.00018097665,0.0007192746,0.0002492037,0.00004195574,0.00046115043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818647,0.000023812268,0.0007125921,0.0003395313,0.00022938309,0.000508197],"domain_scores_gemma":[0.9981009,0.00024405326,0.00024151252,0.0006326999,0.0005507975,0.00023003413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004356972,0.00024102286,0.00031326708,0.00018250199,0.0004799802,0.0005725694,0.0006647972,0.0001269354,0.000003375382],"category_scores_gemma":[0.00016281113,0.0002482489,0.00011692366,0.00044306865,0.000051315143,0.00064972165,0.00045192402,0.00015887873,0.00002074093],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041013278,0.00056523696,0.0040466413,0.0015229065,0.00029058507,0.000007794387,0.01608098,0.0036272558,0.00054582884,0.4558623,0.029516311,0.48789313],"study_design_scores_gemma":[0.0029590293,0.00034536514,0.00035064094,0.00029456988,0.000047322457,0.00019088914,0.0009065236,0.4500862,0.008119639,0.008815056,0.5266828,0.001201957],"about_ca_topic_score_codex":0.0000022943875,"about_ca_topic_score_gemma":0.0000061023775,"teacher_disagreement_score":0.4971665,"about_ca_system_score_codex":0.000057647336,"about_ca_system_score_gemma":0.0001304048,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W3194791795","doi":"10.1145/3471873.3472977","title":"Generating high performance code for irregular data structures using dependent types","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Limiting; Data structure; Parallel computing; Code (set theory); Programming language; Data type; High-level programming language; Theoretical computer science; Programming paradigm; Computer architecture","score_opus":0.05743578611869199,"score_gpt":0.3033452290372205,"score_spread":0.2459094429185285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194791795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051283546,0.0001437991,0.9477265,0.00013808101,0.00021193252,0.00007588356,0.0000108102895,0.0002616557,0.00014779411],"genre_scores_gemma":[0.2774825,0.000014009836,0.7219214,0.0002378911,0.000076989694,0.0000018897057,0.000032881333,0.000005900582,0.00022655397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.000033267603,0.00016601235,0.00039298733,0.00014521001,0.00017302073],"domain_scores_gemma":[0.99892056,0.00004074369,0.00006094408,0.0008001686,0.00014286269,0.000034713124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002043926,0.000090950896,0.00010878774,0.000035358906,0.00022290132,0.00021923812,0.0008294104,0.00004135691,0.000011991708],"category_scores_gemma":[0.00004726502,0.00008264123,0.000017484886,0.00014102645,0.000011916972,0.00035488425,0.0006277525,0.000052765503,0.0000013033638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004635621,0.000038318925,0.0005169429,0.00005963378,0.000047255777,0.000010112641,0.00012806244,0.88164765,0.012564002,0.052548125,0.0031026865,0.049332567],"study_design_scores_gemma":[0.000105054845,0.000012464315,0.00010271359,0.000009387108,0.0000048154466,0.000021610842,0.000004062157,0.93682724,0.061217483,0.00087754405,0.00070300896,0.000114617884],"about_ca_topic_score_codex":0.000011498118,"about_ca_topic_score_gemma":0.000013557463,"teacher_disagreement_score":0.22619897,"about_ca_system_score_codex":0.000019170982,"about_ca_system_score_gemma":0.00010874057,"threshold_uncertainty_score":0.33700117},"labels":[],"label_agreement":null},{"id":"W3195443930","doi":"10.32920/ryerson.14655531.v1","title":"Cache filtering algorithm for least frequently used data with accurate memory simulation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; Cache; Cache algorithms; Cache-oblivious algorithm; CPU cache; Algorithm; Cache coloring; Dram; Computer hardware","score_opus":0.09607504414667822,"score_gpt":0.3350370610210939,"score_spread":0.23896201687441565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195443930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020447045,0.0001085392,0.9968089,0.00024493746,0.0003569094,0.0006141273,0.00005282636,0.0010783784,0.00053090526],"genre_scores_gemma":[0.056882285,0.000016632317,0.94138604,0.00017989568,0.0001416524,0.00005370518,0.00086880964,0.000029600375,0.00044135688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977257,0.00009800181,0.00038086122,0.0011873571,0.00031177382,0.00029629594],"domain_scores_gemma":[0.9966422,0.00020700769,0.00029836173,0.0024334372,0.000333005,0.0000860414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047941724,0.0003155253,0.00035926263,0.00013310206,0.0001566187,0.00093663443,0.0024865533,0.00019946549,0.000015041558],"category_scores_gemma":[0.000061121726,0.00028176588,0.000072778064,0.00021120522,0.000028411028,0.00067113474,0.0034325318,0.00031791115,0.0000025832942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028351715,0.000036675312,0.00000878522,0.00006202062,0.000058622514,0.000009846914,0.00024632775,0.92533857,0.000025355283,0.00010392503,0.000501039,0.073606],"study_design_scores_gemma":[0.00026813213,0.00003527791,0.000023119248,0.000154901,0.000018824234,0.000006301285,0.000023172359,0.99722254,0.0012319671,0.00021747658,0.00041155252,0.00038676258],"about_ca_topic_score_codex":0.00011499818,"about_ca_topic_score_gemma":0.000028350918,"teacher_disagreement_score":0.07321924,"about_ca_system_score_codex":0.000066408385,"about_ca_system_score_gemma":0.00032716303,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W3196818429","doi":"10.3929/ethz-b-000519275","title":"DAMOV: A New Methodology and Benchmark Suite for Evaluating Data Movement Bottlenecks","year":2021,"lang":"en","type":"article","venue":"Repository for Publications and Research Data (ETH Zurich)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Semiconductor Research Corporation","keywords":"Computer science; Scalability; Suite; Benchmark (surveying); Profiling (computer programming); Distributed computing; Cache; Parallel computing; Database","score_opus":0.543382500156838,"score_gpt":0.5215959019150627,"score_spread":0.021786598241775312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196818429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003268317,0.0027504575,0.9873217,0.00765344,0.00012579243,0.0007821617,0.00022855595,0.00013932947,0.0006717551],"genre_scores_gemma":[0.0018781817,0.00046666307,0.99084383,0.00018830388,0.00018714453,0.00016343691,0.0019857516,0.000015760708,0.004270896],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969088,0.00065351353,0.00038318275,0.0012355527,0.00039384395,0.00042514727],"domain_scores_gemma":[0.9923068,0.0028650735,0.00014146812,0.003450866,0.0009924538,0.0002433092],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007953844,0.00012480818,0.00020407717,0.00024429825,0.001043188,0.0010581712,0.0024022355,0.000100963356,0.0000037915172],"category_scores_gemma":[0.004616282,0.00011592032,0.00002583555,0.0006498127,0.00011090865,0.001179438,0.0044787605,0.00020068345,4.925962e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033654636,0.00028116137,0.00082732656,0.00027688037,0.00018272642,0.000003747556,0.0006067645,0.0001703525,0.0084526,0.17843646,0.618829,0.19189931],"study_design_scores_gemma":[0.0005908101,0.00022061095,0.00094031036,0.000040504085,0.000027129852,0.000047657875,0.000084156614,0.6807381,0.002639871,0.017301997,0.2971385,0.00023032872],"about_ca_topic_score_codex":0.00011301558,"about_ca_topic_score_gemma":0.000018656137,"teacher_disagreement_score":0.68056774,"about_ca_system_score_codex":0.00003611172,"about_ca_system_score_gemma":0.0007372293,"threshold_uncertainty_score":0.99997884},"labels":[],"label_agreement":null},{"id":"W3196991194","doi":"10.1016/j.cola.2021.101062","title":"Instruction visibility in SPEC CPU2017","year":2021,"lang":"en","type":"article","venue":"Journal of Computer Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spec#; Visibility; Computer science; Programming language; Geography; Meteorology","score_opus":0.010396970324870424,"score_gpt":0.2802465246359772,"score_spread":0.2698495543111068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196991194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14398327,0.00042094968,0.853894,0.00053072954,0.00043114656,0.000025102787,2.3085099e-7,0.000055986184,0.0006585716],"genre_scores_gemma":[0.5149252,0.000045003162,0.4845438,0.00020189643,0.00023910361,2.2321801e-7,4.6973014e-7,0.0000034611473,0.000040873656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989657,0.0001401481,0.00039272508,0.00015745162,0.00021595597,0.00012805294],"domain_scores_gemma":[0.99910724,0.000066930144,0.00024048536,0.00029364985,0.00023789171,0.000053797714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004402825,0.00008366497,0.0002062997,0.00017954377,0.00003295934,0.00014016348,0.00046830613,0.00004740378,0.000010531128],"category_scores_gemma":[0.000049218786,0.000074188116,0.000085337335,0.00032796976,0.000017208216,0.00041505307,0.0001666972,0.00020342619,0.0000032272853],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042539243,0.00074041,0.027430985,0.00009337562,0.00010040763,0.0030418497,0.005071354,0.048388757,0.0017579625,0.022697737,0.011182211,0.8794524],"study_design_scores_gemma":[0.00514125,0.00082509185,0.32527608,0.00077639,0.000025822652,0.0065232664,0.00028444006,0.5680342,0.05522073,0.023086423,0.013722533,0.0010837927],"about_ca_topic_score_codex":0.0000059789363,"about_ca_topic_score_gemma":0.0000052486607,"teacher_disagreement_score":0.8783686,"about_ca_system_score_codex":0.00004971474,"about_ca_system_score_gemma":0.00010519539,"threshold_uncertainty_score":0.30253038},"labels":[],"label_agreement":null},{"id":"W3198221083","doi":"10.1145/3462209","title":"Byte-Select Compression","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Computer science; Byte; Algorithm; Data compression; Cache; Compression ratio; Cache algorithms; Parallel computing; CPU cache; Computer hardware","score_opus":0.012485625820485907,"score_gpt":0.24648570327817632,"score_spread":0.23400007745769041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198221083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019821041,0.00017443324,0.9951227,0.002602662,0.00011564919,0.0001054784,0.0000061074893,0.00051598804,0.0011588184],"genre_scores_gemma":[0.12570077,0.0003711306,0.87241954,0.000952177,0.000023365204,0.000017233313,0.000019773044,0.00001512281,0.00048086926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891263,0.0001214593,0.00018375537,0.00041771357,0.00018274024,0.0001816844],"domain_scores_gemma":[0.99902195,0.00012255953,0.000057528556,0.00059552654,0.0001152924,0.00008714185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088430446,0.00015485722,0.00014414288,0.00014750594,0.00034368612,0.00015843363,0.00035921138,0.00008959977,0.000041952124],"category_scores_gemma":[0.000035853514,0.00014578717,0.00005629281,0.0005082483,0.000030408502,0.00016912258,0.000030288134,0.00022494116,0.0000044530584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009006222,0.00006273704,0.0000061634328,0.000006754881,0.0000119248025,0.0000046161836,0.00019880776,0.8885803,0.00021679697,0.0005056719,0.00012215153,0.11027504],"study_design_scores_gemma":[0.00041949932,0.000112146816,0.000059114325,0.00005787166,0.0000153241,0.00008715553,0.000011868382,0.97431433,0.017106831,0.003917309,0.0036330663,0.00026549335],"about_ca_topic_score_codex":0.0000031983147,"about_ca_topic_score_gemma":0.000008967652,"teacher_disagreement_score":0.12550256,"about_ca_system_score_codex":0.000017810686,"about_ca_system_score_gemma":0.000056041645,"threshold_uncertainty_score":0.5945028},"labels":[],"label_agreement":null},{"id":"W3199460485","doi":"10.1145/3477039","title":"Declarative Power Sequencing","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"VMware","keywords":"Computer science; Firmware; Embedded system; Power management; Software; Component (thermodynamics); Reuse; Power (physics); Operating system; Software engineering; Computer hardware","score_opus":0.029881921493767925,"score_gpt":0.2788319304675896,"score_spread":0.24895000897382166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199460485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00415357,0.00024541956,0.9877918,0.00034884215,0.0012896822,0.00019705918,0.0000030046322,0.0015189968,0.0044516246],"genre_scores_gemma":[0.73773956,0.000011404355,0.26132792,0.00033994787,0.00004794475,0.000011149814,0.0000028783757,0.000019251374,0.0004999446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975139,0.00037805436,0.000515332,0.0007361237,0.00042555277,0.00043102325],"domain_scores_gemma":[0.99734706,0.00042142675,0.00018491517,0.0015111786,0.00039642642,0.00013902601],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046952345,0.00027162314,0.00034191846,0.00021425463,0.0005603846,0.00046929478,0.0011015296,0.00014414305,0.000015026465],"category_scores_gemma":[0.000090008434,0.00028181783,0.00016075745,0.0009955784,0.00003743494,0.00031052632,0.000056380446,0.00039347648,0.00007786802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008706487,0.00019600264,0.000027245696,0.00004529906,0.00015937237,0.00015252597,0.0061123073,0.9531365,0.0015160873,0.021198772,0.0010493653,0.016397806],"study_design_scores_gemma":[0.0005521031,0.00016042872,0.000039246435,0.00031944725,0.000016980746,0.00042962725,0.0010114086,0.97369576,0.019816525,0.0015010269,0.0018400028,0.00061744795],"about_ca_topic_score_codex":0.0000249453,"about_ca_topic_score_gemma":0.0000020561831,"teacher_disagreement_score":0.73358595,"about_ca_system_score_codex":0.000231972,"about_ca_system_score_gemma":0.00027742394,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W3202544060","doi":"10.1145/3478513.3480506","title":"I♥LA","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canada Research Chairs; Adobe Systems; National Science Foundation","keywords":"Programming language; Computer science; Executable; Syntax; Python (programming language); Readability; Compiler; Linear algebra; Algebra over a field; Semantics (computer science); Scripting language; Functional programming; Artificial intelligence; Mathematics; Pure mathematics","score_opus":0.021787577430753557,"score_gpt":0.2687248266510491,"score_spread":0.24693724922029553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202544060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044844084,0.000060715618,0.99388325,0.0019908948,0.00015067463,0.000030307712,0.0000014234589,0.0005892672,0.002845024],"genre_scores_gemma":[0.5752044,0.00029175347,0.42290884,0.0012438316,0.000010930315,0.000010031221,0.0000017336807,0.000008004498,0.00032047144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992717,0.00009661828,0.00011524075,0.00023983551,0.00015174235,0.00012485562],"domain_scores_gemma":[0.9988586,0.00018305337,0.000025168001,0.0007861873,0.00009452339,0.000052472464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001391352,0.00008126573,0.00007756519,0.00012823653,0.00017353169,0.00009852218,0.00053543673,0.00007857808,0.000018391916],"category_scores_gemma":[0.000031180956,0.00008473018,0.000086391934,0.0007664995,0.00003275478,0.00014324069,0.000013010652,0.00022310899,0.000018155173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001116424,0.00103587,0.00019933484,0.000036244848,0.00014047226,0.0002036993,0.0011939944,0.029647034,0.0005788816,0.3781746,0.00469281,0.5840859],"study_design_scores_gemma":[0.0016363515,0.00041457594,0.0031415136,0.0002055997,0.00006692934,0.0006687771,0.00012607872,0.31576207,0.12370765,0.3561997,0.19637547,0.0016952549],"about_ca_topic_score_codex":0.0000029382961,"about_ca_topic_score_gemma":0.000004422692,"teacher_disagreement_score":0.5823906,"about_ca_system_score_codex":0.000010528766,"about_ca_system_score_gemma":0.00006149128,"threshold_uncertainty_score":0.34551963},"labels":[],"label_agreement":null},{"id":"W3203599871","doi":"10.1145/3458744.3473354","title":"Adapting SYCL’s SIMT Programming Paradigm for Accelerators via Program Reconstruction","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Affine transformation; Abstraction; Kernel (algebra); Programming language; Code (set theory); Parallel computing; Operating system; Mathematics; Discrete mathematics; Pure mathematics","score_opus":0.028416402139654427,"score_gpt":0.28969208447539374,"score_spread":0.26127568233573933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203599871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013281275,0.0000896707,0.9933482,0.00056292734,0.0003180431,0.00047944757,3.5476475e-7,0.0022214258,0.0016518037],"genre_scores_gemma":[0.113160774,0.000009614438,0.88617355,0.00015133429,0.00008756173,0.00016256071,0.000006516248,0.000011423815,0.00023669249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987241,0.000054611606,0.0002936918,0.00046033936,0.00014009728,0.00032717077],"domain_scores_gemma":[0.9991629,0.00008356143,0.00011758682,0.00035536735,0.00019621235,0.00008436265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027429574,0.00013873853,0.00016046246,0.00007679575,0.0002584932,0.00045060908,0.0003494879,0.000081045706,0.000008842402],"category_scores_gemma":[0.000064920474,0.00013599973,0.00009375912,0.0005033395,0.000025908663,0.00042778716,0.0001268706,0.000098668956,0.000004586572],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019713611,0.00006734716,0.00020896149,0.00001669958,0.00001380118,0.0000032207065,0.00007700036,0.00080266676,0.00009384582,0.018580003,0.0003777981,0.9797567],"study_design_scores_gemma":[0.00029140824,0.00016275365,0.000069652335,0.00004429425,0.000007379549,0.00012328787,0.00003591979,0.94835544,0.016675465,0.0063325386,0.027581614,0.00032027194],"about_ca_topic_score_codex":0.000008061078,"about_ca_topic_score_gemma":0.000006296471,"teacher_disagreement_score":0.9794364,"about_ca_system_score_codex":0.00003924998,"about_ca_system_score_gemma":0.000102557475,"threshold_uncertainty_score":0.5545908},"labels":[],"label_agreement":null},{"id":"W3204371345","doi":"10.1109/hoti52880.2021.00018","title":"Efficient Multi-Path NVLink/PCIe-Aware UCX based Collective Communication for Deep Learning","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"PCI Express; Computer science; Remote direct memory access; Parallel computing; Bandwidth (computing); Implementation; Computer network; Embedded system; Field-programmable gate array","score_opus":0.025163298240518172,"score_gpt":0.28360223858522726,"score_spread":0.2584389403447091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204371345","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000590255,0.00017666968,0.99575496,0.0005576157,0.00006959361,0.00026047326,0.0000011279936,0.0007775997,0.0018116883],"genre_scores_gemma":[0.35468015,0.000006240109,0.6436586,0.0003186947,0.000008580706,0.00004351912,0.000017867062,0.000008242655,0.0012581164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883485,0.00021731599,0.00021536036,0.00035900265,0.00015657365,0.00021691008],"domain_scores_gemma":[0.9983734,0.00037867608,0.000108247485,0.00054251327,0.0005353479,0.000061841645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041119338,0.000119931945,0.00015082936,0.00008844815,0.0004954723,0.00017333285,0.00054755394,0.00007227162,0.000015720549],"category_scores_gemma":[0.00022365723,0.00011964232,0.000087705375,0.00055360276,0.000027950906,0.000061355764,0.00024313047,0.00014780238,0.00000855905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007962684,0.00023776706,0.00029653448,0.000018628085,0.000014590114,0.000002617053,0.0009424683,0.98379105,0.00021115386,0.005968597,0.0007785952,0.0077300225],"study_design_scores_gemma":[0.00053706556,0.00005856556,0.00026694345,0.00002897409,0.000004110575,0.0000026444532,0.00007282198,0.9918267,0.0058623543,0.00019491345,0.0009862295,0.00015866388],"about_ca_topic_score_codex":0.000010650125,"about_ca_topic_score_gemma":0.000013549199,"teacher_disagreement_score":0.35408992,"about_ca_system_score_codex":0.00010606727,"about_ca_system_score_gemma":0.0002145247,"threshold_uncertainty_score":0.4878872},"labels":[],"label_agreement":null},{"id":"W3206490075","doi":"10.1145/3486606.3486783","title":"A small scheme VM, compiler, and REPL in 4k","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Executable; Computer science; Compiler; Scheme (mathematics); Implementation; Footprint; Memory footprint; Automation; Extensibility; Code generation; Programming language; Computer architecture; Code (set theory); Robotics; Embedded system; Robot; Operating system; Artificial intelligence; Key (lock); Engineering","score_opus":0.03191531945165246,"score_gpt":0.25137295955835637,"score_spread":0.2194576401067039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206490075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01992076,0.00025008613,0.9636506,0.0011574472,0.00005093522,0.00004311806,1.4290214e-7,0.0003549121,0.014571992],"genre_scores_gemma":[0.13277608,0.000059752863,0.8652004,0.00089462084,0.000010847455,0.000003096262,0.0000012399254,0.0000031023978,0.0010508348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.0000438695,0.00013277198,0.00026497917,0.000064717264,0.00012340114],"domain_scores_gemma":[0.99954647,0.00004272268,0.000024538054,0.0002932616,0.000052346906,0.00004068908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016109072,0.000060338083,0.00009449786,0.000057562,0.000036336805,0.00009970002,0.0002076175,0.00003408939,0.000012258815],"category_scores_gemma":[0.000039561924,0.00005841901,0.000016117074,0.00029306233,0.000015244193,0.000092622686,0.0002811893,0.00007461951,0.000006415057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013491997,0.0006078849,0.090336055,0.00009630699,0.000039478313,0.0005091582,0.0022093058,0.0033435214,0.0041887243,0.7218537,0.020867126,0.15593529],"study_design_scores_gemma":[0.000589498,0.000049933915,0.012870875,0.000060132585,0.0000012440007,0.000086283064,0.00002716859,0.95283806,0.013667209,0.009300247,0.010186859,0.0003224787],"about_ca_topic_score_codex":0.00002618768,"about_ca_topic_score_gemma":0.000035906705,"teacher_disagreement_score":0.94949454,"about_ca_system_score_codex":0.000010545457,"about_ca_system_score_gemma":0.000041260362,"threshold_uncertainty_score":0.2382258},"labels":[],"label_agreement":null},{"id":"W3206889100","doi":"10.1145/3484272.3484965","title":"Reframing the Liskov substitution principle through the lens of testing","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cognitive reframing; Substitution (logic); Lens (geology); Computer science; Optics; Physics; Psychology; Social psychology","score_opus":0.050576304289540325,"score_gpt":0.2954173221497423,"score_spread":0.244841017860202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206889100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045509744,0.00016134651,0.96085376,0.0017555644,0.00009884961,0.000068780144,2.2918893e-7,0.00021664657,0.032293852],"genre_scores_gemma":[0.6211276,0.00001954264,0.3779251,0.00043871553,0.000031207048,0.0000034976722,6.9727815e-7,0.000002598566,0.00045100276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992679,0.00009584198,0.00018004389,0.00016809726,0.00016329523,0.00012486691],"domain_scores_gemma":[0.99882674,0.0003102776,0.000095757445,0.0005432342,0.00021433539,0.000009671262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033834216,0.00006198202,0.00007319414,0.0000123022255,0.00028313647,0.000090275316,0.0005648682,0.000027644277,0.000005928416],"category_scores_gemma":[0.00033270885,0.00003359963,0.00003536238,0.00054458954,0.00006186095,0.00022248572,0.00030319855,0.0001042078,0.00000432523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.567287e-7,0.000035736244,0.0005388443,0.00000970118,0.000011162322,0.0000034792502,0.0012500583,0.029989269,0.0012995531,0.9596366,0.0006898768,0.006534962],"study_design_scores_gemma":[0.00015257183,0.000057952853,0.0027026895,0.00007747935,0.000010210662,0.000060295373,0.00013483087,0.8837773,0.066044025,0.015511648,0.03126764,0.00020333381],"about_ca_topic_score_codex":0.000048657996,"about_ca_topic_score_gemma":0.0000062082536,"teacher_disagreement_score":0.94412494,"about_ca_system_score_codex":0.000013958801,"about_ca_system_score_gemma":0.00009081248,"threshold_uncertainty_score":0.21776855},"labels":[],"label_agreement":null},{"id":"W3207595379","doi":"10.1145/3477132.3483563","title":"The Aurora Single Level Store Operating System","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ephemeral key; Computer science; State (computer science); Operating system; Consistency (knowledge bases); Computer security; Programming language","score_opus":0.04525649762843214,"score_gpt":0.2569586903238514,"score_spread":0.21170219269541923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207595379","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000510357,0.00017324877,0.9704518,0.0010416389,0.000316389,0.000043155625,2.9596703e-7,0.00074163644,0.026721504],"genre_scores_gemma":[0.4631013,0.000004996781,0.53036827,0.00025955116,0.000046853598,0.000004979617,9.662475e-7,0.000005262273,0.0062078494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.00009285574,0.00015280955,0.00020635714,0.00014568302,0.00015683583],"domain_scores_gemma":[0.99920595,0.00010365212,0.00004044644,0.0004437229,0.00016952134,0.000036704943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026338603,0.00006777145,0.00007158674,0.000016686912,0.0004443591,0.0005070654,0.0005091718,0.000027672853,0.0000029522544],"category_scores_gemma":[0.00006467487,0.000045777713,0.000032633943,0.00024820864,0.000015355414,0.00018051449,0.00027422974,0.00006743084,0.000019520896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5866935e-7,0.0000629836,0.00018679906,0.000024215493,0.000023749619,0.000059067235,0.00067582517,0.011696112,0.002576849,0.89580965,0.024361406,0.064522505],"study_design_scores_gemma":[0.000101062804,0.000030112578,0.00018074409,0.000041361058,0.000001752758,0.00006926451,0.00022998569,0.96380186,0.024933342,0.00030665606,0.010143277,0.00016057723],"about_ca_topic_score_codex":0.000012221826,"about_ca_topic_score_gemma":0.0000068560394,"teacher_disagreement_score":0.95210576,"about_ca_system_score_codex":0.00004282731,"about_ca_system_score_gemma":0.00007275185,"threshold_uncertainty_score":0.4889643},"labels":[],"label_agreement":null},{"id":"W3207878884","doi":"10.1145/3466752.3480134","title":"SparseAdapt: Runtime Control for Sparse Linear Algebra on a Reconfigurable Accelerator","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Defense Advanced Research Projects Agency; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Research Laboratory; Advanced Research Projects Agency; Canadian Institute for Advanced Research","keywords":"Computer science; Overhead (engineering); Granularity; Parallel computing; Synchronization (alternating current); Linear algebra; Adaptation (eye); Workload; Sparse matrix; Computer architecture; Operating system","score_opus":0.033609188434202,"score_gpt":0.26826471451489964,"score_spread":0.23465552608069765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207878884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006146631,0.00007191219,0.9723563,0.0026988182,0.0002416884,0.000287554,0.0000058042438,0.0007651819,0.022958059],"genre_scores_gemma":[0.34789544,0.000028247849,0.635472,0.005785699,0.00018470394,0.00008215621,0.000013909848,0.000024159257,0.010513711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.00006814413,0.00027530716,0.0004994157,0.00017670573,0.0003253433],"domain_scores_gemma":[0.9986798,0.00022392656,0.00008505945,0.00060272205,0.00029763675,0.000110822046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003017134,0.000162608,0.00024230176,0.000079458514,0.00017287547,0.0002391396,0.0005386186,0.000085280335,0.00013669669],"category_scores_gemma":[0.00012506117,0.0001500032,0.00011435083,0.00029359254,0.000017212853,0.00022566863,0.000053990872,0.000109658264,0.0001228883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010889922,0.0007182356,0.00020150276,0.000051124534,0.0001721149,0.00008057713,0.00030234427,0.029376835,0.0042786584,0.7143993,0.20823789,0.042072516],"study_design_scores_gemma":[0.001161295,0.00021980744,0.000055029403,0.000033391152,0.000008507527,0.000015660109,0.000009833492,0.8315468,0.09652837,0.0049516223,0.065141164,0.00032853693],"about_ca_topic_score_codex":0.000006969292,"about_ca_topic_score_gemma":0.0000032017292,"teacher_disagreement_score":0.8021699,"about_ca_system_score_codex":0.000028582792,"about_ca_system_score_gemma":0.00016400799,"threshold_uncertainty_score":0.6116953},"labels":[],"label_agreement":null},{"id":"W3208389462","doi":"10.5281/zenodo.1523170","title":"Dataset for EASY: Efficient Arbiter SYnthesis from Multi-threaded Code","year":2018,"lang":"en","type":"dataset","venue":"Spiral (Imperial College London)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Arbiter; Programming language; Computer science; Code (set theory); Parallel computing; Set (abstract data type)","score_opus":0.031045503674066572,"score_gpt":0.2896779092711758,"score_spread":0.25863240559710926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208389462","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009808131,0.00015130805,0.11201469,0.00015381967,0.0027698262,0.0013966435,0.88301015,0.00038460133,0.000020894962],"genre_scores_gemma":[0.00011361546,0.00004345779,0.15579511,0.0009870605,0.0015247888,0.00044196428,0.840935,0.000056832672,0.000102200785],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99531096,0.0003079263,0.001001151,0.0018011596,0.000655906,0.00092290004],"domain_scores_gemma":[0.9954578,0.00060040917,0.00063771853,0.0026879222,0.00030032345,0.00031577158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000680592,0.0008797856,0.001128464,0.000401667,0.00055267924,0.0005617842,0.003947854,0.000744478,0.00018072671],"category_scores_gemma":[0.0006196226,0.0008302859,0.000352467,0.0005346291,0.0002338531,0.00026036956,0.0013428531,0.00043288057,0.00030467505],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001764137,0.00024646395,0.000001196856,0.00006224976,0.00009205722,0.000043229473,0.000021601365,0.00017472629,0.000054763277,0.00016402108,0.9987901,0.00017321885],"study_design_scores_gemma":[0.0014680602,0.00031517947,0.0000043505197,0.00018102993,0.00011168556,0.0000116188885,0.0000030550052,0.05066881,0.002276712,0.00023094958,0.9437056,0.0010229138],"about_ca_topic_score_codex":0.0004948771,"about_ca_topic_score_gemma":0.00020624828,"teacher_disagreement_score":0.055084422,"about_ca_system_score_codex":0.00018560328,"about_ca_system_score_gemma":0.00039200185,"threshold_uncertainty_score":0.9994148},"labels":[],"label_agreement":null},{"id":"W3209162960","doi":"10.1109/tcad.2021.3123056","title":"Automatic Construction of Predictable and High-Performance Cache Coherence Protocols for Multicore Real-Time Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache coherence; MESI protocol; MESIF protocol; Cache; Predictability; Bus sniffing; Multi-core processor; Protocol (science); Distributed computing; Implementation; Embedded system; Cache algorithms; Computer architecture; Operating system; CPU cache; Programming language","score_opus":0.03260083596461848,"score_gpt":0.25203253731462505,"score_spread":0.21943170135000656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209162960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03096973,0.0000898113,0.9633763,0.000011106794,0.00042435137,0.004735648,0.00004843697,0.00031451895,0.00003013646],"genre_scores_gemma":[0.85558736,0.00007617145,0.14285345,0.000007220536,0.000025318928,0.0013301449,0.0000065028566,0.000018919158,0.00009489426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978002,0.00033920677,0.00085102144,0.00049201935,0.00027386396,0.0002437446],"domain_scores_gemma":[0.9977313,0.00047066933,0.00045284297,0.00045121467,0.0007926675,0.00010130176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820175,0.00026124515,0.0006517725,0.00023205722,0.00019101877,0.00020164035,0.00029831182,0.00017682345,0.000002655118],"category_scores_gemma":[0.000014501879,0.00023199174,0.000056406057,0.00047654053,0.00012169267,0.000307293,0.0000059899508,0.00015465551,8.853687e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005690196,0.0004230766,0.000097958946,0.0025360538,0.0003000003,0.000008199843,0.0007680242,0.8021051,0.05618229,0.0029392838,0.0003048483,0.13427824],"study_design_scores_gemma":[0.00077664165,0.00078304054,0.000048372593,0.0016145764,0.000029107936,0.00014273496,0.000055218254,0.9384549,0.057836864,0.000044147822,0.00001293102,0.00020145922],"about_ca_topic_score_codex":0.0001834485,"about_ca_topic_score_gemma":7.01318e-7,"teacher_disagreement_score":0.8246176,"about_ca_system_score_codex":0.000058198217,"about_ca_system_score_gemma":0.00026172007,"threshold_uncertainty_score":0.94603485},"labels":[],"label_agreement":null},{"id":"W3210448340","doi":"10.5281/zenodo.810047","title":"jjvenky/Internal_P_loading: First release","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Component (thermodynamics); Physics; Thermodynamics","score_opus":0.041804204704308505,"score_gpt":0.26655612738904055,"score_spread":0.22475192268473204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210448340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019124718,0.00004103123,0.7963539,0.0031004464,0.00018345084,0.00021657495,0.000013891665,0.0023893102,0.19578893],"genre_scores_gemma":[0.9840816,0.000072303264,0.0133287925,0.00020613136,0.00013785227,3.202505e-8,0.00006544601,0.00044801086,0.0016597878],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986846,0.0001162264,0.00019569394,0.0004224991,0.00028088843,0.000300114],"domain_scores_gemma":[0.99803686,0.000018149214,0.00019177244,0.0012167691,0.00036607072,0.00017037278],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053115265,0.00012198383,0.00011770774,0.0001524997,0.0055834814,0.003291864,0.0041331695,0.000050588467,0.00073913427],"category_scores_gemma":[0.00074852695,0.0001285476,0.00005854277,0.00015870361,0.00011963223,0.0006594876,0.0027957724,0.00020568754,0.0032884758],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004286547,0.00023144297,0.000040495914,0.00006320176,0.00005524335,0.00008928871,0.0013487692,0.0012295328,0.00067203754,0.09539359,0.5989308,0.30190274],"study_design_scores_gemma":[0.00029410608,0.0001105114,0.00070086186,0.000046902453,0.000003287257,0.00009027177,0.0000117780955,0.04107722,0.00077980413,0.0012496937,0.9554466,0.00018899361],"about_ca_topic_score_codex":0.000025461479,"about_ca_topic_score_gemma":2.3283428e-7,"teacher_disagreement_score":0.98216915,"about_ca_system_score_codex":0.00007884979,"about_ca_system_score_gemma":0.0000029795276,"threshold_uncertainty_score":0.99774283},"labels":[],"label_agreement":null},{"id":"W3213138672","doi":"10.1145/3456172.3456196","title":"Strategies for Heterogeneous Multi-Core Processing Based on Graph Programming","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control reconfiguration; Computer science; Asynchronous communication; Programming paradigm; Multi-core processor; Computation; Stream processing; Graph; Parallel computing; Distributed computing; Graph algorithms; Computer architecture; Theoretical computer science; Programming language; Embedded system","score_opus":0.04908635784584412,"score_gpt":0.3101455440668906,"score_spread":0.26105918622104646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213138672","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003153153,0.000087633394,0.99755484,0.0002138726,0.000062178864,0.00019143436,5.825124e-7,0.0009963856,0.00057777803],"genre_scores_gemma":[0.3359993,0.0000014261399,0.6633765,0.00046023825,0.000014232841,0.00004001369,0.0000048860775,0.000007143564,0.000096224445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909174,0.000023595472,0.00015763367,0.00036563797,0.00013444638,0.00022692906],"domain_scores_gemma":[0.9993427,0.000051233368,0.00005953206,0.0002914179,0.00020541716,0.000049736995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012693378,0.00011865325,0.00011188163,0.000078560464,0.0001900693,0.00047417384,0.00029041662,0.00004931188,0.00000278582],"category_scores_gemma":[0.000023390303,0.00010580787,0.00007684305,0.00031736915,0.000021391075,0.00017552197,0.000054927397,0.000059143287,0.0000015903383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001581142,0.00055587915,0.0001954595,0.00017148661,0.000017157985,0.000052901945,0.00044314607,0.6513251,0.0005407711,0.029749926,0.00076171727,0.31617063],"study_design_scores_gemma":[0.00025736817,0.00009210359,0.000014934106,0.000039811865,0.0000022077636,0.000007455482,0.00003087827,0.98725456,0.009602534,0.0014665783,0.0010821967,0.00014939743],"about_ca_topic_score_codex":0.000003402948,"about_ca_topic_score_gemma":0.000007170291,"teacher_disagreement_score":0.33592942,"about_ca_system_score_codex":0.00001474599,"about_ca_system_score_gemma":0.00018666341,"threshold_uncertainty_score":0.4572469},"labels":[],"label_agreement":null},{"id":"W3215002812","doi":"10.1109/icfpt52863.2021.9609816","title":"Profiling-Based Control-Flow Reduction in High-Level Synthesis","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control flow; Control flow graph; Parallel computing; Field-programmable gate array; High-level synthesis; Benchmark (surveying); Profiling (computer programming); Suite; Graph; Electronic circuit; Software; Embedded system; Theoretical computer science; Programming language; Engineering","score_opus":0.020656178160496315,"score_gpt":0.24409822731699668,"score_spread":0.22344204915650037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215002812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022755095,0.000036027493,0.9929728,0.0021605433,0.00016405454,0.00008686409,0.0000016452486,0.00049184705,0.001810706],"genre_scores_gemma":[0.50199676,0.0000032862376,0.4975709,0.00020200941,0.000018999126,0.000016781074,0.000002101007,0.0000034996735,0.00018565726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902815,0.00013030104,0.00020129888,0.00032257522,0.00014795076,0.00016973872],"domain_scores_gemma":[0.99930567,0.00011201458,0.00004988003,0.00036008056,0.00013295822,0.000039398787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002858424,0.000088743065,0.00014265758,0.00011561143,0.00005580173,0.00009449617,0.00027861982,0.00005966914,0.000025255746],"category_scores_gemma":[0.00015452484,0.00008573978,0.000039669114,0.00046197625,0.000016431195,0.00016238158,0.000037566966,0.000085119136,0.000014603472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000346688,0.00058002444,0.0027325612,0.000049104743,0.000032319957,0.000100277255,0.000121842495,0.8045545,0.007810435,0.08986144,0.0051214616,0.08900134],"study_design_scores_gemma":[0.0002769811,0.000014896318,0.0006717175,0.000022894195,0.0000021156006,0.0000074767763,0.00000463009,0.84227586,0.15547904,0.001031479,0.00009559117,0.000117328855],"about_ca_topic_score_codex":0.000026842697,"about_ca_topic_score_gemma":0.000006359922,"teacher_disagreement_score":0.49972126,"about_ca_system_score_codex":0.000043804313,"about_ca_system_score_gemma":0.00015435778,"threshold_uncertainty_score":0.3496367},"labels":[],"label_agreement":null},{"id":"W3215592064","doi":"","title":"Differentiating-based Vectorization for Sparse Kernels","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Parallel computing; Sparse matrix; Kernel (algebra); Computation; Speedup; Vectorization (mathematics); Solver; Code (set theory); Supercomputer; Algorithm; Computational science; Set (abstract data type); Mathematics; Programming language","score_opus":0.07531089294161115,"score_gpt":0.20423435428055917,"score_spread":0.128923461338948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215592064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031123808,0.00003825325,0.9666599,0.00007164512,0.0006266061,0.00035611552,0.000009694116,0.0007845519,0.0003294379],"genre_scores_gemma":[0.9217891,0.000029181301,0.077397384,0.00011018331,0.00007348587,0.000003703944,0.00012647289,0.000019669009,0.00045081944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829304,0.00013673895,0.00021893735,0.0009898338,0.000084275074,0.00027719527],"domain_scores_gemma":[0.9981241,0.00015184458,0.00031369893,0.0009485272,0.00035845867,0.000103368635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019241529,0.00026854305,0.0003017678,0.00020880923,0.00018416856,0.000291954,0.0011974758,0.00026519768,0.000014089881],"category_scores_gemma":[0.000086912034,0.000332155,0.00024008863,0.0004556603,0.000035444675,0.000201209,0.00081103784,0.00026308288,0.0000047849794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009836494,0.00009693692,0.0010383545,0.00009462994,0.000039615035,0.000023050208,0.00009274757,0.96554446,0.000037541497,0.03226614,0.00033682215,0.00041988812],"study_design_scores_gemma":[0.00037580222,0.000039746104,0.00042152454,0.00011638254,0.000035919606,5.8535e-7,0.000008016995,0.9895133,0.0014996718,0.0074594626,0.00017428311,0.00035532325],"about_ca_topic_score_codex":0.000032661697,"about_ca_topic_score_gemma":0.000009352993,"teacher_disagreement_score":0.8906653,"about_ca_system_score_codex":0.00014661468,"about_ca_system_score_gemma":0.00027390802,"threshold_uncertainty_score":0.99991304},"labels":[],"label_agreement":null},{"id":"W3216097361","doi":"10.5281/zenodo.5639724","title":"feelpp/feelpp: Feel++ V109 RC 2","year":2021,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Canadian Military Institute","funders":"","keywords":"Computer science","score_opus":0.032740043763685014,"score_gpt":0.25045239303455913,"score_spread":0.21771234927087413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216097361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011726564,0.00016513214,0.7995101,0.0022052594,0.00015631695,0.00018076425,0.000019761012,0.0035344714,0.19305553],"genre_scores_gemma":[0.7992008,0.00058828364,0.17614359,0.002655185,0.00058885536,1.8690096e-7,0.0016146683,0.0025061257,0.016702358],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978764,0.00041587107,0.00027597242,0.00060456904,0.00041932738,0.00040782738],"domain_scores_gemma":[0.9979034,0.0000336444,0.00010699731,0.0008882589,0.00087701116,0.00019066567],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060749764,0.00015701311,0.0001631446,0.00019544458,0.0019176136,0.0016180824,0.0019294204,0.00007673922,0.0023890943],"category_scores_gemma":[0.0005139944,0.00017444575,0.00007279758,0.0010716993,0.000081465936,0.00043720807,0.0023237912,0.00027002013,0.003947907],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015719652,0.00029599835,0.000005910752,0.000055472883,0.00005601644,0.00016528736,0.0018032265,0.001478258,0.0042683785,0.098182835,0.5960371,0.29763582],"study_design_scores_gemma":[0.0003058759,0.00010410546,0.00014350962,0.000031667503,0.0000049544956,0.00029937678,0.00007327581,0.020492267,0.004202824,0.0014009913,0.9726956,0.0002455538],"about_ca_topic_score_codex":0.0000045934426,"about_ca_topic_score_gemma":1.283874e-7,"teacher_disagreement_score":0.7980281,"about_ca_system_score_codex":0.00010382083,"about_ca_system_score_gemma":0.0000122239935,"threshold_uncertainty_score":0.9994183},"labels":[],"label_agreement":null},{"id":"W324429007","doi":"10.3217/jucs-007-11-1088","title":"An Abstract State Machine Specification and Verification of the Location Consistency Memory Model and Cache Protocol","year":2020,"lang":"en","type":"article","venue":"Archipelago (Université du Québec à Montréal)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Consistency model; Cache coherence; Protocol (science); Sequential consistency; Consistency (knowledge bases); State (computer science); Abstract state machines; Programming language; Semantics (computer science); Memory model; Formal methods; Finite-state machine; CPU cache; Theoretical computer science; Cache algorithms; Parallel computing; Distributed computing; Data consistency; Shared memory; Artificial intelligence","score_opus":0.013840915385111289,"score_gpt":0.201383823788966,"score_spread":0.1875429084038547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W324429007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2423153,0.00013571748,0.7492278,0.0033254814,0.000009953258,0.0045412066,0.0000045363813,0.0001662652,0.00027368078],"genre_scores_gemma":[0.9809866,0.000029969466,0.018670816,0.00014991996,0.000007978887,0.00013145959,0.0000026841647,0.000006909127,0.000013641172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992251,0.00007360736,0.00017693311,0.0002876602,0.00014322148,0.00009349081],"domain_scores_gemma":[0.99919116,0.00004361716,0.00019932781,0.00036663486,0.00010716235,0.000092105794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014693722,0.000103720835,0.00011242278,0.00005360933,0.00022470483,0.000039051924,0.00040775476,0.00003190436,0.000001939308],"category_scores_gemma":[0.000029872033,0.00009010031,0.000024752258,0.00021788116,0.00011519462,0.00036704628,0.00014469131,0.00010476701,0.0000011525025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034693262,0.0004486348,0.0060616913,0.00036396357,0.00007713348,0.000009594358,0.275415,0.26028374,0.019873235,0.040944662,0.00069995475,0.39547545],"study_design_scores_gemma":[0.0003525446,0.00007317364,0.0324942,0.000014015178,0.00000802776,0.000005061488,0.00042866648,0.9644389,0.00084106455,0.0011152263,0.00011987832,0.00010924975],"about_ca_topic_score_codex":0.005410269,"about_ca_topic_score_gemma":0.0024006558,"teacher_disagreement_score":0.7386713,"about_ca_system_score_codex":0.000032945703,"about_ca_system_score_gemma":0.000157769,"threshold_uncertainty_score":0.81787443},"labels":[],"label_agreement":null},{"id":"W32467943","doi":"","title":"High-level clock construction for low power.","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Power (physics); Computer science; Physics","score_opus":0.02683188014424979,"score_gpt":0.24024324130752875,"score_spread":0.21341136116327897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32467943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006281323,0.00002846365,0.9913383,0.00088083744,0.00032403079,0.00012773793,0.0000016849765,0.0007830841,0.0058877245],"genre_scores_gemma":[0.219394,0.000009719443,0.7784582,0.00034597085,0.000030316985,0.000009606495,0.0000011052791,0.0000040620166,0.001747035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.000015309874,0.00014194757,0.00021358923,0.00009310694,0.0001499523],"domain_scores_gemma":[0.9995093,0.000047503465,0.000051051335,0.0002603622,0.00008949217,0.000042309064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008751345,0.00007524881,0.000087004984,0.00006285381,0.00010822369,0.000088619396,0.00032819563,0.000046986243,0.00007134292],"category_scores_gemma":[0.000025231002,0.00006877619,0.000041400246,0.00016129288,0.000023312778,0.00018342354,0.00006013019,0.000040974282,0.000041661016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022521706,0.000061080566,0.00006139983,0.000007992659,0.000010148121,0.0000010232961,0.00013104678,0.0031200438,0.00010522376,0.8470823,0.087060705,0.06235677],"study_design_scores_gemma":[0.0004201955,0.00012504567,0.00013604606,0.000011597758,0.0000020675934,0.000023387202,0.0000068033446,0.96582043,0.009310836,0.013366465,0.010549582,0.00022756454],"about_ca_topic_score_codex":0.0000061486294,"about_ca_topic_score_gemma":5.106559e-7,"teacher_disagreement_score":0.96270037,"about_ca_system_score_codex":0.000016459046,"about_ca_system_score_gemma":0.000007758677,"threshold_uncertainty_score":0.28046116},"labels":[],"label_agreement":null},{"id":"W3541711","doi":"","title":"DREM: ARCHITECTURAL SUPPORT FOR DETERMINISTIC REDUNDANT EXECUTION OF MULTITHREADED PROGRAMS","year":2009,"lang":"en","type":"dissertation","venue":"˜The œAmerican nurse","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Exploit; Concurrency; Thread (computing); Multithreading; Distributed computing; Parallel computing; Interleaving; Cache coherence; Compiler; Cache; Programming language; CPU cache; Operating system; Cache algorithms","score_opus":0.01517163826458437,"score_gpt":0.30340003372760316,"score_spread":0.2882283954630188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3541711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05082909,0.00008513738,0.9433431,0.0001732405,0.0007697365,0.0018369064,0.000016851081,0.000800874,0.0021450864],"genre_scores_gemma":[0.83186394,0.000012085082,0.16539581,0.00013439092,0.00010733893,0.00017510228,0.0004286222,0.000035496545,0.0018471956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818575,0.00009738603,0.0005155732,0.0005096742,0.00032398256,0.00036764125],"domain_scores_gemma":[0.9978707,0.00010765683,0.0009818845,0.00071597204,0.00024350837,0.000080287835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024489991,0.00031226763,0.0004963252,0.0001916638,0.00017038536,0.00010043088,0.0011534294,0.00009163098,0.0000012972231],"category_scores_gemma":[0.000035371435,0.0002469912,0.00023830931,0.00045844025,0.00020114017,0.000064664026,0.00002668309,0.00022167162,0.000003964649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017611025,0.00020428924,0.00003413035,0.00008483618,0.000045012093,0.000006084705,0.0027796652,0.00048220836,0.0006304633,0.0009343333,0.0008683811,0.9937545],"study_design_scores_gemma":[0.0021578493,0.010295129,0.023062736,0.0011193277,0.0005046944,0.00026020908,0.0019131093,0.9152346,0.014752259,0.018489651,0.009136923,0.0030734725],"about_ca_topic_score_codex":0.00013524985,"about_ca_topic_score_gemma":0.0000924319,"teacher_disagreement_score":0.990681,"about_ca_system_score_codex":0.000053284544,"about_ca_system_score_gemma":0.00020996678,"threshold_uncertainty_score":0.9999982},"labels":[],"label_agreement":null},{"id":"W37186163","doi":"10.1002/wcs.1649","title":"Embodiment and language.","year":2023,"lang":"en","type":"article","venue":"PubMed","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; Multithreading; Scalability; Asynchronous communication; Multi-core processor; Solver; Computation; Cache; CPU cache; Decoupling (probability); Thread (computing); Algorithm; Computer network","score_opus":0.018940913241842713,"score_gpt":0.24077569101083904,"score_spread":0.22183477776899632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37186163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08071376,0.000515901,0.876034,0.005967275,0.0004431349,0.0006647242,0.000001307726,0.006459485,0.029200371],"genre_scores_gemma":[0.9768506,0.00004033521,0.020572552,0.0003295472,0.00002964737,0.00022664583,0.000001463168,0.0000039386196,0.0019452275],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995859,0.000016324904,0.000053883414,0.00012751043,0.00007196439,0.00014436882],"domain_scores_gemma":[0.99975723,0.00002325673,0.000015791824,0.00014890032,0.000009568539,0.000045239092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020961113,0.000036262394,0.000041804135,0.000069927664,0.000041852643,0.00006417123,0.00017420902,0.000014724409,6.8483257e-7],"category_scores_gemma":[0.000020669073,0.000032966283,0.000010117075,0.00024034453,0.000009344211,0.000074226824,0.00015850169,0.00002648566,0.000017079732],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.421146e-7,0.000012004806,0.00086166715,0.0000070726687,0.000007820489,0.000015957134,0.00068257377,0.00040022997,0.000011917646,0.01940089,0.022470841,0.9561282],"study_design_scores_gemma":[0.0006671532,0.00003510768,0.53627235,0.000012130233,0.000006642896,0.000028447968,0.00007660005,0.40899417,0.0066794963,0.013386573,0.033262733,0.00057861884],"about_ca_topic_score_codex":0.0000047231656,"about_ca_topic_score_gemma":2.8809822e-7,"teacher_disagreement_score":0.95554954,"about_ca_system_score_codex":0.0000065692975,"about_ca_system_score_gemma":0.0000033882318,"threshold_uncertainty_score":0.1344326},"labels":[],"label_agreement":null},{"id":"W37610302","doi":"10.7554/elife.82566","title":"Statistical inference on representational geometries.","year":2023,"lang":"en","type":"article","venue":"PubMed","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Asynchronous communication; Middleware (distributed applications); Distributed computing; Software; Resource (disambiguation); Architecture; Embedded system; Computer architecture; Operating system; Computer network","score_opus":0.052878846781867044,"score_gpt":0.3013474624196386,"score_spread":0.24846861563777156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37610302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002156853,0.000006148163,0.9854525,0.0011287151,0.00019047802,0.0001738666,0.000005011751,0.0011885613,0.009697889],"genre_scores_gemma":[0.9632516,0.00001826781,0.034445036,0.0004343539,0.00005109936,0.000372107,0.000020849677,0.000005609749,0.0014010875],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990645,0.000035028126,0.00013087314,0.0002523211,0.0002769,0.0002403861],"domain_scores_gemma":[0.99907714,0.00047865327,0.000036928723,0.00027295924,0.00005361198,0.00008072924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034335582,0.00006261495,0.00007174549,0.00024129705,0.00007942748,0.00012099822,0.00040151723,0.000028154802,0.000008647075],"category_scores_gemma":[0.0006939776,0.00005930036,0.000018623085,0.0009984816,0.000029659273,0.00013041006,0.00016145442,0.000075623975,0.00013626223],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007563319,0.00004979303,0.004569938,0.0000067181704,0.0000129870095,0.000027760681,0.000099065226,0.013496586,0.0000018359337,0.42790657,0.076809436,0.47701174],"study_design_scores_gemma":[0.00022290742,0.000029875633,0.8244212,0.000004078237,0.0000016395413,0.0000029643938,0.0000037869963,0.12784822,0.0005761844,0.038815062,0.007876404,0.00019766697],"about_ca_topic_score_codex":0.0000068373724,"about_ca_topic_score_gemma":2.9653495e-7,"teacher_disagreement_score":0.96109474,"about_ca_system_score_codex":0.000021454707,"about_ca_system_score_gemma":0.000022476559,"threshold_uncertainty_score":0.24181986},"labels":[],"label_agreement":null},{"id":"W38253353","doi":"10.1021/acsabm.3c00835","title":"Extremely large SRA: fast and efficient algorithms","year":2005,"lang":"en","type":"article","venue":"ACS Applied Bio Materials","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.011746129745573222,"score_gpt":0.23643617955502097,"score_spread":0.22469004980944773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38253353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16491346,0.00012633705,0.83098805,0.00048238365,0.0002183218,0.00030218333,0.000014493818,0.00082448125,0.0021302793],"genre_scores_gemma":[0.8421403,0.00003355087,0.15707996,0.0004552677,0.0001478605,0.00002306077,0.000007803564,0.0000103759385,0.000101783735],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988484,0.000031324413,0.00026481977,0.00038679168,0.00016834952,0.0003003363],"domain_scores_gemma":[0.99941,0.000023717923,0.000106675834,0.0003537102,0.000036904356,0.0000689894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044606987,0.00015807842,0.00019724866,0.000083289844,0.00015294779,0.00030025022,0.00043270102,0.00008081832,0.00002530764],"category_scores_gemma":[0.000007133459,0.00013848461,0.000015012508,0.00015692733,0.000033215412,0.00007814022,0.0003869769,0.000045377063,0.000079370555],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032863176,0.0004042847,0.000033514832,0.000054854383,0.000042933294,0.000009723683,0.0015137073,0.002889571,0.6153604,0.21496038,0.007981815,0.15671597],"study_design_scores_gemma":[0.0006784584,0.00004547808,0.0005967656,0.000020632197,0.0000078178955,0.000017298787,0.000017529437,0.026598431,0.95259696,0.00089541863,0.018062042,0.00046314532],"about_ca_topic_score_codex":0.000004426386,"about_ca_topic_score_gemma":5.335359e-7,"teacher_disagreement_score":0.6772269,"about_ca_system_score_codex":0.000021198213,"about_ca_system_score_gemma":0.000017001987,"threshold_uncertainty_score":0.56472385},"labels":[],"label_agreement":null},{"id":"W40396292","doi":"","title":"A Tiger Compiler for the Cell Broadband Engine Architecture","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Broadband; Architecture; Compiler; Tiger; Computer architecture; Telecommunications; Operating system; Geography; Computer security","score_opus":0.010015531152150953,"score_gpt":0.22144720192163092,"score_spread":0.21143167076947997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40396292","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003283572,0.00010095608,0.98740387,0.0032906104,0.00009563054,0.0003710847,3.961638e-7,0.00041079381,0.007998288],"genre_scores_gemma":[0.23780045,0.000010934533,0.75287265,0.0019012312,0.00007256109,0.000091041984,0.0000016476916,0.000007624072,0.0072418414],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994499,0.000018582172,0.00010552264,0.00017016353,0.000087724446,0.000168089],"domain_scores_gemma":[0.99927956,0.00021964026,0.000032709515,0.00035200073,0.000077063385,0.000039052557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011102444,0.00008340703,0.00007389648,0.000037649475,0.00012968904,0.00016836851,0.0006110585,0.0000315934,0.00007623642],"category_scores_gemma":[0.000010770312,0.0000473484,0.00005018889,0.00012731836,0.000020603013,0.00009155167,0.00010434801,0.00007518346,0.000056322595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005179914,0.000120164645,0.00013750655,0.000030562307,0.00003081254,6.9247136e-7,0.00097356155,0.09521787,0.0009929654,0.022087062,0.6772854,0.20311823],"study_design_scores_gemma":[0.00019552039,0.00004609474,0.00033370467,0.0000040094483,0.000002272903,0.0000027593853,0.000004964658,0.92890054,0.006882697,0.0044561536,0.05904912,0.00012217602],"about_ca_topic_score_codex":0.00002619435,"about_ca_topic_score_gemma":9.0840746e-7,"teacher_disagreement_score":0.83368266,"about_ca_system_score_codex":0.000005778804,"about_ca_system_score_gemma":0.000014604434,"threshold_uncertainty_score":0.19308117},"labels":[],"label_agreement":null},{"id":"W40559413","doi":"","title":"Exploiting Coarse Grain Non-Shared Regions in Snoopy Coherent Multiprocessors","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache coherence; Cache; Node (physics); Byte; Bandwidth (computing); Shared memory; Distributed shared memory; Block (permutation group theory); Filter (signal processing); Computer network; Distributed computing; Parallel computing; CPU cache; Memory management; Overlay; Computer hardware; Operating system; Uniform memory access; Cache algorithms","score_opus":0.026599555120269666,"score_gpt":0.2735432127633332,"score_spread":0.24694365764306353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40559413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010102931,0.000024351144,0.9833989,0.0010966558,0.00008491361,0.00020015637,5.797375e-7,0.0007845361,0.0043069604],"genre_scores_gemma":[0.5718279,0.000013535683,0.42750555,0.00037474523,0.000015696973,0.000031458716,0.0000032772568,0.000007443049,0.00022039886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882495,0.000033126093,0.00028859187,0.00037529267,0.00018152583,0.0002964857],"domain_scores_gemma":[0.9993379,0.000042865537,0.000089859815,0.00036577156,0.00007966862,0.000083915256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002365833,0.00013938626,0.000155372,0.00019200926,0.00011113179,0.00013080516,0.00067781284,0.00006263251,0.000008318634],"category_scores_gemma":[0.00006858868,0.00013179629,0.000047714067,0.00061604526,0.000028575794,0.00039720742,0.00019572585,0.00014358702,0.000031548738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003673047,0.0016752759,0.005293774,0.00013850477,0.000048746955,0.00029985586,0.022994205,0.5715159,0.0028632411,0.3216273,0.01890319,0.054603245],"study_design_scores_gemma":[0.0018639846,0.000112334135,0.0011011211,0.00028019364,0.0000024321591,0.000021544914,0.00025672436,0.9618718,0.012710666,0.02033276,0.0008752386,0.0005712218],"about_ca_topic_score_codex":0.00022677255,"about_ca_topic_score_gemma":0.00007607098,"teacher_disagreement_score":0.56172496,"about_ca_system_score_codex":0.000079816215,"about_ca_system_score_gemma":0.0000810029,"threshold_uncertainty_score":0.53744966},"labels":[],"label_agreement":null},{"id":"W416424943","doi":"10.1007/978-1-4615-0849-6","title":"High Performance Computing Systems and Applications","year":2002,"lang":"en","type":"book","venue":"Kluwer international series in engineering and computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.006515081839285724,"score_gpt":0.20228107694130643,"score_spread":0.1957659951020207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W416424943","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040262175,0.00061839045,0.99050057,0.00012114263,0.0012834446,0.0002244942,0.0000039672695,0.0004220694,0.006423323],"genre_scores_gemma":[0.26695526,0.002830613,0.6768499,0.00036979304,0.0020066733,0.00013322827,0.000037555375,0.00009019365,0.050726805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981258,0.000011675314,0.00038150698,0.00072480453,0.00045355308,0.00030265452],"domain_scores_gemma":[0.99911094,0.00007425605,0.00014651874,0.0003913184,0.00017246944,0.00010448701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039268186,0.00027921272,0.00027495186,0.00057260244,0.00018344255,0.00073079113,0.0013620437,0.00011444177,0.0000015667766],"category_scores_gemma":[0.0000115239945,0.00029689103,0.000023569395,0.00033791896,0.00020729474,0.0007613241,0.001041948,0.00032106697,0.0000046289733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026322798,0.000037250335,0.00018725934,0.0002373179,0.00003142695,0.000017213066,0.00049144594,0.52487177,0.000014017381,0.39333668,0.0016250678,0.07914791],"study_design_scores_gemma":[0.000109172244,0.00004428844,0.0004178579,0.00029846712,0.0000022198456,0.00013652831,0.0000011968897,0.97176605,0.000020427417,0.00040888364,0.026475992,0.00031893834],"about_ca_topic_score_codex":0.000009355751,"about_ca_topic_score_gemma":3.3863085e-7,"teacher_disagreement_score":0.44689426,"about_ca_system_score_codex":0.00019209461,"about_ca_system_score_gemma":0.000080863865,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W4200072122","doi":"10.32920/17303795.v1","title":"Energy-Efficient Hybrid Unicore Architecture In Future Embedded Chip-Multiprocessor","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Embedded system; Frequency scaling; Context (archaeology); Chip; Cache-only memory architecture; Power management; Energy consumption; Multiprocessing; Static random-access memory; CPU cache; Power (physics); Parallel computing; Cache coloring; Computer hardware; Engineering; Electrical engineering; Telecommunications","score_opus":0.010811568513673332,"score_gpt":0.24489296212549375,"score_spread":0.23408139361182043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200072122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014089487,0.0010416878,0.977031,0.0015935822,0.0008838495,0.00023804817,0.0000057629304,0.0012788831,0.0038376881],"genre_scores_gemma":[0.55521303,0.00018441146,0.44277498,0.00086633535,0.00025871705,0.000066024484,0.00009903639,0.00003087168,0.00050659874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968425,0.00022378504,0.00056606374,0.0013763967,0.00049123564,0.0005000397],"domain_scores_gemma":[0.9976953,0.000070663555,0.00026932856,0.001577825,0.00023707924,0.00014977274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003172256,0.0005065008,0.0005653439,0.00046745225,0.00010752427,0.0005311265,0.0024007906,0.0003547965,0.000027503085],"category_scores_gemma":[0.000040248924,0.00045848606,0.00021981724,0.0006701118,0.000041758994,0.00007715212,0.0030959733,0.0010954617,0.0000036002423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007127573,0.00023606955,0.000052422994,0.00010837056,0.000025949366,0.00012076856,0.0014397602,0.9451158,0.000043164844,0.006740781,0.0012221334,0.044887662],"study_design_scores_gemma":[0.00027686422,0.00002310265,0.00014482676,0.00025132977,0.0000055699143,0.00004073672,0.000067933455,0.98821867,0.0052671395,0.00378148,0.0012887985,0.0006335778],"about_ca_topic_score_codex":0.00009812354,"about_ca_topic_score_gemma":0.0000802426,"teacher_disagreement_score":0.5411235,"about_ca_system_score_codex":0.00011270494,"about_ca_system_score_gemma":0.0004626074,"threshold_uncertainty_score":0.9997867},"labels":[],"label_agreement":null},{"id":"W4200116093","doi":"10.32920/17303795","title":"Energy-Efficient Hybrid Unicore Architecture In Future Embedded Chip-Multiprocessor","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Embedded system; Frequency scaling; Context (archaeology); Cache-only memory architecture; Chip; Power management; Energy consumption; CPU cache; Multiprocessing; Power (physics); Parallel computing; Cache coloring; Engineering; Electrical engineering; Telecommunications","score_opus":0.010811568513673332,"score_gpt":0.24489296212549375,"score_spread":0.23408139361182043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200116093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014089487,0.0010416878,0.977031,0.0015935822,0.0008838495,0.00023804817,0.0000057629304,0.0012788831,0.0038376881],"genre_scores_gemma":[0.55521303,0.00018441146,0.44277498,0.00086633535,0.00025871705,0.000066024484,0.00009903639,0.00003087168,0.00050659874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968425,0.00022378504,0.00056606374,0.0013763967,0.00049123564,0.0005000397],"domain_scores_gemma":[0.9976953,0.000070663555,0.00026932856,0.001577825,0.00023707924,0.00014977274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003172256,0.0005065008,0.0005653439,0.00046745225,0.00010752427,0.0005311265,0.0024007906,0.0003547965,0.000027503085],"category_scores_gemma":[0.000040248924,0.00045848606,0.00021981724,0.0006701118,0.000041758994,0.00007715212,0.0030959733,0.0010954617,0.0000036002423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007127573,0.00023606955,0.000052422994,0.00010837056,0.000025949366,0.00012076856,0.0014397602,0.9451158,0.000043164844,0.006740781,0.0012221334,0.044887662],"study_design_scores_gemma":[0.00027686422,0.00002310265,0.00014482676,0.00025132977,0.0000055699143,0.00004073672,0.000067933455,0.98821867,0.0052671395,0.00378148,0.0012887985,0.0006335778],"about_ca_topic_score_codex":0.00009812354,"about_ca_topic_score_gemma":0.0000802426,"teacher_disagreement_score":0.5411235,"about_ca_system_score_codex":0.00011270494,"about_ca_system_score_gemma":0.0004626074,"threshold_uncertainty_score":0.9997867},"labels":[],"label_agreement":null},{"id":"W4200406741","doi":"10.1109/iccad51958.2021.9643520","title":"An Efficient Two-phase Method for Prime Compilation of Non-clausal Boolean Formulae","year":2021,"lang":"en","type":"article","venue":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Implicant; Prime (order theory); Computer science; Benchmark (surveying); Interleaving; Bottleneck; Algorithm; Theoretical computer science; Boolean function; Mathematics; Combinatorics; Boolean expression","score_opus":0.0781986651510313,"score_gpt":0.39237062497524255,"score_spread":0.31417195982421126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200406741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016847907,0.000016791142,0.9943197,0.0007238822,0.0013637313,0.0006166085,0.00005104747,0.0002531956,0.00097025186],"genre_scores_gemma":[0.30548185,0.0000098949,0.6934913,0.0004071879,0.00027870463,0.000045227735,0.0001321642,0.000022772749,0.00013093527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646324,0.0004509752,0.0008755409,0.0010375894,0.00075664563,0.00041598376],"domain_scores_gemma":[0.9954365,0.000693845,0.0005077214,0.0012137581,0.0019503635,0.00019784222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011158544,0.0003892872,0.0005234512,0.00041390603,0.00019074781,0.00048052246,0.0021754382,0.00015071643,0.000087378656],"category_scores_gemma":[0.00013711335,0.00040606176,0.00022297939,0.00045407956,0.00005891931,0.00048453355,0.0003503716,0.00027693,0.0000266439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030692134,0.0019422391,0.000038192185,0.000041883693,0.00021963278,0.00004323972,0.00097314495,0.6357303,0.049693372,0.17105936,0.0033543545,0.13659735],"study_design_scores_gemma":[0.0019932012,0.0008754637,0.00008274097,0.00014015503,0.000016765514,0.000025070156,0.000011911442,0.8545383,0.13387072,0.00786649,0.00021466991,0.00036449597],"about_ca_topic_score_codex":0.00001815428,"about_ca_topic_score_gemma":0.0000027481958,"teacher_disagreement_score":0.30379707,"about_ca_system_score_codex":0.00013791253,"about_ca_system_score_gemma":0.00048831775,"threshold_uncertainty_score":0.9998391},"labels":[],"label_agreement":null},{"id":"W4200624841","doi":"10.1109/iccad51958.2021.9643473","title":"Demystifying the Characteristics of High Bandwidth Memory for Real-Time Systems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"H2020 European Research Council; Agencia Estatal de Investigación; European Commission; Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Ministerio de Ciencia e Innovación","keywords":"Computer science; Dram; Predictability; Embedded system; Avionics; Latency (audio); Bandwidth (computing); Software; Isolation (microbiology); Distributed computing; Computer architecture; Operating system; Computer hardware; Engineering; Computer network","score_opus":0.06876215583971675,"score_gpt":0.2939212843425329,"score_spread":0.22515912850281616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200624841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020484282,0.00003436796,0.9911205,0.0020279558,0.002595902,0.0004926932,0.000041080482,0.00022831387,0.0014107351],"genre_scores_gemma":[0.5166112,0.0001918073,0.48010522,0.00047998657,0.0007376567,0.00010556935,0.000083885476,0.000033120345,0.0016515412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969867,0.00045298692,0.0008107646,0.0007388211,0.0006567922,0.00035392586],"domain_scores_gemma":[0.9952242,0.0013298001,0.0005346857,0.0011128555,0.00169105,0.00010743275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009267434,0.00032614637,0.00051286275,0.0002044342,0.00022094086,0.00063747255,0.0025090985,0.000147009,0.00007798234],"category_scores_gemma":[0.0002679203,0.00027766096,0.00017725342,0.00033835997,0.00008221314,0.00031670346,0.0004588227,0.00025267346,0.000049800976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029750133,0.000663375,0.00013302558,0.00021664637,0.0008237743,0.00015356638,0.0015151886,0.12084872,0.023564074,0.6989085,0.04558542,0.10729018],"study_design_scores_gemma":[0.00055872963,0.00020006028,0.0003358419,0.0003148895,0.000021484026,0.000046934383,0.00001576723,0.97516775,0.01363551,0.008884508,0.00048056358,0.0003379603],"about_ca_topic_score_codex":0.00004636129,"about_ca_topic_score_gemma":8.4242834e-7,"teacher_disagreement_score":0.85431904,"about_ca_system_score_codex":0.000105208324,"about_ca_system_score_gemma":0.0004058443,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W4205960335","doi":"10.1145/2588768.2576790","title":"Power Modeling for Heterogeneous Processors","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Xeon; Benchmark (surveying); Parallel computing; Multiprocessing; Xeon Phi; Power (physics); Process (computing); Embedded system; Operating system","score_opus":0.017616040869883668,"score_gpt":0.2606083709629772,"score_spread":0.2429923300930935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205960335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015293797,0.000015924545,0.9905493,0.00026498275,0.0000652928,0.00010046084,1.1520408e-7,0.00076531473,0.0067091775],"genre_scores_gemma":[0.56609935,9.555877e-7,0.43331814,0.00036169903,0.000012450614,0.000010788045,3.7660305e-7,0.0000036434699,0.00019258303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944985,0.0000134827205,0.0001114148,0.00020357329,0.0000769899,0.00014470294],"domain_scores_gemma":[0.99958324,0.000031539483,0.000026615855,0.00022716535,0.0000934211,0.000038029928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018372238,0.000064262254,0.000071957205,0.00004435918,0.00008168646,0.000083525396,0.00040779126,0.000030514428,0.0000035658152],"category_scores_gemma":[0.000038694918,0.000054839213,0.00003689196,0.00008439781,0.0000052897817,0.00011174189,0.00006886945,0.000025500018,0.000007186105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028955458,0.000028381264,0.000015021717,0.000010675966,0.0000054986926,2.195133e-7,0.00018396959,0.8964049,0.00004965112,0.09255486,0.0012030965,0.009540806],"study_design_scores_gemma":[0.00007933028,0.000054239372,5.131529e-7,0.000003830976,5.268436e-7,0.0000029750706,8.9659056e-7,0.98398703,0.001985721,0.011957834,0.0018428448,0.00008426124],"about_ca_topic_score_codex":0.0000017897945,"about_ca_topic_score_gemma":3.3486188e-7,"teacher_disagreement_score":0.56456995,"about_ca_system_score_codex":0.000006844357,"about_ca_system_score_gemma":0.000012473721,"threshold_uncertainty_score":0.22362782},"labels":[],"label_agreement":null},{"id":"W4206161953","doi":"10.1109/jxcdc.2021.3135814","title":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits publication information","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Pennsylvania; Pennsylvania State University; Georgia Institute of Technology; Intel Corporation","keywords":"State (computer science); Computer science; Algorithm","score_opus":0.02961029214580462,"score_gpt":0.27928312358897833,"score_spread":0.2496728314431737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206161953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11426306,0.000971871,0.8783228,0.0031043321,0.0019462912,0.00037059523,0.0000692487,0.00039723786,0.00055458007],"genre_scores_gemma":[0.980872,0.00094427145,0.007784446,0.009526456,0.00057296135,0.00003524085,0.00012794328,0.00005874182,0.00007795872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418896,0.00075022527,0.0017786078,0.00080039125,0.0017213308,0.000760504],"domain_scores_gemma":[0.99298155,0.00066251494,0.001663411,0.00040160137,0.0034644993,0.00082641555],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016914927,0.00068028684,0.0007007983,0.0010873392,0.0016944915,0.0037967965,0.0008616101,0.0002044156,0.000022154516],"category_scores_gemma":[0.00016881808,0.00067881466,0.00020470774,0.0010281018,0.0001764368,0.0065631084,0.00015368471,0.0011221762,0.000120532706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042380696,0.00037323032,0.0007496011,0.00015118017,0.0002877359,0.00020952003,0.0050787237,0.9057049,0.00015156674,0.004724741,0.008721545,0.07380483],"study_design_scores_gemma":[0.0045348145,0.0012814335,0.01565771,0.0012097608,0.0000970621,0.003458997,0.0007168917,0.8745595,0.0020806566,0.075859785,0.018174645,0.0023687214],"about_ca_topic_score_codex":0.0000017815464,"about_ca_topic_score_gemma":0.0000051875754,"teacher_disagreement_score":0.87053835,"about_ca_system_score_codex":0.00028527938,"about_ca_system_score_gemma":0.0011898314,"threshold_uncertainty_score":0.9996052},"labels":[],"label_agreement":null},{"id":"W4206370370","doi":"10.22215/etd/2021-14791","title":"Research and Development of Porting SYCL on QNX Operating System","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Porting; Computer science; Software portability; Operating system; Implementation; Embedded system; Software engineering; Software","score_opus":0.06297144961061565,"score_gpt":0.36608282740004566,"score_spread":0.30311137778943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206370370","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09536965,0.00054395705,0.7675491,0.000041677322,0.0004389925,0.0004374934,6.6308627e-7,0.0006670827,0.13495138],"genre_scores_gemma":[0.36304435,0.000013686937,0.6313839,0.000013964272,0.00002831247,0.000022495746,0.000061665094,0.000014798299,0.0054168426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982548,0.000106322885,0.00051800546,0.00043657023,0.00048294276,0.00020137764],"domain_scores_gemma":[0.9987297,0.0001237747,0.0002038807,0.00031212592,0.000580599,0.000049935545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011516961,0.00013545257,0.0002500196,0.00027959564,0.00029588427,0.00019852865,0.000417878,0.0001341794,0.000004368637],"category_scores_gemma":[0.00007153957,0.00012420853,0.000021370119,0.0003518762,0.000011476854,0.00007344012,0.00015927028,0.00026716822,0.0000038090436],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034817574,0.00047432884,0.00056207576,0.006567523,0.00026818312,0.00012864855,0.034227338,0.0057000862,0.005767768,0.5498545,0.003192904,0.3932218],"study_design_scores_gemma":[0.00059029856,0.00046761782,0.0023410914,0.0120370295,0.000010619682,0.000039234114,0.018684313,0.39805222,0.56482184,0.00026757142,0.0012528775,0.0014352641],"about_ca_topic_score_codex":0.00001893931,"about_ca_topic_score_gemma":0.000013146435,"teacher_disagreement_score":0.5590541,"about_ca_system_score_codex":0.000062057625,"about_ca_system_score_gemma":0.000381166,"threshold_uncertainty_score":0.50650764},"labels":[],"label_agreement":null},{"id":"W4206460673","doi":"10.1145/3458593.3458594","title":"Verification column","year":2020,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Column (typography); Relevance (law); Quarter (Canadian coin); Computer science; Political science; History; Telecommunications; Law; Archaeology","score_opus":0.040735937642871825,"score_gpt":0.2665553533010225,"score_spread":0.22581941565815067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206460673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012903615,0.000059781578,0.9794042,0.013172842,0.00008994532,0.00009553176,4.6407465e-7,0.00090241595,0.0049844454],"genre_scores_gemma":[0.51991194,0.00003555929,0.47352222,0.0062600835,0.0001008293,0.000010008481,0.0000046148225,0.000006570184,0.00014818394],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993284,0.00004272185,0.00013576147,0.00025891373,0.00011165472,0.00012259938],"domain_scores_gemma":[0.9992233,0.00005015476,0.000060178318,0.0005392516,0.000044766635,0.00008236864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006998131,0.00006835053,0.0000847381,0.000024301791,0.00007174168,0.000095730764,0.0011147271,0.0000410988,0.000014160469],"category_scores_gemma":[0.00024155584,0.00007028719,0.000030716867,0.00031708396,0.000014980557,0.00018460245,0.00026289787,0.000071832255,0.0001677268],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015922229,0.000115243725,0.0054223756,0.00003128449,0.000029564875,0.000022556509,0.0035668197,0.0069642565,0.0076582674,0.088221796,0.61271036,0.27524152],"study_design_scores_gemma":[0.0005632182,0.00032369883,0.0040028566,0.00001517623,0.000007478231,0.000009680199,0.000035246998,0.619166,0.015264423,0.011955075,0.3481511,0.00050607143],"about_ca_topic_score_codex":0.000017149408,"about_ca_topic_score_gemma":0.0000010733565,"teacher_disagreement_score":0.61220175,"about_ca_system_score_codex":0.0000121581315,"about_ca_system_score_gemma":0.00003160142,"threshold_uncertainty_score":0.28662285},"labels":[],"label_agreement":null},{"id":"W4206475020","doi":"10.1109/mnano.2021.3126031","title":"Approximate Computing [The Editors’ Desk]","year":2022,"lang":"en","type":"article","venue":"IEEE Nanotechnology Magazine","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Desk; Big data; Computer science; Pleasure; Field (mathematics); Special section; Data science; Library science; Artificial intelligence; Engineering physics; Engineering; Mathematics; Psychology; Data mining","score_opus":0.013296243782105845,"score_gpt":0.24381168378190363,"score_spread":0.2305154399997978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206475020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057569267,0.0001317014,0.9769661,0.009827176,0.0031432621,0.00024828923,0.0000025209117,0.0031084241,0.0008156422],"genre_scores_gemma":[0.8085951,0.0000142290055,0.188071,0.0015173448,0.0008757126,0.00009529732,0.0000058532332,0.00003135702,0.00079405715],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982265,0.00017315465,0.00032208787,0.0004958132,0.00033330268,0.00044909795],"domain_scores_gemma":[0.9985638,0.00013706813,0.00019944356,0.0009840168,0.00007606463,0.00003960469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007738302,0.00018565888,0.00021039364,0.00026879995,0.0010017897,0.00007822008,0.0025929017,0.00011694193,0.000021384942],"category_scores_gemma":[0.00006158188,0.00015859527,0.0000760706,0.0012187953,0.00015835694,0.000121557496,0.0013361122,0.00068791787,0.000061935265],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002462991,0.00039137815,0.0003556212,0.000027409722,0.00008504187,0.00015266899,0.0008791653,0.14186889,0.01322626,0.081117675,0.65995795,0.10191331],"study_design_scores_gemma":[0.0004086281,0.00022234033,0.000059982875,0.0000075804896,0.00000789713,0.00030529435,0.000023274833,0.7404693,0.012330231,0.009413185,0.2363938,0.00035854668],"about_ca_topic_score_codex":0.000006025804,"about_ca_topic_score_gemma":5.8461643e-7,"teacher_disagreement_score":0.8028382,"about_ca_system_score_codex":0.00009139772,"about_ca_system_score_gemma":0.000065114575,"threshold_uncertainty_score":0.7705058},"labels":[],"label_agreement":null},{"id":"W4206520537","doi":"10.1145/1272998.1273004","title":"Thread clustering","year":2007,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Thread (computing); Multithreading; Operating system; Cache; Embedded system; Multiprocessing; Parallel computing","score_opus":0.03575724683578499,"score_gpt":0.3182898578670638,"score_spread":0.2825326110312788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206520537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000093638635,0.063210115,0.9283021,0.00050623936,0.0004504251,0.00052082364,3.875298e-7,0.0008035355,0.006112714],"genre_scores_gemma":[0.11444156,0.011338693,0.86953485,0.0029742415,0.00039119215,0.00008103856,0.000008405314,0.000044953977,0.0011850349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980445,0.00015926748,0.00072083017,0.00041767218,0.0002950228,0.00036270297],"domain_scores_gemma":[0.9980135,0.00022196499,0.00021271208,0.001259741,0.00018616873,0.00010588884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026731545,0.00019801554,0.00040192512,0.00007451842,0.00023432118,0.00029029825,0.0015594306,0.000065322376,0.000005698866],"category_scores_gemma":[0.00061110576,0.00016647723,0.0000806808,0.00050916354,0.000016969007,0.0003451944,0.0005473228,0.00016392228,0.00007884271],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055306004,0.0003288502,0.0036934828,0.019669537,0.00021789595,0.00036691473,0.0022293641,0.03176675,0.0013131073,0.22566335,0.091067724,0.6236775],"study_design_scores_gemma":[0.0012222354,0.00066805916,0.00062769407,0.07329444,0.00009745476,0.0015255746,0.00011163951,0.56712234,0.0020965936,0.0015902172,0.3478651,0.0037786635],"about_ca_topic_score_codex":0.00005931781,"about_ca_topic_score_gemma":0.0000041573353,"teacher_disagreement_score":0.61989886,"about_ca_system_score_codex":0.000055203604,"about_ca_system_score_gemma":0.000045344168,"threshold_uncertainty_score":0.67887443},"labels":[],"label_agreement":null},{"id":"W4206679651","doi":"10.31234/osf.io/rkhng","title":"Born-Open Data for jsPsych","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Timeline; Plug-in; Upload; Computer science; Open data; Function (biology); World Wide Web; Prime (order theory); Open source; Programming language; Software; Biology","score_opus":0.13051012497742903,"score_gpt":0.3832195018313909,"score_spread":0.2527093768539619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206679651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014095907,0.0002254139,0.97332954,0.0020890592,0.0007373071,0.0006796203,0.000033064953,0.0007421161,0.022149779],"genre_scores_gemma":[0.0036349818,0.000081471866,0.9916343,0.0010251468,0.00010314566,0.000085856205,0.00072923914,0.000014793375,0.002691079],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805963,0.000065294764,0.0002975037,0.001202197,0.00016239549,0.0002130081],"domain_scores_gemma":[0.99485385,0.00009944589,0.00016107493,0.0046058837,0.00021320785,0.00006655114],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00071154337,0.00018630052,0.00030280702,0.00006904577,0.00010828247,0.0020628767,0.013617683,0.00017981608,0.000027891288],"category_scores_gemma":[0.0001035705,0.0001781137,0.00006620048,0.0001516842,0.00001445451,0.00042786045,0.034628306,0.00022559823,0.00000643359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007688721,0.0002008048,0.000046167865,0.00015840895,0.00011207763,0.000008783907,0.0002337161,0.008575806,0.000011487495,0.06680553,0.8451442,0.07869535],"study_design_scores_gemma":[0.00017926304,0.000020094107,0.000037866597,0.00008707547,0.000007782504,0.0000036545678,0.000007204974,0.92543685,0.00032258578,0.011730586,0.061841287,0.00032574058],"about_ca_topic_score_codex":0.00012117139,"about_ca_topic_score_gemma":0.00001957489,"teacher_disagreement_score":0.91686106,"about_ca_system_score_codex":0.000022990795,"about_ca_system_score_gemma":0.00040432368,"threshold_uncertainty_score":0.9989731},"labels":[],"label_agreement":null},{"id":"W4206914568","doi":"10.1109/hipc53243.2021.00035","title":"Multi-Stage Memory Efficient Strassen's Matrix Multiplication on GPU","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Strassen algorithm; Computer science; Parallel computing; Matrix multiplication; Memory footprint; Recursion (computer science); Overhead (engineering); Algorithm; Operating system","score_opus":0.03319076307292275,"score_gpt":0.31532524408351176,"score_spread":0.282134481010589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206914568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060010515,0.000049157705,0.98628926,0.0007471117,0.00014626086,0.00013554761,0.0000015234829,0.0010178159,0.0056122653],"genre_scores_gemma":[0.38870105,0.000009532902,0.6039735,0.00035180786,0.00002217008,0.000009764423,0.0000063433954,0.000007177855,0.0069186147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884343,0.000080499245,0.00020345152,0.00045063667,0.00022540899,0.00019654377],"domain_scores_gemma":[0.9989199,0.00008904117,0.000074194526,0.0006869157,0.00015394995,0.0000760144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020591392,0.00012053525,0.00011302892,0.00008679009,0.00012706834,0.00014974324,0.00044460624,0.000061467326,0.000036370515],"category_scores_gemma":[0.000063904015,0.000112150425,0.000061022813,0.0003576744,0.00001684087,0.00008340233,0.00018216408,0.000110337176,0.00012208149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074467275,0.0009757203,0.00019887798,0.000032358268,0.000023916746,0.000062837426,0.0005700019,0.87557447,0.014618953,0.07389038,0.004420365,0.02962467],"study_design_scores_gemma":[0.00025770217,0.000023639275,0.0011884258,0.000011540255,0.0000013510087,0.000005153733,0.000024009629,0.9204656,0.07665935,0.0000414952,0.0011748493,0.00014690132],"about_ca_topic_score_codex":0.000012531664,"about_ca_topic_score_gemma":0.000002917002,"teacher_disagreement_score":0.3827,"about_ca_system_score_codex":0.00004362211,"about_ca_system_score_gemma":0.00006745156,"threshold_uncertainty_score":0.45733616},"labels":[],"label_agreement":null},{"id":"W4210410570","doi":"10.1145/1879097.1879078","title":"Parallelism generics for Ada 2005 and beyond","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Implicit parallelism; Concurrency; Programming language; Parallel computing; Syntax; Task parallelism; Code (set theory); Artificial intelligence","score_opus":0.011536387084326744,"score_gpt":0.24032613870960468,"score_spread":0.22878975162527793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210410570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050039556,0.000104938525,0.92210126,0.026315395,0.00056607113,0.00023335264,0.000003368099,0.00041380938,0.00022223123],"genre_scores_gemma":[0.081167586,0.000032256386,0.89824915,0.020130567,0.0002158678,0.00004124712,0.000008063629,0.000018423492,0.0001368542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988055,0.00002641856,0.00020997149,0.00041540226,0.00018723906,0.00035544668],"domain_scores_gemma":[0.99869853,0.00024279779,0.000098274446,0.0007818799,0.00005356253,0.00012497877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263836,0.00017047327,0.00016262809,0.000087802895,0.00019492873,0.0001945938,0.0010724565,0.0000850461,0.000006410684],"category_scores_gemma":[0.00013059416,0.00016524752,0.000055701326,0.00014068124,0.00006860389,0.00029015672,0.00035320182,0.0001985062,0.0000048705747],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019568693,0.00007987157,0.0007965714,0.000049407092,0.00005957115,0.000027955371,0.0009507364,0.0039248466,0.07216945,0.02045305,0.8534945,0.047974445],"study_design_scores_gemma":[0.0018387331,0.00020221384,0.0016095993,0.000033915785,0.000035711157,0.00012043478,0.000034071192,0.33832294,0.02714549,0.017779773,0.611238,0.0016391022],"about_ca_topic_score_codex":0.00002172683,"about_ca_topic_score_gemma":0.000020099089,"teacher_disagreement_score":0.3343981,"about_ca_system_score_codex":0.000013172543,"about_ca_system_score_gemma":0.00003740244,"threshold_uncertainty_score":0.67385983},"labels":[],"label_agreement":null},{"id":"W4210570899","doi":"10.1145/3501768","title":"Memory-Aware Functional IR for Higher-Level Synthesis of Accelerators","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Computer science; Stencil; Compiler; Field-programmable gate array; High-level synthesis; VHDL; Parallel computing; Benchmark (surveying); Computer architecture; Embedded system; Computer hardware; Programming language; Computational science","score_opus":0.032854212650612835,"score_gpt":0.2472620561366519,"score_spread":0.21440784348603906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210570899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020944365,0.000036120022,0.9970096,0.0016744884,0.00022113265,0.00029485137,0.00013965284,0.00024421766,0.0001705223],"genre_scores_gemma":[0.37234262,0.000027568758,0.626585,0.00037832512,0.000025541842,0.0002959876,0.000024089783,0.000018953531,0.0003019296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988811,0.000101386155,0.00024798771,0.00035983947,0.00024916432,0.0001605428],"domain_scores_gemma":[0.9989599,0.0003297315,0.00012550617,0.00042632347,0.000102730664,0.00005579646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018420836,0.00015248627,0.00017674404,0.0002834054,0.0006065956,0.00004878464,0.00046449288,0.00005432203,0.00010002974],"category_scores_gemma":[0.000025500449,0.00015405453,0.000093257324,0.00044931922,0.00003682574,0.00012881345,0.000039291717,0.00017481945,4.1200175e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051475265,0.00008485504,0.0000031019492,0.000014968115,0.000025648174,3.0271238e-7,0.00012987191,0.9007851,0.00004232476,0.000583341,0.0002220866,0.098056965],"study_design_scores_gemma":[0.0007403351,0.0004248044,0.0001733951,0.000025908075,0.000052504907,0.000025044254,0.00005219376,0.97873676,0.011546151,0.0048660412,0.0029795708,0.0003773009],"about_ca_topic_score_codex":0.0000064917876,"about_ca_topic_score_gemma":0.0000034009072,"teacher_disagreement_score":0.37213317,"about_ca_system_score_codex":0.00003815878,"about_ca_system_score_gemma":0.00006273553,"threshold_uncertainty_score":0.62821615},"labels":[],"label_agreement":null},{"id":"W4210859512","doi":"10.1145/3517131","title":"Demystifying the Soft and Hardened Memory Systems of Modern FPGAs for Software Programmers through Microbenchmarking","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Field-programmable gate array; Embedded system; Software; Reconfigurable computing; Operating system; Computer architecture","score_opus":0.027801207527698116,"score_gpt":0.25328500648497954,"score_spread":0.22548379895728143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210859512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004853939,0.0058133486,0.9860661,0.0010905614,0.0004570977,0.0009892777,0.000019226929,0.0006084704,0.00010197504],"genre_scores_gemma":[0.96428955,0.0001388927,0.03433321,0.000060419337,0.00001001724,0.0008163636,0.0000033856559,0.000016505914,0.00033167997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858207,0.00014520372,0.00039931317,0.00044342995,0.00014510022,0.0002848983],"domain_scores_gemma":[0.9985857,0.00038654357,0.00024182447,0.0006542933,0.00010071378,0.00003091797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787972,0.00017380863,0.00032224657,0.0003046798,0.0011904232,0.000111466405,0.00079969876,0.00014788273,0.000002759996],"category_scores_gemma":[0.000047593927,0.0001483223,0.00006149054,0.0005075644,0.00014811032,0.0001497519,0.000037766113,0.0003278555,3.5097767e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092496106,0.0002226948,0.00032650476,0.0008343772,0.00041683146,0.000008145677,0.0029258118,0.56776226,0.002120786,0.018569881,0.00062914426,0.40609106],"study_design_scores_gemma":[0.0016801078,0.0011050889,0.000027749651,0.00044970604,0.00012685334,0.0011234574,0.0045417435,0.93748975,0.011403206,0.027070569,0.014135034,0.0008467203],"about_ca_topic_score_codex":0.000088733905,"about_ca_topic_score_gemma":0.0000042770153,"teacher_disagreement_score":0.9594356,"about_ca_system_score_codex":0.000043147076,"about_ca_system_score_gemma":0.000054046843,"threshold_uncertainty_score":0.9155893},"labels":[],"label_agreement":null},{"id":"W4210863326","doi":"10.1109/mm.2022.3148670","title":"Accelerating Deep Learning Using Interconnect-Aware UCX Communication for MPI Collectives","year":2022,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Computer science; PCI Express; Speedup; Graphics processing unit; Parallel computing; Message Passing Interface; Network topology; Message passing; Bandwidth (computing); Computer architecture; Embedded system; Field-programmable gate array; Computer network","score_opus":0.04396272083031036,"score_gpt":0.29714006044573105,"score_spread":0.25317733961542066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210863326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03695906,0.00027344524,0.9613566,0.00016839984,0.00018242851,0.00023997406,0.0000018454792,0.00042593607,0.0003923556],"genre_scores_gemma":[0.6445911,0.000010391341,0.35486826,0.00020608297,0.00002661839,0.00005626481,0.0000072036,0.000012741178,0.00022131631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895114,0.00026730183,0.00021133531,0.00027061082,0.00010235404,0.00019726172],"domain_scores_gemma":[0.99913585,0.0002385415,0.00016552275,0.00031784148,0.000113247166,0.000028986411],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045247978,0.00010509751,0.00013320638,0.000136573,0.0014093983,0.00019287039,0.00082607823,0.000031168987,0.000013715124],"category_scores_gemma":[0.000048852886,0.00012441582,0.00006388527,0.00036855965,0.000022918617,0.00021566085,0.0004147047,0.00024085393,0.0000014750796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039562863,0.00016296205,0.00092830544,0.000042198524,0.00006757894,0.000004039394,0.01435208,0.8684802,0.06603494,0.0026316438,0.0037596656,0.043496806],"study_design_scores_gemma":[0.0002446726,0.00008908523,0.000024584124,0.000017444456,0.0000039012552,0.000019271432,0.00029465457,0.9738827,0.020788219,0.00058256567,0.0038843032,0.00016861102],"about_ca_topic_score_codex":0.00003286974,"about_ca_topic_score_gemma":0.0000058201035,"teacher_disagreement_score":0.60763204,"about_ca_system_score_codex":0.00015497189,"about_ca_system_score_gemma":0.00005525017,"threshold_uncertainty_score":0.9998906},"labels":[],"label_agreement":null},{"id":"W4211127289","doi":"10.2200/s00848ed1v01y201804cac044","title":"General-Purpose Graphics Processor Architectures","year":2018,"lang":"en","type":"article","venue":"Synthesis lectures on computer architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graphics; Computer graphics (images); Computer architecture","score_opus":0.01133946237713513,"score_gpt":0.24771137179079897,"score_spread":0.23637190941366384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211127289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009519686,0.00014514705,0.98052454,0.0034469387,0.00059875654,0.0004817809,0.000008267215,0.0022679598,0.0030069367],"genre_scores_gemma":[0.4717534,0.000013596285,0.51973075,0.0067236433,0.0015146197,0.00007812198,0.0000044982917,0.00006051389,0.00012088266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609584,0.00046456646,0.0004964922,0.001331847,0.0007393158,0.0008719588],"domain_scores_gemma":[0.9970066,0.000654418,0.00023654372,0.0015575675,0.00026290098,0.00028200066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044272907,0.0006760401,0.000540392,0.0008597529,0.00069563783,0.00048790648,0.002737266,0.0002738945,0.000040929943],"category_scores_gemma":[0.00019168721,0.00053149916,0.00030177948,0.001168877,0.00032326498,0.00010301086,0.00055278355,0.0007165893,0.00007911293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017646498,0.00041052257,0.00013540822,0.00010898813,0.00022865248,0.00007054405,0.0037329413,0.07285189,0.0011456596,0.043891154,0.02875822,0.8484895],"study_design_scores_gemma":[0.0009022662,0.002280761,0.0027695494,0.00048351262,0.00006270894,0.00049103185,0.00000423801,0.53592116,0.20202626,0.16483396,0.08739521,0.0028293568],"about_ca_topic_score_codex":0.0000196327,"about_ca_topic_score_gemma":0.000026303245,"teacher_disagreement_score":0.8456602,"about_ca_system_score_codex":0.000051308885,"about_ca_system_score_gemma":0.00016242592,"threshold_uncertainty_score":0.99971366},"labels":[],"label_agreement":null},{"id":"W4211239137","doi":"10.1007/978-3-319-32010-6_299","title":"Data Center","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Center (category theory); Computer science; Chemistry; Crystallography","score_opus":0.060595045747930565,"score_gpt":0.2803174724907661,"score_spread":0.21972242674283554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211239137","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.3702424e-9,0.000076587254,0.44903183,0.00029335794,0.00016919056,0.00005130125,0.000032494347,0.00058116944,0.54976404],"genre_scores_gemma":[0.00001228223,0.0001916055,0.22882041,0.0009244327,0.00006487261,0.0000021120213,0.00033067624,0.000018884453,0.7696347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880433,0.000013101694,0.00019344871,0.0005857312,0.0002729052,0.00013047134],"domain_scores_gemma":[0.9974906,0.000030925272,0.0001078229,0.0022920847,0.000032131236,0.000046450048],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018343671,0.00016306907,0.00015932815,0.00011526168,0.000106281914,0.00010604085,0.0037881304,0.00007890228,0.0019763685],"category_scores_gemma":[0.0000060190337,0.00015739666,0.000046785655,0.00002815299,0.000017552551,0.000244807,0.0046388195,0.00025986598,0.00014684348],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.1744867e-7,0.0000058271603,6.1427585e-7,0.0000025587067,0.000010143252,0.000009598442,0.000006747318,0.000041839634,6.5288376e-8,0.74181473,0.24945788,0.008649681],"study_design_scores_gemma":[0.000044945464,0.000017507458,3.993996e-7,0.000009339978,0.000002450651,0.000014275475,1.3716136e-7,0.038298424,0.0000015015739,0.013853934,0.9475731,0.00018396824],"about_ca_topic_score_codex":0.0000044329627,"about_ca_topic_score_gemma":0.0000017441383,"teacher_disagreement_score":0.7279608,"about_ca_system_score_codex":0.000032397904,"about_ca_system_score_gemma":0.000059847607,"threshold_uncertainty_score":0.99893594},"labels":[],"label_agreement":null},{"id":"W4213283227","doi":"10.1109/issrew53611.2021.00045","title":"(WiP) LLTFI: Low-Level Tensor Fault Injector","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Symposium on Software Reliability Engineering Workshops (ISSREW)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fault injection; Resilience (materials science); Granularity; Fault (geology); Computer science; Injector; Fault tolerance; Embedded system; Work (physics); Software fault tolerance; Reliability engineering; Distributed computing; Operating system; Engineering; Software; Materials science; Geology; Mechanical engineering","score_opus":0.01490694287280927,"score_gpt":0.2504536773121262,"score_spread":0.23554673443931692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213283227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02177813,0.000120470555,0.96892995,0.0028329277,0.003960145,0.00024117892,0.000045392375,0.001450544,0.0006412908],"genre_scores_gemma":[0.41737506,0.00027838806,0.57687306,0.0010881512,0.00096418,0.00013585993,0.0001232948,0.000103661754,0.0030583648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647796,0.00011521748,0.00073398155,0.0011926813,0.0009195529,0.0005606325],"domain_scores_gemma":[0.9966459,0.0007132386,0.0001752055,0.0012892873,0.0009280889,0.00024824133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051956315,0.00047011892,0.00043879705,0.00020805349,0.00015650882,0.00043431923,0.0015619914,0.00029163843,0.00014612175],"category_scores_gemma":[0.0013625846,0.0004996985,0.00031498692,0.0008470095,0.000051091247,0.00042690933,0.00043292282,0.0006703363,0.00016158367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002686886,0.00045011725,0.0013753365,0.00007521147,0.00012740439,0.0001112567,0.00026795338,0.9740487,0.0021527968,0.002553227,0.00815683,0.010654339],"study_design_scores_gemma":[0.0010164101,0.00015630225,0.0055848425,0.00088401895,0.000029714796,0.00014101027,0.000021282769,0.9127653,0.03422683,0.00082321116,0.042727616,0.0016234117],"about_ca_topic_score_codex":0.00002192275,"about_ca_topic_score_gemma":0.0000027789517,"teacher_disagreement_score":0.39559692,"about_ca_system_score_codex":0.00047965706,"about_ca_system_score_gemma":0.0001745004,"threshold_uncertainty_score":0.9997455},"labels":[],"label_agreement":null},{"id":"W4214586203","doi":"10.1145/3410048.3410100","title":"User-level Threading","year":2020,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Threading (protein sequence); Concurrency; Scalability; Thread (computing); Multithreading; POSIX Threads; Programming paradigm; Concurrent object-oriented programming; Server; Benchmark (surveying); Session (web analytics); Distributed computing; Parallel computing; Operating system; Programming language; Reactive programming; Inductive programming","score_opus":0.1788658844615934,"score_gpt":0.3607417337142652,"score_spread":0.1818758492526718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214586203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088733854,0.03533761,0.9505279,0.008495122,0.00019385587,0.0007746928,0.0000013696089,0.0005756071,0.0032065162],"genre_scores_gemma":[0.25270733,0.1259546,0.60167515,0.019138502,0.00018955035,0.00014526765,0.00003629244,0.000028061706,0.00012523567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779516,0.00016436355,0.000484182,0.00042844325,0.0008925887,0.00023526493],"domain_scores_gemma":[0.9980371,0.00018026782,0.0002694823,0.0008328772,0.0005458748,0.00013437368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022470318,0.00017041872,0.00028905732,0.00018745179,0.00016922026,0.00011656501,0.0016693677,0.000053858796,0.000073483214],"category_scores_gemma":[0.0036156364,0.00015607449,0.000084478634,0.0035491902,0.000016497681,0.0007665595,0.0004397375,0.00017612708,0.00023526957],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020362847,0.000030749747,0.0013120834,0.0006328052,0.000014923359,8.789873e-7,0.00013324922,0.0039894613,0.000012490708,0.00267722,0.03287323,0.95832086],"study_design_scores_gemma":[0.00025869312,0.00018310764,0.0012554257,0.0006665616,0.000041369545,0.0000045235815,0.0000014836037,0.95242757,0.0004682061,0.00032170626,0.044065647,0.00030570812],"about_ca_topic_score_codex":0.0000012166711,"about_ca_topic_score_gemma":7.9311675e-8,"teacher_disagreement_score":0.95801514,"about_ca_system_score_codex":0.000071940885,"about_ca_system_score_gemma":0.00016043687,"threshold_uncertainty_score":0.6364533},"labels":[],"label_agreement":null},{"id":"W4214593058","doi":"10.1145/2544173.2509543","title":"Interacting with dead objects","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Snapshot (computer storage); Debugging; Programming language; Java; Operating system; Architecture; Virtual machine; Memory leak; Machine code; Program code; Code (set theory); Garbage collection; Compiler","score_opus":0.016281719968047823,"score_gpt":0.2496649981974478,"score_spread":0.23338327822939997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214593058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16016096,0.000091422204,0.81409496,0.0016113707,0.0003142711,0.00028507793,4.7457382e-7,0.0014976673,0.021943811],"genre_scores_gemma":[0.658859,0.0000020518314,0.34064347,0.00029900286,0.000032746466,0.000009459509,0.000001355488,0.0000053657645,0.00014755018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.000042855627,0.00013524445,0.0002573588,0.000154432,0.00021482784],"domain_scores_gemma":[0.9987399,0.00042639827,0.000115483184,0.0005612244,0.00009213815,0.00006485118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010651025,0.000111519155,0.00010791765,0.00008088353,0.000114490926,0.00036279947,0.0010736192,0.000034513643,0.00002967354],"category_scores_gemma":[0.00019490563,0.00008440471,0.0000194488,0.0002106594,0.000021395414,0.0007781183,0.0002735844,0.00011388698,0.00017803191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089466586,0.00083282305,0.11425435,0.00037283366,0.00044303812,0.00031235165,0.034222204,0.094805755,0.0056785536,0.042883653,0.11283882,0.5932662],"study_design_scores_gemma":[0.0008684936,0.0007354513,0.018792208,0.00045681567,0.00002405246,0.00011714085,0.00047354068,0.9433143,0.022919321,0.006233191,0.0047886944,0.0012767548],"about_ca_topic_score_codex":0.00015772942,"about_ca_topic_score_gemma":0.000015860103,"teacher_disagreement_score":0.8485086,"about_ca_system_score_codex":0.000012996643,"about_ca_system_score_gemma":0.00002573088,"threshold_uncertainty_score":0.34984836},"labels":[],"label_agreement":null},{"id":"W4214851387","doi":"10.1109/date.2012.6176514","title":"Toward virtualizing branch direction prediction","year":2012,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Proxy (statistics); Virtualization; Branch predictor; Table (database); Set (abstract data type); Operating system; Database; Machine learning; Cloud computing; Programming language","score_opus":0.030248200974886664,"score_gpt":0.26389312916024066,"score_spread":0.23364492818535398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214851387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015018687,0.00010731556,0.9615254,0.00019794398,0.000577488,0.000055260338,2.101854e-7,0.0017216313,0.03431288],"genre_scores_gemma":[0.8513969,0.00002097191,0.1476061,0.00021363504,0.00014654336,0.000006385254,0.0000014827641,0.0000040281584,0.00060391397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993938,0.00004284215,0.00012174649,0.00013416255,0.00012748718,0.00017995341],"domain_scores_gemma":[0.99964774,0.000024581908,0.000037007314,0.00018890871,0.000037432263,0.00006435954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027435328,0.00006439445,0.000060612714,0.00007661755,0.00009330756,0.000066964305,0.00019708321,0.000042167267,0.000015429647],"category_scores_gemma":[0.000021273521,0.000058574227,0.000029446319,0.00023743526,0.000008466153,0.00073869934,0.00008139572,0.000056256205,0.00004309296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008647418,0.00037605205,0.02675215,0.000033089138,0.000045246743,0.0000011115383,0.005587719,0.0054559465,0.0040492467,0.50001806,0.06469957,0.39297315],"study_design_scores_gemma":[0.00042328742,0.00014790421,0.028452275,0.000040383224,0.000009866218,0.00008253541,0.000038653878,0.82762367,0.056062512,0.004998789,0.08157402,0.000546089],"about_ca_topic_score_codex":0.000015245378,"about_ca_topic_score_gemma":2.3688388e-7,"teacher_disagreement_score":0.84989506,"about_ca_system_score_codex":0.000028561757,"about_ca_system_score_gemma":0.0000088028055,"threshold_uncertainty_score":0.23885877},"labels":[],"label_agreement":null},{"id":"W4214856401","doi":"10.1145/1273440.1250696","title":"Mechanisms for store-wait-free multiprocessors","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Carnegie Mellon University","keywords":"Computer science; Scalability; Speculative execution; Parallel computing; Consistency (knowledge bases); Cache coherence; Cache; Consistency model; Rollback; Implementation; Distributed computing; Sequential consistency; Synchronization (alternating current); Weak consistency; Speculation; Out-of-order execution; Eventual consistency; Strong consistency; CPU cache; Data consistency; Operating system; Computer network; Cache algorithms; Channel (broadcasting); Programming language; Database transaction","score_opus":0.01623284482417857,"score_gpt":0.2718618750697551,"score_spread":0.25562903024557654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214856401","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017728412,0.00008045879,0.99173397,0.0028132151,0.0007103632,0.00080101384,0.000005286371,0.0016327043,0.0004501516],"genre_scores_gemma":[0.0703557,0.000007091182,0.92627233,0.0027043663,0.0004228666,0.000047819787,0.0000145320755,0.000044119122,0.00013119796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683726,0.00010479066,0.00056077377,0.0009918824,0.0005750363,0.0009302733],"domain_scores_gemma":[0.99588656,0.0011759197,0.00021485052,0.0021329075,0.00027823207,0.00031152103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010991402,0.00042369036,0.0004067619,0.00049421476,0.0003753173,0.00025568274,0.005127537,0.00018816447,0.0000049438963],"category_scores_gemma":[0.0004326349,0.00038122284,0.00023993556,0.0006651137,0.00007833841,0.00023977767,0.0021096906,0.00043231357,0.000012470415],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093565555,0.00022534121,0.00015421696,0.00009614325,0.00008239046,0.000038580394,0.0028965832,0.033173125,0.0017059419,0.029004302,0.01602998,0.91649985],"study_design_scores_gemma":[0.0027292243,0.0013005364,0.0013282165,0.000113142414,0.000021677739,0.00012388187,0.000020696132,0.54619396,0.018772554,0.38431448,0.04384083,0.0012408018],"about_ca_topic_score_codex":0.00003719856,"about_ca_topic_score_gemma":0.000063434556,"teacher_disagreement_score":0.915259,"about_ca_system_score_codex":0.00007429328,"about_ca_system_score_gemma":0.00010717722,"threshold_uncertainty_score":0.999864},"labels":[],"label_agreement":null},{"id":"W4220693235","doi":"10.1145/3489525.3511681","title":"Extending SYCL's Programming Paradigm with Tensor-based SIMD Abstractions","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Software portability; Computer science; SIMD; Programming paradigm; Programming language; Parallel computing; Code (set theory); Functional reactive programming; Computer architecture; Reactive programming; Inductive programming","score_opus":0.017276058739093516,"score_gpt":0.25459142701854814,"score_spread":0.23731536827945462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220693235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010384411,0.000028168373,0.9890146,0.0010524535,0.00008851616,0.00019265112,7.750984e-7,0.0016690653,0.0069152894],"genre_scores_gemma":[0.57787865,9.693138e-7,0.42131424,0.00030104813,0.000014162631,0.000078954276,0.0000035988867,0.000007999579,0.00040036175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890065,0.000061221544,0.0001595319,0.00033106018,0.0002928392,0.00025469143],"domain_scores_gemma":[0.99932915,0.000082291,0.000093129995,0.0003913475,0.0000359745,0.000068126865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024648712,0.00011121834,0.000102455255,0.0001598243,0.0006802311,0.00018353223,0.00054621603,0.000018413275,0.00006343508],"category_scores_gemma":[0.000008160425,0.000097151154,0.0000427101,0.00049505767,0.000026200942,0.00020908788,0.0001403176,0.00019549992,0.000010153169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000151988825,0.0003243368,0.0015168634,0.000011533941,0.00002513918,0.000046864083,0.00021121955,0.8640316,0.000065577835,0.07827047,0.004428253,0.051052943],"study_design_scores_gemma":[0.0003440425,0.00039786514,0.00077044836,0.000011140982,0.000007026217,0.00008870882,0.00007303846,0.9264354,0.0006068643,0.00095082604,0.069964156,0.00035047473],"about_ca_topic_score_codex":0.00004123694,"about_ca_topic_score_gemma":0.0000032079977,"teacher_disagreement_score":0.5768402,"about_ca_system_score_codex":0.00006822753,"about_ca_system_score_gemma":0.00008547527,"threshold_uncertainty_score":0.5231856},"labels":[],"label_agreement":null},{"id":"W4224010033","doi":"10.1145/3529650","title":"Tensor Slices: FPGA Building Blocks For The Deep Learning Era","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Field-programmable gate array; Computer science; Routing (electronic design automation); Systolic array; Block (permutation group theory); Digital signal processing; Computer hardware; Parallel computing; Embedded system; Very-large-scale integration","score_opus":0.019073038136187583,"score_gpt":0.2501601099734333,"score_spread":0.23108707183724572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224010033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023615805,0.0016083008,0.98997736,0.0034234126,0.0004835266,0.00052700256,0.0000043611362,0.0012290486,0.0003853936],"genre_scores_gemma":[0.9648351,0.00018076607,0.031959265,0.00016168019,0.00002051655,0.0009160874,0.0000014389419,0.00001546399,0.0019096641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987543,0.00011284461,0.0002806425,0.00041932447,0.00013677993,0.000296089],"domain_scores_gemma":[0.9984808,0.0005914554,0.0001430699,0.00067048083,0.00007882856,0.00003537647],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006798742,0.00015167419,0.00021312229,0.00046342783,0.0024100235,0.00013422726,0.0011412854,0.00012796649,0.000024400857],"category_scores_gemma":[0.0000612548,0.00012557919,0.00006874077,0.00076026417,0.00007170385,0.00011422471,0.000027428712,0.0006721224,0.000002553532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028552466,0.00008911888,0.000119717675,0.000042165266,0.00014917016,0.000005370299,0.0005018979,0.59663945,0.0005145854,0.03025228,0.00041467595,0.371243],"study_design_scores_gemma":[0.00049111457,0.00050754374,0.00002199961,0.000037138263,0.000031146003,0.00030862875,0.0012341983,0.91254294,0.003197945,0.0051902607,0.07613104,0.00030604805],"about_ca_topic_score_codex":0.000037983693,"about_ca_topic_score_gemma":0.0000030410165,"teacher_disagreement_score":0.9624735,"about_ca_system_score_codex":0.000047809157,"about_ca_system_score_gemma":0.00003000949,"threshold_uncertainty_score":0.99888873},"labels":[],"label_agreement":null},{"id":"W4229495955","doi":"10.2172/1114706","title":"Applying graph partitioning methods in measurement-based dynamic load balancing","year":2011,"lang":"en","type":"report","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Load balancing (electrical power); Computer science; Graph partition; Distributed computing; Parallel computing; Toolbox; Graph; Polygon mesh; Execution time; Partition (number theory); Theoretical computer science; Programming language; Mathematics","score_opus":0.08662866887187377,"score_gpt":0.3583618132818402,"score_spread":0.27173314440996643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229495955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025421598,0.00093889877,0.91118497,0.00003459688,0.00059985236,0.00063534087,7.763535e-7,0.0011462106,0.085456796],"genre_scores_gemma":[0.008950687,0.00018868406,0.98955476,0.00018362627,0.000037587775,0.0005606023,0.000011847527,0.000035400913,0.0004768067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616337,0.0003973416,0.0007993207,0.0008339207,0.00131297,0.00049307244],"domain_scores_gemma":[0.99750644,0.00011559227,0.00048266607,0.0008805387,0.0009143244,0.000100424506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007308857,0.00037444377,0.0005540534,0.0006480065,0.00015283651,0.00020371657,0.0010434007,0.0003115954,0.000033627115],"category_scores_gemma":[0.000421085,0.00037181863,0.00019291848,0.0008325158,0.000034676243,0.00021881817,0.00025228693,0.00053460494,0.000011251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020649515,0.00055753643,0.0045435815,0.0012532604,0.00026527935,0.0001738337,0.0007775803,0.07207835,0.001055479,0.005201641,0.02359475,0.8904781],"study_design_scores_gemma":[0.00046653365,0.000076695826,0.00075816864,0.0016062591,0.000035209236,0.00003249236,0.000012835007,0.95869184,0.003120059,0.005023713,0.028926544,0.0012496632],"about_ca_topic_score_codex":0.00084421394,"about_ca_topic_score_gemma":0.00025098847,"teacher_disagreement_score":0.8892284,"about_ca_system_score_codex":0.0010381368,"about_ca_system_score_gemma":0.0020697014,"threshold_uncertainty_score":0.9998734},"labels":[],"label_agreement":null},{"id":"W4229563662","doi":"10.1109/jxcdc.2021.3115689","title":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits publication information","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Pennsylvania; Pennsylvania State University; Georgia Institute of Technology; Intel Corporation","keywords":"Computer science; State (computer science); Data science; Information retrieval; Algorithm","score_opus":0.02961029214580462,"score_gpt":0.27928312358897833,"score_spread":0.2496728314431737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229563662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11426306,0.000971871,0.8783228,0.0031043321,0.0019462912,0.00037059523,0.0000692487,0.00039723786,0.00055458007],"genre_scores_gemma":[0.980872,0.00094427145,0.007784446,0.009526456,0.00057296135,0.00003524085,0.00012794328,0.00005874182,0.00007795872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418896,0.00075022527,0.0017786078,0.00080039125,0.0017213308,0.000760504],"domain_scores_gemma":[0.99298155,0.00066251494,0.001663411,0.00040160137,0.0034644993,0.00082641555],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016914927,0.00068028684,0.0007007983,0.0010873392,0.0016944915,0.0037967965,0.0008616101,0.0002044156,0.000022154516],"category_scores_gemma":[0.00016881808,0.00067881466,0.00020470774,0.0010281018,0.0001764368,0.0065631084,0.00015368471,0.0011221762,0.000120532706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042380696,0.00037323032,0.0007496011,0.00015118017,0.0002877359,0.00020952003,0.0050787237,0.9057049,0.00015156674,0.004724741,0.008721545,0.07380483],"study_design_scores_gemma":[0.0045348145,0.0012814335,0.01565771,0.0012097608,0.0000970621,0.003458997,0.0007168917,0.8745595,0.0020806566,0.075859785,0.018174645,0.0023687214],"about_ca_topic_score_codex":0.0000017815464,"about_ca_topic_score_gemma":0.0000051875754,"teacher_disagreement_score":0.87053835,"about_ca_system_score_codex":0.00028527938,"about_ca_system_score_gemma":0.0011898314,"threshold_uncertainty_score":0.9996052},"labels":[],"label_agreement":null},{"id":"W4229606735","doi":"10.1109/micro.1994.717418","title":"Minimizing register requirements under resource-constrained rate-optimal software pipelining","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Software pipelining; Computer science; Register allocation; Register (sociolinguistics); Parallel computing; Software; Resource (disambiguation); Computer architecture; Programming language; Computer network; Compiler","score_opus":0.037653510192153905,"score_gpt":0.2841889286662994,"score_spread":0.2465354184741455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229606735","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00178535,0.000054407523,0.97312087,0.0022821568,0.00008420454,0.00012263117,5.2190956e-7,0.0016436338,0.020906225],"genre_scores_gemma":[0.19945717,0.000005556219,0.7923298,0.003441628,0.00011609327,0.0000073401384,0.000004828534,0.000015427591,0.0046222033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826425,0.00011750978,0.00042935275,0.00052196044,0.00025421596,0.00041273035],"domain_scores_gemma":[0.99886274,0.00014689229,0.00015491553,0.0006141357,0.0000991804,0.00012210921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006475345,0.00020130193,0.00019549768,0.0001631863,0.00023275723,0.00028768432,0.00081996835,0.00009703668,0.00006951941],"category_scores_gemma":[0.000098437915,0.00018883428,0.0000851623,0.0003021356,0.00006286604,0.0005575872,0.00033723933,0.00015972859,0.00008134713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007931129,0.00040693756,0.0013612597,0.000049154747,0.00014788058,0.00005520396,0.0043938216,0.4526307,0.0013247471,0.07414869,0.16951405,0.29588825],"study_design_scores_gemma":[0.0011184823,0.00012815457,0.00030750065,0.00011816105,0.000012137283,0.000046365283,0.00015670864,0.93486434,0.0061844923,0.0011958083,0.055105958,0.0007618693],"about_ca_topic_score_codex":0.000006457355,"about_ca_topic_score_gemma":0.0000022499419,"teacher_disagreement_score":0.48223364,"about_ca_system_score_codex":0.00006748908,"about_ca_system_score_gemma":0.000069007816,"threshold_uncertainty_score":0.77004385},"labels":[],"label_agreement":null},{"id":"W4229867184","doi":"10.1145/2714064.2660229","title":"Space-efficient multi-versioning for input-adaptive feedback-driven program optimizations","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"U.S. Department of Energy; International Business Machines Corporation; National Science Foundation","keywords":"Executable; Computer science; Software versioning; Compiler; Heuristic; Code (set theory); Space (punctuation); Set (abstract data type); Function (biology); Programming language; Mathematical optimization; Algorithm; Software; Operating system; Mathematics","score_opus":0.03233717448432247,"score_gpt":0.29041758950844254,"score_spread":0.25808041502412005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229867184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002532514,0.00003732949,0.9932847,0.0008482657,0.00026549288,0.0006562539,0.000005830918,0.0012355257,0.0011341062],"genre_scores_gemma":[0.34078553,0.0000039973784,0.65878737,0.00014665541,0.000058109723,0.000060620772,0.000015901187,0.000012683249,0.00012913275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854296,0.000099639205,0.00025145913,0.0005046692,0.00022459638,0.0003766861],"domain_scores_gemma":[0.9981692,0.0005361727,0.0002157589,0.00071158534,0.00023982515,0.00012748252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003172729,0.00020083398,0.00021193239,0.00017445958,0.0004476457,0.00028517516,0.0013432876,0.00009651677,0.0000051348125],"category_scores_gemma":[0.0005251728,0.00018827694,0.00008747559,0.0003966814,0.0000649824,0.0002477104,0.0004426041,0.00012130157,0.000026178557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011772658,0.00021515349,0.00036485936,0.000018820063,0.000023908418,0.0000012337835,0.0008173399,0.96644807,0.000034291945,0.016745977,0.0018114011,0.013507175],"study_design_scores_gemma":[0.00052147807,0.00026976084,0.0004004568,0.000050597973,0.000014926215,0.000002166857,0.000041090487,0.99351853,0.00057207956,0.00024346207,0.004107212,0.00025824897],"about_ca_topic_score_codex":0.000020499165,"about_ca_topic_score_gemma":0.000006996861,"teacher_disagreement_score":0.338253,"about_ca_system_score_codex":0.00004080865,"about_ca_system_score_gemma":0.000052565392,"threshold_uncertainty_score":0.76777107},"labels":[],"label_agreement":null},{"id":"W4230145123","doi":"10.1109/dac.1992.227851","title":"Optimal scheduling and allocation of embedded VLSI chips","year":2003,"lang":"en","type":"article","venue":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Chaining; Computer science; Very-large-scale integration; Parallel computing; Scheduling (production processes); Integer programming; Clock rate; Processor scheduling; Job shop scheduling; High-level synthesis; Embedded system; Mathematical optimization; Algorithm; Routing (electronic design automation); Field-programmable gate array; Chip; Mathematics; Operating system","score_opus":0.04843505675267619,"score_gpt":0.27701922632313103,"score_spread":0.22858416957045485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230145123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039982595,0.00006263155,0.9565475,0.00027277524,0.000109453424,0.00045934855,0.0000010324975,0.00087684434,0.0016878155],"genre_scores_gemma":[0.5253552,0.00002742147,0.47447738,0.000057809964,0.00001598218,0.00002830723,0.0000020577368,0.000010429406,0.000025372537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791014,0.00009345011,0.00060675276,0.00060674746,0.00043106312,0.00035184724],"domain_scores_gemma":[0.99813175,0.00016077832,0.0005528982,0.0003642972,0.00064524985,0.00014503549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011530969,0.00028552272,0.0003320906,0.00031194036,0.0002338086,0.00041009721,0.00086429337,0.00017490504,0.00001396872],"category_scores_gemma":[0.0007296462,0.0002974572,0.000051604642,0.00053479674,0.000103089005,0.0011309349,0.00012285526,0.00020903753,0.000011329329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055306027,0.00031934018,0.00087310077,0.00047553112,0.00010301208,0.0000039808588,0.009146926,0.057890043,0.1207002,0.77703166,0.001672068,0.031728834],"study_design_scores_gemma":[0.00037705104,0.00014431812,0.00031523933,0.00013750185,0.000013151612,0.000029923085,0.00009528713,0.8515596,0.13877055,0.008155389,0.00008192069,0.0003200783],"about_ca_topic_score_codex":0.000009020745,"about_ca_topic_score_gemma":3.9427488e-7,"teacher_disagreement_score":0.7936696,"about_ca_system_score_codex":0.000049893726,"about_ca_system_score_gemma":0.0002546681,"threshold_uncertainty_score":0.9999477},"labels":[],"label_agreement":null},{"id":"W4230438007","doi":"10.1007/978-3-540-78195-0_6","title":"Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Programming language; Object-oriented programming; Object (grammar); Software engineering; Artificial intelligence","score_opus":0.015878736008292423,"score_gpt":0.27369590291390583,"score_spread":0.2578171669056134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230438007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062806066,0.0010284806,0.9965494,0.00009640939,0.0003800868,0.00061967556,0.0000054776465,0.00028965186,0.0009679892],"genre_scores_gemma":[0.11352105,0.00035573015,0.88560706,0.00014105193,0.00014584033,0.00001560742,0.00007264244,0.000028780145,0.000112255846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973965,0.000052129046,0.0006649794,0.0008653672,0.0006843884,0.00033660402],"domain_scores_gemma":[0.9979801,0.00014781875,0.00053774635,0.00068420713,0.00055243296,0.000097702316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005279516,0.00033772577,0.00043999744,0.00070423953,0.00021820175,0.00023077561,0.0009625466,0.00018898897,0.0000045424285],"category_scores_gemma":[0.000031765598,0.00032840078,0.00005563127,0.0006512961,0.0004220062,0.00042157882,0.0005132304,0.00026274615,0.0000015385768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037716839,0.00003258802,0.0007827169,0.00006180983,0.000015551663,0.000015235049,0.0014027213,0.81171733,0.000016280967,0.011735716,0.00008055365,0.17413574],"study_design_scores_gemma":[0.0002816411,0.00019778452,0.00015448476,0.00025091428,0.000006393648,0.000072492185,0.0000012238883,0.99672866,0.00029990758,0.0011759571,0.0004648248,0.00036570887],"about_ca_topic_score_codex":0.00007184751,"about_ca_topic_score_gemma":0.000021644042,"teacher_disagreement_score":0.18501136,"about_ca_system_score_codex":0.00012379973,"about_ca_system_score_gemma":0.0002875344,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W4230565771","doi":"10.1145/1353535.1346301","title":"Predictor virtualization","year":2008,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Virtualization; Memory hierarchy; Cache; Table (database); Operating system; Chip; Embedded system; Parallel computing; Database","score_opus":0.03768280026804617,"score_gpt":0.28540436389735635,"score_spread":0.2477215636293102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230565771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034889934,0.061358728,0.9326181,0.0005930384,0.00042390166,0.0007167511,0.0000015454929,0.001158877,0.002780162],"genre_scores_gemma":[0.4613301,0.08848629,0.43951547,0.0050950446,0.0006575481,0.0004953186,0.00006443218,0.00008310584,0.004272725],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980868,0.0003330063,0.0006147744,0.00040045747,0.00034224434,0.00022273201],"domain_scores_gemma":[0.9981881,0.000120974335,0.00021276352,0.0011349452,0.00025549677,0.00008776372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066726847,0.00018102926,0.00037630083,0.00006289211,0.00035506187,0.00013828425,0.0012839285,0.000062577274,0.000009516131],"category_scores_gemma":[0.00092400936,0.00015294665,0.000070703376,0.0005506653,0.000026885315,0.00045138106,0.00030754277,0.00011296645,0.0000860624],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034088996,0.00048561033,0.007845891,0.011430378,0.00021598751,0.00024212876,0.0039452305,0.04895597,0.00084920344,0.20231827,0.68043,0.04327792],"study_design_scores_gemma":[0.00063169777,0.00039198637,0.00049189123,0.017078828,0.00004076599,0.0010424431,0.00001690811,0.80002636,0.0004136958,0.0002565648,0.17822576,0.0013830966],"about_ca_topic_score_codex":0.00002966766,"about_ca_topic_score_gemma":2.5786036e-7,"teacher_disagreement_score":0.7510704,"about_ca_system_score_codex":0.00004211025,"about_ca_system_score_gemma":0.00009977249,"threshold_uncertainty_score":0.6236983},"labels":[],"label_agreement":null},{"id":"W4230606648","doi":"10.1007/978-1-4614-5491-5_200198","title":"Parallelization","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parallel computing; Computer science","score_opus":0.0483066287158907,"score_gpt":0.2699799086676786,"score_spread":0.22167327995178793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230606648","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.725211e-9,0.00020703752,0.49989375,0.0001388023,0.000091590555,0.00005599539,3.9700438e-7,0.0007377306,0.49887466],"genre_scores_gemma":[0.00005227017,0.0001020655,0.23343198,0.00024575894,0.00007273309,0.0000021910707,0.000018378465,0.000016491556,0.76605815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990305,0.000009887925,0.00021516658,0.00033825423,0.00028378327,0.00012242988],"domain_scores_gemma":[0.9989507,0.00001785336,0.00013198449,0.00057264394,0.0002401699,0.000086604305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016783929,0.00018706474,0.00018491539,0.00013863636,0.00004579639,0.000107116175,0.0007290188,0.00020893625,0.00013074593],"category_scores_gemma":[0.00001236057,0.000173501,0.00006149969,0.00003473281,0.000020271093,0.00014813613,0.00025821337,0.00013510163,0.00039854037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5157893e-7,0.000002309238,2.573612e-7,0.000002393033,0.0000056022454,0.0000030266788,0.000014284905,0.00075619115,1.4530183e-7,0.8311015,0.15982701,0.008286929],"study_design_scores_gemma":[0.000059618025,0.000030396888,4.2111193e-7,0.000024014684,0.0000032490161,0.0000071671684,1.5112781e-7,0.058203325,0.000008469099,0.25701165,0.68442476,0.000226771],"about_ca_topic_score_codex":0.000002415265,"about_ca_topic_score_gemma":0.000001023708,"teacher_disagreement_score":0.5740898,"about_ca_system_score_codex":0.000051239043,"about_ca_system_score_gemma":0.00010733751,"threshold_uncertainty_score":0.7075165},"labels":[],"label_agreement":null},{"id":"W4230737732","doi":"10.1109/micro.2016.7783752","title":"Chainsaw: Von-neumann accelerators to leverage fused instruction chains","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Parallel computing; Compiler; Microarchitecture; Very long instruction word; SIMD; Dataflow; Pipeline (software); Von Neumann architecture; Leverage (statistics); Code generation; Computer architecture; Instruction scheduling; Operand; Partition (number theory); Programming language; Register file; Instruction set; Computer hardware; Key (lock); Operating system; Schedule","score_opus":0.01961268086044528,"score_gpt":0.24884511424376723,"score_spread":0.22923243338332194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230737732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036711592,0.0000074011637,0.9534832,0.003499226,0.00040510873,0.00016257656,8.028524e-7,0.0015035096,0.0042265346],"genre_scores_gemma":[0.84530807,0.000018574103,0.14905252,0.001212493,0.000094174735,0.00001750367,5.449266e-7,0.000011219315,0.004284925],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987954,0.00005250136,0.00022320673,0.00042615112,0.00021708274,0.00028568713],"domain_scores_gemma":[0.9990933,0.00004177438,0.00006387229,0.0005443997,0.00010707632,0.00014956616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021059556,0.00014921794,0.00013738975,0.00023412079,0.00015644186,0.00013660177,0.0007355225,0.00006817849,0.000034995523],"category_scores_gemma":[0.00004564793,0.00010340716,0.000050764895,0.000464126,0.000020765732,0.0004665487,0.00026009025,0.000056176967,0.00013858198],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002003138,0.00013264328,0.0013836126,0.000015887925,0.00003452597,0.000014166536,0.0012946783,0.0022837957,0.009791888,0.39485314,0.023812393,0.5663632],"study_design_scores_gemma":[0.005507442,0.001441343,0.02685188,0.00044794127,0.0000147369055,0.00012282343,0.00007667658,0.38523695,0.3872421,0.015118274,0.17420371,0.0037361146],"about_ca_topic_score_codex":0.00001890665,"about_ca_topic_score_gemma":0.0000070371902,"teacher_disagreement_score":0.80859643,"about_ca_system_score_codex":0.00007062208,"about_ca_system_score_gemma":0.000044140957,"threshold_uncertainty_score":0.42168218},"labels":[],"label_agreement":null},{"id":"W4230823926","doi":"10.1145/3140659.3080218","title":"Fractal","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Kwanjeong Educational Foundation; Massachusetts Institute of Technology; National Science Foundation","keywords":"Computer science; Parallel computing; Parallelism (grammar); Fractal; Data parallelism; Exploit; Task parallelism; Range (aeronautics); Mathematics","score_opus":0.019364703645956285,"score_gpt":0.28362487105872247,"score_spread":0.2642601674127662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230823926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004600847,0.000049623864,0.9792382,0.008537106,0.0006826131,0.0002281655,0.0000015712868,0.0010041227,0.0056577423],"genre_scores_gemma":[0.2923937,0.00001449976,0.705326,0.001494442,0.0005550983,0.000012894893,0.0000035702576,0.00001851103,0.00018123201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997869,0.00012914732,0.00030378634,0.0007363533,0.00042996992,0.00053170935],"domain_scores_gemma":[0.9949947,0.00025996586,0.00025119534,0.004166307,0.00010996271,0.00021788648],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003096074,0.00029342875,0.00029765535,0.00019345147,0.0009726312,0.0011746294,0.0074836337,0.00011418056,0.000013195967],"category_scores_gemma":[0.00026418688,0.0002571842,0.00016343409,0.00012875066,0.00014514118,0.00048102942,0.0038663684,0.00048579276,0.00007592085],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008945956,0.000075171905,0.0021213824,0.000013925219,0.000037661088,0.00007083808,0.00087882055,0.0055410382,0.00019038228,0.007338078,0.016563414,0.96716034],"study_design_scores_gemma":[0.0019501573,0.0008052838,0.04433656,0.00018875816,0.000018999197,0.00038456847,0.0000052994596,0.56361735,0.0050512743,0.16615209,0.2157629,0.0017267653],"about_ca_topic_score_codex":0.00009140032,"about_ca_topic_score_gemma":0.000020562115,"teacher_disagreement_score":0.9654336,"about_ca_system_score_codex":0.000029869558,"about_ca_system_score_gemma":0.00008591081,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W4231214464","doi":"10.1504/ijhpcn.2019.097047","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; CUDA; Parallel computing; Cache; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231214464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7066374,0.00012526075,0.29126096,0.00015089707,0.0013976147,0.00004244601,4.3446133e-7,0.00002951951,0.00035547136],"genre_scores_gemma":[0.9707931,0.0001089403,0.028103942,0.0001337936,0.00084676844,4.0283075e-7,7.867632e-7,0.000005793418,0.0000064305254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988013,0.000061471044,0.00045330529,0.00015523013,0.00037875344,0.00014993767],"domain_scores_gemma":[0.9985469,0.0001328506,0.00060824153,0.000106300366,0.0005622064,0.00004351321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006941775,0.00010306245,0.00017192325,0.00022883149,0.00013638058,0.00009095839,0.00055958075,0.000031986427,0.0000034188104],"category_scores_gemma":[0.000013098215,0.00008947385,0.000043634187,0.00018331107,0.000055368317,0.00012199482,0.0002021479,0.00014343525,0.0000013347399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009240693,0.00008618272,0.013171628,0.000010079363,0.00013103175,0.000010559735,0.0022962878,0.13406332,0.00019160082,0.002666976,0.00050269876,0.84677726],"study_design_scores_gemma":[0.0007410528,0.00066286296,0.026555767,0.00043721384,0.0000091266475,0.00010989251,0.000051695293,0.9572979,0.01304689,0.00025006995,0.0006867768,0.00015072663],"about_ca_topic_score_codex":0.000023844601,"about_ca_topic_score_gemma":0.0000012891899,"teacher_disagreement_score":0.8466265,"about_ca_system_score_codex":0.000060154332,"about_ca_system_score_gemma":0.000051049898,"threshold_uncertainty_score":0.36486375},"labels":[],"label_agreement":null},{"id":"W4231261295","doi":"10.32920/ryerson.14663895","title":"Whole program analysis of Java programs for virtual calls and exception handling","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Call stack; Java; Computer science; Exception handling; Stack (abstract data type); Static analysis; Operating system; Virtual machine; Program analysis; Code (set theory); strictfp; Programming language; Real time Java","score_opus":0.031221206692156382,"score_gpt":0.3103824848866805,"score_spread":0.27916127819452413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231261295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028770458,0.0001919934,0.96928406,0.00010636503,0.00011874835,0.0007230303,0.000004633598,0.00063804747,0.00016267868],"genre_scores_gemma":[0.41060516,0.000047506033,0.58880174,0.000024995034,0.000022913771,0.00014550488,0.00017686523,0.0000070709343,0.00016826479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984335,0.00006659622,0.0004357915,0.0006512115,0.000215126,0.00019778762],"domain_scores_gemma":[0.99861884,0.00006928239,0.00028937205,0.0005569904,0.00039744694,0.00006807196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004324601,0.00019179651,0.00050245307,0.00034266207,0.000072952455,0.00036924807,0.0004949554,0.00021301227,0.0000030493268],"category_scores_gemma":[0.000042772994,0.00018129178,0.0002651516,0.0006466945,0.00005155054,0.00012129354,0.00088293984,0.00015513638,2.3588359e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010272769,0.0004010954,0.0020715357,0.00024451295,0.0011866159,0.0000022703757,0.0015638905,0.0942525,0.00029023833,0.0031346115,0.00032260272,0.89651984],"study_design_scores_gemma":[0.00012902613,0.0001707396,0.000837675,0.00009829304,0.00022573229,7.804236e-7,0.00003114546,0.99662226,0.0008516746,0.0005055447,0.00030567351,0.00022143516],"about_ca_topic_score_codex":0.00007287276,"about_ca_topic_score_gemma":0.000037485584,"teacher_disagreement_score":0.9023698,"about_ca_system_score_codex":0.000025009733,"about_ca_system_score_gemma":0.0000952554,"threshold_uncertainty_score":0.7392864},"labels":[],"label_agreement":null},{"id":"W4231689289","doi":"10.32920/ryerson.14665956","title":"Code coagulation is an effective compilation technique for the JVM","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compiler; Computer science; Java; Interpreter; Programming language; Code (set theory); Interface (matter); Source code; Operating system; Set (abstract data type)","score_opus":0.03675630503311766,"score_gpt":0.31988657973288465,"score_spread":0.283130274699767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231689289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020845432,0.00012322694,0.9939084,0.0010618265,0.0003619921,0.0026100536,0.000019069988,0.0009642732,0.0007427243],"genre_scores_gemma":[0.2950078,0.000031799962,0.7029778,0.00055066764,0.00010825568,0.00097228086,0.00016020352,0.000018690816,0.00017252774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834526,0.00020934083,0.00031504378,0.0006983124,0.00024195944,0.00019008103],"domain_scores_gemma":[0.9976028,0.0004228822,0.00026141354,0.0011526225,0.0005105917,0.000049692382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080970983,0.00024016637,0.00026226588,0.000114574446,0.0003037116,0.00058582315,0.0011080649,0.00029000055,0.000011252267],"category_scores_gemma":[0.00005855441,0.00018767221,0.00015302855,0.00022588055,0.000038689275,0.0002705564,0.0007983529,0.00032525056,0.0000018628915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040168947,0.0003550291,0.0007264365,0.00031642802,0.00024382655,0.0000036838298,0.0050788266,0.79478633,0.0023082732,0.07041864,0.014185303,0.111537024],"study_design_scores_gemma":[0.00010938971,0.00006689402,0.0012406829,0.00006981144,0.000017512419,0.000004529463,0.000014264139,0.9561684,0.03056811,0.010795005,0.00069588947,0.00024950705],"about_ca_topic_score_codex":0.000054505403,"about_ca_topic_score_gemma":0.000017645123,"teacher_disagreement_score":0.29479936,"about_ca_system_score_codex":0.000090275986,"about_ca_system_score_gemma":0.00010915508,"threshold_uncertainty_score":0.76530504},"labels":[],"label_agreement":null},{"id":"W4231929056","doi":"10.32920/ryerson.14651649","title":"Run-time thermal management based on task migration techniques in 3D chip multiprocessors","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Many core; Task (project management); Architecture; Chip; Multi-core processor; Latency (audio); Throughput; Parallel computing; Embedded system; Distributed computing; Engineering; Telecommunications","score_opus":0.011222393037831572,"score_gpt":0.24753009028921213,"score_spread":0.23630769725138057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231929056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023473932,0.000058312147,0.962955,0.0011156471,0.00011970388,0.00065928145,0.0000018464932,0.0019532559,0.030789547],"genre_scores_gemma":[0.19756685,0.00006744298,0.79995775,0.0015741447,0.000038928643,0.00018407148,0.000074336385,0.000022467584,0.00051397417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975136,0.00023263751,0.00048169086,0.0009921788,0.00047113965,0.00030874743],"domain_scores_gemma":[0.9983609,0.00008613697,0.00021595077,0.0011101683,0.000164739,0.00006213079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006405149,0.00037286463,0.00034676053,0.0005613752,0.00008007584,0.00044579039,0.0013381258,0.00029293474,0.000027462878],"category_scores_gemma":[0.00004003225,0.00035621817,0.00012274929,0.00048049688,0.000027763606,0.00020578006,0.0010444558,0.00047016292,0.000018297502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003949129,0.00097537733,0.0005083331,0.00031791854,0.000058709178,0.0001403552,0.001154175,0.84902483,0.00037783955,0.0019053589,0.002255177,0.14324246],"study_design_scores_gemma":[0.00017934159,0.000057260295,0.0005562354,0.0004731974,0.0000059628833,9.593533e-7,0.000012508571,0.9879205,0.00948249,0.00026123654,0.00062238274,0.00042789377],"about_ca_topic_score_codex":0.00010013101,"about_ca_topic_score_gemma":0.000016352966,"teacher_disagreement_score":0.19521947,"about_ca_system_score_codex":0.00014554911,"about_ca_system_score_gemma":0.00010876056,"threshold_uncertainty_score":0.99988896},"labels":[],"label_agreement":null},{"id":"W4232351578","doi":"10.1145/1168918.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Abstract interpretation; Optimizing compiler; Compiler; Correctness; Probabilistic logic; Test suite; Static analysis; Theoretical computer science; Algorithm; Program analysis; Programming language; Parallel computing; Test case; Artificial intelligence","score_opus":0.021831917528158967,"score_gpt":0.2729642003128487,"score_spread":0.2511322827846897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232351578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003290951,0.00003865282,0.9918301,0.00080376165,0.00006612877,0.0002683737,0.000012387858,0.0004433085,0.0032463465],"genre_scores_gemma":[0.4931404,9.3138647e-7,0.506248,0.00010395854,0.00004775646,0.000026385307,0.000047447647,0.0000055337496,0.00037959358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898684,0.00004799673,0.00025267364,0.00036212621,0.00013913216,0.0002112471],"domain_scores_gemma":[0.99860334,0.0004288439,0.00014844937,0.0006058813,0.0001728984,0.00004056458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001729411,0.00012870874,0.00019253977,0.00025518663,0.00016172118,0.00022133715,0.00085943553,0.00004754724,0.000017238313],"category_scores_gemma":[0.00022402462,0.00011627984,0.0001270365,0.0008248682,0.000036654987,0.00026060815,0.00016544723,0.00005037496,0.000009628323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006009104,0.00007495496,0.002258647,0.000011505952,0.000106053405,0.0000021598032,0.00020836988,0.9318762,0.000012670457,0.062528595,0.002632383,0.00028248885],"study_design_scores_gemma":[0.00022429833,0.000053814612,0.0043359236,0.000008929515,0.00010708535,0.0000010727673,0.000007446651,0.9744432,0.00028482382,0.019513724,0.00082872564,0.00019094242],"about_ca_topic_score_codex":0.00007072659,"about_ca_topic_score_gemma":0.00005978493,"teacher_disagreement_score":0.48984945,"about_ca_system_score_codex":0.000028036935,"about_ca_system_score_gemma":0.000028415421,"threshold_uncertainty_score":0.47417542},"labels":[],"label_agreement":null},{"id":"W4232361088","doi":"10.1145/2508148.2485946","title":"STREX","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Georgia Institute of Technology; Division of Information and Intelligent Systems; Alfred P. Sloan Foundation; European Social Fund; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Online transaction processing; Cache; Thrashing; Operating system; Exploit; Thread (computing); Parallel computing; Database transaction; Embedded system; Transaction processing; Database; Computer security","score_opus":0.011888847144816814,"score_gpt":0.24177603345510115,"score_spread":0.22988718631028435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232361088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004841262,0.0000727186,0.98265755,0.007035788,0.00048665045,0.00044067754,8.3794856e-7,0.0015878807,0.0028766522],"genre_scores_gemma":[0.123983994,0.000013973151,0.87181234,0.0034394695,0.0004290654,0.00005266034,0.0000066148828,0.000022671085,0.00023923045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977101,0.00019806939,0.00036258207,0.000719518,0.00041811028,0.00059161964],"domain_scores_gemma":[0.9971918,0.0003774436,0.00011221224,0.0019030591,0.00016165929,0.00025386192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018418257,0.00030839132,0.0002835533,0.00028127624,0.00020415001,0.00050051155,0.0035153904,0.00010465706,0.00006867889],"category_scores_gemma":[0.00008372609,0.00026045038,0.00014095256,0.00054643344,0.00007279639,0.00037326827,0.0018819042,0.00042472835,0.00031512402],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021186593,0.00007219239,0.00060849823,0.000014320789,0.000029969087,0.000012929931,0.0009019015,0.014296269,0.00030741128,0.004462137,0.080911204,0.89838105],"study_design_scores_gemma":[0.0009731555,0.00063306856,0.009024754,0.00009675878,0.000009333334,0.00018694467,0.000009817014,0.72689605,0.0030450574,0.16992678,0.088003725,0.0011945572],"about_ca_topic_score_codex":0.00014962435,"about_ca_topic_score_gemma":0.000008662461,"teacher_disagreement_score":0.8971865,"about_ca_system_score_codex":0.00003466107,"about_ca_system_score_gemma":0.00007179385,"threshold_uncertainty_score":0.9999848},"labels":[],"label_agreement":null},{"id":"W4232444174","doi":"10.1145/3136040.3136047","title":"Refining semantics for multi-stage programming","year":2017,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Programming language; Semantics (computer science); Continuation; String (physics); Refining (metallurgy); Static analysis; Mathematics","score_opus":0.1403463119033456,"score_gpt":0.38159560790812985,"score_spread":0.24124929600478426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232444174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002188856,0.000011541557,0.9956975,0.00053359824,0.00013552279,0.00010594768,4.315143e-7,0.0006947937,0.00260176],"genre_scores_gemma":[0.07304306,0.0000024511712,0.92034644,0.00011235365,0.000027088381,0.000017802022,9.664665e-7,0.000006105735,0.0064437524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993788,0.000009707398,0.00012247432,0.00022194305,0.000077522476,0.00018953138],"domain_scores_gemma":[0.99905175,0.00003098974,0.00012931459,0.0006635922,0.000083214814,0.0000411124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029102727,0.00007359693,0.000088725516,0.000037770093,0.00060360314,0.0006262636,0.00097553554,0.00003853728,0.0000013444808],"category_scores_gemma":[0.00014786025,0.00006542531,0.000043960128,0.000031413445,0.000025988578,0.00030595585,0.0002781572,0.00004738884,0.000005285532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005507335,0.0001423564,0.0059256773,0.00006992481,0.00002706489,0.000009948337,0.0005564171,0.002001948,0.0002342874,0.4495128,0.0030127612,0.5385013],"study_design_scores_gemma":[0.00023565051,0.00003758432,0.00042574314,0.00001584359,0.0000014699563,0.0000014401844,0.000004850394,0.96100754,0.0020825763,0.0001790238,0.035884973,0.00012334067],"about_ca_topic_score_codex":0.000025281854,"about_ca_topic_score_gemma":0.000010674537,"teacher_disagreement_score":0.95900553,"about_ca_system_score_codex":0.000008999119,"about_ca_system_score_gemma":0.000021109623,"threshold_uncertainty_score":0.60390747},"labels":[],"label_agreement":null},{"id":"W4232499519","doi":"10.1109/pact.1997.643999","title":"Locality analysis for parallel C programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Locality; Compiler; Programmer; Parallel computing; Pointer (user interface); Programming language; Memory model; Shared memory; Computer hardware","score_opus":0.05072722177104812,"score_gpt":0.2763504682359366,"score_spread":0.22562324646488852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232499519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013588842,0.000046811667,0.99066585,0.00070610864,0.000029732886,0.00018053107,3.2481032e-7,0.0009472085,0.0072875456],"genre_scores_gemma":[0.3400579,0.000007662364,0.6578438,0.00027060646,0.000013692356,0.000034551194,0.000003222231,0.0000024676158,0.001766071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992339,0.000027105816,0.00016324478,0.00027388398,0.00011490186,0.00018697568],"domain_scores_gemma":[0.99935764,0.000039185714,0.000048670874,0.00040851114,0.00008680933,0.000059156962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019408022,0.00007812296,0.0001366531,0.00010414393,0.000092397066,0.00013401353,0.0005000971,0.000039456467,0.00003138275],"category_scores_gemma":[0.000015910517,0.00006567058,0.00014412537,0.0008002596,0.00001956122,0.0001396341,0.000075201475,0.00003454606,0.000018237104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063876487,0.00072144053,0.016471183,0.000027981954,0.0005843619,0.000004626899,0.00063805364,0.08695268,0.0000064267533,0.35706052,0.0371911,0.5003352],"study_design_scores_gemma":[0.00010381437,0.000045639208,0.00029376944,0.0000011649635,0.000017615372,7.652276e-7,0.0000019825422,0.99089795,0.000048547456,0.002207236,0.0062794485,0.0001020882],"about_ca_topic_score_codex":0.000015590029,"about_ca_topic_score_gemma":0.0000054604866,"teacher_disagreement_score":0.90394527,"about_ca_system_score_codex":0.000012837065,"about_ca_system_score_gemma":0.0000043802875,"threshold_uncertainty_score":0.26779684},"labels":[],"label_agreement":null},{"id":"W4232520646","doi":"10.1109/emsoft.2013.6658603","title":"DIME: Time-aware dynamic binary instrumentation using rate-based resource allocation","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instrumentation (computer programming); Computer science; Overhead (engineering); Scalability; Process (computing); Embedded system; Source code; Program analysis; Microcontroller; Dead code; Code (set theory); Resource (disambiguation); Real-time computing; Computer hardware; Code generation; Operating system; Redundant code; Programming language; Computer network; Set (abstract data type)","score_opus":0.011667650273866794,"score_gpt":0.25098133975687,"score_spread":0.2393136894830032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232520646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050761435,0.000010930953,0.94588464,0.0009632442,0.000047685266,0.0002461758,3.262939e-7,0.00084203295,0.0012435411],"genre_scores_gemma":[0.6831188,0.0000013939988,0.31555796,0.00067147665,0.000009447778,0.000014426664,0.000027681428,0.0000091352895,0.00058963813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990355,0.00012889598,0.00021383388,0.00029077093,0.00015353758,0.00017745858],"domain_scores_gemma":[0.99930376,0.000054967295,0.000106389605,0.00035929374,0.00011705493,0.00005856073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019890504,0.00011886218,0.000096608135,0.00016297834,0.00016541107,0.00022160068,0.00040240667,0.00005955642,0.00010771242],"category_scores_gemma":[0.000014526623,0.00011297157,0.00003424783,0.00040614727,0.000025585348,0.0005739897,0.00010265747,0.000068592875,0.00016215714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014582195,0.0002670493,0.00072166556,0.000048117294,0.00003146039,0.00000492972,0.00044428144,0.82800275,0.03917658,0.0033589085,0.015581944,0.11234775],"study_design_scores_gemma":[0.00017161769,0.000046126137,0.0010604456,0.000016151924,0.0000024432813,0.0000019987194,0.000010126241,0.99271005,0.0053121457,0.00037189663,0.00015031832,0.00014667578],"about_ca_topic_score_codex":0.00010063369,"about_ca_topic_score_gemma":9.374179e-7,"teacher_disagreement_score":0.6323574,"about_ca_system_score_codex":0.00009195009,"about_ca_system_score_gemma":0.00006767507,"threshold_uncertainty_score":0.4606847},"labels":[],"label_agreement":null},{"id":"W4232927598","doi":"10.1145/2578856.2508174","title":"Optimizing MATLAB feval with dynamic techniques","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; MATLAB; Solver; Function (biology); Interpreter; Programming language; Argument (complex analysis); Computational science; Feature (linguistics); Computer engineering; Algorithm; Parallel computing","score_opus":0.011059474827654077,"score_gpt":0.24610750590728117,"score_spread":0.2350480310796271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232927598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022054678,0.00013450446,0.96584433,0.0017933855,0.00008834683,0.00037038221,0.0000012182068,0.0025816795,0.007131476],"genre_scores_gemma":[0.4168426,0.000013570801,0.58254355,0.00031798845,0.000021992986,0.000030611685,0.000004208718,0.000011724214,0.00021372022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987169,0.00006189082,0.00021746613,0.0004082737,0.00026105618,0.00033441474],"domain_scores_gemma":[0.9985334,0.00017927523,0.00015194473,0.0009070996,0.00013447717,0.00009378106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018362825,0.00019801219,0.00018993628,0.00015429617,0.00017347104,0.00050461973,0.001698951,0.0000794345,0.000036299953],"category_scores_gemma":[0.000059832455,0.00015425682,0.000035733494,0.00032397735,0.00005727176,0.00086587,0.00040842153,0.00016181426,0.00011221861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012404138,0.001075273,0.010932853,0.0005487585,0.0005142631,0.00034665668,0.012009537,0.06410308,0.015866831,0.05165565,0.062939264,0.7798838],"study_design_scores_gemma":[0.0005656872,0.0007431288,0.003926448,0.00030650638,0.000031868036,0.00010857874,0.00014100442,0.9544773,0.025347931,0.0076850886,0.0052991235,0.0013673424],"about_ca_topic_score_codex":0.000111562804,"about_ca_topic_score_gemma":0.000009940132,"teacher_disagreement_score":0.89037424,"about_ca_system_score_codex":0.000033882625,"about_ca_system_score_gemma":0.000040920764,"threshold_uncertainty_score":0.6290411},"labels":[],"label_agreement":null},{"id":"W4232938914","doi":"10.1145/949319.949320","title":"Dynamic metrics for java","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Concurrency; Suite; Java; Just-in-time compilation; Benchmark (surveying); Programming language; Metric (unit); Set (abstract data type); Compiler","score_opus":0.018516748506078737,"score_gpt":0.27847818312668177,"score_spread":0.259961434620603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232938914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006841228,0.00006608115,0.9726428,0.00016817817,0.00011812823,0.00009689954,2.237555e-7,0.000495462,0.026343832],"genre_scores_gemma":[0.12207042,0.000009699705,0.8752333,0.0002979922,0.0000025724537,0.000008160891,6.1498497e-7,0.0000032873695,0.002373944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995322,0.000019853802,0.00009348746,0.00015757438,0.000071916045,0.00012496632],"domain_scores_gemma":[0.9995602,0.00008412942,0.000027704149,0.0002276785,0.00006803074,0.000032250173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023327173,0.000051027742,0.000059873375,0.00010161606,0.000065577144,0.00006545169,0.00030159383,0.00002770556,0.0000065518534],"category_scores_gemma":[0.00012293861,0.000044779215,0.00003457611,0.00037912704,0.00000652162,0.00010115237,0.000030272053,0.00002602367,0.000010847923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1762805e-7,0.000032041502,0.00006969669,0.0000048393786,0.000005216479,5.0486466e-7,0.00004178251,0.0023960946,0.000038651095,0.9686607,0.011305782,0.017444182],"study_design_scores_gemma":[0.0001250482,0.0000410986,0.000026956388,0.0000016564426,0.0000011407698,0.0000038251337,0.0000024386568,0.9362318,0.0024123723,0.022001598,0.039053056,0.00009902086],"about_ca_topic_score_codex":0.0000014002346,"about_ca_topic_score_gemma":5.3458484e-7,"teacher_disagreement_score":0.9466591,"about_ca_system_score_codex":0.00001670859,"about_ca_system_score_gemma":0.000025508367,"threshold_uncertainty_score":0.18260434},"labels":[],"label_agreement":null},{"id":"W4233014449","doi":"10.1109/jxcdc.2021.3115683","title":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits publication information","year":2021,"lang":"en","type":"article","venue":"IEEE Journal on Exploratory Solid-State Computational Devices and Circuits","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Pennsylvania; Pennsylvania State University; Georgia Institute of Technology; Intel Corporation","keywords":"Computer science; State (computer science); Solid-state; Engineering physics; Engineering; Algorithm","score_opus":0.02961029214580462,"score_gpt":0.27928312358897833,"score_spread":0.2496728314431737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233014449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11426306,0.000971871,0.8783228,0.0031043321,0.0019462912,0.00037059523,0.0000692487,0.00039723786,0.00055458007],"genre_scores_gemma":[0.980872,0.00094427145,0.007784446,0.009526456,0.00057296135,0.00003524085,0.00012794328,0.00005874182,0.00007795872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418896,0.00075022527,0.0017786078,0.00080039125,0.0017213308,0.000760504],"domain_scores_gemma":[0.99298155,0.00066251494,0.001663411,0.00040160137,0.0034644993,0.00082641555],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016914927,0.00068028684,0.0007007983,0.0010873392,0.0016944915,0.0037967965,0.0008616101,0.0002044156,0.000022154516],"category_scores_gemma":[0.00016881808,0.00067881466,0.00020470774,0.0010281018,0.0001764368,0.0065631084,0.00015368471,0.0011221762,0.000120532706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042380696,0.00037323032,0.0007496011,0.00015118017,0.0002877359,0.00020952003,0.0050787237,0.9057049,0.00015156674,0.004724741,0.008721545,0.07380483],"study_design_scores_gemma":[0.0045348145,0.0012814335,0.01565771,0.0012097608,0.0000970621,0.003458997,0.0007168917,0.8745595,0.0020806566,0.075859785,0.018174645,0.0023687214],"about_ca_topic_score_codex":0.0000017815464,"about_ca_topic_score_gemma":0.0000051875754,"teacher_disagreement_score":0.87053835,"about_ca_system_score_codex":0.00028527938,"about_ca_system_score_gemma":0.0011898314,"threshold_uncertainty_score":0.9996052},"labels":[],"label_agreement":null},{"id":"W4233182001","doi":"10.32920/ryerson.14655531","title":"Cache filtering algorithm for least frequently used data with accurate memory simulation","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; Cache; Cache algorithms; Cache-oblivious algorithm; CPU cache; Dram; Cache coloring; Algorithm; Interleaved memory; Computer hardware; Semiconductor memory; Memory management","score_opus":0.09607504414667822,"score_gpt":0.3350370610210939,"score_spread":0.23896201687441565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233182001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020447045,0.0001085392,0.9968089,0.00024493746,0.0003569094,0.0006141273,0.00005282636,0.0010783784,0.00053090526],"genre_scores_gemma":[0.056882285,0.000016632317,0.94138604,0.00017989568,0.0001416524,0.00005370518,0.00086880964,0.000029600375,0.00044135688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977257,0.00009800181,0.00038086122,0.0011873571,0.00031177382,0.00029629594],"domain_scores_gemma":[0.9966422,0.00020700769,0.00029836173,0.0024334372,0.000333005,0.0000860414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047941724,0.0003155253,0.00035926263,0.00013310206,0.0001566187,0.00093663443,0.0024865533,0.00019946549,0.000015041558],"category_scores_gemma":[0.000061121726,0.00028176588,0.000072778064,0.00021120522,0.000028411028,0.00067113474,0.0034325318,0.00031791115,0.0000025832942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028351715,0.000036675312,0.00000878522,0.00006202062,0.000058622514,0.000009846914,0.00024632775,0.92533857,0.000025355283,0.00010392503,0.000501039,0.073606],"study_design_scores_gemma":[0.00026813213,0.00003527791,0.000023119248,0.000154901,0.000018824234,0.000006301285,0.000023172359,0.99722254,0.0012319671,0.00021747658,0.00041155252,0.00038676258],"about_ca_topic_score_codex":0.00011499818,"about_ca_topic_score_gemma":0.000028350918,"teacher_disagreement_score":0.07321924,"about_ca_system_score_codex":0.000066408385,"about_ca_system_score_gemma":0.00032716303,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W4233372895","doi":"10.1145/2528521.1508281","title":"Phantom-BTB","year":2009,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Granularity; Overhead (engineering); Random access; Working set; Parallel computing; Table (database); CPU cache; Embedded system; Operating system; Database","score_opus":0.013411313974585382,"score_gpt":0.2656065375942448,"score_spread":0.2521952236196594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233372895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020347692,0.0001491005,0.9810084,0.010389757,0.00036610142,0.00029396336,0.0000010970296,0.0019858147,0.003770978],"genre_scores_gemma":[0.18288177,0.000026617368,0.8088094,0.007565196,0.00053323933,0.0000082554925,0.000007016007,0.00001563373,0.00015284705],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974089,0.00020820303,0.00040377813,0.000819949,0.0005051446,0.00065397104],"domain_scores_gemma":[0.9972808,0.0002774686,0.00012944425,0.0019384077,0.000120253244,0.00025364224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031470534,0.00035461312,0.00034735407,0.00036584176,0.0002453018,0.00035514,0.0037586999,0.00011936961,0.000012266293],"category_scores_gemma":[0.00008904094,0.00031056843,0.00017761282,0.00074045995,0.000056600238,0.00027780654,0.00089344446,0.00047846703,0.000063067775],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000094084,0.00010988068,0.00011243092,0.000006924631,0.000018637358,0.000043760534,0.0010201541,0.015165664,0.00044386712,0.009086522,0.01948432,0.9544984],"study_design_scores_gemma":[0.0018096013,0.0019829383,0.0068664243,0.00016298173,0.000018800094,0.0004887465,0.0000054926927,0.52930343,0.007896819,0.30185837,0.14792533,0.0016810902],"about_ca_topic_score_codex":0.000017467735,"about_ca_topic_score_gemma":0.000004551684,"teacher_disagreement_score":0.9528173,"about_ca_system_score_codex":0.00004268625,"about_ca_system_score_gemma":0.00008746325,"threshold_uncertainty_score":0.9999346},"labels":[],"label_agreement":null},{"id":"W4233698415","doi":"10.1109/micro.1992.696993","title":"On The Limits Of Program Parallelism And Its Smoothability","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Scheme for Promotion of Academic and Research Collaboration; Australian Centre for Advanced Photovoltaics; McGill University","keywords":"Parallelism (grammar); Computer science; Instruction-level parallelism; Parallel computing; Task parallelism; Programming language","score_opus":0.033744848180234786,"score_gpt":0.29645135023163244,"score_spread":0.2627065020513977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233698415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24753264,0.00028993707,0.6889094,0.020230925,0.00006691486,0.0008099049,6.726033e-7,0.0013405883,0.040818997],"genre_scores_gemma":[0.8572364,0.000020272899,0.14199893,0.000490005,0.000011813904,0.000013860914,1.4861625e-7,0.0000020480593,0.00022655774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941784,0.000054270855,0.00013313681,0.00017153367,0.00011925177,0.000103994535],"domain_scores_gemma":[0.99939954,0.00016981228,0.000048008376,0.00029096782,0.000060725557,0.000030925035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028702684,0.00006483054,0.00007729757,0.000028324492,0.000060042763,0.000042404485,0.00037475378,0.000030294887,0.000011349566],"category_scores_gemma":[0.00007267378,0.000039081195,0.000025191664,0.00013436034,0.000031042233,0.00009805151,0.00008929376,0.00006305174,0.0000067871256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037396292,0.00019591386,0.00015615174,0.000007635013,0.00000642039,2.6139682e-7,0.0002800147,0.0022688084,0.000048134538,0.84349203,0.0034622543,0.15007865],"study_design_scores_gemma":[0.00015656091,0.00026849497,0.0031537802,0.000017829027,0.000001918225,0.0000030993658,0.0000044196963,0.9659398,0.01270739,0.011679409,0.005932217,0.00013505215],"about_ca_topic_score_codex":0.0000032024939,"about_ca_topic_score_gemma":0.0000017408559,"teacher_disagreement_score":0.963671,"about_ca_system_score_codex":0.0000063964476,"about_ca_system_score_gemma":0.000013400685,"threshold_uncertainty_score":0.15936849},"labels":[],"label_agreement":null},{"id":"W4233718422","doi":"10.1109/cases.2013.6662524","title":"From software to accelerators with LegUp high-level synthesis","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Debugging; Field-programmable gate array; Embedded system; Hardware acceleration; High-level synthesis; Hardware architecture; Software; Coprocessor; Profiling (computer programming); Hardware compatibility list; Computer architecture; Operating system; Computer hardware","score_opus":0.01990286702719394,"score_gpt":0.22520057818975817,"score_spread":0.20529771116256423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233718422","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029260049,0.0000062283148,0.9666615,0.0014434052,0.00007278973,0.0001678444,0.0000026925366,0.001238336,0.0011471263],"genre_scores_gemma":[0.3550186,9.592756e-7,0.64352363,0.00082918984,0.000034693832,0.000046711884,0.0000010859538,0.0000074208965,0.000537718],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990495,0.000033528086,0.00014228956,0.00036670527,0.00019531889,0.0002126829],"domain_scores_gemma":[0.99901074,0.00015032415,0.0000410815,0.0005276951,0.00013262301,0.00013755026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000645069,0.00013358102,0.0001436857,0.00009457012,0.00009884717,0.00033840412,0.00082779565,0.00004749953,0.00024946124],"category_scores_gemma":[0.000053773445,0.00009763325,0.000023550443,0.0003331461,0.000014790359,0.00043575975,0.00022224798,0.000061182785,0.00041532196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017907927,0.0002799776,0.0066694394,0.000016509122,0.0001436824,0.000026507763,0.0019031125,0.018507889,0.0010393476,0.025888784,0.39207876,0.5534281],"study_design_scores_gemma":[0.0015062398,0.0010303135,0.13089482,0.0005052936,0.000054232263,0.000039084265,0.00027875975,0.31669277,0.48582473,0.039815582,0.018512057,0.0048461105],"about_ca_topic_score_codex":0.0012317334,"about_ca_topic_score_gemma":0.000014599744,"teacher_disagreement_score":0.54858196,"about_ca_system_score_codex":0.000023707475,"about_ca_system_score_gemma":0.000038933165,"threshold_uncertainty_score":0.53382623},"labels":[],"label_agreement":null},{"id":"W4234022143","doi":"10.1145/566470.566474","title":"Asymmetric-frequency clustering","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cluster analysis; Cluster (spacecraft); Power (physics); Voltage; Dual (grammatical number); Dissipation; Performance improvement; Reduction (mathematics); Electronic engineering; Embedded system; Electrical engineering; Engineering; Computer network; Artificial intelligence; Physics","score_opus":0.028170374214241036,"score_gpt":0.2455057448286666,"score_spread":0.21733537061442557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234022143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046588204,0.00017929194,0.7406581,0.00039819436,0.000087323235,0.00003086257,4.4417188e-8,0.00088316924,0.25771645],"genre_scores_gemma":[0.25909206,0.00004991786,0.73823863,0.0005906989,0.000024158677,0.0000028724792,1.4102471e-7,0.000003561161,0.0019979659],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939847,0.000021421327,0.00012101397,0.00018632042,0.00012053076,0.00015227031],"domain_scores_gemma":[0.9995227,0.000029870735,0.000030200757,0.0003309989,0.000038106577,0.000048138092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010238719,0.000064809945,0.00006572559,0.00013946934,0.000073999625,0.00011115921,0.00056190067,0.000029662751,0.000049943414],"category_scores_gemma":[0.000026247186,0.000058118912,0.00002938193,0.00054116815,0.000008114944,0.00024733355,0.00015585478,0.000054808883,0.0001724924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.076234e-7,0.00015112806,0.0006385892,0.00001292008,0.000016780137,0.000030170622,0.00043130736,0.005703507,0.0003136235,0.25341067,0.11442369,0.6248671],"study_design_scores_gemma":[0.000070962895,0.000026982949,0.0001575931,0.0000039152924,5.0479224e-7,0.000010142344,0.0000011027784,0.9925768,0.00047427297,0.0018935313,0.004676438,0.00010775391],"about_ca_topic_score_codex":0.000012908112,"about_ca_topic_score_gemma":6.492271e-7,"teacher_disagreement_score":0.98687327,"about_ca_system_score_codex":0.00001654343,"about_ca_system_score_gemma":0.000003534089,"threshold_uncertainty_score":0.23700204},"labels":[],"label_agreement":null},{"id":"W4234208104","doi":"10.1109/dac.2003.1219120","title":"A retargetable microarchitecture simulator","year":2004,"lang":"en","type":"article","venue":"Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Microarchitecture; Computer science; Computer architecture; Microprocessor; Instruction set; Embedded system; Branch predictor; Computer architecture simulator; Parallel computing","score_opus":0.02517826436919297,"score_gpt":0.24624760849092725,"score_spread":0.2210693441217343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234208104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008059493,0.00005914251,0.98313636,0.00079914456,0.0005522295,0.00095570664,0.0000047783687,0.0032193027,0.003213843],"genre_scores_gemma":[0.26384434,0.00006150243,0.73426753,0.00070598867,0.00015119783,0.000103545266,0.000011402723,0.000041538973,0.0008129345],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996654,0.000071584655,0.00073494733,0.0010485701,0.000679365,0.0008115444],"domain_scores_gemma":[0.99602336,0.00007425956,0.00052318454,0.0005089873,0.0025652843,0.00030490579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088064355,0.00054279686,0.00050700473,0.00037527506,0.00041974825,0.0010143078,0.0016531808,0.00031840662,0.00005752216],"category_scores_gemma":[0.00061360566,0.00053830235,0.00010849324,0.0017614125,0.00012855859,0.0014707107,0.0001817455,0.00038686654,0.00047409473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017211205,0.0012315381,0.0010385879,0.00081549055,0.00032222175,0.000057736277,0.015720343,0.30327094,0.32834065,0.22580026,0.09089945,0.032330662],"study_design_scores_gemma":[0.00085118314,0.00020183953,0.00012415883,0.00018962848,0.000019761821,0.00005366963,0.00003063614,0.902366,0.083953,0.008905694,0.0025713027,0.00073317083],"about_ca_topic_score_codex":0.000030439152,"about_ca_topic_score_gemma":0.0000012233425,"teacher_disagreement_score":0.599095,"about_ca_system_score_codex":0.00028801363,"about_ca_system_score_gemma":0.00090298423,"threshold_uncertainty_score":0.99970686},"labels":[],"label_agreement":null},{"id":"W4234392300","doi":"10.1145/1353536.1346301","title":"Predictor virtualization","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Virtualization; Memory hierarchy; Cache; Table (database); Operating system; Parallel computing; Embedded system; Database","score_opus":0.02957593603139608,"score_gpt":0.2567839502200828,"score_spread":0.22720801418868675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234392300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032770835,0.00010465722,0.9606217,0.00044323507,0.00023174014,0.00008714507,0.0000016464692,0.0011365924,0.0046024146],"genre_scores_gemma":[0.7990352,0.00004009737,0.2000402,0.00039971623,0.00008019661,0.0000049978194,0.000009221905,0.0000062741046,0.00038407918],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919033,0.000050767903,0.00015955245,0.00023759257,0.00020494942,0.00015679197],"domain_scores_gemma":[0.9990726,0.00014145537,0.000087418746,0.00057358353,0.00006554886,0.00005937072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114167866,0.0000920315,0.00009636308,0.000087747714,0.00018751342,0.00006335443,0.0010537228,0.000050655202,0.000014939996],"category_scores_gemma":[0.00020987139,0.00008487721,0.000027287202,0.0002605042,0.000036233978,0.00040863044,0.00022578878,0.0000620494,0.00006628668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007314228,0.00091321126,0.116464525,0.00015156672,0.00020379969,0.0004151577,0.023595557,0.13264349,0.002078077,0.32227543,0.3502717,0.050914336],"study_design_scores_gemma":[0.0007105049,0.00033939807,0.037695657,0.000059240192,0.000013257236,0.00010439555,0.000026765476,0.91353434,0.0072783646,0.0077112955,0.031787142,0.00073964475],"about_ca_topic_score_codex":0.000014955313,"about_ca_topic_score_gemma":0.0000015406836,"teacher_disagreement_score":0.7808908,"about_ca_system_score_codex":0.000012814386,"about_ca_system_score_gemma":0.000037005717,"threshold_uncertainty_score":0.34611923},"labels":[],"label_agreement":null},{"id":"W4234393984","doi":"10.1109/lpe.2002.1029615","title":"Asymmetric-frequency clustering: a power-aware back-end for high-performance processors","year":2003,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Low Power Electronics and Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cluster analysis; Cluster (spacecraft); Power (physics); Voltage; Performance improvement; Dual (grammatical number); Dissipation; Electronic engineering; Embedded system; Electrical engineering; Engineering; Computer network; Artificial intelligence; Physics","score_opus":0.010160239700153513,"score_gpt":0.22650808353973362,"score_spread":0.2163478438395801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234393984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045919187,0.00035622154,0.9335678,0.0024790966,0.00058221846,0.00089667435,0.0000054207226,0.00018872366,0.016004622],"genre_scores_gemma":[0.941888,0.00019072348,0.057116203,0.00038541312,0.000018056968,0.000049622937,8.0894455e-7,0.000018229133,0.00033295027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99854124,0.0000116662595,0.0003186529,0.0004061044,0.00040744018,0.00031487318],"domain_scores_gemma":[0.9988681,0.000100909936,0.0002959742,0.00014964605,0.00052950025,0.000055843815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059086183,0.00019798354,0.00017944112,0.00015279285,0.00016535136,0.0002205401,0.0011302227,0.000082723986,0.00000475394],"category_scores_gemma":[0.000112491754,0.00015603277,0.000065028384,0.00038978545,0.00004086311,0.0003804503,0.00012919703,0.00016300523,0.000002243287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026981064,0.00057770824,0.00096486456,0.0002097176,0.00021915996,6.5909944e-7,0.00070718257,0.010163664,0.03528703,0.93978524,0.00912632,0.0026886472],"study_design_scores_gemma":[0.0017761826,0.0028617228,0.00043572724,0.00036844218,0.000024984116,0.000068219626,0.000024111883,0.2478011,0.6967931,0.042242855,0.0067705754,0.00083302276],"about_ca_topic_score_codex":0.000002903986,"about_ca_topic_score_gemma":1.6128722e-7,"teacher_disagreement_score":0.89754236,"about_ca_system_score_codex":0.00012299302,"about_ca_system_score_gemma":0.000110622925,"threshold_uncertainty_score":0.63628316},"labels":[],"label_agreement":null},{"id":"W4234436083","doi":"10.1145/2872887.2750421","title":"Fusion","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cache; Memory hierarchy; Efficient energy use; Granularity; Embedded system; Operating system; Oracle; Locality; Multi-core processor; Computer architecture; Parallel computing","score_opus":0.028276702791952782,"score_gpt":0.2723983289106867,"score_spread":0.24412162611873395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234436083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036427644,0.00012373675,0.9850317,0.005245172,0.00064363686,0.0002457308,8.555723e-7,0.0015717866,0.0034945682],"genre_scores_gemma":[0.07952867,0.000011718592,0.91695046,0.002762661,0.00051927584,0.0000147828605,0.000008234285,0.000021091495,0.00018312385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770254,0.00025298944,0.00032913015,0.0006626473,0.00056598283,0.00048670344],"domain_scores_gemma":[0.99734205,0.00024074063,0.00010857834,0.001728783,0.0001952714,0.0003845676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004656143,0.00027468917,0.00027124424,0.00029431703,0.00015088172,0.00027089493,0.0031028283,0.00010502747,0.0000059481054],"category_scores_gemma":[0.00017288979,0.00023392048,0.00011202845,0.0006183474,0.00006158451,0.00023808025,0.00235679,0.000383612,0.00009390788],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016891914,0.0001020171,0.0006257211,0.00000955964,0.000023567198,0.000052053914,0.003002049,0.05236637,0.00014809845,0.0064415163,0.0760581,0.8611541],"study_design_scores_gemma":[0.0016702518,0.000991733,0.0012775133,0.00008959228,0.000009750512,0.0003054409,0.000014575408,0.6058343,0.002329728,0.11947412,0.26699516,0.0010077956],"about_ca_topic_score_codex":0.0000540413,"about_ca_topic_score_gemma":0.000010565309,"teacher_disagreement_score":0.8601463,"about_ca_system_score_codex":0.00005736566,"about_ca_system_score_gemma":0.00016131224,"threshold_uncertainty_score":0.95390004},"labels":[],"label_agreement":null},{"id":"W4234648926","doi":"10.1145/1273440.1250697","title":"BulkSC","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Consistency (knowledge bases); Consistency model; Sequential consistency; Decoupling (probability); Parallel computing; Weak consistency; Simple (philosophy); Strong consistency; Distributed computing; Computer architecture; Data consistency; Artificial intelligence","score_opus":0.01365119999028267,"score_gpt":0.2672355191216172,"score_spread":0.2535843191313345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234648926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023959796,0.000102689046,0.9868263,0.003114196,0.0005822194,0.00026699674,8.4550834e-7,0.0017254051,0.004985349],"genre_scores_gemma":[0.123644434,0.00001043577,0.8721519,0.003339414,0.00061468105,0.000006735295,0.000005891255,0.000023574497,0.00020294076],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974109,0.00012313112,0.00045818603,0.0007448262,0.00051081827,0.00075215293],"domain_scores_gemma":[0.99696004,0.0006432836,0.00013162334,0.0018473441,0.00013222563,0.00028546219],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071157,0.0003132081,0.00028899583,0.0004279893,0.00024094064,0.00024323113,0.0034546757,0.00012758152,0.000012922145],"category_scores_gemma":[0.000118168275,0.00027784443,0.00015616472,0.0007736858,0.0000829879,0.0002016803,0.001737527,0.0005024866,0.000071823844],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015141346,0.000091487185,0.0005694413,0.000015696265,0.000032093558,0.00008822805,0.0016075823,0.015004964,0.00034395469,0.012159016,0.016503925,0.95356846],"study_design_scores_gemma":[0.0022149652,0.0013374811,0.012260574,0.00018309226,0.000021792377,0.00081262144,0.000022104927,0.24298488,0.015051367,0.16624989,0.5565607,0.0023005612],"about_ca_topic_score_codex":0.000050493352,"about_ca_topic_score_gemma":0.000029001007,"teacher_disagreement_score":0.9512679,"about_ca_system_score_codex":0.00005156514,"about_ca_system_score_gemma":0.00007448499,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W4234669735","doi":"10.1109/edtc.1995.470354","title":"Describing instruction set processors using nML","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Computer science; Programmer; Formalism (music); Programming language; Set (abstract data type); Instruction set; Theoretical computer science; Parallel computing","score_opus":0.1006394418777845,"score_gpt":0.27099055819607193,"score_spread":0.17035111631828742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234669735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026805373,0.00003889111,0.9644712,0.00015038365,0.00010814276,0.00005412069,1.02957195e-7,0.0008964815,0.007475268],"genre_scores_gemma":[0.5287434,0.0000079625825,0.47086778,0.00015420183,0.000022085633,0.0000012301247,2.598801e-7,0.0000035290864,0.0001995259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993679,0.000024441348,0.00013050987,0.00020494417,0.00012365742,0.00014853805],"domain_scores_gemma":[0.9996203,0.000010918399,0.00005236397,0.00020225729,0.0000620568,0.000052060823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009731335,0.000073156356,0.000067250854,0.00009899882,0.0001473105,0.00013526528,0.0003102148,0.000037551938,0.000038372957],"category_scores_gemma":[0.000027969294,0.00006822728,0.000023142788,0.00038621054,0.000014950358,0.00047799316,0.00009287406,0.00006169159,0.000017700582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055686774,0.00022738987,0.0043045785,0.00006412034,0.00004767563,0.00002642432,0.006968199,0.24397045,0.0024963822,0.11685447,0.018765848,0.6062689],"study_design_scores_gemma":[0.00008653039,0.000013633462,0.000018113093,0.000015295023,0.0000010946059,0.000031445077,0.000010451671,0.9952283,0.0035237633,0.00055402436,0.00041676292,0.00010061443],"about_ca_topic_score_codex":0.000017414506,"about_ca_topic_score_gemma":7.20047e-7,"teacher_disagreement_score":0.75125784,"about_ca_system_score_codex":0.000030521856,"about_ca_system_score_gemma":0.000011525197,"threshold_uncertainty_score":0.27822277},"labels":[],"label_agreement":null},{"id":"W4234695468","doi":"10.1109/icpp.2004.1327958","title":"Architecture and implementation of chip multiprocessors: custom logic components and software for rapid prototyping","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Embedded system; Executable; Computer architecture; Rapid prototyping; Software prototyping; Programmable Array Logic; Software; Simple programmable logic device; Logic synthesis; Computer hardware; Operating system; Logic family; Software development; Logic gate; Engineering","score_opus":0.022504689386061327,"score_gpt":0.2941423360250986,"score_spread":0.2716376466390373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234695468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038162034,0.00015270425,0.9603697,0.00036345352,0.000014671223,0.0007077476,0.0000023393088,0.00020269299,0.00002466202],"genre_scores_gemma":[0.38158718,0.000021942848,0.6182174,0.00011545727,0.0000069293983,0.000039994287,0.0000041450085,0.000003353712,0.0000035694518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994127,0.00001590784,0.00016020185,0.00021417884,0.000077590994,0.00011943017],"domain_scores_gemma":[0.99963033,0.000044551532,0.00008880599,0.00010874357,0.0000916075,0.000035967776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013602326,0.00008417939,0.00010999003,0.00008138182,0.00009470596,0.00004614625,0.0001504478,0.00003223389,0.0000012625159],"category_scores_gemma":[0.000026704358,0.000070286806,0.000016262476,0.00011818249,0.00003097726,0.00013025764,0.000090575486,0.000040697993,1.4762625e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068631365,0.00018013884,0.006266855,0.0008806099,0.00005950215,0.0000017013163,0.0073248358,0.010668044,0.004053702,0.06458114,0.00011592647,0.9057989],"study_design_scores_gemma":[0.01604282,0.0028848846,0.062490094,0.0007490037,0.000055839835,0.00013826326,0.00056662085,0.23690154,0.2906459,0.38456705,0.003023272,0.0019346963],"about_ca_topic_score_codex":0.000042392414,"about_ca_topic_score_gemma":0.0000055497267,"teacher_disagreement_score":0.9038642,"about_ca_system_score_codex":0.000008961907,"about_ca_system_score_gemma":0.000025218225,"threshold_uncertainty_score":0.28662127},"labels":[],"label_agreement":null},{"id":"W4234833047","doi":"10.1145/2508148.2485964","title":"GPUWattch","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Computer and Network Systems; Division of Computing and Communication Foundations; Intel Corporation; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Frequency scaling; General-purpose computing on graphics processing units; Parallel computing; Energy consumption; Efficient energy use; Clock gating; Kernel (algebra); CUDA; Dynamic demand; Metric (unit); Embedded system; Performance metric; Power (physics); Graphics; Operating system; Clock skew; Clock signal","score_opus":0.012199544434399169,"score_gpt":0.24275915277541776,"score_spread":0.2305596083410186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234833047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004797537,0.00007601253,0.9800016,0.0095103625,0.00041264188,0.00047855443,7.02011e-7,0.001692268,0.003030294],"genre_scores_gemma":[0.11760035,0.000015207138,0.877271,0.0042983,0.00041808412,0.000065101485,0.0000063863504,0.000025287422,0.00030027312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975408,0.0002144234,0.00039238753,0.0007622483,0.00044937377,0.0006408024],"domain_scores_gemma":[0.99701035,0.0004024611,0.00011518766,0.0020238115,0.0001808289,0.000267386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021762711,0.00032740828,0.0003075406,0.00030331968,0.00022633061,0.000528986,0.0037695793,0.00011538971,0.000069866284],"category_scores_gemma":[0.00008833882,0.00027551866,0.00015212556,0.0006095008,0.00007839478,0.00039722255,0.0020299805,0.00046335466,0.00041489664],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026286814,0.00008537029,0.00076549914,0.000017904295,0.00003509388,0.00001527936,0.0011800431,0.014352134,0.00047341344,0.0050910227,0.08019718,0.8977844],"study_design_scores_gemma":[0.0010985202,0.00065917877,0.00957538,0.00010419518,0.000010728506,0.00026513453,0.000009665603,0.66806495,0.0039036835,0.20534289,0.1095926,0.001373095],"about_ca_topic_score_codex":0.00016201496,"about_ca_topic_score_gemma":0.000007840265,"teacher_disagreement_score":0.89641136,"about_ca_system_score_codex":0.00003793145,"about_ca_system_score_gemma":0.0000737835,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W4234965513","doi":"10.1109/csmr-wcre.2014.6747218","title":"Mc2FOR demo: A tool for automatically translating MATLAB to FORTRAN 95","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fortran; MATLAB; Computer science; Programming language; Java; Scripting language; Compiler; Python (programming language); Computational science; Function (biology)","score_opus":0.01469745101730303,"score_gpt":0.2704228184070676,"score_spread":0.2557253673897646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234965513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094815553,0.0000052334653,0.98741156,0.002403341,0.00007301387,0.00045705514,8.673869e-7,0.0015439877,0.0071567874],"genre_scores_gemma":[0.16717844,4.208798e-7,0.8308683,0.0014862427,0.000039796236,0.000059184382,0.0000014067582,0.000010240824,0.00035598857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890447,0.000033880184,0.0003000094,0.00030710132,0.00015543442,0.00029908426],"domain_scores_gemma":[0.9992128,0.00019515591,0.00004562239,0.00036165415,0.00008813103,0.00009666384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265942,0.00012327805,0.00016851039,0.00006667753,0.0001468128,0.0001870983,0.00059934135,0.000055799737,0.000009409296],"category_scores_gemma":[0.00012366688,0.00010700226,0.00008196544,0.00022136538,0.000010404862,0.00019243083,0.00006469453,0.00004985012,0.00002212287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011354647,0.00007419008,0.00010551668,0.00008127503,0.0000184193,6.9503733e-7,0.00094286486,0.011559791,0.00076430256,0.49226543,0.015638625,0.47853753],"study_design_scores_gemma":[0.00023362153,0.00015523782,0.00008993641,0.000022939912,0.000003172825,0.000003550912,0.0000025984484,0.9777619,0.0015484553,0.012819902,0.007179768,0.00017890849],"about_ca_topic_score_codex":0.000005329576,"about_ca_topic_score_gemma":0.000003685169,"teacher_disagreement_score":0.96620214,"about_ca_system_score_codex":0.0000140475395,"about_ca_system_score_gemma":0.000030375968,"threshold_uncertainty_score":0.43634257},"labels":[],"label_agreement":null},{"id":"W4235231639","doi":"10.32920/ryerson.14653593","title":"Measuring the dynamic energy efficiency of FPGAs over processors","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Application-specific integrated circuit; Parallel computing; Latency (audio); Efficient energy use; Embedded system; Computer hardware","score_opus":0.018469801542930615,"score_gpt":0.2518632515493319,"score_spread":0.2333934500064013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235231639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007442634,0.00082942843,0.9834908,0.00028221423,0.00028726883,0.00010311323,6.6378675e-7,0.00045430133,0.007109545],"genre_scores_gemma":[0.8937166,0.00016815723,0.105300464,0.00015808719,0.000018925532,0.000020680485,0.0000044612725,0.000011335809,0.0006013061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829924,0.00012127645,0.0003776998,0.00054304255,0.00044347395,0.00021526923],"domain_scores_gemma":[0.9982177,0.00008447902,0.00029210263,0.0010806242,0.00028521408,0.00003986632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041316135,0.00020735018,0.00027453227,0.00013027182,0.000105595296,0.00023384472,0.0021695762,0.00014884042,0.0000137405095],"category_scores_gemma":[0.000068142304,0.00014687526,0.00014939031,0.0004199434,0.00005824879,0.00009724406,0.0023177953,0.00027914735,8.6837014e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034213242,0.00022257694,0.00012295968,0.00026419043,0.0000876351,0.000010686694,0.001953781,0.9400471,0.00032627067,0.0339019,0.00071726495,0.022342205],"study_design_scores_gemma":[0.000055621087,0.000014721477,0.00018117693,0.00015437572,0.0000069588405,0.0000049507676,0.00001587971,0.98785454,0.008698715,0.0026712257,0.00014233626,0.00019952652],"about_ca_topic_score_codex":0.00018770785,"about_ca_topic_score_gemma":0.000026540953,"teacher_disagreement_score":0.8862739,"about_ca_system_score_codex":0.000048302714,"about_ca_system_score_gemma":0.0003098754,"threshold_uncertainty_score":0.5989399},"labels":[],"label_agreement":null},{"id":"W4235418227","doi":"10.32920/ryerson.14665956.v1","title":"Code coagulation is an effective compilation technique for the JVM","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compiler; Computer science; Java; Interpreter; Programming language; Code (set theory); Interface (matter); Source code; Operating system; Set (abstract data type)","score_opus":0.03675630503311766,"score_gpt":0.31988657973288465,"score_spread":0.283130274699767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235418227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020845432,0.00012322694,0.9939084,0.0010618265,0.0003619921,0.0026100536,0.000019069988,0.0009642732,0.0007427243],"genre_scores_gemma":[0.2950078,0.000031799962,0.7029778,0.00055066764,0.00010825568,0.00097228086,0.00016020352,0.000018690816,0.00017252774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834526,0.00020934083,0.00031504378,0.0006983124,0.00024195944,0.00019008103],"domain_scores_gemma":[0.9976028,0.0004228822,0.00026141354,0.0011526225,0.0005105917,0.000049692382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080970983,0.00024016637,0.00026226588,0.000114574446,0.0003037116,0.00058582315,0.0011080649,0.00029000055,0.000011252267],"category_scores_gemma":[0.00005855441,0.00018767221,0.00015302855,0.00022588055,0.000038689275,0.0002705564,0.0007983529,0.00032525056,0.0000018628915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040168947,0.0003550291,0.0007264365,0.00031642802,0.00024382655,0.0000036838298,0.0050788266,0.79478633,0.0023082732,0.07041864,0.014185303,0.111537024],"study_design_scores_gemma":[0.00010938971,0.00006689402,0.0012406829,0.00006981144,0.000017512419,0.000004529463,0.000014264139,0.9561684,0.03056811,0.010795005,0.00069588947,0.00024950705],"about_ca_topic_score_codex":0.000054505403,"about_ca_topic_score_gemma":0.000017645123,"teacher_disagreement_score":0.29479936,"about_ca_system_score_codex":0.000090275986,"about_ca_system_score_gemma":0.00010915508,"threshold_uncertainty_score":0.76530504},"labels":[],"label_agreement":null},{"id":"W4235443648","doi":"10.1145/2016603.1967692","title":"Lowering overhead in sampling-based execution monitoring and tracing","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Overhead (engineering); Debugging; Tracing; Sampling (signal processing); Embedded system; Distributed computing; Real-time computing; Software; Operating system","score_opus":0.06569044740153988,"score_gpt":0.2905479487889079,"score_spread":0.224857501387368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235443648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40543285,0.00015381318,0.59309477,0.000048429745,0.00015565722,0.00006570466,3.3503622e-7,0.000294896,0.0007535455],"genre_scores_gemma":[0.74497247,0.0000088369325,0.25495774,0.000022585862,0.00002462744,0.0000036543654,5.6494633e-7,0.000004611481,0.000004897227],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992358,0.000028620821,0.0001734717,0.0002617858,0.00010999661,0.00019028853],"domain_scores_gemma":[0.99937445,0.00015663936,0.00007579001,0.00032176464,0.000024079678,0.000047262496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025745213,0.00010073384,0.00011006275,0.00014923848,0.00008251429,0.00009263898,0.00045270284,0.000052293926,0.0000022432484],"category_scores_gemma":[0.000106743595,0.00010318762,0.000017328293,0.00018878841,0.000019816429,0.00036466302,0.00013764533,0.000105656596,0.0000027982533],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014108661,0.0005180038,0.67261195,0.00038610442,0.000048051003,0.00016644868,0.027192734,0.12003345,0.007310166,0.0070671174,0.00012733384,0.16439757],"study_design_scores_gemma":[0.0010019215,0.00029568342,0.33594197,0.00077290565,0.000014214947,0.000014774575,0.00018164988,0.54929996,0.106487,0.004977086,0.00014735489,0.00086547283],"about_ca_topic_score_codex":0.00015363221,"about_ca_topic_score_gemma":0.000010949925,"teacher_disagreement_score":0.4292665,"about_ca_system_score_codex":0.000022508078,"about_ca_system_score_gemma":0.000018059061,"threshold_uncertainty_score":0.42078692},"labels":[],"label_agreement":null},{"id":"W4235679073","doi":"10.32920/ryerson.14651649.v1","title":"Run-time thermal management based on task migration techniques in 3D chip multiprocessors","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Many core; Task (project management); Architecture; Latency (audio); Chip; Multi-core processor; Throughput; Parallel computing; Distributed computing; Embedded system; Engineering; Telecommunications","score_opus":0.011222393037831572,"score_gpt":0.24753009028921213,"score_spread":0.23630769725138057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235679073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023473932,0.000058312147,0.962955,0.0011156471,0.00011970388,0.00065928145,0.0000018464932,0.0019532559,0.030789547],"genre_scores_gemma":[0.19756685,0.00006744298,0.79995775,0.0015741447,0.000038928643,0.00018407148,0.000074336385,0.000022467584,0.00051397417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975136,0.00023263751,0.00048169086,0.0009921788,0.00047113965,0.00030874743],"domain_scores_gemma":[0.9983609,0.00008613697,0.00021595077,0.0011101683,0.000164739,0.00006213079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006405149,0.00037286463,0.00034676053,0.0005613752,0.00008007584,0.00044579039,0.0013381258,0.00029293474,0.000027462878],"category_scores_gemma":[0.00004003225,0.00035621817,0.00012274929,0.00048049688,0.000027763606,0.00020578006,0.0010444558,0.00047016292,0.000018297502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003949129,0.00097537733,0.0005083331,0.00031791854,0.000058709178,0.0001403552,0.001154175,0.84902483,0.00037783955,0.0019053589,0.002255177,0.14324246],"study_design_scores_gemma":[0.00017934159,0.000057260295,0.0005562354,0.0004731974,0.0000059628833,9.593533e-7,0.000012508571,0.9879205,0.00948249,0.00026123654,0.00062238274,0.00042789377],"about_ca_topic_score_codex":0.00010013101,"about_ca_topic_score_gemma":0.000016352966,"teacher_disagreement_score":0.19521947,"about_ca_system_score_codex":0.00014554911,"about_ca_system_score_gemma":0.00010876056,"threshold_uncertainty_score":0.99988896},"labels":[],"label_agreement":null},{"id":"W4235725903","doi":"10.1109/wsc.2009.5429289","title":"On the scalability and dynamic load balancing of parallel Verilog simulations","year":2009,"lang":"en","type":"article","venue":"Proceedings of the 2009 Winter Simulation Conference (WSC)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Verilog; Electronic circuit; Scalability; Bottleneck; Parallel computing; Hardware description language; Viterbi decoder; Embedded system; Decoding methods; Field-programmable gate array; Algorithm; Electrical engineering; Engineering","score_opus":0.017300435231891745,"score_gpt":0.26619072726082593,"score_spread":0.2488902920289342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235725903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4865698,0.000034758268,0.50673383,0.0032667653,0.00008765734,0.0004562405,0.000005336639,0.00015660095,0.0026890386],"genre_scores_gemma":[0.98861825,0.000005428292,0.01096964,0.00029932093,0.000011311504,0.0000025035772,6.04722e-7,0.000004679334,0.00008828646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.000028274313,0.00039654606,0.00029948857,0.00033779588,0.00016652551],"domain_scores_gemma":[0.99833643,0.0002928885,0.000359742,0.00029477733,0.0006771908,0.000038972084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041653047,0.00015536282,0.00020666943,0.000076119955,0.0001564881,0.00010617772,0.0007820917,0.000069692425,0.00001179296],"category_scores_gemma":[0.00047451537,0.000101609854,0.00007467387,0.00028715245,0.000117200325,0.0003390317,0.00016575136,0.00015941796,0.0000013938828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013978103,0.0003480994,0.010977349,0.00009044258,0.0000521444,1.9469462e-7,0.0050514936,0.78479785,0.009162292,0.1686806,0.0008222458,0.019877505],"study_design_scores_gemma":[0.00018714013,0.000111903246,0.022489283,0.00012625146,0.0000073973615,9.0921725e-7,0.00001980145,0.9286823,0.001934191,0.0463039,0.000031908592,0.00010501015],"about_ca_topic_score_codex":0.000006908269,"about_ca_topic_score_gemma":0.0000019429492,"teacher_disagreement_score":0.50204843,"about_ca_system_score_codex":0.00004710873,"about_ca_system_score_gemma":0.00005359336,"threshold_uncertainty_score":0.41435295},"labels":[],"label_agreement":null},{"id":"W4235798468","doi":"10.1145/342001.339680","title":"Performance analysis of the Alpha 21264-based Compaq ES40 system","year":2000,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Microprocessor; Profiling (computer programming); Memory bandwidth; Operating system; Embedded system; Cache; x86; CPU cache; Benchmark (surveying); Multiprocessing; Computer architecture; Parallel computing; Software","score_opus":0.009839167229520704,"score_gpt":0.22946826073762863,"score_spread":0.21962909350810794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235798468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114639096,0.000049226677,0.8808827,0.0012859876,0.00022194035,0.000333667,0.0000060664775,0.0006510609,0.0019302706],"genre_scores_gemma":[0.7214855,0.000006361512,0.27750233,0.00077379844,0.000095055024,0.000014485119,0.000008375066,0.00001410381,0.00009999554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971839,0.00041705708,0.00059741054,0.0006540687,0.000676789,0.00047075056],"domain_scores_gemma":[0.9963946,0.00043552785,0.000236866,0.0026494854,0.00014928398,0.00013428458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042167096,0.00032366373,0.00057360367,0.0005050187,0.0003119512,0.00013570633,0.0044855378,0.00010208655,0.00003231029],"category_scores_gemma":[0.0000242123,0.00022816575,0.00044048237,0.0028255687,0.00015015322,0.0001264993,0.00067829614,0.0003830496,0.000014985895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001394696,0.00006074266,0.004173437,0.000046850986,0.00018529188,0.0000028976376,0.000553125,0.77119595,0.000041634205,0.00038274165,0.000627873,0.2227155],"study_design_scores_gemma":[0.00032267533,0.00012936445,0.01888826,0.00010049031,0.000098240635,0.000012567107,0.0000025225036,0.9733498,0.001207556,0.00010092109,0.005543453,0.00024414464],"about_ca_topic_score_codex":0.0001106309,"about_ca_topic_score_gemma":0.000025910145,"teacher_disagreement_score":0.6068464,"about_ca_system_score_codex":0.00006660732,"about_ca_system_score_gemma":0.00012713388,"threshold_uncertainty_score":0.9304329},"labels":[],"label_agreement":null},{"id":"W4235983790","doi":"10.1145/1961295.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dram; Correctness; Embedded system; Software; Energy consumption; Operating system; Computer hardware; Programming language","score_opus":0.029415153496564136,"score_gpt":0.24917110043450136,"score_spread":0.2197559469379372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235983790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021093723,0.00007251567,0.98446333,0.0010664053,0.00048390654,0.00025172002,9.823252e-7,0.0016457785,0.009905978],"genre_scores_gemma":[0.0969736,0.000014364719,0.8999299,0.002564465,0.00028580954,0.000020620328,0.0000038701496,0.000024016928,0.00018340362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776685,0.00020078463,0.00036146652,0.00073535694,0.00037382395,0.0005617193],"domain_scores_gemma":[0.99734664,0.00019844674,0.00011603611,0.0019974883,0.00011524944,0.00022611895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028485432,0.00030896382,0.00028358508,0.0003070014,0.00019518872,0.00015372326,0.0036755113,0.000111619825,0.000042310054],"category_scores_gemma":[0.00006790724,0.00026469064,0.00015692993,0.0005503066,0.00008671464,0.00024807136,0.0018982118,0.00042013443,0.00011499657],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022789145,0.00022107898,0.0017125008,0.000025291909,0.00007465798,0.00010090832,0.008871339,0.0034214277,0.0002126144,0.029436372,0.024512982,0.931388],"study_design_scores_gemma":[0.0023182551,0.0019485719,0.02072398,0.00020758806,0.000036950718,0.0007293736,0.000022481967,0.41066512,0.01558938,0.36836463,0.17658947,0.0028041836],"about_ca_topic_score_codex":0.00007832576,"about_ca_topic_score_gemma":0.000011983834,"teacher_disagreement_score":0.92858386,"about_ca_system_score_codex":0.000028593297,"about_ca_system_score_gemma":0.00007492667,"threshold_uncertainty_score":0.9999805},"labels":[],"label_agreement":null},{"id":"W4236033604","doi":"10.1007/978-1-4615-1681-1_7","title":"Hardware Techniques","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Branch predictor; Computer science; Remainder; Superscalar; Parallel computing; Scheduling (production processes); Table (database); Operating system; Computer hardware; Arithmetic; Database; Mathematics; Mathematical optimization","score_opus":0.022213314529609104,"score_gpt":0.250567216033541,"score_spread":0.22835390150393187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236033604","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.343005e-9,0.00010924221,0.4910277,0.00020939905,0.000060840906,0.000094147625,9.2685156e-7,0.002528561,0.50596917],"genre_scores_gemma":[0.000015595057,0.00038952954,0.3446663,0.00058018614,0.000101992824,0.0000060321504,0.000008518858,0.000024528314,0.6542073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987058,0.000010487296,0.0002877331,0.0005183659,0.00027221334,0.00020540234],"domain_scores_gemma":[0.9986608,0.000032604825,0.00015870747,0.00090834586,0.00015745262,0.00008209774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014216609,0.00030004373,0.00028549499,0.0002479217,0.00009279652,0.00016979924,0.0012729582,0.00033171487,0.00033991836],"category_scores_gemma":[0.000008222018,0.00027806978,0.0001430343,0.000053363237,0.000038416852,0.00016755746,0.00044762628,0.00028789806,0.00025010298],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5024586e-7,0.000004685436,6.821572e-7,0.000005618383,0.000010189769,0.000023127692,0.000010770632,0.000008695951,0.000001193538,0.81920445,0.10097174,0.079758376],"study_design_scores_gemma":[0.000026531594,0.00004279663,4.6716949e-7,0.00008373122,0.000004175483,0.00003409713,1.764833e-7,0.0028051632,0.00040809464,0.09766583,0.89857894,0.0003499704],"about_ca_topic_score_codex":0.000006254281,"about_ca_topic_score_gemma":0.0000014994752,"teacher_disagreement_score":0.79760724,"about_ca_system_score_codex":0.00005502671,"about_ca_system_score_gemma":0.00006661235,"threshold_uncertainty_score":0.99996716},"labels":[],"label_agreement":null},{"id":"W4236073229","doi":"10.1002/cpe.1454","title":"Improving energy efficiency of asymmetric chip multithreaded multiprocessors through reduced OS noise scheduling","year":2009,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Multiprocessing; Multithreading; Embedded system; Scheduling (production processes); Context switch; Thread (computing); Multi-core processor; Efficient energy use; Xeon; Chip; Operating system; Parallel computing","score_opus":0.02347586358554719,"score_gpt":0.31696521371199193,"score_spread":0.2934893501264447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236073229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09213051,0.0025750934,0.90387106,0.00030097106,0.00013616082,0.00010871039,5.66604e-7,0.0001823853,0.00069454534],"genre_scores_gemma":[0.79023266,0.00043810584,0.20894058,0.0003451515,0.000021553733,0.000008824978,0.0000022633205,0.0000040407203,0.0000068096733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984659,0.00010915513,0.0004245343,0.00051699195,0.00025159484,0.00023181443],"domain_scores_gemma":[0.99858683,0.00037869718,0.00044365658,0.00019941991,0.00030351305,0.000087891174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027112395,0.00018559096,0.0002248439,0.00016690163,0.0002918825,0.00017504467,0.0003169649,0.000077978366,8.7432653e-7],"category_scores_gemma":[0.000698194,0.0001805919,0.00003284809,0.00082203245,0.00011075193,0.0017722076,0.000108513574,0.00014179264,7.3862554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005007502,0.00036984924,0.00012626965,0.00006397142,0.000014471305,0.000008994756,0.025956431,0.011196813,0.0057954816,0.034413885,0.00003060243,0.92197317],"study_design_scores_gemma":[0.0005972771,0.00031150432,0.0002968111,0.0000742658,0.000012646855,0.000046463512,0.00086722954,0.97241426,0.023409177,0.0014925993,0.0001778323,0.00029996573],"about_ca_topic_score_codex":0.00006817332,"about_ca_topic_score_gemma":2.6593202e-7,"teacher_disagreement_score":0.9612174,"about_ca_system_score_codex":0.000013365462,"about_ca_system_score_gemma":0.00007559378,"threshold_uncertainty_score":0.7364324},"labels":[],"label_agreement":null},{"id":"W4236154505","doi":"10.1145/1353534.1346301","title":"Predictor virtualization","year":2008,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Memory hierarchy; Virtualization; Cache; Table (database); Chip; Operating system; Parallel computing; Embedded system; Database","score_opus":0.018617896493407195,"score_gpt":0.2474290023509726,"score_spread":0.2288111058575654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236154505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007855749,0.00008828203,0.9862101,0.0018893863,0.00046910878,0.00030492025,0.0000021058947,0.0019095485,0.0012708164],"genre_scores_gemma":[0.18457839,0.00006217503,0.812185,0.002322317,0.0005474317,0.000024116936,0.000018851784,0.00002680344,0.00023493923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763966,0.00023964955,0.00039950263,0.0007089612,0.00054017623,0.00047206052],"domain_scores_gemma":[0.9976041,0.00031382442,0.00013479615,0.0015840412,0.00015131381,0.00021197964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020629086,0.0002947657,0.00028522057,0.00033208504,0.00038160855,0.0001309216,0.0026332813,0.000117582334,0.000014314015],"category_scores_gemma":[0.00013507257,0.00026506904,0.00013257226,0.00070501,0.00011348117,0.0002957892,0.0012859148,0.00034305672,0.000051809267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049728907,0.00048462252,0.008173434,0.000069030844,0.00015507289,0.0002872905,0.014353427,0.2266735,0.000892652,0.031007303,0.15716463,0.56068933],"study_design_scores_gemma":[0.001481522,0.00088573847,0.013201822,0.000098022356,0.000012272601,0.0009009758,0.0000050767344,0.8388156,0.002696151,0.038432263,0.102336675,0.0011338558],"about_ca_topic_score_codex":0.000027267213,"about_ca_topic_score_gemma":0.00000505793,"teacher_disagreement_score":0.61214215,"about_ca_system_score_codex":0.000044279026,"about_ca_system_score_gemma":0.00012954869,"threshold_uncertainty_score":0.99998015},"labels":[],"label_agreement":null},{"id":"W4236156201","doi":"10.1145/885651.781030","title":"A framework for modeling and optimization of prescient instruction prefetch","year":2003,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instruction prefetch; Computer science; Spawn (biology); Parallel computing; Thread (computing); Cache; Multithreading; Heuristics; Distributed computing; Operating system","score_opus":0.09339457510125627,"score_gpt":0.3543818088721181,"score_spread":0.26098723377086186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236156201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027844603,0.01832578,0.97724247,0.00015545248,0.00016990057,0.0010567601,7.5371673e-7,0.00008205904,0.00018237627],"genre_scores_gemma":[0.12783813,0.037550602,0.83432245,0.00013259467,0.00001206535,0.00012439977,0.0000070076626,0.0000070331466,0.0000056883828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984254,0.00014305096,0.00047961707,0.0003150012,0.0004887622,0.00014812905],"domain_scores_gemma":[0.99800783,0.00019675768,0.00031467387,0.0005772486,0.00085758074,0.000045929217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031775127,0.00011636309,0.00022239496,0.00029683407,0.00014189507,0.00005167657,0.000399824,0.00006974747,0.000010323833],"category_scores_gemma":[0.0050554285,0.00010896029,0.000048238937,0.0016874565,0.000019238403,0.00051105703,0.00009095834,0.000082809696,8.484694e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018509874,0.00002649017,0.00016669353,0.0005896144,0.0000064019932,1.0444525e-8,0.00005555416,0.81739813,0.0000018873508,0.014265227,0.00007154258,0.16741659],"study_design_scores_gemma":[0.00023988438,0.000102412894,0.000029093333,0.00073988916,0.000034156852,0.0000028742425,0.0000020890348,0.9924389,0.00025282908,0.005651437,0.00038876804,0.00011767527],"about_ca_topic_score_codex":8.4206096e-7,"about_ca_topic_score_gemma":5.7483035e-8,"teacher_disagreement_score":0.17504075,"about_ca_system_score_codex":0.00005182898,"about_ca_system_score_gemma":0.00012438797,"threshold_uncertainty_score":0.6052185},"labels":[],"label_agreement":null},{"id":"W4236721623","doi":"10.1109/pact.1999.807436","title":"Quantifying the benefits of SPECint distant parallelism in simultaneous multithreading architectures","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"Direcció General de Recerca, Generalitat de Catalunya","keywords":"Computer science; Multithreading; Instruction-level parallelism; Parallel computing; Task parallelism; Parallelism (grammar); Thread (computing); Implicit parallelism; Speculative multithreading; Simultaneous multithreading; Yarn; Compiler; Data parallelism; Exploit; Instruction set; Computer architecture; Operating system","score_opus":0.034118755070402934,"score_gpt":0.2793487924997189,"score_spread":0.24523003742931596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236721623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06600853,0.0003216253,0.9293654,0.00025078698,0.00009909802,0.00016251991,4.135628e-7,0.00017221195,0.003619391],"genre_scores_gemma":[0.80588615,0.000036819663,0.19389877,0.00010751803,0.000008404352,0.000003695019,2.736919e-7,0.000005019668,0.000053380194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893034,0.00011146115,0.00030086,0.0002567171,0.00018212544,0.00021849724],"domain_scores_gemma":[0.99878114,0.0006084979,0.000096763084,0.0004301037,0.00004980821,0.000033695764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034030213,0.00011770404,0.00016081237,0.000111585934,0.00008242427,0.000060948772,0.0005733313,0.00003827214,0.000007281851],"category_scores_gemma":[0.0003183965,0.000076158154,0.000048976013,0.00036016305,0.000041190833,0.000047867175,0.00009689258,0.00013310248,0.0000029382054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030505316,0.00003885209,0.0015988179,0.000006621376,0.0000043958225,0.000005531872,0.0009336139,0.7895884,0.00010148793,0.19755617,0.000028771809,0.010134272],"study_design_scores_gemma":[0.00029776996,0.00005384566,0.001240318,0.00007303197,0.000002311709,0.000018036179,0.00008759081,0.9768985,0.013726557,0.006647154,0.0007269225,0.00022795271],"about_ca_topic_score_codex":0.00013298553,"about_ca_topic_score_gemma":0.00021226182,"teacher_disagreement_score":0.7398776,"about_ca_system_score_codex":0.000021563705,"about_ca_system_score_gemma":0.00002484431,"threshold_uncertainty_score":0.31056395},"labels":[],"label_agreement":null},{"id":"W4237013899","doi":"10.1109/ipdps.2006.1639601","title":"Power-performance efficiency of asymmetric multiprocessors for multi-threaded scientific applications","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Server; Multiprocessing; Spec#; Scheduling (production processes); Operating system; Energy consumption; Slowdown; Power consumption; Embedded system; Power management; Power (physics); Parallel computing; Power budget; Server farm; Efficient energy use; Electric power system; Engineering; Client–server model","score_opus":0.02217611362826873,"score_gpt":0.27704388154756926,"score_spread":0.25486776791930055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237013899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007913735,0.00013060034,0.9871567,0.00004767792,0.000088346176,0.00052117027,0.0000030057424,0.00048735336,0.0036513954],"genre_scores_gemma":[0.53558,0.0000020251555,0.46340317,0.0000146818065,0.000007697394,0.00007140666,0.0000046343634,0.000004445142,0.0009119453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987958,0.000013545034,0.00033801948,0.00039984955,0.00021119679,0.00024155327],"domain_scores_gemma":[0.9988619,0.00008534828,0.00016801423,0.0004678609,0.0003778952,0.000039001192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039329028,0.00011169225,0.0001418845,0.0004159596,0.00027916976,0.000114375965,0.0008722132,0.000052120748,0.0000023477837],"category_scores_gemma":[0.000035581514,0.00010013441,0.00006315189,0.0018761496,0.000097811404,0.0002421473,0.000099466815,0.000047934038,0.000010870651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003286508,0.004733401,0.013198845,0.0006210144,0.00004473828,9.173091e-7,0.0010056157,0.17301412,0.013308282,0.64609474,0.011865739,0.13607971],"study_design_scores_gemma":[0.00035975402,0.00006318672,0.0010655116,0.0000099299505,0.0000022801757,0.000001343044,0.000005062709,0.8964127,0.0987762,0.00048057965,0.0026727403,0.00015077139],"about_ca_topic_score_codex":0.000014364246,"about_ca_topic_score_gemma":0.0000017611552,"teacher_disagreement_score":0.7233985,"about_ca_system_score_codex":0.00002144427,"about_ca_system_score_gemma":0.000067468936,"threshold_uncertainty_score":0.40833628},"labels":[],"label_agreement":null},{"id":"W4237305187","doi":"10.1109/icpp.2004.1327911","title":"Low-cost register-pressure prediction for scalar replacement using pseudo-schedules","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Register allocation; Computer science; Speedup; Parallel computing; Software pipelining; Register (sociolinguistics); Scalar (mathematics); Schedule; Software; Control flow graph; Algorithm; Reuse; Mathematics; Theoretical computer science; Programming language; Operating system; Engineering","score_opus":0.028091114423260084,"score_gpt":0.28280684515084753,"score_spread":0.25471573072758746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237305187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028116864,0.000044415905,0.994198,0.0005239513,0.00024146857,0.00049012864,0.000004548263,0.00084815314,0.0008376164],"genre_scores_gemma":[0.18801455,0.000011413749,0.81124455,0.00031157513,0.00007826495,0.00003532399,0.000007378141,0.000010047347,0.00028692943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988877,0.000026973203,0.00025777685,0.00040380497,0.00019158104,0.00023212619],"domain_scores_gemma":[0.9991125,0.000026863778,0.00010944342,0.0005421573,0.00013897897,0.000070083894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033218646,0.00012770251,0.00012838833,0.00009172053,0.00021551899,0.00016667845,0.0004477073,0.00007913696,0.0000046134674],"category_scores_gemma":[0.000041945306,0.000118611846,0.00006871087,0.00019027661,0.000026156507,0.00035327792,0.00014720556,0.00007022135,0.000004537237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040001447,0.00021099034,0.00049578544,0.00008706123,0.000048210208,0.000002416829,0.00027705132,0.8570243,0.0010695559,0.13108581,0.0029960673,0.0066627436],"study_design_scores_gemma":[0.0006410644,0.0000989538,0.00011601434,0.00008138112,0.000012443709,0.000012842361,0.000010034802,0.9662612,0.023540234,0.0056797103,0.0033780357,0.00016806064],"about_ca_topic_score_codex":0.000025263758,"about_ca_topic_score_gemma":0.000002530381,"teacher_disagreement_score":0.18520287,"about_ca_system_score_codex":0.000065611,"about_ca_system_score_gemma":0.00006895809,"threshold_uncertainty_score":0.48368508},"labels":[],"label_agreement":null},{"id":"W4237305228","doi":"10.1109/micro.2007.4408265","title":"A Framework for Coarse-Grain Optimizations in the On-Chip Memory Hierarchy","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Hierarchy; Memory hierarchy; Chip; System on a chip; Random access memory; Parallel computing; Computer architecture; Embedded system; Computer hardware; Telecommunications","score_opus":0.010527777396485373,"score_gpt":0.2704308960992914,"score_spread":0.259903118702806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237305228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5389397,0.00025897042,0.067323446,0.28244904,0.009321847,0.008882593,0.0029158106,0.0009964271,0.088912174],"genre_scores_gemma":[0.9156858,0.000084409694,0.07079634,0.009470657,0.0012457886,0.00023799141,0.00004000502,0.0001533743,0.0022856453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9938565,0.000068092595,0.0015706988,0.0014018953,0.0021236362,0.0009791842],"domain_scores_gemma":[0.9938453,0.0012067971,0.0016617561,0.00064499484,0.0024628548,0.00017828662],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021941955,0.00088502164,0.00069864106,0.00082385907,0.0006775414,0.0005555028,0.011131908,0.0004990734,0.000018147242],"category_scores_gemma":[0.000979349,0.0005926026,0.000965525,0.0016260678,0.0007564616,0.00055359,0.0014088722,0.0020277188,0.000008147464],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042241635,0.003961895,0.0032740338,0.0003883082,0.0011463516,0.0000074423297,0.04820395,0.09303517,0.19149584,0.5832994,0.0611783,0.009785174],"study_design_scores_gemma":[0.008102342,0.0049683466,0.009519129,0.005940789,0.00032264678,0.0009267334,0.009754732,0.017974557,0.69560003,0.14928995,0.09326615,0.0043345606],"about_ca_topic_score_codex":0.0001281542,"about_ca_topic_score_gemma":0.00003054687,"teacher_disagreement_score":0.5041042,"about_ca_system_score_codex":0.00041639028,"about_ca_system_score_gemma":0.00011107458,"threshold_uncertainty_score":0.99965256},"labels":[],"label_agreement":null},{"id":"W4237697442","doi":"10.32920/ryerson.14661414.v1","title":"Performance and energy optimization of heterogeneous CPU-GPU systems for embedded applications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; Software; CUDA; Symmetric multiprocessor system; Central processing unit; Parallelism (grammar); Energy consumption; Embedded system; Power consumption; Computer architecture; Power (physics); Computer hardware; Operating system","score_opus":0.01668934640982964,"score_gpt":0.25087234682191606,"score_spread":0.23418300041208642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237697442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025651394,0.0008339904,0.99659556,0.00006153135,0.00015283783,0.00032900623,0.0000065889662,0.000344933,0.0014190141],"genre_scores_gemma":[0.30024058,0.0016009654,0.69710064,0.00009371514,0.000034524688,0.00047670436,0.000094527095,0.000014894955,0.00034343443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987539,0.000065503766,0.00039160225,0.00050194457,0.00014656995,0.00014045002],"domain_scores_gemma":[0.9985047,0.00007768147,0.00030108407,0.000659554,0.0004041275,0.000052858817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021162166,0.00017742696,0.00030047004,0.00013317521,0.00008311039,0.00023575677,0.00052927673,0.0001711378,0.0000016894573],"category_scores_gemma":[0.000009770795,0.0001800113,0.000071757735,0.00015438003,0.000028677625,0.000119895696,0.0006923069,0.00008527775,1.2862645e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015994133,0.000028621425,0.000016033886,0.00021779697,0.0000215688,1.8207575e-7,0.000085828644,0.98951685,0.0000100602265,0.006949496,0.00015732992,0.0029946088],"study_design_scores_gemma":[0.000095692594,0.000032051015,0.0000058608416,0.00009030724,0.000010151449,0.000011651775,0.000008314045,0.99783903,0.00092736655,0.00013144544,0.00066672853,0.00018141737],"about_ca_topic_score_codex":0.000048841033,"about_ca_topic_score_gemma":0.000001916452,"teacher_disagreement_score":0.29998407,"about_ca_system_score_codex":0.000024577603,"about_ca_system_score_gemma":0.00013456416,"threshold_uncertainty_score":0.73406476},"labels":[],"label_agreement":null},{"id":"W4237924690","doi":"10.1109/micro.1998.742766","title":"Simple vector microprocessors for multimedia applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Datapath; Computer science; Microprocessor; Parallel computing; Instruction set; Register file; Simple (philosophy); Computer hardware; Computer architecture","score_opus":0.023012027412852833,"score_gpt":0.2683193977830487,"score_spread":0.24530737037019587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237924690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048345908,0.00008903582,0.9948317,0.00051864143,0.00002885918,0.00028616728,0.0000027649614,0.000814901,0.0033796115],"genre_scores_gemma":[0.083071776,0.000015649292,0.91440576,0.00042986326,0.0000534753,0.00019376441,0.000005270956,0.000006562188,0.0018178817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.000007762363,0.00012047684,0.00021838666,0.00007153842,0.00015055103],"domain_scores_gemma":[0.9994595,0.000076458084,0.000040767292,0.0002762007,0.000096766795,0.000050324918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006721862,0.000067921224,0.00007042721,0.000052653093,0.00012168569,0.00007063773,0.0004809355,0.00003388004,0.000048995502],"category_scores_gemma":[0.000022024315,0.000062013656,0.00003715047,0.00022186509,0.000015398617,0.000118013675,0.000058096513,0.00003303399,0.00006985672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003696175,0.0005058853,0.00036671778,0.000076935365,0.00003692882,0.000001190318,0.0012222257,0.0046345373,0.0027688649,0.14320365,0.41287485,0.43430454],"study_design_scores_gemma":[0.000119197204,0.000020133637,0.000026634803,0.0000013343139,0.0000012706294,0.0000013505546,0.0000023241496,0.8693571,0.005417972,0.0021846525,0.12277196,0.0000960625],"about_ca_topic_score_codex":0.0000043890414,"about_ca_topic_score_gemma":0.000002269985,"teacher_disagreement_score":0.86472255,"about_ca_system_score_codex":0.000011769219,"about_ca_system_score_gemma":0.0000069649345,"threshold_uncertainty_score":0.25288436},"labels":[],"label_agreement":null},{"id":"W4237951078","doi":"10.22215/etd/2011-09665","title":"Dynamically structured holographic memory : a hybrid of discrete and distributed representation","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"Carleton University","keywords":"Computer science; Representation (politics); Computer graphics (images); Political science","score_opus":0.010411737491950008,"score_gpt":0.2612829157506356,"score_spread":0.2508711782586856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237951078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912366,0.00016687092,0.9348056,0.000029593208,0.00022916346,0.0002849889,0.000026100515,0.00044696423,0.0048870724],"genre_scores_gemma":[0.86812466,0.00014082414,0.12962611,0.000023753426,0.000013952572,0.000016504458,0.0011532273,0.000015947355,0.0008850307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861765,0.000088868626,0.00040912683,0.0005069254,0.00021359733,0.00016384221],"domain_scores_gemma":[0.9987275,0.00005160889,0.00040503632,0.0005355553,0.00021340838,0.00006687125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012781731,0.00022385568,0.00034018044,0.0002727793,0.00007027698,0.00006496547,0.00059702346,0.00015728369,0.000010780026],"category_scores_gemma":[0.00006067488,0.00019260353,0.00009886332,0.00034827413,0.000056083558,0.00018436492,0.00010798955,0.00017994044,4.0428458e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012207926,0.0008691049,0.010038612,0.003066441,0.0018682786,0.00022754783,0.013013385,0.006588892,0.015456612,0.26432762,0.01623922,0.6670835],"study_design_scores_gemma":[0.0014549418,0.0007542983,0.13526294,0.00065939897,0.00027019848,0.000108075066,0.00046606758,0.6132233,0.09632307,0.14887637,0.00010141412,0.002499896],"about_ca_topic_score_codex":0.00012176395,"about_ca_topic_score_gemma":0.00004300247,"teacher_disagreement_score":0.80900097,"about_ca_system_score_codex":0.000009578089,"about_ca_system_score_gemma":0.000043645665,"threshold_uncertainty_score":0.7854144},"labels":[],"label_agreement":null},{"id":"W4238182192","doi":"10.1109/isca.2005.42","title":"RegionScout: Exploiting Coarse Grain Sharing in Snoop-Based Coherence","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache coherence; Cache; Bandwidth (computing); Computer network; Node (physics); Byte; Filter (signal processing); Distributed computing; CPU cache; Operating system; Cache algorithms","score_opus":0.03381813054647945,"score_gpt":0.2774446715249889,"score_spread":0.24362654097850947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238182192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068175117,0.000036076817,0.9786526,0.0015879477,0.000046671314,0.000117815835,1.7146064e-7,0.00092952215,0.011811698],"genre_scores_gemma":[0.53816754,0.000003085194,0.4604683,0.00090560305,0.00002319362,0.000014347421,0.000001022113,0.000005133709,0.0004117667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988561,0.000044216504,0.000272742,0.00038738945,0.00016766219,0.00027187838],"domain_scores_gemma":[0.99926823,0.000074640804,0.00007781068,0.00046324337,0.000052178297,0.00006387243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004436458,0.000116127005,0.00012690581,0.00019088999,0.00008994057,0.00014521432,0.00084724976,0.000049082697,0.000020193826],"category_scores_gemma":[0.00006417641,0.000115238014,0.000038160637,0.0004901966,0.000026107142,0.00039188852,0.00018782895,0.00013601394,0.000035081026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001597706,0.0004511851,0.0198888,0.00004259806,0.0000118344715,0.00007109375,0.0024036008,0.49984753,0.0009784795,0.23368737,0.0154022025,0.22719932],"study_design_scores_gemma":[0.0002464238,0.000019326648,0.0002105626,0.00006078922,5.675782e-7,0.000003756685,0.000016013899,0.9932775,0.0033345916,0.0013588617,0.0013043067,0.00016733211],"about_ca_topic_score_codex":0.00006955964,"about_ca_topic_score_gemma":0.000056645076,"teacher_disagreement_score":0.53135,"about_ca_system_score_codex":0.00005946127,"about_ca_system_score_gemma":0.000052278705,"threshold_uncertainty_score":0.46992698},"labels":[],"label_agreement":null},{"id":"W4238323557","doi":"10.1109/micro.2007.4408272","title":"Dynamic Warp Formation and Scheduling for Efficient GPU Control Flow","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; SIMD; Parallel computing; Control flow; Instruction set; Overhead (engineering); Scheduling (production processes); Graphics; Computer architecture; Operating system; Programming language","score_opus":0.005189897355246917,"score_gpt":0.2404863028349994,"score_spread":0.23529640547975247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238323557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81072927,0.00024726157,0.11390586,0.05563185,0.003904996,0.003507817,0.0015286993,0.00057276426,0.009971451],"genre_scores_gemma":[0.95124346,0.000058490023,0.045553766,0.001776964,0.0004007003,0.00007183938,0.000021862435,0.00008462091,0.00078827946],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99516225,0.000026842145,0.0013736187,0.0011472314,0.0015039606,0.0007860959],"domain_scores_gemma":[0.9942098,0.0004238433,0.001660044,0.00035587256,0.0031538326,0.00019658692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014415561,0.00073594274,0.0006361419,0.00056120264,0.00060054485,0.00044843843,0.005158017,0.0003712069,0.000006812856],"category_scores_gemma":[0.0004096148,0.000545858,0.00069460855,0.0007200749,0.0005293719,0.00062056875,0.001277037,0.0010161484,0.0000037210943],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002432878,0.0010255105,0.0013502382,0.0004267292,0.00073547335,0.000001466296,0.011434818,0.1154238,0.8168414,0.032626428,0.005479335,0.012221914],"study_design_scores_gemma":[0.0062233163,0.0017719619,0.0042324793,0.002305834,0.00023376285,0.0006435741,0.0020002015,0.21260409,0.73668486,0.009353297,0.021950811,0.0019958047],"about_ca_topic_score_codex":0.000056513833,"about_ca_topic_score_gemma":0.000013772402,"teacher_disagreement_score":0.14051418,"about_ca_system_score_codex":0.00040524395,"about_ca_system_score_gemma":0.00006221248,"threshold_uncertainty_score":0.9996993},"labels":[],"label_agreement":null},{"id":"W4238371512","doi":"10.1145/3376930.3376989","title":"Demystifying ComplexWorkload-DRAM Interactions","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dram; Computer science; Dynamic random-access memory; Universal memory; Embedded system; Workload; Throughput; Computer architecture; Parallel computing; Memory management; Semiconductor memory; Computer hardware; Operating system; Interleaved memory","score_opus":0.09426226989097763,"score_gpt":0.371122829678936,"score_spread":0.27686055978795837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238371512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011304742,0.055379458,0.8987237,0.0046864846,0.0016892614,0.0026512148,0.0000016645199,0.0011206962,0.024442775],"genre_scores_gemma":[0.630849,0.048014868,0.31682688,0.0033505417,0.00009525562,0.00018245819,0.000041814877,0.000024662288,0.00061450375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976559,0.00023056302,0.0005712117,0.00044421354,0.00082965964,0.00026840947],"domain_scores_gemma":[0.99716866,0.00038611915,0.000357717,0.0013364179,0.0006719462,0.0000791383],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027670902,0.00018538734,0.00032134008,0.00043967957,0.00019423541,0.00014610137,0.0014514725,0.00004889459,0.0003594935],"category_scores_gemma":[0.0012807507,0.0001727429,0.00010374947,0.0031447585,0.000016351862,0.0009877264,0.00041852257,0.00024367087,0.0010210765],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018240905,0.00007501493,0.0046106204,0.0007032261,0.00002384795,4.0711004e-7,0.000069225774,0.008291434,0.000027535752,0.0027175993,0.010901198,0.97257805],"study_design_scores_gemma":[0.00024127749,0.000084002015,0.0026982955,0.0017020425,0.00003559187,0.000013768653,0.0000022424558,0.9510078,0.0001458859,0.0005903746,0.043195393,0.00028333967],"about_ca_topic_score_codex":0.0000030353328,"about_ca_topic_score_gemma":3.49313e-7,"teacher_disagreement_score":0.97229475,"about_ca_system_score_codex":0.00016639505,"about_ca_system_score_gemma":0.00014920847,"threshold_uncertainty_score":0.99975675},"labels":[],"label_agreement":null},{"id":"W4238446011","doi":"10.1145/1837854.1736011","title":"AASH","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypervisor; Computer science; Multi-core processor; Operating system; Virtual machine; Asymmetry; Thread (computing); Virtualization; Embedded system; Parallel computing; Cloud computing","score_opus":0.01563478540086508,"score_gpt":0.2642665672501201,"score_spread":0.24863178184925502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238446011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11671321,0.00006219847,0.8400197,0.0033322491,0.0013968848,0.00014708303,0.0000020039809,0.0022774928,0.03604919],"genre_scores_gemma":[0.6163021,0.0000026925136,0.3830281,0.0003602261,0.0000782407,0.0000025158581,0.0000017068493,0.000003869107,0.00022059199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993227,0.000022748854,0.00011792446,0.00022571701,0.00014020977,0.00017069023],"domain_scores_gemma":[0.9988393,0.00017797093,0.00006485165,0.00080519286,0.000048278027,0.000064406035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019571683,0.000083440485,0.00008284167,0.00006787694,0.00010543839,0.00017768516,0.0016403074,0.000058924765,0.000032432847],"category_scores_gemma":[0.00022610623,0.00007392539,0.000027715801,0.00017110564,0.000029046321,0.00028529856,0.0003290757,0.00017318083,0.00013294799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017077386,0.00037972626,0.028502021,0.00006542235,0.00007376798,0.00010802647,0.0034921686,0.0049102027,0.02036335,0.53973967,0.115474455,0.28687415],"study_design_scores_gemma":[0.0009265427,0.00031464422,0.031548295,0.000054018652,0.00002327488,0.00009411794,0.000036233858,0.59109735,0.060743377,0.065459155,0.24813548,0.0015674755],"about_ca_topic_score_codex":0.000021050131,"about_ca_topic_score_gemma":0.000017001557,"teacher_disagreement_score":0.5861872,"about_ca_system_score_codex":0.0000033587423,"about_ca_system_score_gemma":0.000024499403,"threshold_uncertainty_score":0.30481264},"labels":[],"label_agreement":null},{"id":"W4238588277","doi":"10.1145/1508284.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Multi-core processor; Parallel computing; Cache algorithms; Overhead (engineering); Cache invalidation; Smart Cache; Process (computing); Software; Code (set theory); Operating system; CPU cache; Programming language","score_opus":0.020706827356451817,"score_gpt":0.2700367176350224,"score_spread":0.24932989027857058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238588277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008295741,0.00027992862,0.95709765,0.0054904427,0.00022521843,0.00010255573,7.433196e-7,0.0015990675,0.026908658],"genre_scores_gemma":[0.6723591,0.000012333805,0.3260057,0.0013696135,0.000055072793,0.0000010652835,0.0000019532424,0.0000024641934,0.0001926696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992597,0.000037316127,0.00013423279,0.00023188606,0.00015097583,0.00018585597],"domain_scores_gemma":[0.99905044,0.000115140516,0.00006780104,0.00066759274,0.00004026228,0.000058781403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016722146,0.000091474314,0.00009953049,0.00007922452,0.00009917451,0.00015642104,0.001397215,0.00004293235,0.000012154402],"category_scores_gemma":[0.00012301137,0.000081463295,0.000032592994,0.00022486055,0.000013853447,0.0003128703,0.00012411388,0.00007729513,0.000075807475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021845743,0.00032334522,0.002022902,0.000022245142,0.000037438236,0.00009586505,0.0024032446,0.014896016,0.001701674,0.24140443,0.10517745,0.6318936],"study_design_scores_gemma":[0.0013239073,0.0013958622,0.039145928,0.00014100385,0.000027648632,0.00007402156,0.00004915911,0.66756725,0.031048423,0.1625974,0.09483474,0.0017946581],"about_ca_topic_score_codex":0.000006306586,"about_ca_topic_score_gemma":7.5444933e-7,"teacher_disagreement_score":0.6640634,"about_ca_system_score_codex":0.0000089489995,"about_ca_system_score_gemma":0.000019102978,"threshold_uncertainty_score":0.33219767},"labels":[],"label_agreement":null},{"id":"W4239287583","doi":"10.1002/cpe.1349","title":"Optimizing process allocation of parallel programs for heterogeneous clusters","year":2008,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Japan Society for the Promotion of Science","keywords":"Benchmark (surveying); Fast Fourier transform; Computer science; Process (computing); Predictability; Finite element method; Parallel computing; Computational fluid dynamics; Listing (finance); Algorithm; Computational science; Mathematical optimization; Mathematics; Statistics","score_opus":0.04248969868934799,"score_gpt":0.33678858178336796,"score_spread":0.29429888309401997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239287583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04820951,0.0009797841,0.9498263,0.0002815017,0.000089638124,0.00031757887,5.2326527e-7,0.0001265876,0.00016859244],"genre_scores_gemma":[0.7604092,0.0003415859,0.23900071,0.00014391787,0.000012106045,0.00007571712,0.000005803627,0.0000040312275,0.0000069467587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990255,0.000056534038,0.0002866129,0.00033184167,0.00014870925,0.00015077704],"domain_scores_gemma":[0.999015,0.00021354355,0.00026360506,0.00012285278,0.00031860502,0.000066418324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017262636,0.000117540505,0.00014927029,0.00006406879,0.00026950962,0.00007598227,0.00018987195,0.000047699268,4.0515414e-7],"category_scores_gemma":[0.00012752255,0.00011684928,0.000025672403,0.00019134485,0.00013722539,0.00097341323,0.00006542442,0.00006027689,3.3485196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019188962,0.0005298302,0.00092475326,0.00032168307,0.00006555093,0.000015199792,0.13824184,0.0839323,0.0002377926,0.016272541,0.00024274542,0.75902385],"study_design_scores_gemma":[0.0005290185,0.00033217785,0.000065805,0.000057206104,0.000009939378,0.00018947184,0.000862126,0.99533296,0.00095988734,0.000795921,0.0006493446,0.00021612154],"about_ca_topic_score_codex":0.0000078914645,"about_ca_topic_score_gemma":2.6397763e-7,"teacher_disagreement_score":0.9114007,"about_ca_system_score_codex":0.00000734614,"about_ca_system_score_gemma":0.000057959074,"threshold_uncertainty_score":0.47649753},"labels":[],"label_agreement":null},{"id":"W4239773716","doi":"10.1109/micro.1997.645808","title":"Initial results on the performance and cost of vector microprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register file; Parallel computing; Exploit; Instruction-level parallelism; Datapath; Compiler; Software pipelining; Parallelism (grammar); Task parallelism; Out-of-order execution; Scheduling (production processes); Instruction set; Operating system","score_opus":0.03236471539604737,"score_gpt":0.25405895648240046,"score_spread":0.22169424108635308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239773716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31875744,0.00012790329,0.5055359,0.0074633514,0.00018278287,0.0004155168,0.0000048890042,0.0006351674,0.16687706],"genre_scores_gemma":[0.98282176,0.000058499318,0.016169144,0.00036974615,0.000013073145,0.0000027963383,2.3963997e-7,0.0000019573574,0.00056277995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957246,0.000021633636,0.00011581793,0.00012202369,0.00008955063,0.00007853869],"domain_scores_gemma":[0.9996,0.00008980329,0.000051663596,0.00019613249,0.000044012664,0.000018370087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014280737,0.000049400787,0.00005426284,0.000033192693,0.00007408347,0.000034879915,0.00028504958,0.00002006749,0.000010027515],"category_scores_gemma":[0.000037071222,0.000030648847,0.00001061999,0.00014723766,0.00004019549,0.00007801771,0.00006715682,0.000053894844,0.00000955321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016731443,0.00076928077,0.0014020338,0.00016361693,0.00007084889,0.000013061677,0.013598367,0.020492481,0.0024083478,0.2254258,0.2996661,0.43582276],"study_design_scores_gemma":[0.0002532709,0.0001843947,0.00080331665,0.000033017448,0.0000010398139,0.000006182553,0.000007450761,0.94109553,0.05391455,0.00009490387,0.0035112123,0.00009515319],"about_ca_topic_score_codex":0.0000051437096,"about_ca_topic_score_gemma":4.534819e-7,"teacher_disagreement_score":0.92060304,"about_ca_system_score_codex":0.000004132241,"about_ca_system_score_gemma":0.0000046606524,"threshold_uncertainty_score":0.12498238},"labels":[],"label_agreement":null},{"id":"W4239826705","doi":"10.1109/micro.2016.7783714","title":"MIMD synchronization on SIMT architectures","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; MIMD; Compiler; Parallel computing; Control flow; Synchronization (alternating current); Programming language","score_opus":0.010210689863320044,"score_gpt":0.24121184425363035,"score_spread":0.2310011543903103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239826705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011969757,0.00001046475,0.9776157,0.0026408902,0.000078729725,0.000056073794,2.6377458e-7,0.00093707134,0.017463831],"genre_scores_gemma":[0.8414708,0.000008571824,0.15621644,0.0008858126,0.000038689996,0.000003589386,3.4246062e-7,0.0000045341635,0.0013712636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939924,0.00003688842,0.000094904186,0.00021421125,0.0001269496,0.00012782533],"domain_scores_gemma":[0.9994722,0.000093001436,0.000033254008,0.00032368948,0.000038771024,0.000039100796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072578194,0.000071630326,0.000057216108,0.000086778084,0.000060320526,0.000048986123,0.0003879486,0.000030236757,0.000032557953],"category_scores_gemma":[0.00005222414,0.00004108643,0.000023712631,0.00015151755,0.000017250524,0.00006579391,0.000078443765,0.000028882057,0.000094929936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056241606,0.000062451145,0.0007019282,0.000004246534,0.000008867427,0.0000040106684,0.00011722002,0.010528104,0.00058293587,0.22372659,0.017667849,0.7465902],"study_design_scores_gemma":[0.0012585495,0.0008231265,0.0038786698,0.00023403307,0.000005231787,0.000031351592,0.0000053789868,0.7451139,0.11899232,0.09653979,0.032062612,0.0010550242],"about_ca_topic_score_codex":0.0000045580746,"about_ca_topic_score_gemma":0.0000015938372,"teacher_disagreement_score":0.8402738,"about_ca_system_score_codex":0.000022675957,"about_ca_system_score_gemma":0.000018969697,"threshold_uncertainty_score":0.1675456},"labels":[],"label_agreement":null},{"id":"W4240107341","doi":"10.1109/dac.2002.1012645","title":"Retargetable binary utilities","year":2002,"lang":"en","type":"article","venue":"Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software; Software engineering; Downstream (manufacturing); Set (abstract data type); Retargeting; Architecture; Interface (matter); Programming language; Operating system; Engineering","score_opus":0.0625527907229308,"score_gpt":0.2449277789363456,"score_spread":0.1823749882134148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240107341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036014768,0.00017073717,0.9537406,0.0010411934,0.0006319701,0.0006847566,0.0000044066455,0.0041006394,0.03602425],"genre_scores_gemma":[0.32584828,0.00039069072,0.6591696,0.0005814088,0.00019370721,0.00017620473,0.000006746544,0.000045819495,0.013587511],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669045,0.00009650726,0.0007637526,0.0009490003,0.0007163805,0.0007839256],"domain_scores_gemma":[0.9971432,0.00016004479,0.00049308623,0.00051063974,0.0014363446,0.0002566638],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008653999,0.0004931201,0.0004773292,0.0004927784,0.0005149997,0.0010282452,0.001610068,0.00026798793,0.00080641446],"category_scores_gemma":[0.00036439375,0.0005058557,0.00012197114,0.0010550824,0.00014649275,0.0025001615,0.00019212287,0.00029916337,0.0015900356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039020288,0.0007545515,0.0006639446,0.00051382574,0.00014366419,0.000030060186,0.010168964,0.0059761223,0.04604244,0.07678824,0.82331145,0.03556774],"study_design_scores_gemma":[0.0003272932,0.0002036695,0.00015488287,0.00012712184,0.000014439114,0.000033337183,0.000050571027,0.9790401,0.01224635,0.0023932552,0.0048107444,0.00059827487],"about_ca_topic_score_codex":0.000018846253,"about_ca_topic_score_gemma":3.280061e-7,"teacher_disagreement_score":0.97306395,"about_ca_system_score_codex":0.00016055013,"about_ca_system_score_gemma":0.00013888386,"threshold_uncertainty_score":0.9997393},"labels":[],"label_agreement":null},{"id":"W4240218824","doi":"10.1145/2661088.2661090","title":"Using JavaScript and WebCL for numerical computations","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Computation; Programming language; Web application; Code (set theory); Variety (cybernetics); Rich Internet application; Web browser; World Wide Web; The Internet; Artificial intelligence","score_opus":0.043306371155396116,"score_gpt":0.30582366721271376,"score_spread":0.26251729605731766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240218824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004411353,0.000019161442,0.9963178,0.0004103328,0.00007734037,0.000087084496,2.5959852e-7,0.00038081646,0.00226607],"genre_scores_gemma":[0.26906887,0.0000011089968,0.73038155,0.0004297504,0.000023180932,0.0000030220274,7.2896796e-7,0.0000031086572,0.00008870112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995153,0.000029478826,0.000104868595,0.00017894554,0.000059383827,0.00011201012],"domain_scores_gemma":[0.99961716,0.00010184619,0.000032289947,0.00014112721,0.000060372542,0.0000472148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015758924,0.000057097954,0.000081485596,0.00005069023,0.0001423392,0.000107911306,0.00017796605,0.000024491932,0.0000016186266],"category_scores_gemma":[0.0000383027,0.00005181688,0.00002300846,0.00011488799,0.000017029186,0.00012885242,0.00008171654,0.000027581305,0.0000020607247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026997006,0.00005765827,0.00056248874,0.000019832187,0.000013756174,3.3583467e-7,0.0003064185,0.06753843,0.00022015086,0.8554023,0.008650763,0.067225195],"study_design_scores_gemma":[0.00012091583,0.000034839613,0.00013577048,0.000004046503,0.000001850322,0.0000061578467,0.000002103847,0.9837146,0.00023712119,0.010203594,0.005464336,0.00007467231],"about_ca_topic_score_codex":0.000011018105,"about_ca_topic_score_gemma":3.003976e-7,"teacher_disagreement_score":0.91617614,"about_ca_system_score_codex":0.000007821791,"about_ca_system_score_gemma":0.000013544613,"threshold_uncertainty_score":0.2113031},"labels":[],"label_agreement":null},{"id":"W4240240657","doi":"10.1109/pact.1996.552551","title":"Compiling C for the EARTH multithreaded architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Compiler; Multithreading; Locality; Parallel computing; Programmer; Instruction-level parallelism; Programming language; Simple (philosophy); Parallelism (grammar); Benchmark (surveying); Computer architecture; Operating system; Thread (computing)","score_opus":0.03955621672406429,"score_gpt":0.257743322392589,"score_spread":0.21818710566852473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240240657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009999116,0.00016299526,0.9922647,0.0027731664,0.000092706934,0.00019280522,4.2676518e-7,0.0005866679,0.0038265523],"genre_scores_gemma":[0.17614946,0.000016974333,0.82065296,0.0009623102,0.000054863656,0.000017746817,4.949752e-7,0.000004735113,0.0021404773],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949104,0.000019033105,0.00009656974,0.00016238239,0.00008611489,0.000144874],"domain_scores_gemma":[0.9993192,0.00025920084,0.000030461246,0.0003210776,0.000043073058,0.000027019421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012370234,0.00006722163,0.00006412942,0.000033692522,0.00020910575,0.0001035118,0.00056818046,0.000024708228,0.000020136897],"category_scores_gemma":[0.000030109006,0.000040546864,0.000048733826,0.00013774273,0.000023012426,0.00006112869,0.000079397556,0.00006967145,0.000015999058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056418353,0.00011683457,0.0001446613,0.000017097926,0.00004263606,0.0000020999964,0.0021413201,0.2412484,0.00033588993,0.16887093,0.0365938,0.55048066],"study_design_scores_gemma":[0.00012958028,0.000024082745,0.000054870765,0.000003796458,0.0000013699248,0.0000043924842,0.0000041074845,0.9743973,0.0015962269,0.001580484,0.022136118,0.0000676848],"about_ca_topic_score_codex":0.000005548665,"about_ca_topic_score_gemma":0.0000032440632,"teacher_disagreement_score":0.7331489,"about_ca_system_score_codex":0.0000034574741,"about_ca_system_score_gemma":0.0000039562374,"threshold_uncertainty_score":0.16534531},"labels":[],"label_agreement":null},{"id":"W4240262711","doi":"10.1145/1736020.1736036","title":"Addressing shared resource contention in multicore processors via scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Workload; Multi-core processor; Gang scheduling; Thread (computing); Shared memory; Cache; Processor scheduling; Fair-share scheduling; Dynamic priority scheduling; Parallel computing; Quality of service; Two-level scheduling; Operating system; Resource (disambiguation); Computer network","score_opus":0.04936813286589711,"score_gpt":0.3051726721502294,"score_spread":0.25580453928433233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240262711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063193776,0.000019887975,0.932258,0.00034329723,0.000088238405,0.00012205652,1.596364e-7,0.00066482165,0.0033097237],"genre_scores_gemma":[0.59219503,6.939415e-7,0.40749654,0.00013356982,0.00001808175,0.000006732712,0.0000021060605,0.000004533593,0.00014268782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910444,0.000033547807,0.00022063241,0.00029564003,0.00014851955,0.00019724572],"domain_scores_gemma":[0.9994478,0.00004593838,0.000083739964,0.00027977416,0.00008928293,0.000053435164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034033548,0.00009380038,0.00010654891,0.0001606901,0.000099655175,0.00019992489,0.0005106737,0.00008280004,0.000014428048],"category_scores_gemma":[0.00013073123,0.000086760934,0.000029813711,0.00035022295,0.00002527763,0.00040067112,0.0001434037,0.00025240815,0.000010653534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008361356,0.001119101,0.056315184,0.00027500748,0.000044092325,0.00010026581,0.010064395,0.13067882,0.15365249,0.068344735,0.002905386,0.5764169],"study_design_scores_gemma":[0.00025148733,0.000012674465,0.0020521972,0.0000526788,7.8036305e-7,0.000006857177,0.00001958722,0.9897052,0.0066697146,0.00079297763,0.00030594127,0.00012989498],"about_ca_topic_score_codex":0.000037923874,"about_ca_topic_score_gemma":0.000036375866,"teacher_disagreement_score":0.8590264,"about_ca_system_score_codex":0.000013659323,"about_ca_system_score_gemma":0.000026502987,"threshold_uncertainty_score":0.35380083},"labels":[],"label_agreement":null},{"id":"W4240517907","doi":"10.1145/2499368.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Overlay","score_opus":0.015768171220470858,"score_gpt":0.2423602508148654,"score_spread":0.22659207959439454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240517907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077696994,0.00021473004,0.8654793,0.0038004601,0.00044947083,0.000501128,7.5701485e-7,0.002567909,0.049289264],"genre_scores_gemma":[0.6282851,0.0000140009115,0.37070277,0.00042929949,0.000026154758,0.000017050525,0.0000018651443,0.000004264725,0.00051951455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924296,0.000031971165,0.00013573235,0.00024129274,0.00015373477,0.00019429889],"domain_scores_gemma":[0.9991126,0.00008531836,0.000057911966,0.000649601,0.000036435653,0.000058114674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010512724,0.00009271738,0.00008464562,0.00008833365,0.000089545865,0.00024653674,0.0014014738,0.00003190642,0.00005227649],"category_scores_gemma":[0.000022801674,0.000080950755,0.000028186196,0.00019788057,0.000017589191,0.00037538027,0.00032986884,0.000057948113,0.0005088128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005524331,0.00022592163,0.00091222074,0.00009567916,0.000097692675,0.00005039312,0.0015344982,0.0702313,0.00007956307,0.07050299,0.13593116,0.72033304],"study_design_scores_gemma":[0.00048351416,0.00021127399,0.0124081345,0.00006571961,0.00001658957,0.000012954932,0.00008749672,0.94678974,0.0008548484,0.011489109,0.02690705,0.0006735963],"about_ca_topic_score_codex":0.000015709478,"about_ca_topic_score_gemma":0.0000012120179,"teacher_disagreement_score":0.8765584,"about_ca_system_score_codex":0.0000104499095,"about_ca_system_score_gemma":0.0000063036227,"threshold_uncertainty_score":0.65399283},"labels":[],"label_agreement":null},{"id":"W4240568361","doi":"10.1109/pact.1997.644000","title":"Heap analysis and optimizations for threaded programs","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Compiler; Heap (data structure); Parallel computing; Optimizing compiler; Pointer (user interface); Pointer analysis; Program optimization; Code generation; Compile time; Dead code elimination; Loop optimization; Programming language; Static analysis; Operating system; Object code; Computer hardware","score_opus":0.03877620316177918,"score_gpt":0.2665119513413636,"score_spread":0.2277357481795844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240568361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013885782,0.00008058435,0.994677,0.0009740213,0.000018847373,0.00018420798,5.04361e-7,0.0006457791,0.0032802045],"genre_scores_gemma":[0.13339846,0.000038269038,0.86512876,0.00019340367,0.00001051083,0.000035442037,0.000005354894,0.0000034044585,0.0011863791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994244,0.00001571602,0.00012448453,0.00022975661,0.00007053634,0.00013512559],"domain_scores_gemma":[0.99954706,0.000042244777,0.000037231333,0.00024353112,0.000075885786,0.00005401428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009226955,0.00006884937,0.00011171266,0.00015683356,0.00013441191,0.00017134071,0.00022906155,0.00003293991,0.000017138758],"category_scores_gemma":[0.000015176943,0.00005965764,0.000058675847,0.0008085376,0.000020184754,0.00016222532,0.00006382549,0.000025980728,0.0000026242928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050433523,0.0006754082,0.009761943,0.00003874235,0.00075607904,0.0000028871827,0.0026124273,0.11287291,0.000045935878,0.4039513,0.022429531,0.4468478],"study_design_scores_gemma":[0.00010131582,0.00005179933,0.00010814746,0.0000017522119,0.000026888658,0.0000014445914,0.000004359185,0.9974796,0.00015507602,0.0012326845,0.00075022475,0.00008669392],"about_ca_topic_score_codex":0.000007884886,"about_ca_topic_score_gemma":0.000006564534,"teacher_disagreement_score":0.8846067,"about_ca_system_score_codex":0.0000064003907,"about_ca_system_score_gemma":0.0000036580923,"threshold_uncertainty_score":0.24327679},"labels":[],"label_agreement":null},{"id":"W4240683705","doi":"10.1109/micro.1996.566467","title":"Software pipelining loops with conditional branches","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software pipelining; Computer science; Very long instruction word; Parallel computing; Instruction scheduling; Compiler; Software; Instruction-level parallelism; Scheduling (production processes); Instruction set; Loop optimization; Schedule; Optimizing compiler; Dynamic priority scheduling; Operating system; Parallelism (grammar); Two-level scheduling","score_opus":0.02092947466766095,"score_gpt":0.2202212724747962,"score_spread":0.19929179780713524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240683705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002799721,0.000060112292,0.9865595,0.0005744022,0.000030202435,0.000042795888,6.0265955e-7,0.0011497969,0.011302612],"genre_scores_gemma":[0.361032,0.0000057220586,0.6366274,0.0007210693,0.000025685022,0.000004291771,0.0000025277172,0.0000041464946,0.0015771467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993628,0.00001928753,0.00010543201,0.00021023523,0.00016278675,0.00013943847],"domain_scores_gemma":[0.99955344,0.00006728005,0.000040897725,0.00021708573,0.00007309074,0.00004822186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000720949,0.000078935984,0.000077219716,0.00005854399,0.00011435889,0.00010088399,0.0003326464,0.00002918663,0.00014221786],"category_scores_gemma":[0.000021004826,0.00006197292,0.000021399635,0.00020507775,0.000031349708,0.00026377055,0.0000624129,0.000067153705,0.000093445466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011869969,0.00044888182,0.014321895,0.00004115664,0.000088223554,0.000094671785,0.0022033995,0.07633633,0.00006605797,0.433296,0.20321761,0.2698739],"study_design_scores_gemma":[0.0004300927,0.00013665442,0.0010855828,0.000032099015,0.0000031933282,0.00008203528,0.000010042854,0.97489977,0.0014996453,0.010855661,0.010625855,0.0003393873],"about_ca_topic_score_codex":0.0000030067665,"about_ca_topic_score_gemma":8.489478e-7,"teacher_disagreement_score":0.89856344,"about_ca_system_score_codex":0.000009513448,"about_ca_system_score_gemma":0.0000113615515,"threshold_uncertainty_score":0.25271824},"labels":[],"label_agreement":null},{"id":"W4240687373","doi":"10.1145/1108792.1108809","title":"SableSpMT","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multithreading; Computer science; Java; Speculative multithreading; Multiprocessing; Operating system; Speculative execution; Context (archaeology); Instruction set; Set (abstract data type); Embedded system; Programming language; Parallel computing; Thread (computing)","score_opus":0.012925748024684325,"score_gpt":0.2508852917957205,"score_spread":0.23795954377103617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240687373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014352704,0.00002584779,0.8674766,0.0017642931,0.000025414545,0.000018654217,2.4280032e-8,0.0008488447,0.12969683],"genre_scores_gemma":[0.20816977,0.0000059350923,0.78704125,0.0011380636,0.000034757577,0.0000012799808,1.6834774e-7,0.0000014762381,0.0036072987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996713,0.000009983205,0.00006398508,0.00010544387,0.00006280417,0.0000864785],"domain_scores_gemma":[0.9997172,0.000012709729,0.00001353166,0.00020634984,0.000022326165,0.000027884276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008013915,0.00003418184,0.000034133704,0.000033821765,0.000039057413,0.000056544886,0.0003468672,0.000015560508,0.000027583837],"category_scores_gemma":[0.000006226583,0.000029053459,0.000015194161,0.00011989124,0.00000572406,0.00019249105,0.000079373196,0.000025873656,0.00013851213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4204978e-7,0.0000372483,0.00013383363,0.0000011044325,0.0000028432717,0.0000010163726,0.00011501433,0.01034738,0.00008993696,0.6338663,0.09671064,0.25869423],"study_design_scores_gemma":[0.000064441556,0.000012757257,0.00011625713,0.0000019228544,2.8394095e-7,0.0000055422015,8.840808e-7,0.81373763,0.006787854,0.002663758,0.17652589,0.00008276038],"about_ca_topic_score_codex":0.0000024720841,"about_ca_topic_score_gemma":9.4332836e-7,"teacher_disagreement_score":0.80339026,"about_ca_system_score_codex":0.000009163298,"about_ca_system_score_gemma":0.0000108757895,"threshold_uncertainty_score":0.17803393},"labels":[],"label_agreement":null},{"id":"W4241101356","doi":"10.1007/978-0-387-39940-9_3920","title":"User-Level Parallelism","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parallelism (grammar); Computer science; Task parallelism; Parallel computing","score_opus":0.027173943766851907,"score_gpt":0.252788364607696,"score_spread":0.2256144208408441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241101356","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010517749,0.0018575633,0.44507432,0.000063262174,0.0007628688,0.00037279952,0.00021992886,0.0004317901,0.5512164],"genre_scores_gemma":[0.0002535369,0.0053735697,0.19167857,0.00013002544,0.00066700205,0.000023227112,0.0005069043,0.00006923451,0.8012979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997082,0.000071703966,0.0009840684,0.00079854095,0.00071474264,0.00034896296],"domain_scores_gemma":[0.9965691,0.00013869305,0.0008208869,0.0020319696,0.00026238576,0.00017698911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005189905,0.0005092107,0.00079112046,0.00038089027,0.00009645714,0.000099742065,0.0019017693,0.00035003488,0.000031275908],"category_scores_gemma":[0.000053879226,0.0004972924,0.00019599903,0.00010615745,0.00006346874,0.00042235432,0.000500807,0.00041840947,0.00014497334],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060958123,0.000050124247,0.000008426164,0.00022620028,0.000074425196,0.00008338905,0.00013430977,0.0008889441,0.000007710178,0.7762776,0.20414624,0.01809656],"study_design_scores_gemma":[0.00023424141,0.000096120115,0.000017261485,0.00082260475,0.000028568134,0.000040798703,0.0000026087819,0.0066934614,0.000018079976,0.002416989,0.9889862,0.00064308994],"about_ca_topic_score_codex":0.000082203514,"about_ca_topic_score_gemma":0.00000488933,"teacher_disagreement_score":0.7848399,"about_ca_system_score_codex":0.000060485887,"about_ca_system_score_gemma":0.00023470781,"threshold_uncertainty_score":0.9997479},"labels":[],"label_agreement":null},{"id":"W4241113734","doi":"10.1145/2528521.1508259","title":"RapidMRC","year":2009,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Henan Institute of Science and Technology","keywords":"Computer science; Cache; Multi-core processor; Cache algorithms; Parallel computing; Cache invalidation; Overhead (engineering); Smart Cache; Software; Process (computing); Code (set theory); Cache pollution; CPU cache; Operating system; Programming language","score_opus":0.01310465275337563,"score_gpt":0.258165818348991,"score_spread":0.24506116559561536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241113734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001423349,0.00014032592,0.97982806,0.012376143,0.00033354913,0.00026829858,8.052764e-7,0.0018663845,0.0037630866],"genre_scores_gemma":[0.14389975,0.000024259538,0.84752196,0.007925233,0.0004697594,0.000007432896,0.0000060603334,0.0000138788255,0.00013165352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997617,0.00020508071,0.00037645284,0.0007560964,0.00045253235,0.0005928417],"domain_scores_gemma":[0.99733156,0.0002740558,0.00011653064,0.0019367018,0.00010893586,0.00023223442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003059415,0.00032245062,0.00031864012,0.00033845069,0.00023027821,0.0003195302,0.0035629505,0.00011154543,0.000012257015],"category_scores_gemma":[0.000089248046,0.00028183335,0.00017099937,0.00068108266,0.000052140735,0.00024672833,0.000817137,0.0004580539,0.000056910416],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007847561,0.00008654655,0.00009115757,0.000005539898,0.00001547543,0.000032169995,0.0008372315,0.015684703,0.00033767638,0.010433549,0.022356834,0.95011127],"study_design_scores_gemma":[0.001708537,0.0020469401,0.008247334,0.00014170782,0.000015724312,0.00043812004,0.000005334184,0.44863662,0.0058830003,0.35980082,0.17146024,0.0016156231],"about_ca_topic_score_codex":0.00001282495,"about_ca_topic_score_gemma":0.0000029344085,"teacher_disagreement_score":0.9484956,"about_ca_system_score_codex":0.00003691144,"about_ca_system_score_gemma":0.000079753234,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W4241352414","doi":"10.1145/1926385.1926389","title":"Points-to analysis with efficient strong updates","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Singleton; Computer science; Flow (mathematics); Set (abstract data type); Sensitivity (control systems); Compiler; Program analysis; Key (lock); Quadratic equation; Abstract interpretation; Optimizing compiler; Algorithm; Theoretical computer science; Programming language; Mathematics; Operating system","score_opus":0.019642341443622452,"score_gpt":0.23963177070726788,"score_spread":0.21998942926364543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241352414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008187264,0.000004786959,0.9636369,0.00016903394,0.000018283148,0.00006764394,2.753065e-7,0.0005799823,0.027335852],"genre_scores_gemma":[0.50825065,3.16783e-7,0.4914003,0.00018144505,0.0000031116886,0.0000030263864,5.8828647e-7,0.0000021026665,0.00015843842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926025,0.000026250826,0.00011538293,0.00027678505,0.00015064485,0.00017067687],"domain_scores_gemma":[0.9993363,0.000014394887,0.00003746433,0.0004389011,0.00008313603,0.00008981901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016452836,0.000083567655,0.00011444131,0.0002624171,0.00006505587,0.000065166336,0.00054943253,0.000018626166,0.00007325069],"category_scores_gemma":[0.000006610508,0.000059721006,0.00004228007,0.0012191129,0.000014261997,0.000075367876,0.0001551724,0.00003847328,0.00005549296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036843037,0.00046569644,0.034520958,0.0000072488715,0.0006468494,0.000028172775,0.004324237,0.4714747,0.00003710418,0.47027045,0.0054182387,0.01276951],"study_design_scores_gemma":[0.0000970049,0.00013862494,0.009592769,0.000005162683,0.00003700163,0.0000016830966,0.000027807637,0.9840625,0.0053262156,0.0002624851,0.00024402811,0.0002047123],"about_ca_topic_score_codex":0.00006805817,"about_ca_topic_score_gemma":0.000015607808,"teacher_disagreement_score":0.5125878,"about_ca_system_score_codex":0.000013310822,"about_ca_system_score_gemma":0.000016985812,"threshold_uncertainty_score":0.24353519},"labels":[],"label_agreement":null},{"id":"W4241403285","doi":"10.1145/2508148.2485969","title":"Protozoa","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Division of Computing and Communication Foundations; CMC Microsystems","keywords":"Computer science; Granularity; Cache coherence; Cache; Scalability; Bus sniffing; MESI protocol; Locality of reference; Metadata; Distributed computing; Parallel computing; CPU cache; Cache algorithms; Database; Operating system","score_opus":0.012415646007593237,"score_gpt":0.24592685927918959,"score_spread":0.23351121327159635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241403285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029787754,0.000050813218,0.9837879,0.0074963043,0.00029634623,0.001165236,7.6336875e-7,0.00173294,0.0024909403],"genre_scores_gemma":[0.06731887,0.000008624961,0.92812675,0.003638382,0.00039526357,0.00024942978,0.000006617626,0.000025408397,0.00023066316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976156,0.00021667004,0.00038242133,0.0007379846,0.00044100266,0.0006063738],"domain_scores_gemma":[0.99720746,0.0003030548,0.000119783545,0.0019365865,0.00018323494,0.00024990644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022075888,0.00031589041,0.0002898926,0.00028865488,0.00021712009,0.0005241467,0.003587148,0.00010774512,0.000055890778],"category_scores_gemma":[0.00009456334,0.0002619419,0.00014049871,0.00057553174,0.00007682749,0.00039751644,0.0018918699,0.00044588486,0.0002906542],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034036107,0.00009666573,0.0006911887,0.000025804806,0.000032363823,0.0000143929665,0.0011640007,0.010656943,0.00041821983,0.004918526,0.057943586,0.9240349],"study_design_scores_gemma":[0.001171731,0.00084499473,0.007888907,0.00013212896,0.000009014719,0.00025659992,0.000007786871,0.65212446,0.004993874,0.20937173,0.12183973,0.0013590432],"about_ca_topic_score_codex":0.00015212857,"about_ca_topic_score_gemma":0.0000071578024,"teacher_disagreement_score":0.92267585,"about_ca_system_score_codex":0.000036219095,"about_ca_system_score_gemma":0.00008202869,"threshold_uncertainty_score":0.99998325},"labels":[],"label_agreement":null},{"id":"W4241407302","doi":"10.1145/781028.781030","title":"A framework for modeling and optimization of prescient instruction prefetch","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instruction prefetch; Computer science; Parallel computing; Spawn (biology); Thread (computing); Multithreading; Cache; Instruction set; Heuristics; Distributed computing; Operating system","score_opus":0.028476297607723747,"score_gpt":0.27695447194323275,"score_spread":0.248478174335509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241407302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020958344,0.00004173398,0.9966929,0.00005414706,0.000079632555,0.00017088701,2.662845e-7,0.0001513779,0.0007132185],"genre_scores_gemma":[0.27640754,0.000017538989,0.7235128,0.000025462972,0.0000045678375,0.000008338425,4.4312947e-7,0.0000024837343,0.000020789379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994847,0.000024269237,0.00014743165,0.00017675759,0.00008163273,0.000085177344],"domain_scores_gemma":[0.9996008,0.000039483093,0.00005649132,0.00016373089,0.00011239849,0.00002708351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020671684,0.000051810548,0.0000721497,0.00007096506,0.00006776498,0.000044724657,0.00012418244,0.00004661175,0.0000021748426],"category_scores_gemma":[0.00011275477,0.00004744767,0.000018642213,0.00017869366,0.000013095213,0.00018499937,0.00003519493,0.000031202733,9.236232e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011999484,0.000008218292,0.000022749258,0.0000064529477,0.0000014934021,9.159803e-9,0.00007884546,0.6990477,0.000008006086,0.29916495,0.000012162327,0.0016482474],"study_design_scores_gemma":[0.000120470104,0.00003747377,0.0000031530246,0.000014476792,0.0000016096345,0.000002129803,0.000008112525,0.95376617,0.0021221705,0.043823086,0.00004813326,0.000053021322],"about_ca_topic_score_codex":0.0000032084138,"about_ca_topic_score_gemma":2.0925313e-7,"teacher_disagreement_score":0.27431172,"about_ca_system_score_codex":0.000008237593,"about_ca_system_score_gemma":0.000022693624,"threshold_uncertainty_score":0.19348598},"labels":[],"label_agreement":null},{"id":"W4242047705","doi":"10.1007/978-3-319-25703-7_11","title":"Enhancing Concurrency","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parallel computing; Computer science; Concurrency; Computation; Operating system; Programming language","score_opus":0.01888148943844481,"score_gpt":0.25060563863055907,"score_spread":0.23172414919211426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242047705","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.960174e-8,0.00013264662,0.50210553,0.00012932961,0.00018338762,0.000046733847,8.0715324e-7,0.0006562556,0.4967453],"genre_scores_gemma":[0.00019498063,0.00015123385,0.14468324,0.00027296378,0.00012729857,0.0000025318925,0.0000016561112,0.000016591375,0.8545495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989529,0.0000089981495,0.00026324825,0.00040713506,0.00019491183,0.00017279644],"domain_scores_gemma":[0.9990082,0.00007222559,0.00015466411,0.00058554095,0.0001103515,0.0000690246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013442457,0.00021047579,0.00021475008,0.00013206882,0.00006705772,0.000081992264,0.00083610497,0.00018017771,0.0003300911],"category_scores_gemma":[0.000012313432,0.00015821915,0.000095568066,0.000020082362,0.00003136533,0.00014064675,0.000317299,0.00014232557,0.00065418775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7840621e-7,0.0000015213441,2.484853e-7,0.000004650923,0.000006825216,0.0000036457748,0.000013851007,0.0000016092886,0.000013094101,0.958047,0.0077752215,0.034132194],"study_design_scores_gemma":[0.00013677706,0.00006464199,8.3156823e-7,0.00039348085,0.000006331978,0.000016956852,2.139138e-7,0.0026486116,0.0022889234,0.30570516,0.68808323,0.00065481063],"about_ca_topic_score_codex":8.493067e-7,"about_ca_topic_score_gemma":9.784956e-7,"teacher_disagreement_score":0.68030804,"about_ca_system_score_codex":0.00003783407,"about_ca_system_score_gemma":0.00008788337,"threshold_uncertainty_score":0.84084785},"labels":[],"label_agreement":null},{"id":"W4242116028","doi":"10.1145/3140587.3062346","title":"Miniphases: compilation using modular and efficient tree transformations","year":2017,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Compiler; Tree traversal; Programming language; Modular design; Just-in-time compilation; Intermediate language; Optimizing compiler; Parallel computing; Cache; Modularity (biology); Compiler correctness; Dynamic compilation","score_opus":0.046258631912153465,"score_gpt":0.3064293902375374,"score_spread":0.26017075832538394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242116028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2148258,0.00009176708,0.78314155,0.0003993431,0.00010120661,0.000104963474,0.000004981601,0.00017121944,0.0011591432],"genre_scores_gemma":[0.7546414,0.000008961494,0.24524945,0.000053036965,0.000024643055,0.000001897844,0.000004926086,0.0000035941187,0.0000120790755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930197,0.00003368376,0.00016787503,0.00020558342,0.000146718,0.0001441961],"domain_scores_gemma":[0.99891335,0.00009513472,0.00016193942,0.000720336,0.000052725896,0.000056538087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019383803,0.00009708283,0.000111690824,0.00008752374,0.0007387621,0.0005321803,0.00088599866,0.000042889395,0.0000030310596],"category_scores_gemma":[0.000096749456,0.00009110309,0.000025994208,0.000059014274,0.00006072341,0.0005323573,0.0001745,0.00005834869,0.0000056912154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002445288,0.0002675147,0.009320728,0.00011607709,0.00006926017,0.000024003872,0.0071664657,0.82388383,0.00394838,0.027078526,0.00062944775,0.12747131],"study_design_scores_gemma":[0.00021965471,0.000029506702,0.005702491,0.000030962667,0.000009409106,0.0000067037004,0.000015727546,0.9912035,0.0017101262,0.00068746624,0.00025992675,0.00012453365],"about_ca_topic_score_codex":0.000036362937,"about_ca_topic_score_gemma":0.000007774795,"teacher_disagreement_score":0.5398156,"about_ca_system_score_codex":0.000012948092,"about_ca_system_score_gemma":0.000020601079,"threshold_uncertainty_score":0.56820357},"labels":[],"label_agreement":null},{"id":"W4242224286","doi":"10.1145/2398857.2384678","title":"Exploiting inter-sequence correlations for program behavior prediction","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"National Science Foundation","keywords":"Computer science; Scope (computer science); Locality; Speedup; Sequence (biology); Program analysis; Machine learning; Artificial intelligence; Programming language; Parallel computing","score_opus":0.07910759505903991,"score_gpt":0.3395400838164095,"score_spread":0.2604324887573696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242224286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026857216,0.000084198924,0.9694295,0.00020702474,0.000626762,0.00057963014,0.000012181833,0.0015059499,0.0006975534],"genre_scores_gemma":[0.5876165,0.0000032016544,0.41186294,0.000056499564,0.00013067656,0.00023703618,0.000026664986,0.0000066268926,0.000059836737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906737,0.00004058879,0.00023232025,0.00022199973,0.00013233912,0.0003054024],"domain_scores_gemma":[0.9989283,0.00029242988,0.00014826727,0.00044164612,0.00009912405,0.000090199654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003143538,0.00011184989,0.00010293951,0.00009114393,0.00022870861,0.00015959232,0.00071312254,0.00006594624,0.000005144532],"category_scores_gemma":[0.00030553824,0.00010784603,0.00004909427,0.0001951992,0.000030623047,0.0010065736,0.00018334504,0.00009765762,0.00001668001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021447702,0.0011703137,0.20815276,0.00010861497,0.000058099915,0.0000049615956,0.00657431,0.0046536266,0.0011525813,0.042574815,0.009739189,0.7257893],"study_design_scores_gemma":[0.0006452616,0.0007036927,0.028501453,0.00017632717,0.00009478538,0.000048717888,0.00022066767,0.9399608,0.004855282,0.0020422037,0.022028103,0.000722732],"about_ca_topic_score_codex":0.000012165814,"about_ca_topic_score_gemma":0.0000018243654,"teacher_disagreement_score":0.93530715,"about_ca_system_score_codex":0.000030659543,"about_ca_system_score_gemma":0.000021748996,"threshold_uncertainty_score":0.43978333},"labels":[],"label_agreement":null},{"id":"W4242247877","doi":"10.1109/micro.1990.151455","title":"A survey on bit dimension optimization strategies of microprograms","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Dimension (graph theory); Computer science; Reduction (mathematics); Dimensionality reduction; Heuristic; Word (group theory); Optimization problem; Polyphase system; Arithmetic; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Electronic engineering; Engineering","score_opus":0.03436028224906092,"score_gpt":0.25991444334176056,"score_spread":0.22555416109269966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242247877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002628698,0.00005868004,0.98688596,0.00010327854,0.00005986709,0.000092535796,7.627001e-7,0.00041668533,0.009753518],"genre_scores_gemma":[0.57053,0.000035304023,0.42915797,0.00006275029,0.0000051965226,0.0000017881722,0.0000049449045,0.000004281967,0.0001977777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992265,0.00008962568,0.00019073303,0.00021162901,0.00015620863,0.0001252793],"domain_scores_gemma":[0.99935013,0.00006788862,0.00008918245,0.00032567463,0.00013404332,0.000033089473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021558598,0.00008903599,0.000113369926,0.0001040392,0.000054079286,0.00010169164,0.00033203393,0.000047205485,0.000040097464],"category_scores_gemma":[0.00002486101,0.00007456401,0.000031661875,0.00042079602,0.000027291579,0.00019702411,0.000075538715,0.000051175157,0.000015303594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063466023,0.00038181318,0.00084550283,0.000011386102,0.000015571957,0.0000027351703,0.00034819252,0.92019135,0.00030109115,0.04288678,0.010096349,0.024912903],"study_design_scores_gemma":[0.00011511532,0.00017682307,0.0009547616,0.000015660773,9.267051e-7,0.000001115604,0.0000070984147,0.99572545,0.0026068115,0.00023761524,0.00006637864,0.000092237686],"about_ca_topic_score_codex":0.00010312506,"about_ca_topic_score_gemma":0.000005718705,"teacher_disagreement_score":0.56790125,"about_ca_system_score_codex":0.000010312889,"about_ca_system_score_gemma":0.000010133708,"threshold_uncertainty_score":0.30406323},"labels":[],"label_agreement":null},{"id":"W4242576920","doi":"10.1145/2872887.2750410","title":"A variable warp size architecture","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"U.S. Department of Energy","keywords":"Parallel computing; Computer science; Sizing; Locality; Scheduling (production processes); Exploit; Microarchitecture; Performance improvement; Memory architecture; Distributed computing; Mathematics; Mathematical optimization; Engineering","score_opus":0.01952353574775083,"score_gpt":0.2558049945728984,"score_spread":0.23628145882514756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242576920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010211389,0.00020038616,0.9825983,0.006842067,0.00084789883,0.00050961314,0.000004791892,0.0023005323,0.0056752907],"genre_scores_gemma":[0.023597717,0.000008962799,0.9697329,0.005162934,0.0008779842,0.000046269593,0.000012884838,0.000051960844,0.0005083787],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579036,0.0005145109,0.00058998395,0.0012065924,0.00090907316,0.0009894576],"domain_scores_gemma":[0.99489677,0.001078636,0.00020953343,0.0028014793,0.00032163697,0.0006919164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008149631,0.0005694919,0.0005715452,0.00037030497,0.00026381147,0.00051970285,0.0049519097,0.00022619656,0.000020618074],"category_scores_gemma":[0.0007510185,0.00048872706,0.0002003239,0.001278403,0.000131894,0.00030647224,0.0030076879,0.0009317608,0.00008689187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008123335,0.0003208177,0.000571008,0.00006639862,0.00014546698,0.00014272433,0.007375334,0.3662467,0.00044838386,0.025057944,0.105157405,0.49438658],"study_design_scores_gemma":[0.0023300168,0.0011491637,0.00043281872,0.00015586405,0.000026388157,0.00068032404,0.000018291932,0.22265515,0.001296319,0.428044,0.34173924,0.0014724415],"about_ca_topic_score_codex":0.00013416496,"about_ca_topic_score_gemma":0.000017805545,"teacher_disagreement_score":0.49291414,"about_ca_system_score_codex":0.00010959763,"about_ca_system_score_gemma":0.00044278355,"threshold_uncertainty_score":0.99975646},"labels":[],"label_agreement":null},{"id":"W4242961789","doi":"10.1145/1186562.1015725","title":"TensorTextures","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.012112557932988441,"score_gpt":0.24789950478667333,"score_spread":0.2357869468536849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242961789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047545257,0.000023863624,0.9527394,0.0011198388,0.00004355462,0.000024456669,2.8057055e-8,0.00095067173,0.044622745],"genre_scores_gemma":[0.44006523,0.0000036548445,0.55882967,0.00071642105,0.000010732475,0.0000011002454,1.4120553e-7,0.000001268864,0.00037179101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996785,0.0000053630856,0.000056502256,0.00011168748,0.000066868524,0.00008106232],"domain_scores_gemma":[0.99972975,0.000006374491,0.00001349906,0.00019845986,0.00002501739,0.000026916721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004641306,0.000036892416,0.00003568299,0.00003503266,0.000044495733,0.000053881122,0.00032368954,0.000017599565,0.000006828851],"category_scores_gemma":[0.00000828725,0.00002917459,0.000017887125,0.00012542756,0.000008413407,0.00011237125,0.00006287524,0.000029747236,0.000055986988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.349938e-7,0.00001974478,0.000041373343,7.1583713e-7,0.0000019653658,0.0000042021543,0.00008293554,0.01480286,0.0001090329,0.97341436,0.0026365388,0.008886021],"study_design_scores_gemma":[0.0011437708,0.00023038442,0.0065035988,0.000032812506,0.0000034092004,0.00012613404,0.00001577615,0.16355686,0.08293199,0.70864755,0.036014408,0.0007933035],"about_ca_topic_score_codex":0.0000124289345,"about_ca_topic_score_gemma":7.5269753e-7,"teacher_disagreement_score":0.4395898,"about_ca_system_score_codex":0.000009320841,"about_ca_system_score_gemma":0.000018218238,"threshold_uncertainty_score":0.11897052},"labels":[],"label_agreement":null},{"id":"W4243004653","doi":"10.7873/date.2013.091","title":"Using Synchronization Stalls in Power-aware Accelerators","year":2013,"lang":"en","type":"article","venue":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2013","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Register file; Power gating; Computer science; sync; Idle; Synchronization (alternating current); Leakage (economics); Embedded system; Efficient energy use; Power (physics); Operating system; Parallel computing; Computer hardware; Computer network; Instruction set; Engineering; Voltage; Electrical engineering; Channel (broadcasting); Transistor","score_opus":0.07660793996230374,"score_gpt":0.2953441985709972,"score_spread":0.21873625860869345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243004653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053262454,0.000058829475,0.94213104,0.00055928674,0.00025079388,0.0011955472,0.00001459385,0.001356504,0.0011709546],"genre_scores_gemma":[0.6602794,0.0001427363,0.33812392,0.00036356054,0.000040353116,0.00010212281,0.00032054575,0.000054228225,0.00057317753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954055,0.0009193159,0.0012876759,0.0010290446,0.00064686453,0.0007116148],"domain_scores_gemma":[0.99623275,0.00037878656,0.00068414473,0.0010849745,0.0014039915,0.00021534586],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010686846,0.0005419951,0.0004976828,0.0010684808,0.00027817706,0.0012814086,0.0010810614,0.0002880284,0.00096848013],"category_scores_gemma":[0.00075448805,0.0005799831,0.000068000976,0.002566467,0.000118342236,0.0030820498,0.0003376674,0.0004376114,0.0022418413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006020414,0.0033119137,0.024973726,0.00050555577,0.00008814147,0.000052445812,0.013235571,0.6783055,0.10634215,0.026702655,0.10713934,0.03928277],"study_design_scores_gemma":[0.0010294819,0.000107240594,0.013489834,0.0007042591,0.000010999057,0.000048296064,0.000031284268,0.96842486,0.001673974,0.002633442,0.010544819,0.0013015119],"about_ca_topic_score_codex":0.0004629709,"about_ca_topic_score_gemma":0.00016724721,"teacher_disagreement_score":0.6070169,"about_ca_system_score_codex":0.00022868953,"about_ca_system_score_gemma":0.00044272683,"threshold_uncertainty_score":0.99994475},"labels":[],"label_agreement":null},{"id":"W4243058626","doi":"10.1109/micro.2016.7783731","title":"OSCAR: Orchestrating STT-RAM cache traffic for heterogeneous CPU-GPU architectures","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Advanced Scientific Computing Research; U.S. Department of Energy; Office of Science; Advanced Micro Devices; National Science Foundation","keywords":"Computer science; Cache; Cache pollution; Parallel computing; Network packet; Bottleneck; Embedded system; Cache coloring; CPU cache; Cache algorithms; Computer network","score_opus":0.023917855452326282,"score_gpt":0.27010224751056805,"score_spread":0.24618439205824177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243058626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046265963,0.000057953555,0.94983137,0.0010066155,0.000106338994,0.00025936266,0.0000024483502,0.0013135371,0.0011564252],"genre_scores_gemma":[0.6267138,0.000004867315,0.37245348,0.00025907042,0.00006486686,0.000029389947,8.949793e-7,0.00001039718,0.00046322963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987195,0.000068432084,0.00025502517,0.00044042114,0.00016541594,0.000351183],"domain_scores_gemma":[0.9989717,0.00030180492,0.00008849949,0.00046120828,0.000078497585,0.000098309625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002252647,0.0001699075,0.00016290347,0.00009699006,0.00015610016,0.00013735573,0.0007471624,0.00007725927,0.000009422459],"category_scores_gemma":[0.00006964422,0.000109117886,0.00011092908,0.00014845647,0.000042245647,0.00009054483,0.00012091437,0.000064933185,0.000010432379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019484702,0.00010910969,0.00017182242,0.000029590963,0.000049022627,0.000009813392,0.0007155349,0.1260502,0.0032610302,0.009144311,0.004192573,0.8562475],"study_design_scores_gemma":[0.0010871066,0.0006553571,0.00015685688,0.00009052419,0.000012346234,0.0001217404,0.000018039878,0.9218204,0.060002916,0.008773941,0.006418955,0.0008417867],"about_ca_topic_score_codex":0.000008955228,"about_ca_topic_score_gemma":0.0000182429,"teacher_disagreement_score":0.8554057,"about_ca_system_score_codex":0.000031137268,"about_ca_system_score_gemma":0.00006106317,"threshold_uncertainty_score":0.44496983},"labels":[],"label_agreement":null},{"id":"W4243187110","doi":"10.1145/1327312.1327316","title":"Investigating cache energy and latency break-even points in high performance processors","year":2007,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Cache; Cache algorithms; Computer science; Cache pollution; Smart Cache; Cache invalidation; Cache coloring; Parallel computing; Latency (audio); Page cache; MESI protocol; Efficient energy use; CPU cache; Telecommunications; Engineering","score_opus":0.011450869891126132,"score_gpt":0.23857634642840048,"score_spread":0.22712547653727436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243187110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29405418,0.000093122486,0.70344526,0.0014703427,0.00011296399,0.00014445504,5.6750224e-7,0.00038470718,0.00029439494],"genre_scores_gemma":[0.5232311,0.000029448569,0.4753035,0.001245786,0.00012772508,0.000008253428,0.0000045371,0.00001637296,0.0000333023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747545,0.000164167,0.00052516075,0.0007610816,0.00039736333,0.0006767885],"domain_scores_gemma":[0.99824506,0.00044945665,0.00017287978,0.000802025,0.000099986224,0.00023062101],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082490325,0.00032792529,0.0003346064,0.00050828914,0.00019826111,0.00017022871,0.0016307505,0.00014260452,0.0000020710224],"category_scores_gemma":[0.00013427975,0.000297006,0.000045211833,0.0009374218,0.00012120053,0.00031889635,0.0013208285,0.00043953204,0.000002681659],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012489971,0.000080781116,0.03207297,0.00008096128,0.000019762912,0.00003970012,0.0047119325,0.026772782,0.00030975844,0.0032276034,0.00051587645,0.9321554],"study_design_scores_gemma":[0.0022275199,0.0008889934,0.15653728,0.0006735577,0.000013090862,0.0004387126,0.000022706121,0.7448495,0.011581343,0.075042374,0.0061004735,0.0016244428],"about_ca_topic_score_codex":0.0003333789,"about_ca_topic_score_gemma":0.0001937326,"teacher_disagreement_score":0.93053097,"about_ca_system_score_codex":0.000055060533,"about_ca_system_score_gemma":0.000099969104,"threshold_uncertainty_score":0.9999482},"labels":[],"label_agreement":null},{"id":"W4243266883","doi":"10.1109/isca.1990.134519","title":"An empirical evaluation of two memory-efficient directory methods","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Directory; Cache; Scheme (mathematics); Block (permutation group theory); Shared memory; Overhead (engineering); Parallel computing; Distributed shared memory; Interconnection; Cache coherence; CPU cache; Overlay; Memory management; Computer network; Cache algorithms; Uniform memory access; Operating system","score_opus":0.1295121701787944,"score_gpt":0.4513671446171269,"score_spread":0.3218549744383325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243266883","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009954911,0.00017188006,0.9643781,0.00012903618,0.00012375483,0.00012458523,1.5866205e-7,0.00045664003,0.024660917],"genre_scores_gemma":[0.41786125,0.0000026338416,0.5819182,0.00010653904,0.000015284637,0.000005618955,4.1964438e-7,0.0000029918792,0.000087083834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.00077644543,0.00022519947,0.00027161252,0.00043798776,0.00013010326],"domain_scores_gemma":[0.9989238,0.00010654457,0.000085460844,0.00052565464,0.00029385887,0.000064678716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024614735,0.00008144535,0.0001257199,0.00013013944,0.000060076203,0.00003863416,0.00048337766,0.000034804536,0.00018898663],"category_scores_gemma":[0.00009595372,0.000069705835,0.00004499737,0.00038131475,0.000030692136,0.00012386826,0.000077122655,0.000060000293,0.000011236803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.694963e-7,0.00033763517,0.00018813903,0.0000037795164,0.000009202654,4.848804e-7,0.0012161304,0.40894368,0.001378567,0.0036389837,0.003072891,0.58120954],"study_design_scores_gemma":[0.000181946,0.00004585363,0.000447953,0.0000037575592,0.0000068481277,0.0000021382364,0.000005367099,0.97321486,0.025036655,0.00082340324,0.00014350438,0.00008773665],"about_ca_topic_score_codex":0.000013998872,"about_ca_topic_score_gemma":8.4087543e-7,"teacher_disagreement_score":0.5811218,"about_ca_system_score_codex":0.000039792416,"about_ca_system_score_gemma":0.000027589587,"threshold_uncertainty_score":0.28425217},"labels":[],"label_agreement":null},{"id":"W4243432551","doi":"10.1109/date.2001.915058","title":"Network processors: a perspective on market requirements, processor architectures and embedded S/W tools","year":2002,"lang":"en","type":"article","venue":"Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"STMicroelectronics (Canada)","funders":"","keywords":"Network processor; Computer science; Software; Bandwidth (computing); Architecture; Embedded system; Service (business); Network architecture; Enhanced Data Rates for GSM Evolution; Computer architecture; Operating system; Computer network; Telecommunications","score_opus":0.057513776751121966,"score_gpt":0.2724104517537376,"score_spread":0.21489667500261567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243432551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11215657,0.0016812034,0.75939775,0.010652076,0.00014887059,0.0034722304,0.000012388672,0.0033520537,0.10912686],"genre_scores_gemma":[0.94340557,0.0007351887,0.054462105,0.0008388423,0.000053466578,0.00007584318,0.0000023234056,0.000015383706,0.00041130077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852896,0.00005798813,0.00030373383,0.0005680125,0.00022240789,0.00031890318],"domain_scores_gemma":[0.99896747,0.00019470244,0.00019111292,0.00009431922,0.00044057207,0.0001118058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051599485,0.00023235161,0.00021589991,0.00022710103,0.00023802847,0.0007185482,0.00018740118,0.00007852418,0.000029131425],"category_scores_gemma":[0.00069611974,0.00021341079,0.000012422403,0.00065296434,0.00009262568,0.00067553215,0.0000955022,0.00018041495,0.00000524602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046908786,0.0023395137,0.019925982,0.0019926024,0.00011813284,0.000092389484,0.061896525,0.0030702255,0.004895909,0.5024383,0.099237,0.30352432],"study_design_scores_gemma":[0.00094890874,0.00066015177,0.009539478,0.0007876808,0.000011162163,0.00008807998,0.00024726352,0.95920277,0.00085225416,0.02678858,0.00037298253,0.00050071074],"about_ca_topic_score_codex":0.000004497158,"about_ca_topic_score_gemma":0.000001374532,"teacher_disagreement_score":0.95613253,"about_ca_system_score_codex":0.000032884156,"about_ca_system_score_gemma":0.000035512443,"threshold_uncertainty_score":0.870264},"labels":[],"label_agreement":null},{"id":"W4243453813","doi":"10.1145/384285.379260","title":"Code layout optimizations for transaction processing workloads","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Computer science; Online transaction processing; Operating system; Compiler; Cache; Parallel computing; Transaction processing; Optimizing compiler; Database transaction; Database","score_opus":0.02426083167866355,"score_gpt":0.2857617733199926,"score_spread":0.26150094164132903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243453813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059168093,0.00015393402,0.99010557,0.0059372066,0.0003318668,0.0006819251,0.000004832181,0.001558799,0.00063418597],"genre_scores_gemma":[0.070492685,0.000047342706,0.92697906,0.0015973395,0.00046109734,0.00010787724,0.000026467605,0.00003818065,0.00024993034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768907,0.00013924218,0.0004492043,0.0007818513,0.00034898665,0.0005916245],"domain_scores_gemma":[0.997999,0.0003690661,0.0001627482,0.0010347826,0.00024397674,0.00019041865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003186731,0.00032857456,0.00031946853,0.00036036657,0.00052415556,0.00043293452,0.0019724777,0.00014379178,0.000009047649],"category_scores_gemma":[0.00007672418,0.0003077805,0.00018155061,0.0008661088,0.00006886572,0.0003894195,0.0003061945,0.0003437573,0.000007849836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022309516,0.000075255615,0.00013557314,0.000023272463,0.000018760984,0.0000054277452,0.0011616938,0.46355927,0.00006430583,0.0005641475,0.0024137474,0.5319562],"study_design_scores_gemma":[0.0006715338,0.00022484176,0.00018445945,0.0000879694,0.00001407362,0.00010465189,0.000006338764,0.946655,0.00037999332,0.009895342,0.04138218,0.00039365885],"about_ca_topic_score_codex":0.000015398778,"about_ca_topic_score_gemma":0.000028303723,"teacher_disagreement_score":0.53156257,"about_ca_system_score_codex":0.00005996719,"about_ca_system_score_gemma":0.00013771866,"threshold_uncertainty_score":0.9999374},"labels":[],"label_agreement":null},{"id":"W4243851141","doi":"10.1145/378995.379242","title":"OS and compiler considerations in the design of the IA-64 architecture","year":2000,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada)","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Computer science; Compiler; Instruction-level parallelism; Instruction set; Computer architecture; Exploit; Parallelism (grammar); Architecture; Pace; Parallel computing; Processor register; Addressing mode; Programming language; Operating system; Instructions per cycle; Memory address","score_opus":0.01992550735666685,"score_gpt":0.25780068692827274,"score_spread":0.2378751795716059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243851141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010173266,0.00020888848,0.97577906,0.012053194,0.00010820971,0.00084804295,0.0000036447393,0.00017069005,0.00065501337],"genre_scores_gemma":[0.4544429,0.000026569323,0.54043627,0.004880196,0.00011868253,0.00003484332,0.0000021002572,0.00001407804,0.000044362132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701816,0.0011596028,0.00046316028,0.0005242424,0.00044736025,0.0003874953],"domain_scores_gemma":[0.9961781,0.0019397017,0.0001241688,0.0016167684,0.000067578534,0.00007370006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006534665,0.00028289264,0.0003112943,0.00018787809,0.00032682827,0.0002190924,0.0023171294,0.000099417215,0.000029768884],"category_scores_gemma":[0.00012626394,0.00016532376,0.00010943076,0.00065193255,0.00027424024,0.000104381616,0.0006091737,0.0006689578,0.000004420036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020566136,0.000149605,0.0010154477,0.000027671875,0.000035737692,0.000019599913,0.013647663,0.66710377,0.00022467299,0.005298595,0.010883863,0.3015728],"study_design_scores_gemma":[0.0024133571,0.000834472,0.042703707,0.0003669856,0.000040392253,0.0012154663,0.000046278496,0.56939065,0.0019021024,0.3511756,0.028779326,0.001131628],"about_ca_topic_score_codex":0.00007390665,"about_ca_topic_score_gemma":0.000057133606,"teacher_disagreement_score":0.44426963,"about_ca_system_score_codex":0.00001744307,"about_ca_system_score_gemma":0.0001141931,"threshold_uncertainty_score":0.67417073},"labels":[],"label_agreement":null},{"id":"W4244472522","doi":"10.1145/384285.379265","title":"Power and energy reduction via pipeline balancing","year":2001,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PQ Corporation (Canada)","funders":"","keywords":"Pipeline (software); Computer science; Queue; Reduction (mathematics); Power (physics); Embedded system; Energy (signal processing); Dissipation; Chip; Efficient energy use; Power budget; Component (thermodynamics); Real-time computing; Operating system; Electric power system; Engineering; Computer network; Electrical engineering","score_opus":0.0076780024742064135,"score_gpt":0.23428634659511988,"score_spread":0.22660834412091346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244472522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00391575,0.00023149759,0.9885495,0.003873734,0.00047860175,0.00009919637,5.396502e-7,0.00091693935,0.0019342548],"genre_scores_gemma":[0.34622186,0.00011022068,0.6508933,0.001923381,0.00048366026,0.000011523462,0.0000071160207,0.000022946146,0.00032605234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793255,0.0001882505,0.00035240926,0.00073201925,0.00033099076,0.00046377076],"domain_scores_gemma":[0.9983011,0.00017888768,0.0001198361,0.0010855707,0.00011345229,0.00020114022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026816502,0.00028771078,0.0002772124,0.00031999778,0.00023650912,0.0002237861,0.0012164308,0.00010885613,0.000012045005],"category_scores_gemma":[0.00004494788,0.00025965399,0.000085818814,0.0005453491,0.00007574483,0.0002413141,0.0011089144,0.00030785755,0.0000072357047],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019451321,0.00006845845,0.00036666598,0.0000094636325,0.000023897079,0.000044123553,0.0012269046,0.015561264,0.0012716269,0.0025894572,0.009651792,0.9691669],"study_design_scores_gemma":[0.0009057708,0.00052003737,0.0013777963,0.00009600111,0.000010738299,0.0022235708,0.0000091392885,0.778718,0.0022599103,0.04581094,0.1672168,0.00085128896],"about_ca_topic_score_codex":0.000100011675,"about_ca_topic_score_gemma":0.000012673593,"teacher_disagreement_score":0.9683156,"about_ca_system_score_codex":0.000037253038,"about_ca_system_score_gemma":0.00004386874,"threshold_uncertainty_score":0.9999856},"labels":[],"label_agreement":null},{"id":"W4244474156","doi":"10.1145/500030.500032","title":"Current consumption dynamics at instruction and program level for a <i>VLIW</i> DSP processor","year":2001,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very long instruction word; Computer science; Digital signal processing; Digital signal processor; Computer architecture; Construct (python library); Energy consumption; Embedded system; Multi-core processor; Instruction set; Software; Parallel computing; Computer hardware; Operating system; Engineering; Electrical engineering","score_opus":0.04813361719899772,"score_gpt":0.3231468309333242,"score_spread":0.27501321373432647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244474156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04172343,0.00016770669,0.9559037,0.00030337187,0.00015031778,0.00052616955,0.00000268445,0.0009012851,0.00032130806],"genre_scores_gemma":[0.21808174,0.00081556634,0.78023696,0.00014144393,0.000046731602,0.00020106098,0.000028121272,0.000010159246,0.0004382416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925256,0.000016182017,0.00016410397,0.00028990122,0.00010611629,0.00017112574],"domain_scores_gemma":[0.9995553,0.000028175422,0.000080201215,0.00016143371,0.00011897265,0.000055933942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013565275,0.000100062774,0.00009395942,0.000073717885,0.00017647461,0.00012446435,0.00018790296,0.00003989554,0.000002163235],"category_scores_gemma":[0.000019688561,0.000090454676,0.000026867814,0.00016341965,0.000036675436,0.00026125438,0.00012393441,0.00005236298,0.000003588902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016815044,0.00009942646,0.006146743,0.00006688143,0.000005480551,4.0572175e-7,0.00009238803,0.00025802784,0.000019246138,0.025405126,0.0011274298,0.966762],"study_design_scores_gemma":[0.000472975,0.00011418827,0.0016422491,0.000029919469,0.0000041538965,0.000053220294,0.0000029713012,0.9847372,0.00041501105,0.0031543998,0.009218123,0.0001555902],"about_ca_topic_score_codex":0.000004793236,"about_ca_topic_score_gemma":0.000028865994,"teacher_disagreement_score":0.9844792,"about_ca_system_score_codex":0.00006738232,"about_ca_system_score_gemma":0.000023643192,"threshold_uncertainty_score":0.36886346},"labels":[],"label_agreement":null},{"id":"W4244697326","doi":"10.1145/2499368.2451118","title":"GPUDet","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Debugging; Parallel computing; Scalability; Nondeterministic algorithm; Thread (computing); Compiler; Multi-core processor; Massively parallel; Correctness; Execution model; Programming language; Operating system; Theoretical computer science","score_opus":0.01849169908033233,"score_gpt":0.2516386902440366,"score_spread":0.2331469911637043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244697326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036729418,0.0001638356,0.92969024,0.004371859,0.00034938718,0.00023009011,9.3133957e-7,0.0017610472,0.026703212],"genre_scores_gemma":[0.6444608,0.0000067351893,0.35431144,0.00071906915,0.000047607948,0.000010900117,0.0000020994873,0.00000448683,0.00043684486],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.000037605227,0.0001328307,0.00022075561,0.00014231779,0.0001898002],"domain_scores_gemma":[0.9989524,0.00017086955,0.00006621732,0.0006805649,0.00006365166,0.00006631969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011014718,0.0000882877,0.000090932605,0.00006763967,0.00009000626,0.00026818283,0.0014640337,0.000042055326,0.00007870924],"category_scores_gemma":[0.00012604594,0.0000754882,0.000026849471,0.0001803832,0.000021094733,0.0005161095,0.00033682917,0.00007301572,0.00064521265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068783206,0.00031486325,0.019136595,0.00008085817,0.0000924284,0.000043573502,0.0036759523,0.014383029,0.0022840751,0.12816386,0.5021743,0.32964358],"study_design_scores_gemma":[0.00056937855,0.00028976635,0.03456842,0.00007242014,0.000012539129,0.000029198276,0.000062796724,0.8397866,0.01222455,0.06370451,0.047620736,0.0010590848],"about_ca_topic_score_codex":0.000094111194,"about_ca_topic_score_gemma":0.0000024411886,"teacher_disagreement_score":0.8254036,"about_ca_system_score_codex":0.000008445488,"about_ca_system_score_gemma":0.000016619646,"threshold_uncertainty_score":0.82931185},"labels":[],"label_agreement":null},{"id":"W4244816113","doi":"10.1142/9789814405461_0019","title":"Cointegration analysis of the Fed model","year":2012,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cointegration; Econometrics; Economics; Mathematical economics","score_opus":0.03296041382310367,"score_gpt":0.24775208626505094,"score_spread":0.21479167244194727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244816113","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012563749,0.00009114285,0.46638864,0.000052735395,0.0004135851,0.00015368087,0.000011609267,0.00015151527,0.53272456],"genre_scores_gemma":[0.029796554,8.3408065e-7,0.032346264,0.000087135544,0.000025563693,0.0000052400787,0.000018807994,0.000014071488,0.9377055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981638,0.000040132934,0.00045110288,0.0005064509,0.0006205599,0.00021794564],"domain_scores_gemma":[0.99751335,0.000050869086,0.0005213779,0.0015562568,0.00028710588,0.00007101003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007578103,0.00022459493,0.00037838172,0.0010320379,0.00034299117,0.00025635248,0.0015200272,0.0001102803,0.000033101504],"category_scores_gemma":[0.000008189342,0.00016440195,0.00044142042,0.00040368002,0.0002807709,0.00009167783,0.00042448074,0.0002541281,0.000014859011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019747283,0.000012346156,0.000012277662,0.000009397231,0.0001834921,3.2869943e-7,0.00055234024,0.012112439,0.0001465923,0.9650504,0.016465927,0.0054525067],"study_design_scores_gemma":[0.00005432861,0.000007046667,0.000022033724,0.00008752126,0.0003597248,7.4104474e-7,0.0000010188643,0.908735,0.001329856,0.02707716,0.06204192,0.00028367928],"about_ca_topic_score_codex":0.0000036505978,"about_ca_topic_score_gemma":0.00039504893,"teacher_disagreement_score":0.9379732,"about_ca_system_score_codex":0.00006590874,"about_ca_system_score_gemma":0.0001591811,"threshold_uncertainty_score":0.6704117},"labels":[],"label_agreement":null},{"id":"W4244991550","doi":"10.1145/2872887.2750395","title":"C <scp>lean</scp>","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Synchronization (alternating current); Semantics (computer science); Parsec; Software; Exploit; Parallel computing; Source lines of code; Compiler; Programming language; Computer security; Computer network; Channel (broadcasting)","score_opus":0.02692758436438008,"score_gpt":0.2657138716817513,"score_spread":0.23878628731737123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244991550","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063974196,0.00022738213,0.9807589,0.0020824883,0.0007846881,0.000333589,0.0000019717263,0.0021050829,0.0073084724],"genre_scores_gemma":[0.055909675,0.00001357514,0.9389744,0.0035967124,0.00079729105,0.00002600992,0.000013119316,0.00003973609,0.00062952045],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968701,0.00025989226,0.0004535157,0.00090886257,0.00074284896,0.00076475844],"domain_scores_gemma":[0.9960434,0.00077784236,0.00017023309,0.0021800348,0.00026526718,0.00056321465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006282384,0.0004067567,0.00040034708,0.00040597114,0.00019282014,0.00039354348,0.0042885076,0.00015523558,0.0000026833927],"category_scores_gemma":[0.0005621793,0.00035945565,0.00017124644,0.0008529202,0.00010471766,0.00030062086,0.002630021,0.00059434155,0.00015110995],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007587442,0.0002127437,0.0013176912,0.00003138294,0.00008325441,0.00012549038,0.0091392575,0.08955049,0.00010859568,0.015180655,0.4235409,0.46070197],"study_design_scores_gemma":[0.0016402955,0.0009860786,0.0009908219,0.00009249279,0.000015820622,0.0003855594,0.00004217951,0.4100462,0.0025460161,0.15519208,0.42755872,0.00050374435],"about_ca_topic_score_codex":0.000051771978,"about_ca_topic_score_gemma":0.000012041517,"teacher_disagreement_score":0.46019822,"about_ca_system_score_codex":0.000073913594,"about_ca_system_score_gemma":0.00023435392,"threshold_uncertainty_score":0.99988574},"labels":[],"label_agreement":null},{"id":"W4244995015","doi":"10.1145/2508148.2485949","title":"A hardware evaluation of cache partitioning to improve utilization and energy-efficiency while preserving responsiveness","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Samsung; Nokia; University of California; Oracle; Agència de Gestió d'Ajuts Universitaris i de Recerca; Ministerio de Economía y Competitividad; Mountain Equipment Co-operative; Microsoft; Nvidia; Intel Corporation","keywords":"Computer science; Cache; Partition (number theory); Parallel computing; Throughput; Scheduling (production processes); Efficient energy use; x86; Multi-core processor; Energy consumption; Slowdown; Cache algorithms; CPU cache; Overhead (engineering); Embedded system; Operating system; Software","score_opus":0.040754326727959776,"score_gpt":0.292253437584214,"score_spread":0.25149911085625426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244995015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05752601,0.00019813929,0.939357,0.0015432563,0.00017550465,0.00051894697,0.0000026004839,0.00027094214,0.00040760147],"genre_scores_gemma":[0.63631046,0.000012077378,0.36283737,0.0005187619,0.000101479935,0.00014726758,0.000011174908,0.000015591593,0.000045837864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972443,0.0006231203,0.00042348306,0.0006676714,0.00068904407,0.00035238077],"domain_scores_gemma":[0.9973084,0.00043158815,0.00018139962,0.0010656465,0.000841436,0.00017156005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000901307,0.0002241005,0.0002612512,0.0003840852,0.0002156736,0.00025913617,0.0012754166,0.0000875558,0.000020137193],"category_scores_gemma":[0.00049854716,0.00020732888,0.00006134509,0.0007084706,0.00005383936,0.00037045928,0.0015958368,0.0001618125,0.0000044032463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013287163,0.000071893664,0.0006609836,0.000043652275,0.000023117402,0.0000012030672,0.0032327806,0.1762191,0.0034641419,0.0017392085,0.0020133122,0.8125173],"study_design_scores_gemma":[0.00038192494,0.0002980354,0.006495708,0.00012859452,0.000013877661,0.000011627197,0.000016932638,0.97108686,0.0076625724,0.01169237,0.0019567173,0.00025478785],"about_ca_topic_score_codex":0.00029109276,"about_ca_topic_score_gemma":0.000036921916,"teacher_disagreement_score":0.81226254,"about_ca_system_score_codex":0.00005309108,"about_ca_system_score_gemma":0.00016307269,"threshold_uncertainty_score":0.8454626},"labels":[],"label_agreement":null},{"id":"W4245712643","doi":"10.1002/spe.751","title":"Compiler optimizations for processors with SIMD instructions","year":2006,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Christian Doppler Forschungsgesellschaft","keywords":"SIMD; Computer science; Compiler; Pointer (user interface); Parallel computing; Programming language; Vectorization (mathematics); Computer hardware","score_opus":0.010510307612428589,"score_gpt":0.27195807063305705,"score_spread":0.26144776302062844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245712643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020671864,0.00013237706,0.9948692,0.0008202845,0.00007428284,0.00024179814,0.0000024903857,0.00060808595,0.0011843048],"genre_scores_gemma":[0.16289762,0.000033621443,0.83630013,0.00038098154,0.00003794639,0.00014503938,0.0000071113736,0.000008680347,0.0001888384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912643,0.000027930446,0.00016499936,0.00034006455,0.00014652719,0.00019404649],"domain_scores_gemma":[0.9989771,0.00027348855,0.0001337044,0.00025017394,0.00031237362,0.000053140804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010349589,0.000117503914,0.00010414366,0.00007225715,0.00048381303,0.0002607772,0.00027711943,0.00004427171,0.00000232151],"category_scores_gemma":[0.00023784446,0.00010186116,0.000018873392,0.00039520283,0.00009847329,0.0015066505,0.000076873046,0.00007754311,0.0000017245584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003538376,0.0015477526,0.01454343,0.00025205952,0.000121446275,0.000033186592,0.029883377,0.43956757,0.00020004,0.39171907,0.032208417,0.08956983],"study_design_scores_gemma":[0.002824114,0.0013990209,0.0022375716,0.00021374777,0.00009556937,0.0009827651,0.003338626,0.6045228,0.0049161185,0.018276663,0.35903764,0.002155309],"about_ca_topic_score_codex":0.00005616956,"about_ca_topic_score_gemma":0.000006539563,"teacher_disagreement_score":0.3734424,"about_ca_system_score_codex":0.000015498666,"about_ca_system_score_gemma":0.000068740774,"threshold_uncertainty_score":0.41537774},"labels":[],"label_agreement":null},{"id":"W4245755273","doi":"10.1145/3263322","title":"Session details: Optimization","year":2012,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Session (web analytics); Programming language; World Wide Web","score_opus":0.028576190589446028,"score_gpt":0.28137966886513127,"score_spread":0.2528034782756852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245755273","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036471733,0.0004082692,0.98996097,0.00044546468,0.00036554405,0.0000854098,6.5154137e-7,0.00076416373,0.0043223375],"genre_scores_gemma":[0.4874313,0.000026819323,0.5120837,0.00025262762,0.000095436284,0.000004246919,0.0000064216333,0.000005836586,0.0000936337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907506,0.00008157604,0.00017158398,0.00019541034,0.00019189114,0.00028447967],"domain_scores_gemma":[0.99894404,0.00017690232,0.0001172636,0.0005968797,0.000057663972,0.000107255975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032142483,0.000113276925,0.00010750449,0.000098505145,0.0001546754,0.00009643467,0.0009386323,0.00006810044,0.00003230665],"category_scores_gemma":[0.0002052365,0.00009832592,0.000031529544,0.00027258904,0.000018351062,0.0010771201,0.00032414382,0.00008458179,0.00007176923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019566916,0.0004395451,0.04435932,0.00007152065,0.000052215895,0.000009639742,0.0038211155,0.8187848,0.0005323477,0.02727581,0.030473847,0.07416031],"study_design_scores_gemma":[0.00021609213,0.000057967543,0.0029489584,0.000042876713,0.000011651317,0.000012776768,0.000031735693,0.98388624,0.004973164,0.0006502284,0.006811809,0.00035649908],"about_ca_topic_score_codex":0.000010068596,"about_ca_topic_score_gemma":6.4149174e-7,"teacher_disagreement_score":0.4837841,"about_ca_system_score_codex":0.000019080135,"about_ca_system_score_gemma":0.000019224659,"threshold_uncertainty_score":0.4009615},"labels":[],"label_agreement":null},{"id":"W4245783794","doi":"10.1145/1961296.1950391","title":"Flikker","year":2011,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dram; Embedded system; Correctness; Energy consumption; Software; Operating system; Computer hardware; Programming language","score_opus":0.051716058342789854,"score_gpt":0.25963449058543114,"score_spread":0.20791843224264128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245783794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012350431,0.000117877775,0.91426533,0.00033171676,0.0003212281,0.000087487155,8.509844e-7,0.0012722572,0.07125284],"genre_scores_gemma":[0.5552609,0.0000058459427,0.4440716,0.00035619253,0.000029006047,0.000003007688,0.0000010684859,0.0000040980785,0.00026829058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993258,0.000035358287,0.00012543969,0.00022134585,0.000119927194,0.0001721235],"domain_scores_gemma":[0.9990692,0.00007854024,0.000066294764,0.0006868664,0.000042717093,0.00005634948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015164979,0.000085680746,0.00008578247,0.00006887743,0.0000808434,0.00006886499,0.0014298381,0.000042457454,0.000048024245],"category_scores_gemma":[0.00008956739,0.00007433014,0.000028889328,0.00016941909,0.000023908178,0.00031330402,0.00031807623,0.00006903036,0.00017220908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055475455,0.00071066176,0.044032615,0.00009406472,0.00016879287,0.00025853777,0.026599517,0.0020180254,0.0008209073,0.6213903,0.09462969,0.20922144],"study_design_scores_gemma":[0.001714896,0.0011678985,0.106629625,0.0002000925,0.00006708239,0.000118132455,0.00022443027,0.5536787,0.08609016,0.15305416,0.09395666,0.003098173],"about_ca_topic_score_codex":0.00004742466,"about_ca_topic_score_gemma":0.0000036336103,"teacher_disagreement_score":0.55166066,"about_ca_system_score_codex":0.000006546,"about_ca_system_score_gemma":0.000017398905,"threshold_uncertainty_score":0.30310953},"labels":[],"label_agreement":null},{"id":"W4245861455","doi":"10.1109/isca.2016.54","title":"The Anytime Automaton","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Automaton; Pipeline (software); Computation; Theoretical computer science; Distributed computing; Simple (philosophy); Cellular automaton; State (computer science); Computer engineering; Algorithm; Programming language","score_opus":0.008701545720614635,"score_gpt":0.23542631871665703,"score_spread":0.2267247729960424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245861455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020413521,0.000027125925,0.9647754,0.0063220435,0.000079429294,0.00003009515,4.9841404e-8,0.0011225227,0.02743922],"genre_scores_gemma":[0.5778259,0.000074716336,0.3985331,0.00069039385,0.000041333304,0.00000899715,7.144081e-8,0.0000055365135,0.022819955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959624,0.000025208796,0.00007432011,0.00010769882,0.00008241153,0.00011411436],"domain_scores_gemma":[0.99946296,0.00012483774,0.000023280645,0.0003317317,0.00003130479,0.000025861485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017982254,0.000038109814,0.000030714255,0.000016432152,0.00014175415,0.0000866729,0.00058437523,0.000015466047,0.000009133431],"category_scores_gemma":[0.000027587912,0.000015261478,0.000019123157,0.000094172894,0.00002321005,0.00012963705,0.00012774608,0.000015607853,0.00013185292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2851785e-7,0.0000072602807,0.00013676824,3.4827164e-7,0.0000033625006,9.615854e-7,0.000028228253,0.000020495032,0.00028654892,0.6458065,0.060449455,0.29325944],"study_design_scores_gemma":[0.00036233407,0.00008875819,0.0024898183,0.000027748525,0.00000136219,0.000026317559,0.0000033483686,0.49082714,0.038310245,0.0737424,0.3937976,0.0003229389],"about_ca_topic_score_codex":0.0000021514195,"about_ca_topic_score_gemma":5.292657e-7,"teacher_disagreement_score":0.57762176,"about_ca_system_score_codex":0.000009622737,"about_ca_system_score_gemma":0.000016825914,"threshold_uncertainty_score":0.16947466},"labels":[],"label_agreement":null},{"id":"W4245984267","doi":"10.1145/2714064.2660204","title":"Cybertron","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Computer science; Granularity; Reduction (mathematics); Encoding (memory); Computation; Parallel computing; Focus (optics); Big data; State (computer science); Algorithm; Programming language; Operating system","score_opus":0.015045178171347663,"score_gpt":0.25070451830976737,"score_spread":0.23565934013841972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245984267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008429764,0.000048489128,0.965829,0.0013393961,0.00021087566,0.000051571355,3.3314464e-7,0.0008524427,0.023238106],"genre_scores_gemma":[0.6915543,0.0000037643765,0.30752096,0.00057989743,0.000071028364,0.0000026045213,0.0000020559567,0.0000043399973,0.0002610306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992682,0.00006461727,0.00012137922,0.00022959556,0.0001409686,0.00017527517],"domain_scores_gemma":[0.99887943,0.00025235975,0.00006876973,0.0007081225,0.00003621809,0.000055095337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024595083,0.000085383545,0.000096325835,0.00006328962,0.00009601322,0.00013793785,0.0012952097,0.00004056477,0.000009879074],"category_scores_gemma":[0.00024014474,0.000075174474,0.00002752155,0.00014801644,0.00001894719,0.00023938545,0.00027398596,0.00007009981,0.00012064407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001584077,0.0002046828,0.01115827,0.000060713697,0.00005200414,0.000016429109,0.0021537747,0.02931477,0.0010376874,0.50295204,0.07320924,0.37982452],"study_design_scores_gemma":[0.00038719355,0.00024190036,0.007550907,0.000041487747,0.000009150876,0.000011372357,0.000009692021,0.8476736,0.006696423,0.025858758,0.11099599,0.00052351935],"about_ca_topic_score_codex":0.000025158255,"about_ca_topic_score_gemma":0.000004333845,"teacher_disagreement_score":0.81835884,"about_ca_system_score_codex":0.000008276915,"about_ca_system_score_gemma":0.000011710998,"threshold_uncertainty_score":0.30655262},"labels":[],"label_agreement":null},{"id":"W4246027188","doi":"10.2307/2695500","title":"Inverting the Pascal Matrix Plus One","year":2002,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Pascal (unit); Computer science; Programming language","score_opus":0.025730031441933403,"score_gpt":0.26016223196514343,"score_spread":0.23443220052321004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246027188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014288853,0.000098794226,0.9329608,0.005911164,0.000033670778,0.00016128499,6.2647825e-7,0.00069375086,0.05871104],"genre_scores_gemma":[0.5663069,0.000011355659,0.43209702,0.0010647922,0.00005244437,0.000024277886,3.894365e-7,0.000012550495,0.00043030333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985961,0.00011550271,0.00033211865,0.00028338388,0.00034156992,0.0003313332],"domain_scores_gemma":[0.99861306,0.00039434736,0.00016420976,0.00066955714,0.000049735125,0.000109109395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029590516,0.00014698693,0.00026350626,0.000055040266,0.00019569098,0.000168532,0.001015958,0.000031658,0.000062730935],"category_scores_gemma":[0.00022976019,0.000102378166,0.00008941367,0.0005369204,0.00023606089,0.00015027235,0.0002901789,0.00018743108,0.0003220018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005496133,0.00035832627,0.000091293994,0.00004318314,0.00006422492,0.000021538008,0.005177019,0.005941028,0.00007439383,0.9251145,0.017508414,0.045600556],"study_design_scores_gemma":[0.000092522896,0.00007366739,0.00008641738,0.000025785446,0.0000068049612,0.000008039587,0.00005498351,0.9267633,0.00011866226,0.07177589,0.00084017013,0.00015378781],"about_ca_topic_score_codex":0.000026592956,"about_ca_topic_score_gemma":0.0000012206954,"teacher_disagreement_score":0.92082226,"about_ca_system_score_codex":0.00004215299,"about_ca_system_score_gemma":0.000012631454,"threshold_uncertainty_score":0.41748604},"labels":[],"label_agreement":null},{"id":"W4246170086","doi":"10.1504/ijwgs.2008.018498","title":"Parallel lossless data compression using the Burrows-Wheeler Transform","year":2008,"lang":"en","type":"article","venue":"International Journal of Web and Grid Services","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Argonne National Laboratory","keywords":"Computer science; Parallel computing; Lossless compression; Speedup; Task parallelism; Distributed memory; Data compression; Parallelism (grammar); Algorithm; Shared memory","score_opus":0.0467440099253441,"score_gpt":0.3089810611127415,"score_spread":0.2622370511873974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246170086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19838198,0.001641694,0.79216987,0.005534571,0.0014969023,0.00008023222,0.000015315381,0.000058759982,0.00062069413],"genre_scores_gemma":[0.9189867,0.0013813253,0.07827899,0.0007624105,0.0005422577,4.4428398e-7,0.0000072532994,0.000005613958,0.00003502333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896115,0.0000492439,0.00031663882,0.00014370221,0.00042947452,0.00009979966],"domain_scores_gemma":[0.99906373,0.00006634126,0.00026690218,0.00024740436,0.00030302026,0.00005261358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030708377,0.00009096812,0.00012540596,0.000100456564,0.00016667138,0.00015494421,0.0023154668,0.00003521082,0.000006622113],"category_scores_gemma":[0.0000058162673,0.00005759829,0.000041678126,0.000089377136,0.000049034574,0.0008991767,0.00033915282,0.00015224163,0.0000010484167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015863267,0.0026878635,0.10004332,0.0004844833,0.0033940617,0.0028619831,0.0460676,0.49432415,0.0175582,0.03677616,0.073644616,0.22057123],"study_design_scores_gemma":[0.0006484647,0.000047595946,0.0022867266,0.00015930923,0.00001178962,0.0013548834,0.00007534483,0.97461665,0.00051948143,0.0010965399,0.019049024,0.00013416632],"about_ca_topic_score_codex":0.000037115213,"about_ca_topic_score_gemma":0.000008598162,"teacher_disagreement_score":0.7206047,"about_ca_system_score_codex":0.000014263732,"about_ca_system_score_gemma":0.00006948584,"threshold_uncertainty_score":0.4302752},"labels":[],"label_agreement":null},{"id":"W4246393721","doi":"10.1145/776024.776025","title":"A retargetable micro-architecture simulator","year":2003,"lang":"en","type":"article","venue":"Proceedings of the 40th conference on Design automation - DAC '03","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture simulator; Computer architecture; Microprocessor; Architecture; Embedded system; Instruction set; System on a chip; Microarchitecture; Cache; Operating system; Computer hardware","score_opus":0.030214962051171714,"score_gpt":0.2535248614603075,"score_spread":0.2233098994091358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246393721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009517672,0.00005777617,0.9716936,0.001217901,0.00018807912,0.000654083,0.000002005743,0.00080331526,0.01586557],"genre_scores_gemma":[0.68926793,0.000010816613,0.30983672,0.00027210606,0.000014389569,0.000022392273,6.640401e-7,0.000013074292,0.0005619138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983293,0.00006766555,0.00040307603,0.0004343064,0.00045808454,0.0003075758],"domain_scores_gemma":[0.9984823,0.00010395203,0.0004599902,0.00035026702,0.0005215377,0.00008193924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081745104,0.00023667242,0.00026421912,0.0001901364,0.00024367795,0.00028200494,0.0013049959,0.00012362671,0.000033389762],"category_scores_gemma":[0.00045446158,0.00017828666,0.0001009217,0.0007024071,0.00007655052,0.00042821883,0.00013721143,0.00023535296,0.000037320657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000581831,0.00040458777,0.0009951681,0.00022913607,0.00008913507,0.0000011468113,0.003528871,0.067602776,0.10984135,0.7860421,0.022379635,0.008827902],"study_design_scores_gemma":[0.0004080589,0.00017688214,0.00036244755,0.00023880653,0.000014451323,0.0000142303825,0.000025578143,0.6122273,0.3227617,0.06182614,0.0015964526,0.00034788792],"about_ca_topic_score_codex":0.0000028543548,"about_ca_topic_score_gemma":9.175208e-8,"teacher_disagreement_score":0.724216,"about_ca_system_score_codex":0.000052058756,"about_ca_system_score_gemma":0.00015759931,"threshold_uncertainty_score":0.7270319},"labels":[],"label_agreement":null},{"id":"W4246649390","doi":"10.32920/ryerson.14653593.v1","title":"Measuring the dynamic energy efficiency of FPGAs over processors","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Field-programmable gate array; Application-specific integrated circuit; Parallel computing; Latency (audio); Efficient energy use; Embedded system; Computer hardware","score_opus":0.018469801542930615,"score_gpt":0.2518632515493319,"score_spread":0.2333934500064013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246649390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007442634,0.00082942843,0.9834908,0.00028221423,0.00028726883,0.00010311323,6.6378675e-7,0.00045430133,0.007109545],"genre_scores_gemma":[0.8937166,0.00016815723,0.105300464,0.00015808719,0.000018925532,0.000020680485,0.0000044612725,0.000011335809,0.0006013061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829924,0.00012127645,0.0003776998,0.00054304255,0.00044347395,0.00021526923],"domain_scores_gemma":[0.9982177,0.00008447902,0.00029210263,0.0010806242,0.00028521408,0.00003986632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041316135,0.00020735018,0.00027453227,0.00013027182,0.000105595296,0.00023384472,0.0021695762,0.00014884042,0.0000137405095],"category_scores_gemma":[0.000068142304,0.00014687526,0.00014939031,0.0004199434,0.00005824879,0.00009724406,0.0023177953,0.00027914735,8.6837014e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034213242,0.00022257694,0.00012295968,0.00026419043,0.0000876351,0.000010686694,0.001953781,0.9400471,0.00032627067,0.0339019,0.00071726495,0.022342205],"study_design_scores_gemma":[0.000055621087,0.000014721477,0.00018117693,0.00015437572,0.0000069588405,0.0000049507676,0.00001587971,0.98785454,0.008698715,0.0026712257,0.00014233626,0.00019952652],"about_ca_topic_score_codex":0.00018770785,"about_ca_topic_score_gemma":0.000026540953,"teacher_disagreement_score":0.8862739,"about_ca_system_score_codex":0.000048302714,"about_ca_system_score_gemma":0.0003098754,"threshold_uncertainty_score":0.5989399},"labels":[],"label_agreement":null},{"id":"W4247144579","doi":"10.1145/3140659.3080216","title":"LogCA","year":2017,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Scheme for Promotion of Academic and Research Collaboration; University of Wisconsin-Madison; National Science Foundation","keywords":"Computer science; Oracle; Interface (matter); Variety (cybernetics); Computer architecture; Embedded system; Efficient energy use; Parallel computing; Computer engineering; Software engineering; Artificial intelligence","score_opus":0.022161563914710247,"score_gpt":0.2852843903068958,"score_spread":0.26312282639218554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247144579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002198751,0.00005846965,0.97938013,0.0104466975,0.0006970532,0.00024043539,0.0000014531548,0.0010563087,0.0059207175],"genre_scores_gemma":[0.20543762,0.000022720576,0.7918811,0.0018228734,0.0005556905,0.00001551811,0.0000035336582,0.000020463527,0.00024049424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781567,0.00014424784,0.00031208553,0.0007665533,0.0004086965,0.00055277155],"domain_scores_gemma":[0.9945664,0.00026799357,0.00024603016,0.004586785,0.00011623371,0.00021657755],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003390647,0.00029872474,0.00030872365,0.00020425211,0.00096997,0.0011143218,0.008089072,0.00011396862,0.000011875052],"category_scores_gemma":[0.00026669758,0.0002602218,0.00016665224,0.00013924211,0.00015991197,0.0004050932,0.0039777234,0.0004487235,0.00007871585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009003062,0.00007274278,0.0019691123,0.000017665123,0.00004012867,0.00006846362,0.00086246175,0.007987651,0.00017305242,0.011415063,0.023460595,0.95392406],"study_design_scores_gemma":[0.0019337626,0.0008157025,0.033577148,0.00020413716,0.00002018598,0.0003610749,0.00000460428,0.48804846,0.005119991,0.23243318,0.23574546,0.0017362754],"about_ca_topic_score_codex":0.0000818909,"about_ca_topic_score_gemma":0.000023698487,"teacher_disagreement_score":0.9521878,"about_ca_system_score_codex":0.000030932046,"about_ca_system_score_gemma":0.0000881248,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W4247158154","doi":"10.32920/ryerson.14661414","title":"Performance and energy optimization of heterogeneous CPU-GPU systems for embedded applications","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; Software; CUDA; Central processing unit; Symmetric multiprocessor system; Power consumption; Energy consumption; Embedded system; Parallelism (grammar); Computer architecture; Power (physics); Computer hardware; Operating system","score_opus":0.01668934640982964,"score_gpt":0.25087234682191606,"score_spread":0.23418300041208642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247158154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025651394,0.0008339904,0.99659556,0.00006153135,0.00015283783,0.00032900623,0.0000065889662,0.000344933,0.0014190141],"genre_scores_gemma":[0.30024058,0.0016009654,0.69710064,0.00009371514,0.000034524688,0.00047670436,0.000094527095,0.000014894955,0.00034343443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987539,0.000065503766,0.00039160225,0.00050194457,0.00014656995,0.00014045002],"domain_scores_gemma":[0.9985047,0.00007768147,0.00030108407,0.000659554,0.0004041275,0.000052858817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021162166,0.00017742696,0.00030047004,0.00013317521,0.00008311039,0.00023575677,0.00052927673,0.0001711378,0.0000016894573],"category_scores_gemma":[0.000009770795,0.0001800113,0.000071757735,0.00015438003,0.000028677625,0.000119895696,0.0006923069,0.00008527775,1.2862645e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015994133,0.000028621425,0.000016033886,0.00021779697,0.0000215688,1.8207575e-7,0.000085828644,0.98951685,0.0000100602265,0.006949496,0.00015732992,0.0029946088],"study_design_scores_gemma":[0.000095692594,0.000032051015,0.0000058608416,0.00009030724,0.000010151449,0.000011651775,0.000008314045,0.99783903,0.00092736655,0.00013144544,0.00066672853,0.00018141737],"about_ca_topic_score_codex":0.000048841033,"about_ca_topic_score_gemma":0.000001916452,"teacher_disagreement_score":0.29998407,"about_ca_system_score_codex":0.000024577603,"about_ca_system_score_gemma":0.00013456416,"threshold_uncertainty_score":0.73406476},"labels":[],"label_agreement":null},{"id":"W4247187044","doi":"10.1109/lpe.2003.1231886","title":"Checkpointing alternatives for high-performance, power-aware processors","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Alias; Parallel computing; Out-of-order execution; Process (computing); Superscalar; Power (physics); Resource (disambiguation); Table (database); Microarchitecture; Distributed computing; Embedded system; Operating system; Computer network; Database","score_opus":0.014323355140714965,"score_gpt":0.2576906787281609,"score_spread":0.24336732358744595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247187044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031827006,0.000021779952,0.95210546,0.0001330838,0.00014883709,0.00018225716,3.9509388e-7,0.00070664013,0.014874551],"genre_scores_gemma":[0.60788304,0.000007558651,0.39096358,0.00013973152,0.000011348153,0.000021735163,7.787069e-7,0.0000059358413,0.0009662843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991273,0.00002444618,0.0001907604,0.0002870663,0.00013123416,0.00023914147],"domain_scores_gemma":[0.99941534,0.00005568249,0.00009281952,0.00023907832,0.00015371291,0.000043348315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030569776,0.00011369391,0.00011741892,0.00009489405,0.0001658469,0.000115191615,0.0004776663,0.000037989998,0.000013276051],"category_scores_gemma":[0.000072790164,0.00009750748,0.000031909123,0.00026311833,0.000018860053,0.00040398998,0.000062328036,0.00005916157,0.000010220682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012379867,0.00022695646,0.0053752456,0.00015098776,0.000056353492,0.0000028607158,0.0016859457,0.018794933,0.00048812808,0.9387782,0.006841662,0.027586348],"study_design_scores_gemma":[0.00092738913,0.00040009466,0.0011693519,0.00008116314,0.000004056162,0.000016423905,0.00006582489,0.6674226,0.3041821,0.015335753,0.009719148,0.000676083],"about_ca_topic_score_codex":0.0000028911054,"about_ca_topic_score_gemma":2.6085786e-7,"teacher_disagreement_score":0.9234424,"about_ca_system_score_codex":0.000016545886,"about_ca_system_score_gemma":0.000048648864,"threshold_uncertainty_score":0.39762396},"labels":[],"label_agreement":null},{"id":"W4247329450","doi":"10.1145/2544173.2509525","title":"Multiverse","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Excellence Research Chairs, Government of Canada; Georgia Institute of Technology; National Science Foundation","keywords":"Computer science; Scalability; Speculative execution; Speculative multithreading; Task parallelism; Speculation; Implicit parallelism; Parallel computing; Commit; Exploit; Programming paradigm; Instruction-level parallelism; Parallelism (grammar); Semantics (computer science); Programming language; Multithreading; Thread (computing); Operating system","score_opus":0.019980055376845447,"score_gpt":0.2529514713999429,"score_spread":0.23297141602309746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247329450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051426847,0.00009137607,0.92621815,0.0022428078,0.00031330815,0.00025120546,0.0000010983237,0.0015580959,0.017897112],"genre_scores_gemma":[0.6214615,0.0000050160907,0.37771088,0.00041373886,0.000029686678,0.0000077591885,0.0000015472326,0.0000034394945,0.0003664454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935436,0.00003690568,0.00010943852,0.00020961439,0.000121657795,0.00016801772],"domain_scores_gemma":[0.9990873,0.00016643947,0.00006165249,0.0005544063,0.00006877582,0.000061470455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008710967,0.00008212903,0.000080663944,0.00006548393,0.0000896212,0.00018033193,0.00117179,0.000037697348,0.000070256785],"category_scores_gemma":[0.00013176374,0.0000710565,0.000026208076,0.00015560107,0.00002345145,0.0005462985,0.00031115854,0.00006669468,0.00068610953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013625744,0.00052499905,0.030064242,0.0000904378,0.0001402652,0.00008144754,0.008553207,0.027762832,0.004118767,0.10110545,0.35089362,0.4766511],"study_design_scores_gemma":[0.0005101663,0.00015431868,0.026374903,0.00004046343,0.000008116552,0.000011005474,0.00009288045,0.93207425,0.007359986,0.012722259,0.02003249,0.0006191818],"about_ca_topic_score_codex":0.00013434321,"about_ca_topic_score_gemma":0.0000024713627,"teacher_disagreement_score":0.9043114,"about_ca_system_score_codex":0.000009739213,"about_ca_system_score_gemma":0.000013764581,"threshold_uncertainty_score":0.88187784},"labels":[],"label_agreement":null},{"id":"W4247380146","doi":"10.1145/2490301.2451157","title":"Traffic management","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Locality; Operating system; Linux kernel; Page fault; Embedded system; Virtual memory; Memory management; Computer network; Semiconductor memory","score_opus":0.01037751646823844,"score_gpt":0.23471069714375423,"score_spread":0.22433318067551578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247380146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063860235,0.00006993524,0.9813314,0.0053095706,0.00036475065,0.0006411961,4.978255e-7,0.0017144515,0.0041821795],"genre_scores_gemma":[0.11519151,0.000027408712,0.88112754,0.0029108594,0.00024439246,0.000087524124,0.0000058687256,0.000022907238,0.0003819876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766517,0.00017306491,0.00036803822,0.00075408746,0.00044243157,0.000597188],"domain_scores_gemma":[0.997535,0.00021321425,0.000098209,0.0018308723,0.00009938721,0.00022331173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019494601,0.00031400274,0.00026737768,0.00035658584,0.00020523714,0.0004637282,0.0034682492,0.00008473461,0.0000457034],"category_scores_gemma":[0.000020785545,0.00026963305,0.00014410933,0.0006000623,0.0000632095,0.0002910435,0.0018578933,0.00034446074,0.0003127845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018139848,0.0000650752,0.000053919088,0.000021310405,0.000036990674,0.000019122972,0.0005948219,0.058267616,0.00002979593,0.003608411,0.03546611,0.901835],"study_design_scores_gemma":[0.0010689374,0.0004419362,0.0047575813,0.00011048261,0.000014535673,0.00014905026,0.000013597502,0.84891886,0.0004937728,0.057871114,0.08512206,0.0010380689],"about_ca_topic_score_codex":0.000029337838,"about_ca_topic_score_gemma":0.0000041027024,"teacher_disagreement_score":0.90079695,"about_ca_system_score_codex":0.000039701914,"about_ca_system_score_gemma":0.000029605753,"threshold_uncertainty_score":0.99997556},"labels":[],"label_agreement":null},{"id":"W4247387602","doi":"10.1109/icse.2013.6606621","title":"Efficient construction of approximate call graphs for JavaScript IDE services","year":2013,"lang":"en","type":"article","venue":"2013 35th International Conference on Software Engineering (ICSE)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"JavaScript; Computer science; Programming language; World Wide Web","score_opus":0.016177509138652738,"score_gpt":0.23898127288234497,"score_spread":0.22280376374369223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247387602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898534,0.000032119475,0.9786594,0.00025469705,0.0008975881,0.00032106726,0.000019866518,0.00055338757,0.00027652524],"genre_scores_gemma":[0.42547277,0.000024105468,0.5741561,0.00008182697,0.000039163708,0.0000847015,0.000022087885,0.000014069417,0.000105184976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987168,0.00001725577,0.00036991065,0.00034192263,0.00032564742,0.00022849868],"domain_scores_gemma":[0.9986397,0.00009083077,0.00019561636,0.00031406348,0.00067799125,0.000081795355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017637432,0.00019439062,0.00020013587,0.00027735985,0.000057959285,0.00016728177,0.0008301687,0.00008796225,0.000037182712],"category_scores_gemma":[0.000077523924,0.00019008682,0.0000919733,0.00016073637,0.000035746634,0.00019748013,0.00013032951,0.00013062861,0.00002107094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014236189,0.00011577265,0.0008939063,0.00019393976,0.00010203894,0.0000012236615,0.00043835695,0.30470112,0.0011068132,0.6789462,0.0019220656,0.011564365],"study_design_scores_gemma":[0.00023612367,0.00006766358,0.0006063684,0.00014498144,0.000004025502,0.000006343489,0.000011582944,0.99293995,0.0019924527,0.0033051406,0.00048778558,0.00019757061],"about_ca_topic_score_codex":0.000103214574,"about_ca_topic_score_gemma":0.0000012386311,"teacher_disagreement_score":0.68823886,"about_ca_system_score_codex":0.00004849328,"about_ca_system_score_gemma":0.000040664218,"threshold_uncertainty_score":0.77515155},"labels":[],"label_agreement":null},{"id":"W4247449641","doi":"10.22215/etd/2014-10389","title":"FPGA Based Coprocessors for Clouds","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Field-programmable gate array; Computer science; Coprocessor; Embedded system; Flexibility (engineering); Control reconfiguration; Cloud computing; FPGA prototype; Reconfigurable computing; Computer architecture; Operating system","score_opus":0.01481757470800952,"score_gpt":0.28647411837238995,"score_spread":0.2716565436643804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247449641","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001028816,0.000056177072,0.96239614,0.00014685777,0.0005632138,0.00029233223,0.000001768098,0.0011339352,0.035306714],"genre_scores_gemma":[0.041260432,0.000010849882,0.91892207,0.0010796364,0.00015800823,0.00017947204,0.0005517868,0.00004111522,0.03779666],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998844,0.000028309067,0.00026224443,0.00044831692,0.0002004588,0.00021667003],"domain_scores_gemma":[0.99883765,0.00013319614,0.00020485032,0.00045279742,0.00031026825,0.00006126616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027567934,0.00020931722,0.0002493411,0.00015424743,0.00013348853,0.00017270511,0.0009931423,0.00023384271,0.000017766894],"category_scores_gemma":[0.00008241885,0.00019438719,0.00012337495,0.00021095834,0.000008025465,0.00008527581,0.000023957185,0.00011402531,0.00002024681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014457779,0.0003094846,0.000035104487,0.0019130958,0.00010382716,0.0000035182634,0.0009698091,0.03074237,0.00014442179,0.26209202,0.46233663,0.24120513],"study_design_scores_gemma":[0.0003340182,0.0001339288,0.000033567227,0.00010251828,0.000012594934,5.018684e-7,0.000008425378,0.93436146,0.01784955,0.006578773,0.040133014,0.00045163816],"about_ca_topic_score_codex":0.0000105499,"about_ca_topic_score_gemma":0.000014801507,"teacher_disagreement_score":0.9036191,"about_ca_system_score_codex":0.000023042201,"about_ca_system_score_gemma":0.00016741375,"threshold_uncertainty_score":0.79268795},"labels":[],"label_agreement":null},{"id":"W4247840886","doi":"10.1109/cgo.2003.1191552","title":"Dynamic profiling and trace cache generation","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Profiling (computer programming); Java; Cache; TRACE (psycholinguistics); Call graph; Parallel computing; Graph; Distributed computing; Programming language; Theoretical computer science","score_opus":0.01981977167301733,"score_gpt":0.2608434750925566,"score_spread":0.2410237034195393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247840886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012234323,0.00016665501,0.9806585,0.00016339947,0.00005145435,0.00006229444,5.809596e-8,0.0002999658,0.0063633546],"genre_scores_gemma":[0.4373077,0.000014044491,0.5621486,0.00007660086,0.0000032709313,0.0000023763482,4.575606e-7,0.0000017138858,0.00044528223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995757,0.00004179886,0.000079145844,0.00016271076,0.000058377416,0.000082265076],"domain_scores_gemma":[0.99977183,0.000013635432,0.000021794907,0.00013744987,0.000027937633,0.000027369295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018346017,0.000048319467,0.00004459249,0.00003596797,0.000078162535,0.00008794928,0.00009817192,0.000026365557,0.0000031095187],"category_scores_gemma":[0.000023818391,0.000042632546,0.0000095651085,0.00010629906,0.000008698783,0.00015155692,0.000022562894,0.000037956484,0.0000031680759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.224338e-7,0.00006132875,0.00092648115,0.0000148648,0.000010324461,0.000004350631,0.0005234512,0.020921936,0.0138085475,0.9178305,0.0015861602,0.044311233],"study_design_scores_gemma":[0.000055834553,0.000014455015,0.00006201163,0.0000016185921,6.907614e-7,0.000010958124,0.000004061589,0.98000264,0.018064512,0.001222202,0.0004943634,0.00006667083],"about_ca_topic_score_codex":0.0000024621793,"about_ca_topic_score_gemma":0.000001846397,"teacher_disagreement_score":0.9590807,"about_ca_system_score_codex":0.000010166249,"about_ca_system_score_gemma":0.000018394192,"threshold_uncertainty_score":0.17385048},"labels":[],"label_agreement":null},{"id":"W4248503218","doi":"10.1145/2508148.2485947","title":"Cooperative boosting","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Boosting (machine learning); Workload; Computer science; Power management; Central processing unit; Performance improvement; Supercomputer; Parallel computing; Computer engineering; Coupling (piping); Thermal; Efficient energy use; Computational science; Power (physics); Operating system; Artificial intelligence; Engineering; Electrical engineering","score_opus":0.014169024254918595,"score_gpt":0.24972456115949027,"score_spread":0.23555553690457168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248503218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005258209,0.0000795204,0.9831064,0.0059326584,0.0003185832,0.0005345944,8.784e-7,0.0014279069,0.0033412604],"genre_scores_gemma":[0.14967056,0.000010343218,0.84557647,0.004035509,0.0003740532,0.000062636005,0.000006802344,0.000023432698,0.00024020192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976022,0.00027070448,0.0003980024,0.00074271235,0.0003875277,0.00059885235],"domain_scores_gemma":[0.9973133,0.0005968145,0.0001263311,0.001464444,0.00026445574,0.00023466347],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023170607,0.00032873463,0.0003124048,0.00025618015,0.00032098044,0.00059851405,0.0028601913,0.00010000877,0.000049559298],"category_scores_gemma":[0.00018947564,0.00027496048,0.00011731586,0.0006071147,0.000086130225,0.00044162959,0.0018895759,0.0004908134,0.00023231108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003940344,0.00008961169,0.00069689844,0.000020035981,0.000050923893,0.000022203676,0.0029020468,0.054019485,0.0009405144,0.0064115995,0.049336094,0.88550663],"study_design_scores_gemma":[0.00082540046,0.000599147,0.0037219175,0.000120877674,0.000007808624,0.00017886108,0.00001620549,0.90991837,0.0042777457,0.04905577,0.030268963,0.0010089471],"about_ca_topic_score_codex":0.00014212642,"about_ca_topic_score_gemma":0.0000091142865,"teacher_disagreement_score":0.8844977,"about_ca_system_score_codex":0.000041483134,"about_ca_system_score_gemma":0.00009054598,"threshold_uncertainty_score":0.99997026},"labels":[],"label_agreement":null},{"id":"W4248578803","doi":"10.1145/1449955.1449796","title":"Analyzing the performance of code-copying virtual machines","year":2008,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bytecode; Copying; Programming language; Virtual machine; Just-in-time compilation; Interpreter; Parallel computing; PowerPC; Operating system; Pentium; Software","score_opus":0.02563609218180765,"score_gpt":0.26194069591475094,"score_spread":0.2363046037329433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248578803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683076,0.00021713122,0.22985762,0.0003678799,0.00012354448,0.0000645425,0.000001376389,0.00023754644,0.0008227009],"genre_scores_gemma":[0.9262697,0.00009658428,0.073361725,0.000101694655,0.000043764485,0.0000025647876,0.0000017520179,0.0000050506487,0.00011718252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991969,0.00006213304,0.00021695023,0.00018887853,0.0001742742,0.00016089398],"domain_scores_gemma":[0.99877,0.00035752647,0.00016679603,0.0006080646,0.000067704925,0.000029880648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028339415,0.000099839424,0.00013658701,0.00008042743,0.0003051425,0.000042394913,0.0015430056,0.000033169476,0.0000062145523],"category_scores_gemma":[0.00012629661,0.00006829727,0.000040661005,0.00031953093,0.0000837302,0.00030777015,0.00031661318,0.00010895218,0.0000101766655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724267,0.00023043815,0.4176972,0.00013675001,0.00016906425,0.00004209075,0.014165405,0.42916277,0.0031748102,0.015107793,0.00799355,0.1120529],"study_design_scores_gemma":[0.00013228212,0.00013479352,0.013756234,0.00004066977,0.00000744743,0.000023437959,0.00001730655,0.9766544,0.008453009,0.00012836872,0.00048980705,0.00016225986],"about_ca_topic_score_codex":0.00003216422,"about_ca_topic_score_gemma":0.0000033234608,"teacher_disagreement_score":0.5474916,"about_ca_system_score_codex":0.000007239915,"about_ca_system_score_gemma":0.00003153571,"threshold_uncertainty_score":0.2867314},"labels":[],"label_agreement":null},{"id":"W4248718854","doi":"10.1007/978-1-4939-7131-2_100853","title":"Parallel Processing","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.027134776399590006,"score_gpt":0.2608005634580602,"score_spread":0.2336657870584702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248718854","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.147587e-8,0.00014444867,0.506381,0.00011062657,0.00006399024,0.00005821064,2.4674006e-7,0.0008863521,0.49235514],"genre_scores_gemma":[0.000043791788,0.000040486037,0.4486272,0.00037999873,0.00012190255,0.0000023022455,0.0000031555526,0.000016616777,0.55076456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988224,0.0000076765755,0.00025206956,0.0004829645,0.0002448194,0.00019009293],"domain_scores_gemma":[0.9989558,0.00001829745,0.00018011681,0.0005863818,0.00018714539,0.0000722655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014221316,0.00024247702,0.00022219161,0.00014581633,0.00012369467,0.00022974356,0.0010406999,0.00022952592,0.00036674482],"category_scores_gemma":[0.000006695641,0.00021560132,0.000084335494,0.000038616046,0.00006438265,0.00018796693,0.0003576025,0.00017790201,0.0005589544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015572426,0.000008221959,6.427806e-7,0.000023109344,0.000014101077,0.000010152963,0.0001287861,0.000108343105,8.0128814e-7,0.80619353,0.13856173,0.054949053],"study_design_scores_gemma":[0.00009510098,0.00007467137,0.0000013601999,0.00016343614,0.0000068755253,0.000022079466,6.138469e-7,0.118435405,0.00004255574,0.23372899,0.6469053,0.0005236235],"about_ca_topic_score_codex":0.0000014402626,"about_ca_topic_score_gemma":9.727172e-7,"teacher_disagreement_score":0.5724645,"about_ca_system_score_codex":0.000031411324,"about_ca_system_score_gemma":0.00010913617,"threshold_uncertainty_score":0.87919664},"labels":[],"label_agreement":null},{"id":"W4249623003","doi":"10.1145/2490301.2451118","title":"GPUDet","year":2013,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Parallel computing; Debugging; Scalability; Nondeterministic algorithm; Thread (computing); Compiler; Multi-core processor; Massively parallel; Correctness; Graphics; Programming language; Operating system; Theoretical computer science","score_opus":0.01180817367756907,"score_gpt":0.24224857403433173,"score_spread":0.23044040035676266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249623003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004258449,0.00007445989,0.9817758,0.008268911,0.00039976498,0.00046013252,7.919642e-7,0.0016768175,0.0030848666],"genre_scores_gemma":[0.10763651,0.000014648917,0.88704044,0.004529779,0.0004146174,0.0000612615,0.000006522798,0.000024233052,0.0002719862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762917,0.00021121862,0.0003791214,0.000732941,0.0004345926,0.0006129377],"domain_scores_gemma":[0.99708533,0.00039540246,0.00011469835,0.001977559,0.00016570956,0.00026128837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002120016,0.00031702296,0.0002978784,0.00030117232,0.00021424703,0.0005207641,0.0037196178,0.000110610024,0.00006727052],"category_scores_gemma":[0.00009128851,0.0002677428,0.00014734328,0.00057782914,0.00007714843,0.00038770665,0.001995013,0.00044223745,0.0003857519],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002698746,0.00008230717,0.000638873,0.000017037555,0.000033972607,0.000015672307,0.0011590691,0.01510389,0.00042461322,0.005441293,0.08539848,0.8916821],"study_design_scores_gemma":[0.0010413353,0.00066340086,0.009220078,0.0000998658,0.000009886125,0.00025043933,0.000008518337,0.66575027,0.003270099,0.2020507,0.11634247,0.0012929378],"about_ca_topic_score_codex":0.00014440472,"about_ca_topic_score_gemma":0.000008193902,"teacher_disagreement_score":0.89038914,"about_ca_system_score_codex":0.00003572516,"about_ca_system_score_gemma":0.00007156389,"threshold_uncertainty_score":0.99997747},"labels":[],"label_agreement":null},{"id":"W4249705231","doi":"10.1109/waccpd.2016.011","title":"Exploring Compiler Optimization Opportunities for the OpenMP 4.× Accelerator Model on a POWER8+GPU Platform","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; CUDA; Parallel computing; Software portability; Programming paradigm; General-purpose computing on graphics processing units; Programming language; Fortran; Computer architecture; Operating system; Graphics","score_opus":0.38834546499576017,"score_gpt":0.30807562516932063,"score_spread":0.08026983982643954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249705231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035809298,0.000013743521,0.9870837,0.0044174604,0.00020320399,0.00037692476,0.0000050736626,0.00067188253,0.006869944],"genre_scores_gemma":[0.32094887,0.00039602438,0.671594,0.0025008188,0.00009629347,0.00035932433,0.00000463555,0.000028615406,0.0040714266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989605,0.0000204654,0.00024455722,0.00030443093,0.00021062024,0.00025940273],"domain_scores_gemma":[0.998791,0.00033933434,0.00009455753,0.0005326717,0.00016974035,0.00007268809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034032346,0.0001599647,0.00013728622,0.00010752238,0.00033573518,0.00025646118,0.00094213756,0.000042400337,0.000023489045],"category_scores_gemma":[0.000042327963,0.00008488556,0.00006896216,0.00013064766,0.000037647947,0.0012226677,0.00021718338,0.00005593151,0.0000084026005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025436852,0.000043006647,0.000004269745,0.0000047843537,0.000018204159,9.205789e-7,0.000278488,0.7034607,0.0000390247,0.23637594,0.012547169,0.04720206],"study_design_scores_gemma":[0.00032413704,0.00009036827,0.0000068282525,0.00003517595,0.0000031563131,0.0000018016705,0.00004844978,0.9926497,0.0023793273,0.0011715553,0.00311781,0.00017169178],"about_ca_topic_score_codex":0.0000035458543,"about_ca_topic_score_gemma":8.2168947e-7,"teacher_disagreement_score":0.32059076,"about_ca_system_score_codex":0.000047293317,"about_ca_system_score_gemma":0.000074946896,"threshold_uncertainty_score":0.3461533},"labels":[],"label_agreement":null},{"id":"W4249831684","doi":"10.1109/micro.2016.7783708","title":"Data-centric execution of speculative parallel programs","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Computer science; Exploit; Locality; Scalability; Speculative multithreading; Serialization; Parallel computing; Scheduling (production processes); Speculative execution; Distributed computing; Multi-core processor; Task parallelism; Parallelism (grammar); Multithreading; Operating system; Thread (computing); Computer security","score_opus":0.05028740776377373,"score_gpt":0.28999131630427377,"score_spread":0.23970390854050005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249831684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006540372,0.00003725574,0.9922813,0.00047906884,0.00005569409,0.00013431351,0.0000023796474,0.00040710185,0.005948842],"genre_scores_gemma":[0.44437423,0.000036720827,0.5548819,0.000038220467,0.000017330714,0.0000034230618,0.0000073581773,0.0000031593106,0.0006377038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999151,0.00004710852,0.0001955029,0.00028886375,0.00017143902,0.00014611332],"domain_scores_gemma":[0.99893945,0.000045823082,0.00010847965,0.0007684751,0.0000962261,0.00004154652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021851817,0.00007397635,0.00010454419,0.00007141163,0.000032441112,0.000028382325,0.0009865081,0.00003309549,0.000014280436],"category_scores_gemma":[0.000037033107,0.000044919227,0.000025758778,0.00029750608,0.000041958196,0.00042649632,0.00042230313,0.000025135703,0.000021662841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010870302,0.000260902,0.0026227587,0.000011644935,0.000032577715,0.000004500185,0.0001607055,0.00028809553,0.00047467576,0.42410994,0.010326785,0.5616965],"study_design_scores_gemma":[0.0017382915,0.0004655273,0.0065009478,0.0002000147,0.00001682488,0.000025162111,0.000022387194,0.9104321,0.011208641,0.03430469,0.034355093,0.00073032215],"about_ca_topic_score_codex":0.000011073868,"about_ca_topic_score_gemma":0.0000014576194,"teacher_disagreement_score":0.91014403,"about_ca_system_score_codex":0.000017093918,"about_ca_system_score_gemma":0.000031736632,"threshold_uncertainty_score":0.1833194},"labels":[],"label_agreement":null},{"id":"W4249895474","doi":"10.1145/1837855.1806670","title":"A graph theoretic approach to cache-conscious placement of data for direct mapped caches","year":2010,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Cache pollution; Cache algorithms; Parallel computing; Cache coloring; Cache invalidation; Bottleneck; Cache-oblivious algorithm; Page cache; Smart Cache; Optimizing compiler; CPU cache; Compiler; Operating system; Embedded system","score_opus":0.04559014292249517,"score_gpt":0.2956529427253662,"score_spread":0.250062799802871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249895474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018354602,0.000077337856,0.9736174,0.00058922666,0.00024791274,0.00066563685,0.00007793626,0.00038828354,0.0059816893],"genre_scores_gemma":[0.52257985,0.0000029884586,0.47712487,0.00012272714,0.000035351168,0.000028749735,0.000042784308,0.000007732384,0.00005498161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860716,0.00006316235,0.00027859604,0.00055870664,0.00022019735,0.00027219314],"domain_scores_gemma":[0.9968873,0.0006146508,0.00016531168,0.0021382887,0.00009384544,0.000100595775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008848399,0.00016154163,0.00024155468,0.00016768424,0.00011861557,0.00011507435,0.0037049653,0.00007462707,0.000003819596],"category_scores_gemma":[0.00054786674,0.00013780339,0.00004616554,0.00030007915,0.000080660815,0.0002544589,0.0009714543,0.000119159886,0.0000046214614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007060417,0.003977059,0.011920348,0.00194431,0.00097472756,0.000021115886,0.02919741,0.09058173,0.026201403,0.5626183,0.15815225,0.1137053],"study_design_scores_gemma":[0.0015238081,0.00069098175,0.0011762714,0.00010812793,0.00012638426,0.000021428077,0.00027267213,0.93416643,0.02942399,0.017282585,0.013966384,0.0012409452],"about_ca_topic_score_codex":0.000065873515,"about_ca_topic_score_gemma":0.000033369473,"teacher_disagreement_score":0.8435847,"about_ca_system_score_codex":0.000007066133,"about_ca_system_score_gemma":0.000058730806,"threshold_uncertainty_score":0.6884809},"labels":[],"label_agreement":null},{"id":"W4250011564","doi":"10.1109/isss.2001.957927","title":"Current consumption dynamics at instruction and program level for a VLIW DSP processor","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Very long instruction word; Computer science; Digital signal processing; Computer architecture; Digital signal processor; Construct (python library); Energy consumption; Embedded system; Multi-core processor; Parallel computing; Computer hardware; Engineering; Electrical engineering","score_opus":0.06688769916289479,"score_gpt":0.31435667810908346,"score_spread":0.2474689789461887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250011564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01927712,0.000263881,0.97837013,0.00029973095,0.00013568127,0.00048448014,0.0000029587695,0.0008463176,0.0003196866],"genre_scores_gemma":[0.25812322,0.000489394,0.7405824,0.000074057505,0.000032171658,0.00015465243,0.000011883963,0.000007758701,0.00052446645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993309,0.000014600967,0.00014758654,0.00026237025,0.0000972013,0.00014738608],"domain_scores_gemma":[0.99961126,0.000025275349,0.000072138864,0.00014747892,0.00009546743,0.00004839383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093068404,0.00008925687,0.00008377806,0.000071995746,0.00016196375,0.000115173454,0.00016713161,0.0000366512,0.000006006684],"category_scores_gemma":[0.00002084979,0.000080590486,0.00002423493,0.00012495264,0.000034405322,0.00023009023,0.000104326486,0.00004877128,0.0000064473465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000390496,0.00009440113,0.0016084799,0.0000750771,0.0000045540323,1.5841886e-7,0.00014494607,0.00017116187,0.000008547187,0.022550065,0.0018882994,0.9734504],"study_design_scores_gemma":[0.0003253782,0.00009026178,0.000750705,0.000021902508,0.0000029538687,0.000017708153,0.0000018708424,0.99391437,0.00027901866,0.0014697119,0.0030093624,0.000116738796],"about_ca_topic_score_codex":0.000002261203,"about_ca_topic_score_gemma":0.000011653911,"teacher_disagreement_score":0.99374324,"about_ca_system_score_codex":0.000060418544,"about_ca_system_score_gemma":0.000007371917,"threshold_uncertainty_score":0.32863846},"labels":[],"label_agreement":null},{"id":"W4250074569","doi":"10.1007/978-0-387-39940-9_3733","title":"Synchronization Join","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Join (topology); Synchronization (alternating current); Computer science; Computer security; Computer network; Mathematics; Combinatorics","score_opus":0.014447829312713682,"score_gpt":0.23657332871365155,"score_spread":0.22212549940093787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250074569","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.553151e-7,0.0016052373,0.511916,0.00003042246,0.00048480806,0.0002640551,0.0000643471,0.00033196333,0.4853028],"genre_scores_gemma":[0.0010958805,0.0074582817,0.1557644,0.00011484282,0.0009639502,0.000023081184,0.0011062707,0.0000948535,0.83337843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978129,0.000058442016,0.00076671486,0.0005907102,0.00054198515,0.0002292321],"domain_scores_gemma":[0.9974485,0.00008439618,0.00071919797,0.0013922681,0.0002480631,0.0001075803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040273124,0.00035450858,0.0005448485,0.00034678407,0.00007774476,0.00007968508,0.0010859127,0.00025377198,0.000028216677],"category_scores_gemma":[0.000052812196,0.00035601633,0.00011269135,0.00011440781,0.000043585296,0.00037542215,0.0002907066,0.00026267348,0.00009297722],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046710143,0.000054927947,0.000011384235,0.00040591724,0.000067117806,0.000057030666,0.00016011622,0.0029451936,0.000009950709,0.81415945,0.13338251,0.04874173],"study_design_scores_gemma":[0.00023147694,0.0001381296,0.0000062856498,0.0013526238,0.00003591078,0.000041791674,0.0000026934258,0.06964588,0.00003722249,0.0026710255,0.9251464,0.00069056224],"about_ca_topic_score_codex":0.000035270128,"about_ca_topic_score_gemma":0.000002226545,"teacher_disagreement_score":0.8114884,"about_ca_system_score_codex":0.0000769059,"about_ca_system_score_gemma":0.00021261076,"threshold_uncertainty_score":0.9998892},"labels":[],"label_agreement":null},{"id":"W4250302035","doi":"10.1109/icpp.2004.1327909","title":"Non-uniform dependences partitioned by recurrence chains","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotonic function; Lexicographical order; Loop (graph theory); Set (abstract data type); Computer science; Dataflow; Parallelism (grammar); Parallel computing; Algorithm; Mathematics; Topology (electrical circuits); Combinatorics; Mathematical analysis","score_opus":0.014561089321611684,"score_gpt":0.2561223052985181,"score_spread":0.2415612159769064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250302035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013166479,0.00004888902,0.9842229,0.0014980002,0.000118263226,0.000091097245,9.4869955e-7,0.00065161975,0.012051639],"genre_scores_gemma":[0.61775744,0.00008397968,0.38098958,0.0005268949,0.000019862495,0.000013296242,0.0000044159465,0.0000033783647,0.0006011556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991528,0.00001200436,0.00016290799,0.00026878552,0.00019524885,0.00020826631],"domain_scores_gemma":[0.9994788,0.000017962013,0.0000593226,0.00029987382,0.00006585391,0.00007814576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017713394,0.00009636441,0.0000897669,0.00005820128,0.00016138508,0.00013351763,0.0006652382,0.000045996694,0.000014126033],"category_scores_gemma":[0.000016137501,0.00008376548,0.00003282293,0.0003169165,0.00003230521,0.00042982452,0.000117204014,0.000079527796,0.00007452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010009686,0.0006153653,0.001106077,0.00004216712,0.00003580597,0.000027824808,0.0024048379,0.086938664,0.0010769872,0.78940487,0.0722569,0.046080492],"study_design_scores_gemma":[0.0011262929,0.0004760617,0.0004712885,0.00015576872,0.000005742566,0.000048672733,0.00006748618,0.7869703,0.1182267,0.08294598,0.00849232,0.0010133765],"about_ca_topic_score_codex":0.00006934799,"about_ca_topic_score_gemma":0.000012350483,"teacher_disagreement_score":0.70645887,"about_ca_system_score_codex":0.000032837597,"about_ca_system_score_gemma":0.00006452647,"threshold_uncertainty_score":0.34158573},"labels":[],"label_agreement":null},{"id":"W4250908905","doi":"10.1109/superc.1994.344281","title":"Affinity scheduling of unbalanced workloads","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Cache; Context switch; Dynamic priority scheduling; Distributed computing; Embedded system; Operating system; Mathematical optimization","score_opus":0.028755779705183625,"score_gpt":0.24622979721197444,"score_spread":0.21747401750679082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250908905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051737013,0.00010744879,0.953079,0.0002800884,0.000059495353,0.000034958244,9.374472e-8,0.00048142544,0.040783785],"genre_scores_gemma":[0.54635143,0.000022125649,0.4532102,0.00008796083,0.000008471988,8.961353e-7,9.395077e-8,0.0000015034044,0.0003173183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994602,0.000024979585,0.00014932027,0.00014285497,0.00010945109,0.000113194525],"domain_scores_gemma":[0.9995031,0.000044983834,0.00006139608,0.00029702132,0.000060315346,0.000033202108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012525138,0.000056098666,0.00009434078,0.000059086073,0.000041246,0.000030514893,0.0004502383,0.000032755615,0.00006002638],"category_scores_gemma":[0.000036427915,0.000050295806,0.00003287998,0.00033505296,0.000018910716,0.00013406684,0.000111049056,0.000056466168,0.000026078884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007875071,0.0006898459,0.009059153,0.000059461563,0.00005811633,0.000012450948,0.002005308,0.17399333,0.0031143709,0.51556164,0.021114588,0.27432385],"study_design_scores_gemma":[0.00011230821,0.000029055416,0.00031437117,0.000016981021,8.196789e-7,0.0000020313316,0.0000032741798,0.98514646,0.012327593,0.0016130683,0.0003455111,0.000088503315],"about_ca_topic_score_codex":0.0000045662086,"about_ca_topic_score_gemma":3.3977508e-7,"teacher_disagreement_score":0.8111532,"about_ca_system_score_codex":0.000007010854,"about_ca_system_score_gemma":0.0000061621286,"threshold_uncertainty_score":0.20510034},"labels":[],"label_agreement":null},{"id":"W4251050559","doi":"10.1109/ishls.1994.302339","title":"An integrated approach to retargetable code generation","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Compiler; Computer science; Code generation; Parallelism (grammar); Code (set theory); Programming language; Variety (cybernetics); Parallel computing; Set (abstract data type); Integer programming; Register allocation; Integer (computer science); Instruction set; Theoretical computer science; Computer architecture; Artificial intelligence; Algorithm; Operating system","score_opus":0.0495727157901932,"score_gpt":0.2576696069958403,"score_spread":0.2080968912056471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251050559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054582517,0.00002689391,0.95781696,0.0002915394,0.00006410587,0.00010833344,4.981451e-7,0.0010174992,0.04012837],"genre_scores_gemma":[0.22961864,0.0000051386887,0.7672628,0.0007231746,0.000037146005,0.000009995181,0.000008395721,0.0000045626666,0.0023301023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992136,0.000060655704,0.0001365543,0.000308344,0.0001260489,0.00015481359],"domain_scores_gemma":[0.9993418,0.0000060246894,0.000025895963,0.00043631985,0.00009324257,0.00009670605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001807159,0.00008323374,0.00008388817,0.000094144874,0.00010422778,0.00021645281,0.0005309322,0.000041356256,0.00003991112],"category_scores_gemma":[0.000014944455,0.00007060681,0.00001859849,0.0004448968,0.000007118228,0.00037897902,0.00005175427,0.00005886889,0.00007137984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020293257,0.0005649625,0.00015393057,0.000005333745,0.000013280395,0.0000020592026,0.0016810648,0.48855227,0.0053985333,0.13104804,0.3040333,0.068545185],"study_design_scores_gemma":[0.000047716963,0.000050448245,0.000015119209,0.0000012795721,6.8856576e-7,0.0000032210712,0.000004099496,0.98196626,0.0063830805,0.00010210229,0.011318112,0.00010785297],"about_ca_topic_score_codex":0.000022510634,"about_ca_topic_score_gemma":0.0000026835357,"teacher_disagreement_score":0.493414,"about_ca_system_score_codex":0.00002130197,"about_ca_system_score_gemma":0.000008282895,"threshold_uncertainty_score":0.28792623},"labels":[],"label_agreement":null},{"id":"W4251138498","doi":"10.1109/sc.2016.79","title":"Extended Task Queuing: Active Messages for Heterogeneous Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Samsung; MediaTek","keywords":"Remote direct memory access; Computer science; Message queue; Latency (audio); Cloud computing; Context (archaeology); Distributed computing; Task (project management); Node (physics); Queueing theory; Operating system; InfiniBand; Computer network","score_opus":0.018520234826186352,"score_gpt":0.26763988434591374,"score_spread":0.24911964951972737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251138498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046291575,0.00009392201,0.99475074,0.0005007262,0.00023565086,0.0002772205,0.000003665318,0.0010050632,0.0026701125],"genre_scores_gemma":[0.8616578,0.000026458838,0.13461323,0.00014226676,0.00005621271,0.00008154048,9.3922307e-7,0.000010569072,0.0034110097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908274,0.000052560765,0.00017214862,0.0003348674,0.00012816252,0.00022951346],"domain_scores_gemma":[0.99914026,0.00018432167,0.00008588653,0.00038964185,0.00013448135,0.00006540725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001756428,0.000113532486,0.00014163356,0.000075441436,0.0001026033,0.000111823756,0.0005595457,0.000055895118,0.000004562889],"category_scores_gemma":[0.000037820937,0.00007104654,0.00006286732,0.0001013148,0.000022638638,0.00023854902,0.000120441786,0.000025603687,0.00001447472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009827306,0.00028036733,0.00007296001,0.0000773831,0.00019806006,0.000023936258,0.00075385044,0.007929029,0.01847726,0.5365628,0.03785545,0.39767063],"study_design_scores_gemma":[0.0015028049,0.00078680203,0.00013970448,0.00018002903,0.000015312517,0.000102403304,0.000032799908,0.7156334,0.2148279,0.018237116,0.04759897,0.000942767],"about_ca_topic_score_codex":0.000009473849,"about_ca_topic_score_gemma":0.0000010314835,"teacher_disagreement_score":0.86119485,"about_ca_system_score_codex":0.000042287516,"about_ca_system_score_gemma":0.0000325605,"threshold_uncertainty_score":0.28971937},"labels":[],"label_agreement":null},{"id":"W4251535115","doi":"10.7873/date.2013.023","title":"Cherry-Picking: Exploiting Process Variations in Dark-Silicon Homogeneous Chip Multi-Processors","year":2013,"lang":"en","type":"article","venue":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2013","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Exploit; Chip; Homogeneous; Power budget; Silicon; Multi-core processor; Transistor; Process (computing); Power (physics); Parallel computing; Engineering; Electrical engineering; Operating system; Materials science; Physics; Telecommunications; Optoelectronics","score_opus":0.07524619814323491,"score_gpt":0.2960998187543781,"score_spread":0.22085362061114316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251535115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08515718,0.00007657003,0.9088619,0.0008952648,0.00018750483,0.0013721896,0.000013080385,0.0018699009,0.0015664457],"genre_scores_gemma":[0.68677634,0.00013061921,0.31100395,0.00034236856,0.000060959937,0.00047467023,0.00023891898,0.000061705614,0.0009104486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99488854,0.00080469105,0.0015051889,0.001278809,0.0006693119,0.0008534463],"domain_scores_gemma":[0.9955265,0.0005793503,0.0008981423,0.0011175998,0.0016242095,0.00025422158],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014037973,0.0006278316,0.00057637534,0.0010614457,0.00041013263,0.0011951004,0.0014636256,0.00030912645,0.0003492741],"category_scores_gemma":[0.0021969285,0.0006718361,0.000082202685,0.0026848563,0.00013179705,0.0025253214,0.00029547507,0.00059784495,0.0018399331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089702124,0.008179548,0.040293235,0.0015108554,0.00016403256,0.00007804984,0.067107834,0.5997947,0.15432882,0.027393723,0.028842786,0.072216704],"study_design_scores_gemma":[0.0019868822,0.00013071635,0.044064682,0.0010871189,0.00002300238,0.000103209284,0.000106532614,0.9367114,0.0040308265,0.00553195,0.0042196587,0.0020040572],"about_ca_topic_score_codex":0.00043961275,"about_ca_topic_score_gemma":0.00038266368,"teacher_disagreement_score":0.6016192,"about_ca_system_score_codex":0.00014092265,"about_ca_system_score_gemma":0.00045840797,"threshold_uncertainty_score":0.99984175},"labels":[],"label_agreement":null},{"id":"W4252037250","doi":"10.1145/1168919.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Optimizing compiler; Abstract interpretation; Compiler; Probabilistic logic; Correctness; Algorithm; Test suite; Theoretical computer science; Static analysis; Programming language; Parallel computing; Test case; Artificial intelligence","score_opus":0.01450668868269466,"score_gpt":0.262033830360134,"score_spread":0.24752714167743933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252037250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012825513,0.000040903153,0.9926664,0.003058365,0.00016489699,0.0008083417,0.000013368223,0.000888327,0.0010768473],"genre_scores_gemma":[0.12563244,0.0000021999956,0.8728415,0.00069369894,0.00034878872,0.000102101025,0.00008895669,0.00002316723,0.00026719665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755925,0.00018460552,0.0005185374,0.0008811812,0.0003314276,0.0005249782],"domain_scores_gemma":[0.99720025,0.00074687426,0.00019249128,0.0014319276,0.00030474298,0.00012369225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002723044,0.00033367935,0.0004457825,0.0007193174,0.00028977563,0.00035976013,0.0019382439,0.00009807124,0.000013756395],"category_scores_gemma":[0.00013268119,0.00029550018,0.00041945602,0.0016883049,0.00009278272,0.00018727187,0.00078392145,0.00022646901,0.00000819575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000109103,0.0001054588,0.00062278996,0.000014669898,0.0001692255,0.0000047644385,0.00042931462,0.96444494,0.00002208684,0.019313168,0.0046889493,0.010173731],"study_design_scores_gemma":[0.00055757764,0.00017659852,0.0025604535,0.0000184648,0.00008427369,0.000012192855,0.0000018205203,0.9077023,0.00020200183,0.08356357,0.004765198,0.0003555414],"about_ca_topic_score_codex":0.00009620088,"about_ca_topic_score_gemma":0.00010825668,"teacher_disagreement_score":0.12434989,"about_ca_system_score_codex":0.000071865165,"about_ca_system_score_gemma":0.00008431189,"threshold_uncertainty_score":0.9999497},"labels":[],"label_agreement":null},{"id":"W4252251451","doi":"10.1037/e405612008-001","title":"CAMHD's performance during the third quarter of FY2007","year":2007,"lang":"en","type":"dataset","venue":"PsycEXTRA Dataset","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); History; Archaeology","score_opus":0.014679774952874062,"score_gpt":0.27764903507793637,"score_spread":0.26296926012506233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252251451","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041307445,0.00021815523,0.028998228,0.00012303014,0.00043386646,0.00025781352,0.9696254,0.00014640478,0.00015580672],"genre_scores_gemma":[0.00015634998,0.00046313932,0.010526138,0.00042885006,0.00017777043,0.000010348748,0.9881852,0.00001136011,0.000040833944],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975089,0.00011021605,0.0006703269,0.0006172786,0.00060458813,0.0004887187],"domain_scores_gemma":[0.9961986,0.00015255045,0.000512861,0.0029403477,0.00009557555,0.00010007824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009496491,0.0003731453,0.00038548294,0.00029857608,0.00025706686,0.00015762889,0.0040249764,0.00025778505,0.000063906096],"category_scores_gemma":[0.00003701568,0.00027583973,0.00009980453,0.00054661155,0.0001426503,0.00035410692,0.000651596,0.00063667755,0.0001722497],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011893835,0.00006376098,0.000014821243,0.00015305827,0.000027298767,0.000013007027,0.000024974763,0.0001775262,0.000003373994,0.000038392613,0.9991092,0.00036269054],"study_design_scores_gemma":[0.00019309802,0.000074683834,0.00026413664,0.00010608934,0.000021180493,0.00006288508,0.0000043436335,0.002763256,0.00028098453,0.000029449027,0.9958517,0.00034821036],"about_ca_topic_score_codex":0.00014506305,"about_ca_topic_score_gemma":0.000025676825,"teacher_disagreement_score":0.018559821,"about_ca_system_score_codex":0.000039873332,"about_ca_system_score_gemma":0.000081605685,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W4252503621","doi":"10.1145/1168917.1168908","title":"A probabilistic pointer analysis for speculative optimizations","year":2006,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pointer analysis; Computer science; Pointer (user interface); Abstract interpretation; Optimizing compiler; Compiler; Correctness; Probabilistic logic; Test suite; Static analysis; Theoretical computer science; Algorithm; Programming language; Parallel computing; Test case; Artificial intelligence","score_opus":0.027627607431398225,"score_gpt":0.2985828050386919,"score_spread":0.27095519760729364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252503621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059147715,0.013139812,0.9818547,0.00089704414,0.00011704283,0.0015439107,0.000008852428,0.0004544164,0.001925117],"genre_scores_gemma":[0.13176532,0.0007044203,0.86393166,0.00061682466,0.00018438666,0.0008156765,0.00012918065,0.00003089103,0.0018216199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792767,0.00025501242,0.00079654384,0.0005361929,0.00021593124,0.00026867795],"domain_scores_gemma":[0.99771863,0.00032465166,0.00030372237,0.0010760981,0.00052118715,0.00005573533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081111625,0.00021910688,0.00060016906,0.00016397364,0.0002793794,0.00039432046,0.0010007636,0.00005496249,0.000010268871],"category_scores_gemma":[0.0008147389,0.00018271974,0.00025446084,0.001426074,0.000025694604,0.0002815576,0.00021194373,0.0000823648,0.00001321967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.164118e-7,0.00009378032,0.0005127441,0.0013475503,0.00021811484,0.000003525061,0.00011297279,0.88805497,0.000016617401,0.09569176,0.013202435,0.00074472476],"study_design_scores_gemma":[0.0001870331,0.000059559545,0.0000857081,0.0014915259,0.0002086936,0.000010104431,0.0000044794306,0.99210924,0.000024169827,0.00071410753,0.0047897142,0.0003156864],"about_ca_topic_score_codex":0.00011079189,"about_ca_topic_score_gemma":0.000008417303,"teacher_disagreement_score":0.13170618,"about_ca_system_score_codex":0.00007309913,"about_ca_system_score_gemma":0.00006711495,"threshold_uncertainty_score":0.74510944},"labels":[],"label_agreement":null},{"id":"W4252708373","doi":"10.1007/978-1-4614-6170-8_100669","title":"Graphics Processors","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graphics; Computer graphics (images)","score_opus":0.01888696533996612,"score_gpt":0.23839587327374767,"score_spread":0.21950890793378156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252708373","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0735152e-8,0.000058307356,0.5143785,0.00017234457,0.00006602528,0.00005322308,2.4495495e-7,0.00083862315,0.48443267],"genre_scores_gemma":[0.00030869927,0.00013960946,0.17605285,0.001114495,0.00008256032,0.0000037060142,0.000005509326,0.00002368876,0.8222689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989504,0.000009015872,0.00022414842,0.0004115331,0.0002515635,0.0001533156],"domain_scores_gemma":[0.99895513,0.00004203851,0.00016038775,0.0006217569,0.00015158078,0.00006913218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017851825,0.00022057504,0.00022282047,0.00020362443,0.000079861944,0.00012290687,0.001059375,0.0002436079,0.00005028748],"category_scores_gemma":[0.000012326679,0.00019627708,0.00009953178,0.000049522645,0.000040238872,0.000068328336,0.00024569558,0.00023081855,0.0001523396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.507589e-7,0.0000019137,6.033444e-7,0.0000122957235,0.0000072135417,0.0000016582562,0.000013965913,0.00007018529,1.2282486e-7,0.96880805,0.023354892,0.0077288295],"study_design_scores_gemma":[0.000054703796,0.00004919194,0.0000012545171,0.000070248774,0.0000054112347,0.000009203749,9.368682e-8,0.0628052,0.000049704704,0.252607,0.6839744,0.00037359315],"about_ca_topic_score_codex":0.0000024555923,"about_ca_topic_score_gemma":0.0000013989778,"teacher_disagreement_score":0.71620107,"about_ca_system_score_codex":0.000014538172,"about_ca_system_score_gemma":0.000055443128,"threshold_uncertainty_score":0.80039465},"labels":[],"label_agreement":null},{"id":"W4252757135","doi":"10.1145/1454497.1454487","title":"A buffer container class hierarchy using Ada 2005","year":2008,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Abstraction; Container (type theory); Interface (matter); Set (abstract data type); Notation; Programming language; Implementation; Class (philosophy); Prefix; Class hierarchy; Hierarchy; Object-oriented programming; Operating system","score_opus":0.032939550573299566,"score_gpt":0.2526945720623003,"score_spread":0.21975502148900072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252757135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16518334,0.00013356628,0.8242054,0.008936015,0.0002890813,0.00016739611,0.0000013730719,0.00068647164,0.00039735684],"genre_scores_gemma":[0.5172266,0.000027846483,0.46336654,0.018852653,0.00019177013,0.000011974712,0.000004820729,0.00002693563,0.00029089375],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808687,0.0001259905,0.00032312342,0.0005050195,0.00041852065,0.0005404625],"domain_scores_gemma":[0.99836385,0.00020071144,0.00013253932,0.0010752245,0.00007519676,0.0001525012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022022681,0.00024198242,0.00025205404,0.00018478745,0.00033157362,0.00010977823,0.0015446788,0.00008311029,0.000021121858],"category_scores_gemma":[0.000102674836,0.00023412736,0.000105508814,0.00038718403,0.00011774831,0.0004889315,0.0005181188,0.00026013903,0.000028090806],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007337793,0.00030103375,0.011174263,0.000060991795,0.00023128159,0.0014258142,0.0036468871,0.118590266,0.056780588,0.006687693,0.79304004,0.007987794],"study_design_scores_gemma":[0.0022507615,0.00019997876,0.0033810006,0.00019313255,0.000035095578,0.00089190283,0.000044022392,0.8048025,0.023809161,0.0016617256,0.1605076,0.0022231254],"about_ca_topic_score_codex":0.00023429209,"about_ca_topic_score_gemma":0.000007785698,"teacher_disagreement_score":0.68621224,"about_ca_system_score_codex":0.00012324666,"about_ca_system_score_gemma":0.00011383973,"threshold_uncertainty_score":0.9547437},"labels":[],"label_agreement":null},{"id":"W4253363606","doi":"10.1145/965519.965521","title":"Particle system collision detection using graphics hardware","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graphics; Collision; Computer graphics (images); Collision detection; Particle system; Graphics hardware; Computer security","score_opus":0.02681625085406321,"score_gpt":0.25644830372334826,"score_spread":0.22963205286928506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253363606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043677215,0.00004822697,0.9524839,0.000020478225,0.00018081123,0.00008713275,1.303937e-7,0.0009691191,0.002533023],"genre_scores_gemma":[0.83376265,0.000003794171,0.16606711,0.00006187653,0.000009103675,0.0000029690452,1.357343e-7,0.0000043915866,0.00008796821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921113,0.00010492899,0.00016176509,0.00020933227,0.00015674753,0.00015611862],"domain_scores_gemma":[0.99947125,0.000028216038,0.000056898534,0.00028843468,0.000099466204,0.000055738365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033029908,0.00007448082,0.000080619575,0.000061910156,0.00021692488,0.00012792279,0.00019946598,0.00004767889,0.0000025967795],"category_scores_gemma":[0.00003484731,0.00006752555,0.000037096634,0.0005362524,0.000011961242,0.00023865831,0.000044160213,0.000054462656,0.000010126846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004577035,0.00007734433,0.0012253615,0.00004177447,0.000016007994,0.0000131924,0.0002680112,0.08912318,0.0031651254,0.9012332,0.00034723905,0.0044849664],"study_design_scores_gemma":[0.00009035261,0.000025174746,0.000049752452,0.0000154225,0.0000021212957,0.000027987158,0.000020569198,0.8993406,0.09907058,0.00038688674,0.0008791271,0.00009140716],"about_ca_topic_score_codex":0.000038133585,"about_ca_topic_score_gemma":0.0000029871032,"teacher_disagreement_score":0.90084636,"about_ca_system_score_codex":0.00005095868,"about_ca_system_score_gemma":0.000026242054,"threshold_uncertainty_score":0.27536118},"labels":[],"label_agreement":null},{"id":"W4253645498","doi":"10.1109/ipdps.2006.1639292","title":"A new analytical method for parallel, diffusion-type load balancing","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Mathematical proof; Load balancing (electrical power); Obstacle; Distributed computing; Key (lock); Type (biology); Diffusion; Algorithm; Parallel computing; Theoretical computer science; Mathematics","score_opus":0.016864215644226462,"score_gpt":0.30146008057567036,"score_spread":0.2845958649314439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253645498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000069543596,0.000101006684,0.9858494,0.0011635976,0.00013069244,0.0001598548,2.6140617e-7,0.00077187596,0.011753811],"genre_scores_gemma":[0.0058289915,0.000006251635,0.9844972,0.0005483608,0.00013409014,0.000004918786,0.000003064065,0.000007916608,0.008969221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889696,0.000039702853,0.00023739217,0.00034908165,0.00021053493,0.0002663487],"domain_scores_gemma":[0.999147,0.00020178134,0.000058186353,0.0003517709,0.00015119105,0.00009007373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035389976,0.00012235847,0.00017331482,0.000073595664,0.000111986716,0.00014590143,0.0005038855,0.00006824287,0.000028539149],"category_scores_gemma":[0.00007292737,0.000102433965,0.00007955921,0.00036476878,0.00000869279,0.00014585155,0.00015132417,0.0000663225,0.000018775649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021464175,0.00008484664,0.0006442793,0.00001206805,0.00001627811,0.000005077321,0.00008366784,0.027933717,0.00035628158,0.55773264,0.35727203,0.05583764],"study_design_scores_gemma":[0.0002954216,0.000063975654,0.00026537015,0.0000076815795,0.0000047818958,0.0000072283997,0.0000014914306,0.9440699,0.0004581731,0.02488059,0.029792713,0.00015263246],"about_ca_topic_score_codex":0.000349735,"about_ca_topic_score_gemma":0.00002316265,"teacher_disagreement_score":0.9161362,"about_ca_system_score_codex":0.00004844239,"about_ca_system_score_gemma":0.0001602421,"threshold_uncertainty_score":0.41771358},"labels":[],"label_agreement":null},{"id":"W4253842829","doi":"10.1109/micro.2001.991118","title":"Mapping reference code to irregular DSPs within the retargetable, optimizing compiler COGEN(T)","year":2005,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Compiler; Unreachable code; Dead code; Parallel computing; Code generation; Code (set theory); Programming language; Object code; Schedule; Redundant code; Set (abstract data type); Abstraction; Instruction set; Operating system","score_opus":0.036201402764350965,"score_gpt":0.2640738767487433,"score_spread":0.2278724739843923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253842829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014187049,0.0001465683,0.9672544,0.0060284063,0.00013441517,0.00027056795,0.0000014312437,0.0010651567,0.02368033],"genre_scores_gemma":[0.22461277,0.0000131800925,0.7686234,0.0042935316,0.00007414866,0.000019137568,0.0000031623574,0.00001187419,0.002348798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982169,0.00013295075,0.00040973377,0.00051105075,0.00034895889,0.00038036692],"domain_scores_gemma":[0.9985246,0.000100826364,0.00013278902,0.0009254843,0.00017429765,0.00014200294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087911054,0.00020447232,0.00021268084,0.00014140872,0.00040988938,0.00033091256,0.0017062607,0.00007468133,0.00004170515],"category_scores_gemma":[0.000053799733,0.00014616131,0.000056609828,0.0007121199,0.0000465071,0.0003886538,0.0005638347,0.00023773462,0.00017308987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000095726555,0.00007716268,0.00019495438,0.000011633241,0.00004083546,0.000006297319,0.0032431846,0.78847915,0.0014035368,0.14017259,0.049688797,0.01667227],"study_design_scores_gemma":[0.00014627705,0.000036426583,0.00020768901,0.000040949944,0.0000029925354,0.000020446472,0.00006296151,0.9203099,0.007175294,0.00083705375,0.07085729,0.00030270006],"about_ca_topic_score_codex":0.000027971917,"about_ca_topic_score_gemma":0.000019522266,"teacher_disagreement_score":0.22319406,"about_ca_system_score_codex":0.00005781476,"about_ca_system_score_gemma":0.000067674315,"threshold_uncertainty_score":0.59602857},"labels":[],"label_agreement":null},{"id":"W4254059104","doi":"10.1145/2714064.2660218","title":"MIX10","year":2014,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Programming language; MATLAB; Concurrency; Set (abstract data type); Parallel computing","score_opus":0.016994453282950704,"score_gpt":0.25460416065250485,"score_spread":0.23760970736955414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254059104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070305667,0.000049057937,0.9711375,0.0013590291,0.00022297227,0.00004883683,3.842438e-7,0.00085899007,0.019292632],"genre_scores_gemma":[0.64503014,0.000003816727,0.35399,0.0006678624,0.0000701518,0.0000022737688,0.0000018462467,0.000004112899,0.00022980988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999275,0.00006381491,0.0001224794,0.00022823075,0.00014073,0.00016968897],"domain_scores_gemma":[0.99884737,0.0002676547,0.00006836199,0.0007206562,0.000038993152,0.00005698997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025915413,0.00008439293,0.00009636758,0.000065288164,0.00009716916,0.00014589686,0.0014128222,0.000040705367,0.000011125984],"category_scores_gemma":[0.00026731964,0.00007428339,0.000027957552,0.00016216876,0.000020481912,0.00022735975,0.00028352233,0.00007002852,0.00013329618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015471482,0.00022566525,0.011904112,0.00008027592,0.000059169277,0.000023457142,0.0024428866,0.025301911,0.0009968827,0.48988354,0.09773421,0.3713324],"study_design_scores_gemma":[0.00036516011,0.00020632523,0.005565242,0.0000404393,0.000008711115,0.000012942397,0.000010268768,0.842205,0.0069841673,0.030666944,0.11343039,0.0005043985],"about_ca_topic_score_codex":0.00001769604,"about_ca_topic_score_gemma":0.0000031334748,"teacher_disagreement_score":0.8169031,"about_ca_system_score_codex":0.000006551744,"about_ca_system_score_gemma":0.0000121242,"threshold_uncertainty_score":0.30291888},"labels":[],"label_agreement":null},{"id":"W4254311668","doi":"10.1109/lpe.2003.1231881","title":"ESTIMA: an architectural-level power estimator for multi-ported pipelined register files","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Register file; Porting; Computer science; Estimator; Latency (audio); Parallel computing; Operating system; Instruction set","score_opus":0.08525196346300903,"score_gpt":0.33041551618287573,"score_spread":0.2451635527198667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254311668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012039909,0.00002714874,0.9947479,0.0003531512,0.00017838951,0.00036031666,0.0000062427093,0.0011917956,0.0019310862],"genre_scores_gemma":[0.1301311,7.4495455e-7,0.8664316,0.00058440666,0.000015394788,0.000038517905,0.000012753835,0.000017244862,0.0027682467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855846,0.00007699505,0.0003315533,0.00052743056,0.00016140631,0.0003441524],"domain_scores_gemma":[0.99871385,0.00010889323,0.000121653866,0.00070581766,0.00019751313,0.0001522531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035153,0.00021097912,0.00021020045,0.00013398839,0.00019849926,0.00019139868,0.00065332855,0.00008480155,0.000037897393],"category_scores_gemma":[0.00031861232,0.00017521702,0.00008918557,0.0002315986,0.000048160455,0.00030304588,0.00007596253,0.00009705561,0.00001510048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001335403,0.0021607785,0.0023872487,0.00014882776,0.00018130385,0.00007417362,0.0035619733,0.092957646,0.0025509908,0.64450675,0.121200226,0.13013653],"study_design_scores_gemma":[0.0006533793,0.00014503338,0.00070303906,0.00001581182,0.000004695571,0.00006193907,0.000009024495,0.98808,0.0040769926,0.002746712,0.0031715739,0.0003317472],"about_ca_topic_score_codex":0.000017086673,"about_ca_topic_score_gemma":0.000008363785,"teacher_disagreement_score":0.8951224,"about_ca_system_score_codex":0.00002216697,"about_ca_system_score_gemma":0.000087481785,"threshold_uncertainty_score":0.71451426},"labels":[],"label_agreement":null},{"id":"W4254434605","doi":"10.1002/spe.991","title":"Synchronization for fast and reentrant operating system kernel tracing","year":2010,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Tracing; Interrupt; Kernel (algebra); Debugging; Linux kernel; Thread (computing); Synchronization (alternating current); Semaphore; Operating system; TRACE (psycholinguistics); Parallel computing; Real-time computing; Distributed computing; Embedded system; Computer network; Microcontroller","score_opus":0.010428097089244892,"score_gpt":0.275977691069655,"score_spread":0.26554959398041006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254434605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023740869,0.00019522039,0.97474676,0.00031013627,0.00019356226,0.0002045287,0.0000010515214,0.00044566387,0.00016220576],"genre_scores_gemma":[0.5495762,0.000028625524,0.4501786,0.00012709491,0.000036809997,0.000031453204,0.000001101622,0.0000049927216,0.000015107838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911714,0.000039138966,0.00018410219,0.00035654253,0.000120784476,0.00018226965],"domain_scores_gemma":[0.99906886,0.00035022895,0.00011844196,0.00022119167,0.00016349685,0.0000778097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036873063,0.00010690844,0.00010934363,0.000041613966,0.00045243822,0.0004230396,0.00020978888,0.0000631297,8.952452e-7],"category_scores_gemma":[0.00079735275,0.00010014495,0.000015219488,0.00013250024,0.000051106883,0.0013581318,0.00010588238,0.00013118828,9.030791e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070343616,0.00020693871,0.006583073,0.0006710571,0.000050614963,0.00004726879,0.1032668,0.0037966492,0.009117796,0.10138518,0.0005028333,0.77430147],"study_design_scores_gemma":[0.0003936542,0.00013388686,0.00031726525,0.00012668778,0.000013451104,0.00041166894,0.0031607088,0.98896325,0.0040467097,0.0001691571,0.001916441,0.0003471375],"about_ca_topic_score_codex":0.000032596225,"about_ca_topic_score_gemma":0.0000026741654,"teacher_disagreement_score":0.9851666,"about_ca_system_score_codex":0.000012983846,"about_ca_system_score_gemma":0.000038381302,"threshold_uncertainty_score":0.40837926},"labels":[],"label_agreement":null},{"id":"W4254516222","doi":"10.1145/1993498.1993573","title":"Synchronization via scheduling","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Electronic Arts (Canada); Simon Fraser University; University of British Columbia","funders":"","keywords":"Computer science; Debugging; Programmer; Scheduling (production processes); Synchronization (alternating current); Task parallelism; Distributed computing; Parallel computing; Dependency graph; Dependency (UML); Graph; Task (project management); Parallelism (grammar); Theoretical computer science; Programming language; Software engineering","score_opus":0.025604506551455748,"score_gpt":0.23959588488275185,"score_spread":0.2139913783312961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254516222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019823076,0.000021754253,0.94434696,0.00004782326,0.000078488425,0.000036799855,1.9103227e-8,0.00097109604,0.05429881],"genre_scores_gemma":[0.47142416,0.0000030901213,0.5283126,0.00012239764,0.000008949608,0.0000013028456,2.9607725e-7,0.0000019393892,0.00012524704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957186,0.000017930366,0.000094398165,0.00014605431,0.0000703325,0.000099427154],"domain_scores_gemma":[0.99964476,0.000008295473,0.000031818752,0.00022674252,0.000056141806,0.00003223808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010354804,0.00004924303,0.00004502181,0.00005679321,0.000062534404,0.00003504247,0.0003526537,0.000027577305,0.00006887775],"category_scores_gemma":[0.0000111274485,0.00004457224,0.000016919617,0.0002106849,0.0000097976035,0.00024883,0.000095358264,0.00003502576,0.000065431566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027030464,0.00013154623,0.0023224326,0.000010880003,0.000016131931,0.000008597972,0.0017269034,0.008269028,0.00021538744,0.7819384,0.001336391,0.20402165],"study_design_scores_gemma":[0.000044393906,0.000021912581,0.00024324657,0.000004068933,7.0459663e-7,0.000005251202,0.000002140699,0.98234725,0.006240605,0.010872177,0.00013882601,0.00007943808],"about_ca_topic_score_codex":0.000017195138,"about_ca_topic_score_gemma":5.85302e-7,"teacher_disagreement_score":0.97407824,"about_ca_system_score_codex":0.000010927314,"about_ca_system_score_gemma":0.000015504978,"threshold_uncertainty_score":0.18176031},"labels":[],"label_agreement":null},{"id":"W4254630438","doi":"10.1145/1508284.1508281","title":"Phantom-BTB","year":2009,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Granularity; Working set; Overhead (engineering); Random access; Parallel computing; Table (database); Embedded system; Operating system; Database","score_opus":0.021253206978345544,"score_gpt":0.27922439181900605,"score_spread":0.2579711848406605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254630438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013211447,0.00031405894,0.95206136,0.0046671703,0.0002688032,0.00012086908,0.0000011485039,0.0018186601,0.02753647],"genre_scores_gemma":[0.72299373,0.000014971579,0.27530318,0.0013717365,0.000069717535,0.0000012984399,0.0000024738338,0.0000030471779,0.00023982748],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991606,0.000038902188,0.00014906457,0.0002614649,0.00017611723,0.00021384774],"domain_scores_gemma":[0.99901086,0.00011857435,0.00007842572,0.0006787027,0.000046318455,0.00006709918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001743409,0.00010502056,0.00011288163,0.000089105124,0.000108841174,0.00018103766,0.0015111866,0.000047557336,0.000012296509],"category_scores_gemma":[0.00012209448,0.00009379094,0.00003499144,0.0002538587,0.000015650277,0.0003653439,0.00014184449,0.00008344732,0.00008691188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003076326,0.0004885583,0.0029337753,0.000032982458,0.000053233805,0.00015858759,0.0034135499,0.016086003,0.0026617027,0.2233522,0.098336205,0.65245247],"study_design_scores_gemma":[0.0013030611,0.0011873207,0.027708763,0.00015351272,0.00003159376,0.00007974727,0.000045993318,0.7374968,0.039890517,0.11833516,0.07205095,0.001716593],"about_ca_topic_score_codex":0.000009486961,"about_ca_topic_score_gemma":0.0000013522866,"teacher_disagreement_score":0.72141075,"about_ca_system_score_codex":0.00001099696,"about_ca_system_score_gemma":0.00002189646,"threshold_uncertainty_score":0.38246837},"labels":[],"label_agreement":null},{"id":"W4254689785","doi":"10.1145/2517326.2451541","title":"A modular approach to on-stack replacement in LLVM","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compiler; Just-in-time compilation; Modular design; Programming language; Optimizing compiler; Operating system; Interrupt; Dynamic compilation; Virtual machine; Code generation; Embedded system; Parallel computing; Key (lock)","score_opus":0.026329957680627594,"score_gpt":0.2605417547975208,"score_spread":0.2342117971168932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254689785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12418299,0.000043880376,0.8432951,0.0026822,0.00016214803,0.00074174895,0.0000013553033,0.00062006904,0.02827052],"genre_scores_gemma":[0.6075126,0.0000028667666,0.39093822,0.0011842904,0.000025005962,0.000055835837,0.0000032307928,0.0000063667544,0.00027156473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987273,0.00007381494,0.00022368687,0.0004510246,0.00024395452,0.00028021508],"domain_scores_gemma":[0.9986577,0.00012723896,0.00006840142,0.0009962735,0.000049954822,0.000100412966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027844735,0.00013704311,0.00015167678,0.00019824447,0.00006231164,0.00021373195,0.0013825718,0.00005197268,0.0000135395085],"category_scores_gemma":[0.00015749678,0.000121462486,0.000027072538,0.00038494088,0.000012969167,0.00026922682,0.00039182164,0.00011470042,0.00025935483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006907035,0.001490121,0.009382026,0.000117395284,0.0000643818,0.000026164218,0.009708523,0.7586639,0.001107499,0.082438625,0.0986508,0.03828149],"study_design_scores_gemma":[0.00035989867,0.0003198305,0.0097490065,0.00005898281,0.00000230392,0.000003125844,0.00006149922,0.9807005,0.0011549601,0.0032432673,0.0039677257,0.00037893484],"about_ca_topic_score_codex":0.00015383614,"about_ca_topic_score_gemma":0.0000042344946,"teacher_disagreement_score":0.48332962,"about_ca_system_score_codex":0.000039820457,"about_ca_system_score_gemma":0.00002069275,"threshold_uncertainty_score":0.49530965},"labels":[],"label_agreement":null},{"id":"W4254905260","doi":"10.1145/1272998.1273000","title":"JIT instrumentation","year":2007,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Instrumentation (computer programming); x86; Computer science; Debugging; Operating system; Profiling (computer programming); Embedded system; Linux kernel; Computer hardware; Software","score_opus":0.028529086964582773,"score_gpt":0.3162919382443155,"score_spread":0.2877628512797327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254905260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058792444,0.0325411,0.9583869,0.0007148025,0.00046059687,0.0006526857,5.235399e-7,0.000692314,0.005963184],"genre_scores_gemma":[0.3921908,0.008923303,0.5941752,0.003360391,0.00027159302,0.00009025316,0.00002016412,0.000032087693,0.0009361963],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982864,0.0001655017,0.00064687146,0.0003479666,0.0002908726,0.00026234487],"domain_scores_gemma":[0.9984753,0.00015253098,0.00022100702,0.00089021795,0.00017796332,0.0000829648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021252104,0.00015624105,0.0002937341,0.00007484275,0.00020429042,0.00025206548,0.0010788199,0.000052818792,0.0000070930687],"category_scores_gemma":[0.00050328247,0.00013470836,0.00005987509,0.0005286928,0.000014441813,0.00041962494,0.0002554979,0.000121248166,0.00008032233],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002913416,0.00020255124,0.0038848901,0.0071434174,0.00010732311,0.00008563785,0.0013767167,0.0048914207,0.0014816627,0.15753862,0.061450385,0.76183444],"study_design_scores_gemma":[0.0023335216,0.0011850718,0.00227243,0.06429901,0.00015362754,0.0012076894,0.00027006646,0.4270609,0.00980901,0.0017646594,0.4849468,0.004697217],"about_ca_topic_score_codex":0.000052376126,"about_ca_topic_score_gemma":0.0000016514131,"teacher_disagreement_score":0.75713724,"about_ca_system_score_codex":0.000061172985,"about_ca_system_score_gemma":0.000048159174,"threshold_uncertainty_score":0.54932475},"labels":[],"label_agreement":null},{"id":"W4255096096","doi":"10.1109/aspdac.2005.1466524","title":"XTW: a parallel and distributed logic simulator","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rollback; Computer science; Queue; Scheduling (production processes); Parallel computing; Schedule; Logic simulation; Distributed computing; Discrete event simulation; Logic gate; Real-time computing; Simulation; Computer network; Algorithm; Operating system; Engineering; Database transaction","score_opus":0.02255839538384482,"score_gpt":0.23686956836543874,"score_spread":0.2143111729815939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255096096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011070982,0.0002523677,0.98054457,0.00268778,0.0000726163,0.00067778456,0.0000148882355,0.0006778666,0.0040011555],"genre_scores_gemma":[0.8409752,0.0000827473,0.15791525,0.00010030372,0.000045726196,0.00002793383,0.000004041428,0.000012812247,0.0008359782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801373,0.000059010938,0.0005455024,0.0005266928,0.0004038713,0.00045121674],"domain_scores_gemma":[0.99860317,0.00009405226,0.000517904,0.00026380896,0.0003386752,0.00018241361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330579,0.00030815453,0.0003808768,0.0001958124,0.00033448223,0.0004420937,0.0007138398,0.00018222247,0.000022217642],"category_scores_gemma":[0.00014699028,0.00023717633,0.00007661333,0.00034176564,0.00018364876,0.0006667887,0.00025221249,0.00020904066,0.000013279701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003592444,0.0013809986,0.023710623,0.0008772005,0.00063101226,0.000006774865,0.030339956,0.07723159,0.009825999,0.68411505,0.102694176,0.06882738],"study_design_scores_gemma":[0.0006113579,0.00007685197,0.0029266845,0.00012016037,0.000032364384,0.000021492957,0.00040765456,0.9846091,0.001567986,0.00706264,0.0022021814,0.0003615275],"about_ca_topic_score_codex":0.0000026063722,"about_ca_topic_score_gemma":4.77835e-7,"teacher_disagreement_score":0.9073775,"about_ca_system_score_codex":0.000044175602,"about_ca_system_score_gemma":0.00010989873,"threshold_uncertainty_score":0.967177},"labels":[],"label_agreement":null},{"id":"W4255208150","doi":"10.1007/978-1-4939-7131-2_100447","title":"Graphics Processors","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graphics; Computer graphics (images)","score_opus":0.023669597628712128,"score_gpt":0.251146550177716,"score_spread":0.22747695254900385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255208150","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.6945299e-7,0.00006583505,0.4925684,0.000114739014,0.00008734534,0.000060014783,4.6668478e-7,0.00087085634,0.50623214],"genre_scores_gemma":[0.0000844483,0.00014394544,0.20861709,0.0007428893,0.00012354858,0.000003119975,0.000004921311,0.000021703743,0.79025835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989329,0.000006542864,0.00021622298,0.00043211313,0.00025305687,0.0001591826],"domain_scores_gemma":[0.99889666,0.000026437441,0.00015083425,0.0006231895,0.00023611003,0.000066796674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014903011,0.00021753817,0.00019120898,0.00020825928,0.0000920222,0.00013221173,0.0011017486,0.00024886534,0.00025666802],"category_scores_gemma":[0.000010534019,0.00019284774,0.000090540016,0.00006247613,0.00007436578,0.00012827541,0.00030307393,0.00018842523,0.00033909656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3211398e-7,0.0000036803767,5.4324073e-7,0.000009878459,0.000010597025,0.00000303013,0.00004944543,0.000009411313,1.6572963e-7,0.9188842,0.07875001,0.002278566],"study_design_scores_gemma":[0.00005030164,0.00007723325,0.0000010546522,0.00007664608,0.000005606928,0.000011141843,2.8959352e-7,0.025651904,0.000107615866,0.40153405,0.5721078,0.00037636928],"about_ca_topic_score_codex":0.000001996331,"about_ca_topic_score_gemma":0.000001894525,"teacher_disagreement_score":0.5173502,"about_ca_system_score_codex":0.000017131315,"about_ca_system_score_gemma":0.00007888076,"threshold_uncertainty_score":0.7864103},"labels":[],"label_agreement":null},{"id":"W4255323088","doi":"10.1145/2692956.2663181","title":"Safe parallel programming in ada with language extensions","year":2014,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Programming language; Concurrency; Compiler; Syntax; Programming paradigm; Parallel programming model; Parallelism (grammar); Parallel computing; Artificial intelligence","score_opus":0.00908914508692225,"score_gpt":0.23240769346300777,"score_spread":0.22331854837608553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255323088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082462616,0.00005848021,0.90879756,0.0073556565,0.000081126665,0.00021049772,2.952969e-7,0.00054049393,0.00049329776],"genre_scores_gemma":[0.45237815,0.0000031946433,0.5433106,0.0041845627,0.00003784989,0.000023533516,0.0000035040496,0.000012213509,0.000046433437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.00011797916,0.00023678136,0.0004447929,0.00028994225,0.00040057325],"domain_scores_gemma":[0.9985722,0.00022706535,0.0001018561,0.00096880354,0.000037475806,0.00009264259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031133223,0.00018602467,0.00020373114,0.00015760014,0.000114536284,0.00013723201,0.0011220317,0.00005122007,0.000004832471],"category_scores_gemma":[0.00014072364,0.00015758979,0.000042391704,0.00047767293,0.00005394684,0.0002824436,0.00030734905,0.00021719986,0.000016109818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016368831,0.0007567133,0.02969828,0.0001950914,0.00015725856,0.0011921636,0.016326314,0.28310972,0.017043648,0.025436739,0.07510828,0.55081207],"study_design_scores_gemma":[0.007559541,0.0014433865,0.037358385,0.0015821564,0.00006403034,0.00042271,0.00081673346,0.80368924,0.010756558,0.0038269737,0.12738383,0.00509644],"about_ca_topic_score_codex":0.00026209946,"about_ca_topic_score_gemma":0.000089920715,"teacher_disagreement_score":0.54571563,"about_ca_system_score_codex":0.000038757535,"about_ca_system_score_gemma":0.000032410808,"threshold_uncertainty_score":0.64263254},"labels":[],"label_agreement":null},{"id":"W4255538121","doi":"10.1007/978-0-387-39940-9_3046","title":"Message-Oriented Middleware (MOM)","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Message oriented middleware; Middleware (distributed applications); Computer science; Message broker; Operating system; Software; Software architecture","score_opus":0.016281640259473013,"score_gpt":0.23864746429449613,"score_spread":0.2223658240350231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255538121","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019543986,0.0027936874,0.34076878,0.000043415985,0.0009515549,0.00044385524,0.00023589403,0.00060078077,0.6541601],"genre_scores_gemma":[0.00041596344,0.004109247,0.10577854,0.00010733014,0.00065251463,0.000030562485,0.00096051267,0.00008922022,0.8878561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969474,0.00008737621,0.0009832288,0.00085928355,0.0007686716,0.00035400383],"domain_scores_gemma":[0.9964379,0.00013462441,0.0008624079,0.0020422924,0.00033666595,0.00018607258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005155509,0.0005215916,0.0008007007,0.00040879668,0.00011124976,0.00007773264,0.001573911,0.00033345286,0.00004504211],"category_scores_gemma":[0.000070055445,0.0005102818,0.00019814585,0.00014341832,0.000070882954,0.00031571402,0.0005059064,0.00042758737,0.000109572655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013121358,0.00010070051,0.000021074356,0.0005673571,0.00012351376,0.00018930563,0.00032327315,0.0007498328,0.000014804115,0.7786486,0.20024814,0.019000232],"study_design_scores_gemma":[0.00025262838,0.0001183923,0.0000052570635,0.0013863872,0.000037480655,0.000038964852,0.0000067689048,0.0069157006,0.000046500587,0.0011093529,0.9894354,0.00064716226],"about_ca_topic_score_codex":0.00006644165,"about_ca_topic_score_gemma":0.0000047940853,"teacher_disagreement_score":0.78918725,"about_ca_system_score_codex":0.00007462222,"about_ca_system_score_gemma":0.00021875036,"threshold_uncertainty_score":0.9997349},"labels":[],"label_agreement":null},{"id":"W4255745893","doi":"10.1109/codes-isss.2013.6658997","title":"pvFPGA: Accessing an FPGA-based hardware accelerator in a paravirtualized environment","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"PCI Express; Field-programmable gate array; Computer science; Virtualization; x86; Porting; Operating system; Embedded system; Hypervisor; Overhead (engineering); Computer hardware; Software; Cloud computing","score_opus":0.028983856074477978,"score_gpt":0.27263798229205977,"score_spread":0.24365412621758178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255745893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04056527,0.000041026786,0.9561854,0.0006720589,0.000048358037,0.00026967627,4.0075216e-7,0.0006186714,0.001599159],"genre_scores_gemma":[0.6151995,0.0000070118094,0.38347384,0.0010328712,0.000016384758,0.00006209643,0.0000045679003,0.000008906812,0.00019483779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859065,0.00013951439,0.00030691383,0.00044550624,0.00022430402,0.00029309935],"domain_scores_gemma":[0.99912006,0.000046634465,0.00008670042,0.00058602757,0.00003484528,0.00012571085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287888,0.00016167856,0.00017880325,0.00016831963,0.00010447252,0.0005194762,0.0008975063,0.00007275338,0.00027583877],"category_scores_gemma":[0.000015339723,0.00014289959,0.000040673283,0.0002539111,0.000029335035,0.0010191554,0.00018414979,0.00011755819,0.00012028338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042762713,0.002356006,0.022320408,0.00007506314,0.000043537817,0.00008642216,0.0027794514,0.2573495,0.0074598812,0.023839816,0.018227478,0.6654197],"study_design_scores_gemma":[0.00055488467,0.00007683458,0.0055555934,0.000021874244,0.0000012916133,0.0000016127781,0.000017876378,0.9789828,0.011750242,0.0012064489,0.0015378055,0.000292754],"about_ca_topic_score_codex":0.00016843948,"about_ca_topic_score_gemma":0.000005394821,"teacher_disagreement_score":0.7216333,"about_ca_system_score_codex":0.0000638083,"about_ca_system_score_gemma":0.000063509775,"threshold_uncertainty_score":0.5827276},"labels":[],"label_agreement":null},{"id":"W4255927353","doi":"10.1007/978-0-387-39940-9_3285","title":"Physical Window = Tuple-based Windows","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Window (computing); Computer science; Tuple; Computer graphics (images); Operating system; Mathematics; Discrete mathematics","score_opus":0.015147472020717987,"score_gpt":0.24536328544346295,"score_spread":0.23021581342274497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255927353","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009842498,0.0007585154,0.4510975,0.000073520154,0.00062865665,0.0006246623,0.0002147228,0.0006155196,0.54597706],"genre_scores_gemma":[0.015702993,0.0016526551,0.24518347,0.00060948066,0.004799745,0.000144362,0.0025359276,0.00034853898,0.72902286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969759,0.00009642647,0.0008008148,0.0008882464,0.00085718464,0.00038142875],"domain_scores_gemma":[0.99645233,0.0002429208,0.0008047645,0.002047941,0.00025523535,0.00019680797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042831252,0.0005751981,0.0009424758,0.0004001194,0.00010361121,0.000101830614,0.001733134,0.00026959862,0.000016139169],"category_scores_gemma":[0.0000555656,0.0005531459,0.0002831872,0.00014557168,0.00009484005,0.00035000098,0.00031484562,0.0004883878,0.000114553346],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000554966,0.0005342271,0.00005581629,0.0011547015,0.00024946607,0.00033648376,0.00049632613,0.024737963,0.00016767974,0.7732201,0.1444895,0.054502185],"study_design_scores_gemma":[0.0008788406,0.0004115703,0.00001826572,0.0019724255,0.000089835965,0.000035690584,0.0000040351833,0.17783904,0.00038660978,0.0026166975,0.8143019,0.0014451091],"about_ca_topic_score_codex":0.00004637317,"about_ca_topic_score_gemma":0.0000027780086,"teacher_disagreement_score":0.7706035,"about_ca_system_score_codex":0.00007680581,"about_ca_system_score_gemma":0.00037047092,"threshold_uncertainty_score":0.999692},"labels":[],"label_agreement":null},{"id":"W4256473940","doi":"10.1145/2872887.2750398","title":"SLIP","year":2015,"lang":"en","type":"article","venue":"ACM SIGARCH Computer Architecture News","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Security Agency","keywords":"Cache; Computer science; Dram; Parallel computing; CPU cache; Energy consumption; Slip (aerodynamics); Cache algorithms; Memory hierarchy; Efficient energy use; Embedded system; Operating system; Computer hardware; Engineering; Electrical engineering","score_opus":0.030767619844095918,"score_gpt":0.2738943726696939,"score_spread":0.24312675282559798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256473940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002065884,0.0001275207,0.9852242,0.00560074,0.00068550854,0.00024819298,0.0000010321603,0.0017160758,0.0043308656],"genre_scores_gemma":[0.07850557,0.000008126471,0.917362,0.0032556616,0.0005999215,0.000018296627,0.0000074072236,0.00002352832,0.00021949108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757296,0.00026262205,0.00035003573,0.0006998727,0.0005703559,0.0005441476],"domain_scores_gemma":[0.99709636,0.00028015292,0.00011240206,0.0018861196,0.00020165203,0.00042330445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048197876,0.00029640947,0.00029887148,0.00030367787,0.00013989584,0.00031332648,0.0035526438,0.00010674103,0.0000056930858],"category_scores_gemma":[0.00019662808,0.0002571197,0.00012388967,0.00065180304,0.00007191866,0.00025468605,0.0021019008,0.0004174654,0.000111113746],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018791976,0.00012987343,0.00094694906,0.00001665829,0.00004508148,0.00007358683,0.003989128,0.07537054,0.00009030598,0.012215285,0.12412735,0.78297645],"study_design_scores_gemma":[0.0017359892,0.0009685522,0.001217832,0.00007897624,0.000011811737,0.00038744687,0.000015512762,0.5243706,0.0019154293,0.17417273,0.29400137,0.001123742],"about_ca_topic_score_codex":0.000052441308,"about_ca_topic_score_gemma":0.000010085368,"teacher_disagreement_score":0.7818527,"about_ca_system_score_codex":0.000060469523,"about_ca_system_score_gemma":0.00018867824,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W4280578181","doi":"10.1145/3535457","title":"Cache Abstraction for Data Race Detection in Heterogeneous Systems with Non-coherent Accelerators","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache coherence; Cache; Abstraction; Synchronization (alternating current); Software; CPU cache; Embedded system; Parallel computing; Cache algorithms; Operating system","score_opus":0.04120684852229312,"score_gpt":0.28773044671002296,"score_spread":0.24652359818772984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280578181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025717452,0.00014006515,0.9697602,0.00008449082,0.0019207606,0.0015023649,0.000027992555,0.00077751564,0.00006915624],"genre_scores_gemma":[0.9707389,0.000008418643,0.028534543,0.000047684465,0.000096665026,0.0003926995,0.000036411944,0.00004548198,0.000099196994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968303,0.00037208304,0.0007139639,0.0010439851,0.00055415573,0.00048550765],"domain_scores_gemma":[0.99678856,0.00048770793,0.000425769,0.0020509127,0.00014465419,0.00010237377],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012402541,0.0003250273,0.00041855942,0.0004839767,0.0009958609,0.00043535003,0.0021742184,0.00010745264,0.0000029412413],"category_scores_gemma":[0.000029841,0.0003304214,0.000080799524,0.00094833627,0.000024370487,0.00042418865,0.00012481702,0.0005413272,0.000005072346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059956157,0.00019333423,0.000024512448,0.00006657952,0.000054450647,0.000010322523,0.0005067027,0.9822237,0.00018763568,0.000039332856,0.00011191083,0.016521575],"study_design_scores_gemma":[0.00089766795,0.00048573242,0.000029370942,0.000097975186,0.000020211508,0.00024798556,0.0004481712,0.99511135,0.0010598265,0.000017646267,0.001209581,0.00037450838],"about_ca_topic_score_codex":0.00050403766,"about_ca_topic_score_gemma":0.000043390322,"teacher_disagreement_score":0.94502145,"about_ca_system_score_codex":0.00047288265,"about_ca_system_score_gemma":0.00013244041,"threshold_uncertainty_score":0.99991477},"labels":[],"label_agreement":null},{"id":"W4281608713","doi":"10.1145/3520306.3534502","title":"From functional to imperative: combining destination-passing style and views","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Functional programming; Programming language; Programming style; Style (visual arts); Programming paradigm","score_opus":0.03133415019929545,"score_gpt":0.27854354076705334,"score_spread":0.2472093905677579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281608713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01721753,0.000045254335,0.97829896,0.0012582206,0.00014601379,0.00008555714,0.0000016875251,0.0003419294,0.0026048508],"genre_scores_gemma":[0.5479789,9.761144e-7,0.45042533,0.001048063,0.000024797639,0.000026066042,0.000006572581,0.000003493549,0.00048584922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923366,0.00009481036,0.0001300368,0.00025938466,0.00017996505,0.00010216593],"domain_scores_gemma":[0.99959123,0.00011208075,0.000040673985,0.00015301757,0.000047018086,0.00005597327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023970242,0.00006803606,0.000079147256,0.00008591071,0.0005134468,0.0001694582,0.0002185243,0.000011203911,0.00013149332],"category_scores_gemma":[0.000030415194,0.00006852925,0.000015282933,0.00027334984,0.000010348234,0.00017994583,0.00047773172,0.00008794089,0.0000067491214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035417033,0.0003657134,0.005459946,0.000009908832,0.00006483828,0.000023416902,0.01752339,0.24348778,0.008935928,0.3063815,0.1611689,0.25654328],"study_design_scores_gemma":[0.00027184247,0.00012597135,0.004209841,0.0000070368988,0.0000022146419,0.000013400282,0.00017267154,0.97606915,0.0011531065,0.005814909,0.011948876,0.00021099644],"about_ca_topic_score_codex":0.000049730894,"about_ca_topic_score_gemma":0.0000021369806,"teacher_disagreement_score":0.7325814,"about_ca_system_score_codex":0.000041036066,"about_ca_system_score_gemma":0.000037087502,"threshold_uncertainty_score":0.39490697},"labels":[],"label_agreement":null},{"id":"W4281660701","doi":"10.1145/3470496.3527438","title":"Mokey","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Centroid; Transformer; Quantization (signal processing); Floating point; Efficient energy use; Fixed point; Computer engineering; Computer hardware; Algorithm; Artificial intelligence; Voltage; Electrical engineering; Mathematics; Engineering","score_opus":0.027244392464766915,"score_gpt":0.2856856585429932,"score_spread":0.2584412660782263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281660701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071692884,0.000106663036,0.8668683,0.0007190964,0.00055234623,0.00010266779,0.0000011554368,0.002034586,0.12954348],"genre_scores_gemma":[0.032637913,0.000063781554,0.95814425,0.00090375205,0.000052593183,0.000059149756,0.000015817961,0.000010283744,0.008112472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989787,0.00007006256,0.0001623745,0.00042930339,0.00022107086,0.0001385263],"domain_scores_gemma":[0.99886924,0.000028613184,0.00008927991,0.00093134143,0.000039619532,0.0000418864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022554518,0.00012324934,0.00013640449,0.000120437246,0.00010364269,0.00018683163,0.0019572696,0.00007638186,0.00028628288],"category_scores_gemma":[0.00001425208,0.00012296693,0.000080594764,0.0001459225,0.000009574504,0.00005663619,0.006081935,0.0004106114,0.00002272961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013718422,0.000096125834,0.00023578803,0.0000429244,0.000035407396,0.000025838783,0.00048647553,0.36592877,0.0000051497814,0.4314535,0.17813404,0.023554606],"study_design_scores_gemma":[0.0000481591,0.000023011926,0.00010998632,0.000009692393,0.0000021453911,0.0000037474274,0.0000035384458,0.89763635,0.00019131841,0.050630767,0.05104359,0.00029769202],"about_ca_topic_score_codex":0.000045327695,"about_ca_topic_score_gemma":4.7300855e-7,"teacher_disagreement_score":0.5317076,"about_ca_system_score_codex":0.000049665894,"about_ca_system_score_gemma":0.00010703063,"threshold_uncertainty_score":0.7580697},"labels":[],"label_agreement":null},{"id":"W4281682568","doi":"10.1145/3520140","title":"Adaptive Clock Management of HLS-generated Circuits on FPGAs","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Toolchain; Computer science; Field-programmable gate array; Critical path method; High-level synthesis; Embedded system; Static timing analysis; Boosting (machine learning); Clock rate; Scheduling (production processes); Computer architecture; Chip; Engineering; Artificial intelligence; Telecommunications","score_opus":0.026690332779737317,"score_gpt":0.24077069239057938,"score_spread":0.21408035961084207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281682568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01084247,0.00065422704,0.97829115,0.00087669486,0.00053999864,0.000508573,0.000019084642,0.0010019729,0.0072657997],"genre_scores_gemma":[0.9914266,0.00017886577,0.006409641,0.00006935704,0.0000046982614,0.00023716036,0.000002471533,0.000010516481,0.0016607129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870694,0.00013209689,0.00032325918,0.00042936968,0.00019004052,0.00021828352],"domain_scores_gemma":[0.99888045,0.0000698899,0.00015303426,0.00078994036,0.0000684766,0.000038199658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032318462,0.00015323359,0.00024974608,0.0007104023,0.00050558057,0.000031025123,0.0008235858,0.000115159884,0.00002720337],"category_scores_gemma":[0.0000045945108,0.00015759154,0.000046987883,0.0011213957,0.00006201876,0.000076789154,0.000025347468,0.00034703242,0.000008575966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005145547,0.0004941568,0.00004504789,0.000096895186,0.00036414582,0.000053973243,0.0002757872,0.4131444,0.0006109453,0.32549724,0.0009369665,0.258429],"study_design_scores_gemma":[0.003937048,0.007351723,0.0002879845,0.0007520745,0.00014971597,0.0008296858,0.00409826,0.8178624,0.10097992,0.037518255,0.024301779,0.0019311887],"about_ca_topic_score_codex":0.000027431892,"about_ca_topic_score_gemma":0.0000010188222,"teacher_disagreement_score":0.9805841,"about_ca_system_score_codex":0.00006225677,"about_ca_system_score_gemma":0.000026532038,"threshold_uncertainty_score":0.64263964},"labels":[],"label_agreement":null},{"id":"W4281718481","doi":"10.1145/3470496.3527380","title":"X-cache","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cache; Toolchain; Instruction prefetch; Parallel computing; Operating system; Embedded system; Software","score_opus":0.017006577007244367,"score_gpt":0.24437143677719453,"score_spread":0.22736485976995016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281718481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019962373,0.000020901114,0.9307036,0.0008700998,0.00007862336,0.000024318628,1.0622297e-7,0.0007302243,0.067372546],"genre_scores_gemma":[0.54075956,0.0000012371459,0.45356008,0.0013527038,0.000009255715,0.0000139302865,6.820794e-7,0.0000020359805,0.0043004653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996336,0.000036628422,0.000049945003,0.000104618484,0.00010587064,0.00006935556],"domain_scores_gemma":[0.99974823,0.000014065823,0.0000150274,0.00019566274,0.000009911248,0.000017095463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014515608,0.000025746895,0.000028128294,0.000038438753,0.000169502,0.000029551764,0.00051005784,0.0000044170433,0.00014715495],"category_scores_gemma":[0.000004138342,0.000024825635,0.000015961825,0.00020434616,0.0000037025513,0.000060198563,0.0004351139,0.00005335107,0.000015071272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.677071e-7,0.000056739722,0.0002546847,8.990466e-7,0.0000039592787,0.000006774775,0.0002975269,0.033930615,0.00008248057,0.81262624,0.11648934,0.03624987],"study_design_scores_gemma":[0.00007575257,0.00005413769,0.00014522915,2.9370662e-7,3.7664086e-7,0.000019125247,0.000012576216,0.8401403,0.00080333056,0.010591856,0.14805913,0.00009791856],"about_ca_topic_score_codex":0.0000052741943,"about_ca_topic_score_gemma":8.54617e-8,"teacher_disagreement_score":0.8062097,"about_ca_system_score_codex":0.000014694841,"about_ca_system_score_gemma":0.000015359132,"threshold_uncertainty_score":0.16112435},"labels":[],"label_agreement":null},{"id":"W4283263374","doi":"10.1109/iciprob54042.2022.9798454","title":"ICIPRoB2022 Conference Program","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Education and Early Childhood Development","funders":"","keywords":"Computer science; Multi-core processor; Benchmark (surveying); Compiler; MATLAB; Deep learning; Software; Embedded system; Computer architecture; Computer engineering; Artificial intelligence; Parallel computing; Operating system","score_opus":0.02771588981898522,"score_gpt":0.2820258780544587,"score_spread":0.2543099882354735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283263374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044585695,0.000018191364,0.9362283,0.00092979515,0.0001093465,0.00015972623,3.8644444e-7,0.0021580115,0.059950437],"genre_scores_gemma":[0.48749197,0.0000021456287,0.5090483,0.0005657743,0.000008335045,0.00014681129,0.000002356671,0.0000031591396,0.0027311626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992919,0.00006560483,0.00009900913,0.00020763553,0.00019229233,0.00014353698],"domain_scores_gemma":[0.9995753,0.000015684991,0.00003600533,0.00030051774,0.0000370683,0.00003538055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019752241,0.00005479426,0.00005981666,0.00005899121,0.00026377244,0.00009725214,0.0008350792,0.000009173789,0.00027098545],"category_scores_gemma":[0.0000063510524,0.000053392763,0.000026191743,0.00034440806,0.000013009329,0.000106309766,0.000730608,0.00010770096,0.000013939486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020464934,0.0002221951,0.00015376984,0.000002964513,0.0000061976225,0.000010452635,0.00041967866,0.011233745,0.00005695513,0.7442642,0.03041254,0.21321526],"study_design_scores_gemma":[0.00009008339,0.00021319269,0.00008323294,8.998233e-7,6.615583e-7,0.000018747003,0.000022885613,0.87432396,0.00043240862,0.007262212,0.117423676,0.00012804379],"about_ca_topic_score_codex":0.000012003084,"about_ca_topic_score_gemma":5.101246e-7,"teacher_disagreement_score":0.8630902,"about_ca_system_score_codex":0.000023973564,"about_ca_system_score_gemma":0.000049718634,"threshold_uncertainty_score":0.29671004},"labels":[],"label_agreement":null},{"id":"W4283806633","doi":"10.5281/zenodo.6797395","title":"A Meta-Level Static Analysis for JavaScript","year":2022,"lang":"en","type":"report","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Programming language; Rich Internet application","score_opus":0.21922374617664553,"score_gpt":0.3174584476110384,"score_spread":0.09823470143439289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283806633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009240048,0.00047330942,0.9246284,0.00052128115,0.00025370545,0.00078649103,0.001008922,0.0023996676,0.069919005],"genre_scores_gemma":[0.043657996,0.0054995217,0.70546967,0.0026428131,0.001479437,0.000012868953,0.07422822,0.014386704,0.1526228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956489,0.0006674631,0.00067316514,0.0010877663,0.0013708323,0.00055187783],"domain_scores_gemma":[0.9954868,0.0001345549,0.00056384574,0.0014573629,0.0021519784,0.0002054533],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033345625,0.00035190527,0.0007484589,0.0013101487,0.0030119156,0.0017770589,0.0040128916,0.00013972475,0.008465783],"category_scores_gemma":[0.0014829173,0.00036232162,0.0006309191,0.002485095,0.000084521176,0.00030688374,0.0035021733,0.00051370484,0.00034777386],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014561081,0.00015863159,9.771742e-7,0.00017322478,0.0053590927,0.000016480908,0.0007429887,0.008597284,0.00001644376,0.0035544976,0.9317668,0.049598992],"study_design_scores_gemma":[0.00019529066,0.00021508394,0.000034868837,0.000010519358,0.0014417544,0.000062681385,0.00003109343,0.038252126,0.000031733984,0.0004883141,0.9588611,0.00037543706],"about_ca_topic_score_codex":0.00007546816,"about_ca_topic_score_gemma":7.14019e-7,"teacher_disagreement_score":0.21915874,"about_ca_system_score_codex":0.0005446608,"about_ca_system_score_gemma":0.00006139104,"threshold_uncertainty_score":0.9998829},"labels":[],"label_agreement":null},{"id":"W4285060868","doi":"10.1109/mm.2022.3176529","title":"Compiling for the IBM Matrix Engine for Enterprise Workloads","year":2022,"lang":"en","type":"article","venue":"IEEE Micro","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Operand; Matrix multiplication; IBM; Parallel computing; Code (set theory); SIMD; Matrix (chemical analysis); Product (mathematics); Set (abstract data type); Computer architecture; Operating system; Programming language","score_opus":0.017995891346665002,"score_gpt":0.282373825555241,"score_spread":0.26437793420857597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285060868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014963842,0.00067577726,0.99486244,0.0012427195,0.0008174154,0.00050555886,0.00001725793,0.00033416972,0.000048290636],"genre_scores_gemma":[0.2646663,0.000026775033,0.73205453,0.0010382705,0.00020850236,0.00042648238,0.000009736064,0.000021162377,0.0015482423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924445,0.000034388337,0.00017037462,0.00023256887,0.000100906436,0.00021730967],"domain_scores_gemma":[0.9990935,0.00039619827,0.000076376375,0.0003495145,0.00005739914,0.000027012553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045007077,0.000092731265,0.000106573876,0.0000629017,0.0005571846,0.000103299884,0.0009682363,0.000019958063,0.00000660634],"category_scores_gemma":[0.000018030976,0.00007819953,0.00010904862,0.00019038316,0.000016165832,0.000059987877,0.00018530527,0.00010090017,0.0000023437124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105762905,0.00022019971,0.00012638749,0.000056486384,0.0000861943,0.00000390691,0.0019486394,0.6554109,0.0116017535,0.0062931543,0.25514108,0.069005564],"study_design_scores_gemma":[0.00036325326,0.000089310124,0.000008914713,0.00000787012,0.0000074770974,0.000010300979,0.000018136225,0.8517026,0.012862087,0.0011289712,0.13367182,0.00012931404],"about_ca_topic_score_codex":0.0000045804477,"about_ca_topic_score_gemma":4.355289e-7,"teacher_disagreement_score":0.2631699,"about_ca_system_score_codex":0.000044317105,"about_ca_system_score_gemma":0.000035942016,"threshold_uncertainty_score":0.428547},"labels":[],"label_agreement":null},{"id":"W4285266887","doi":"10.1007/978-3-662-64821-6","title":"Paradigms of Concurrency","year":2022,"lang":"en","type":"book","venue":"Studies in computational intelligence","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Concurrency; Computer science; Programming language","score_opus":0.10052361061656656,"score_gpt":0.3791314771231728,"score_spread":0.27860786650660624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285266887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002525795,0.008974599,0.8729372,0.00014630078,0.000932343,0.00026172036,0.000018485029,0.00017696104,0.11654986],"genre_scores_gemma":[0.046753425,0.008944791,0.7523511,0.00086089096,0.00034588765,0.00030544103,0.00026996998,0.00010552631,0.19006296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759835,0.00012154777,0.00086595025,0.0005756854,0.0006108675,0.00022756973],"domain_scores_gemma":[0.99747103,0.0011980974,0.00051496754,0.00041220037,0.00036636024,0.00003733419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000507467,0.00028458697,0.00057384645,0.00044633806,0.00012343838,0.00002444508,0.0015162856,0.000093735245,0.000062520245],"category_scores_gemma":[0.00016034699,0.00030652783,0.0001328936,0.00047953278,0.0003341318,0.00012779789,0.0011015944,0.00046252154,0.000016332107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002724971,0.000041617044,0.000015690212,0.00009541075,0.0000610446,0.000018540764,0.0011431215,0.4221095,5.666142e-8,0.5477809,0.018253254,0.010478189],"study_design_scores_gemma":[0.00007098166,0.0001703945,0.000014568073,0.00033340463,0.000008952662,0.000020548146,0.00006989262,0.21803223,0.000027773995,0.750848,0.029985314,0.00041796558],"about_ca_topic_score_codex":0.0000049140676,"about_ca_topic_score_gemma":0.0000018598067,"teacher_disagreement_score":0.20407727,"about_ca_system_score_codex":0.0003404704,"about_ca_system_score_gemma":0.0005274485,"threshold_uncertainty_score":0.99993867},"labels":[],"label_agreement":null},{"id":"W4285503949","doi":"10.1109/ipdps53621.2022.00121","title":"HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Sparse matrix; Computer science; Cholesky decomposition; Computation; Parallel computing; Solver; Algorithm; Locality; Matrix (chemical analysis); Tree (set theory); Mathematics","score_opus":0.016496648329979526,"score_gpt":0.2814351398593931,"score_spread":0.26493849152941357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285503949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0470141,0.00037679911,0.9490992,0.0018881053,0.0004148116,0.00026086785,0.00021164877,0.00023066164,0.0005038306],"genre_scores_gemma":[0.96853805,0.00007733704,0.030272799,0.00016459516,0.000045818593,0.00012298702,0.00048765438,0.000013721875,0.00027703334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976953,0.00017451288,0.0006748245,0.0005469188,0.00064583455,0.00026257947],"domain_scores_gemma":[0.9987924,0.00013209097,0.00043224535,0.00026501005,0.00028967235,0.000088600864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047584024,0.00021396572,0.00025538122,0.00041856433,0.0004653221,0.00027315877,0.0008923269,0.00004991704,0.000036876347],"category_scores_gemma":[0.000057692807,0.00024428815,0.000073239054,0.00076867326,0.00007958122,0.00070859864,0.00036080938,0.00031625095,0.0000033143297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058651363,0.000305063,0.0036307026,0.00004606248,0.000033291577,0.000034603345,0.00090923643,0.9782468,0.0017376964,0.010349666,0.001590763,0.0030574608],"study_design_scores_gemma":[0.0007887614,0.00008132719,0.0010066571,0.00006726938,0.000011710315,0.000108689404,0.00013269308,0.99008554,0.000991216,0.0057907267,0.00064901455,0.00028638425],"about_ca_topic_score_codex":0.00006641943,"about_ca_topic_score_gemma":0.000012113308,"teacher_disagreement_score":0.9215239,"about_ca_system_score_codex":0.00016467152,"about_ca_system_score_gemma":0.00020925105,"threshold_uncertainty_score":0.99617815},"labels":[],"label_agreement":null},{"id":"W4285504014","doi":"10.1109/ipdps53621.2022.00055","title":"Co-Designing an OpenMP GPU Runtime and Optimizations for Near-Zero Overhead Execution","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Lawrence Livermore National Laboratory","keywords":"Computer science; Software portability; Compiler; CUDA; Parallel computing; Runtime system; Overhead (engineering); Programming paradigm; Operating system; Programming language","score_opus":0.021126862763577482,"score_gpt":0.2952386818613041,"score_spread":0.2741118190977266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285504014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00425767,0.00028662392,0.9915208,0.0017948871,0.00032454156,0.00041175564,0.00024379969,0.00042754947,0.0007323381],"genre_scores_gemma":[0.7543495,0.00010304086,0.24236964,0.00069586764,0.00008907207,0.00037889654,0.0013299973,0.00003259926,0.00065134326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979231,0.00012969202,0.00043538035,0.0007190797,0.00046213352,0.000330631],"domain_scores_gemma":[0.9989329,0.00011655128,0.0002867947,0.00025928442,0.00024958767,0.0001548879],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005726467,0.0002542844,0.00024485047,0.00017523915,0.0016862279,0.0010485073,0.00078641134,0.000079207566,0.000027418406],"category_scores_gemma":[0.000043786793,0.00028131227,0.00006222752,0.00036029716,0.00010387717,0.0010757445,0.00026122827,0.0002393064,0.0000017783511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022396474,0.00046297556,0.0011566657,0.00007752912,0.00010088124,0.000016120679,0.002002094,0.94602674,0.004659225,0.02055484,0.019518947,0.005200035],"study_design_scores_gemma":[0.00094003946,0.00022784079,0.0002387905,0.00003099208,0.000020677042,0.0000856603,0.000114259645,0.9863185,0.00042797276,0.0049615614,0.0062508285,0.00038283458],"about_ca_topic_score_codex":0.00002978519,"about_ca_topic_score_gemma":0.0000015894129,"teacher_disagreement_score":0.75009185,"about_ca_system_score_codex":0.00012562842,"about_ca_system_score_gemma":0.00016977142,"threshold_uncertainty_score":0.9999885},"labels":[],"label_agreement":null},{"id":"W4285585958","doi":"10.1117/12.2629999","title":"CCAT-prime: observatory control software for FYST","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Prime (order theory); Software; Observatory; Programming language; Physics; Astronomy; Mathematics; Combinatorics","score_opus":0.021703583714650986,"score_gpt":0.2508680854071413,"score_spread":0.2291645016924903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285585958","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019147787,0.00011061729,0.99606586,0.0009351465,0.00025581243,0.00026970686,0.0000071466948,0.0013587507,0.0008054867],"genre_scores_gemma":[0.23502465,0.0000020422083,0.75836504,0.0038575022,0.00004391714,0.00021925087,0.0000085904185,0.000011351278,0.0024676993],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913484,0.0000643544,0.00015855234,0.0002717609,0.00017568753,0.00019479996],"domain_scores_gemma":[0.999227,0.0001537178,0.00006702294,0.0003985338,0.00010394258,0.0000497678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544494,0.000084297935,0.000115905124,0.000057555764,0.00039009456,0.000065997236,0.00089487183,0.000021739486,0.000046128545],"category_scores_gemma":[0.00006699746,0.00008450122,0.00006239345,0.00025673726,0.000013316706,0.00013321896,0.00029537917,0.00008764953,0.0000069195853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053086704,0.00041341176,0.0046115005,0.000038394985,0.00008473949,0.000012528248,0.000754054,0.12377327,0.00042941724,0.28394598,0.5057756,0.08010804],"study_design_scores_gemma":[0.0008544847,0.00020154977,0.0004752796,0.0000027855983,0.0000048257793,0.000009228454,0.000016446062,0.8521444,0.00096383283,0.0059539704,0.1391126,0.00026055565],"about_ca_topic_score_codex":0.000010726836,"about_ca_topic_score_gemma":5.471325e-7,"teacher_disagreement_score":0.72837114,"about_ca_system_score_codex":0.00004988351,"about_ca_system_score_gemma":0.000095419426,"threshold_uncertainty_score":0.34458598},"labels":[],"label_agreement":null},{"id":"W4286220023","doi":"10.1002/cpe.7188","title":"Visualization of profiling and tracing in CPU‐GPU programs","year":2022,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Debugging; Tracing; Profiling (computer programming); Parallel computing; Visualization; SIMD; Symmetric multiprocessor system; Kernel (algebra); Central processing unit; Queue; Operating system; Programming language; Artificial intelligence","score_opus":0.03139827628702556,"score_gpt":0.3462476522100001,"score_spread":0.3148493759229745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286220023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21879925,0.00148949,0.77883387,0.00013677962,0.00008179672,0.00018740931,4.5835353e-7,0.00007747927,0.0003934878],"genre_scores_gemma":[0.96180266,0.0002077592,0.03782079,0.0001049624,0.000005893294,0.00004511048,0.000004945017,0.0000031524214,0.0000047187254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990184,0.00016767606,0.00025764402,0.00028473127,0.00016121932,0.00011033105],"domain_scores_gemma":[0.9994459,0.00016971555,0.0001921249,0.000077556804,0.00007690828,0.00003779125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040586173,0.00008145509,0.00011677272,0.00011312653,0.00021823538,0.00009713152,0.0001129477,0.000021960363,0.0000011912348],"category_scores_gemma":[0.00008614525,0.00008887705,0.000008995035,0.000400353,0.00006513164,0.000814809,0.00019763316,0.00010347905,8.7313225e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006030398,0.0004005058,0.019928798,0.00016504468,0.000013536158,0.000018283672,0.08263587,0.0110520115,0.00068784755,0.18543541,0.00003149116,0.6995709],"study_design_scores_gemma":[0.0004442404,0.00032518237,0.0010695169,0.000047105998,0.000005396893,0.00009531851,0.0050399657,0.9886629,0.00060451863,0.0029107651,0.00059784844,0.0001972469],"about_ca_topic_score_codex":0.000030687093,"about_ca_topic_score_gemma":7.046163e-7,"teacher_disagreement_score":0.9776109,"about_ca_system_score_codex":0.000010966993,"about_ca_system_score_gemma":0.000036701596,"threshold_uncertainty_score":0.3624301},"labels":[],"label_agreement":null},{"id":"W4286239339","doi":"10.1145/3491204.3527477","title":"Benchmarking Runtime Scripting Performance in Wasmer","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Benchmarking; Spec#; Scripting language; Benchmark (surveying); Macro; Operating system; Measure (data warehouse); Cache; Programming language; Parallel computing; Database","score_opus":0.013233287341417292,"score_gpt":0.22472663910778523,"score_spread":0.21149335176636794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286239339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06487832,0.00008137167,0.8673561,0.00036045982,0.00031302538,0.00011713692,1.9539348e-7,0.0006866312,0.06620675],"genre_scores_gemma":[0.7779627,0.0000039677925,0.22096613,0.00041657765,0.000015983407,0.000015688003,0.0000010258802,0.0000034498476,0.0006145091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991719,0.000057926034,0.00016401187,0.00022414408,0.00018917103,0.00019282947],"domain_scores_gemma":[0.999664,0.00002328092,0.000046788,0.00022867943,0.000014929383,0.000022328135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005006991,0.000064821244,0.00007694821,0.00016768948,0.00025450767,0.00006255019,0.000616406,0.000012377569,0.00010959404],"category_scores_gemma":[0.00000589765,0.000067620225,0.000021491578,0.00055993994,0.000008098276,0.00020749324,0.00059593085,0.00015750946,0.000008212584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010319367,0.00024215646,0.08115956,0.000026947579,0.000012844269,0.000032254822,0.0040560006,0.59242976,0.00041505042,0.07613482,0.013423455,0.23205684],"study_design_scores_gemma":[0.00009306558,0.0000447201,0.0031510356,0.000005611622,3.073525e-7,0.000009428766,0.000021160766,0.9888188,0.00032794406,0.00016990762,0.0072506946,0.00010730579],"about_ca_topic_score_codex":0.000030560688,"about_ca_topic_score_gemma":0.0000013687269,"teacher_disagreement_score":0.71308434,"about_ca_system_score_codex":0.000056999197,"about_ca_system_score_gemma":0.000029639396,"threshold_uncertainty_score":0.27574727},"labels":[],"label_agreement":null},{"id":"W4289315837","doi":"10.1145/3552521","title":"Toward Software-like Debugging for FPGAs via Checkpointing and Transaction-based Co-Simulation","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Debugging; Speedup; Overhead (engineering); Field-programmable gate array; Embedded system; State (computer science); Software; Parallel computing; Operating system; Programming language","score_opus":0.029554089751305034,"score_gpt":0.2682290066091541,"score_spread":0.23867491685784908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289315837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027481792,0.00038476358,0.9926951,0.0014924757,0.00035843736,0.00059963693,0.000014538631,0.0016217007,0.00008516741],"genre_scores_gemma":[0.92746603,0.000019335052,0.07166704,0.00018582086,0.000009884046,0.0004566529,0.0000070597744,0.000018328745,0.00016987274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985621,0.00010351477,0.00036772178,0.00052944646,0.00014943468,0.0002878127],"domain_scores_gemma":[0.9987807,0.00043463756,0.00015990857,0.00047896724,0.000089369474,0.00005640707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059759815,0.00018859205,0.00027238624,0.0007372031,0.0012394555,0.000109366476,0.000437071,0.00016586829,0.000018769477],"category_scores_gemma":[0.000038299164,0.00020825076,0.000064855965,0.0005640905,0.000082717306,0.00020058309,0.000007897971,0.00035248292,0.0000016246055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004619379,0.00009558713,0.00012964924,0.00014154319,0.00006819241,0.0000037989273,0.0002872776,0.83469415,0.0007511666,0.0017846546,0.000072746676,0.16192502],"study_design_scores_gemma":[0.0006887957,0.0002916674,0.000015229787,0.00004579294,0.0000233652,0.00009788587,0.00016564567,0.9849467,0.0059505366,0.0039161714,0.0035834902,0.00027467925],"about_ca_topic_score_codex":0.000031344578,"about_ca_topic_score_gemma":0.0000022374595,"teacher_disagreement_score":0.92471784,"about_ca_system_score_codex":0.0000707511,"about_ca_system_score_gemma":0.00005701605,"threshold_uncertainty_score":0.9533015},"labels":[],"label_agreement":null},{"id":"W4290699671","doi":"10.20428/jst.v20i2.937","title":"Design and Implementation of a Chip Multiprocessor with an Efficient Multilevel Cache System","year":2015,"lang":"en","type":"article","venue":"Journal of Science and Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec","keywords":"Computer science; Cache; Computer architecture; Cache coherence; Multiprocessing; Parallel computing; Embedded system; Smart Cache; Cache pollution; Cache algorithms; System on a chip; VHDL; Cache-only memory architecture; CPU cache; Cache coloring; Field-programmable gate array","score_opus":0.02896309416377057,"score_gpt":0.2989180895948209,"score_spread":0.26995499543105034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290699671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41713548,0.00008050978,0.5824681,0.00018050107,0.000022103422,0.00006619326,1.1632382e-7,0.000038464706,0.000008548503],"genre_scores_gemma":[0.6375223,0.0000048596266,0.3624569,0.000008922358,0.0000037126267,0.0000012586183,1.9615348e-8,0.000001363831,7.239688e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910986,0.000026795386,0.00022922362,0.00015748439,0.0003433325,0.00013328315],"domain_scores_gemma":[0.99845266,0.000022617458,0.00032991768,0.00013196138,0.0009729759,0.00008985069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016318504,0.000063827814,0.00014157497,0.00055006647,0.00010430624,0.000052408548,0.0004621401,0.000042873307,9.0248335e-8],"category_scores_gemma":[0.00006446857,0.00004379232,0.0000056128224,0.0007542278,0.00045098606,0.00035724937,0.00010234443,0.00008892542,9.0299665e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002956614,0.00073433074,0.027926778,0.00029117498,0.00009375011,0.00015589141,0.027997611,0.08920599,0.062298257,0.116932996,0.0002426357,0.6738249],"study_design_scores_gemma":[0.0010521397,0.001979983,0.0013365007,0.000079801095,0.000009625174,0.00082261086,0.0030750434,0.9267571,0.06408831,0.0006666824,0.00001742491,0.00011481318],"about_ca_topic_score_codex":0.000010904933,"about_ca_topic_score_gemma":9.0582546e-7,"teacher_disagreement_score":0.83755106,"about_ca_system_score_codex":0.000038718008,"about_ca_system_score_gemma":0.000370126,"threshold_uncertainty_score":0.1785799},"labels":[],"label_agreement":null},{"id":"W4290777797","doi":"10.48550/arxiv.1609.03361","title":"Devito: Towards a generic Finite Difference DSL using Symbolic Python","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Financiadora de Estudos e Projetos; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Imperial College London; Natural Sciences and Engineering Research Council of Canada; Ministério da Ciência, Tecnologia e Inovação; SENAI CIMATEC","keywords":"Python (programming language); Digital subscriber line; Computer science; Programming language; Stencil; Theoretical computer science; Computation; Domain-specific language; Computational science; Software engineering","score_opus":0.1120943899310029,"score_gpt":0.21750040704679655,"score_spread":0.10540601711579364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290777797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0875963,0.000103455415,0.9086479,0.00007393029,0.00054961455,0.0002046544,0.000010450901,0.0009702337,0.0018434852],"genre_scores_gemma":[0.94606316,0.0002921948,0.05220224,0.00014601556,0.00013094425,0.0000011221852,0.0000050919816,0.000026900369,0.0011323281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763024,0.00023603837,0.00026622013,0.0012574033,0.00013592959,0.00047417264],"domain_scores_gemma":[0.99763304,0.00013029475,0.00036198823,0.0014540305,0.00022596243,0.00019466077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022863169,0.00041817478,0.00043718217,0.00039762337,0.00022749191,0.000200526,0.002391507,0.00035034225,0.000013038445],"category_scores_gemma":[0.00007117056,0.00041278914,0.0002268986,0.0006823895,0.00010841323,0.00024230043,0.003099554,0.0004213914,0.000036624948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028137818,0.00016669037,0.0028819789,0.00015983368,0.00015516287,0.00039068912,0.0005502496,0.902372,0.00045500914,0.07935851,0.00047635112,0.013005391],"study_design_scores_gemma":[0.00022048905,0.000031850883,0.00093266607,0.00023706644,0.000033794204,0.000007869567,0.0000044381463,0.95429033,0.00055234134,0.042899974,0.0002154565,0.0005737027],"about_ca_topic_score_codex":0.00011067586,"about_ca_topic_score_gemma":0.000004280891,"teacher_disagreement_score":0.85846686,"about_ca_system_score_codex":0.00026934053,"about_ca_system_score_gemma":0.00038421425,"threshold_uncertainty_score":0.9998324},"labels":[],"label_agreement":null},{"id":"W4292558110","doi":"10.1007/11557654","title":"High Performance Computing and Communications","year":2005,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Distributed computing","score_opus":0.015705498048116558,"score_gpt":0.2658146575328502,"score_spread":0.25010915948473367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292558110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002695173,0.00087993447,0.99419075,0.0011160827,0.00049502595,0.00028573585,0.0000017298311,0.0005682032,0.0021930088],"genre_scores_gemma":[0.15626462,0.00036102583,0.84156656,0.0011191997,0.0002985139,0.0000050519425,0.00000851511,0.000021907694,0.00035461292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970224,0.00008705402,0.0005532334,0.0011517601,0.00059117057,0.0005943829],"domain_scores_gemma":[0.99643916,0.00054608326,0.0003280309,0.0023000168,0.00023974027,0.0001469506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010928533,0.00043212777,0.00048231613,0.0007706618,0.00060021994,0.00065983995,0.0052779997,0.00026599175,0.0000025790412],"category_scores_gemma":[0.00006630957,0.00042850478,0.000054809665,0.0010209037,0.0008949694,0.00064125104,0.0039525162,0.00091902365,0.000016024795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010687268,0.000027406475,0.00008672941,0.000030303203,0.000005071145,0.00000430569,0.0005056912,0.119552575,0.0000075785656,0.0044954014,0.00014871998,0.8751351],"study_design_scores_gemma":[0.00016882124,0.00008643903,0.0003582962,0.00033882257,0.0000041118406,0.00005868418,6.4075735e-8,0.98592806,0.00029839412,0.010412627,0.0018595746,0.00048608083],"about_ca_topic_score_codex":0.000014976639,"about_ca_topic_score_gemma":0.000013360185,"teacher_disagreement_score":0.87464905,"about_ca_system_score_codex":0.0003389426,"about_ca_system_score_gemma":0.0006956642,"threshold_uncertainty_score":0.99981666},"labels":[],"label_agreement":null},{"id":"W4292640861","doi":"10.1016/j.sysarc.2022.102708","title":"Energy efficient mixed task handling on real-time embedded systems using FreeRTOS","year":2022,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Aperiodic graph; Real-time operating system; Frequency scaling; Embedded system; Scheduling (production processes); ARM architecture; Energy (signal processing); Real-time computing; Voltage; Engineering","score_opus":0.011983507736846836,"score_gpt":0.2315466213301839,"score_spread":0.21956311359333705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292640861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051170096,0.0008055683,0.9449719,0.000110033034,0.0020400474,0.0001745504,0.000007328942,0.00018602649,0.0005344428],"genre_scores_gemma":[0.9745613,0.000011328876,0.024575464,0.00006429469,0.0004619348,0.00001027726,0.0000020729904,0.000028892426,0.00028445935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965763,0.0009116138,0.00083943683,0.00031323807,0.001017366,0.00034204122],"domain_scores_gemma":[0.99778605,0.00024312105,0.0010743559,0.0005059998,0.0002294696,0.00016099565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015930296,0.0002365642,0.00052246393,0.00063463877,0.0004977154,0.00028503302,0.0011735167,0.000074307965,0.0000041925114],"category_scores_gemma":[0.000049962615,0.00019402943,0.00019706675,0.0005870746,0.000024214223,0.00007530364,0.00031312965,0.00048401495,0.0000019195468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029016928,0.0000691228,0.0000073183073,0.000029218749,0.000048964517,0.000093487135,0.0007121616,0.9883041,0.006942412,0.0014373511,0.0015124574,0.00081442174],"study_design_scores_gemma":[0.0003961815,0.00037171098,0.0000075416065,0.0002856842,0.000014808653,0.0016609211,0.00010167788,0.9927917,0.0005326867,0.00008669982,0.0035287251,0.0002216301],"about_ca_topic_score_codex":0.00014158597,"about_ca_topic_score_gemma":4.5324845e-7,"teacher_disagreement_score":0.92339116,"about_ca_system_score_codex":0.00026544897,"about_ca_system_score_gemma":0.00019055407,"threshold_uncertainty_score":0.79122907},"labels":[],"label_agreement":null},{"id":"W4292770508","doi":"10.1002/cpe.7303","title":"Enabling power measurement and control on Astra: The first petascale Arm supercomputer","year":2022,"lang":"en","type":"paratext","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Nuclear Security Administration","keywords":"Petascale computing; Supercomputer; ASTRA; Computer science; Parallel computing; Computational science; Operating system; Physics","score_opus":0.028778159703394906,"score_gpt":0.29736654502218235,"score_spread":0.2685883853187874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292770508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010077606,0.014110105,0.9696736,0.0049785725,0.0017119336,0.0006061057,0.000013654891,0.00015710806,0.0077411938],"genre_scores_gemma":[0.98370034,0.0030319316,0.0071493736,0.005309687,0.00016085942,0.00019479632,0.000019400615,0.000024748128,0.0004088747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973899,0.0003486979,0.00044201984,0.0008745084,0.00063036184,0.00031452836],"domain_scores_gemma":[0.99805874,0.0008239416,0.00035764437,0.0003528651,0.00028300233,0.00012378472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008553299,0.000372801,0.00035145812,0.00014158635,0.00120162,0.00083085307,0.00052234135,0.00011893223,0.00008828682],"category_scores_gemma":[0.00016903754,0.00030231345,0.00005301267,0.00026558578,0.00020256672,0.0008010068,0.00041004448,0.0006171763,0.000029661998],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004720924,0.0017313899,0.00022735583,0.0007588491,0.0005931702,0.0001473074,0.12670971,0.048981078,0.00007574488,0.042637285,0.23609571,0.5415703],"study_design_scores_gemma":[0.0013035553,0.0010929655,0.00022653813,0.00023272973,0.00006678778,0.00027973615,0.001723456,0.15169376,0.00006701053,0.00041362367,0.8419673,0.00093257055],"about_ca_topic_score_codex":0.000032029886,"about_ca_topic_score_gemma":9.176782e-7,"teacher_disagreement_score":0.98269254,"about_ca_system_score_codex":0.00005136101,"about_ca_system_score_gemma":0.00012450342,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W4293024962","doi":"10.1145/3489517.3530610","title":"Optimizing parallel PREM compilation over nested loop structures","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Loop tiling; Nested loop join; Benchmark (surveying); Kernel (algebra); Suite; Thread (computing); Loop (graph theory); Scheduling (production processes); Operating system; Compiler","score_opus":0.047403365924978735,"score_gpt":0.2686451311555154,"score_spread":0.22124176523053668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293024962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01961161,0.00004186747,0.9769375,0.0007840999,0.000331446,0.0006940003,0.0000050930616,0.0008561659,0.00073822774],"genre_scores_gemma":[0.6328128,0.0000060238763,0.36672994,0.00021004105,0.000022090566,0.00006558199,0.0000034510576,0.000012367036,0.00013767178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978991,0.000107748914,0.00052242033,0.00045412272,0.0007304946,0.00028608504],"domain_scores_gemma":[0.99801576,0.00015736489,0.000819079,0.0004385082,0.0005038025,0.00006548217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076229236,0.00023194197,0.00026446834,0.00021958567,0.00062033895,0.00031508654,0.0027626439,0.000072482144,0.00004707475],"category_scores_gemma":[0.00023536304,0.0002027948,0.000095328964,0.00088193483,0.0000739556,0.000789441,0.00080652145,0.00029498464,0.000002847934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008824256,0.00016691066,0.0017474206,0.00014236633,0.00007153695,0.0000010269498,0.0058039,0.7774784,0.036372226,0.15490393,0.014325816,0.0088982135],"study_design_scores_gemma":[0.0003499795,0.000096003685,0.0032757053,0.00004478209,0.000013749325,0.000017783192,0.000060278224,0.94733,0.023688145,0.02468995,0.00018419036,0.00024943825],"about_ca_topic_score_codex":0.000010677567,"about_ca_topic_score_gemma":2.148211e-7,"teacher_disagreement_score":0.6132012,"about_ca_system_score_codex":0.00011575328,"about_ca_system_score_gemma":0.0001654765,"threshold_uncertainty_score":0.8269732},"labels":[],"label_agreement":null},{"id":"W4293160491","doi":"10.1007/978-3-031-01759-9_1","title":"Introduction","year":2018,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Rendering (computer graphics); Graphics; Software rendering; Graphics pipeline; General-purpose computing on graphics processing units; Computer graphics (images); Graphics processing unit; Real-time computer graphics; Central processing unit; Computer graphics; 3D computer graphics; Parallel computing; Operating system","score_opus":0.009817182413005186,"score_gpt":0.21772199955279561,"score_spread":0.20790481713979042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293160491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035496885,0.0001757201,0.8595979,0.004045225,0.0013869611,0.0003441035,0.0000112876805,0.0017934685,0.13264176],"genre_scores_gemma":[0.0013161324,0.0001402823,0.8099598,0.005114922,0.019738639,0.000060609276,0.000059946808,0.00029520862,0.16331443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647945,0.00014200981,0.0005247861,0.0016268323,0.0007025926,0.0005243552],"domain_scores_gemma":[0.9966744,0.00046927057,0.00039949434,0.0020633303,0.00020951578,0.00018399562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003211963,0.00088583695,0.0007303312,0.0008115675,0.00034277633,0.00039623468,0.0022019905,0.00064213015,0.00069318875],"category_scores_gemma":[0.000073904856,0.0007594751,0.00042111083,0.00014592281,0.00018259173,0.00009811719,0.00058772677,0.0010641321,0.00066472933],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041878196,0.000046994508,2.7510652e-7,0.000058190355,0.00021431959,0.000036257803,0.00038995515,0.017008595,0.000019529098,0.08312383,0.48422086,0.4148393],"study_design_scores_gemma":[0.000113476635,0.0004282155,0.0000068460236,0.00029224087,0.000039383405,0.00013197616,2.1289803e-7,0.01753431,0.002291223,0.10844883,0.8696749,0.0010383482],"about_ca_topic_score_codex":0.0000020389984,"about_ca_topic_score_gemma":0.0000038196595,"teacher_disagreement_score":0.41380095,"about_ca_system_score_codex":0.00013447077,"about_ca_system_score_gemma":0.00011352399,"threshold_uncertainty_score":0.9994856},"labels":[],"label_agreement":null},{"id":"W4293195734","doi":"10.1007/978-3-030-95953-1_14","title":"Reordering Under the ECMAScript Memory Consistency Model","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Sequential consistency; Memory model; Compiler; Consistency model; Consistency (knowledge bases); Programming language; Semantics (computer science); Parallel computing; Optimizing compiler; Shared memory; Artificial intelligence","score_opus":0.026494084379799363,"score_gpt":0.2501140650597196,"score_spread":0.22361998067992025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293195734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010968472,0.00076868245,0.97223276,0.002331108,0.0012057367,0.00037836726,0.0000028278937,0.00054567715,0.022523848],"genre_scores_gemma":[0.074405804,0.000180073,0.9158455,0.007050903,0.00024371796,0.00003468957,0.0000057070115,0.00006263375,0.002170938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961691,0.00007575265,0.00056648784,0.0014389638,0.0011158161,0.00063390355],"domain_scores_gemma":[0.997032,0.000419515,0.00032700226,0.0018971367,0.00020545283,0.00011888441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013899975,0.00050334213,0.00045036734,0.00060344575,0.0009862818,0.0005875721,0.005254861,0.00019742205,0.000045079818],"category_scores_gemma":[0.000059155387,0.00040778163,0.00017241719,0.00068556605,0.00072072254,0.0004987759,0.003251059,0.0012227285,0.000012936901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016065725,0.000011744723,0.0000013724293,0.000009199622,0.000006978975,0.000016909282,0.00044503046,0.8296643,0.000016400296,0.09379477,0.0001072608,0.075924456],"study_design_scores_gemma":[0.000097086544,0.000052070383,0.0000037759544,0.00006819653,0.0000052465316,0.000055482484,4.4078755e-7,0.80269474,0.00017856818,0.19514978,0.0012781463,0.00041644258],"about_ca_topic_score_codex":0.000029115217,"about_ca_topic_score_gemma":0.000022824284,"teacher_disagreement_score":0.10135501,"about_ca_system_score_codex":0.0003683116,"about_ca_system_score_gemma":0.00088121434,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W4294881770","doi":"10.1145/3543859","title":"Heterogeneous Energy-aware Load Balancing for Industry 4.0 and IoT Environments","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Management Information Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Kernel (algebra); Distributed computing; Energy consumption; General-purpose computing on graphics processing units; Efficient energy use; Scheduling (production processes); Cluster analysis; Virtual machine; Parallel computing; Embedded system; Graphics; Operating system; Machine learning","score_opus":0.012730111580465562,"score_gpt":0.22142248193348085,"score_spread":0.2086923703530153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294881770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031135106,0.00003308987,0.99767715,0.00018345186,0.00035039484,0.00041635885,0.000021053196,0.00026477737,0.0007423552],"genre_scores_gemma":[0.9754643,0.000038468355,0.022044187,0.0007317167,0.00001383813,0.00065153005,0.000023283521,0.000008662022,0.0010240495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888,0.000057679896,0.00032931918,0.00018207349,0.0003769604,0.00017394654],"domain_scores_gemma":[0.99925494,0.0000431561,0.00015243044,0.00047269615,0.00002479458,0.000051963652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003157703,0.0001234572,0.00011164774,0.00023795411,0.0005833874,0.00020246947,0.0005185208,0.000055356923,0.0000091797665],"category_scores_gemma":[0.000002264033,0.00013661243,0.000044059074,0.0002164041,0.000010568483,0.000443358,0.00007340148,0.00013793517,0.0000064388983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013138307,0.000046040783,0.000015558218,0.00006824537,0.0000629269,0.0000014911335,0.00048730397,0.8985864,0.000002851614,0.003650586,0.0009566251,0.09610884],"study_design_scores_gemma":[0.00057126844,0.00014889527,0.000025820202,0.000023800669,0.000014357069,0.000027171847,0.00042971497,0.785138,0.00016504568,0.00024798803,0.21298453,0.00022342084],"about_ca_topic_score_codex":0.000021104004,"about_ca_topic_score_gemma":4.0387474e-7,"teacher_disagreement_score":0.97563297,"about_ca_system_score_codex":0.00019746783,"about_ca_system_score_gemma":0.000014773,"threshold_uncertainty_score":0.5570893},"labels":[],"label_agreement":null},{"id":"W4296433611","doi":"10.1007/978-3-031-15922-0_5","title":"Towards Automatic OpenMP-Aware Utilization of Fast GPU Memory","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Compiler; Parallel computing; Reuse; Shared memory; Memory management; Computer architecture; Operating system; Embedded system; Semiconductor memory","score_opus":0.028979810775775147,"score_gpt":0.27768554365217474,"score_spread":0.24870573287639958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296433611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002645197,0.00033194147,0.986372,0.0003228986,0.0010776035,0.00046874813,0.000008495528,0.00051425275,0.010877622],"genre_scores_gemma":[0.11252629,0.00013435374,0.8854398,0.00092362455,0.00017505806,0.000024800818,0.000027663156,0.000058106732,0.0006903137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611306,0.0000892887,0.00076959224,0.0012519625,0.0012973658,0.0004787181],"domain_scores_gemma":[0.99720013,0.0002401004,0.00059144327,0.0015086037,0.00033573894,0.00012401164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010736035,0.00048757668,0.0006617143,0.0011192271,0.00031482193,0.00028661903,0.0043491726,0.00023050005,0.00020600526],"category_scores_gemma":[0.00009151181,0.00046906364,0.0001596479,0.0010853844,0.00044163992,0.0006187703,0.0026605933,0.000633356,0.00001411674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025011032,0.000041158517,0.00001159207,0.0000856916,0.000011466565,0.000029195822,0.0008957476,0.19723672,0.000020581287,0.014303861,0.00011043677,0.78725106],"study_design_scores_gemma":[0.0001768482,0.00018805124,0.000053417454,0.0002808824,0.0000075958224,0.000044376666,4.0654908e-7,0.965374,0.0017802536,0.03048878,0.001106936,0.0004984576],"about_ca_topic_score_codex":0.00004225195,"about_ca_topic_score_gemma":0.000011154264,"teacher_disagreement_score":0.7867526,"about_ca_system_score_codex":0.0003219377,"about_ca_system_score_gemma":0.00089518714,"threshold_uncertainty_score":0.9997761},"labels":[],"label_agreement":null},{"id":"W4297671291","doi":"","title":"High Temperature Falling Particle Receiver - 1st Quarter Quad Chart.","year":2020,"lang":"en","type":"paratext","venue":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Falling (accident); Chart; Quarter (Canadian coin); Particle (ecology); Computer science; Statistics; Mathematics; Geology; History; Medicine","score_opus":0.012314124988486328,"score_gpt":0.22925813719113702,"score_spread":0.2169440122026507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297671291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027230145,0.0023742474,0.7986869,0.0057972404,0.0065005342,0.001650349,0.0011168764,0.0015376251,0.15510608],"genre_scores_gemma":[0.9404741,0.00042628695,0.052477345,0.00046396643,0.00009095443,0.000048129477,0.0032028495,0.0000173888,0.0027989638],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721575,0.0000775378,0.0011023829,0.00052308873,0.0007277075,0.0003535389],"domain_scores_gemma":[0.9976429,0.00013246741,0.0008225271,0.0006915231,0.0005054585,0.000205154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004541065,0.00035930728,0.0006017124,0.00028272564,0.00029346583,0.00044771514,0.0010165843,0.0003605783,0.00012106273],"category_scores_gemma":[0.00007832179,0.00032525993,0.00016351168,0.00089068955,0.00035907913,0.0012464217,0.00043863925,0.00030775816,0.00019377067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001058309,0.00039375506,0.000050940176,0.00046475296,0.00014869518,0.000004527536,0.00006193012,0.007086556,0.0021291978,0.09387488,0.8920435,0.0036354524],"study_design_scores_gemma":[0.0025632456,0.0018454301,0.0036232034,0.0014878911,0.00019990605,0.00006633678,0.000027693093,0.008790902,0.102300026,0.0015338222,0.8747958,0.0027657505],"about_ca_topic_score_codex":0.000033665685,"about_ca_topic_score_gemma":0.0000041489398,"teacher_disagreement_score":0.91324395,"about_ca_system_score_codex":0.000045603832,"about_ca_system_score_gemma":0.00020154733,"threshold_uncertainty_score":0.99991995},"labels":[],"label_agreement":null},{"id":"W4297903144","doi":"10.1007/s10664-022-10221-7","title":"On the usage and development of deep learning compilers: an empirical study on TVM","year":2022,"lang":"en","type":"article","venue":"Empirical Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Deep learning; Artificial intelligence; Software engineering; Programming language","score_opus":0.035874689591281164,"score_gpt":0.291733287783201,"score_spread":0.25585859819191986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297903144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39575717,0.000017801807,0.6035596,0.00008912552,0.00005411333,0.00011986585,2.719624e-7,0.000380836,0.000021183703],"genre_scores_gemma":[0.9149977,5.16492e-7,0.08466762,0.00025342326,0.000015299194,0.000038697857,0.0000020980476,0.000013394697,0.000011235259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986237,0.00018976821,0.00024885294,0.00033053316,0.00040220187,0.0002048946],"domain_scores_gemma":[0.99885863,0.00068175787,0.00006487297,0.0002873622,0.000027122238,0.00008023728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225129,0.0001491909,0.00017239901,0.00012223086,0.00040252294,0.000059656155,0.00053601974,0.000027649723,0.000017624434],"category_scores_gemma":[0.00023818144,0.00011937096,0.000028691004,0.00035676867,0.000015614158,0.000071722294,0.0004631085,0.00043350284,0.0000028539723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014068414,0.00048589328,0.0519694,0.000009524586,0.000031132447,0.000013991452,0.013052354,0.92129105,0.000015539632,0.00024920516,0.00028607447,0.0125817815],"study_design_scores_gemma":[0.0004618884,0.0017622868,0.1664804,0.00002687423,0.000005465957,0.0000107894575,0.00051025086,0.8241179,0.0003033708,0.00011091896,0.005751077,0.00045880355],"about_ca_topic_score_codex":0.0000015523246,"about_ca_topic_score_gemma":2.9574534e-7,"teacher_disagreement_score":0.51924056,"about_ca_system_score_codex":0.00007447127,"about_ca_system_score_gemma":0.000027925154,"threshold_uncertainty_score":0.48678064},"labels":[],"label_agreement":null},{"id":"W4297930510","doi":"10.5281/zenodo.55536","title":"Paired Faster Fft: Grigoryan Fft Implementation And Performance On Xilinx Fpgas And Tms Dsps","year":2016,"lang":"en","type":"article","venue":"INFM-OAR (INFN Catania)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Texas at San Antonio; University of Ottawa","keywords":"Field-programmable gate array; Fast Fourier transform; Computer science; Digital signal processing; Embedded system; Parallel computing; Computer hardware; Algorithm","score_opus":0.016989591630237524,"score_gpt":0.25764622556768213,"score_spread":0.2406566339374446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297930510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7960904,0.00013654486,0.19938159,0.0018563383,0.00025340664,0.0003711207,0.000015242448,0.0006099714,0.0012853884],"genre_scores_gemma":[0.9688756,0.00019381414,0.029917534,0.0006238593,0.00007603586,0.00002075889,0.0000075104053,0.000015176711,0.00026969623],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99860656,0.000067852954,0.0003018416,0.00047032651,0.0002481001,0.00030530064],"domain_scores_gemma":[0.999085,0.00010649892,0.00014085522,0.00046341866,0.000083896826,0.00012030245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035959439,0.00019945808,0.00017553566,0.00014300545,0.00021606467,0.00016661682,0.0003582136,0.000077965335,0.000022087923],"category_scores_gemma":[0.000024819155,0.00015270765,0.000029691304,0.0001718494,0.000087834174,0.00061259576,0.000248787,0.0000965345,0.000043228873],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008820326,0.00011731162,0.057328705,0.00010768053,0.00006784405,0.00002252914,0.003807871,0.00014181432,0.009388936,0.011410907,0.010042393,0.9074758],"study_design_scores_gemma":[0.009930038,0.0049947193,0.46664175,0.0010917081,0.00009595687,0.000421127,0.0004480604,0.35255715,0.07446047,0.006450606,0.078911595,0.0039968225],"about_ca_topic_score_codex":0.000025177602,"about_ca_topic_score_gemma":0.000017656856,"teacher_disagreement_score":0.903479,"about_ca_system_score_codex":0.000046961017,"about_ca_system_score_gemma":0.000045375546,"threshold_uncertainty_score":0.62272376},"labels":[],"label_agreement":null},{"id":"W4299148364","doi":"10.1007/978-3-031-01603-5","title":"Zero-Effort Technologies","year":2018,"lang":"en","type":"book","venue":"Synthesis lectures on assistive, rehabilitative, and health-preserving technologies","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Health Network; Research Institute for Aging; Toronto Rehabilitation Institute; University of Toronto; University of Waterloo","funders":"","keywords":"Zero (linguistics); Emerging technologies; Class (philosophy); Computer science; Artificial intelligence; Philosophy; Linguistics","score_opus":0.027597812041537936,"score_gpt":0.2985948623390841,"score_spread":0.27099705029754617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299148364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026383475,0.029659577,0.510822,0.094381995,0.0011954189,0.005299881,0.0002456313,0.065780304,0.29235137],"genre_scores_gemma":[0.056568693,0.013431638,0.8744646,0.0012351262,0.0001848041,0.0017409618,0.000051990268,0.00036855676,0.051953636],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937054,0.00037999902,0.0012012182,0.0025559943,0.0008925784,0.0012648046],"domain_scores_gemma":[0.9910858,0.0036233827,0.0012153498,0.0034127182,0.00051953347,0.00014316723],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0019009053,0.0012825725,0.0018446225,0.0019361877,0.0013098897,0.00046087918,0.004941364,0.0017337987,0.000017430577],"category_scores_gemma":[0.0057457434,0.0010889078,0.00035944945,0.0008281601,0.0021032274,0.00038522092,0.0033069598,0.0018053794,0.000042941978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007463197,0.00021516289,0.00046134755,0.0012377009,0.0002905141,0.000020488354,0.00069714535,0.000086538515,0.00001648535,0.13851155,0.5487753,0.3096131],"study_design_scores_gemma":[0.00035703336,0.0026895474,0.0024906623,0.004022549,0.000051222814,0.00002327265,0.00047335416,0.0034215592,0.002552462,0.82657635,0.15527797,0.0020640402],"about_ca_topic_score_codex":0.000053702595,"about_ca_topic_score_gemma":0.000041283634,"teacher_disagreement_score":0.6880648,"about_ca_system_score_codex":0.0008995076,"about_ca_system_score_gemma":0.00083263667,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W4300459205","doi":"10.5753/wscad.2004.19004","title":"O Consumo de Energia da Arquitetura DTSVLIW","year":2004,"lang":"pt","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alpha Technologies (Canada)","funders":"","keywords":"Humanities; Physics; Art","score_opus":0.025737210184228074,"score_gpt":0.28138529083028474,"score_spread":0.25564808064605665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300459205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040437356,0.00048275976,0.9707151,0.0042918334,0.00050356967,0.00016130113,0.0000029575888,0.0012560799,0.018542666],"genre_scores_gemma":[0.68096644,0.00013168767,0.30660832,0.002849061,0.00013444308,0.0000084208195,0.0000055893775,0.000023455983,0.009272556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977705,0.00013329247,0.0004321773,0.00062529545,0.00032819144,0.0007105837],"domain_scores_gemma":[0.99846625,0.00011037904,0.00016420613,0.0008034684,0.0001774796,0.00027819694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005476934,0.00030937977,0.00028730102,0.00019241299,0.00028875205,0.00062038907,0.001238085,0.00020623754,0.00014518225],"category_scores_gemma":[0.00008994096,0.00030058468,0.00013561113,0.000654727,0.00012756606,0.0003254635,0.00046458404,0.00028495598,0.00028747017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002127317,0.0005032623,0.0011628289,0.00007744211,0.00010529268,0.00019415728,0.0038434211,0.2529592,0.00078256545,0.65261555,0.069589704,0.0181453],"study_design_scores_gemma":[0.0032374563,0.00069991744,0.0024267554,0.0005474204,0.00007356332,0.00049504946,0.00017993318,0.8497354,0.05578626,0.045509983,0.038894653,0.0024136428],"about_ca_topic_score_codex":0.00023574893,"about_ca_topic_score_gemma":0.000012308578,"teacher_disagreement_score":0.67692274,"about_ca_system_score_codex":0.00020072928,"about_ca_system_score_gemma":0.00048196697,"threshold_uncertainty_score":0.9999446},"labels":[],"label_agreement":null},{"id":"W4306316908","doi":"10.1145/3511808.3557117","title":"BLUTune: Query-informed Multi-stage IBM Db2 Tuning via ML","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 31st ACM International Conference on Information &amp; Knowledge Management","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); Ontario Tech University; York University","funders":"","keywords":"Computer science; IBM; Reinforcement learning; Embedding; Process (computing); Artificial intelligence; Resource (disambiguation); Machine learning; Operating system","score_opus":0.07434386009228877,"score_gpt":0.3228954959479354,"score_spread":0.2485516358556466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306316908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029300808,0.000016876682,0.5626501,0.0026340408,0.0013194219,0.0008168053,0.00002301871,0.00058608147,0.4290236],"genre_scores_gemma":[0.8427862,0.00007016472,0.13571654,0.00086498825,0.000059554117,0.00032023314,0.000074961594,0.000017749937,0.020089587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978054,0.00002533265,0.00073697057,0.00027946124,0.0008705893,0.0002822284],"domain_scores_gemma":[0.99774927,0.000049783906,0.0007955469,0.0004792196,0.0008557986,0.0000703853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076630845,0.0002463619,0.00019862468,0.0006313839,0.000505707,0.00043589793,0.0043858713,0.00004984965,0.00022003404],"category_scores_gemma":[0.00023357716,0.00021978629,0.00013632064,0.00066811586,0.00006623215,0.001573996,0.0039204103,0.00033834745,0.0001440255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057485755,0.0002446452,0.0005788713,0.00020065729,0.00013179712,2.5970903e-7,0.006570144,0.005313573,0.0001724833,0.94304085,0.02194396,0.0217453],"study_design_scores_gemma":[0.0013450058,0.0001083004,0.0012429481,0.00019881298,0.000022300259,0.000012700247,0.0014261547,0.55470407,0.00092053425,0.0075539737,0.4318624,0.0006028053],"about_ca_topic_score_codex":0.000016268601,"about_ca_topic_score_gemma":0.0000065887257,"teacher_disagreement_score":0.93548685,"about_ca_system_score_codex":0.00037958115,"about_ca_system_score_gemma":0.00008276253,"threshold_uncertainty_score":0.89626247},"labels":[],"label_agreement":null},{"id":"W4307921918","doi":"10.32920/21463020.v1","title":"Introducing TAM: Time-Based Access Memory","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interleaved memory; Parallel computing; Uniform memory access; Access time; Static random-access memory; Scalability; Registered memory; Dram; Shared memory; Cache-only memory architecture; CPU cache; Embedded system; Cache; Memory management; Computer hardware; Semiconductor memory; Operating system","score_opus":0.024098406450810187,"score_gpt":0.2963662504187466,"score_spread":0.2722678439679364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307921918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019417761,0.00009736539,0.954806,0.00214395,0.0008122075,0.00031190392,0.0000033756753,0.0029438396,0.038687162],"genre_scores_gemma":[0.01799615,0.00001851582,0.97049934,0.002735923,0.00026030728,0.0001394529,0.000082106424,0.00003681425,0.008231401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976443,0.00023605752,0.00036638766,0.0010200464,0.00043888623,0.00029432998],"domain_scores_gemma":[0.99760205,0.00012614962,0.00026038635,0.0018003988,0.00012476787,0.00008624504],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077246205,0.00027807296,0.000330431,0.00036259845,0.0002375951,0.0007799686,0.004547235,0.00014296031,0.0010462312],"category_scores_gemma":[0.00007398296,0.00028334503,0.00015002927,0.00041247805,0.00002913274,0.00021602647,0.0080251945,0.00072195183,0.000053226864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025911115,0.000049621605,0.000031064697,0.00003956339,0.000015058227,0.000009526565,0.00007701869,0.94196,0.000014842764,0.0010867568,0.04980489,0.006909076],"study_design_scores_gemma":[0.00011145613,0.000025207595,0.000054799726,0.000030209987,0.0000058970586,0.0000020711088,0.0000017479261,0.9909098,0.0017551936,0.0023459324,0.0043838094,0.00037387083],"about_ca_topic_score_codex":0.000118812124,"about_ca_topic_score_gemma":9.28285e-7,"teacher_disagreement_score":0.04894981,"about_ca_system_score_codex":0.00015222903,"about_ca_system_score_gemma":0.000430598,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W4307923852","doi":"10.32920/21463020","title":"Introducing TAM: Time-Based Access Memory","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Interleaved memory; Parallel computing; Uniform memory access; Static random-access memory; Access time; Scalability; Registered memory; Dram; Shared memory; Cache-only memory architecture; Embedded system; Memory management; Semiconductor memory; Computer hardware; Operating system","score_opus":0.024098406450810187,"score_gpt":0.2963662504187466,"score_spread":0.2722678439679364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307923852","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019417761,0.00009736539,0.954806,0.00214395,0.0008122075,0.00031190392,0.0000033756753,0.0029438396,0.038687162],"genre_scores_gemma":[0.01799615,0.00001851582,0.97049934,0.002735923,0.00026030728,0.0001394529,0.000082106424,0.00003681425,0.008231401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976443,0.00023605752,0.00036638766,0.0010200464,0.00043888623,0.00029432998],"domain_scores_gemma":[0.99760205,0.00012614962,0.00026038635,0.0018003988,0.00012476787,0.00008624504],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077246205,0.00027807296,0.000330431,0.00036259845,0.0002375951,0.0007799686,0.004547235,0.00014296031,0.0010462312],"category_scores_gemma":[0.00007398296,0.00028334503,0.00015002927,0.00041247805,0.00002913274,0.00021602647,0.0080251945,0.00072195183,0.000053226864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025911115,0.000049621605,0.000031064697,0.00003956339,0.000015058227,0.000009526565,0.00007701869,0.94196,0.000014842764,0.0010867568,0.04980489,0.006909076],"study_design_scores_gemma":[0.00011145613,0.000025207595,0.000054799726,0.000030209987,0.0000058970586,0.0000020711088,0.0000017479261,0.9909098,0.0017551936,0.0023459324,0.0043838094,0.00037387083],"about_ca_topic_score_codex":0.000118812124,"about_ca_topic_score_gemma":9.28285e-7,"teacher_disagreement_score":0.04894981,"about_ca_system_score_codex":0.00015222903,"about_ca_system_score_gemma":0.000430598,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W4308075506","doi":"10.1109/sips55645.2022.9919203","title":"BERTPerf: Inference Latency Predictor for BERT on ARM big.LITTLE Multi-Core Processors","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Latency (audio); Inference; FLOPS; Proxy (statistics); Exploit; Scheduling (production processes); Architecture; Parallel computing; Computer engineering; Microarchitecture; Real-time computing; Design space exploration; Embedded system; Artificial intelligence; Machine learning","score_opus":0.05940127950744419,"score_gpt":0.3041473476449196,"score_spread":0.24474606813747538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308075506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067472383,0.000035806468,0.98635095,0.00071534346,0.00035866504,0.0004672468,0.000012343964,0.0011348911,0.004177497],"genre_scores_gemma":[0.74624395,0.00001022468,0.24756758,0.0007843571,0.000051287614,0.00033433212,0.000017219654,0.000015658732,0.004975384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986618,0.00003853205,0.00024303139,0.0004764095,0.00029115513,0.00028904786],"domain_scores_gemma":[0.99909705,0.00016107394,0.0001005842,0.00043594316,0.00012503454,0.00008033154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002790132,0.00015543394,0.0001537606,0.00014647635,0.00041907298,0.00008413502,0.00078819186,0.000043342683,0.0000521144],"category_scores_gemma":[0.00012465392,0.00013868866,0.00006887838,0.00042522297,0.000024688863,0.00013826623,0.00040754877,0.00016910335,0.000011049396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002243286,0.005414316,0.01989864,0.00028633393,0.0001536582,0.000027527576,0.010181191,0.33029112,0.00058263703,0.42410025,0.072766714,0.1360733],"study_design_scores_gemma":[0.00054157013,0.0006473492,0.00092243205,0.000015320096,0.0000037716634,0.0000053912618,0.000021784608,0.9825691,0.0015501383,0.004744722,0.008708411,0.00026998733],"about_ca_topic_score_codex":0.00003089255,"about_ca_topic_score_gemma":0.000006200003,"teacher_disagreement_score":0.7394967,"about_ca_system_score_codex":0.000060348153,"about_ca_system_score_gemma":0.00012158607,"threshold_uncertainty_score":0.56555593},"labels":[],"label_agreement":null},{"id":"W4308084253","doi":"10.1109/cases55004.2022.00008","title":"Work-in-Progress: MLGOPerf: An ML Guided Inliner to Optimize Performance","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Speedup; Computer science; Spec#; Reinforcement learning; Code (set theory); Parallel computing; Function (biology); Performance improvement; Artificial intelligence; Programming language","score_opus":0.04182869328765641,"score_gpt":0.3183737498113519,"score_spread":0.2765450565236955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308084253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030046817,0.00024394403,0.9523822,0.0023271577,0.0010107444,0.0008926514,0.000003618949,0.0023723994,0.010720449],"genre_scores_gemma":[0.105692595,0.00010934263,0.88991624,0.0014370802,0.00010794692,0.00032092794,0.000039718063,0.00003626433,0.0023398742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967043,0.00022481334,0.0006885876,0.0013054466,0.0005425032,0.00053438183],"domain_scores_gemma":[0.997294,0.000043493957,0.00019796609,0.0020700826,0.00017357407,0.00022086868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010171531,0.00042125417,0.0004829715,0.0005898265,0.00018112897,0.00047891345,0.004007508,0.00021503582,0.00021714215],"category_scores_gemma":[0.000039987324,0.00040839863,0.000109527544,0.0010635864,0.000039463936,0.00034543444,0.00648515,0.00085921044,0.000040099672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017970313,0.00014398222,0.0024966125,0.000027963502,0.000011203138,0.000016418164,0.00068258576,0.9589235,0.0000012244079,0.0010350965,0.011484151,0.025159288],"study_design_scores_gemma":[0.00024509503,0.00015072511,0.0022755144,0.00013382416,0.0000043032087,0.0000069210673,0.00001589166,0.9869999,0.0001609076,0.00029368204,0.008974506,0.00073868694],"about_ca_topic_score_codex":0.00006917867,"about_ca_topic_score_gemma":0.0000048836646,"teacher_disagreement_score":0.07564578,"about_ca_system_score_codex":0.00020662723,"about_ca_system_score_gemma":0.00024818297,"threshold_uncertainty_score":0.9998368},"labels":[],"label_agreement":null},{"id":"W4309535831","doi":"10.1016/j.jpdc.2022.11.004","title":"PTTS: Power-aware tensor cores using two-sided sparsity","year":2022,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Exploit; Overhead (engineering); Matrix multiplication; Sparse matrix; Power gating; Power (physics); Gating; Tensor (intrinsic definition); Energy (signal processing); Parallel computing; Algorithm; Physics","score_opus":0.025304855769364153,"score_gpt":0.27650030967810746,"score_spread":0.2511954539087433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309535831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756685,0.00040183775,0.80110073,0.00033526003,0.00029965944,0.00008036081,0.000012890658,0.0001242943,0.00007810394],"genre_scores_gemma":[0.8747309,0.000013559195,0.12490731,0.00023513705,0.0000841491,6.2105033e-7,0.000007896877,0.000009209756,0.000011226599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978714,0.00027253287,0.0006883426,0.0002967189,0.0005042031,0.0003668179],"domain_scores_gemma":[0.9981631,0.00022083556,0.0008587445,0.00027013887,0.0003023594,0.00018479515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009172851,0.00020716818,0.00041396412,0.00022371896,0.0008559518,0.00021901318,0.00087890925,0.000043520766,0.000018109295],"category_scores_gemma":[0.000110606394,0.00019777345,0.00015092829,0.0005573958,0.00005571077,0.00030203917,0.00096350804,0.00048623633,0.0000010734501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060992126,0.00016775724,0.008920866,0.000012932966,0.00007519979,0.00023911476,0.00052442774,0.9805678,0.0001903534,0.0038043405,0.0030699123,0.0023663149],"study_design_scores_gemma":[0.0012123937,0.00032801583,0.0044782753,0.00006547122,0.00002437446,0.0014478453,0.0002840366,0.9881962,0.00006845596,0.0026470327,0.0009380446,0.0003098578],"about_ca_topic_score_codex":0.000025876378,"about_ca_topic_score_gemma":4.479257e-7,"teacher_disagreement_score":0.677164,"about_ca_system_score_codex":0.00013413683,"about_ca_system_score_gemma":0.00015356221,"threshold_uncertainty_score":0.80649674},"labels":[],"label_agreement":null},{"id":"W4309787646","doi":"10.3390/computers11110164","title":"Arbitrarily Parallelizable Code: A Model of Computation Evaluated on a Message-Passing Many-Core System","year":2022,"lang":"en","type":"article","venue":"Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Correctness; Parallel computing; Multi-core processor; Compiler; Programming paradigm; Automatic parallelization; Computation; Message passing; Semantics (computer science); Parallel programming model; Execution model; Programming language; Distributed computing; Theoretical computer science","score_opus":0.05452863552643918,"score_gpt":0.2871183044849428,"score_spread":0.2325896689585036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309787646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009773418,0.000072233604,0.98561937,0.00025412734,0.0004492066,0.0003590908,0.000010748516,0.0011165943,0.0023451985],"genre_scores_gemma":[0.68725324,0.0000025602865,0.3122075,0.00036809704,0.00001823612,0.000035221306,0.000020023912,0.000018113049,0.00007697793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756473,0.00026182662,0.0005329001,0.0005909426,0.0007119535,0.00033765947],"domain_scores_gemma":[0.99861383,0.00014600223,0.00038940698,0.00058749306,0.00016667398,0.00009658661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007056276,0.00023742102,0.00037363244,0.00034880126,0.0004790067,0.00012372811,0.0011858674,0.000056591365,0.0000035948233],"category_scores_gemma":[0.000013138444,0.00025756337,0.00013077474,0.00073569495,0.000048181,0.00020403469,0.0006210947,0.000281759,0.0000056632093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022889,0.00009685686,0.00001665082,0.000046909638,0.000025842242,0.000010912911,0.0005331546,0.9484263,0.00015653661,0.042012393,0.004796806,0.0038547507],"study_design_scores_gemma":[0.0006267119,0.00024200181,0.00004891361,0.000097282405,0.000011615153,0.000025366986,0.00004070515,0.99606234,0.000308435,0.0021359334,0.00014392777,0.000256765],"about_ca_topic_score_codex":0.00001641369,"about_ca_topic_score_gemma":2.857777e-7,"teacher_disagreement_score":0.67747986,"about_ca_system_score_codex":0.00026220686,"about_ca_system_score_gemma":0.00018850737,"threshold_uncertainty_score":0.99998766},"labels":[],"label_agreement":null},{"id":"W4309795636","doi":"","title":"Explicit construction of reproducing kernels","year":2022,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science","score_opus":0.023380164936866787,"score_gpt":0.24630212124755826,"score_spread":0.22292195631069148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309795636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01976223,0.0016042243,0.90852106,0.011189214,0.0008504668,0.0005377573,0.000037817346,0.00084820134,0.056649044],"genre_scores_gemma":[0.21144927,0.0012775742,0.7686331,0.00009584892,0.000046047433,0.00009039713,0.0001732744,0.000052613595,0.018181851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9865136,0.009204436,0.0012479684,0.0017492429,0.000786176,0.0004985767],"domain_scores_gemma":[0.9886469,0.0015764262,0.0016890306,0.004612733,0.0032767637,0.00019811108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.011126923,0.00046853133,0.000667342,0.00035777866,0.0007277138,0.0004548745,0.0029930822,0.00030843305,0.00051368045],"category_scores_gemma":[0.002250466,0.0005883276,0.00036274426,0.0011443961,0.0004097987,0.00036805766,0.0045393584,0.0010161096,0.000024854757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009886161,0.00051868224,0.001989141,0.00021578462,0.00008802233,0.000006392564,0.014051296,0.008380828,0.0010458555,0.89288664,0.0015109578,0.07929652],"study_design_scores_gemma":[0.00081915094,0.0000031577567,0.0041241758,0.0037648915,0.00009754289,0.00013566186,0.00038036442,0.73674643,0.1482778,0.04005025,0.064244024,0.0013565419],"about_ca_topic_score_codex":0.0022051323,"about_ca_topic_score_gemma":0.00009260104,"teacher_disagreement_score":0.8528364,"about_ca_system_score_codex":0.00024605208,"about_ca_system_score_gemma":0.0006098178,"threshold_uncertainty_score":0.9996568},"labels":[],"label_agreement":null},{"id":"W4310916451","doi":"10.52843/cassyni.32zgyn","title":"Some Ideas for Future Algorithms for Multidisciplinary Analysis and Optimization: Nonlinear Stability, Algorithm Optimization, and Monolithic Methods","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Optimization algorithm; Algorithm; Stability (learning theory); Computer science; Nonlinear system; Optimization problem; Multidisciplinary design optimization; Mathematical optimization; Multidisciplinary approach; Mathematics; Machine learning; Physics","score_opus":0.03571805442481676,"score_gpt":0.3588015103811603,"score_spread":0.3230834559563436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310916451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016343278,0.0045015835,0.98936874,0.0019355272,0.00067327084,0.0022399786,0.0003237725,0.0009115509,0.000029208522],"genre_scores_gemma":[0.000020063164,0.002543359,0.99451095,0.00024153701,0.0005028915,0.0009975876,0.00093472697,0.00005814646,0.00019076625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958592,0.00046283068,0.0009299059,0.0019212285,0.00035298464,0.0004738351],"domain_scores_gemma":[0.9964657,0.0007338247,0.0005690095,0.0012468213,0.000743629,0.00024105712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024582755,0.000599073,0.0010104026,0.000803837,0.00087415776,0.00064633455,0.0011384273,0.00048368657,0.000032327494],"category_scores_gemma":[0.0001465365,0.00059843925,0.00039146398,0.0010215266,0.00012261003,0.00056414027,0.003802364,0.00048771905,9.411311e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013699171,0.000098113975,0.00006813043,0.0002043645,0.0003567135,8.483703e-7,0.0006294243,0.9706271,5.3323765e-7,0.0017793878,0.00011411562,0.026107522],"study_design_scores_gemma":[0.0005716546,0.00016480878,0.000037741105,0.00001645396,0.00038961868,0.0000059049585,0.00014510463,0.9846035,0.00010855776,0.012620406,0.0006492739,0.0006869274],"about_ca_topic_score_codex":0.00004106821,"about_ca_topic_score_gemma":0.0000037172804,"teacher_disagreement_score":0.025420595,"about_ca_system_score_codex":0.00013102828,"about_ca_system_score_gemma":0.0002664962,"threshold_uncertainty_score":0.9996467},"labels":[],"label_agreement":null},{"id":"W4311397127","doi":"","title":"An imperative programming language characterizing FBQP","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Future Earth","funders":"","keywords":"Computer science; Programming language","score_opus":0.01290347158877168,"score_gpt":0.260635363264313,"score_spread":0.24773189167554135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311397127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031574387,0.00050238037,0.950985,0.003753264,0.0002654739,0.0005388062,0.000024640458,0.0025518155,0.009804228],"genre_scores_gemma":[0.35939112,0.00014112015,0.63767534,0.00022715912,0.000032660835,0.00017812979,0.000501066,0.0000428809,0.0018105144],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99171555,0.0057205427,0.00051333726,0.0011217436,0.0004988419,0.00042995522],"domain_scores_gemma":[0.99475574,0.0005026549,0.0005768633,0.002959819,0.0010065037,0.00019839179],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0049977647,0.00037066068,0.0003770671,0.00028265687,0.0007141883,0.0013627041,0.0034735324,0.00020043326,0.000097672026],"category_scores_gemma":[0.00043342786,0.000418022,0.00018147733,0.0005347348,0.00010394793,0.00042515545,0.0034181117,0.0009392905,0.000011898751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016001743,0.0020620364,0.0016276736,0.00030074283,0.00019508037,0.000078850935,0.18221185,0.0032472005,0.009999962,0.25000086,0.0017331277,0.54852664],"study_design_scores_gemma":[0.0005450974,0.0000034474422,0.0018401594,0.0010678711,0.000032870757,0.000033450608,0.0006094221,0.9135843,0.05676388,0.002971274,0.021069158,0.0014790653],"about_ca_topic_score_codex":0.0005327306,"about_ca_topic_score_gemma":0.000097576536,"teacher_disagreement_score":0.9103371,"about_ca_system_score_codex":0.00016487403,"about_ca_system_score_gemma":0.00031883843,"threshold_uncertainty_score":0.99982715},"labels":[],"label_agreement":null},{"id":"W4311681122","doi":"10.22215/etd/2022-15287","title":"Cross-Paradigm Compilation across Programming Models: from Imperative to Asynchronous Graph","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Compiler; Programming language; Asynchronous communication; Semantics (computer science); Parallel computing; Graph; Suite; Implementation; Theoretical computer science","score_opus":0.021234870631815464,"score_gpt":0.32974703396956007,"score_spread":0.3085121633377446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311681122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016125396,0.00031451235,0.9742034,0.000098306555,0.00089946185,0.0008578544,0.00009084927,0.001789582,0.005620658],"genre_scores_gemma":[0.25167874,0.000058246922,0.73414254,0.00052932376,0.00019043044,0.0006676041,0.0066860393,0.00009679692,0.005950287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692124,0.00013450229,0.00062167906,0.0011548674,0.00063095905,0.000536731],"domain_scores_gemma":[0.99828213,0.00011947554,0.00033999377,0.0008367123,0.00024620237,0.00017549828],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035388244,0.00045856994,0.00046663528,0.0002608997,0.00091578363,0.0013104514,0.0016151116,0.00024901354,0.00014243528],"category_scores_gemma":[0.000028614038,0.00048441676,0.0001922746,0.0008974534,0.000028477749,0.0007608206,0.00036241577,0.00048628924,0.000032365297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001165159,0.00032744874,0.000329282,0.00006170639,0.00019556272,0.000029264029,0.04562381,0.72727436,0.00008945851,0.059485693,0.0028393315,0.16362758],"study_design_scores_gemma":[0.00057581806,0.0004073735,0.0025218634,0.00011235859,0.000022593842,0.0000063390767,0.0007980747,0.9572275,0.0023399321,0.027957657,0.0064439485,0.0015865066],"about_ca_topic_score_codex":0.0006834284,"about_ca_topic_score_gemma":0.00031439087,"teacher_disagreement_score":0.24006084,"about_ca_system_score_codex":0.00022689412,"about_ca_system_score_gemma":0.00020351063,"threshold_uncertainty_score":0.99976075},"labels":[],"label_agreement":null},{"id":"W4312267400","doi":"10.1109/tetc.2022.3226132","title":"ALP: Alleviating CPU-Memory Data Movement Overheads in Memory-Centric Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"VMware; Google; Microsoft; Semiconductor Research Corporation","keywords":"Computer science; Overhead (engineering); Speedup; Programmer; Compiler; Parallel computing; Instruction prefetch; Data structure; Central processing unit; Key (lock); Embedded system; Computer hardware; Operating system; Cache","score_opus":0.0380611044847252,"score_gpt":0.29284663673082084,"score_spread":0.2547855322460956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312267400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016359163,0.00025835476,0.9785521,0.0006200207,0.002257747,0.00040575504,0.000008479677,0.0004897096,0.0010486454],"genre_scores_gemma":[0.9537848,0.00004279477,0.045212418,0.00049084896,0.000110393725,0.00003553293,0.0000092459495,0.000025483643,0.00028847574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670064,0.00043910867,0.00081634714,0.0008689488,0.0006195106,0.0005554351],"domain_scores_gemma":[0.99814665,0.00026574853,0.00023895512,0.0012299181,0.00004674124,0.00007195924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017325814,0.00025240798,0.00033423028,0.00073520286,0.000620345,0.00015829243,0.0019892573,0.00006636652,0.000022943694],"category_scores_gemma":[0.000022726173,0.0003107747,0.00006883485,0.0014722435,0.000022717019,0.0003248854,0.00016887278,0.00085931754,0.0000047745257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004326503,0.00020923886,0.00018979143,0.000029871728,0.000012801934,0.000029903227,0.0010775827,0.9554021,0.000019221321,0.0005594833,0.0002466453,0.04221907],"study_design_scores_gemma":[0.000588252,0.00006250042,0.00013560113,0.00010827713,0.0000045383194,0.000012732768,0.0002797164,0.9973576,0.00022536608,0.00016275342,0.0007541067,0.00030857406],"about_ca_topic_score_codex":0.00045531173,"about_ca_topic_score_gemma":0.00003539989,"teacher_disagreement_score":0.9374257,"about_ca_system_score_codex":0.00048610233,"about_ca_system_score_gemma":0.00011821182,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W4312547955","doi":"10.1109/ic2e55432.2022.00030","title":"Workload-aware Dynamic GPU Resource Management in Component-based Applications","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Overhead (engineering); Component (thermodynamics); Workload; Cloud computing; Distributed computing; CUDA; General-purpose computing on graphics processing units; Human multitasking; Graphics; Resource allocation; Supercomputer; Throughput; Parallel computing; Shared memory; Operating system; Computer network","score_opus":0.009971331789702975,"score_gpt":0.2498508774145525,"score_spread":0.23987954562484953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312547955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016277963,0.000075136035,0.97928417,0.0013159557,0.000027278154,0.00036834093,0.0000012949064,0.0007393027,0.018025719],"genre_scores_gemma":[0.6040359,0.000011735002,0.3919014,0.0015218883,0.00000625263,0.0006024324,0.000024847215,0.000010987656,0.0018845209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989251,0.000104803396,0.00019820058,0.00034143467,0.00023977197,0.00019069617],"domain_scores_gemma":[0.9992938,0.000044445125,0.00005830239,0.000548448,0.000015200986,0.00003980583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026825554,0.00009047005,0.000091582086,0.00026153016,0.00024362002,0.00006094549,0.0009937003,0.000016941602,0.000062388404],"category_scores_gemma":[8.593666e-7,0.00010060439,0.00003679954,0.0008639361,0.000015427702,0.000055660403,0.0005849006,0.0001414112,0.000015616783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019665813,0.00038843547,0.00023823265,0.000018986131,0.000012449827,0.000024029147,0.000107761785,0.8356946,0.000011704732,0.056191534,0.010579145,0.096713424],"study_design_scores_gemma":[0.0002460438,0.000043979115,0.00031780705,0.000008230315,0.000001472223,0.0000021841338,0.000054426033,0.94697666,0.000030627696,0.0010623346,0.05111801,0.00013819928],"about_ca_topic_score_codex":0.000009420753,"about_ca_topic_score_gemma":0.000004657075,"teacher_disagreement_score":0.60387313,"about_ca_system_score_codex":0.0001428264,"about_ca_system_score_gemma":0.00002086199,"threshold_uncertainty_score":0.4102528},"labels":[],"label_agreement":null},{"id":"W4312548704","doi":"10.1007/978-3-031-17436-0_3","title":"Recycling Memory in Recoverable Mutex Locks","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semaphore; Computer science; Mutual exclusion; Dram; Memory hierarchy; Cache; Correctness; Distributed computing; Focus (optics); Synchronization (alternating current); Context (archaeology); Parallel computing; State (computer science); Memory management; Context switch; Embedded system; Operating system; Computer network; Algorithm; Computer hardware","score_opus":0.017373553250823105,"score_gpt":0.2502129989184866,"score_spread":0.23283944566766349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312548704","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005967609,0.0005742905,0.97102636,0.000651053,0.0016858752,0.00037287327,0.0000023568105,0.00044333463,0.025184168],"genre_scores_gemma":[0.029517094,0.00030641255,0.9648368,0.0025139072,0.00033216318,0.000028378236,0.000011327005,0.00006159759,0.0023923258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957193,0.000094297495,0.0007267577,0.0017642432,0.0009596438,0.0007357442],"domain_scores_gemma":[0.99735457,0.0005330191,0.00035183728,0.0014948559,0.00013402604,0.00013169648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001884075,0.0004993812,0.0005925113,0.0015426592,0.0003599255,0.00044518075,0.0040484006,0.00028898413,0.00010740112],"category_scores_gemma":[0.00013275002,0.00053215824,0.00013378939,0.0011673936,0.0002548724,0.0007037747,0.0023288152,0.0014813005,0.000021785008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047848903,0.000029437588,0.00003748695,0.000018750376,0.000004317779,0.00012446413,0.00051820197,0.5357869,0.000019965984,0.004294761,0.00011308806,0.45904782],"study_design_scores_gemma":[0.0002918562,0.0001527229,0.000029509689,0.0003178645,0.0000030099118,0.0000690324,2.0498668e-7,0.87390256,0.000901834,0.11633407,0.0071899313,0.0008074101],"about_ca_topic_score_codex":0.000114636845,"about_ca_topic_score_gemma":0.00007474852,"teacher_disagreement_score":0.45824042,"about_ca_system_score_codex":0.00070252694,"about_ca_system_score_gemma":0.0006415829,"threshold_uncertainty_score":0.999713},"labels":[],"label_agreement":null},{"id":"W4312770418","doi":"10.1109/iisa56318.2022.9904350","title":"Vectorising k-Truss Decomposition for Simple Multi-Core and SIMD Acceleration","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Acceleration; SIMD; Truss; Simple (philosophy); Computer science; Decomposition; Core (optical fiber); Parallel computing; Computational science; Physics; Structural engineering; Engineering; Telecommunications; Classical mechanics; Chemistry","score_opus":0.04847320295917813,"score_gpt":0.3321528727900387,"score_spread":0.28367966983086057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312770418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014260809,0.000036497877,0.98447126,0.00022712396,0.00011542946,0.00022198592,0.0000023184466,0.00043379667,0.00023079653],"genre_scores_gemma":[0.60097176,0.0000027584492,0.39861062,0.00026662875,0.000020624033,0.000038614955,0.000016281167,0.0000042747274,0.00006845972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993867,0.00003368991,0.00012819828,0.00023008941,0.00010033744,0.000120936274],"domain_scores_gemma":[0.999643,0.00006992518,0.00005563388,0.00015246429,0.000046985715,0.00003193711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002113972,0.00006727189,0.00007309085,0.000074112875,0.00054423517,0.00013871613,0.0001942106,0.000018548146,0.000008729368],"category_scores_gemma":[0.000014112879,0.00006957729,0.00002487854,0.00015485499,0.0000074361374,0.0002298555,0.000213475,0.000056849123,5.9159953e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009804174,0.0007255276,0.0054410174,0.000095536045,0.00006803544,0.000007606468,0.0049130586,0.40096068,0.027162574,0.2527668,0.054573238,0.25318787],"study_design_scores_gemma":[0.00027443407,0.000115306626,0.00047340489,0.000001515023,0.000001850289,0.0000071198465,0.000017163295,0.9901411,0.002775856,0.0033065577,0.0027819548,0.00010375417],"about_ca_topic_score_codex":0.000021925567,"about_ca_topic_score_gemma":0.0000037680886,"teacher_disagreement_score":0.5891804,"about_ca_system_score_codex":0.000041245206,"about_ca_system_score_gemma":0.00001926062,"threshold_uncertainty_score":0.4185872},"labels":[],"label_agreement":null},{"id":"W4312851536","doi":"10.1109/iscas48785.2022.9937872","title":"Power-Aware Computing on GPGPU Systems Using ML Classification Techniques","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Symposium on Circuits and Systems (ISCAS)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"General-purpose computing on graphics processing units; Computer science; Parallel computing; Supercomputer; Operating system; Graphics","score_opus":0.04212018802114641,"score_gpt":0.29184848725644674,"score_spread":0.24972829923530032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312851536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06227079,0.0003208939,0.897502,0.0011816043,0.009801073,0.0013418631,0.00011139621,0.0016374638,0.025832908],"genre_scores_gemma":[0.99793565,0.000032069536,0.00045096883,0.0003239837,0.00035833544,0.00010757849,0.000031767817,0.000037662376,0.000721988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642,0.00046976953,0.00073444896,0.0008764813,0.0011513949,0.00034790148],"domain_scores_gemma":[0.9982393,0.00021224374,0.00057467894,0.00059552846,0.000256954,0.00012130768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011922922,0.00031638873,0.0003613185,0.0004471504,0.0008360756,0.0007267531,0.0012145862,0.000109258544,0.000018227125],"category_scores_gemma":[0.00002425681,0.00032348445,0.00010771909,0.00043681054,0.000039465616,0.0002889012,0.00032295779,0.00043286372,0.000011283286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005289749,0.00081909774,0.0023252985,0.00018618943,0.00030466236,0.00015431977,0.0029417549,0.597697,0.031362377,0.33781725,0.016669672,0.009669425],"study_design_scores_gemma":[0.00025986572,0.0003361449,0.00022180709,0.00020159739,0.000007191371,0.00029654408,0.00030005272,0.9827062,0.0006865286,0.00006676679,0.014497474,0.00041982546],"about_ca_topic_score_codex":0.00015827056,"about_ca_topic_score_gemma":7.4958956e-7,"teacher_disagreement_score":0.93566483,"about_ca_system_score_codex":0.00058522983,"about_ca_system_score_gemma":0.00006597208,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W4313012479","doi":"10.1609/socs.v15i1.21754","title":"A Memory-Bounded Best-First Beam Search and Its Application to Scheduling Halide Programs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Beam search; Search algorithm; Beam stack search; Computer science; Bounded function; Best-first search; Iterative deepening depth-first search; Computation; Mathematical optimization; Scheduling (production processes); Algorithm; Theoretical computer science; Mathematics","score_opus":0.0191383338720527,"score_gpt":0.27400606642729836,"score_spread":0.25486773255524564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313012479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96485615,0.000038188195,0.008770013,0.017726474,0.0017705996,0.0016543131,0.0000067214855,0.00031844963,0.0048590885],"genre_scores_gemma":[0.9948918,0.0000117644195,0.0042343964,0.00017846133,0.00016226123,0.00024063086,0.0000022203576,0.000017002536,0.0002614503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975039,0.000029273333,0.0002997163,0.0004992973,0.0013971722,0.00027066335],"domain_scores_gemma":[0.9987585,0.00010515157,0.00011620687,0.0001871057,0.0007190653,0.000113991715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012159324,0.00014789685,0.00015772144,0.00018586587,0.0006193339,0.00031745338,0.0024879645,0.000047860292,0.0000062855966],"category_scores_gemma":[0.000118838005,0.0001368124,0.00006948416,0.00071843097,0.000043720363,0.00023911706,0.0024837945,0.0003629012,0.000007641223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023988448,0.0012594333,0.0029280595,0.00010330281,0.000104840634,0.0000011976178,0.0036788734,0.04456941,0.046671,0.89391416,0.00047041182,0.0060594366],"study_design_scores_gemma":[0.001567069,0.001823889,0.00048792735,0.00029108408,0.00001966632,0.000054903026,0.00040797837,0.5997191,0.3716436,0.016260074,0.007034997,0.0006897282],"about_ca_topic_score_codex":0.00015636234,"about_ca_topic_score_gemma":0.0000012838782,"teacher_disagreement_score":0.8776541,"about_ca_system_score_codex":0.00028948198,"about_ca_system_score_gemma":0.000073086376,"threshold_uncertainty_score":0.5579048},"labels":[],"label_agreement":null},{"id":"W4313413552","doi":"10.1109/sec54971.2022.00016","title":"Characterizing Variability in Heterogeneous Edge Systems: A Methodology &amp; Case Study","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Node (physics); Software deployment; Enhanced Data Rates for GSM Evolution; Compiler; Power consumption; Limit (mathematics); Distributed computing; Power (physics); Software engineering; Programming language; Artificial intelligence","score_opus":0.09938481688554733,"score_gpt":0.33943885167076593,"score_spread":0.24005403478521858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313413552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26388392,0.000022354128,0.7345668,0.00009922233,0.00031026948,0.000385774,0.000001081979,0.0004441857,0.00028640975],"genre_scores_gemma":[0.84888476,8.280228e-7,0.15060315,0.00021296549,0.000016241003,0.00016235522,0.0000014454774,0.000006377604,0.00011186562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948965,0.0037751063,0.00039142152,0.00051506615,0.00017444896,0.00024750584],"domain_scores_gemma":[0.9985634,0.0005227102,0.0001076083,0.00070849253,0.000045225865,0.000052578285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005134088,0.0001218394,0.00025752676,0.00020326642,0.00024679975,0.00009411299,0.0006532476,0.00003161537,0.000025362617],"category_scores_gemma":[0.00013522303,0.00012262659,0.000040023257,0.00052933424,0.000014046953,0.00012048856,0.0010220703,0.0002239104,0.0000046040245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011962831,0.008744832,0.09580023,0.00018703588,0.00026518828,0.026610944,0.06049019,0.7038641,0.0021494608,0.04464719,0.0016427856,0.055478424],"study_design_scores_gemma":[0.00070093275,0.0005002486,0.00056726654,0.000005773052,0.000009147485,0.014260558,0.0008645009,0.9784066,0.00018709691,0.0011089505,0.0028464964,0.00054239284],"about_ca_topic_score_codex":0.0015552714,"about_ca_topic_score_gemma":0.000055140434,"teacher_disagreement_score":0.5850009,"about_ca_system_score_codex":0.00013061675,"about_ca_system_score_gemma":0.000053696283,"threshold_uncertainty_score":0.50005674},"labels":[],"label_agreement":null},{"id":"W4313588479","doi":"10.22541/au.167285898.80392303/v1","title":"On-Demand JSON: A Better Way to Parse Documents?","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ","funders":"","keywords":"JSON; Computer science; Serialization; Parsing; Programming language; Bottleneck; Programmer; Data structure; Operating system; Database; Embedded system","score_opus":0.03206883204221748,"score_gpt":0.29940047220450067,"score_spread":0.26733164016228317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313588479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018684547,0.000016322496,0.9733463,0.007437724,0.0009334649,0.00042763306,0.0000034747088,0.0028454491,0.013121158],"genre_scores_gemma":[0.08650422,0.00005423358,0.8802557,0.011274476,0.00025116914,0.00022475385,0.00002358739,0.00005131817,0.021360511],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997815,0.000097290955,0.00035074446,0.00096524484,0.00040980752,0.00036189158],"domain_scores_gemma":[0.99810016,0.00013268714,0.00011491102,0.001391635,0.00009150587,0.00016911948],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045510917,0.00030681322,0.0003182606,0.0003266667,0.00010493223,0.0005515622,0.0018845814,0.00020548466,0.000060783816],"category_scores_gemma":[0.00005866656,0.0002675265,0.00013422716,0.0003175957,0.00001626015,0.00009801396,0.0033216523,0.00039897856,0.0012493756],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009959556,0.00009803963,0.00011312602,0.00005328238,0.000074615025,0.00006291721,0.00072551065,0.12160206,0.0000102630665,0.035772752,0.8212348,0.020242669],"study_design_scores_gemma":[0.00062499946,0.0003948821,0.0015049675,0.00074181386,0.000022327777,0.000009849236,0.000009347938,0.5863103,0.0028241465,0.37681147,0.028738236,0.0020076216],"about_ca_topic_score_codex":0.000057775134,"about_ca_topic_score_gemma":0.00000440663,"teacher_disagreement_score":0.79249656,"about_ca_system_score_codex":0.00006563193,"about_ca_system_score_gemma":0.000045361845,"threshold_uncertainty_score":0.9999777},"labels":[],"label_agreement":null},{"id":"W4316252342","doi":"10.1145/3547276.3548445","title":"A Pipeline Pattern Detection Technique in Polly","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Loop (graph theory); Computer science; Parallel computing; Loop tiling; Parallelism (grammar); Pipeline (software); Loop fission; Loop fusion; Polytope model; Automatic parallelization; For loop; Software; Programming language; Mathematics; Discrete mathematics","score_opus":0.010204653413255656,"score_gpt":0.2386443832851128,"score_spread":0.22843972987185715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316252342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006713767,0.000014282673,0.9926193,0.0004957897,0.00008000207,0.0001669145,4.5210564e-7,0.0007613136,0.0051905704],"genre_scores_gemma":[0.9040922,0.000002220587,0.09449651,0.0006328627,0.000011947807,0.00012540062,0.0000010010253,0.000004706104,0.00063317287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922526,0.00010349923,0.00016213972,0.0002195586,0.00015177474,0.00013777503],"domain_scores_gemma":[0.9996321,0.000021124304,0.000043376123,0.00025907578,0.00002084132,0.000023479924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040508347,0.00006414018,0.00007255084,0.0002316656,0.000116493284,0.000036407662,0.00048705834,0.00002073332,0.000045475314],"category_scores_gemma":[0.000010886786,0.000066723434,0.000025902264,0.00060470734,0.0000062464196,0.00011005903,0.00040172818,0.0001640345,0.000005029804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000145588865,0.0004348166,0.0030037493,0.000014671968,0.000006219892,0.000077452816,0.0008939133,0.06422717,0.0063669803,0.008363018,0.010528333,0.9060691],"study_design_scores_gemma":[0.00018273115,0.00011194826,0.00047877594,0.000003984054,5.054573e-7,0.00005537317,0.000016181182,0.96640986,0.023825597,0.002929987,0.005816539,0.0001685181],"about_ca_topic_score_codex":0.00017887246,"about_ca_topic_score_gemma":0.000029363135,"teacher_disagreement_score":0.9059006,"about_ca_system_score_codex":0.00007518532,"about_ca_system_score_gemma":0.000025641395,"threshold_uncertainty_score":0.2720903},"labels":[],"label_agreement":null},{"id":"W4318328068","doi":"10.1145/3559009.3569663","title":"Combining Run-Time Checks and Compile-Time Analysis to Improve Control Flow Auto-Vectorization","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Toronto","funders":"","keywords":"Computer science; Compiler; SIMD; Compile time; Parallel computing; Vectorization (mathematics); Control flow; Overhead (engineering); Benchmark (surveying); Programming language","score_opus":0.005332903516943181,"score_gpt":0.21870514295413593,"score_spread":0.21337223943719275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318328068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028492073,0.00002465264,0.99235874,0.00079621683,0.000113560745,0.000269324,0.000013260829,0.0010018067,0.0025732443],"genre_scores_gemma":[0.75595903,0.000001687207,0.23939432,0.0014168413,0.000034383138,0.000054235108,0.000034118064,0.000013367587,0.0030920336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842227,0.00017962478,0.00029847675,0.0005131948,0.00032640414,0.0002600117],"domain_scores_gemma":[0.99907666,0.00012361359,0.000117249074,0.00044343792,0.00010454803,0.00013448682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057736255,0.00015936114,0.0003262302,0.0003978105,0.00045902026,0.00023035039,0.00059525506,0.000038936436,0.00022408186],"category_scores_gemma":[0.000039334016,0.00016493721,0.00008694943,0.0014698015,0.00001902401,0.00019484572,0.0005534755,0.00014010709,0.00003179355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003343355,0.00018210059,0.0013152424,0.000007111877,0.0004937963,0.000009071574,0.0014322178,0.95497733,0.011308532,0.009586374,0.0059281215,0.014726668],"study_design_scores_gemma":[0.0004047046,0.00019190466,0.0005608896,0.0000017659675,0.000052871088,0.000003272091,0.000006497942,0.99669063,0.0005464593,0.00028903002,0.001035289,0.00021670829],"about_ca_topic_score_codex":0.00004245935,"about_ca_topic_score_gemma":9.96161e-7,"teacher_disagreement_score":0.7531098,"about_ca_system_score_codex":0.00007506191,"about_ca_system_score_gemma":0.000045019337,"threshold_uncertainty_score":0.6725944},"labels":[],"label_agreement":null},{"id":"W4318618048","doi":"10.1145/3572547","title":"SASA: A Scalable and Automatic Stencil Acceleration Framework for Optimized Hybrid Spatial and Temporal Parallelism on HBM-based FPGAs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stencil; Computer science; Speedup; Parallel computing; Scalability; Field-programmable gate array; Computation; CUDA; Sasa; Computational science; Algorithm; Embedded system","score_opus":0.032463815396747524,"score_gpt":0.27106310402564543,"score_spread":0.2385992886288979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318618048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040319115,0.0002053504,0.9527035,0.0035734836,0.00030176336,0.0008517929,0.000017590406,0.0019081633,0.000119279895],"genre_scores_gemma":[0.876207,0.00017260607,0.12256144,0.0001240084,0.000019198184,0.00044485021,0.000010251065,0.000018706578,0.00044196274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998417,0.000098982404,0.0003990247,0.0005972404,0.00015185353,0.00033587342],"domain_scores_gemma":[0.9984953,0.00054904685,0.00015769953,0.0006116889,0.0001005196,0.000085740634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005511996,0.00024188116,0.00040012645,0.00075807294,0.000634423,0.00025249305,0.00037396525,0.0003245079,0.0000072475145],"category_scores_gemma":[0.00012725529,0.00022649326,0.000048370268,0.0005824237,0.000122053956,0.00020021065,0.000013657268,0.0003128793,0.000008912075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041108625,0.00054644555,0.0006728005,0.001217665,0.0003772835,0.0000614718,0.00088422676,0.20084494,0.0006738504,0.072051264,0.0031885817,0.7190704],"study_design_scores_gemma":[0.0010548738,0.00053327746,0.00007119202,0.0002576936,0.000018416284,0.000048722675,0.00009844032,0.9774753,0.0032426035,0.016307127,0.00061600335,0.0002763544],"about_ca_topic_score_codex":0.0000777794,"about_ca_topic_score_gemma":0.000007815176,"teacher_disagreement_score":0.83588785,"about_ca_system_score_codex":0.00003503049,"about_ca_system_score_gemma":0.00006558799,"threshold_uncertainty_score":0.9236127},"labels":[],"label_agreement":null},{"id":"W4320063655","doi":"10.1145/3559009.3569650","title":"GPUPool","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Virtualization; Quality of service; Workload; Graphics; Distributed computing; Operating system; Computer network","score_opus":0.013028779203693686,"score_gpt":0.23913123752065366,"score_spread":0.22610245831695996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320063655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020559563,0.000017029139,0.9388612,0.0007638199,0.00008851009,0.000027935599,1.2720918e-7,0.00078540546,0.059250392],"genre_scores_gemma":[0.56305194,0.0000013013131,0.43110123,0.0014529353,0.000010024788,0.000016766582,6.8125206e-7,0.0000021651197,0.0043629166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996258,0.0000325851,0.00005229053,0.00010698836,0.00011005285,0.00007227215],"domain_scores_gemma":[0.99974376,0.000013163912,0.000015505108,0.00019894571,0.00001066399,0.000017979673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012743985,0.000026382495,0.000029056046,0.000041593863,0.00017458707,0.000031206077,0.0005090154,0.0000042409397,0.00016483119],"category_scores_gemma":[0.0000039841357,0.000025811858,0.000016125037,0.00020244096,0.0000035650305,0.00006519578,0.0004410766,0.000050180694,0.000017026941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.5200323e-7,0.000053128,0.00020086854,9.3249884e-7,0.0000036869071,0.000007915875,0.00024556072,0.0372881,0.00007640551,0.80539,0.1237961,0.032936357],"study_design_scores_gemma":[0.00007710848,0.000057320012,0.0001266247,3.2448278e-7,3.4501412e-7,0.0000204455,0.000010538464,0.8470267,0.00082516455,0.010311921,0.14144546,0.00009804846],"about_ca_topic_score_codex":0.0000057000534,"about_ca_topic_score_gemma":9.101954e-8,"teacher_disagreement_score":0.8097386,"about_ca_system_score_codex":0.000014916295,"about_ca_system_score_gemma":0.000016304,"threshold_uncertainty_score":0.18047859},"labels":[],"label_agreement":null},{"id":"W4320067878","doi":"10.1145/3545008.3545088","title":"Micro-Benchmarking MPI Partitioned Point-to-Point Communication","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Point-to-point; Message Passing Interface; Benchmark (surveying); Suite; Benchmarking; Message passing; Scalability; Parallel computing; SPMD; Point (geometry); Distributed computing; Partition (number theory); Computer network; Operating system","score_opus":0.015883167610999446,"score_gpt":0.25339594722540926,"score_spread":0.2375127796144098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320067878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001771774,0.000053348984,0.9777018,0.0056686,0.00012578788,0.0001804563,0.000001272854,0.00085155445,0.013645405],"genre_scores_gemma":[0.46025938,0.000009862382,0.5362179,0.0029134923,0.000016144217,0.00006600178,0.000013082928,0.0000060359985,0.0004980405],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.000207395,0.00023306206,0.00027663296,0.0002130075,0.00019467952],"domain_scores_gemma":[0.9989233,0.00007724207,0.00008309326,0.000775744,0.00006957892,0.000071022696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062911527,0.0000907747,0.00010135645,0.00015089643,0.00063251716,0.00014309018,0.0011071485,0.000019002116,0.00026013725],"category_scores_gemma":[0.000022079668,0.000097911055,0.000047143,0.0005345617,0.0000155941,0.00022382902,0.0012531471,0.00015075285,0.000045485383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028183553,0.00049623346,0.0012285758,0.000017249322,0.000043859298,0.000014034822,0.0066382666,0.2425092,0.0043789954,0.32658055,0.37559503,0.04246982],"study_design_scores_gemma":[0.00046767577,0.0003242845,0.0013428844,0.000027531836,0.0000056708777,0.000047159214,0.00019848603,0.8929775,0.012588694,0.021507319,0.069898196,0.0006146297],"about_ca_topic_score_codex":0.00004635428,"about_ca_topic_score_gemma":0.0000040619507,"teacher_disagreement_score":0.6504683,"about_ca_system_score_codex":0.00009074333,"about_ca_system_score_gemma":0.000037225014,"threshold_uncertainty_score":0.48648748},"labels":[],"label_agreement":null},{"id":"W4321176235","doi":"10.48550/arxiv.2302.07800","title":"An Efficient B-tree Implementation for Memory-Constrained Embedded Systems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Implementation; Tree (set theory); Embedded system; Process (computing); Variety (cybernetics); Automation; Distributed computing; Operating system; Computer hardware; Programming language; Engineering","score_opus":0.09073197706562114,"score_gpt":0.2539132472490481,"score_spread":0.16318127018342699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321176235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029140914,0.00001538373,0.966683,0.00005451102,0.0009108696,0.0009714436,0.00004460737,0.0018070227,0.00037226296],"genre_scores_gemma":[0.9685255,0.000017014918,0.030585747,0.00003299783,0.000092616414,0.000011734948,0.00013703377,0.000026615327,0.00057069457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792796,0.00020690613,0.0002988821,0.0010915494,0.00010913298,0.00036557793],"domain_scores_gemma":[0.9979769,0.0001475074,0.0003494428,0.0010886824,0.00028924656,0.00014822323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006960022,0.00028020554,0.00030857883,0.00038563873,0.00023473435,0.0002797454,0.0015965365,0.00021068496,0.00000433105],"category_scores_gemma":[0.000026590187,0.00033467694,0.00017326165,0.0004756004,0.000053841453,0.00017695666,0.0006546191,0.0002106682,0.000020562853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008891649,0.00004570487,0.00006856288,0.00006451817,0.000040907616,0.000021770824,0.0002828597,0.93307644,0.000025565709,0.064882025,0.00071721064,0.0007655252],"study_design_scores_gemma":[0.0004929036,0.00008621727,0.00010363881,0.00005447412,0.00003536562,0.0000020463247,0.00031852734,0.99283683,0.00024904535,0.0054068062,0.00005414025,0.00035998758],"about_ca_topic_score_codex":0.00016757096,"about_ca_topic_score_gemma":0.000028574928,"teacher_disagreement_score":0.93938464,"about_ca_system_score_codex":0.0001813551,"about_ca_system_score_gemma":0.00022342431,"threshold_uncertainty_score":0.99991053},"labels":[],"label_agreement":null},{"id":"W4321184895","doi":"10.1145/3578360.3580259","title":"LAGrad: Statically Optimized Differentiable Programming in MLIR","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Differentiable function; Bottleneck; Computer science; Automatic differentiation; Function (biology); Field (mathematics); Mathematical optimization; Parallel computing; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Embedded system; Pure mathematics; Computation","score_opus":0.019604240999502726,"score_gpt":0.27532138501751524,"score_spread":0.2557171440180125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321184895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003916941,0.00001097818,0.9880352,0.0007511228,0.000059702965,0.00017650322,2.2035117e-7,0.0023765161,0.0046727955],"genre_scores_gemma":[0.09621387,0.000024919307,0.900889,0.00015428051,0.000010770958,0.00003720135,0.0000062018157,0.000008381881,0.0026554258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988953,0.00006249874,0.00023054451,0.00028837344,0.00018541179,0.00033790377],"domain_scores_gemma":[0.99943584,0.00011302071,0.000038535254,0.00030556606,0.000042935637,0.00006410274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035516146,0.00009999218,0.00014826054,0.00024546793,0.000063675114,0.00019371691,0.00053459377,0.000043436394,0.000019419216],"category_scores_gemma":[0.00005322504,0.00008649167,0.00003636986,0.0011338473,0.000018512254,0.00020219923,0.00026248998,0.000096184885,0.000084864834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000403652,0.00077846413,0.006695614,0.00014422098,0.00006596843,0.00020400004,0.0032137835,0.15622155,0.0005205591,0.41325277,0.054442704,0.36442],"study_design_scores_gemma":[0.00037027086,0.000036272384,0.0010793447,0.000019817882,0.0000010401453,0.0000016736211,0.000018200855,0.9916686,0.00044744438,0.004515484,0.0016926199,0.0001492768],"about_ca_topic_score_codex":0.000034569213,"about_ca_topic_score_gemma":0.000006203452,"teacher_disagreement_score":0.835447,"about_ca_system_score_codex":0.000020317226,"about_ca_system_score_gemma":0.000032922802,"threshold_uncertainty_score":0.3527028},"labels":[],"label_agreement":null},{"id":"W4321185108","doi":"10.1145/3578360","title":"Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction","year":2023,"lang":"en","type":"paratext","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Computer science; Parallelism (grammar); Architecture; Programming language; Software engineering; Code (set theory); Parallel computing; Library science; History","score_opus":0.04580317845452518,"score_gpt":0.29438486733410746,"score_spread":0.24858168887958226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321185108","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020874407,0.0000105038225,0.13651899,0.0027293789,0.0052949204,0.00032380287,0.00003481969,0.00046192043,0.8544169],"genre_scores_gemma":[0.061864957,0.0007858489,0.34354234,0.0013961719,0.00091959396,0.000090975336,0.000155623,0.000088253146,0.59115624],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985997,0.00002173402,0.00034391487,0.00042014403,0.00045263933,0.00016188656],"domain_scores_gemma":[0.9985889,0.00007467401,0.00040961095,0.00043367257,0.00045630924,0.00003680827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016885849,0.00020439786,0.00024367128,0.00020389198,0.000100828875,0.00020408117,0.0029873948,0.00019161163,0.0003434988],"category_scores_gemma":[0.00006953951,0.00014522557,0.000098397206,0.0003841551,0.00012078592,0.00012936215,0.00092127436,0.0003331243,0.0006572194],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047693416,0.000022771048,0.000032699216,0.00002593398,0.00003085932,2.134726e-7,0.000094240895,0.00057710573,0.000097601034,0.14879638,0.84845936,0.0018580491],"study_design_scores_gemma":[0.0014525434,0.0005611941,0.0014516549,0.0030124637,0.000048309954,0.00010975602,0.00029485943,0.5859483,0.038854156,0.045256928,0.32077828,0.0022315476],"about_ca_topic_score_codex":0.000020023082,"about_ca_topic_score_gemma":0.0000012422598,"teacher_disagreement_score":0.5853712,"about_ca_system_score_codex":0.000048878854,"about_ca_system_score_gemma":0.00011409496,"threshold_uncertainty_score":0.8447445},"labels":[],"label_agreement":null},{"id":"W4321242097","doi":"10.1007/s10766-023-00752-x","title":"Guest Editor’s Note: High-Level Parallel Programming 2021","year":2023,"lang":"en","type":"editorial","venue":"International Journal of Parallel Programming","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Università di Pisa; Universidade do Porto; Université d'Orléans; Centre National de la Recherche Scientifique; Linköpings Universitet; University of Edinburgh; Queen's University; Uppsala Universitet; Universiteit van Amsterdam; Queen's University Belfast; Mississippi State University","keywords":"Computer science; Theory of computation; Programming language; Parallel computing","score_opus":0.0203141364912243,"score_gpt":0.31457089282380757,"score_spread":0.29425675633258325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321242097","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018435435,0.00028344832,0.49289277,0.0007198361,0.505474,0.00022473483,0.000023833238,0.00032279047,0.000056770336],"genre_scores_gemma":[0.00012444727,0.0005932462,0.4666413,0.0000349322,0.53155404,0.000049352042,0.0001807286,0.00008723445,0.0007347228],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99076444,0.00031497737,0.0023565749,0.0010139105,0.004519077,0.0010310049],"domain_scores_gemma":[0.98925817,0.0016305371,0.003214051,0.00084826886,0.0046155024,0.00043345286],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00257003,0.000858554,0.0011643386,0.0012937664,0.0002823869,0.0021775714,0.0071332483,0.0011452589,0.000020657815],"category_scores_gemma":[0.0030908699,0.00082491036,0.00079032255,0.00082147925,0.00017196623,0.0013169324,0.0013796556,0.0025113667,0.00015840736],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008151313,0.000261815,0.0000146307475,0.00004928836,0.00046258818,0.0006718387,0.0002921939,0.007783906,0.0000044591957,0.00061531196,0.9013712,0.088391244],"study_design_scores_gemma":[0.0014035383,0.00040356792,0.000013804672,0.0008452454,0.00007309575,0.000074528754,0.000029502688,0.008191819,0.000022166005,0.0008966736,0.98722005,0.0008260196],"about_ca_topic_score_codex":0.00019471414,"about_ca_topic_score_gemma":0.0000361333,"teacher_disagreement_score":0.08756523,"about_ca_system_score_codex":0.00063917285,"about_ca_system_score_gemma":0.0013581278,"threshold_uncertainty_score":0.9997899},"labels":[],"label_agreement":null},{"id":"W4321480070","doi":"10.1002/cpe.7655","title":"Design of a portable implementation of partitioned point‐to‐point communication primitives","year":2023,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Science Foundation of Sri Lanka; Office of Science; University of Alabama at Birmingham; Sandia National Laboratories; U.S. Department of Energy; National Nuclear Security Administration; National Science Foundation","keywords":"Computer science; Thread (computing); Message passing; Message Passing Interface; Parallel computing; Point-to-point; Multithreading; Initialization; Serialization; Interface (matter); Inter-process communication; Concurrency; Distributed computing; Operating system; Computer network; Programming language","score_opus":0.046346348883302496,"score_gpt":0.37714700333144846,"score_spread":0.330800654448146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321480070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037030153,0.00025117418,0.96126634,0.0008732674,0.00004335106,0.00025237986,0.0000018843299,0.00011444141,0.00016703448],"genre_scores_gemma":[0.87415034,0.0005462136,0.12510182,0.00013675558,0.0000037282916,0.000041779134,0.000009990679,0.000003111189,0.0000062589284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895424,0.00019524481,0.00035776774,0.00022014393,0.0001575979,0.00011502496],"domain_scores_gemma":[0.9986907,0.00048504848,0.000317871,0.00017506849,0.00027881045,0.000052499458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056234794,0.00008354779,0.00013933542,0.00014523884,0.00014280989,0.000059764985,0.00017325749,0.000027419934,0.000004498609],"category_scores_gemma":[0.00017202979,0.000086994834,0.0000144731985,0.0005414683,0.0000772041,0.0010723267,0.00015174884,0.000050954543,0.0000021876758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016058183,0.00041881556,0.00303508,0.00028821122,0.00010343449,0.000009243556,0.31442162,0.07713796,0.011526874,0.14449702,0.0042397045,0.44416147],"study_design_scores_gemma":[0.0015526323,0.0012929298,0.011887506,0.00032335086,0.000046829227,0.0000553512,0.033698354,0.8633161,0.06647066,0.019722698,0.00097033696,0.0006632041],"about_ca_topic_score_codex":0.000045690726,"about_ca_topic_score_gemma":6.559632e-7,"teacher_disagreement_score":0.8371202,"about_ca_system_score_codex":0.0000071097816,"about_ca_system_score_gemma":0.000055757755,"threshold_uncertainty_score":0.35475463},"labels":[],"label_agreement":null},{"id":"W4321496341","doi":"10.1145/3579990.3580024","title":"To Pack or Not to Pack: A Generalized Packing Analysis and Transformation","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"IBM Canada; Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Affine transformation; Parallel computing; Speedup; Block (permutation group theory); Loop tiling; Computation; Algorithm; Loop (graph theory); Translation lookaside buffer; Theoretical computer science; Mathematics; Compiler; Computer hardware; Combinatorics; Programming language","score_opus":0.03568630109515687,"score_gpt":0.31684955474424736,"score_spread":0.2811632536490905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321496341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064648524,0.00000206449,0.9294716,0.003821008,0.00003813684,0.00019013514,0.0000019077756,0.001068002,0.00075859786],"genre_scores_gemma":[0.6165879,0.000023842438,0.379929,0.0022775598,0.000019563746,0.000018742512,0.000007471217,0.0000061272463,0.0011297961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990003,0.000052573552,0.0002266325,0.00029322982,0.00020282257,0.00022440979],"domain_scores_gemma":[0.9993989,0.00005773983,0.000032844004,0.00029303806,0.00007283378,0.00014468524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038794766,0.000105728905,0.00018682494,0.0006282217,0.00012578654,0.00024715828,0.00029629158,0.000038417995,0.000020465814],"category_scores_gemma":[0.000042695305,0.00008285867,0.000057098296,0.003493959,0.000007445995,0.00023456932,0.0001291191,0.000039573908,0.00006630982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024909215,0.00010423183,0.002853902,0.000085571555,0.00061186583,0.000041692,0.041249707,0.39673927,0.006664775,0.06875189,0.05124902,0.431399],"study_design_scores_gemma":[0.00025210064,0.00009205667,0.0065463926,0.000011681704,0.000027237093,0.0000023760565,0.000051760293,0.9808148,0.009290675,0.00033545145,0.0023331442,0.00024228508],"about_ca_topic_score_codex":0.00006829746,"about_ca_topic_score_gemma":0.000075183154,"teacher_disagreement_score":0.58407557,"about_ca_system_score_codex":0.000019548414,"about_ca_system_score_gemma":0.000020425516,"threshold_uncertainty_score":0.33788785},"labels":[],"label_agreement":null},{"id":"W4322756634","doi":"10.1145/3579445","title":"DaeMon: Architectural Support for Efficient Data Movement in Fully Disaggregated Systems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Daemon; Scalability; Distributed computing; Computer network; Operating system","score_opus":0.06772248920691136,"score_gpt":0.2901426903970796,"score_spread":0.2224202011901682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322756634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8802262,0.00038928087,0.11575145,0.00094961835,0.00052904146,0.0014772827,0.000030408753,0.00038353493,0.00026321143],"genre_scores_gemma":[0.9959272,0.00000879095,0.0039274204,0.000024339735,0.000034774443,0.000015446773,0.000012878584,0.000010024083,0.000039097213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972279,0.00004846376,0.0008604061,0.0005636884,0.0009888044,0.0003107121],"domain_scores_gemma":[0.9974655,0.00016318222,0.00080563634,0.00096929556,0.0005421343,0.00005424546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004543716,0.00019986255,0.0006230355,0.00076490315,0.00014274317,0.00017666268,0.0032886658,0.00005237081,1.5200182e-7],"category_scores_gemma":[0.00067765906,0.00014450755,0.00014691227,0.002429333,0.00004981373,0.00008717322,0.0015508167,0.00010097915,3.8072358e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044100485,0.00018222182,0.032293778,0.000899409,0.0009946581,5.5145284e-7,0.0015126403,0.9471961,0.0046323244,0.007194221,0.0023700793,0.0026799033],"study_design_scores_gemma":[0.00033279095,0.00009294564,0.009199432,0.0005298652,0.00014897171,9.468899e-7,0.00015069736,0.988084,0.001147568,0.000112972244,0.000048163703,0.00015164602],"about_ca_topic_score_codex":0.00008194856,"about_ca_topic_score_gemma":0.0000026438722,"teacher_disagreement_score":0.115701064,"about_ca_system_score_codex":0.00006749133,"about_ca_system_score_gemma":0.000038361937,"threshold_uncertainty_score":0.61112136},"labels":[],"label_agreement":null},{"id":"W4322825430","doi":"","title":"Correct Code Containing Containers","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Code (set theory); Programming language","score_opus":0.0450353672670204,"score_gpt":0.2833482580145089,"score_spread":0.23831289074748851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322825430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019116353,0.00013381122,0.8680224,0.00019973105,0.00092885713,0.00022682581,0.0000020485802,0.0025113116,0.12778388],"genre_scores_gemma":[0.44188014,0.00006297974,0.55493677,0.0010042455,0.000075157346,0.000039682036,0.000016794673,0.00002126354,0.001962979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982797,0.00011490874,0.0003699658,0.0007083129,0.00020789557,0.000319215],"domain_scores_gemma":[0.99828404,0.000092283015,0.0002620659,0.0010511552,0.00019403535,0.000116405936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004585066,0.00029279612,0.00038480523,0.00018618915,0.000097380725,0.00025964534,0.001949699,0.0002638093,0.00004464462],"category_scores_gemma":[0.00006695874,0.00027476595,0.00014172588,0.00014110804,0.00004430477,0.00012664951,0.0021614567,0.00052148494,0.000049120008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054874523,0.00022147881,0.0019013678,0.00013755236,0.0002763008,0.00012683887,0.0052849054,0.040383425,0.0000886921,0.77634406,0.11390538,0.061275154],"study_design_scores_gemma":[0.0004191126,0.00021777999,0.00016087363,0.00023161326,0.0000202557,0.00003091705,0.00004479248,0.9367352,0.0040533994,0.048815146,0.008117677,0.0011532002],"about_ca_topic_score_codex":0.0002588229,"about_ca_topic_score_gemma":0.000016337168,"teacher_disagreement_score":0.8963518,"about_ca_system_score_codex":0.00007002309,"about_ca_system_score_gemma":0.00022632856,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W4323240305","doi":"10.5220/0011795500003411","title":"On the Convergence of Stochastic Gradient Descent in Low-Precision Number Formats","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal; Huawei Technologies (Canada)","funders":"","keywords":"Stochastic gradient descent; Convergence (economics); Computer science; Gradient descent; Descent (aeronautics); Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Artificial neural network","score_opus":0.022492993508563795,"score_gpt":0.27282880648919267,"score_spread":0.25033581298062885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323240305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09137172,0.0000031810996,0.9063882,0.00040042907,0.00014351236,0.00013784417,3.1417488e-7,0.00022529515,0.001329508],"genre_scores_gemma":[0.99137896,0.000010371875,0.008248686,0.00019087207,0.000003847006,0.000009787324,6.484825e-7,0.000002993665,0.00015385378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.000049441733,0.0002011756,0.00015223658,0.00020879862,0.00015561501],"domain_scores_gemma":[0.9992812,0.00026487658,0.0000557418,0.000326566,0.000044049248,0.00002753476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041470618,0.00006668659,0.00008340748,0.0000899512,0.000047034344,0.000023403072,0.00054294796,0.000024513269,0.000027248705],"category_scores_gemma":[0.00008446952,0.00004294838,0.000031262396,0.0006625248,0.000021924681,0.00008631255,0.00019982748,0.00006817305,0.00014727189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019701867,0.00017496555,0.00069062266,0.000024749676,0.000007601727,0.000007532973,0.0019065012,0.38883036,0.00010077403,0.5757349,0.02135931,0.01114298],"study_design_scores_gemma":[0.00008482138,0.000031774776,0.0015904882,0.00007853097,3.8009023e-7,0.0000014118292,0.000014425558,0.9802975,0.0018655743,0.015956542,0.000016654965,0.000061887324],"about_ca_topic_score_codex":0.000016921384,"about_ca_topic_score_gemma":0.0000027862789,"teacher_disagreement_score":0.90000725,"about_ca_system_score_codex":0.000021806993,"about_ca_system_score_gemma":0.000018875004,"threshold_uncertainty_score":0.18929312},"labels":[],"label_agreement":null},{"id":"W4323777068","doi":"10.2139/ssrn.4382942","title":"Pipeline Dnn Model Parallelism for Improving Performance of Embedded Applications","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Parallelism (grammar); Pipeline (software); Computer science; Parallel computing; Data parallelism; Task parallelism; Computer architecture; Operating system","score_opus":0.013506858523937997,"score_gpt":0.26592827998484253,"score_spread":0.2524214214609045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323777068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068560326,0.00020856607,0.9916771,0.00046216624,0.000044377768,0.00021970274,0.0000014343289,0.00030888975,0.00022173703],"genre_scores_gemma":[0.8486708,0.0010989544,0.1479299,0.000082335595,0.000118502714,0.00006755649,0.00000649444,0.00001584768,0.002009596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982458,0.000022222795,0.00032970984,0.00020453706,0.00017976291,0.001017983],"domain_scores_gemma":[0.9991805,0.000054682365,0.00022345793,0.00028659348,0.00020610513,0.00004865182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013353371,0.00010619018,0.00014868233,0.00019196422,0.0002406332,0.0000480332,0.0007708194,0.000053473603,4.917349e-7],"category_scores_gemma":[0.000033828426,0.000099558914,0.000091925256,0.00044026683,0.000021037327,0.00024716594,0.000100851095,0.00042386804,0.0000060066013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025507677,0.00006297263,0.000070549504,0.000046625242,0.000034391738,2.621168e-7,0.0002876095,0.48062772,0.00083312206,0.35269663,0.0016291729,0.16368543],"study_design_scores_gemma":[0.00025200006,0.00009586983,0.000009435507,0.0000073174656,0.0000059771314,0.000021561804,0.000027244343,0.89331675,0.00077320426,0.10512183,0.00026911488,0.00009967695],"about_ca_topic_score_codex":0.0000032161777,"about_ca_topic_score_gemma":0.0000038971225,"teacher_disagreement_score":0.8437472,"about_ca_system_score_codex":0.00014178839,"about_ca_system_score_gemma":0.0010095099,"threshold_uncertainty_score":0.40598947},"labels":[],"label_agreement":null},{"id":"W4327845486","doi":"10.5281/zenodo.7747317","title":"Replication Package - Understanding the Time to First Response In GitHub Pull Requests","year":2023,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Replication (statistics); Computer science; Response time; Computer network; Operating system; Medicine","score_opus":0.06198083933038215,"score_gpt":0.28409276006602735,"score_spread":0.2221119207356452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327845486","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010626649,0.000086821696,0.79169077,0.0121776825,0.00028883351,0.0012499435,0.0001568915,0.002783237,0.19145952],"genre_scores_gemma":[0.14772728,0.0021496618,0.031832192,0.005847001,0.0018993868,0.000006741322,0.015316883,0.015339814,0.77988106],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99632984,0.0011377081,0.00046723144,0.0010280422,0.00052754104,0.0005096596],"domain_scores_gemma":[0.9968458,0.00022522979,0.00024414863,0.0021593908,0.00036106037,0.00016436282],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033831482,0.00026193674,0.00025996598,0.00080811355,0.0021477789,0.0020107406,0.0040426673,0.00018189543,0.0028324146],"category_scores_gemma":[0.0018432011,0.0002463741,0.00007077865,0.002383185,0.00010104948,0.0002972068,0.0029967746,0.00054729986,0.11224589],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007865697,0.000034517863,8.453862e-8,0.00003133771,0.000014418185,0.000011441134,0.0011554607,0.0034232636,0.00016733371,0.0015908278,0.98916984,0.004322839],"study_design_scores_gemma":[0.0001801641,0.0002356435,0.0000657974,0.00020708313,0.00000408453,0.000038414786,0.00004582177,0.014746311,0.00011974,0.00050058286,0.98354757,0.00030877753],"about_ca_topic_score_codex":0.000018184348,"about_ca_topic_score_gemma":6.7013264e-7,"teacher_disagreement_score":0.7598586,"about_ca_system_score_codex":0.0008046785,"about_ca_system_score_gemma":0.000019922185,"threshold_uncertainty_score":0.99999887},"labels":[],"label_agreement":null},{"id":"W4362505396","doi":"10.1145/3578245.3584694","title":"Identification and Classification of JMH Microbenchmark States using Time Series Analysis","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Benchmark (surveying); Steady state (chemistry); Identification (biology); Computer science; Time series; Series (stratigraphy); Matrix (chemical analysis); State (computer science); Code (set theory); Algorithm; Data mining; Machine learning","score_opus":0.019059629783175235,"score_gpt":0.2742073326847119,"score_spread":0.2551477029015367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362505396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107946545,0.000020783084,0.8911357,0.00024007294,0.000018199453,0.000053113825,0.0000018818301,0.0003467402,0.00023695175],"genre_scores_gemma":[0.81090903,0.000081024285,0.18771723,0.000020657815,0.0000067185424,0.0000032100947,0.000039979102,0.0000043460386,0.0012178131],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934554,0.000045919704,0.00022043366,0.00020211504,0.000099516816,0.00008645755],"domain_scores_gemma":[0.9994359,0.000042339478,0.00012710535,0.00025967543,0.000112270405,0.000022718685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032299603,0.000056693367,0.00011068875,0.00036587243,0.0000759645,0.00009348192,0.00019786948,0.000028827219,0.000008247616],"category_scores_gemma":[0.000018456682,0.000054216114,0.000033365366,0.0016975659,0.00003582123,0.00030369265,0.000093667164,0.000022595632,0.000011948335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012996595,0.00010278662,0.020058747,0.000098385084,0.00046299133,0.0000026037678,0.0028829966,0.16852792,0.7328282,0.04851687,0.00988652,0.016618975],"study_design_scores_gemma":[0.000026187605,0.000008583127,0.02203924,0.0000038958633,0.000021982649,9.2286865e-7,0.000019796364,0.9578816,0.01837351,0.0014998146,0.00006219081,0.00006223877],"about_ca_topic_score_codex":0.000018201843,"about_ca_topic_score_gemma":0.0000020900331,"teacher_disagreement_score":0.7893537,"about_ca_system_score_codex":0.00001094749,"about_ca_system_score_gemma":0.000015254333,"threshold_uncertainty_score":0.22108689},"labels":[],"label_agreement":null},{"id":"W4364295250","doi":"10.1109/iitcee57236.2023.10091038","title":"Design and Implementation of 32-Bit MIPS RISC Processor with Flexible 5-Stage Pipelining and Dynamic Thermal Control","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Opcode; Reduced instruction set computing; Computer science; Instruction set; Pipeline (software); Verilog; Processor design; Computer architecture; Embedded system; 32-bit; Application-specific instruction-set processor; Microarchitecture; Parallel computing; Computer hardware; Field-programmable gate array; Operating system","score_opus":0.016582495119886877,"score_gpt":0.2927259416035363,"score_spread":0.27614344648364947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4364295250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05385067,0.000049974,0.944985,0.00022844618,0.000009863831,0.0002467869,0.0000012530248,0.0004231865,0.00020484896],"genre_scores_gemma":[0.7654449,0.000028956414,0.23410238,0.00007201761,0.0000034716816,0.000015222753,0.0000018954341,0.000005687775,0.00032548353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993114,0.00005158437,0.00016115478,0.00021160033,0.00012075465,0.00014350256],"domain_scores_gemma":[0.9995758,0.00010187106,0.000098375676,0.00012101486,0.000067748246,0.000035195895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040070835,0.00008282143,0.00011726805,0.00010957182,0.00008618098,0.00007579238,0.0001428263,0.000024305009,0.0000071802788],"category_scores_gemma":[0.000007082846,0.00006383488,0.0000085463935,0.0002779264,0.000032514334,0.00021935305,0.00006601913,0.000041680367,0.0000018798416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003878244,0.00019001013,0.068187535,0.0007070977,0.00026565412,0.000044709384,0.017477842,0.5084482,0.030415574,0.025947068,0.0029739686,0.34495455],"study_design_scores_gemma":[0.0007178352,0.00018866076,0.0052229553,0.000018059622,0.0000057441835,0.000003533373,0.00014577486,0.98560494,0.0076894937,0.0002641699,0.000037124868,0.000101723075],"about_ca_topic_score_codex":0.00002767739,"about_ca_topic_score_gemma":0.000004551575,"teacher_disagreement_score":0.7115942,"about_ca_system_score_codex":0.0000062662625,"about_ca_system_score_gemma":0.000043202515,"threshold_uncertainty_score":0.26031107},"labels":[],"label_agreement":null},{"id":"W4366607838","doi":"10.1109/mdat.2022.3221909","title":"Special Issue on Approximate Computing: Challenges, Methodologies, Algorithms, and Architectures for Dependable and Secure Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Cloud computing; Energy consumption; Mobile broadband; Broadband; Distributed computing; Wireless; Telecommunications; Mobile cloud computing; Mobile device; Mobile computing; Electricity; Computer security; Computer network; World Wide Web; Engineering; Electrical engineering","score_opus":0.10253961152633685,"score_gpt":0.31876681957188396,"score_spread":0.21622720804554713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366607838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076248735,0.0012678737,0.9950805,0.0006084028,0.00044063927,0.00055910513,0.000008027843,0.0007732184,0.000499804],"genre_scores_gemma":[0.037730776,0.001265456,0.95826524,0.00019663584,0.002117172,0.00005550937,0.0000062493377,0.000032775886,0.0003302062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874985,0.00018103245,0.0001755639,0.0004867014,0.00012311354,0.000283764],"domain_scores_gemma":[0.99732786,0.0022508714,0.000081750164,0.00020507569,0.00004600186,0.00008840982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010549463,0.00018113185,0.0002559995,0.000155343,0.00025066073,0.0002219956,0.00022910851,0.00009882769,4.0229676e-7],"category_scores_gemma":[0.00019576968,0.00015437487,0.00002021372,0.00016490412,0.00006137317,0.000042021293,0.00011493661,0.000118612916,0.0000018757825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008488007,0.00012316556,0.00013022132,0.0007779887,0.00009232987,0.00009715242,0.0055070184,0.057293862,0.0003988011,0.026026273,0.08210409,0.8273642],"study_design_scores_gemma":[0.00041574825,0.00045546895,0.00019908088,0.00007791864,0.0000079333795,0.00007942919,0.00005759185,0.9781019,0.001107297,0.0065434217,0.012696731,0.00025745798],"about_ca_topic_score_codex":0.000011725212,"about_ca_topic_score_gemma":9.313006e-7,"teacher_disagreement_score":0.9208081,"about_ca_system_score_codex":0.000009256906,"about_ca_system_score_gemma":0.000020189838,"threshold_uncertainty_score":0.62952244},"labels":[],"label_agreement":null},{"id":"W4367609402","doi":"10.32388/mte4fx","title":"Review of: \"Fidelity of quantum blobs\"","year":2023,"lang":"en","type":"peer-review","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fidelity; Quantum; Computer science; Physics; Computational biology; Biology; Quantum mechanics; Telecommunications","score_opus":0.0635828411991623,"score_gpt":0.35562980140938993,"score_spread":0.29204696021022764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367609402","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7907813e-8,0.3738124,0.5944636,0.016129812,0.00087568816,0.00044996486,0.000066670334,0.0006180946,0.013583729],"genre_scores_gemma":[0.0000017012221,0.83135015,0.10799202,0.007846301,0.000055565677,0.000025143072,0.00016954752,0.000021128086,0.052538417],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972189,0.00021328355,0.0012703175,0.00051013,0.00056925253,0.00021809708],"domain_scores_gemma":[0.9962093,0.00022054101,0.0009646902,0.0015516934,0.0009869678,0.00006675924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018977536,0.0002681935,0.001229487,0.00015869648,0.000030079027,0.000015594553,0.0020822447,0.00015684108,0.00010944653],"category_scores_gemma":[0.0007472273,0.00022270324,0.0003855808,0.001086686,0.000054235094,0.000079945,0.0007472793,0.00025893253,0.000053812575],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.7768268e-7,0.000021013524,5.7727055e-7,0.05615631,0.000018859067,0.0000010678831,0.0000037615323,0.000014682515,3.8863158e-7,0.0051263804,0.9274272,0.011229635],"study_design_scores_gemma":[0.000036473346,0.000046385965,0.0000048734955,0.1269212,0.000046413013,0.000003822621,2.3211865e-7,0.01191181,0.00004532367,0.0012591027,0.8594878,0.00023655342],"about_ca_topic_score_codex":0.00015684766,"about_ca_topic_score_gemma":0.0000030088042,"teacher_disagreement_score":0.4864716,"about_ca_system_score_codex":0.00002612368,"about_ca_system_score_gemma":0.00032483335,"threshold_uncertainty_score":0.90815747},"labels":[],"label_agreement":null},{"id":"W4372263745","doi":"10.1145/3552326.3587456","title":"NearPM: A Near-Data Processing System for Storage-Class Applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Paging; Computer science; Speedup; Crash; Overhead (engineering); Consistency (knowledge bases); Synchronization (alternating current); Parallel computing; Central processing unit; Distributed computing; Embedded system; Operating system; Computer network","score_opus":0.05331495071306131,"score_gpt":0.314241336423228,"score_spread":0.2609263857101667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372263745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003465755,0.000042802574,0.9909553,0.0008080986,0.00007409731,0.00047354467,0.000008037196,0.00461156,0.002991896],"genre_scores_gemma":[0.14925838,0.0000043897867,0.84781784,0.00016466875,0.00009450299,0.0003247709,0.00007027958,0.000016738128,0.0022484264],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990175,0.000023416042,0.00018023058,0.0004216171,0.00014162305,0.00021563399],"domain_scores_gemma":[0.99882555,0.000082318984,0.00007445834,0.000837029,0.0001233071,0.00005734137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044792553,0.000085768166,0.0001075478,0.000079709695,0.00039045207,0.0004368488,0.0014566757,0.000044594883,0.0000012006824],"category_scores_gemma":[0.0000256666,0.00007827324,0.000026855343,0.0008398243,0.000022945507,0.00034383615,0.000488366,0.000050654962,0.00009013301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056978447,0.00010321106,0.000081904625,0.00069233467,0.000034034205,0.000006590306,0.00071449875,0.044438496,0.00020055457,0.19548616,0.20729792,0.5509386],"study_design_scores_gemma":[0.00009126719,0.000012855184,0.00002280716,0.000019343526,0.0000027250012,0.0000040054015,0.00002354765,0.94004875,0.00013561267,0.00027668913,0.0592641,0.000098318415],"about_ca_topic_score_codex":0.000007912988,"about_ca_topic_score_gemma":0.0000013138379,"teacher_disagreement_score":0.8956102,"about_ca_system_score_codex":0.00002978246,"about_ca_system_score_gemma":0.00012329723,"threshold_uncertainty_score":0.42125428},"labels":[],"label_agreement":null},{"id":"W4375851966","doi":"10.1145/3576914.3587496","title":"PASoC: A Predictable Accelerator-rich SoC","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache coherence; Cache; Latency (audio); Coherence (philosophical gambling strategy); Homogeneous; Embedded system; Bus sniffing; MESIF protocol; MESI protocol; System on a chip; CPU cache; Parallel computing; Computer architecture; Cache algorithms","score_opus":0.026312895448749225,"score_gpt":0.2700857818553726,"score_spread":0.24377288640662334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375851966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005316261,0.000020620342,0.9547545,0.0010416417,0.00017145627,0.00008678979,5.513791e-7,0.005540526,0.03306765],"genre_scores_gemma":[0.7263154,0.000056941106,0.25376007,0.001110521,0.00010435099,0.00003624395,0.0000072883686,0.000014658157,0.018594513],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914426,0.000031066644,0.0001348346,0.00025536373,0.00018329965,0.00025116737],"domain_scores_gemma":[0.999422,0.000051074363,0.0000330005,0.00036713536,0.000064828644,0.00006196361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024542614,0.00008134484,0.00008932277,0.00012288314,0.00013778626,0.00018538974,0.0006719305,0.000047317135,0.00004044995],"category_scores_gemma":[0.000026339316,0.00007155246,0.000030886968,0.0008551603,0.000012807133,0.00028399477,0.00032791437,0.00007044493,0.00038737318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018825343,0.000059528506,0.0024711916,0.000014653661,0.00002273164,0.000021489235,0.00065569143,0.006660929,0.00033855785,0.17545862,0.7950124,0.019282341],"study_design_scores_gemma":[0.00018492319,0.000054305427,0.0018664738,0.000010382364,0.0000017790027,0.00000554805,0.00001317457,0.9602993,0.0063724793,0.013150282,0.01781727,0.00022406805],"about_ca_topic_score_codex":0.000008485146,"about_ca_topic_score_gemma":5.7145934e-7,"teacher_disagreement_score":0.9536384,"about_ca_system_score_codex":0.000015379635,"about_ca_system_score_gemma":0.00004701107,"threshold_uncertainty_score":0.49790278},"labels":[],"label_agreement":null},{"id":"W4376456726","doi":"10.1007/978-3-031-31445-2_8","title":"Exploiting the New Power ISA™ Matrix Math Instructions Through Compiler Built-ins","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; IBM (Canada)","funders":"","keywords":"Compiler; Computer science; Programming language; Parallel computing; Computation; Linear algebra; IBM; Operating system","score_opus":0.031055526414875103,"score_gpt":0.2870764627653228,"score_spread":0.2560209363504477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376456726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045777673,0.00024323621,0.98557544,0.0031060504,0.0031388903,0.00045674684,0.0000062338013,0.001513106,0.005914532],"genre_scores_gemma":[0.022029525,0.00015617126,0.97098297,0.0024054584,0.00081282016,0.000015865278,0.000008837713,0.00008962106,0.0034987452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569696,0.00006496466,0.0007448503,0.0015484121,0.0011191798,0.0008256326],"domain_scores_gemma":[0.99635303,0.0006773285,0.00045406737,0.0020730703,0.00027277065,0.00016970755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00085059484,0.0006337844,0.0005558236,0.0006219909,0.00084872666,0.0011043255,0.0052259355,0.0003486872,0.000021683112],"category_scores_gemma":[0.00014300813,0.0004947157,0.00021985422,0.001416934,0.00066446216,0.0008199211,0.0026385097,0.0012218481,0.00016185694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057995444,0.000037596586,0.000052108982,0.00003434288,0.000041482523,0.00008426152,0.0047695786,0.30357358,0.00004840778,0.5085372,0.0029431644,0.17987254],"study_design_scores_gemma":[0.0002421936,0.000120355464,0.00008709613,0.0004393193,0.000011070754,0.00015683,0.0000017288544,0.6004258,0.00036332195,0.38547668,0.01184796,0.000827655],"about_ca_topic_score_codex":0.00011450287,"about_ca_topic_score_gemma":0.00006343168,"teacher_disagreement_score":0.2968522,"about_ca_system_score_codex":0.0002415138,"about_ca_system_score_gemma":0.0007356839,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W4376562663","doi":"10.1002/spe.3214","title":"Fast matrix multiplication via compiler‐only layered data reorganization and intrinsic lowering","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Compiler; Parallel computing; Kernel (algebra); Matrix multiplication; Supercomputer; Code (set theory); Performance improvement; Matrix (chemical analysis); Code generation; Computational science; Programming language; Operating system","score_opus":0.026453969927901524,"score_gpt":0.3220810229898587,"score_spread":0.2956270530619572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376562663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021553926,0.00023812607,0.97567195,0.0009794682,0.00011908601,0.00015390005,0.0000033338988,0.00121993,0.000060305694],"genre_scores_gemma":[0.70065355,0.0007284222,0.29816014,0.00028497013,0.00004303411,0.000012550944,0.000044979442,0.0000121535095,0.000060195012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877787,0.00006324304,0.00020997011,0.00056315574,0.00019046602,0.00019528184],"domain_scores_gemma":[0.998541,0.00034745003,0.0001543356,0.0007268653,0.0001473191,0.00008301503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037167154,0.00012291736,0.0001169513,0.00010849601,0.0003200151,0.0003158866,0.00060623465,0.000059939135,0.0000026313007],"category_scores_gemma":[0.0010094082,0.00012737433,0.000008293462,0.0007482428,0.000062327475,0.002271301,0.0010841934,0.00011709202,0.000026922653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007818823,0.00020775526,0.02179214,0.00014407173,0.000047731937,0.000071726616,0.037914135,0.0032922728,0.0038162966,0.0053497404,0.0048830346,0.9224029],"study_design_scores_gemma":[0.000714741,0.00016862039,0.014129322,0.00011292811,0.000021544176,0.0004532394,0.0016657934,0.95207053,0.003031453,0.0012668163,0.025532177,0.0008328153],"about_ca_topic_score_codex":0.000049735107,"about_ca_topic_score_gemma":0.0000024497763,"teacher_disagreement_score":0.9487783,"about_ca_system_score_codex":0.000016376,"about_ca_system_score_gemma":0.000040432646,"threshold_uncertainty_score":0.5194174},"labels":[],"label_agreement":null},{"id":"W4378192420","doi":"10.1109/synasc57785.2022.00015","title":"Balanced Dense Multivariate Multiplication: The General Case","year":2022,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Multiplication (music); Preprocessor; Computer science; Multivariate statistics; Implementation; Polynomial; Finite field; Parallelism (grammar); Parallel computing; Matrix multiplication; Arithmetic; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Programming language; Combinatorics","score_opus":0.021950230163975678,"score_gpt":0.2814206628345909,"score_spread":0.2594704326706152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378192420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007864087,0.000033520315,0.9862044,0.0024037822,0.00014776918,0.00016084222,0.0000013793343,0.00065319985,0.0025310614],"genre_scores_gemma":[0.68556005,0.0000020083432,0.31128043,0.0013643935,0.00003308988,0.000079977304,0.0000019601696,0.00000422287,0.001673881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917346,0.00015773308,0.00013647949,0.00023782988,0.00015229336,0.0001422263],"domain_scores_gemma":[0.99921393,0.000082302984,0.00006126376,0.00056042586,0.00004753928,0.000034529057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032208939,0.000071754155,0.00006371407,0.00003864722,0.00072423596,0.00008623174,0.0006993239,0.000013398944,0.000055705506],"category_scores_gemma":[0.000018860854,0.00005192098,0.000037440503,0.00032468297,0.000017654078,0.00009222619,0.0005862951,0.00011967032,0.000012032644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017086848,0.00025627873,0.0007106363,0.0000049922014,0.000043654924,0.00070583244,0.0036306675,0.49749318,0.0015559661,0.3734194,0.05880791,0.06335439],"study_design_scores_gemma":[0.00016992056,0.00002276581,0.00024052203,4.1757667e-7,0.0000012824081,0.0008662925,0.000024757375,0.9865144,0.0005330138,0.0008427043,0.010692313,0.00009160253],"about_ca_topic_score_codex":0.00015793218,"about_ca_topic_score_gemma":0.0000037297652,"teacher_disagreement_score":0.67769593,"about_ca_system_score_codex":0.000035308778,"about_ca_system_score_gemma":0.000029368679,"threshold_uncertainty_score":0.5570311},"labels":[],"label_agreement":null},{"id":"W4378420990","doi":"10.1007/978-3-031-33743-7_35","title":"Enhanced Not Recently Used Algorithm for Cache Memory Systems in Mobile Computing","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Cache; FIFO (computing and electronics); Cache algorithms; Parallel computing; Mobile device; CPU cache; Cache coloring; Instruction prefetch; Layer (electronics); Distributed computing; Algorithm; Embedded system; Computer architecture; Computer hardware; Operating system","score_opus":0.02553446339456934,"score_gpt":0.261337144924989,"score_spread":0.23580268153041967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378420990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022858632,0.009062113,0.9841348,0.000034990255,0.002729968,0.00197259,0.000013174474,0.0005424977,0.0014870354],"genre_scores_gemma":[0.83234185,0.005970232,0.1231133,0.00065401854,0.0064211804,0.0013390995,0.00046754247,0.00071153877,0.028981246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690765,0.00015859675,0.0010084833,0.0010047061,0.00033123745,0.0005893188],"domain_scores_gemma":[0.9972513,0.001362811,0.0005180814,0.000617114,0.0001510276,0.000099705554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013450419,0.00053188915,0.0010699802,0.00042373102,0.00015321771,0.0004133862,0.00068544375,0.0008656672,7.8535214e-7],"category_scores_gemma":[0.000052246996,0.00050580426,0.00012895072,0.00027706672,0.000051749634,0.00009610357,0.00026926966,0.0007329059,0.000002972089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005644603,0.000010298157,0.00000640578,0.00017482275,0.000029442455,0.000019257963,0.00034328975,0.888342,0.000005110323,0.0023556303,0.00016460716,0.10854349],"study_design_scores_gemma":[0.00046626735,0.00011224924,0.000004606397,0.0018903903,0.000009872426,0.00001702245,0.000008162852,0.9944117,0.000023248891,0.00057081756,0.0019497949,0.0005358571],"about_ca_topic_score_codex":0.00017636953,"about_ca_topic_score_gemma":0.00007873639,"teacher_disagreement_score":0.86102146,"about_ca_system_score_codex":0.00017221233,"about_ca_system_score_gemma":0.000072794035,"threshold_uncertainty_score":0.99973935},"labels":[],"label_agreement":null},{"id":"W4378589447","doi":"10.1145/3597926.3598065","title":"Type Batched Program Reduction","year":2023,"lang":"en","type":"paratext","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reduction (mathematics); Computer science; Mathematics","score_opus":0.034506057883279984,"score_gpt":0.3227093426833005,"score_spread":0.2882032848000205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378589447","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000068636596,0.00017814458,0.6698438,0.0005154357,0.005829778,0.00040382246,0.0000014057463,0.00498348,0.31823725],"genre_scores_gemma":[0.00024929064,0.0005056206,0.36107638,0.00007250242,0.0003822514,0.00005745094,0.000119147684,0.000033175478,0.63750416],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985859,0.000067297085,0.00026467835,0.00055931695,0.00024274466,0.00028007413],"domain_scores_gemma":[0.998841,0.000028389872,0.0001445888,0.00069614995,0.00021897015,0.000070921604],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019914683,0.00022150592,0.00024704973,0.00024558714,0.00010514566,0.0002973916,0.001000393,0.0002909324,0.00025303752],"category_scores_gemma":[0.00002534245,0.00020276007,0.00008118726,0.0010824368,0.000027466607,0.00014522935,0.0003398693,0.0002806672,0.020236902],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011692822,0.000028454791,9.6221775e-8,0.000018072766,0.0000142047065,0.000001502944,0.000042426407,0.0015327187,0.000011688543,0.0008831336,0.96557206,0.0318945],"study_design_scores_gemma":[0.000107615815,0.0002523283,0.000006131632,0.0000920891,0.0000074516324,0.000019862999,0.0000068657614,0.13387394,0.001327808,0.00086610275,0.8628947,0.0005450705],"about_ca_topic_score_codex":0.000041283485,"about_ca_topic_score_gemma":8.267788e-7,"teacher_disagreement_score":0.31926692,"about_ca_system_score_codex":0.00005212923,"about_ca_system_score_gemma":0.0001747902,"threshold_uncertainty_score":0.980526},"labels":[],"label_agreement":null},{"id":"W4378800919","doi":"10.1145/3583781.3590207","title":"A Machine Learning Based Load Value Approximator Guided by the Tightened Value Locality","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Locality; Hash function; Overhead (engineering); Parallel computing; Memory bandwidth; Bandwidth (computing); Memory model; Value (mathematics); Shared memory; Machine learning; Programming language; Computer network","score_opus":0.021656470455850316,"score_gpt":0.267874890987617,"score_spread":0.2462184205317667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378800919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005464032,0.000107647866,0.985093,0.0041322205,0.000103871236,0.00020774093,0.0000018327403,0.0033855438,0.006421751],"genre_scores_gemma":[0.4952252,0.00006477533,0.48887932,0.0059529664,0.00008428261,0.000086200394,0.00005426984,0.000046990815,0.009605998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808306,0.00036709223,0.00029703145,0.00043711613,0.0004751243,0.00034055224],"domain_scores_gemma":[0.9987739,0.00025371127,0.00010644061,0.0006536098,0.00012308486,0.00008925453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015568397,0.00017362695,0.00017508319,0.00007758412,0.00038842825,0.00022296472,0.0011349415,0.00007286145,0.00002354476],"category_scores_gemma":[0.00020472147,0.00011583865,0.000090561174,0.0010043966,0.00005731165,0.00014569848,0.00035052135,0.0002202946,0.00012415819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014582108,0.00014861167,0.0013041886,0.000047849826,0.000048179118,0.000016931146,0.0005437729,0.64601475,0.00084412907,0.09861712,0.23898722,0.01341269],"study_design_scores_gemma":[0.00024681367,0.000035523735,0.000092040726,0.000013991691,0.0000033208216,0.000003938139,0.0000050940325,0.97684985,0.0048992434,0.0024842804,0.015197576,0.00016829555],"about_ca_topic_score_codex":0.00028519897,"about_ca_topic_score_gemma":0.0000017784116,"teacher_disagreement_score":0.49621367,"about_ca_system_score_codex":0.000062054154,"about_ca_system_score_gemma":0.00013112897,"threshold_uncertainty_score":0.4723763},"labels":[],"label_agreement":null},{"id":"W4378801139","doi":"10.1145/3558481.3591313","title":"Brief Announcement: Is the Problem-Based Benchmark Suite Fearless with Rust?","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; University of Toronto; Gilead Sciences","keywords":"Rust (programming language); Suite; Porting; Benchmark (surveying); Parallel computing; Computer science; Parallelism (grammar); Concurrency; Programming language","score_opus":0.015324318648560686,"score_gpt":0.2436588154326678,"score_spread":0.2283344967841071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378801139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010250778,0.000021570733,0.97129613,0.008704575,0.00004554028,0.0002983819,0.0000024405688,0.0014898881,0.017116418],"genre_scores_gemma":[0.22692448,0.00004027446,0.7525659,0.009314598,0.00007079257,0.000118057185,0.000030297946,0.000027165428,0.010908391],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.00005465331,0.00015721128,0.00033740135,0.00035213778,0.00031247138],"domain_scores_gemma":[0.9990924,0.000093156865,0.00007141839,0.0005660259,0.00012421668,0.000052766063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048642748,0.00012776782,0.0001032433,0.00010115289,0.00031914504,0.0003104115,0.0009066675,0.000036208196,0.000035377718],"category_scores_gemma":[0.000006669036,0.000076153556,0.000037989503,0.001236378,0.000057121015,0.00018454876,0.00019133363,0.000101096084,0.000060884933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039001694,0.00022951874,0.008866381,0.00009232324,0.00010009972,0.000054143788,0.0038887823,0.12397736,0.00015429237,0.18218012,0.6096399,0.0707781],"study_design_scores_gemma":[0.000467678,0.00019298632,0.0027214952,0.000060823262,0.000006201361,0.0000057586885,0.000036072026,0.87801766,0.002426463,0.0022250055,0.11350061,0.00033926073],"about_ca_topic_score_codex":0.000076682525,"about_ca_topic_score_gemma":0.000007739972,"teacher_disagreement_score":0.7540403,"about_ca_system_score_codex":0.000020635707,"about_ca_system_score_gemma":0.00010207579,"threshold_uncertainty_score":0.31054518},"labels":[],"label_agreement":null},{"id":"W4379086819","doi":"10.48550/arxiv.2305.19320","title":"On the algebraic proof complexity of Tensor Isomorphism","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Isomorphism (crystallography); Rank (graph theory); Linear algebra; Upper and lower bounds; Combinatorics; Algebraic number; Tensor (intrinsic definition); Bounded function; Conjecture; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.17282595150007526,"score_gpt":0.2151925318202324,"score_spread":0.04236658032015714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379086819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049794164,0.000013702209,0.9455884,0.0011022278,0.00029187024,0.00040649643,0.000015535215,0.000724822,0.0020627766],"genre_scores_gemma":[0.99195194,0.00003741872,0.006025807,0.00020876911,0.000026401493,0.0000016278664,0.0000094884645,0.000016735072,0.0017218032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984472,0.00022357824,0.00022232902,0.00073690055,0.00012826413,0.00024172959],"domain_scores_gemma":[0.99761194,0.0003120906,0.00035300537,0.001455437,0.00019927607,0.00006822514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039771997,0.0002378453,0.00030469522,0.00023815746,0.00017297531,0.000061516614,0.0024954658,0.00017827823,0.000019479561],"category_scores_gemma":[0.00009899998,0.00020518592,0.00019370955,0.00065972493,0.00028992965,0.00008407237,0.0019298593,0.0004964251,0.00006546164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009079496,0.000063001266,0.00019192522,0.0000314607,0.000041149597,0.000030589097,0.00010800476,0.23736039,0.0000055378814,0.7578392,0.004255214,0.00006447396],"study_design_scores_gemma":[0.000109538065,0.000052482825,0.00063617993,0.00009405202,0.000012630112,0.0000010346281,0.000008713464,0.6101565,0.00036728082,0.38830745,0.0000710226,0.00018313935],"about_ca_topic_score_codex":0.00009538238,"about_ca_topic_score_gemma":0.000009141346,"teacher_disagreement_score":0.9421578,"about_ca_system_score_codex":0.000075364514,"about_ca_system_score_gemma":0.00012114077,"threshold_uncertainty_score":0.8367239},"labels":[],"label_agreement":null},{"id":"W4379518528","doi":"10.1145/3591302","title":"Register Tiling for Unstructured Sparsity in Neural Network Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Speedup; Computer science; Sparse matrix; Parallel computing; Matrix multiplication; Kernel (algebra); Multi-core processor; Algorithm; Mathematics","score_opus":0.030916206885024812,"score_gpt":0.30616507615526506,"score_spread":0.2752488692702402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379518528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9686062,0.00023898632,0.021293985,0.005007478,0.00054578355,0.0013785157,0.000002790468,0.0020649526,0.0008613375],"genre_scores_gemma":[0.7821128,0.0000058083697,0.21757221,0.00010898281,0.000058945287,0.00003212744,0.0000012369284,0.000008857336,0.000099030556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990021,0.000008223175,0.00021107457,0.0002838631,0.00018133741,0.0003134236],"domain_scores_gemma":[0.9990841,0.00020202916,0.00019467795,0.00037925053,0.00011108825,0.00002884365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051553646,0.00011855101,0.00016403742,0.000112627684,0.00011612312,0.00012657778,0.002075936,0.000060791946,3.8942468e-7],"category_scores_gemma":[0.0013952227,0.00008806331,0.000073648735,0.0008763006,0.00004489141,0.00015304238,0.0008450229,0.00014131011,8.9280894e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014905361,0.00015945408,0.09711548,0.00067907124,0.000062005114,0.0000071394456,0.009683681,0.044339996,0.0020657855,0.08597321,0.017449481,0.74231565],"study_design_scores_gemma":[0.0021624651,0.0007251657,0.06300697,0.0016978135,0.00004342531,0.000027186434,0.0010343629,0.7374584,0.047393322,0.1372222,0.007818943,0.0014097533],"about_ca_topic_score_codex":0.000008333384,"about_ca_topic_score_gemma":0.0000036792921,"teacher_disagreement_score":0.7409059,"about_ca_system_score_codex":0.000019397383,"about_ca_system_score_gemma":0.00001395047,"threshold_uncertainty_score":0.385764},"labels":[],"label_agreement":null},{"id":"W4379522417","doi":"10.1145/3591195.3595274","title":"Memory Consistency Models for Program Transformations: An Intellectual Abstract","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Consistency (knowledge bases); Computer science; Sequential consistency; Consistency model; Compiler; Set (abstract data type); Property (philosophy); Memory model; Weak consistency; Parallel computing; Shared memory; Software; Programming language; Theoretical computer science; Strong consistency; Distributed computing; Data consistency; Artificial intelligence; Mathematics","score_opus":0.06552102090498618,"score_gpt":0.32203918889877037,"score_spread":0.2565181679937842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379522417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074836,0.000023316274,0.97486216,0.00046742026,0.000085518994,0.000567166,0.0000023332252,0.0047334717,0.018510276],"genre_scores_gemma":[0.30764577,0.000049815542,0.69109875,0.00022719377,0.000026821044,0.00023877935,0.000033136886,0.000010139907,0.0006696077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.000019690024,0.00024124152,0.00022681091,0.00012726815,0.0002211219],"domain_scores_gemma":[0.999299,0.000177016,0.00003635303,0.00029073533,0.0001278021,0.000069091584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035498105,0.00009421125,0.00010363025,0.00017317761,0.00018803694,0.00017033986,0.00048482808,0.000052375177,0.000012198172],"category_scores_gemma":[0.00004692727,0.000084332205,0.00006531382,0.00045272356,0.00002780642,0.0007778917,0.000039318995,0.00005964043,0.000035630972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000848267,0.00020371293,0.0000011118517,0.000042829597,0.000019107483,0.0000018190952,0.0049619875,0.12441066,0.000040651215,0.09647329,0.027864894,0.74597144],"study_design_scores_gemma":[0.00013839873,0.00014864987,0.00001086346,0.0000074287505,0.0000019095887,0.0000034675481,0.00008544397,0.9705502,0.001016491,0.026205963,0.0017087946,0.00012240424],"about_ca_topic_score_codex":0.000008206932,"about_ca_topic_score_gemma":0.000003904417,"teacher_disagreement_score":0.84613955,"about_ca_system_score_codex":0.000013027192,"about_ca_system_score_gemma":0.00006959547,"threshold_uncertainty_score":0.34389675},"labels":[],"label_agreement":null},{"id":"W4379620258","doi":"10.1145/3555776.3577631","title":"Tracking Coherence-Related Contention Delays in Real-Time Multicore Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Agencia Estatal de Investigación; European Research Council","keywords":"Computer science; Cache coherence; Thread (computing); Multi-core processor; Cache; Multithreading; Key (lock); Coherence (philosophical gambling strategy); Distributed computing; Parallel computing; Instruction set; Embedded system; CPU cache; Real-time computing; Operating system; Cache algorithms","score_opus":0.03754976285710926,"score_gpt":0.27969151203137094,"score_spread":0.24214174917426168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379620258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1088918,0.00004912386,0.86818933,0.00022967695,0.00037473458,0.00045482986,0.0000010374529,0.005237062,0.016572414],"genre_scores_gemma":[0.97422725,0.000037786973,0.021316431,0.00001773025,0.000011294148,0.000022054179,0.000011978175,0.00000889487,0.0043465975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886155,0.00010233202,0.00033780915,0.00029157533,0.00016774941,0.00023895953],"domain_scores_gemma":[0.99939984,0.00010186035,0.00008825559,0.00027221776,0.00009126936,0.000046547542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005110027,0.00010044241,0.00015747298,0.0002551534,0.00007232563,0.0001559614,0.00041049015,0.00008730802,0.000011181441],"category_scores_gemma":[0.00004539859,0.00009300699,0.000038880044,0.000947102,0.000017757186,0.00027821996,0.00010899628,0.00009523641,0.00026717965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016603748,0.0002450618,0.013896502,0.000093855764,0.000063000574,0.00022996729,0.0036239882,0.76263636,0.018068444,0.1495803,0.017719872,0.033826023],"study_design_scores_gemma":[0.00024593927,0.00002687311,0.0036926179,0.0000738107,0.0000012283474,0.0000066963403,0.00003373133,0.9949079,0.00029557207,0.0005447402,0.000048862705,0.000122004334],"about_ca_topic_score_codex":0.00036407073,"about_ca_topic_score_gemma":0.0000075913485,"teacher_disagreement_score":0.8653354,"about_ca_system_score_codex":0.00004263458,"about_ca_system_score_gemma":0.00002563072,"threshold_uncertainty_score":0.37927148},"labels":[],"label_agreement":null},{"id":"W4380077763","doi":"10.46586/tches.v2023.i3.246-269","title":"Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling","year":2023,"lang":"en","type":"article","venue":"IACR Transactions on Cryptographic Hardware and Embedded Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Impact Fund","keywords":"Parallel computing; Isogeny; Computer science; Computation; Multi-core processor; Concurrency; Scheduling (production processes); Synchronization (alternating current); Parallelism (grammar); Implementation; Distributed computing; Algorithm; Programming language; Mathematics; Elliptic curve; Mathematical optimization","score_opus":0.046063533060430074,"score_gpt":0.2983112433225207,"score_spread":0.2522477102620906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380077763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071512684,0.0004121079,0.926432,0.00007343862,0.00036117702,0.0003556415,0.000024317871,0.00071599544,0.00011264241],"genre_scores_gemma":[0.9062497,0.00036876881,0.09326459,0.000018437357,0.000029913734,0.000033903634,0.0000067299256,0.000017333407,0.0000106219695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815166,0.00023991555,0.0004955459,0.00046976088,0.00030908873,0.00033402702],"domain_scores_gemma":[0.999002,0.00020946446,0.00019550575,0.00028856515,0.000181559,0.00012293311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007034187,0.00023678243,0.00039318873,0.0007098511,0.00045056886,0.00019507312,0.00022816421,0.00015326067,0.00000251623],"category_scores_gemma":[0.00002156154,0.00023334331,0.00011879556,0.0012747841,0.00011884017,0.00038435645,0.000019740517,0.00018867878,0.000002466395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013986812,0.00032807796,0.0015616908,0.0010328684,0.00053637667,0.00002789256,0.009000825,0.9339325,0.0069487602,0.02418593,0.00011325517,0.022191973],"study_design_scores_gemma":[0.000834413,0.0001465128,0.00048348593,0.00038751945,0.000034842185,0.000032340635,0.00068579265,0.99573356,0.00036411142,0.0009263528,0.00007564425,0.00029541095],"about_ca_topic_score_codex":0.00007470371,"about_ca_topic_score_gemma":0.000009637335,"teacher_disagreement_score":0.834737,"about_ca_system_score_codex":0.000015692705,"about_ca_system_score_gemma":0.00005844749,"threshold_uncertainty_score":0.9515464},"labels":[],"label_agreement":null},{"id":"W4380087783","doi":"10.1145/3603503","title":"rNdN: Fast Query Compilation for NVIDIA GPUs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Compiler; Parallel computing; Pipeline (software); Query optimization; Cache; Interprocedural optimization; Optimizing compiler; Programming language; Database; Loop optimization","score_opus":0.019207370622381884,"score_gpt":0.26343195738768405,"score_spread":0.24422458676530218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380087783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002507686,0.000030793137,0.994297,0.0032586665,0.00019425579,0.0003980816,0.000046536745,0.0012233686,0.0003005249],"genre_scores_gemma":[0.114504926,0.00025163149,0.8836576,0.0006254873,0.0000578745,0.0001387755,0.00013437636,0.000030292435,0.0005990799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00006545882,0.00023099444,0.0004185831,0.00017186784,0.00023851694],"domain_scores_gemma":[0.9989963,0.00026117841,0.00008231332,0.00048482802,0.00009590963,0.00007943816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019858131,0.00017564304,0.00015808937,0.00038803567,0.00045961168,0.00015351728,0.000396473,0.0001042289,0.000008407001],"category_scores_gemma":[0.0000408684,0.00017199095,0.00007612237,0.00073254417,0.000037602633,0.00021789708,0.00002140778,0.00014984637,0.000008610434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019774388,0.0000272919,0.000008489346,0.000013281413,0.0000127694175,6.1643783e-7,0.00039075158,0.88608325,0.00004809397,0.0007381265,0.00032817354,0.11232937],"study_design_scores_gemma":[0.00040525073,0.00015223131,0.0001275196,0.000029281468,0.0000135932405,0.000009861376,0.000019237781,0.98993415,0.0011433378,0.0056397235,0.0023158751,0.00020993518],"about_ca_topic_score_codex":0.000003822766,"about_ca_topic_score_gemma":0.000010513554,"teacher_disagreement_score":0.11425416,"about_ca_system_score_codex":0.000023676763,"about_ca_system_score_gemma":0.000034851117,"threshold_uncertainty_score":0.70135874},"labels":[],"label_agreement":null},{"id":"W4380480242","doi":"10.1145/3589610.3596283","title":"Tiling for DMA-Based Hardware Accelerators (WIP)","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Compiler; Parallel computing; Transfer (computing); Tile; Computer hardware; Embedded system; Operating system","score_opus":0.04559310396857352,"score_gpt":0.30510862849567344,"score_spread":0.2595155245270999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380480242","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011903174,0.0000101408,0.9918381,0.0009601941,0.00018288754,0.00016500433,0.0000014920176,0.0033748285,0.002277024],"genre_scores_gemma":[0.2711531,0.0000042355787,0.72560686,0.001081297,0.00006360195,0.00005624804,0.0000150349715,0.000013757327,0.0020058518],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992396,0.000018547102,0.00014162775,0.00026104678,0.00012014225,0.000219033],"domain_scores_gemma":[0.99937934,0.00012843638,0.000037927533,0.00030441306,0.0000976919,0.000052191794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026337258,0.00008446966,0.000093134375,0.00015139664,0.00015592143,0.00015316093,0.000540537,0.00004337734,0.000010318857],"category_scores_gemma":[0.000056374007,0.000076551994,0.00006168485,0.0005673706,0.000010211744,0.00014585383,0.000101305195,0.00004423996,0.00005828557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019507022,0.00011836051,0.001774231,0.00012482058,0.00003897825,0.00001816492,0.00062104635,0.30901003,0.0009950954,0.13081186,0.4235757,0.1328922],"study_design_scores_gemma":[0.00015779807,0.000033308697,0.00011207596,0.000009706738,0.000001060148,3.6796638e-7,0.0000052183295,0.96650106,0.016881274,0.0015409989,0.014643043,0.00011406516],"about_ca_topic_score_codex":0.0000041973517,"about_ca_topic_score_gemma":9.697591e-7,"teacher_disagreement_score":0.657491,"about_ca_system_score_codex":0.000015412172,"about_ca_system_score_gemma":0.0000585754,"threshold_uncertainty_score":0.31216997},"labels":[],"label_agreement":null},{"id":"W4381389666","doi":"10.1145/3589236.3589241","title":"GPU Auto-tuning Framework for Optimal Performance and Power Consumption","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Loop unrolling; Computer science; Parallel computing; Code (set theory); Sorting; Energy consumption; Computer engineering; Tuner; Code generation; Power (physics); General-purpose computing on graphics processing units; Algorithm; Compiler; Graphics","score_opus":0.030432409319312723,"score_gpt":0.2950581890938484,"score_spread":0.26462577977453566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381389666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044422317,0.000023932842,0.95273924,0.00041694866,0.00012895999,0.000118208714,5.1293597e-7,0.0014907506,0.00065911206],"genre_scores_gemma":[0.37116003,0.000057898586,0.6281312,0.00017145932,0.000014181596,0.00001408708,0.000001885664,0.000004775679,0.0004444601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000014428576,0.00011658755,0.00022484563,0.00008947495,0.00018819461],"domain_scores_gemma":[0.99951816,0.00015606816,0.000039871396,0.0001943811,0.00004658512,0.00004492186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783105,0.00007593088,0.00008179067,0.00010352382,0.00018136395,0.00012739924,0.00023191614,0.00006069541,0.000009486131],"category_scores_gemma":[0.000047283404,0.000070432936,0.000021970145,0.00022124815,0.000026191832,0.00023828377,0.0001560333,0.000072913215,0.000031268988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041912695,0.00005667969,0.010313087,0.00014255251,0.00004168984,0.000006244237,0.0028954274,0.05060779,0.00037977353,0.795791,0.033037513,0.10668636],"study_design_scores_gemma":[0.000097308206,0.00006829147,0.004398283,0.000029765293,0.0000012124646,0.0000043364585,0.000007939996,0.9903546,0.00045073585,0.002451602,0.00202636,0.00010955298],"about_ca_topic_score_codex":9.1562754e-7,"about_ca_topic_score_gemma":7.01273e-8,"teacher_disagreement_score":0.9397468,"about_ca_system_score_codex":0.000009527157,"about_ca_system_score_gemma":0.000015457977,"threshold_uncertainty_score":0.2872172},"labels":[],"label_agreement":null},{"id":"W4381708246","doi":"10.5281/zenodo.8075232","title":"GALAHAD 4 an open source library of Fortran packages with C and Matlab interfaces for continuous optimization'","year":2023,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Engineering and Physical Sciences Research Council; UK Research and Innovation","keywords":"Fortran; MATLAB; Open source; Computer science; Computational science; Operating system; Programming language; Parallel computing; Software engineering; Software","score_opus":0.013672533596599108,"score_gpt":0.24597390198281066,"score_spread":0.23230136838621154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381708246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025715314,0.00018821313,0.9680398,0.0020296648,0.00003166175,0.0011318543,0.000026478128,0.00251725,0.0003197675],"genre_scores_gemma":[0.31076947,0.00015738852,0.6873793,0.00042648727,0.000022492546,0.00029664897,0.00004475226,0.000053646258,0.00084980106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829465,0.00011762006,0.00040822048,0.0005383307,0.00020061804,0.00044054622],"domain_scores_gemma":[0.9984663,0.00016640499,0.00028661118,0.0007679053,0.00012570021,0.00018706998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553301,0.00026037527,0.00040039458,0.00042226422,0.00023614193,0.0007502737,0.0015583499,0.00014610663,0.0000059723075],"category_scores_gemma":[0.000060278046,0.00023353536,0.000046399702,0.00083933584,0.000103255705,0.0016688509,0.0007831442,0.00013886088,9.875326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005102538,0.0006027524,0.04255174,0.00030837237,0.00020164117,0.000033735396,0.0030544775,0.72945875,0.0027023342,0.096413955,0.02455285,0.09960914],"study_design_scores_gemma":[0.0006355578,0.0007533277,0.0026056452,0.0001050476,0.000014636952,0.000038131187,0.00010988023,0.9741213,0.017855998,0.0023109294,0.001101903,0.00034767328],"about_ca_topic_score_codex":0.00047959184,"about_ca_topic_score_gemma":0.0000735311,"teacher_disagreement_score":0.28505415,"about_ca_system_score_codex":0.000027829432,"about_ca_system_score_gemma":0.0001408541,"threshold_uncertainty_score":0.9523295},"labels":[],"label_agreement":null},{"id":"W4381846375","doi":"10.1109/rtas58335.2023.00027","title":"ZeroCost-LLC: Shared LLCs at No Cost to WCL","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Memory hierarchy; Cache; Partition (number theory); Shared memory; Latency (audio); CPU cache; Operating system; Hierarchy; Mathematics; Combinatorics","score_opus":0.030557359159829666,"score_gpt":0.28716813479244835,"score_spread":0.2566107756326187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381846375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010138799,0.000008068238,0.94262254,0.0021396556,0.00029470856,0.0003135238,0.000003432991,0.0040576127,0.049546562],"genre_scores_gemma":[0.0524088,0.000038096347,0.81206614,0.0063594664,0.00015137972,0.00011490559,0.000039328355,0.000031762444,0.12879014],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886525,0.000032303145,0.00017577683,0.00038730085,0.00022501923,0.00031435513],"domain_scores_gemma":[0.99907243,0.000073998555,0.00003617666,0.0005368938,0.0001291345,0.00015137721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021714033,0.00011581263,0.00012023357,0.00017133665,0.00017072071,0.00017317907,0.00088799594,0.00005105584,0.00017379192],"category_scores_gemma":[0.000079444246,0.00010630833,0.00004655463,0.0009233572,0.0000111498375,0.00018292131,0.0008849805,0.00006214135,0.0095196245],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043080067,0.000018224246,0.0003881593,0.0000053540143,0.000005474475,0.000011361919,0.00026334377,0.004828615,0.00040991965,0.0045466814,0.9776598,0.01185872],"study_design_scores_gemma":[0.00023047639,0.00010254017,0.0023214114,0.000027056487,0.0000013181316,0.000007621361,0.00000439032,0.50504375,0.0050679184,0.00038652864,0.486446,0.0003609986],"about_ca_topic_score_codex":0.000020025522,"about_ca_topic_score_gemma":0.000005643227,"teacher_disagreement_score":0.5002151,"about_ca_system_score_codex":0.000059587168,"about_ca_system_score_gemma":0.00002654154,"threshold_uncertainty_score":0.9912516},"labels":[],"label_agreement":null},{"id":"W4381886109","doi":"10.1109/ispass57527.2023.00033","title":"Sunstone: A Scalable and Versatile Scheduler for Mapping Tensor Algebra on Spatial Accelerators","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dataflow; Computer science; Scalability; Reuse; Tensor (intrinsic definition); Parallel computing; Design space exploration; Dataflow architecture; Stream processing; Computer architecture; Tensor algebra; Computation; Computer engineering; Computational science; Embedded system; Programming language; Algebra over a field; Mathematics","score_opus":0.031460123815776043,"score_gpt":0.2686958741243048,"score_spread":0.23723575030852875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381886109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034949463,0.000011095051,0.9594799,0.0010962079,0.00015898203,0.00025572834,0.0000016616972,0.0013805245,0.0026663856],"genre_scores_gemma":[0.67187476,0.000019829313,0.32538724,0.0008639224,0.00007641778,0.00005453443,0.000007634322,0.000015420568,0.0017002329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911296,0.000022907372,0.00014616498,0.00033506312,0.00013432637,0.0002485531],"domain_scores_gemma":[0.99944216,0.0001319483,0.000043433432,0.00024609565,0.00006838564,0.00006800109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025177436,0.000107732274,0.00012258228,0.00019447278,0.00019585142,0.00018057291,0.00028811322,0.000056623085,0.00001563012],"category_scores_gemma":[0.00006306362,0.00009580735,0.000035496192,0.0004241903,0.000024565561,0.00018352891,0.00016442075,0.00006292784,0.000050679482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008843506,0.000282035,0.0077843918,0.00019904507,0.00014262825,0.000026201327,0.002963838,0.024184305,0.0020910657,0.32773724,0.2559695,0.3785313],"study_design_scores_gemma":[0.00047046278,0.00011588208,0.002419615,0.000026000578,0.0000019691088,0.0000020177924,0.000026252028,0.98033273,0.005882375,0.0024073243,0.008120611,0.00019474461],"about_ca_topic_score_codex":0.000033882654,"about_ca_topic_score_gemma":0.0000023541581,"teacher_disagreement_score":0.95614845,"about_ca_system_score_codex":0.00001747794,"about_ca_system_score_gemma":0.000032352047,"threshold_uncertainty_score":0.39069104},"labels":[],"label_agreement":null},{"id":"W4382050489","doi":"10.1109/meco58584.2023.10155064","title":"Java Runtime Optimization for Copying Arrays on AArch64","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of New Brunswick","funders":"","keywords":"Computer science; Copying; Compiler; Just-in-time compilation; Garbage collection; Benchmark (surveying); Java; Parallel computing; Code (set theory); Operating system; TRACE (psycholinguistics); Programming language; Garbage","score_opus":0.03332611941808644,"score_gpt":0.2929771539144813,"score_spread":0.2596510344963949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382050489","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022485263,0.0000047009144,0.9867206,0.0011548556,0.00018502945,0.00024200304,0.0000011356022,0.0026406427,0.008826162],"genre_scores_gemma":[0.0570862,0.000021816784,0.9396319,0.0007161578,0.00006501469,0.000047913345,0.000022698907,0.000014865579,0.002393437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991107,0.000020581178,0.00016533,0.00030495098,0.00016124354,0.0002371767],"domain_scores_gemma":[0.9993454,0.00013303134,0.000054264932,0.00032499307,0.00009228359,0.00005001377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034105976,0.00009906296,0.00010432508,0.00021037349,0.00020295913,0.00014466826,0.00047700235,0.000047841146,0.00001959337],"category_scores_gemma":[0.00007495092,0.00009137848,0.000053284526,0.0006024557,0.000013512968,0.00018057565,0.00011288156,0.00005271379,0.0001043465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036684671,0.000017016178,0.000015710077,0.000006833522,0.0000050585763,9.4053956e-7,0.000121348196,0.92038953,0.000085300046,0.042063665,0.031126535,0.0061643836],"study_design_scores_gemma":[0.00016494415,0.00008469616,0.000023781786,0.000014692112,0.0000012501654,9.0676434e-7,0.0000060438347,0.9920654,0.003123087,0.0021629278,0.002230091,0.00012216796],"about_ca_topic_score_codex":0.000003965351,"about_ca_topic_score_gemma":2.5827902e-7,"teacher_disagreement_score":0.07167587,"about_ca_system_score_codex":0.000022363944,"about_ca_system_score_gemma":0.000028453158,"threshold_uncertainty_score":0.37263066},"labels":[],"label_agreement":null},{"id":"W4384434405","doi":"10.2139/ssrn.4511776","title":"Design and Implementation of the Vizapi Tool for Visualizing Java Static and Dynamic Analysis Results","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Java; Computer science; Static analysis; Programming language; Software engineering","score_opus":0.021344544252761513,"score_gpt":0.3377937278145316,"score_spread":0.3164491835617701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384434405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020341577,0.00053789624,0.9777505,0.0007458991,0.000092925824,0.00044455737,0.0000094084235,0.00007550994,0.0000017427078],"genre_scores_gemma":[0.84996134,0.0042585535,0.14554238,0.000038553684,0.000023871218,0.000025757668,0.000014295736,0.000018137365,0.00011710784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979495,0.00026041645,0.00052958686,0.00036074666,0.00022769191,0.00067209866],"domain_scores_gemma":[0.9985622,0.00026526005,0.0006747442,0.00031306833,0.0001542419,0.000030492807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036490585,0.00016079209,0.00027783343,0.00032403367,0.00023144811,0.00020806877,0.0005486805,0.000079616366,2.828751e-7],"category_scores_gemma":[0.00008115679,0.00012696395,0.00012372305,0.00042604184,0.000032875403,0.00011048312,0.0004522206,0.00063625997,1.2633961e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000224574,0.00011527727,0.0028666195,0.00042997074,0.0064634033,0.0000035059634,0.0097329,0.6315992,0.0008403086,0.11689922,0.0006176441,0.23020738],"study_design_scores_gemma":[0.00045321597,0.00016839254,0.0013315453,0.000054050484,0.00024635997,0.000018162993,0.00022216109,0.7879828,0.0003077165,0.20904227,0.000009357822,0.00016394342],"about_ca_topic_score_codex":0.00006927024,"about_ca_topic_score_gemma":0.00015597686,"teacher_disagreement_score":0.8322081,"about_ca_system_score_codex":0.00024986546,"about_ca_system_score_gemma":0.0010247844,"threshold_uncertainty_score":0.51774395},"labels":[],"label_agreement":null},{"id":"W4384697207","doi":"10.22215/etd/2023-15552","title":"Methods and Techniques for Inter-cloud Data Transfers","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Distributed computing; State (computer science); Transfer (computing); Scheme (mathematics); Proof of concept; Real-time computing; Operating system; Algorithm","score_opus":0.06664419942692498,"score_gpt":0.4150997805843252,"score_spread":0.34845558115740016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384697207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023196935,0.00011657868,0.9911065,0.00024824368,0.0006544332,0.0005043844,0.000021840377,0.0027904424,0.0045343647],"genre_scores_gemma":[0.00023293508,0.00030244916,0.9870156,0.00013083054,0.000087698114,0.000095214986,0.00093510846,0.000038353253,0.011161808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849725,0.00009106723,0.00032144343,0.00076785916,0.0001165253,0.00020588371],"domain_scores_gemma":[0.99840707,0.00031244452,0.00009494663,0.0010075268,0.00011925023,0.000058739977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365305,0.00022735709,0.0002994442,0.00025695522,0.00011471592,0.00023925334,0.0018296462,0.00024105459,0.000003584924],"category_scores_gemma":[0.00012948496,0.00021039392,0.00006070616,0.0002733534,0.000018754004,0.00024980603,0.00023109034,0.00016925379,0.0000025887489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011612336,0.000017481087,0.0000015281977,0.00019255799,0.00004424286,0.0000012482077,0.0006295786,0.0000040682667,0.0002157406,0.0136457225,0.05658283,0.9286534],"study_design_scores_gemma":[0.0004305655,0.00060617714,0.000054700748,0.00063820876,0.00011559821,0.000012810415,0.0004294059,0.7234662,0.08686194,0.049052045,0.13663675,0.0016955829],"about_ca_topic_score_codex":0.000046067813,"about_ca_topic_score_gemma":0.000048657774,"teacher_disagreement_score":0.9269578,"about_ca_system_score_codex":0.000015012983,"about_ca_system_score_gemma":0.000075471115,"threshold_uncertainty_score":0.8579615},"labels":[],"label_agreement":null},{"id":"W4385192453","doi":"10.23919/vlsitechnologyandcir57934.2023.10185224","title":"AMD Instinct<sup>TM</sup> MI250X Accelerator enabled by Elevated Fanout Bridge Advanced Packaging Architecture","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Architecture; Supercomputer; Computer science; Computer architecture; Parallel computing","score_opus":0.015103748609618176,"score_gpt":0.25601549349690866,"score_spread":0.2409117448872905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385192453","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11417578,0.00008097964,0.87321895,0.0012323845,0.0001382737,0.00036884318,0.000011286471,0.006590944,0.0041825287],"genre_scores_gemma":[0.8443115,0.00010141858,0.14764106,0.001839355,0.000094464216,0.000066697714,0.00010618414,0.000056417288,0.0057829497],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974545,0.00013779967,0.00044271472,0.00080946623,0.00041277788,0.0007427323],"domain_scores_gemma":[0.998442,0.0002045134,0.00014229093,0.00084243825,0.00016625068,0.00020252823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003872789,0.00034660933,0.00034017934,0.00034393297,0.00034562894,0.00038967212,0.0013912441,0.00013158613,0.00004662155],"category_scores_gemma":[0.00017032083,0.00031297957,0.00010728978,0.0019819192,0.000047376154,0.00045635513,0.00060672325,0.00034210208,0.00019947482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084903615,0.0003826571,0.0022877816,0.00018087453,0.00019516864,0.00024312935,0.00598238,0.307214,0.04130758,0.010785071,0.32502297,0.3063135],"study_design_scores_gemma":[0.0010190066,0.00012601173,0.00069565437,0.00008117604,0.0000073797573,0.000026904841,0.00004271019,0.89263284,0.048056357,0.0018062041,0.05469869,0.0008070454],"about_ca_topic_score_codex":0.00004953397,"about_ca_topic_score_gemma":0.0000047974345,"teacher_disagreement_score":0.7301357,"about_ca_system_score_codex":0.000064505206,"about_ca_system_score_gemma":0.00012316281,"threshold_uncertainty_score":0.9999322},"labels":[],"label_agreement":null},{"id":"W4385336171","doi":"10.1016/j.sysarc.2023.102955","title":"CPU frequency scheduling of real-time applications on embedded devices with temporal encoding-based deep reinforcement learning","year":2023,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Workload; Linux kernel; Embedded system; Benchmark (surveying); Scheduling (production processes); Performance improvement; Kernel (algebra); Real-time computing; Operating system; Artificial intelligence","score_opus":0.012456447333979794,"score_gpt":0.25527944892189336,"score_spread":0.24282300158791356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385336171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020626036,0.000099468205,0.9776224,0.00018426712,0.00006625215,0.0002582834,5.6337205e-7,0.00023878574,0.0009039478],"genre_scores_gemma":[0.8525961,0.000014860172,0.14717753,0.00002548595,0.00010349876,0.000014184904,0.000004596875,0.000013460523,0.000050270857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982567,0.00014984442,0.0006422354,0.00019818606,0.0005417911,0.00021126118],"domain_scores_gemma":[0.997993,0.00019833015,0.0010746688,0.00031501602,0.0003211006,0.00009789094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008212681,0.0001607453,0.00033532808,0.00054900337,0.00016566995,0.00009882454,0.0006414184,0.000070075504,0.0000027578078],"category_scores_gemma":[0.000044776083,0.00011661113,0.00009709059,0.0008303823,0.000034312907,0.00012149887,0.0000530158,0.00034360823,0.0000072993175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015595699,0.000019066358,0.0010808125,0.00009442256,0.00004067259,0.000013107883,0.00066418044,0.99506855,0.001602994,0.00083160016,0.000032049156,0.0005369546],"study_design_scores_gemma":[0.00051726546,0.00090024713,0.00027592113,0.0010287672,0.000018848747,0.00008542019,0.00016772223,0.994437,0.0017710793,0.00020891357,0.00036484137,0.0002239929],"about_ca_topic_score_codex":0.00002919185,"about_ca_topic_score_gemma":0.0000018207405,"teacher_disagreement_score":0.8319701,"about_ca_system_score_codex":0.00005201127,"about_ca_system_score_gemma":0.00016312007,"threshold_uncertainty_score":0.4755264},"labels":[],"label_agreement":null},{"id":"W4385381666","doi":"10.1007/s11265-023-01885-5","title":"The Good, the Bad and the Ugly: Practices and Perspectives on Hardware Acceleration for Embedded Image Processing","year":2023,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Hardware acceleration; Bespoke; Design space exploration; Acceleration; Image processing; Software deployment; Computer engineering; Process (computing); Partition (number theory); Application-specific integrated circuit; Computer hardware; Embedded system; Computer architecture; Artificial intelligence; Image (mathematics); Programming language; Software engineering; Field-programmable gate array","score_opus":0.042210781030266466,"score_gpt":0.3194950669638841,"score_spread":0.2772842859336176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385381666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061304606,0.009812795,0.96580863,0.016834743,0.00016621643,0.0005670534,8.776706e-7,0.00014311855,0.00053611235],"genre_scores_gemma":[0.99199796,0.00034655785,0.0070371036,0.00012749078,0.0002644803,0.00002823654,2.7900637e-7,0.000011447593,0.0001864288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986009,0.00031864483,0.0003773695,0.00018272422,0.00035794062,0.00016239147],"domain_scores_gemma":[0.99673724,0.0011452213,0.0013486117,0.00013003948,0.00060231914,0.000036587666],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004145177,0.00012040057,0.00018335847,0.00008403996,0.001338512,0.003075627,0.00049917516,0.000039438994,1.3163364e-7],"category_scores_gemma":[0.00045435035,0.00005241144,0.000047819754,0.00031572412,0.00016430196,0.0010078816,0.0000776461,0.0002466587,4.303183e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001826945,0.0002776981,0.0004121526,0.0018375317,0.00045599445,0.00004729656,0.20880456,0.05617033,0.00573991,0.12146184,0.019577136,0.5833886],"study_design_scores_gemma":[0.00070990773,0.00018355102,0.00020324382,0.00049346645,0.000027348571,0.0001747726,0.009037959,0.98481125,0.0002765561,0.0022482197,0.0017202895,0.00011342923],"about_ca_topic_score_codex":0.000004599794,"about_ca_topic_score_gemma":7.6603374e-7,"teacher_disagreement_score":0.9858675,"about_ca_system_score_codex":0.000024764282,"about_ca_system_score_gemma":0.00017027497,"threshold_uncertainty_score":0.9999616},"labels":[],"label_agreement":null},{"id":"W4385490781","doi":"10.1016/j.cpc.2023.108884","title":"Parallel model of chemical reactions on a grained molecular level","year":2023,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Narodowe Centrum Nauki","keywords":"Computer science; Lattice (music); Computational science; Simple (philosophy); Cluster (spacecraft); Algorithm; Chemical reaction; Parallel computing; Field-programmable gate array; Extension (predicate logic); Statistical physics; Chemistry; Physics; Computer hardware","score_opus":0.10346901675565921,"score_gpt":0.31430847933575873,"score_spread":0.2108394625800995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385490781","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008905552,0.000014565576,0.9939673,0.0019026893,0.000050011065,0.00015717404,0.000010657439,0.0009636673,0.0020433927],"genre_scores_gemma":[0.2846905,0.000037443064,0.71483505,0.00024366225,0.000021738502,0.000039617073,0.000048444574,0.000013578828,0.000069975016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883664,0.00010540515,0.00033503948,0.00028835944,0.00022333061,0.00021125439],"domain_scores_gemma":[0.9965541,0.00025969828,0.00016559957,0.00275042,0.00019939893,0.0000707985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019481253,0.00015359065,0.00020303039,0.00014692795,0.00016165715,0.000059092956,0.002407619,0.000060716204,4.970907e-7],"category_scores_gemma":[0.000024149802,0.00016655774,0.00013682975,0.000978318,0.0001120754,0.00017334093,0.0012981337,0.00023144248,0.000043442855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016597783,0.00018348629,0.0000048056695,0.000008046159,0.000023182065,4.82551e-7,0.00029966224,0.3548533,0.0035962022,0.630998,0.002649189,0.0073819365],"study_design_scores_gemma":[0.00016279578,0.000028113254,0.000026899635,0.00003431068,0.0000045193724,0.0000010973389,0.0000018136074,0.92165816,0.0020738833,0.075651124,0.00020934282,0.00014792099],"about_ca_topic_score_codex":0.000008215964,"about_ca_topic_score_gemma":2.4170848e-7,"teacher_disagreement_score":0.5668049,"about_ca_system_score_codex":0.00003399426,"about_ca_system_score_gemma":0.00008707268,"threshold_uncertainty_score":0.67920274},"labels":[],"label_agreement":null},{"id":"W4385757678","doi":"10.1109/lca.2023.3304613","title":"By-Software Branch Prediction in Loops","year":2023,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Branch predictor; Loop unrolling; Parallel computing; Spec#; Speedup; Overhead (engineering); Compiler; Software; Call graph; Instruction set; Theoretical computer science; Programming language","score_opus":0.008231002039466353,"score_gpt":0.22015270033856177,"score_spread":0.2119216982990954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385757678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047522344,0.000024454961,0.9432625,0.0051720827,0.0009147428,0.00021348876,0.000007859612,0.0028239137,0.0000586162],"genre_scores_gemma":[0.38336518,0.000021664988,0.59881735,0.01660679,0.00073831616,0.0000746076,0.000082667175,0.00006346428,0.00022997787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810886,0.00014894735,0.00032071507,0.00061879365,0.0003219255,0.00048073675],"domain_scores_gemma":[0.9990714,0.00016315578,0.00007808677,0.0005651385,0.000029630399,0.000092570685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687045,0.00023437633,0.00021751529,0.0005185517,0.000112599875,0.00016074204,0.0010173343,0.0000919787,0.0000031521613],"category_scores_gemma":[0.000012132801,0.00023184587,0.000086716136,0.001339214,0.000045874272,0.00019679945,0.00022486474,0.00037210443,0.00008185476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006519191,0.00004095479,0.0028601973,0.000029000084,0.000017186008,0.000048234648,0.0016771912,0.6163255,0.0035637931,0.000048618414,0.26824042,0.10714236],"study_design_scores_gemma":[0.0009858474,0.00014291726,0.012863153,0.00015333146,0.0000047756002,0.00007713968,0.0000016285493,0.9569707,0.004205043,0.002214042,0.021692723,0.0006887108],"about_ca_topic_score_codex":0.000022981538,"about_ca_topic_score_gemma":0.000004576434,"teacher_disagreement_score":0.34444517,"about_ca_system_score_codex":0.00005533142,"about_ca_system_score_gemma":0.000023124889,"threshold_uncertainty_score":0.94544005},"labels":[],"label_agreement":null},{"id":"W4386017381","doi":"","title":"Stratégie de renumérotation pour optimiser la granularité des calculs dans la résolution des systèmes linéaires creux","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Direction Générale de l’Armement; Université de Bordeaux","keywords":"Granularity; Computer science; Solver; Kernel (algebra); Block (permutation group theory); Sparse matrix; Parallel computing; Blocking (statistics); Computation; Algorithm; Theoretical computer science; Mathematics","score_opus":0.013655432531880807,"score_gpt":0.23317997513673563,"score_spread":0.21952454260485482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386017381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040263955,0.00034780332,0.9378301,0.0021734405,0.00004221531,0.00019113498,0.000008314709,0.0010433194,0.01809971],"genre_scores_gemma":[0.55518746,0.00033678545,0.4422431,0.000030804447,0.000012221732,0.00003146617,0.0000138288815,0.00001907907,0.0021252155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99374485,0.0045335903,0.000412806,0.00055298756,0.00032667074,0.00042911764],"domain_scores_gemma":[0.9955647,0.0016597862,0.00026903304,0.0010906941,0.0012235639,0.00019221609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041937064,0.00024415276,0.00022307584,0.00018678521,0.0006650631,0.00053959084,0.0012642667,0.00018707679,0.00002038143],"category_scores_gemma":[0.001392506,0.00021314059,0.0001319634,0.00052017614,0.00048531897,0.00063964067,0.0003616401,0.00017850072,0.00002157636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026341775,0.000892709,0.012188685,0.0001543984,0.00009235473,0.000032089378,0.020813286,0.003044274,0.043820538,0.6622707,0.0028036104,0.25386098],"study_design_scores_gemma":[0.0017891595,0.000005803553,0.046310354,0.003469771,0.000051166244,0.00020122636,0.00026510458,0.5204389,0.28116024,0.14125738,0.0039258767,0.0011250315],"about_ca_topic_score_codex":0.0005721003,"about_ca_topic_score_gemma":0.00042259658,"teacher_disagreement_score":0.5210134,"about_ca_system_score_codex":0.00021013655,"about_ca_system_score_gemma":0.0002982296,"threshold_uncertainty_score":0.86916214},"labels":[],"label_agreement":null},{"id":"W4386568643","doi":"10.1145/3609109","title":"Let Coarse-Grained Resources Be Shared: Mapping Entire Neural Networks on FPGAs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Field-programmable gate array; Computer science; Compiler; High-level synthesis; Artificial neural network; Computer architecture; Coding (social sciences); Shared resource; Embedded system; Gate array; Parallel computing; Computer hardware; Artificial intelligence; Programming language; Operating system","score_opus":0.03840996088504043,"score_gpt":0.2739662414432465,"score_spread":0.23555628055820607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386568643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012274985,0.000080386664,0.97676444,0.0017165819,0.0020774123,0.0005299214,0.000011130439,0.005734708,0.0008104272],"genre_scores_gemma":[0.9718304,0.000020853171,0.026172983,0.0006951079,0.00029365462,0.000048024285,0.000029585623,0.000059035996,0.00085030805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624276,0.00046309314,0.0007723631,0.0010182578,0.0006809363,0.0008225857],"domain_scores_gemma":[0.99677193,0.0008336458,0.00032785244,0.001700792,0.00016353943,0.00020221798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009798021,0.00045291253,0.0005008969,0.0007826252,0.0010876694,0.0007861648,0.0021223193,0.00022687786,0.000008105193],"category_scores_gemma":[0.000080819205,0.00045902745,0.00025954685,0.002221456,0.00006750209,0.0002749084,0.00010531694,0.000640808,0.00007269927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012693026,0.00006927569,0.000016389804,0.000034386212,0.000055955,0.000031225118,0.002385125,0.9678537,0.000025448535,0.00051401433,0.0049681086,0.02403366],"study_design_scores_gemma":[0.00047580613,0.00020059063,0.00007675707,0.0003243431,0.000011272259,0.000043656095,0.00041114018,0.9941417,0.000075787815,0.00010968061,0.0036785295,0.00045075984],"about_ca_topic_score_codex":0.000079213976,"about_ca_topic_score_gemma":0.0000030475412,"teacher_disagreement_score":0.95955545,"about_ca_system_score_codex":0.00012441352,"about_ca_system_score_gemma":0.00003720467,"threshold_uncertainty_score":0.99978614},"labels":[],"label_agreement":null},{"id":"W4386629830","doi":"10.1002/spe.3261","title":"Transcoding unicode characters with AVX‐512 instructions","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transcoding; JavaScript; Unicode; Parallel computing; Set (abstract data type); Programming language; Operating system; Artificial intelligence","score_opus":0.019453521533190816,"score_gpt":0.28394922999200695,"score_spread":0.26449570845881615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386629830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058667418,0.00007019651,0.9359766,0.002657917,0.00017698544,0.00011166338,0.0000010215205,0.0018023812,0.0005357762],"genre_scores_gemma":[0.6242959,0.0004932426,0.37406605,0.0008155137,0.000035791614,0.00005076347,0.000003914703,0.000012302421,0.00022651316],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989764,0.000057767214,0.00014542618,0.00036455158,0.00020631257,0.00024954477],"domain_scores_gemma":[0.9991428,0.00025184834,0.00009292717,0.00032607836,0.00009345122,0.00009289259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020665998,0.00012029878,0.00010838485,0.00012987971,0.0003907193,0.00024027882,0.00036683568,0.000044921613,0.000003202571],"category_scores_gemma":[0.00022795364,0.00010538075,0.000021002656,0.0008452446,0.000090148416,0.0019126784,0.000112433474,0.00015146735,0.000019419593],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028419765,0.00043490648,0.01485918,0.00019321096,0.00020853957,0.00062407064,0.27079782,0.010564471,0.0028793358,0.12784311,0.0051907916,0.5661204],"study_design_scores_gemma":[0.005067345,0.0023918166,0.03201038,0.0011758239,0.00018597266,0.005083809,0.040922057,0.3206822,0.028175293,0.010450688,0.5476583,0.006196291],"about_ca_topic_score_codex":0.00002990839,"about_ca_topic_score_gemma":0.0000019426773,"teacher_disagreement_score":0.56562847,"about_ca_system_score_codex":0.000016597667,"about_ca_system_score_gemma":0.00005418792,"threshold_uncertainty_score":0.42973024},"labels":[],"label_agreement":null},{"id":"W4386646164","doi":"10.1145/3594671.3594673","title":"Threaded Execution as a Dual to Native Code","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Interpreter; Computer science; Byte; Programming language; Code (set theory); Dual (grammatical number); Software; Operating system; Source code; Parallel computing; Embedded system","score_opus":0.03312559556914035,"score_gpt":0.31258478016258207,"score_spread":0.2794591845934417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386646164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054040668,0.0000038602834,0.95835215,0.0032898425,0.00011550021,0.00012404984,7.528047e-7,0.0027003554,0.030009449],"genre_scores_gemma":[0.6628475,0.000011980794,0.32228506,0.0023078083,0.00005608044,0.00003812457,0.0000073244864,0.000009548633,0.012436591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992688,0.000034533252,0.00010820275,0.00024197747,0.00017622678,0.00017030064],"domain_scores_gemma":[0.9995382,0.000055314937,0.000025055442,0.00023390863,0.00007949909,0.00006803996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021741357,0.00006906814,0.000072930976,0.00016830994,0.00009522715,0.00008726395,0.00032067666,0.00003253891,0.000013816004],"category_scores_gemma":[0.00007071985,0.00006192479,0.000025248963,0.00093873934,0.000011049077,0.00014954185,0.0002444882,0.00004888965,0.0007318726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009105459,0.000052063035,0.0001028667,0.0000053126223,0.000017784823,0.000033942797,0.003952894,0.02177363,0.0009575795,0.7200322,0.23447485,0.018587772],"study_design_scores_gemma":[0.00026413717,0.0002600069,0.001492732,0.000027150263,0.0000022354668,0.000019092953,0.00010728651,0.8987245,0.036493246,0.045092613,0.017154558,0.00036246225],"about_ca_topic_score_codex":0.000023758339,"about_ca_topic_score_gemma":0.0000038312974,"teacher_disagreement_score":0.87695086,"about_ca_system_score_codex":0.000023858245,"about_ca_system_score_gemma":0.000035434034,"threshold_uncertainty_score":0.9406986},"labels":[],"label_agreement":null},{"id":"W4386715942","doi":"10.18280/isi.280415","title":"Accelerating Code Assembly: Exploiting Heterogeneous Computing Architectures for Optimization","year":2023,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Code (set theory); Computer architecture; Distributed computing; Computational science; Programming language","score_opus":0.034696370112750126,"score_gpt":0.2752774360204542,"score_spread":0.24058106590770406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386715942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04443295,0.000023358274,0.9504818,0.000093266746,0.00026949588,0.00049676176,0.000009082969,0.0029584663,0.0012348498],"genre_scores_gemma":[0.61410546,0.0000063013676,0.3854183,0.0002081188,0.00007883893,0.000059515445,0.00009421753,0.000014695041,0.000014550773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819213,0.00008469706,0.00070695404,0.00025635908,0.0002787794,0.0004810763],"domain_scores_gemma":[0.9985004,0.00028570666,0.00044375722,0.00032957637,0.00035915073,0.000081403276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008358408,0.00022079551,0.00023004565,0.00049685425,0.0008465071,0.00087696617,0.00060456153,0.000109510154,0.0000023906523],"category_scores_gemma":[0.00050108385,0.00023076113,0.000101432575,0.0009206152,0.000041337367,0.0010813308,0.0002636991,0.00012130705,0.000021543317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049984974,0.0000057431157,0.000086166256,0.00010172327,0.000013103401,0.0000010026874,0.0030037432,0.9249457,0.000047786936,0.0017754021,0.0003066933,0.06970793],"study_design_scores_gemma":[0.00026077422,0.00007284747,0.00012420405,0.00012001196,0.000004340786,0.00002873953,0.00013752733,0.9933681,0.0031546997,0.0021998577,0.00026667066,0.00026222743],"about_ca_topic_score_codex":0.000011487283,"about_ca_topic_score_gemma":0.0000016597924,"teacher_disagreement_score":0.5696725,"about_ca_system_score_codex":0.0001281045,"about_ca_system_score_gemma":0.00007037121,"threshold_uncertainty_score":0.9410166},"labels":[],"label_agreement":null},{"id":"W4386803560","doi":"10.1002/spe.3262","title":"High‐performance extended actors","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Concurrency; Debugging; Robustness (evolution); Distributed computing; Shared memory; TRACE (psycholinguistics); Decoupling (probability); Ask price; Parallel computing; Operating system","score_opus":0.01786703427267446,"score_gpt":0.29321950444199985,"score_spread":0.2753524701693254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386803560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21738227,0.00014004245,0.7773836,0.0011977374,0.00039651137,0.000113327114,6.7682697e-7,0.0028411131,0.0005447158],"genre_scores_gemma":[0.74431014,0.00066808966,0.2540167,0.0006812856,0.00003521255,0.000031732896,0.0000022492884,0.0000075852827,0.00024702016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989057,0.000054576885,0.00016219531,0.00036967284,0.00023427434,0.0002735586],"domain_scores_gemma":[0.99900275,0.00031855007,0.00009840166,0.00039402995,0.00009826577,0.00008801329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029369805,0.00011958748,0.00011069533,0.00010853661,0.0002889395,0.00020125754,0.00048804306,0.00005377312,0.0000064212245],"category_scores_gemma":[0.00063173595,0.00011073487,0.000018591914,0.0007362447,0.00006329856,0.0018570689,0.00033236836,0.00012620547,0.00008498678],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086868175,0.00025004355,0.0069522215,0.00010364372,0.00005281223,0.0001954074,0.045792095,0.0044878125,0.0009552384,0.0357518,0.015495898,0.8898761],"study_design_scores_gemma":[0.0024778794,0.0018431487,0.08804789,0.00043805898,0.000056348592,0.0009044888,0.0065579927,0.50264955,0.074270666,0.01673071,0.30170372,0.0043195584],"about_ca_topic_score_codex":0.000026706071,"about_ca_topic_score_gemma":2.5968737e-7,"teacher_disagreement_score":0.8855566,"about_ca_system_score_codex":0.000014977067,"about_ca_system_score_gemma":0.000038992202,"threshold_uncertainty_score":0.4515637},"labels":[],"label_agreement":null},{"id":"W4386896826","doi":"10.1145/3625004","title":"Advancing Direct Convolution Using Convolution Slicing Optimization and ISA Extensions","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Parallel computing; Kernel (algebra); Kernelization; Speedup; x86; Convolution (computer science); Algorithm; Computational science; Artificial intelligence; Parameterized complexity; Programming language; Mathematics; Artificial neural network","score_opus":0.01661212601399944,"score_gpt":0.26203843607437394,"score_spread":0.2454263100603745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386896826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00256437,0.0001388088,0.9940436,0.0012134829,0.00020801218,0.00036001953,0.000014220729,0.0012906812,0.0001667888],"genre_scores_gemma":[0.26403442,0.0009924632,0.7343834,0.00033813142,0.0000386555,0.000027382794,0.000041730484,0.000032776403,0.00011099837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823266,0.00017355269,0.0003466042,0.0006301573,0.00025068523,0.00036631562],"domain_scores_gemma":[0.9987949,0.0002472565,0.00015078386,0.0005124119,0.00015356173,0.00014107392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000359041,0.00026595636,0.00025084498,0.0006374595,0.0009230903,0.00018459825,0.00026611425,0.00015312027,0.000010318095],"category_scores_gemma":[0.00010833705,0.00027156845,0.000060475355,0.001174748,0.000087082466,0.00051135494,0.000054807766,0.00024913394,0.0000029366217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001500534,0.000027131204,0.000027992826,0.000017813916,0.00001751313,0.0000022986633,0.0004556957,0.9815782,0.0003928407,0.00021303855,0.000041123574,0.017211404],"study_design_scores_gemma":[0.00039566532,0.00010724616,0.00009918762,0.00010737464,0.000036100522,0.00004898409,0.000055660585,0.997313,0.00067634566,0.00070753944,0.00016191014,0.0002909571],"about_ca_topic_score_codex":0.000035944402,"about_ca_topic_score_gemma":0.00001712554,"teacher_disagreement_score":0.26147005,"about_ca_system_score_codex":0.00007265399,"about_ca_system_score_gemma":0.0000580138,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W4387585496","doi":"10.51219/jaimld/sebastian-ifeanyi-obeta/01","title":"A Comparative study of Long Short-Term Memory and Gated Recurrent Unit","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Machine Learning and Data Science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Term (time); Unit (ring theory); Short-term memory; Computer science; Psychology; Neuroscience; Working memory; Physics; Cognition; Mathematics education","score_opus":0.13918869722361504,"score_gpt":0.41248768822966025,"score_spread":0.2732989910060452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387585496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68216467,0.00019226343,0.31718546,0.000100593374,0.00014398564,0.00009527709,0.0000021482967,0.000062948435,0.000052662315],"genre_scores_gemma":[0.989449,0.00024451665,0.010252224,0.00000728737,0.00002773878,4.509321e-7,0.0000029938187,0.0000033888189,0.000012358311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981445,0.00019021117,0.00057836465,0.00037387593,0.00050639355,0.00020664492],"domain_scores_gemma":[0.99859166,0.00023440376,0.00035560457,0.00034829116,0.0003395717,0.00013045475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032176415,0.00011868854,0.0002924057,0.0005322998,0.00037079383,0.00026728393,0.0013598073,0.000024459656,0.0000030622741],"category_scores_gemma":[0.0004234166,0.00009562397,0.000018449568,0.0016160619,0.00033928143,0.0009205031,0.001086111,0.00035629826,0.0000021382796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014301132,0.0007718207,0.05449467,0.00005517648,0.00006784703,0.00015395433,0.027269289,0.070498094,0.0047639906,0.0021526425,0.0001146806,0.8395148],"study_design_scores_gemma":[0.000044643144,0.00096467,0.0058638607,0.000078147576,0.000011844148,0.00006349959,0.0017886878,0.9870943,0.0035981196,0.00033985393,0.00002918946,0.00012323038],"about_ca_topic_score_codex":0.000040730774,"about_ca_topic_score_gemma":0.00002699473,"teacher_disagreement_score":0.9165962,"about_ca_system_score_codex":0.000011276865,"about_ca_system_score_gemma":0.00010746571,"threshold_uncertainty_score":0.3899432},"labels":[],"label_agreement":null},{"id":"W4387591607","doi":"10.1145/3610396.3618090","title":"Disintegrating Manycores","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liberian dollar; Slowdown; Core (optical fiber); Computer science; Business; Economics; Telecommunications","score_opus":0.021445839690918667,"score_gpt":0.27637366214880577,"score_spread":0.2549278224578871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387591607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015736026,0.000006674409,0.9643176,0.00078254624,0.00008319981,0.000028347293,9.539441e-8,0.0036003082,0.029607583],"genre_scores_gemma":[0.47816038,0.000012795113,0.51578003,0.00034048106,0.000029499402,0.000005784223,0.000003107732,0.000004582707,0.0056633395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955744,0.000015694004,0.00008061643,0.00013754508,0.000087753666,0.00012094274],"domain_scores_gemma":[0.9996744,0.00004465252,0.000017981327,0.00021321261,0.000023844977,0.000025926465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014454621,0.000043897726,0.000043958324,0.000086090215,0.0000770413,0.00009511001,0.00037980944,0.000016294574,0.000007464876],"category_scores_gemma":[0.000031375468,0.000034456094,0.000022328064,0.0005118749,0.000007972852,0.00013055484,0.00015681528,0.000036121062,0.00031917615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1901486e-7,0.000013667553,0.0011980806,0.0000048561296,0.000005274469,0.000015198835,0.0004032846,0.005352861,0.0002803788,0.78615534,0.1270652,0.07950535],"study_design_scores_gemma":[0.00003205037,0.000012621743,0.0013179166,0.000006232111,2.6737092e-7,0.0000026056543,0.000012259588,0.98089486,0.0015985465,0.012907692,0.0031413224,0.000073631476],"about_ca_topic_score_codex":0.0000074240947,"about_ca_topic_score_gemma":0.000001030488,"teacher_disagreement_score":0.975542,"about_ca_system_score_codex":0.000005357767,"about_ca_system_score_gemma":0.000009434864,"threshold_uncertainty_score":0.41024703},"labels":[],"label_agreement":null},{"id":"W4387647276","doi":"10.1145/3623759.3624553","title":"CHERI-picking","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dram; Computer science; Random access memory; Scaling; Memory management; Cost reduction; Embedded system; Reliability engineering; Operating system; Computer hardware; Engineering; Overlay; Business","score_opus":0.029194841350746716,"score_gpt":0.2782146116674805,"score_spread":0.2490197703167338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387647276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010759016,0.000006422004,0.95539457,0.00081326556,0.00009216404,0.000024634695,3.234073e-8,0.0037708243,0.038822215],"genre_scores_gemma":[0.5391564,0.000016872104,0.4537848,0.00057024945,0.000036416546,0.00000533051,0.0000011454904,0.0000049127966,0.006423917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996056,0.000012648882,0.000063533815,0.00012503561,0.000077802775,0.000115388415],"domain_scores_gemma":[0.9997125,0.00002413435,0.000014591662,0.00020412615,0.000020333206,0.000024311677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014648733,0.000036341185,0.00003917038,0.00006934212,0.00005732732,0.00006990233,0.00035857837,0.000018104758,0.000012209961],"category_scores_gemma":[0.000015892667,0.000032132484,0.00001810685,0.0005283044,0.0000059244553,0.000113684284,0.00016249962,0.00003070033,0.00029054107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.1743614e-7,0.00002809629,0.0025797875,0.000010269474,0.000012564707,0.000029681316,0.0010049826,0.015835475,0.0007227577,0.6494595,0.17637509,0.15394108],"study_design_scores_gemma":[0.00005815856,0.0000141410055,0.0024161863,0.000005200158,3.3631568e-7,0.0000030243248,0.0000063803172,0.97075987,0.0033742348,0.0071275495,0.016128596,0.00010629481],"about_ca_topic_score_codex":0.000005097344,"about_ca_topic_score_gemma":3.3292818e-7,"teacher_disagreement_score":0.9549244,"about_ca_system_score_codex":0.0000059074987,"about_ca_system_score_gemma":0.00001104451,"threshold_uncertainty_score":0.37344146},"labels":[],"label_agreement":null},{"id":"W4387747846","doi":"10.1016/j.cpc.2023.108961","title":"pARTn: A plugin implementation of the Activation Relaxation Technique nouveau that takes over the FIRE minimisation algorithm","year":2023,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plug-in; Computer science; Fortran; Interfacing; Interface (matter); Software; Algorithm; Application programming interface; Interoperability; Computational science; Programming language; Parallel computing; Operating system; Computer hardware","score_opus":0.04651703488651383,"score_gpt":0.31634746157138305,"score_spread":0.26983042668486923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387747846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002085114,0.000021438022,0.9908318,0.005413671,0.00015385245,0.0007647305,0.000008825186,0.0005202096,0.00020036241],"genre_scores_gemma":[0.55946237,0.00010237513,0.4394453,0.0003968777,0.000097392105,0.00031140118,0.00012297038,0.000019422641,0.00004189019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984294,0.00040359638,0.00036707666,0.00025675946,0.00035214878,0.00019100563],"domain_scores_gemma":[0.9964281,0.0004188514,0.0005308099,0.002373899,0.00022022278,0.000028116792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005101608,0.0001604894,0.00014750671,0.00008293121,0.0007076474,0.00014685553,0.0023465804,0.000068760884,0.000002571773],"category_scores_gemma":[0.000017739489,0.00011921098,0.00012229431,0.0014896519,0.00014043541,0.0005373935,0.00091527024,0.0002430517,0.000008178073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002836186,0.00024352866,0.002417959,0.000038088278,0.00010121856,2.416643e-7,0.011458996,0.021011792,0.0015023856,0.12010427,0.02723743,0.81588125],"study_design_scores_gemma":[0.00016650019,0.000027960281,0.025812166,0.00005623029,0.000010717064,0.0000015029507,0.00010955194,0.95453525,0.006432035,0.010152049,0.0025512576,0.00014476803],"about_ca_topic_score_codex":0.00009842147,"about_ca_topic_score_gemma":0.000008692339,"teacher_disagreement_score":0.9335235,"about_ca_system_score_codex":0.000076430566,"about_ca_system_score_gemma":0.00011424368,"threshold_uncertainty_score":0.5442723},"labels":[],"label_agreement":null},{"id":"W4387793429","doi":"10.1145/3623476.3623529","title":"An Executable Semantics for Faster Development of Optimizing Python Compilers","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Python (programming language); Programming language; Executable; Computer science; Compiler; Implementation; Semantics (computer science); Operational semantics","score_opus":0.041342045742679356,"score_gpt":0.30362468228401895,"score_spread":0.2622826365413396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387793429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004971023,0.000005372351,0.99254596,0.0001377392,0.00010664905,0.00016262698,7.393148e-7,0.0009564867,0.0011134183],"genre_scores_gemma":[0.14433292,0.0000036986755,0.85507756,0.00008388019,0.000011438998,0.000013008415,0.00001015094,0.000008524049,0.00045885265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991439,0.000021440037,0.00025377594,0.0002270116,0.00013933785,0.00021453542],"domain_scores_gemma":[0.99940467,0.000059818285,0.00007728027,0.00029610505,0.00011082093,0.000051335457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003850647,0.00008710816,0.00013824565,0.00015812683,0.00012151306,0.000070899776,0.00050059846,0.000039203,0.000003310923],"category_scores_gemma":[0.000010306247,0.000081015605,0.000033405548,0.00037880542,0.00001485635,0.00022203723,0.00014481622,0.00003352564,0.000008798234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028207376,0.0003087264,0.0009561004,0.00026396633,0.000084639316,0.0000055501887,0.012195707,0.78106403,0.014423969,0.056682304,0.02887461,0.105112195],"study_design_scores_gemma":[0.00014236942,0.000049281953,0.00012340129,0.000020680935,0.000001502108,9.2873785e-7,0.000067911635,0.95182043,0.045046378,0.00041025525,0.0021972477,0.000119632314],"about_ca_topic_score_codex":0.0000021177984,"about_ca_topic_score_gemma":0.0000010425199,"teacher_disagreement_score":0.17075638,"about_ca_system_score_codex":0.000014838832,"about_ca_system_score_gemma":0.000060182094,"threshold_uncertainty_score":0.33037204},"labels":[],"label_agreement":null},{"id":"W4387956577","doi":"10.18280/mmep.100515","title":"Enhanced π Approximation Through MIMD Parallel Computing: An Efficiency Analysis Utilizing Raspberry Pi","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"MIMD; Parallel computing; Raspberry pi; Computer science; Embedded system; Internet of Things","score_opus":0.03981390683871789,"score_gpt":0.2619542138397409,"score_spread":0.222140307001023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387956577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021717323,0.000080140286,0.9748536,0.00008006393,0.00005232387,0.00019868827,5.823407e-7,0.0024284972,0.00058877876],"genre_scores_gemma":[0.5442726,0.000034538174,0.45559585,0.000014956936,0.000017371369,0.00001414947,0.000008411724,0.000014086132,0.000028064898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823976,0.00004004939,0.00046277058,0.0005311506,0.00028613443,0.00044013665],"domain_scores_gemma":[0.9990917,0.00017574392,0.00009611229,0.00045008652,0.0000668173,0.00011958203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006869348,0.00023803215,0.0003731869,0.00031545825,0.00019975138,0.0002680903,0.0004382772,0.00010809563,0.0000026132286],"category_scores_gemma":[0.000041769636,0.00022425897,0.00009836125,0.0015211455,0.000029061752,0.00036476212,0.00016725594,0.00018710144,0.000017180995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2030954e-7,0.00004249606,0.0000033007198,0.00013592574,0.00003875735,0.0000010801833,0.0023201175,0.9389241,0.00013417288,0.05783408,0.000007862448,0.00055730226],"study_design_scores_gemma":[0.00012427465,0.000039569073,0.00000973895,0.00009822389,0.000034646866,0.000003752127,0.000026499509,0.9705478,0.00031609822,0.028512964,0.000019814555,0.0002666055],"about_ca_topic_score_codex":0.000007874656,"about_ca_topic_score_gemma":1.564727e-7,"teacher_disagreement_score":0.52255523,"about_ca_system_score_codex":0.000021848115,"about_ca_system_score_gemma":0.000012931915,"threshold_uncertainty_score":0.91450155},"labels":[],"label_agreement":null},{"id":"W4388031372","doi":"10.1145/3581784.3607103","title":"Embracing Irregular Parallelism in HPC with YGM","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Laboratory Directed Research and Development; Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Computer science; Serialization; Asynchronous communication; Latency (audio); Implementation; Suite; Message passing; Parallel computing; Distributed computing; USable; Computer architecture; Computer network; Operating system; Programming language","score_opus":0.01445443690114672,"score_gpt":0.24737080567814096,"score_spread":0.23291636877699423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388031372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008343996,0.000021000242,0.9529803,0.0013401092,0.000072649455,0.00010051099,1.0402655e-7,0.0019781545,0.035163198],"genre_scores_gemma":[0.68312305,0.000016807564,0.31303635,0.0004670358,0.000033303175,0.000019030836,0.000003040354,0.000010825483,0.0032905703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991331,0.000038703976,0.00014341484,0.00027799825,0.00016716754,0.00023962518],"domain_scores_gemma":[0.9994914,0.00004586161,0.00003401721,0.00035223083,0.0000323065,0.000044208096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027627117,0.00008977727,0.00010881487,0.0002293236,0.00006226592,0.000098054654,0.0004711348,0.00003803184,0.000006498826],"category_scores_gemma":[0.000013790739,0.00007154743,0.000020490397,0.0010618145,0.000017003795,0.00023927161,0.0001694228,0.00008359442,0.000082570674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022474853,0.00010755046,0.00322936,0.000037931586,0.000024559256,0.0002897911,0.0027273272,0.44033995,0.00035664192,0.4951481,0.028032381,0.029683936],"study_design_scores_gemma":[0.0003276127,0.000057886708,0.0062394985,0.00004480088,9.718414e-7,0.000014313452,0.00003003878,0.97485656,0.0013574116,0.014412424,0.0024164086,0.00024209684],"about_ca_topic_score_codex":0.000040506835,"about_ca_topic_score_gemma":0.00001590447,"teacher_disagreement_score":0.67477906,"about_ca_system_score_codex":0.000016926922,"about_ca_system_score_gemma":0.000032437834,"threshold_uncertainty_score":0.29176196},"labels":[],"label_agreement":null},{"id":"W4388157903","doi":"10.21203/rs.3.rs-3487536/v1","title":"PFP-FM: An Accelerated FM-index","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Index (typography); Modulation index; Frequency modulation; Computer science; Physics; Radio frequency; Telecommunications; Pulse-width modulation; Voltage; Quantum mechanics","score_opus":0.2224744134035453,"score_gpt":0.4571075170564701,"score_spread":0.23463310365292483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388157903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006684986,0.00021587951,0.97983557,0.002056911,0.0006325662,0.0010967063,0.000027533555,0.005320246,0.0041295737],"genre_scores_gemma":[0.9332824,0.00034849407,0.062125586,0.000105069455,0.00048108853,0.00014208045,0.00023039743,0.00009659779,0.003188298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944019,0.0011086583,0.0004481608,0.0014076973,0.0016499993,0.0009835851],"domain_scores_gemma":[0.99534833,0.00032920315,0.00013695123,0.0024508885,0.0013668586,0.00036774256],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032189777,0.0003311697,0.00039212013,0.0011065018,0.0005078508,0.0016373105,0.004347466,0.00052367186,0.000048971648],"category_scores_gemma":[0.00039924402,0.00032886674,0.00014472219,0.0017257021,0.00012179708,0.00036615206,0.006070371,0.0021983387,0.00039815134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001550149,0.0012843367,0.012495739,0.0027879798,0.00040354457,0.0014132606,0.0077840276,0.37470973,0.0006856515,0.05432099,0.28723383,0.25672588],"study_design_scores_gemma":[0.0001833116,0.00020392101,0.0034579413,0.0003076382,0.0000021469912,0.000004882852,0.000046150715,0.9553645,0.0011057238,0.0365308,0.002333962,0.00045902227],"about_ca_topic_score_codex":0.00058008253,"about_ca_topic_score_gemma":0.000045798683,"teacher_disagreement_score":0.9265974,"about_ca_system_score_codex":0.00023699553,"about_ca_system_score_gemma":0.0006241619,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W4388363676","doi":"10.1016/j.ibneur.2023.08.1357","title":"SMALL SCALE HETEROGENEITY OF MUA ENABLES HIGH ACCURACY MOVEMENT DECODING","year":2023,"lang":"en","type":"article","venue":"IBRO Neuroscience Reports","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Scale (ratio); Decoding methods; Movement (music); Computer science; Artificial intelligence; Algorithm; Geography; Cartography; Physics","score_opus":0.04670617387995377,"score_gpt":0.2865292511277269,"score_spread":0.23982307724777316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388363676","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5927121,0.000018634508,0.40493315,0.00022583,0.000706173,0.00016766961,0.0000011743358,0.0008170734,0.00041819093],"genre_scores_gemma":[0.9524629,0.000069102214,0.04687549,0.00037294635,0.000023206127,0.0000149340785,0.0000016296226,0.0000093470335,0.00017044196],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978482,0.00006922263,0.00052879815,0.0006809929,0.00046631586,0.0004064582],"domain_scores_gemma":[0.99837285,0.00010788335,0.00042216704,0.0008658545,0.00011024658,0.00012100682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718447,0.00014913894,0.00020312455,0.00025038674,0.00022713341,0.00017348869,0.0007866438,0.00004439848,0.0000019856718],"category_scores_gemma":[0.00038253004,0.00014046744,0.00008226629,0.0013846598,0.0001005652,0.00041716988,0.0007060444,0.00008559758,0.000004083459],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001161219,0.0005267726,0.08033785,0.0001996701,0.000014566831,0.001882356,0.0011351055,0.2076758,0.63167524,0.008219234,0.0050075664,0.06331422],"study_design_scores_gemma":[0.0001223605,0.00015261171,0.031241167,0.00007663822,0.000004765141,0.0001985949,0.00001021675,0.27405187,0.6840022,0.008477403,0.0012756631,0.00038647125],"about_ca_topic_score_codex":0.00007146377,"about_ca_topic_score_gemma":0.0000054762922,"teacher_disagreement_score":0.35975078,"about_ca_system_score_codex":0.00002698788,"about_ca_system_score_gemma":0.00010915355,"threshold_uncertainty_score":0.5728096},"labels":[],"label_agreement":null},{"id":"W4388429207","doi":"10.1007/978-3-031-46077-7","title":"Embedded Computer Systems: Architectures, Modeling, and Simulation","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Ioannina; National Technical University of Athens; University of California, Irvine; Universidade de Lisboa; Universität Rostock; Trakya Üniversitesi; Universidad Politécnica de Madrid; Shanghai Jiao Tong University; University of Cyprus; Technische Universität Dresden; Eidgenössische Technische Hochschule Zürich; Leibniz-Gemeinschaft; Chalmers Tekniska Högskola; Technische Universiteit Delft; Universiteit van Amsterdam; University of California, San Diego; Universiteit Leiden; Queen's University Belfast; Indian National Science Academy; Università degli Studi di Cagliari; Universidade Federal do Rio Grande do Sul; Queen's University; University of Patras; Aristotle University of Thessaloniki; Universidad de Málaga","keywords":"Computer science; Computer architecture; Software engineering","score_opus":0.021853891879584794,"score_gpt":0.27724444796093745,"score_spread":0.25539055608135264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388429207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000104084116,0.00053832016,0.99439245,0.00017935317,0.0023932043,0.0006096909,0.000004846729,0.0014271666,0.00035085992],"genre_scores_gemma":[0.0865906,0.00006794404,0.90973526,0.0008427667,0.0016116033,0.000028610524,0.000025527921,0.00009040731,0.0010072906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542254,0.00015245099,0.00073484756,0.0018879347,0.0010259879,0.0007762422],"domain_scores_gemma":[0.9969658,0.00080650515,0.00032272007,0.001357582,0.00033331572,0.00021406035],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012705319,0.0006231237,0.0006911253,0.001475715,0.00037739825,0.0012287198,0.002604009,0.0004363481,0.0000012158073],"category_scores_gemma":[0.00011536887,0.00058503903,0.00010575251,0.0013321906,0.00035077517,0.0003268263,0.0019200016,0.00087359117,0.000022462917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002565368,0.000012917141,0.0000081233775,0.00006670498,0.000008475653,0.000027963586,0.00058576395,0.9063475,0.0000020495681,0.0006437143,0.00016203207,0.09213219],"study_design_scores_gemma":[0.00020544083,0.000119692166,0.00001367942,0.00051544845,0.0000063039156,0.000040635437,1.1701103e-7,0.9665239,0.000016542577,0.031706396,0.00023786897,0.00061401946],"about_ca_topic_score_codex":0.000031512438,"about_ca_topic_score_gemma":0.000014204889,"teacher_disagreement_score":0.09151817,"about_ca_system_score_codex":0.00031872332,"about_ca_system_score_gemma":0.0007012235,"threshold_uncertainty_score":0.9998081},"labels":[],"label_agreement":null},{"id":"W4388483751","doi":"10.1109/sbac-padw60351.2023.00016","title":"DASS: Dynamic Adaptive Sub-Target Specialization","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Computer science; Software portability; Compiler; Speedup; Code (set theory); Just-in-time compilation; Parallel computing; Microprocessor; Compile time; Computer architecture; Microarchitecture; Code generation; Programming language; Embedded system; Operating system; Key (lock)","score_opus":0.018165988545008848,"score_gpt":0.2641489645303808,"score_spread":0.24598297598537194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388483751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006221254,0.000015994807,0.9788764,0.0004880153,0.00020680416,0.000094022216,8.2149523e-7,0.002897432,0.016798386],"genre_scores_gemma":[0.48972425,0.00008537574,0.506216,0.0004006101,0.00006630019,0.000014057602,0.000028423203,0.0000145309305,0.0034504626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991975,0.000046611727,0.00014182272,0.00025838744,0.00017093196,0.0001847725],"domain_scores_gemma":[0.9995063,0.000043308617,0.000048583657,0.00028191914,0.00007599633,0.000043877404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020952652,0.00008391176,0.00008692532,0.00018019121,0.00010762033,0.00009860688,0.00043903728,0.0000428977,0.00001744977],"category_scores_gemma":[0.000029227349,0.00007939875,0.00003311885,0.0009786045,0.000016740862,0.0002616569,0.00018578682,0.00005074943,0.0002914686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008717443,0.00008762986,0.00073915813,0.000013400258,0.00003364726,0.000036188198,0.001100825,0.13176884,0.00086113956,0.6785032,0.14448285,0.042364426],"study_design_scores_gemma":[0.000069053225,0.000029799177,0.0011848215,0.0000060513416,7.60969e-7,0.0000017920778,0.000009737787,0.97911066,0.0019516238,0.015378501,0.0021434166,0.000113813825],"about_ca_topic_score_codex":0.0000069057114,"about_ca_topic_score_gemma":0.00000420261,"teacher_disagreement_score":0.8473418,"about_ca_system_score_codex":0.000033621553,"about_ca_system_score_gemma":0.00003523269,"threshold_uncertainty_score":0.37463367},"labels":[],"label_agreement":null},{"id":"W4388581147","doi":"10.1145/3624062.3624605","title":"Specialized Kernels for Optimizing GPU Offload in OpenMP","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; CUDA; Compiler; Parallel computing; Software portability; Grid; General-purpose computing on graphics processing units; Programming language; Overhead (engineering); Programming paradigm; Computational science; Operating system; Graphics","score_opus":0.04442171553774023,"score_gpt":0.31427088733544917,"score_spread":0.26984917179770895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388581147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086668174,0.000016817445,0.97937155,0.0010467854,0.00020329704,0.00031299808,8.8330734e-7,0.001287979,0.016893001],"genre_scores_gemma":[0.039588545,0.00004843704,0.95542383,0.00045841897,0.00007578965,0.0000683525,0.0000067969454,0.000012252077,0.004317581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990075,0.00003746259,0.00023438096,0.00031527973,0.0001249799,0.00028036357],"domain_scores_gemma":[0.99941087,0.00013339923,0.000048356822,0.00030987352,0.000051391253,0.00004609035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005308662,0.000095749405,0.0001585211,0.00024552614,0.00007833813,0.00016040867,0.0007121194,0.00005051102,0.0000181122],"category_scores_gemma":[0.00007336111,0.000091019225,0.000055698547,0.00082144345,0.000013207758,0.0002535407,0.00027052488,0.0000580568,0.00007324287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004844173,0.00016135348,0.000929202,0.00005485762,0.000031849722,0.000047362562,0.0021640137,0.22686206,0.0010158495,0.47113854,0.2061918,0.09135467],"study_design_scores_gemma":[0.0005848514,0.000034890425,0.00033163486,0.000021955824,8.7346183e-7,0.0000017508373,0.000015922838,0.97411644,0.0033727488,0.007960338,0.013387443,0.00017116009],"about_ca_topic_score_codex":0.000029443849,"about_ca_topic_score_gemma":0.00000720281,"teacher_disagreement_score":0.7472544,"about_ca_system_score_codex":0.000029279914,"about_ca_system_score_gemma":0.000042915086,"threshold_uncertainty_score":0.37116563},"labels":[],"label_agreement":null},{"id":"W4388855584","doi":"10.1109/cluster52292.2023.00029","title":"A Dynamic Network-Native MPI Partitioned Aggregation Over InfiniBand Verbs","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Government of Ontario; Compute Canada; University of Toronto; Sandia National Laboratories; U.S. Department of Energy","keywords":"InfiniBand; Computer science; Message Passing Interface; Message passing; Overhead (engineering); Interface (matter); Parallel computing; Partition (number theory); Programming paradigm; Distributed computing; Operating system; Programming language","score_opus":0.01526626378073579,"score_gpt":0.27458582464938547,"score_spread":0.25931956086864966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388855584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062674894,0.000027020347,0.98332727,0.0007405299,0.0002127563,0.00012982634,9.558539e-7,0.0021821447,0.0071120253],"genre_scores_gemma":[0.86866176,0.00009633971,0.1274043,0.0006979091,0.000054627584,0.000036381483,0.00003480059,0.000011555467,0.003002294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990648,0.000063173815,0.00018101292,0.00026377293,0.00018995717,0.00023727852],"domain_scores_gemma":[0.99941057,0.00010151618,0.00007680274,0.00028398112,0.000076995835,0.000050163886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028292465,0.00009737392,0.00010275866,0.00011953969,0.00017043285,0.00012995052,0.00031826337,0.000053602067,0.000035124533],"category_scores_gemma":[0.00004049923,0.00009115597,0.00004227689,0.0010355592,0.000024652854,0.00034391636,0.00016685984,0.000075178636,0.00013533312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015853153,0.00007589642,0.0027790137,0.00001932328,0.000056972145,0.000025994881,0.001413142,0.5849606,0.00008043545,0.20352276,0.16396114,0.043088887],"study_design_scores_gemma":[0.00017868468,0.000036444766,0.0054636057,0.000020914835,0.0000017954814,0.0000018097059,0.0000043829273,0.9663424,0.00020828124,0.0253012,0.0023105722,0.00012992353],"about_ca_topic_score_codex":0.0000126670975,"about_ca_topic_score_gemma":0.000012584202,"teacher_disagreement_score":0.8623943,"about_ca_system_score_codex":0.000034745924,"about_ca_system_score_gemma":0.000034938796,"threshold_uncertainty_score":0.37172323},"labels":[],"label_agreement":null},{"id":"W4389099680","doi":"10.1007/978-3-031-47627-3_4","title":"Range Indexes on Non-Volatile Memory","year":2023,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Non-volatile memory; Range (aeronautics); Focus (optics); Computer science; Engineering; Computer hardware; Physics; Aerospace engineering","score_opus":0.02320386079100904,"score_gpt":0.2544242026036602,"score_spread":0.2312203418126512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389099680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001612307,0.000047975886,0.83090425,0.00029668372,0.0024578236,0.00045679198,0.0000035549622,0.0014385914,0.1642331],"genre_scores_gemma":[0.0555777,0.0004651372,0.7682344,0.0036747018,0.0018486764,0.00009922533,0.000012941258,0.000318174,0.1697691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952507,0.000033101987,0.0006943812,0.0018723803,0.0013507229,0.0007986972],"domain_scores_gemma":[0.9968783,0.00026561492,0.00036601172,0.0020240464,0.00022827092,0.00023770901],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016463109,0.0005946038,0.0006175214,0.0017038392,0.0003576033,0.0006556561,0.004817078,0.0003161201,0.000022496773],"category_scores_gemma":[0.00005269195,0.00061594887,0.00017606505,0.0009293829,0.0005217386,0.000630024,0.002524981,0.00088541914,0.0004712595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022195118,0.0001315709,0.00028653725,0.000143645,0.000041549996,0.0005663623,0.0015189067,0.06380437,0.00006273774,0.5697604,0.007443838,0.3562179],"study_design_scores_gemma":[0.00058272644,0.0003823771,0.0017442101,0.0012993217,0.000007365967,0.000027912327,8.469932e-7,0.9375138,0.0010400756,0.04863513,0.007118179,0.0016480326],"about_ca_topic_score_codex":0.000034989018,"about_ca_topic_score_gemma":0.000011213594,"teacher_disagreement_score":0.87370944,"about_ca_system_score_codex":0.00031293015,"about_ca_system_score_gemma":0.0005536927,"threshold_uncertainty_score":0.9996292},"labels":[],"label_agreement":null},{"id":"W4389491870","doi":"10.1145/3637187","title":"Session details: Session 3B: GPUs","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Computer architecture; World Wide Web","score_opus":0.026614199457226356,"score_gpt":0.29405822290558287,"score_spread":0.2674440234483565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389491870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005664414,0.000024260948,0.9726104,0.0010089091,0.00027249538,0.00007599344,2.0359317e-7,0.004421724,0.015921568],"genre_scores_gemma":[0.6144529,0.000091596696,0.37435293,0.0007024331,0.0000712467,0.000014178267,0.0000077227705,0.000013750322,0.01029323],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990671,0.00005865925,0.0001570914,0.0002865025,0.00020985618,0.00022078618],"domain_scores_gemma":[0.9993514,0.000068804904,0.000048311562,0.0004020639,0.000058280923,0.000071159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029540138,0.00009291515,0.00009582743,0.00016601312,0.00017049779,0.00013002961,0.0005700087,0.00005984618,0.00002865364],"category_scores_gemma":[0.00003873986,0.000072309274,0.000041869105,0.0008553478,0.000013107823,0.0003002587,0.00039802026,0.00008135454,0.0004463968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008569737,0.00013238129,0.003351068,0.000041868625,0.000018908899,0.00008180506,0.0009827457,0.025148368,0.004637788,0.0826409,0.47054482,0.4124108],"study_design_scores_gemma":[0.00014279214,0.000038376187,0.0015658739,0.000038711554,0.000001244165,0.0000074706195,0.000017452914,0.965874,0.013925362,0.0058568423,0.012349693,0.00018215689],"about_ca_topic_score_codex":0.000010365004,"about_ca_topic_score_gemma":8.754494e-7,"teacher_disagreement_score":0.9407257,"about_ca_system_score_codex":0.000017426866,"about_ca_system_score_gemma":0.000034837398,"threshold_uncertainty_score":0.57376766},"labels":[],"label_agreement":null},{"id":"W4390092823","doi":"10.48550/arxiv.2312.13064","title":"LPR: Large Language Models-Aided Program Reduction","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Government of Canada; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Programming language; JavaScript; Compiler; Reduction (mathematics); Debugging","score_opus":0.09144310366350977,"score_gpt":0.23065886276713765,"score_spread":0.13921575910362788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390092823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021682307,0.000053455486,0.968944,0.00012751562,0.000599519,0.0004626974,0.000010346858,0.005564336,0.0025558225],"genre_scores_gemma":[0.941327,0.00019056341,0.053011455,0.00003646118,0.00010057512,0.0000051636357,0.00005955967,0.000029402932,0.005239842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806595,0.00014549059,0.00020337135,0.0010749145,0.00011068309,0.00039961506],"domain_scores_gemma":[0.99822927,0.000032608405,0.00022798736,0.0012269465,0.00015879882,0.00012438331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034744808,0.00027418163,0.00027031515,0.00036556122,0.0001899765,0.00018911177,0.0015848076,0.00030142136,0.0000065042846],"category_scores_gemma":[0.000022029511,0.0003279449,0.00019261104,0.00081779744,0.00004809783,0.00038692955,0.002049294,0.00052180723,0.00008639701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008709003,0.00014691471,0.00005097661,0.00005040976,0.000049050803,0.00014583375,0.000622987,0.87815833,0.0000102548665,0.11573192,0.00306967,0.0019549353],"study_design_scores_gemma":[0.00020752467,0.00004125529,0.000047327947,0.00006978259,0.000020321182,0.000004557441,0.00007198725,0.9419275,0.00012700025,0.05687763,0.00026957403,0.0003355653],"about_ca_topic_score_codex":0.00013983576,"about_ca_topic_score_gemma":0.000013634149,"teacher_disagreement_score":0.91964465,"about_ca_system_score_codex":0.00015031362,"about_ca_system_score_gemma":0.00013154547,"threshold_uncertainty_score":0.99991727},"labels":[],"label_agreement":null},{"id":"W4390280267","doi":"10.1109/pact58117.2023.00005","title":"Welcome Message","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.023413848554037064,"score_gpt":0.27474476988767493,"score_spread":0.2513309213336379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390280267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003643876,0.000006723846,0.9027121,0.0013085817,0.0001490267,0.000029488214,9.2271954e-8,0.0041186907,0.091310896],"genre_scores_gemma":[0.5658759,0.0000338542,0.41568482,0.00077577255,0.000060328108,0.000009617529,0.0000026668918,0.0000072536773,0.017549785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954295,0.000017900724,0.00007352042,0.00014053467,0.000097627766,0.00012744796],"domain_scores_gemma":[0.9996338,0.000032832453,0.000015292997,0.00026548118,0.000020527368,0.00003206968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017399064,0.000042320553,0.000048152724,0.000099297155,0.00006109663,0.000068862944,0.000467594,0.000019906876,0.000030429534],"category_scores_gemma":[0.000013325585,0.000036144793,0.00002225238,0.0006149722,0.000007664034,0.00012788526,0.00020017067,0.000033980552,0.0005755502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8464e-7,0.000020353502,0.00044462518,0.0000057504703,0.000007422669,0.000025043515,0.0002526072,0.0056800493,0.000156064,0.61864334,0.33214286,0.042621315],"study_design_scores_gemma":[0.00008468607,0.000019778014,0.0022495731,0.000004478442,4.3967924e-7,0.000004044035,0.000004961198,0.9482737,0.0022193245,0.013595503,0.033413358,0.0001301111],"about_ca_topic_score_codex":0.0000037461352,"about_ca_topic_score_gemma":2.2340535e-7,"teacher_disagreement_score":0.9425937,"about_ca_system_score_codex":0.000005407546,"about_ca_system_score_gemma":0.000010363397,"threshold_uncertainty_score":0.73977256},"labels":[],"label_agreement":null},{"id":"W4390527993","doi":"10.48550/arxiv.2312.17682","title":"Latent Idiom Recognition for a Minimalist Functional Array Language using Equality Saturation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; ENCODE; Compiler; Set (abstract data type); Natural language processing; Artificial intelligence; Speedup; Programming language; Language model; Minimalist program; Parallel computing; Syntax","score_opus":0.2516276083190059,"score_gpt":0.2523807478597557,"score_spread":0.0007531395407498476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390527993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06634238,0.000020429958,0.9313039,0.00009550183,0.0006726042,0.00038593228,0.000056566623,0.00091502897,0.00020765771],"genre_scores_gemma":[0.9162337,0.000029142282,0.08223722,0.00008718972,0.00017977967,0.000004230985,0.00035310313,0.000021321006,0.0008542946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00015361243,0.00023952716,0.0008446333,0.00009929174,0.00024161667],"domain_scores_gemma":[0.9986378,0.00013900614,0.00032071245,0.00053858577,0.00028435458,0.00007952857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047700634,0.00022136387,0.00022948901,0.00026892286,0.00023230302,0.00017223833,0.00054658105,0.00024652248,0.0000073518695],"category_scores_gemma":[0.000074936535,0.00026675695,0.0002052287,0.00043644095,0.000041832966,0.0002837156,0.0004359769,0.0002543138,0.000024350717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012351343,0.00014157646,0.00067040283,0.00025039457,0.00015473635,0.00004707474,0.000815888,0.96852875,0.0016246226,0.024554718,0.0017068108,0.0013814978],"study_design_scores_gemma":[0.00032173598,0.000036380035,0.0006350108,0.0001156176,0.000047881513,0.000003225229,0.000040940075,0.9683074,0.0014447123,0.028598547,0.00007269596,0.00037589823],"about_ca_topic_score_codex":0.00018085258,"about_ca_topic_score_gemma":0.00002696012,"teacher_disagreement_score":0.84989136,"about_ca_system_score_codex":0.0001900462,"about_ca_system_score_gemma":0.00015671185,"threshold_uncertainty_score":0.9999785},"labels":[],"label_agreement":null},{"id":"W4390545140","doi":"10.1007/978-3-031-30488-0_7","title":"Recurrence Equations and Their Closed-Form Solutions","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Divide and conquer algorithms; Recurrence relation; Function (biology); Relation (database); Primitive recursive function; Mathematics; Upper and lower bounds; Computer science; Algorithm; Applied mathematics; Calculus (dental); Combinatorics; Mathematical analysis; Medicine; Data mining","score_opus":0.03403883850685777,"score_gpt":0.2582427107577544,"score_spread":0.22420387225089664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390545140","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.256012e-7,0.0013467472,0.91891056,0.00032544,0.000117764925,0.00020369454,0.00034229195,0.00023772275,0.078515075],"genre_scores_gemma":[0.0035330737,0.0030268456,0.9591405,0.0001907651,0.00009696295,0.00004083005,0.000033439424,0.00007784236,0.033859737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870306,0.000015664156,0.0003778449,0.0004501533,0.00022322289,0.00023005731],"domain_scores_gemma":[0.99717045,0.00195556,0.00019678405,0.0004738175,0.00010362333,0.00009977905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028944595,0.00037301233,0.00039094355,0.00024406778,0.00031249944,0.00039681478,0.00034537798,0.00020260547,0.000022937627],"category_scores_gemma":[0.0003181134,0.0002902561,0.000060711645,0.000055572946,0.0001358585,0.00005114377,0.00023856603,0.00035117572,0.000029433619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.129604e-7,0.000014617256,4.4907136e-8,0.00016373424,0.000045385153,0.0000040331283,0.00049029454,0.00006278425,0.0000017589165,0.9327768,0.0034522365,0.06298762],"study_design_scores_gemma":[0.000020901507,0.000051241714,7.504165e-7,0.00043852505,0.000037000485,0.000013118509,0.000005624116,0.28084183,0.000034886525,0.7102467,0.008053499,0.0002559407],"about_ca_topic_score_codex":0.0000022551367,"about_ca_topic_score_gemma":0.000008394829,"teacher_disagreement_score":0.28077903,"about_ca_system_score_codex":0.000037941583,"about_ca_system_score_gemma":0.00007157376,"threshold_uncertainty_score":0.99995494},"labels":[],"label_agreement":null},{"id":"W4390722651","doi":"10.21105/astro.2401.02849","title":"A new timestep criterion for N-body simulations","year":2024,"lang":"en","type":"article","venue":"The Open Journal of Astrophysics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integrator; Jerk; Rounding; Phase space; Control theory (sociology); Eccentricity (behavior); Acceleration; Mathematics; Computer science; Applied mathematics; Algorithm; Physics; Classical mechanics","score_opus":0.02414686701242305,"score_gpt":0.3249722124784883,"score_spread":0.3008253454660652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390722651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005928517,0.0001076212,0.99658036,0.0019189466,0.00028753353,0.000138276,0.0000018836133,0.00004214773,0.00033038572],"genre_scores_gemma":[0.28593388,0.0000075287157,0.7131119,0.00009482726,0.00029422503,9.336658e-7,9.922029e-7,0.000008715652,0.0005470482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994498,0.000039342664,0.00020663586,0.00008798355,0.000121645724,0.00009459544],"domain_scores_gemma":[0.99937433,0.00013199808,0.000113790964,0.00020246256,0.00013080736,0.000046617643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023126784,0.00006595059,0.00011097274,0.00004646911,0.00012000012,0.0008579217,0.0012706219,0.000015399684,0.0000065747695],"category_scores_gemma":[0.000017155746,0.00004323215,0.00008095326,0.00022238496,0.000010098216,0.000649697,0.00020081698,0.00011013308,0.000005578186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005052233,0.00006917093,0.0000038581074,0.000020590993,0.00012626403,0.000015568477,0.0016659537,0.26365617,0.003804051,0.18811129,0.060116537,0.48236004],"study_design_scores_gemma":[0.00022300342,0.00035223446,0.000021502427,0.00012277879,0.00002296936,0.000043773816,0.000008609405,0.9194386,0.0018647624,0.04764043,0.030174077,0.000087285065],"about_ca_topic_score_codex":0.000004581846,"about_ca_topic_score_gemma":1.0922808e-7,"teacher_disagreement_score":0.6557824,"about_ca_system_score_codex":0.000019203659,"about_ca_system_score_gemma":0.00017807315,"threshold_uncertainty_score":0.8272959},"labels":[],"label_agreement":null},{"id":"W4390821557","doi":"10.3390/a17010031","title":"GPU Algorithms for Structured Sparse Matrix Multiplication with Diagonal Storage Schemes","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qassim University; University of Northern British Columbia","keywords":"Matrix multiplication; Computer science; Multiplication (music); Diagonal; Sparse matrix; Overhead (engineering); Parallel computing; Matrix (chemical analysis); Diagonal matrix; Locality; Algorithm; Set (abstract data type); Computer data storage; Computational science; Mathematics; Computer hardware","score_opus":0.020400943916873627,"score_gpt":0.2955937275811731,"score_spread":0.27519278366429945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390821557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084504846,0.0009513846,0.9948745,0.00068008236,0.00042378792,0.00048780628,0.000027138534,0.0015929019,0.000117378935],"genre_scores_gemma":[0.057552107,0.000042773056,0.94103163,0.00010909859,0.00029245368,0.00015143966,0.0000526954,0.00003301663,0.0007347737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984312,0.00003644538,0.00025205928,0.0006498332,0.0002981685,0.00033230789],"domain_scores_gemma":[0.99897283,0.00016380193,0.000080119586,0.00050766335,0.00016970142,0.00010585872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026671428,0.00022920476,0.0002024106,0.00018795309,0.00017818173,0.0004187995,0.0006435828,0.000104450715,0.000008835423],"category_scores_gemma":[0.00002769621,0.00018783091,0.000088900924,0.00053274614,0.00005442356,0.00047491494,0.0001269374,0.00016820848,0.000022215736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003404846,0.00013967163,0.000102204,0.00017590412,0.00020621026,0.00008552593,0.0011146698,0.019879721,0.00078216795,0.062782705,0.012249064,0.9024481],"study_design_scores_gemma":[0.0003111965,0.00013182788,0.0001577082,0.000051978535,0.000014030568,0.00005570248,0.0000076055358,0.95892465,0.003326884,0.0030174043,0.033715233,0.00028579793],"about_ca_topic_score_codex":0.000015370395,"about_ca_topic_score_gemma":0.000001908399,"teacher_disagreement_score":0.9390449,"about_ca_system_score_codex":0.00006757588,"about_ca_system_score_gemma":0.00012122096,"threshold_uncertainty_score":0.7659522},"labels":[],"label_agreement":null},{"id":"W4391033034","doi":"10.1002/spe.3313","title":"On‐demand JSON: A better way to parse documents?","year":2024,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"JSON; Computer science; Serialization; Parsing; JavaScript; Programming language; Bottleneck; Data structure; Operating system; Ajax; Database; Web application; Embedded system","score_opus":0.013481323830376661,"score_gpt":0.3095773286200742,"score_spread":0.29609600478969755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391033034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015533847,0.0007063181,0.97500557,0.005657801,0.0003707505,0.00014827945,9.165962e-7,0.0009577365,0.0016187796],"genre_scores_gemma":[0.5171241,0.00017447761,0.47127157,0.010675662,0.000079382306,0.000086456625,0.0000011201303,0.0000127825615,0.0005744375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871683,0.000072549534,0.0001664191,0.00053878373,0.000258879,0.00024655045],"domain_scores_gemma":[0.9988462,0.000528417,0.000038475286,0.0003857558,0.00006128964,0.00013988293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002906958,0.0001451532,0.00011273209,0.00010946831,0.00018204164,0.00077075226,0.00040880125,0.00004975869,0.000025544441],"category_scores_gemma":[0.00050758716,0.00012365388,0.0000309206,0.0003984213,0.00003731652,0.0014213311,0.00026661492,0.0001600906,0.00016781817],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103850514,0.00025648883,0.0003402006,0.00009955695,0.00007566508,0.0006851596,0.08265567,0.0014091694,0.00029386242,0.07567348,0.10624495,0.73216194],"study_design_scores_gemma":[0.0004628418,0.0010415373,0.00037366964,0.000584151,0.00003029695,0.00045917556,0.0009311659,0.044023566,0.005852887,0.021494083,0.9234513,0.0012952975],"about_ca_topic_score_codex":0.000019724801,"about_ca_topic_score_gemma":4.4978165e-7,"teacher_disagreement_score":0.8172064,"about_ca_system_score_codex":0.000025198426,"about_ca_system_score_gemma":0.000026895766,"threshold_uncertainty_score":0.74323815},"labels":[],"label_agreement":null},{"id":"W4391363591","doi":"10.1007/978-3-031-38684-8_7","title":"Synchronization and Scheduling","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Synchronization (alternating current); Distributed computing; Computer network","score_opus":0.00955273823493655,"score_gpt":0.2222689663728927,"score_spread":0.21271622813795615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000054161014,0.002157465,0.89930063,0.0015978902,0.000569494,0.00031276388,0.000011788627,0.0016853631,0.09435917],"genre_scores_gemma":[0.027309574,0.000741489,0.9047922,0.003362036,0.0024820806,0.000056705114,0.00004402086,0.00036937758,0.060842507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734503,0.00006193073,0.0004169359,0.0013090105,0.00048379516,0.00038330106],"domain_scores_gemma":[0.9980348,0.0005748775,0.00019664613,0.00094151846,0.00009155773,0.00016063503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022092767,0.00073957664,0.0005856109,0.0007681255,0.00025160142,0.00067094184,0.0010355567,0.00052466174,0.000037287005],"category_scores_gemma":[0.000040439973,0.0006306097,0.00022894552,0.00013560553,0.00011032635,0.00008292934,0.00066210865,0.0010629831,0.000103705795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011915371,0.000017476512,7.232367e-7,0.00023298424,0.00020202227,0.000082104736,0.00035410843,0.09566347,0.000009615678,0.33954716,0.0038797904,0.55999863],"study_design_scores_gemma":[0.00013529602,0.0002753027,0.000007756904,0.0022444448,0.00009941718,0.00023779669,5.023322e-7,0.54223007,0.00059580343,0.32677022,0.12602279,0.0013806254],"about_ca_topic_score_codex":0.0000025276345,"about_ca_topic_score_gemma":0.0000031755324,"teacher_disagreement_score":0.558618,"about_ca_system_score_codex":0.00009618372,"about_ca_system_score_gemma":0.000095325,"threshold_uncertainty_score":0.99961454},"labels":[],"label_agreement":null},{"id":"W4391363621","doi":"10.1007/978-3-031-38684-8_2","title":"Architectural Background","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on computer architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.01698692140366249,"score_gpt":0.24048495818077645,"score_spread":0.22349803677711397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391363621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009110213,0.0010983959,0.68217146,0.002401199,0.001349113,0.0004670478,0.000037355036,0.0029289941,0.30953732],"genre_scores_gemma":[0.013338408,0.0002237437,0.6061869,0.0078081395,0.0058580623,0.00015196031,0.00009866774,0.0007656336,0.36556846],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99508154,0.00012882585,0.000758735,0.0021630398,0.001025889,0.0008419959],"domain_scores_gemma":[0.99580705,0.0011862977,0.0003295597,0.0022328221,0.00012775013,0.00031654182],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00032763154,0.0014527097,0.0011027565,0.0013402638,0.00034343405,0.0010272812,0.0032476413,0.00080676563,0.00018664011],"category_scores_gemma":[0.000032015247,0.0011772548,0.0009005491,0.00023513555,0.0002092583,0.0001003616,0.001181451,0.0024101636,0.0008722386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040414154,0.00004143602,2.7507917e-7,0.00022440753,0.0004634584,0.00031195764,0.00041719442,0.044826295,0.00001717158,0.44032446,0.033841863,0.47949108],"study_design_scores_gemma":[0.00018401873,0.00048089994,0.000010607509,0.0017500995,0.00012202251,0.00065382477,6.7083334e-7,0.05281529,0.00092216785,0.45051754,0.49036846,0.002174384],"about_ca_topic_score_codex":0.0000074711684,"about_ca_topic_score_gemma":0.000011900716,"teacher_disagreement_score":0.4773167,"about_ca_system_score_codex":0.00020731123,"about_ca_system_score_gemma":0.00018030645,"threshold_uncertainty_score":0.9999057},"labels":[],"label_agreement":null},{"id":"W4391389563","doi":"10.21105/astro.2307.14339","title":"Capse.jl: efficient and auto-differentiable CMB power spectra emulation","year":2024,"lang":"en","type":"article","venue":"The Open Journal of Astrophysics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Science and Technology Facilities Council; U.S. Department of Energy","keywords":"Emulation; Cosmic microwave background; Differentiable function; Power (physics); Spectral line; Electrical engineering; Physics; Mathematics; Psychology; Engineering; Mathematical analysis; Astronomy; Optics; Thermodynamics; Social psychology","score_opus":0.01184556046386803,"score_gpt":0.2618413370845046,"score_spread":0.24999577662063655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391389563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06480548,0.00021800786,0.9330693,0.0006655782,0.0002393628,0.00008936852,6.7956955e-7,0.00004885523,0.00086340314],"genre_scores_gemma":[0.87780046,0.00001770077,0.12190069,0.000040227806,0.000076599994,5.241475e-7,3.5805598e-7,0.000007744333,0.00015568572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925095,0.00006881259,0.00022025459,0.00012675383,0.00020773364,0.00012548643],"domain_scores_gemma":[0.9994607,0.000052544292,0.00013509874,0.0002141672,0.000088109366,0.000049400587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498731,0.00008962586,0.00013926986,0.000058515954,0.00013542846,0.0009441905,0.00086875004,0.00001928163,0.00001053656],"category_scores_gemma":[0.000007646648,0.00005743954,0.000053648804,0.00023063058,0.000030813648,0.00033940986,0.00031961538,0.00019499994,0.000006942153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069452006,0.0003134535,0.00008522871,0.000044686145,0.000262948,0.00008759525,0.007017094,0.5842912,0.009845842,0.29142666,0.009981008,0.09657484],"study_design_scores_gemma":[0.00020608131,0.00027299984,0.00089435134,0.0001471501,0.000021667269,0.000089573696,0.00003228701,0.9823565,0.0030458646,0.010796602,0.00201263,0.00012428212],"about_ca_topic_score_codex":0.0000049448904,"about_ca_topic_score_gemma":8.442618e-8,"teacher_disagreement_score":0.812995,"about_ca_system_score_codex":0.000027015156,"about_ca_system_score_gemma":0.000065865235,"threshold_uncertainty_score":0.910485},"labels":[],"label_agreement":null},{"id":"W4391725313","doi":"10.14722/ndss.2024.24582","title":"Phoenix: Surviving Unpatched Vulnerabilities via Accurate and Efficient Filtering of Syscall Sequences","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Phoenix; Computer science; Geography; Archaeology","score_opus":0.017500906640688974,"score_gpt":0.26405750472509365,"score_spread":0.24655659808440467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391725313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08717593,0.0003884877,0.90956545,0.00023543183,0.0001839796,0.00007271463,9.531921e-7,0.0006724822,0.0017045557],"genre_scores_gemma":[0.89115286,0.00003395636,0.10854568,0.000025965317,0.000015015268,0.0000051545753,5.503913e-7,0.000005130896,0.00021565544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907464,0.00007362555,0.00023922617,0.00030122997,0.000151904,0.00015939778],"domain_scores_gemma":[0.99937195,0.0002615067,0.0000407755,0.00022378187,0.00005892891,0.000043040785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019086,0.00010661779,0.00014715405,0.00012270358,0.00006708005,0.00021728856,0.00031601763,0.000035177247,0.000012176176],"category_scores_gemma":[0.000035875226,0.000085557775,0.000037125446,0.00029962917,0.00006360512,0.00019093521,0.00025069245,0.00007846534,0.000002726637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017406635,0.00018354862,0.001609396,0.001963635,0.00017358274,0.00007168318,0.02715378,0.53200257,0.06965019,0.18567678,0.001358566,0.18013887],"study_design_scores_gemma":[0.00003359888,0.00003661424,0.00016152968,0.00010907041,0.0000024416788,0.000014025365,0.000039902843,0.9719816,0.025538534,0.001869267,0.000098126875,0.00011532427],"about_ca_topic_score_codex":0.00014804896,"about_ca_topic_score_gemma":0.000007727475,"teacher_disagreement_score":0.80397695,"about_ca_system_score_codex":0.000019567706,"about_ca_system_score_gemma":0.000037515863,"threshold_uncertainty_score":0.34889448},"labels":[],"label_agreement":null},{"id":"W4391951317","doi":"10.1145/3640537.3641571","title":"Region-Based Data Layout via Data Reuse Analysis","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Data structure; Data type; Cache; Transformation (genetics); Pointer (user interface); Compiler; Data transformation; Program transformation; Static analysis; Locality; Parallel computing; Programming language; Database; Data warehouse","score_opus":0.09369796126873893,"score_gpt":0.33458515965620694,"score_spread":0.24088719838746803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391951317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025351337,0.0002879632,0.9896221,0.00533814,0.0001362676,0.00006114139,0.000019480834,0.002244988,0.0022645267],"genre_scores_gemma":[0.16416492,0.000024955472,0.83335745,0.0007940724,0.00006190272,0.0000021701112,0.0006148803,0.00000941442,0.0009702198],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983908,0.000072982504,0.00021736516,0.0009150042,0.00022823118,0.0001756134],"domain_scores_gemma":[0.987167,0.00016237707,0.00003815229,0.012515749,0.00004801643,0.00006873244],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0005767246,0.00011313371,0.00015159899,0.00034619626,0.000082651684,0.0005232352,0.012103512,0.00004917742,0.000029095234],"category_scores_gemma":[0.00016728014,0.00009388185,0.00004555273,0.0019772348,0.000026252019,0.0008220089,0.005548437,0.000108119726,0.00006640123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031248962,0.00007894847,0.0008044341,0.000032571323,0.00040268793,0.00012616871,0.0001270316,0.040559664,0.000012813229,0.011303278,0.91058403,0.035965268],"study_design_scores_gemma":[0.000034553508,0.00000994676,0.000055751683,0.000012812564,0.00006758474,0.0000037074221,0.0000011185099,0.9694681,0.000060734772,0.0009909754,0.02916341,0.00013128012],"about_ca_topic_score_codex":0.00014494428,"about_ca_topic_score_gemma":0.000024912704,"teacher_disagreement_score":0.92890847,"about_ca_system_score_codex":0.000017169345,"about_ca_system_score_gemma":0.0001124893,"threshold_uncertainty_score":0.9932415},"labels":[],"label_agreement":null},{"id":"W4391987878","doi":"10.1103/physreva.110.022215","title":"Thermodynamic analysis of algorithmic cooling protocols: Efficiency metrics and improved designs","year":2024,"lang":"en","type":"preprint","venue":"Physical review. A/Physical review, A","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; National Research Council Canada","funders":"Adolph C. and Mary Sprague Miller Institute for Basic Research in Science, University of California Berkeley","keywords":"Computer science","score_opus":0.03643788653427071,"score_gpt":0.39993176936548797,"score_spread":0.36349388283121725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391987878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027636362,0.113098785,0.86859447,0.00042026048,0.00009399612,0.013874492,0.00005440712,0.00056855386,0.0005313847],"genre_scores_gemma":[0.5351091,0.33973804,0.10251912,0.0018803622,0.00057849614,0.019717174,0.00015511976,0.0002163723,0.000086207954],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945336,0.0007299806,0.0013899092,0.0017952245,0.00096513925,0.0005861347],"domain_scores_gemma":[0.99509555,0.00080717955,0.001166468,0.002097234,0.0005493275,0.00028423924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001535492,0.00085616374,0.0036587152,0.0005564546,0.00010940046,0.00021988495,0.0023210736,0.00013343032,0.000004619298],"category_scores_gemma":[0.0009934873,0.0006653897,0.0017970141,0.0059472006,0.00019143734,0.00015179478,0.0032301976,0.0013501033,0.000025307854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034139117,0.0050864364,0.000060904866,0.2135142,0.0052305297,0.000053678472,0.00086951297,0.0051289997,0.01253995,0.10216862,0.0015138262,0.65379924],"study_design_scores_gemma":[0.00008833613,0.00019864965,0.00003536007,0.019842355,0.0026051963,0.000001939658,5.8822627e-7,0.9364859,0.0007874229,0.03879125,0.0005171592,0.00064586813],"about_ca_topic_score_codex":0.000034183573,"about_ca_topic_score_gemma":9.2280817e-7,"teacher_disagreement_score":0.93135685,"about_ca_system_score_codex":0.00014782215,"about_ca_system_score_gemma":0.0003339449,"threshold_uncertainty_score":0.9995797},"labels":[],"label_agreement":null},{"id":"W4392110350","doi":"10.3390/fi16030072","title":"Analyzing GPU Performance in Virtualized Environments: A Case Study","year":2024,"lang":"en","type":"article","venue":"Future Internet","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Telefonaktiebolaget LM Ericsson","keywords":"Computer science; Parallel computing; Operating system; Embedded system","score_opus":0.011746150359651868,"score_gpt":0.26578020541280684,"score_spread":0.25403405505315496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392110350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41831654,0.0005024681,0.57923603,0.0001591107,0.00058366766,0.00017743614,5.47616e-7,0.0004098751,0.0006143237],"genre_scores_gemma":[0.98317766,0.000039426155,0.015732154,0.00007866216,0.00013537185,0.000021446082,0.0000015142961,0.000009230824,0.00080453337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990167,0.00008552721,0.00023520208,0.000371612,0.00012527293,0.00016571276],"domain_scores_gemma":[0.99958104,0.00003351171,0.000032160835,0.0003070676,0.0000073064357,0.000038905913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030195163,0.00012544492,0.0001295436,0.0002252534,0.000030851672,0.0002143931,0.00043960428,0.000046020763,0.0000223951],"category_scores_gemma":[0.000006053761,0.000108755274,0.000038796377,0.00037103487,0.00001255072,0.00032565554,0.00022750649,0.00020618395,0.000051985353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104407794,0.0024478964,0.09282281,0.000304952,0.0005745862,0.058643434,0.14593597,0.024598341,0.0003695566,0.026443452,0.033843238,0.61391133],"study_design_scores_gemma":[0.00034565743,0.00028667127,0.001315586,0.00011716463,0.000007827394,0.00084743963,0.0004705945,0.96299976,0.0003007006,0.00007181501,0.032972272,0.00026451857],"about_ca_topic_score_codex":0.00007439803,"about_ca_topic_score_gemma":0.000030428102,"teacher_disagreement_score":0.9384014,"about_ca_system_score_codex":0.00006623217,"about_ca_system_score_gemma":0.00001603572,"threshold_uncertainty_score":0.44349113},"labels":[],"label_agreement":null},{"id":"W4392154832","doi":"10.1007/978-981-97-0859-8","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel computing; Parallel processing; Computer architecture","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392154832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W4392172245","doi":"10.1007/978-981-97-0811-6","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel computing; Parallel processing","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392172245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W4392240387","doi":"10.1145/3649510","title":"Low-Overhead Trace Collection and Profiling on GPU Compute Kernels","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Profiling (computer programming); Computer science; Parallel computing; Overhead (engineering); TRACE (psycholinguistics); Computational science; Operating system","score_opus":0.02225276152485731,"score_gpt":0.28097243297424046,"score_spread":0.2587196714493831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392240387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011587321,0.00036706947,0.98147136,0.0014487457,0.0009290744,0.00043115244,0.000003982734,0.0026768665,0.0010844239],"genre_scores_gemma":[0.67678356,0.0001160268,0.3222595,0.00032872352,0.00009050198,0.000016311986,0.0000034293184,0.00003213657,0.00036982197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974107,0.00017730353,0.00050008635,0.0010105928,0.00041000923,0.0004912802],"domain_scores_gemma":[0.9981244,0.000755342,0.000102088736,0.0007611975,0.00009513754,0.000161784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005434292,0.0003818256,0.0003306142,0.00052237144,0.00077564234,0.00069698686,0.0007878908,0.00017104013,0.000010937495],"category_scores_gemma":[0.00003867379,0.00038384358,0.000160015,0.0010795902,0.000069237656,0.0004310523,0.00006153479,0.00067963934,0.00008474609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004207213,0.00024573156,0.000025867826,0.00013027042,0.000102067526,0.000044594915,0.0011358397,0.7407441,0.00023560016,0.011492323,0.0010490183,0.2447525],"study_design_scores_gemma":[0.00041659942,0.0003601692,0.00020786023,0.00042578852,0.000017225904,0.000092918395,0.00002773224,0.9902096,0.003823874,0.0030820293,0.0009049143,0.00043132578],"about_ca_topic_score_codex":0.000019713623,"about_ca_topic_score_gemma":0.0000030357664,"teacher_disagreement_score":0.66519624,"about_ca_system_score_codex":0.00014373884,"about_ca_system_score_gemma":0.000109151166,"threshold_uncertainty_score":0.99986136},"labels":[],"label_agreement":null},{"id":"W4392265902","doi":"10.1109/cgo57630.2024.10444869","title":"Instruction Scheduling for the GPU on the GPU","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Compiler; Scheduling (production processes); Ant colony optimization algorithms; CUDA; Algorithm; Mathematical optimization; Operating system","score_opus":0.03008812089446526,"score_gpt":0.28084346218407313,"score_spread":0.25075534128960786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392265902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007239785,0.00014992092,0.980698,0.012102006,0.0005682316,0.00017790319,3.0967325e-7,0.0008116083,0.0047680363],"genre_scores_gemma":[0.6781608,0.000046177956,0.31867105,0.0015353828,0.00021160088,0.00005040016,6.982877e-7,0.000008557392,0.0013153746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994859,0.000025618992,0.00009524152,0.00017904495,0.00010717715,0.00010702608],"domain_scores_gemma":[0.99920636,0.00042699766,0.000018758634,0.0002967231,0.00003701687,0.000014123709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037890158,0.000062872925,0.000041180498,0.000042156098,0.00026874806,0.0003762668,0.0004972847,0.000027209839,0.000009324849],"category_scores_gemma":[0.000046677236,0.000029790035,0.000051531104,0.00025167587,0.000021934948,0.00011834353,0.000079242134,0.00010099662,0.000025305795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014881841,0.000004820859,0.0000029091818,0.0000048633215,0.000009958366,2.911733e-7,0.0001678735,0.018903758,0.000026973677,0.89037585,0.008052115,0.082449116],"study_design_scores_gemma":[0.00003266625,0.000028493912,0.00001792296,0.000020220048,0.0000021738265,0.0000042939796,0.000018120905,0.9575252,0.0021162878,0.013318868,0.02686621,0.000049521066],"about_ca_topic_score_codex":0.0000072365056,"about_ca_topic_score_gemma":9.709053e-7,"teacher_disagreement_score":0.93862146,"about_ca_system_score_codex":0.000016317297,"about_ca_system_score_gemma":0.00002802433,"threshold_uncertainty_score":0.36283493},"labels":[],"label_agreement":null},{"id":"W4392265952","doi":"10.1109/cgo57630.2024.10444805","title":"TapeFlow: Streaming Gradient Tapes in Automatic Differentiation","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Operand; Compiler; Cache; Parallel computing; Stencil; Static random-access memory; Reuse; Schedule; Locality of reference; Dram; Code (set theory); Overlay; Chip; Overhead (engineering); Optimizing compiler; Automatic differentiation; Computation; Computer hardware; Set (abstract data type); Algorithm; Computational science; Programming language; Operating system","score_opus":0.010800522552231354,"score_gpt":0.25064782950226,"score_spread":0.23984730695002865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392265952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038581308,0.00018460526,0.9559855,0.00037544116,0.00022170892,0.00008321145,1.8851219e-7,0.0016347879,0.002933238],"genre_scores_gemma":[0.8591297,0.000018952915,0.14044368,0.000059340557,0.000017061117,0.0000104258415,0.0000022475413,0.000004664921,0.0003139257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926525,0.00003853846,0.00018290193,0.00023864215,0.00012761171,0.00014707683],"domain_scores_gemma":[0.99968106,0.000069141395,0.000020000183,0.00018528047,0.00001520985,0.00002929114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015298583,0.000081388214,0.0000828036,0.00023888628,0.000037022823,0.00026057978,0.00027777508,0.000031187832,0.000020281199],"category_scores_gemma":[0.00001518028,0.00006818704,0.00003249029,0.00044220325,0.000007719544,0.00028731907,0.00009506491,0.000073056595,0.00003235181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.8708933e-7,0.00014379426,0.0015554526,0.00014236258,0.000025713774,0.000048199494,0.003142457,0.011228793,0.0005174567,0.3612587,0.003735227,0.6182011],"study_design_scores_gemma":[0.000044041866,0.00001702242,0.0033040964,0.00007765223,0.0000013366423,0.000003606286,0.000007862025,0.99033946,0.00075679953,0.0051040663,0.00025684744,0.00008718878],"about_ca_topic_score_codex":0.000023940616,"about_ca_topic_score_gemma":0.000015225779,"teacher_disagreement_score":0.97911066,"about_ca_system_score_codex":0.000048527,"about_ca_system_score_gemma":0.000023699762,"threshold_uncertainty_score":0.27805868},"labels":[],"label_agreement":null},{"id":"W4392266008","doi":"10.1109/cgo57630.2024.10444879","title":"Latent Idiom Recognition for a Minimalist Functional Array Language Using Equality Saturation","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; ENCODE; Compiler; Natural language processing; Set (abstract data type); Artificial intelligence; Speedup; Programming language; Language model; Minimalist program; Matching (statistics); Parallel computing; Syntax","score_opus":0.08493101923587307,"score_gpt":0.32355274541383133,"score_spread":0.23862172617795827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392266008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053848,0.00014424928,0.991053,0.00045025395,0.00043062743,0.00017229577,0.000007903822,0.0009583639,0.0013985233],"genre_scores_gemma":[0.4421042,0.0000040004275,0.5568812,0.00024703014,0.00017216505,0.000019425597,0.000064682776,0.000007157839,0.0005001356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992369,0.000044397424,0.00018058,0.00027984672,0.00013267333,0.000125604],"domain_scores_gemma":[0.999601,0.00009125693,0.000037088445,0.00014425458,0.000093195915,0.00003319487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036822874,0.000082768645,0.000075613185,0.00010053881,0.00010846544,0.00031398062,0.00012088296,0.00005018814,0.00002259765],"category_scores_gemma":[0.00003314247,0.00007298623,0.000069147776,0.00023788743,0.000012173039,0.0003701653,0.000030915264,0.000056856403,0.000016182334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015752355,0.0004121534,0.00025695446,0.00078240456,0.00027288194,0.000029095823,0.008016629,0.022231216,0.26392308,0.28484464,0.05159041,0.36748302],"study_design_scores_gemma":[0.000114067036,0.000042567684,0.00012172429,0.00005411197,0.000008878127,0.0000170817,0.000019722836,0.9634191,0.029158173,0.005549549,0.0013300328,0.00016500392],"about_ca_topic_score_codex":0.000033627857,"about_ca_topic_score_gemma":0.0000044295302,"teacher_disagreement_score":0.94118786,"about_ca_system_score_codex":0.000044474033,"about_ca_system_score_gemma":0.000056061384,"threshold_uncertainty_score":0.30277222},"labels":[],"label_agreement":null},{"id":"W4392412513","doi":"10.1109/swc57546.2023.10449312","title":"Profiling and Understanding CPU Power Management in Linux","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Profiling (computer programming); Operating system; Computer science; Power management; Embedded system; Power (physics); Physics","score_opus":0.04879196769259069,"score_gpt":0.2877854073728809,"score_spread":0.2389934396802902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392412513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038524454,0.000015368641,0.95615125,0.0004930591,0.000058179783,0.000099008874,5.6111997e-8,0.0007839556,0.03854665],"genre_scores_gemma":[0.73170626,0.000055951627,0.2673672,0.0001343424,0.0000041103444,0.00000554358,6.240652e-7,0.0000035693943,0.00072237046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994708,0.00001714867,0.000098102944,0.0001878463,0.0000857779,0.00014036667],"domain_scores_gemma":[0.99978626,0.000028271032,0.00001645747,0.00013826355,0.000007067339,0.000023678847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026396554,0.00005027798,0.000053846066,0.00021611665,0.000050575793,0.00008616011,0.00017466622,0.000020577474,0.000002593096],"category_scores_gemma":[0.000005293712,0.000046597816,0.000009703184,0.00053929246,0.000009912091,0.00011801948,0.0002462278,0.00004283586,0.000012943535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013585652,0.000012512446,0.0016191375,0.000014431098,0.0000066591642,0.000035682686,0.00039975983,0.0049258647,0.000021505277,0.9876169,0.0017842917,0.0035619168],"study_design_scores_gemma":[0.00018923503,0.000022299202,0.0015895161,0.000027751548,7.7232494e-7,0.000002550543,0.0002512289,0.96058685,0.00032964957,0.036582652,0.00028625573,0.00013122636],"about_ca_topic_score_codex":0.0000023882462,"about_ca_topic_score_gemma":0.0000012713343,"teacher_disagreement_score":0.955661,"about_ca_system_score_codex":0.00003086421,"about_ca_system_score_gemma":0.000005644323,"threshold_uncertainty_score":0.19002037},"labels":[],"label_agreement":null},{"id":"W4392412748","doi":"10.1109/swc57546.2023.10448789","title":"Mixed-Precision Architecture for GPU Tensor Cores","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Tensor (intrinsic definition); Architecture; Parallel computing; Computational science; Mathematics; Geometry","score_opus":0.034949004157427084,"score_gpt":0.2876714994407456,"score_spread":0.2527224952833185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392412748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015510222,0.000017936376,0.9914663,0.0017931364,0.00022970153,0.00019150025,0.0000019936883,0.0024028504,0.0023455461],"genre_scores_gemma":[0.067747496,0.000018188297,0.92719555,0.0005001512,0.00007165385,0.000037188027,0.000010384363,0.000010900185,0.004408508],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921244,0.000027100185,0.00013622531,0.0002755419,0.00014069524,0.00020798534],"domain_scores_gemma":[0.9992227,0.0002603312,0.000037129677,0.00035161918,0.000078471014,0.00004974111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024998735,0.00008673324,0.00009975426,0.00016305169,0.0001283563,0.000101330756,0.00060943665,0.00004914562,0.0000060157267],"category_scores_gemma":[0.000116641226,0.00006690494,0.00006368214,0.00046020088,0.000015842386,0.000080039514,0.00021229999,0.000055657354,0.000067264584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013305965,0.000032426844,0.00017938155,0.000019090725,0.000012586619,0.0000054209977,0.00033128724,0.054275393,0.0005005096,0.08889007,0.52444553,0.33129498],"study_design_scores_gemma":[0.00019784414,0.00010053218,0.0009388837,0.000015694653,0.0000016038886,0.000005780551,0.0000080813425,0.8946096,0.0056886943,0.042904634,0.055362236,0.00016642446],"about_ca_topic_score_codex":0.00000474596,"about_ca_topic_score_gemma":0.0000026667922,"teacher_disagreement_score":0.8403342,"about_ca_system_score_codex":0.00000825243,"about_ca_system_score_gemma":0.000019140678,"threshold_uncertainty_score":0.27283043},"labels":[],"label_agreement":null},{"id":"W4392718840","doi":"10.1007/978-981-97-0834-5","title":"Algorithms and Architectures for Parallel Processing","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute of Computing Technology, Chinese Academy of Sciences; Dalian Maritime University; University of Science and Technology of China; University of Shanghai for Science and Technology; Nanjing University; Nanjing University of Information Science and Technology; Peking University; National University of Defense Technology; Università della Calabria; Xidian University; Danmarks Tekniske Universitet; Shanghai Jiao Tong University; Tianjin University; Shaanxi Normal University; Guangdong University of Technology; Ocean University of China; Huazhong University of Science and Technology; Dalian University of Technology; Hubei University of Technology; Lomonosov Moscow State University; Tsinghua University; Trent University; Tianjin University of Technology; Chinese Academy of Sciences; University of Electronic Science and Technology of China; Beijing Jiaotong University; Kanazawa University; Kungliga Tekniska Högskolan; Beihang University; Nottingham Trent University; Kalinga Institute of Industrial Technology; Hunan University; University of West Attica; South China Agricultural University; Université du Luxembourg; University of Louisiana at Lafayette; Tulane University; China Agricultural University; Hubei University; Nanjing University of Posts and Telecommunications; Beijing Institute of Technology; Ohio State University","keywords":"Computer science; Parallel processing; Parallel computing","score_opus":0.016565827323833427,"score_gpt":0.2796502157388184,"score_spread":0.26308438841498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392718840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013573434,0.0033182066,0.99302244,0.00087508926,0.00072272896,0.00059512455,0.000005101357,0.00070325454,0.0007444778],"genre_scores_gemma":[0.0055753323,0.000033687247,0.99197894,0.0009400832,0.00050788384,0.00004817265,0.0000056774884,0.000038376405,0.00087184424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673486,0.00003532056,0.0004268736,0.0016346104,0.0005382761,0.00063003594],"domain_scores_gemma":[0.99837995,0.00042214376,0.00017804025,0.0006836684,0.000193208,0.00014300273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008693164,0.00047360596,0.0004678212,0.00090947695,0.00031084917,0.0012359566,0.002127916,0.0002783261,8.831389e-7],"category_scores_gemma":[0.00009357952,0.00040860462,0.00010231943,0.0008218386,0.0005009673,0.00016606036,0.001152591,0.0006445283,0.000004250801],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031710886,0.000013585994,0.0000042238207,0.00020910888,0.0000065855984,0.000018140705,0.0009804622,0.10976404,0.000006639932,0.001508228,0.00040758098,0.8870782],"study_design_scores_gemma":[0.000120406396,0.000106924774,0.000008990699,0.00044408458,0.000006052559,0.000059274913,6.9464946e-8,0.7514027,0.00016292761,0.24555095,0.0017536095,0.0003840213],"about_ca_topic_score_codex":0.0000053636495,"about_ca_topic_score_gemma":0.000008360055,"teacher_disagreement_score":0.8866942,"about_ca_system_score_codex":0.00018751796,"about_ca_system_score_gemma":0.0010354378,"threshold_uncertainty_score":0.99983656},"labels":[],"label_agreement":null},{"id":"W4392746141","doi":"10.1109/isscc49657.2024.10454441","title":"11.1 AMD InstinctTM MI300 Series Modular Chiplet Package – HPC and AI Accelerator for Exa-Class Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Modular design; Class (philosophy); Computer science; Series (stratigraphy); Computer architecture; Operating system; Artificial intelligence","score_opus":0.01739082458735892,"score_gpt":0.26056006506785817,"score_spread":0.24316924048049926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392746141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062306672,0.0007344584,0.98635095,0.0016992228,0.00059924705,0.00040899002,0.00001112853,0.001879386,0.0020859546],"genre_scores_gemma":[0.8588363,0.00006361764,0.13692053,0.0006410626,0.00019695905,0.0001058574,0.0000123046,0.00002702222,0.0031963778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00005376192,0.00026475056,0.0005171941,0.00017068429,0.00027990234],"domain_scores_gemma":[0.99925244,0.00008881702,0.00004355738,0.0004095495,0.000104657185,0.00010099353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003226303,0.00019316538,0.00021767999,0.00014818515,0.000189231,0.0009150145,0.0004702203,0.000093662115,0.00000565131],"category_scores_gemma":[0.000033522003,0.00016043808,0.000057178895,0.00032170626,0.000044330933,0.0007529695,0.00023003502,0.00010404501,0.000011093852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001406977,0.000073088464,0.00048415968,0.0007807017,0.00009083308,0.000047463025,0.0011764355,0.005234923,0.0024538904,0.8990465,0.081301086,0.009296865],"study_design_scores_gemma":[0.00015118287,0.00010979548,0.00010221055,0.00008733524,0.000006698533,0.00004310653,0.000023279534,0.8959475,0.0045890915,0.001946834,0.09672425,0.00026871738],"about_ca_topic_score_codex":0.000037787777,"about_ca_topic_score_gemma":0.000010275039,"teacher_disagreement_score":0.8970997,"about_ca_system_score_codex":0.00002955824,"about_ca_system_score_gemma":0.00007387278,"threshold_uncertainty_score":0.88235056},"labels":[],"label_agreement":null},{"id":"W4392906083","doi":"10.32920/25412869","title":"Power-aware Future Computing Systems Using Machine Learning Techniques","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Throughput; Graphics processing unit; Embedded system; Cache; Multi-core processor; Energy consumption; Computer architecture; Static random-access memory; Parallel computing; Computer hardware; Operating system","score_opus":0.018336903745767037,"score_gpt":0.28424150692715167,"score_spread":0.26590460318138465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392906083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070085126,0.004470916,0.9730467,0.00057452533,0.0027881642,0.0005436082,0.000007654389,0.011970909,0.0058966544],"genre_scores_gemma":[0.3148531,0.00016738303,0.6827986,0.00019653211,0.0008478057,0.00001711212,0.00003762462,0.0000895474,0.0009922715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665964,0.00030735598,0.0007339408,0.0012714631,0.00051496143,0.0005126214],"domain_scores_gemma":[0.998013,0.00008257666,0.00042189978,0.0010504693,0.0002935761,0.00013847482],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00091977353,0.0006066192,0.0006540711,0.0005891429,0.000339408,0.0017342753,0.0019079807,0.000619106,0.000011100482],"category_scores_gemma":[0.000025471722,0.00055253797,0.00025977005,0.0005716034,0.000040387262,0.00013973624,0.007328979,0.0023083915,0.000026390324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011356884,0.00019365389,0.00077722943,0.0031991897,0.0004815956,0.00042209626,0.0036084745,0.8099649,0.0006196322,0.14138368,0.011795655,0.02754256],"study_design_scores_gemma":[0.00004154143,0.000047550453,0.0000039468987,0.0009764344,0.000016727114,0.00009640283,0.00004221461,0.98771745,0.0011573696,0.0021078412,0.007152935,0.00063960877],"about_ca_topic_score_codex":0.00035835878,"about_ca_topic_score_gemma":0.0000023360844,"teacher_disagreement_score":0.31415227,"about_ca_system_score_codex":0.0002694988,"about_ca_system_score_gemma":0.0002546603,"threshold_uncertainty_score":0.9999933},"labels":[],"label_agreement":null},{"id":"W4392906086","doi":"10.32920/25412869.v1","title":"Power-aware Future Computing Systems Using Machine Learning Techniques","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graphics processing unit; Throughput; Cache; Multi-core processor; Embedded system; Computer architecture; Energy consumption; Computer engineering; Distributed computing; Parallel computing; Operating system","score_opus":0.018336903745767037,"score_gpt":0.28424150692715167,"score_spread":0.26590460318138465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392906086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070085126,0.004470916,0.9730467,0.00057452533,0.0027881642,0.0005436082,0.000007654389,0.011970909,0.0058966544],"genre_scores_gemma":[0.3148531,0.00016738303,0.6827986,0.00019653211,0.0008478057,0.00001711212,0.00003762462,0.0000895474,0.0009922715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665964,0.00030735598,0.0007339408,0.0012714631,0.00051496143,0.0005126214],"domain_scores_gemma":[0.998013,0.00008257666,0.00042189978,0.0010504693,0.0002935761,0.00013847482],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00091977353,0.0006066192,0.0006540711,0.0005891429,0.000339408,0.0017342753,0.0019079807,0.000619106,0.000011100482],"category_scores_gemma":[0.000025471722,0.00055253797,0.00025977005,0.0005716034,0.000040387262,0.00013973624,0.007328979,0.0023083915,0.000026390324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011356884,0.00019365389,0.00077722943,0.0031991897,0.0004815956,0.00042209626,0.0036084745,0.8099649,0.0006196322,0.14138368,0.011795655,0.02754256],"study_design_scores_gemma":[0.00004154143,0.000047550453,0.0000039468987,0.0009764344,0.000016727114,0.00009640283,0.00004221461,0.98771745,0.0011573696,0.0021078412,0.007152935,0.00063960877],"about_ca_topic_score_codex":0.00035835878,"about_ca_topic_score_gemma":0.0000023360844,"teacher_disagreement_score":0.31415227,"about_ca_system_score_codex":0.0002694988,"about_ca_system_score_gemma":0.0002546603,"threshold_uncertainty_score":0.9999933},"labels":[],"label_agreement":null},{"id":"W4392910051","doi":"10.1109/eptc59621.2023.10457590","title":"Power Estimation and Comparison of Heterogenous CPU-GPU Processors","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Estimation; Parallel computing; Power (physics); CUDA; Computational science; Engineering","score_opus":0.024098866906637734,"score_gpt":0.307681246576989,"score_spread":0.28358237967035127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392910051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093742706,0.000048352107,0.9031965,0.00018568513,0.000037269998,0.00007674287,2.8683098e-7,0.0007707727,0.0019416908],"genre_scores_gemma":[0.83620435,0.0000059997396,0.16361985,0.000035953635,0.0000023169969,0.0000033570507,0.0000016641279,0.000003077939,0.00012343768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941987,0.00001957825,0.00017044893,0.00015629343,0.00012689024,0.0001069086],"domain_scores_gemma":[0.99962723,0.0000403536,0.000071266746,0.00016906299,0.00006054056,0.000031555363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014867022,0.000059599377,0.00011018192,0.00011511194,0.000059136717,0.000046230096,0.00022142215,0.000031430685,0.0000034002119],"category_scores_gemma":[0.000021221753,0.000052849122,0.000016069209,0.00040460183,0.000023423421,0.00014481998,0.000123275,0.00003598454,0.000013312946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028252545,0.0006138653,0.034995012,0.00039535752,0.0000976065,0.000014534862,0.02762848,0.4717305,0.0031175162,0.11874194,0.037913516,0.30472344],"study_design_scores_gemma":[0.000069181886,0.0000723408,0.0012982419,0.0000105653535,9.492937e-7,0.000002447716,0.000020371761,0.9886972,0.007954394,0.0016707242,0.00013662713,0.000066989494],"about_ca_topic_score_codex":0.0000064729857,"about_ca_topic_score_gemma":9.095002e-7,"teacher_disagreement_score":0.7424616,"about_ca_system_score_codex":0.0000054341367,"about_ca_system_score_gemma":0.000015097358,"threshold_uncertainty_score":0.21551245},"labels":[],"label_agreement":null},{"id":"W4392974073","doi":"10.48550/arxiv.2403.11522","title":"LOOPer: A Learned Automatic Code Optimizer For Polyhedral Compilers","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tamkeen; York University; Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology; New York University Abu Dhabi","keywords":"Compiler; Computer science; Parallel computing; Programming language; Code (set theory); Code generation; Operating system; Key (lock); Set (abstract data type)","score_opus":0.09292394086744711,"score_gpt":0.23134222849322367,"score_spread":0.13841828762577657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392974073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011032483,0.00013975998,0.9810547,0.0005610119,0.0007950474,0.00064690365,0.00003537783,0.0026921423,0.0030425242],"genre_scores_gemma":[0.8197733,0.00012982826,0.175909,0.00023347663,0.0000866698,0.0000070115248,0.000037244554,0.000044408152,0.0037790418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767923,0.00013450683,0.00030511362,0.00131867,0.000106561776,0.00045592996],"domain_scores_gemma":[0.9980646,0.0001715289,0.00022755105,0.0011701789,0.00019029077,0.00017587481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036001235,0.0004042538,0.00047452023,0.0004188588,0.00020578476,0.0003785037,0.0021503472,0.0003407736,0.00002221719],"category_scores_gemma":[0.000044886438,0.00044900476,0.0003819768,0.0005875015,0.000112952286,0.00017972199,0.002806113,0.00062597834,0.000106053805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001835574,0.000066969485,0.000034649016,0.0002192646,0.00012811883,0.000077827244,0.0002458965,0.8884497,0.000007829894,0.10163178,0.0070718294,0.0020477427],"study_design_scores_gemma":[0.00040436754,0.00006937876,0.000018539084,0.0001978395,0.00007557046,0.0000061376236,0.000018264811,0.9439879,0.00008863879,0.05367871,0.00096920785,0.00048546935],"about_ca_topic_score_codex":0.00004349938,"about_ca_topic_score_gemma":0.000006794655,"teacher_disagreement_score":0.80874085,"about_ca_system_score_codex":0.00022182758,"about_ca_system_score_gemma":0.00033410176,"threshold_uncertainty_score":0.99979615},"labels":[],"label_agreement":null},{"id":"W4393086030","doi":"10.1016/j.softx.2024.101687","title":"A C++17 thread pool for high-performance scientific computing","year":2024,"lang":"en","type":"article","venue":"SoftwareX","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Thread (computing); Parallel computing; Distributed computing; Operating system","score_opus":0.019369145537007963,"score_gpt":0.27180941824508076,"score_spread":0.2524402727080728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393086030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013920876,0.00045315805,0.97992885,0.00038502837,0.0013095692,0.00023959522,0.0000050636536,0.00339265,0.0003651973],"genre_scores_gemma":[0.6312734,0.0000064281576,0.36707783,0.00013950471,0.00010789579,0.00001544845,0.0000120852665,0.000013365189,0.0013540472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986194,0.000021784099,0.00022983199,0.0005586488,0.00022176167,0.00034859538],"domain_scores_gemma":[0.9990871,0.00020557288,0.000049544626,0.0004636538,0.00013092192,0.00006321689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005805763,0.00014553667,0.0001424976,0.00020851001,0.0004201019,0.0009426747,0.00079494156,0.000061399325,0.000007709912],"category_scores_gemma":[0.000057510606,0.00013387858,0.00006524777,0.0006738005,0.000068029665,0.00042765235,0.0002400601,0.0001218694,0.00006371921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012108112,0.000110392124,0.00066617015,0.00048617617,0.00007377945,0.000021070378,0.0021639925,0.043074477,0.0003595829,0.18141074,0.1811299,0.5904916],"study_design_scores_gemma":[0.0001325637,0.00008498991,0.0003151277,0.00017584921,0.000005207895,0.00001371695,0.0000028916118,0.96428436,0.0040324796,0.01272159,0.017988272,0.00024297657],"about_ca_topic_score_codex":0.000005079097,"about_ca_topic_score_gemma":5.174997e-7,"teacher_disagreement_score":0.9212099,"about_ca_system_score_codex":0.00004645096,"about_ca_system_score_gemma":0.00013418721,"threshold_uncertainty_score":0.9090234},"labels":[],"label_agreement":null},{"id":"W4393160711","doi":"10.1609/aaai.v38i20.30591","title":"Program Synthesis with Best-First Bottom-Up Search (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reprint; Computer science; Physics","score_opus":0.08172566426243245,"score_gpt":0.32681051038839154,"score_spread":0.2450848461259591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20481849,0.0002530285,0.6699478,0.026061784,0.0015031664,0.0033231543,0.000012174422,0.0050342935,0.08904609],"genre_scores_gemma":[0.9549485,0.00009496627,0.044320285,0.000048896763,0.000055745702,0.00010055403,2.2861025e-7,0.000019302513,0.0004115458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777853,0.000016279824,0.0004719246,0.0007247166,0.0006151698,0.00039338655],"domain_scores_gemma":[0.99847287,0.00021335157,0.00016198542,0.00043547057,0.0006139246,0.00010237704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007541905,0.0002526138,0.00024652787,0.00021185876,0.00025461544,0.0009176568,0.0021635564,0.00010301799,0.00004981392],"category_scores_gemma":[0.00027210187,0.00017131506,0.000118491735,0.0010907478,0.00029418094,0.0004611867,0.00040634975,0.0004986825,0.00013623982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004635585,0.00022714719,0.00012357235,0.00016829759,0.00003510676,0.0000035262997,0.0012365567,0.00065036153,0.0019314563,0.6244063,0.00035615545,0.3708152],"study_design_scores_gemma":[0.000013460264,0.00036831407,0.00010878145,0.0013073733,0.000020589774,0.000020038511,0.0002407889,0.39435962,0.5759935,0.026730258,0.00050995365,0.00032734737],"about_ca_topic_score_codex":0.00007213912,"about_ca_topic_score_gemma":0.000007182781,"teacher_disagreement_score":0.75013,"about_ca_system_score_codex":0.00006005329,"about_ca_system_score_gemma":0.0001949865,"threshold_uncertainty_score":0.8848986},"labels":[],"label_agreement":null},{"id":"W4393400166","doi":"","title":"Mesh partitioning for load balancing multiphysics simulations","year":2023,"lang":"en","type":"dissertation","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multiphysics; Computer science; Load balancing (electrical power); Parallel computing; Distributed computing; Computational science; Engineering; Finite element method; Structural engineering; Mathematics; Geometry","score_opus":0.015768190750793085,"score_gpt":0.2624800980225295,"score_spread":0.2467119072717364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393400166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039967503,0.00022528827,0.98166996,0.0010876877,0.00043018733,0.0005416652,0.000034778855,0.0021354344,0.009878237],"genre_scores_gemma":[0.27949053,0.00022457841,0.6693008,0.00011779114,0.00007486759,0.00024093222,0.0030821194,0.00011793007,0.04735043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967514,0.0010649989,0.0005520086,0.0007671846,0.0004700594,0.00039432515],"domain_scores_gemma":[0.9924501,0.0022001448,0.0005486478,0.001345397,0.003331305,0.00012436963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024950262,0.0003147432,0.00034114934,0.00022384152,0.00077292084,0.0006096065,0.0013099822,0.00025145142,0.0000134202855],"category_scores_gemma":[0.0018969998,0.00037064133,0.00022045671,0.00079242466,0.00004420021,0.0003307145,0.00021417528,0.00030711645,0.00003973876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004100167,0.0010767179,0.00080603163,0.0009026246,0.0003635415,0.000009740405,0.06374665,0.029105011,0.0047806874,0.6691892,0.027836688,0.20214209],"study_design_scores_gemma":[0.00043671415,7.1178636e-7,0.00070863107,0.0012426091,0.000031745956,0.0000014587217,0.00009707321,0.9548388,0.024252055,0.011886431,0.0059860656,0.00051770103],"about_ca_topic_score_codex":0.00022118581,"about_ca_topic_score_gemma":0.0011557017,"teacher_disagreement_score":0.9257338,"about_ca_system_score_codex":0.00014806412,"about_ca_system_score_gemma":0.00042404913,"threshold_uncertainty_score":0.99987453},"labels":[],"label_agreement":null},{"id":"W4393447342","doi":"10.5281/zenodo.8178792","title":"Code and experimental data for the ECAI 2023 paper \"PARIS: Planning Algorithms for Reconfiguring Independent Sets\"","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Horizon 2020 Framework Programme","keywords":"Code (set theory); Computer science; Algorithm; Data mining; Programming language; Set (abstract data type)","score_opus":0.10573251716649815,"score_gpt":0.3323664484459542,"score_spread":0.22663393127945605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393447342","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003291469,0.00058526127,0.37117985,0.00065375696,0.0003704986,0.0012284106,0.6245954,0.0010498301,0.00033371118],"genre_scores_gemma":[0.00008599224,0.00055204437,0.014427559,0.00030165137,0.0003329609,0.0000021491082,0.9829445,0.0007852598,0.00056789164],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976418,0.00019204043,0.0003783525,0.0009597028,0.00038066698,0.0004474057],"domain_scores_gemma":[0.9975412,0.00023758525,0.00024164507,0.0015594552,0.00028989234,0.00013023165],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016080997,0.00025786093,0.00024909282,0.0002331551,0.0027768612,0.0020712533,0.0044850255,0.00015842215,0.00017993615],"category_scores_gemma":[0.0005274698,0.00023460352,0.000057459638,0.0003349418,0.000099799545,0.00043734917,0.0054217353,0.00036826485,0.0005110834],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021934558,0.00003896089,4.6063672e-8,0.00007400439,0.00006619103,0.0000048533125,0.00018514069,0.00075203495,0.000020309595,0.00010971857,0.98654723,0.012179559],"study_design_scores_gemma":[0.0004094967,0.00016811422,0.0000056947183,0.000080997415,0.000020817772,0.00004186871,0.00010782874,0.11014446,0.00006876949,0.000075622964,0.8886242,0.0002521497],"about_ca_topic_score_codex":0.00005082328,"about_ca_topic_score_gemma":9.782713e-7,"teacher_disagreement_score":0.3583491,"about_ca_system_score_codex":0.00009410247,"about_ca_system_score_gemma":0.000013438147,"threshold_uncertainty_score":0.99896467},"labels":[],"label_agreement":null},{"id":"W4393496013","doi":"10.5281/zenodo.1230381","title":"Initial Spread Index - Era-Interim","year":2018,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interim; Index (typography); Geography; Computer science; World Wide Web; Archaeology","score_opus":0.04266721557713495,"score_gpt":0.2944337321404434,"score_spread":0.25176651656330845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393496013","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001018887,0.000050675986,0.390292,0.00038085046,0.00057594624,0.00047123485,0.5856301,0.0031763054,0.019412681],"genre_scores_gemma":[0.00070570764,0.00014015844,0.005644367,0.00048625525,0.0006014493,7.7408416e-8,0.99133384,0.0007924581,0.00029568354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717844,0.00051024166,0.00041979266,0.0008293775,0.0005687097,0.0004934189],"domain_scores_gemma":[0.99719065,0.00003273679,0.00028624813,0.0014793582,0.0007955385,0.00021548779],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075194886,0.00030824734,0.00028696828,0.0005693949,0.0018907434,0.002375235,0.005182506,0.00024617126,0.0046602576],"category_scores_gemma":[0.0004876684,0.00033299916,0.000096389624,0.00075190817,0.00022351323,0.00040974474,0.0051115565,0.0006582929,0.008049019],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001569445,0.0000923685,5.0147477e-8,0.000043937725,0.000030453077,0.00002227129,0.00009438692,0.000036692734,0.000010124696,0.00035377077,0.98434055,0.014959727],"study_design_scores_gemma":[0.00024255307,0.00033613114,0.00000836292,0.00008434416,0.000009584588,0.00013893751,0.000005422752,0.0033121598,0.00009618217,0.00025772673,0.9951569,0.0003517132],"about_ca_topic_score_codex":0.000048569975,"about_ca_topic_score_gemma":5.5437897e-7,"teacher_disagreement_score":0.40570372,"about_ca_system_score_codex":0.0001533806,"about_ca_system_score_gemma":0.000014948085,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W4393539234","doi":"10.5281/zenodo.1068888","title":"Initial Spread Index - Era-Interim","year":2017,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interim; Index (typography); Geography; Computer science; World Wide Web; Archaeology","score_opus":0.05197416368951257,"score_gpt":0.31440121051279846,"score_spread":0.2624270468232859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393539234","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000077173745,0.00008251936,0.3609637,0.0006031134,0.00065010926,0.0005383349,0.60086274,0.0029594349,0.033332307],"genre_scores_gemma":[0.0013162184,0.00019291085,0.0034759655,0.00030916027,0.00042048993,8.35607e-8,0.99297583,0.00075744896,0.00055189995],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973432,0.0004286518,0.00038133893,0.0008103756,0.0005557836,0.0004806927],"domain_scores_gemma":[0.99656725,0.000030192192,0.0004129055,0.0021447649,0.0006284473,0.00021642515],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00075510686,0.00030919717,0.0003131518,0.00049520505,0.003233988,0.004174374,0.0073699676,0.0002492223,0.002654831],"category_scores_gemma":[0.00070803706,0.00033619755,0.00010657204,0.00032558528,0.00020527821,0.0005447904,0.0060619535,0.000789039,0.008547129],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013225769,0.000082948376,8.382556e-8,0.000048464848,0.00003055159,0.000039790226,0.00007353171,0.000058595404,0.000008402235,0.00034406307,0.96702254,0.032277826],"study_design_scores_gemma":[0.0002678467,0.0002027162,0.000019647634,0.00010129704,0.000010270532,0.00014275512,0.000004632716,0.0027879623,0.000052031955,0.000251688,0.9958031,0.00035601767],"about_ca_topic_score_codex":0.00006643422,"about_ca_topic_score_gemma":6.803941e-7,"teacher_disagreement_score":0.39211306,"about_ca_system_score_codex":0.00014062838,"about_ca_system_score_gemma":0.000016912147,"threshold_uncertainty_score":0.999909},"labels":[],"label_agreement":null},{"id":"W4393549379","doi":"10.5281/zenodo.10404174","title":"Data for An Approximate Skolem Funcion Counter (AAAI-24 paper)","year":2023,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.0979095220511578,"score_gpt":0.3050806920322731,"score_spread":0.20717116998111532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393549379","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013191417,0.000043222066,0.32686043,0.0003628965,0.0003484056,0.0006477558,0.667801,0.0027920108,0.0011429533],"genre_scores_gemma":[0.000017789142,0.00030584817,0.011858762,0.00040224154,0.00034365072,3.2536545e-7,0.9854633,0.001028782,0.0005792613],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99653244,0.00042993043,0.00048078556,0.0013380846,0.00063163874,0.0005870964],"domain_scores_gemma":[0.9951153,0.000070612376,0.00030322373,0.0035266813,0.0007563178,0.0002279072],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019563376,0.00033511582,0.00032426495,0.00042995004,0.002056467,0.0026427493,0.009045745,0.00023181677,0.00049356965],"category_scores_gemma":[0.0007294667,0.00035126688,0.00007236244,0.0007533148,0.00010856835,0.0010426027,0.0073755225,0.00047151488,0.0067724087],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000210934,0.00010729721,1.8632699e-8,0.00014682762,0.00003475783,0.0000074613113,0.000074626645,0.0001749239,0.000026081083,0.0006587907,0.9868482,0.011899927],"study_design_scores_gemma":[0.00030926714,0.00031424483,0.0000028440172,0.000073601455,0.00002059307,0.00004010663,0.000021149575,0.053970523,0.000012999927,0.0003169752,0.9445412,0.00037650258],"about_ca_topic_score_codex":0.000038362334,"about_ca_topic_score_gemma":0.000002529396,"teacher_disagreement_score":0.31766236,"about_ca_system_score_codex":0.00013701,"about_ca_system_score_gemma":0.000018207273,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W4393573526","doi":"10.5281/zenodo.10404173","title":"Data for An Approximate Skolem Funcion Counter (AAAI-24 paper)","year":2024,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.07655243855782126,"score_gpt":0.2997075183814828,"score_spread":0.22315507982366153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393573526","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010858557,0.0001528102,0.29792538,0.00044165843,0.00041053802,0.00062429724,0.69573617,0.0022411703,0.0024668924],"genre_scores_gemma":[0.00004040985,0.0003101063,0.014170269,0.0004710498,0.00040388448,2.915562e-7,0.98320854,0.00093902915,0.00045641483],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966168,0.00036374095,0.0004715785,0.0014196206,0.00059254083,0.0005357207],"domain_scores_gemma":[0.99552155,0.000047906604,0.00022385495,0.0033368256,0.0006488994,0.00022097467],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016975662,0.0003506075,0.0003118077,0.00042137128,0.0015852221,0.0038199204,0.008278641,0.0002312697,0.0011407982],"category_scores_gemma":[0.00042787025,0.00035263054,0.00007907827,0.0006331053,0.00010968604,0.0010501932,0.007404272,0.0005693166,0.007755246],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019370584,0.00010937713,1.1102809e-8,0.00025594042,0.000041987358,0.000009664888,0.000098086144,0.00009810538,0.000029627905,0.0011010418,0.98368734,0.014549471],"study_design_scores_gemma":[0.00022139351,0.00032071583,6.917312e-7,0.00011078968,0.000032664102,0.000074159194,0.000018976596,0.061674908,0.000017597195,0.0005309248,0.93661964,0.00037751097],"about_ca_topic_score_codex":0.000015019202,"about_ca_topic_score_gemma":0.0000013752341,"teacher_disagreement_score":0.2874724,"about_ca_system_score_codex":0.00015004951,"about_ca_system_score_gemma":0.00002051324,"threshold_uncertainty_score":0.9998926},"labels":[],"label_agreement":null},{"id":"W4393610034","doi":"10.5281/zenodo.10460738","title":"Are Prompt Engineering and TODO Comments Friends or Foes? An Evaluation on GitHub Copilot","year":2024,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Aeronautics; Computer security; Engineering","score_opus":0.06929803995441347,"score_gpt":0.3037986320660986,"score_spread":0.2345005921116851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393610034","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054166047,0.00044355818,0.10050649,0.002227695,0.0013224966,0.0033842195,0.8767526,0.008946345,0.005874893],"genre_scores_gemma":[0.0029649318,0.00025407865,0.0060341437,0.00063635834,0.0003403668,8.3993774e-7,0.98831016,0.0011826018,0.0002765002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974737,0.0003827544,0.00031214606,0.00080320594,0.0006928797,0.00033526868],"domain_scores_gemma":[0.99812776,0.00003980162,0.00022747884,0.00092583813,0.00047906782,0.00020005359],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011112248,0.00028139932,0.00023881345,0.00053884165,0.0009927475,0.0023664194,0.001828444,0.00014580252,0.0010098796],"category_scores_gemma":[0.0005019193,0.0002649293,0.00003704016,0.00065459684,0.000055254895,0.000376442,0.0019448218,0.0005024813,0.0024670518],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018777702,0.00010159246,1.2931022e-7,0.00013896031,0.00003681191,0.000020045816,0.00014429513,0.0008538084,0.000010628162,0.00028376703,0.9844002,0.013990954],"study_design_scores_gemma":[0.0002595743,0.00049989833,0.000037195205,0.00024189593,0.000028693736,0.000061981635,0.00001655044,0.07582864,0.000035881658,0.00008617969,0.92262244,0.00028108078],"about_ca_topic_score_codex":0.000008309698,"about_ca_topic_score_gemma":5.2271554e-7,"teacher_disagreement_score":0.111557536,"about_ca_system_score_codex":0.00020207552,"about_ca_system_score_gemma":0.000011302635,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4393823638","doi":"10.5281/zenodo.4574249","title":"ToC2ME Velocity Model","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Computer science","score_opus":0.04392269737213553,"score_gpt":0.265927920665321,"score_spread":0.22200522329318548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393823638","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023226792,0.00009626855,0.5703594,0.0003874332,0.00013170362,0.00024195966,0.41872907,0.0017247509,0.008327102],"genre_scores_gemma":[0.00006228041,0.00034448822,0.027201926,0.00044548066,0.0001371551,6.0785716e-8,0.97063005,0.00059976295,0.0005787862],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744445,0.0004018678,0.00035084895,0.00081447576,0.0005565689,0.00043178935],"domain_scores_gemma":[0.9972134,0.000026188727,0.00021045201,0.0015154093,0.00083641947,0.0001981127],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00069687486,0.00026100565,0.00027822997,0.00032301198,0.0019577472,0.00211157,0.004176163,0.00021220814,0.0016935653],"category_scores_gemma":[0.0005152673,0.00029337406,0.0001012696,0.0007863043,0.00009476682,0.00031576818,0.004986215,0.00060174515,0.003129999],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003742602,0.000086665204,7.460459e-9,0.000052486936,0.00002271147,0.000020395673,0.00007431476,0.0026061658,0.000013662721,0.0010311361,0.98253864,0.013550054],"study_design_scores_gemma":[0.0001422916,0.000064730666,0.0000014473624,0.000049400893,0.000009125161,0.00007588801,0.0000056396107,0.08567907,0.00005332187,0.00036039206,0.9132704,0.0002882947],"about_ca_topic_score_codex":0.000015687632,"about_ca_topic_score_gemma":2.2688455e-7,"teacher_disagreement_score":0.551901,"about_ca_system_score_codex":0.00018016416,"about_ca_system_score_gemma":0.000021502232,"threshold_uncertainty_score":0.99995184},"labels":[],"label_agreement":null},{"id":"W4393931333","doi":"10.1145/3642961.3643800","title":"Enhancing Intra-Node GPU-to-GPU Performance in MPI+UCX through Multi-Path Communication","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Computer science; PCI Express; Speedup; Parallel computing; Node (physics); CUDA; Host (biology); Solver; Path (computing); Message passing; Computer network; Embedded system; Field-programmable gate array","score_opus":0.02452949154640401,"score_gpt":0.29373286349845246,"score_spread":0.26920337195204846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393931333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010096812,0.0004126118,0.98032355,0.0013359643,0.0001663414,0.00018114582,4.6546123e-7,0.0012492874,0.006233811],"genre_scores_gemma":[0.49504292,0.00017044402,0.5038455,0.00052081444,0.000014071154,0.000017739767,0.0000022790432,0.000007524685,0.00037867826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879295,0.00008660387,0.00032265292,0.0003719776,0.00016448727,0.00026135368],"domain_scores_gemma":[0.99906695,0.000100415906,0.000037665468,0.0006862955,0.00005800839,0.000050670424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051478576,0.00013986806,0.00014373493,0.00017150868,0.000121703255,0.00026822608,0.0009673474,0.00006798242,0.000013221097],"category_scores_gemma":[0.00003739614,0.00012894144,0.00003549912,0.00083283766,0.000025662273,0.0007307059,0.00041411465,0.00023960201,0.00013309246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034496457,0.00086195575,0.007142359,0.0007160313,0.000090988695,0.000066466775,0.07224093,0.26485068,0.008626114,0.32922602,0.023227565,0.29291642],"study_design_scores_gemma":[0.00011036686,0.000037870537,0.0011230746,0.00028086078,0.0000014513523,0.000007201835,0.000030883984,0.97688615,0.015681127,0.0006027504,0.005031463,0.00020678842],"about_ca_topic_score_codex":0.00010766668,"about_ca_topic_score_gemma":0.000052982203,"teacher_disagreement_score":0.7120355,"about_ca_system_score_codex":0.000093705756,"about_ca_system_score_gemma":0.00007142023,"threshold_uncertainty_score":0.5258079},"labels":[],"label_agreement":null},{"id":"W4394423464","doi":"10.6084/m9.figshare.23937954","title":"Column header definitions for all data files","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University and Génome Québec Innovation Centre","funders":"","keywords":"Header; Column (typography); Computer science; Database; Computer network","score_opus":0.28927371628169085,"score_gpt":0.3613967167868796,"score_spread":0.07212300050518877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394423464","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.791967e-10,0.0001222854,0.008565779,0.00031211617,0.00017509531,0.00041729768,0.9893776,0.00095126807,0.000078518824],"genre_scores_gemma":[4.5875886e-8,0.0000491312,0.03654791,0.00081232854,0.00019933883,0.0005381541,0.96162844,0.00002201738,0.00020262938],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984399,0.000043059856,0.0002618429,0.00071290246,0.00022118265,0.0003210744],"domain_scores_gemma":[0.9967504,0.0005780502,0.00018728853,0.0022434874,0.00015465141,0.00008609722],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010402818,0.00022086674,0.00023942401,0.0001656722,0.00020670315,0.0003881568,0.0042081797,0.0002531664,0.0035599947],"category_scores_gemma":[0.0013888163,0.00023987568,0.000079630314,0.0003102963,0.0000061117576,0.00024536953,0.0020838745,0.00022907321,0.007166711],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.76049e-7,0.000019653036,9.653665e-9,0.00016406433,0.000018958823,0.0000067253013,0.0000043595305,0.000102865924,2.349184e-8,0.000023322176,0.9994488,0.00021077017],"study_design_scores_gemma":[0.00008252891,0.00002958989,0.000002108051,0.00079062965,0.000010059723,0.0000053231656,9.387273e-7,0.028695434,0.0000024231583,0.00038987564,0.9697109,0.00028017597],"about_ca_topic_score_codex":0.000037382935,"about_ca_topic_score_gemma":0.000062440144,"teacher_disagreement_score":0.02973786,"about_ca_system_score_codex":0.000026394173,"about_ca_system_score_gemma":0.00019638386,"threshold_uncertainty_score":0.9973509},"labels":[],"label_agreement":null},{"id":"W4394487980","doi":"10.6084/m9.figshare.22229713","title":"Can-SWaP_V1","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Swap (finance); Interest rate swap; Computer science; Business; Finance","score_opus":0.0478446055144977,"score_gpt":0.2894698926460575,"score_spread":0.24162528713155978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394487980","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7245991e-9,0.00006819695,0.000371268,0.00019220164,0.00020899011,0.00013411429,0.99740255,0.0014083728,0.0002143141],"genre_scores_gemma":[1.2665767e-7,0.000019590403,0.0023733033,0.00047204443,0.00016892489,0.00012661365,0.9961729,0.000015634952,0.00065088127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874765,0.000044959543,0.00019333595,0.00046099606,0.000278602,0.0002744891],"domain_scores_gemma":[0.99847746,0.00013255743,0.00015911924,0.0010379137,0.00010691434,0.0000860472],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000052658994,0.00021617199,0.00020617069,0.00020122033,0.00010414257,0.0002643537,0.002240078,0.00024786717,0.0061896895],"category_scores_gemma":[0.00054235343,0.00021719314,0.000087693676,0.00048465567,0.0000029313535,0.00008510984,0.0010156027,0.00030995384,0.03369366],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2747775e-7,0.000006614868,1.5380905e-8,0.00007417967,0.000006513303,0.000040092298,0.00000408759,0.00013244081,1.8840604e-8,0.000006191086,0.99930525,0.0004244949],"study_design_scores_gemma":[0.0000359736,0.000017209959,0.000004932378,0.0007700426,0.00000208184,0.0000059529475,2.5473156e-7,0.0035239938,0.000010034719,0.0001281514,0.995248,0.000253371],"about_ca_topic_score_codex":0.00006335657,"about_ca_topic_score_gemma":0.000027013422,"teacher_disagreement_score":0.027503971,"about_ca_system_score_codex":0.000042128744,"about_ca_system_score_gemma":0.00016510367,"threshold_uncertainty_score":0.9947188},"labels":[],"label_agreement":null},{"id":"W4394562082","doi":"10.6084/m9.figshare.22229713.v1","title":"Can-SWaP_V1","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Swap (finance); Computer science; Environmental science; Business; Finance","score_opus":0.0478446055144977,"score_gpt":0.2894698926460575,"score_spread":0.24162528713155978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394562082","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7245991e-9,0.00006819695,0.000371268,0.00019220164,0.00020899011,0.00013411429,0.99740255,0.0014083728,0.0002143141],"genre_scores_gemma":[1.2665767e-7,0.000019590403,0.0023733033,0.00047204443,0.00016892489,0.00012661365,0.9961729,0.000015634952,0.00065088127],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874765,0.000044959543,0.00019333595,0.00046099606,0.000278602,0.0002744891],"domain_scores_gemma":[0.99847746,0.00013255743,0.00015911924,0.0010379137,0.00010691434,0.0000860472],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000052658994,0.00021617199,0.00020617069,0.00020122033,0.00010414257,0.0002643537,0.002240078,0.00024786717,0.0061896895],"category_scores_gemma":[0.00054235343,0.00021719314,0.000087693676,0.00048465567,0.0000029313535,0.00008510984,0.0010156027,0.00030995384,0.03369366],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.2747775e-7,0.000006614868,1.5380905e-8,0.00007417967,0.000006513303,0.000040092298,0.00000408759,0.00013244081,1.8840604e-8,0.000006191086,0.99930525,0.0004244949],"study_design_scores_gemma":[0.0000359736,0.000017209959,0.000004932378,0.0007700426,0.00000208184,0.0000059529475,2.5473156e-7,0.0035239938,0.000010034719,0.0001281514,0.995248,0.000253371],"about_ca_topic_score_codex":0.00006335657,"about_ca_topic_score_gemma":0.000027013422,"teacher_disagreement_score":0.027503971,"about_ca_system_score_codex":0.000042128744,"about_ca_system_score_gemma":0.00016510367,"threshold_uncertainty_score":0.9947188},"labels":[],"label_agreement":null},{"id":"W4394567970","doi":"10.1103/prxquantum.5.020305","title":"Engineering 3D Floquet Codes by Rewinding","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation; Walter Burke Institute for Theoretical Physics; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology; Simons Foundation; U.S. Department of Energy","keywords":"Floquet theory; Computer science; Mathematics; Physics; Quantum mechanics","score_opus":0.011885223682194355,"score_gpt":0.2476546381434792,"score_spread":0.23576941446128485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394567970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011034714,0.0020720046,0.99240845,0.00037920175,0.0006305054,0.000060449824,0.0000026753282,0.002276368,0.0010668403],"genre_scores_gemma":[0.7829072,0.00016977679,0.21587381,0.00012520989,0.00012087169,0.000018281797,0.000009569673,0.000024228322,0.0007510914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992081,0.000023130033,0.00014358226,0.00027706233,0.00013919639,0.00020895057],"domain_scores_gemma":[0.9995751,0.000095675765,0.000019694653,0.00023420189,0.00002349355,0.000051832263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688785,0.00010220214,0.000097219694,0.00011699048,0.00006617289,0.00044075624,0.00041271665,0.000046040586,0.000006690871],"category_scores_gemma":[0.000039345712,0.000097911565,0.000032778047,0.00032996864,0.000009721153,0.0002843815,0.00012630424,0.00013553037,0.00006270118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002243815,0.00004873285,0.000106706255,0.00016781772,0.00005839425,0.00007105169,0.0010744818,0.07809202,0.004272165,0.66193885,0.23464897,0.019518578],"study_design_scores_gemma":[0.000023717206,0.000016691607,0.000012474787,0.00006312543,0.0000020184793,0.000010877892,0.0000017189698,0.9340175,0.0013858995,0.00082285743,0.063518845,0.00012431812],"about_ca_topic_score_codex":0.000012091463,"about_ca_topic_score_gemma":8.171335e-8,"teacher_disagreement_score":0.85592544,"about_ca_system_score_codex":0.00003222377,"about_ca_system_score_gemma":0.000026592064,"threshold_uncertainty_score":0.42502224},"labels":[],"label_agreement":null},{"id":"W4394597245","doi":"10.1109/csce60160.2023.00129","title":"Comparative Analysis of Power Efficiency in Heterogeneous CPU -GPU Processors","year":2023,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Parallel computing; General-purpose computing on graphics processing units; CUDA; Coprocessor; Computer architecture; Operating system; Graphics","score_opus":0.025361721121096817,"score_gpt":0.30717739103719605,"score_spread":0.28181566991609924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394597245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26225367,0.00003377519,0.72990346,0.000086496635,0.00003443632,0.00010198543,0.0000011365678,0.0005399456,0.007045076],"genre_scores_gemma":[0.9810358,0.000007694905,0.018657332,0.000056281868,0.0000017739751,0.0000073322362,0.000003573983,0.0000022510374,0.00022791034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998988,0.000055652614,0.00028050138,0.0002819989,0.00020451621,0.00018934591],"domain_scores_gemma":[0.9993879,0.000084808504,0.00009147528,0.00030233528,0.00009750942,0.00003592182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027159607,0.0000901295,0.0002839813,0.0009167036,0.0000371354,0.000034395398,0.0005750096,0.000036628124,0.000017884642],"category_scores_gemma":[0.00001661104,0.00007841208,0.00008096723,0.00608625,0.00003339421,0.000100339355,0.00016130564,0.00005371941,0.000019646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003456386,0.000105616346,0.0036271221,0.000006245476,0.00008953728,0.000008656915,0.0033317816,0.98715305,0.00014175875,0.0046163755,0.00045080754,0.00046560646],"study_design_scores_gemma":[0.00007738388,0.0000515726,0.006380104,0.0000062449913,0.000010381853,6.890669e-7,0.00003428799,0.98810714,0.0049119373,0.00025931082,0.00006084276,0.00010012587],"about_ca_topic_score_codex":0.00003112697,"about_ca_topic_score_gemma":0.000028659357,"teacher_disagreement_score":0.7187822,"about_ca_system_score_codex":0.000017086672,"about_ca_system_score_gemma":0.00003276692,"threshold_uncertainty_score":0.31975517},"labels":[],"label_agreement":null},{"id":"W4394725346","doi":"10.1016/j.aeue.2024.155284","title":"Process-in-Memory realized by nonvolatile Task-Scheduling and Resource-Sharing XNOR-Net hardware Accelerator architectures","year":2024,"lang":"en","type":"article","venue":"AEU - International Journal of Electronics and Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"XNOR gate; Computer science; Embedded system; Scheduling (production processes); Task (project management); Non-volatile memory; Process (computing); Computer hardware; Computer architecture; Operating system; Logic gate; Engineering; Systems engineering; NAND gate","score_opus":0.014400968803853184,"score_gpt":0.303253514703184,"score_spread":0.28885254589933085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394725346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45913902,0.09561115,0.4225248,0.018052489,0.00027557107,0.00033664823,0.000026414533,0.000326521,0.0037073528],"genre_scores_gemma":[0.97155917,0.0036411625,0.024467794,0.00020251155,0.000045215038,0.000008212866,0.000013803472,0.000011215446,0.0000509346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894476,0.00006921663,0.0003988984,0.00019369149,0.00023339267,0.00016001692],"domain_scores_gemma":[0.99903053,0.0001917176,0.00017396273,0.000340623,0.00019780488,0.000065373446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047131046,0.00011336709,0.0001591321,0.00028061966,0.00012929099,0.0004540448,0.0015323731,0.000050786653,0.0000035490118],"category_scores_gemma":[0.00006174699,0.00010546777,0.000046830286,0.00022347628,0.000051811392,0.0002712571,0.00041160255,0.0004927054,4.8715884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031942906,0.0011921385,0.009253014,0.00030931822,0.001739005,0.00015539625,0.036287535,0.059684,0.012290332,0.36893216,0.010330316,0.49950737],"study_design_scores_gemma":[0.0005901935,0.00015935722,0.00037843923,0.00044441584,0.00001890993,0.00025762146,0.00017412439,0.9392352,0.0013971681,0.032214176,0.02486019,0.00027022004],"about_ca_topic_score_codex":0.000018864366,"about_ca_topic_score_gemma":0.00002107896,"teacher_disagreement_score":0.8795512,"about_ca_system_score_codex":0.00006925401,"about_ca_system_score_gemma":0.0001478743,"threshold_uncertainty_score":0.43783647},"labels":[],"label_agreement":null},{"id":"W4395021872","doi":"10.48550/arxiv.2404.12406","title":"Lowering PyTorch's Memory Consumption for Selective Differentiation","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Canada; Canadian Institute for Advanced Research","keywords":"Consumption (sociology); Computer science; Sociology","score_opus":0.0639449993031951,"score_gpt":0.21478040780780194,"score_spread":0.15083540850460686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395021872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05767816,0.00010318347,0.9387513,0.00005445875,0.0008396177,0.00043916845,0.000013390335,0.001231344,0.0008894039],"genre_scores_gemma":[0.98645705,0.00009357857,0.012118652,0.00003520308,0.00009182038,0.000004684043,0.000035734916,0.000020377147,0.001142876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985351,0.00006422119,0.00017137625,0.0009239532,0.00006646527,0.00023887525],"domain_scores_gemma":[0.9989068,0.00010862681,0.00017820012,0.00054036546,0.00019163777,0.00007438593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002058184,0.00023974008,0.00022938846,0.0003157587,0.00014688296,0.00019948644,0.0007993077,0.00023816556,0.0000044743415],"category_scores_gemma":[0.000028000008,0.00028605352,0.0001900145,0.0002895099,0.0000401063,0.00016631717,0.0012578119,0.0004023024,0.000034239492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005366363,0.00011926715,0.0005515047,0.00058086385,0.0002656084,0.000049124257,0.0007191608,0.8009733,0.00018989512,0.18751994,0.005511712,0.0034659556],"study_design_scores_gemma":[0.00019596475,0.000039005416,0.0003698792,0.00013552589,0.00005503303,0.00000175952,0.0000047931485,0.9027282,0.0020742307,0.09402897,0.000058153095,0.0003085123],"about_ca_topic_score_codex":0.000025627347,"about_ca_topic_score_gemma":0.0000086065265,"teacher_disagreement_score":0.9287789,"about_ca_system_score_codex":0.00026747343,"about_ca_system_score_gemma":0.00012209076,"threshold_uncertainty_score":0.9999592},"labels":[],"label_agreement":null},{"id":"W4396591359","doi":"10.1137/23m1552073","title":"Hybrid Dealiasing of Complex Convolutions","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.04613008819406583,"score_gpt":0.31690233798523304,"score_spread":0.2707722497911672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396591359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030448407,0.000459346,0.96130675,0.00062671193,0.0030797152,0.00008644412,0.0000033947422,0.0005272744,0.0034619293],"genre_scores_gemma":[0.85875255,0.0000072747025,0.14060622,0.000087190194,0.00015989903,2.963234e-7,0.0000030952033,0.000011081014,0.00037241715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977093,0.00017244436,0.0006349385,0.0004720872,0.0006255334,0.00038572992],"domain_scores_gemma":[0.99850696,0.00031261385,0.00023935088,0.00044960197,0.00033665364,0.00015479916],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022599008,0.00016491486,0.00023344376,0.000726209,0.0007559118,0.001703911,0.0010616822,0.000034407753,0.000031119223],"category_scores_gemma":[0.00011198323,0.00014798551,0.00019076178,0.0010779554,0.00016804879,0.00036953154,0.00028603492,0.00039993977,0.00007613581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012383405,0.00029272612,0.00019520476,0.00017177967,0.00014049636,0.00034083912,0.0029541596,0.20533231,0.010413567,0.339157,0.12257187,0.31841767],"study_design_scores_gemma":[0.00011685226,0.000074204465,0.00020024252,0.00042799005,0.0000062833924,0.00048192797,0.000019240348,0.96805876,0.0026776474,0.006009925,0.021753589,0.00017335628],"about_ca_topic_score_codex":0.000002181173,"about_ca_topic_score_gemma":1.915488e-7,"teacher_disagreement_score":0.8283041,"about_ca_system_score_codex":0.000102611746,"about_ca_system_score_gemma":0.00025717827,"threshold_uncertainty_score":0.9993324},"labels":[],"label_agreement":null},{"id":"W4396661957","doi":"10.1051/epjconf/202429507024","title":"HEPScore: A new CPU benchmark for the WLCG","year":2024,"lang":"en","type":"article","venue":"EPJ Web of Conferences","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics; University of Victoria","funders":"","keywords":"Benchmark (surveying); National laboratory; Resource (disambiguation); Software; Procurement; Computer science; Operating system; Physics; Business","score_opus":0.03219257986751806,"score_gpt":0.29030002148987,"score_spread":0.25810744162235194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396661957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003194771,0.0022521014,0.9792196,0.0043742913,0.0005242469,0.0001790444,0.0000025807442,0.00032274539,0.012805904],"genre_scores_gemma":[0.91552263,0.00020972056,0.082653284,0.00014386568,0.00011898858,0.000017204022,0.00000201238,0.00000426884,0.0013280262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925053,0.000026393496,0.00019245199,0.00022118379,0.00016519178,0.00014424649],"domain_scores_gemma":[0.9990243,0.00051311566,0.000056049856,0.0002835556,0.00008181583,0.000041174004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030584674,0.000092838956,0.00012506198,0.00007793314,0.00008138041,0.00025505744,0.0008860245,0.000039929844,0.00005130069],"category_scores_gemma":[0.000059274706,0.00005909951,0.00008104175,0.0002805428,0.00005843081,0.00015573388,0.00010557066,0.00007511881,0.0000073738365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042891365,0.000016511683,0.00013238721,0.000032827647,0.00003598867,0.0000012231066,0.00052757334,0.00046862994,0.000068779686,0.7743286,0.07901882,0.14536436],"study_design_scores_gemma":[0.00009629593,0.0001464439,0.00021188629,0.00010142987,0.000010377189,0.0000036690014,0.00002614498,0.7176254,0.0021534825,0.04542919,0.23407643,0.00011929673],"about_ca_topic_score_codex":0.000066373366,"about_ca_topic_score_gemma":0.000011550698,"teacher_disagreement_score":0.91520315,"about_ca_system_score_codex":0.00000627413,"about_ca_system_score_gemma":0.00096474955,"threshold_uncertainty_score":0.24595247},"labels":[],"label_agreement":null},{"id":"W4398156963","doi":"10.4230/lipics.disc.2024.23","title":"Lock-Free Augmented Trees","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Hellenic Foundation for Research and Innovation","keywords":"Lock (firearm); Computer science; Geography","score_opus":0.05246337368983447,"score_gpt":0.19408070665512742,"score_spread":0.14161733296529294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398156963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110122105,0.0002453253,0.9707282,0.00038055883,0.0007484866,0.0002063381,0.000013215862,0.0024479462,0.01421773],"genre_scores_gemma":[0.96887994,0.00018281463,0.022726612,0.00012830271,0.000084641906,0.0000011394666,0.000014052487,0.000023012723,0.007959486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981685,0.0001048272,0.00019809447,0.0011206778,0.0001029007,0.00030494665],"domain_scores_gemma":[0.9976907,0.00006055882,0.00014835504,0.0018429252,0.00012630684,0.0001311533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002046865,0.0003092838,0.00027871982,0.00039229763,0.00012036455,0.00025955093,0.0031842617,0.00026558878,0.00002128367],"category_scores_gemma":[0.000032944936,0.00034671312,0.00022102536,0.000711663,0.00007175925,0.00014263809,0.007305002,0.00063985493,0.00015949667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001056572,0.000082652536,0.00018090464,0.00009679526,0.0001258905,0.0004379436,0.00019713596,0.5744242,0.000012767356,0.3964206,0.02665964,0.0013508929],"study_design_scores_gemma":[0.00016872429,0.000030743577,0.00007323512,0.00013223554,0.000033745804,0.0000039332713,0.00000796601,0.78348535,0.00017233753,0.21421823,0.0013444703,0.00032900466],"about_ca_topic_score_codex":0.000088436616,"about_ca_topic_score_gemma":0.000022161039,"teacher_disagreement_score":0.95786774,"about_ca_system_score_codex":0.00017446348,"about_ca_system_score_gemma":0.00018359725,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W4398875996","doi":"10.7910/dvn/q20fb7","title":"Replication Data for: Unveiling The Electoral Consequences of an Exogenous Mid-Campaign Court Ruling","year":2020,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Replication (statistics); Computer science; Computational biology; Biology; Virology","score_opus":0.06401086658734421,"score_gpt":0.30979836027234925,"score_spread":0.24578749368500502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398875996","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000675152,0.0000059465037,0.35899296,0.000049749684,0.0001870117,0.00040247646,0.64016914,0.0001802257,0.0000057599214],"genre_scores_gemma":[0.00014644132,0.00016113247,0.14470954,0.00044664415,0.00017870648,0.000027433229,0.8543099,0.000014124233,0.0000060645443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973323,0.00023939874,0.00057566736,0.0011621021,0.00038969424,0.0003008663],"domain_scores_gemma":[0.991298,0.0003081605,0.0006854346,0.0073747435,0.0002195869,0.00011402875],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0014058294,0.000281348,0.00039485743,0.00011687424,0.00031333533,0.00029459098,0.007702205,0.00017916743,0.000052098327],"category_scores_gemma":[0.0008334098,0.00023561904,0.00007549125,0.0003619385,0.00018073335,0.00069744897,0.001377959,0.00030512697,0.00042229067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001928403,0.000043572687,0.0000017577312,0.00007511434,0.000037462894,0.0000065970385,0.00005251833,0.0008269145,0.00017583667,0.0001503064,0.9976558,0.00095482304],"study_design_scores_gemma":[0.00014728635,0.00011815284,0.0000015135679,0.000058017224,0.00005599094,0.000021395947,0.000017416263,0.10711679,0.0010775196,0.00025009035,0.8908958,0.0002400404],"about_ca_topic_score_codex":0.00027141685,"about_ca_topic_score_gemma":0.000044031647,"teacher_disagreement_score":0.21428342,"about_ca_system_score_codex":0.000044812186,"about_ca_system_score_gemma":0.0004907421,"threshold_uncertainty_score":0.9976666},"labels":[],"label_agreement":null},{"id":"W4399648268","doi":"10.32614/cran.package.rmumps","title":"rmumps: Wrapper for MUMPS Library","year":2015,"lang":"en","type":"dataset","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.029238064302100155,"score_gpt":0.2815640659460803,"score_spread":0.25232600164398017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399648268","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7514057e-8,0.00014416053,0.49805963,0.0003758063,0.00034242554,0.00024033185,0.498298,0.00083842146,0.0017011954],"genre_scores_gemma":[2.706481e-7,0.00010014767,0.32630897,0.0014016274,0.00018937525,0.000049522696,0.66926026,0.000012984139,0.0026768271],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857855,0.000052141626,0.00029156322,0.00054115674,0.00024585344,0.00029073306],"domain_scores_gemma":[0.99837786,0.00010579418,0.00014952106,0.0011206362,0.000103697734,0.00014249446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024266084,0.00025981446,0.0002971658,0.00022553027,0.00009756744,0.00037463233,0.002294683,0.00028439634,0.00008012949],"category_scores_gemma":[0.000051207207,0.00022207474,0.00011782092,0.00026117096,0.000029332281,0.000485811,0.0007189019,0.00018889691,0.00016935111],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025574184,0.000031727715,3.3681115e-7,0.00003088155,0.000011906547,0.0000024962058,0.0000071183413,0.000088695626,1.1667167e-7,0.0011543595,0.9975243,0.0011454822],"study_design_scores_gemma":[0.00015369646,0.00008684587,3.5105882e-7,0.00002935874,0.000006944327,0.000005584268,9.533167e-7,0.018210297,0.00005326356,0.003782279,0.9773608,0.00030964488],"about_ca_topic_score_codex":0.00001794534,"about_ca_topic_score_gemma":0.0000015665462,"teacher_disagreement_score":0.17175068,"about_ca_system_score_codex":0.00001970001,"about_ca_system_score_gemma":0.00026987735,"threshold_uncertainty_score":0.90559447},"labels":[],"label_agreement":null},{"id":"W4399836999","doi":"10.48550/arxiv.2406.12110","title":"CacheSquash: Making caches speculation-aware","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Business; Computer network","score_opus":0.09236074501883755,"score_gpt":0.21656168082265723,"score_spread":0.12420093580381968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399836999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012905211,0.0001759825,0.9756492,0.00021804347,0.0006560471,0.00021144816,0.000008177773,0.0018204526,0.008355477],"genre_scores_gemma":[0.97833276,0.000055599754,0.019345947,0.000092147035,0.00012152463,0.0000010340061,0.00001713724,0.000025529496,0.0020083326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980765,0.00012072073,0.00022407467,0.0011603532,0.000109616594,0.00030872837],"domain_scores_gemma":[0.9983942,0.00007795299,0.00019177256,0.0010991225,0.00014180863,0.00009516847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025294704,0.00032394796,0.0002840916,0.0004015552,0.00016370157,0.00033656845,0.001614672,0.0003038559,0.000019144625],"category_scores_gemma":[0.000022990938,0.00037930618,0.00022813494,0.00069799175,0.000061190156,0.00017804054,0.0034645298,0.0006847302,0.00015390146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034448758,0.00002884849,0.00044087897,0.00011060836,0.00006186757,0.00025055924,0.00029617175,0.74094814,0.0000041168164,0.2557989,0.0013082208,0.00074825634],"study_design_scores_gemma":[0.00007380453,0.000015347112,0.00015304981,0.00021302728,0.000036281486,0.0000058052033,0.000019792044,0.8751048,0.000108813365,0.1234424,0.0004449588,0.00038194924],"about_ca_topic_score_codex":0.00007128399,"about_ca_topic_score_gemma":0.000015763806,"teacher_disagreement_score":0.9654275,"about_ca_system_score_codex":0.00025892726,"about_ca_system_score_gemma":0.00021832444,"threshold_uncertainty_score":0.9998659},"labels":[],"label_agreement":null},{"id":"W4399851393","doi":"10.1145/3656389","title":"Optimistic Stack Allocation and Dynamic Heapification for Managed Runtimes","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"IBM Canada","keywords":"Stack (abstract data type); Computer science; Parallel computing; Distributed computing; Operating system","score_opus":0.012761576748477128,"score_gpt":0.28833592930975094,"score_spread":0.2755743525612738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399851393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091513634,0.0035165169,0.8833693,0.015409064,0.00034051324,0.0021376759,0.000006742285,0.0026373286,0.0010692115],"genre_scores_gemma":[0.6528468,0.000036580812,0.34665293,0.00004485418,0.000016033971,0.000058803827,0.0000021568403,0.000009944752,0.0003318695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992582,0.00000675767,0.00016303452,0.00029296326,0.0001363276,0.00014268454],"domain_scores_gemma":[0.99935544,0.00012096986,0.00009555567,0.00028709887,0.00011606914,0.000024875499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041013397,0.000103866325,0.000100878904,0.00010871986,0.000118215066,0.00032109983,0.0009611074,0.000046804224,4.7892433e-7],"category_scores_gemma":[0.0004987488,0.00007629324,0.00004880968,0.00029523,0.00004587323,0.00019973885,0.00028359628,0.00008888812,0.0000010338409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026240969,0.00011814549,0.00028420895,0.0012540686,0.00008763375,7.546631e-7,0.0035919084,0.00057932234,0.009362428,0.23493122,0.0039079455,0.7458561],"study_design_scores_gemma":[0.0004823823,0.0006919198,0.0021079127,0.0012833672,0.00010438177,0.000029029892,0.0008188781,0.88483214,0.054550678,0.047622465,0.0068488666,0.00062797905],"about_ca_topic_score_codex":0.0000042798792,"about_ca_topic_score_gemma":3.8852593e-7,"teacher_disagreement_score":0.88425285,"about_ca_system_score_codex":0.000026226477,"about_ca_system_score_gemma":0.000014059436,"threshold_uncertainty_score":0.3111148},"labels":[],"label_agreement":null},{"id":"W4400081222","doi":"10.1145/3655038.3665953","title":"Breaking Barriers: Expanding GPU Memory with Sub-Two Digit Nanosecond Latency CXL Controller","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Latency (audio); Nanosecond; CAS latency; Controller (irrigation); Computer hardware; Memory controller; Semiconductor memory; Physics; Telecommunications; Optics","score_opus":0.008883316011168568,"score_gpt":0.24872124826975772,"score_spread":0.23983793225858915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400081222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019628366,0.00043999942,0.9402986,0.00039600427,0.00028416212,0.00018599645,0.00000124371,0.0024474023,0.036318194],"genre_scores_gemma":[0.95159525,0.00002245046,0.045618117,0.0004669691,0.00008485238,0.000018752411,0.0000017673808,0.000020870792,0.0021709774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985779,0.00005111822,0.00025462665,0.0005252895,0.0002475421,0.00034352223],"domain_scores_gemma":[0.99924445,0.00014153738,0.00005468541,0.00033879417,0.000077091754,0.00014343233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026679705,0.00020018463,0.00021713215,0.00021466838,0.00019918379,0.0008887572,0.00054938515,0.000058567293,0.0000697925],"category_scores_gemma":[0.000025726713,0.0001477919,0.00007434572,0.0005000109,0.000045206227,0.00083978666,0.00017056474,0.0001675618,0.000049230246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012844698,0.00017859793,0.0027165797,0.0003538472,0.00078578416,0.0011018126,0.014002893,0.05420198,0.011742804,0.30698404,0.05019021,0.557613],"study_design_scores_gemma":[0.0012710021,0.00022631121,0.000098513636,0.00044763033,0.00002467698,0.0001993745,0.0001176792,0.9234084,0.05920536,0.006559796,0.0075771585,0.0008641073],"about_ca_topic_score_codex":0.00003457223,"about_ca_topic_score_gemma":0.0000081904755,"teacher_disagreement_score":0.9319669,"about_ca_system_score_codex":0.000051027895,"about_ca_system_score_gemma":0.0001223231,"threshold_uncertainty_score":0.8570306},"labels":[],"label_agreement":null},{"id":"W4400489975","doi":"10.1109/netsoft60951.2024.10588910","title":"Enhancing P4 Syntax to Support Extended Finite State Machines as Native Stateful Objects","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stateful firewall; Computer science; Syntax; Finite-state machine; State (computer science); Finite state; Programming language; Artificial intelligence; Markov chain; Computer security; Machine learning","score_opus":0.012211061978191842,"score_gpt":0.2929748974882452,"score_spread":0.28076383551005335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400489975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005622429,0.00007266149,0.970182,0.000851863,0.00044785353,0.00022352125,0.0000057593193,0.002454122,0.020139813],"genre_scores_gemma":[0.6961772,0.000028431696,0.28548202,0.0015085218,0.000049372116,0.000029825089,0.000006862645,0.0000230257,0.016694771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830115,0.00008425359,0.0003202337,0.0005994781,0.00032529084,0.0003695998],"domain_scores_gemma":[0.99897265,0.00028440822,0.00004738689,0.00039155185,0.00013703022,0.00016698729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048709093,0.00020907262,0.0001894795,0.00035935116,0.00012645285,0.00055966596,0.0006318148,0.000041900254,0.00011748849],"category_scores_gemma":[0.00014280582,0.00017721555,0.000068513684,0.0008396579,0.000020996009,0.0004888346,0.0003993011,0.00016853669,0.00050654466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008481855,0.00038210998,0.00012358841,0.00044681138,0.00038307553,0.0027741047,0.06619563,0.1042923,0.008044703,0.1788871,0.07083235,0.5675534],"study_design_scores_gemma":[0.0001691998,0.00070498534,0.00012204681,0.00020540139,0.000008753468,0.000094079056,0.00008273665,0.8188119,0.13655528,0.032965135,0.009562066,0.0007184007],"about_ca_topic_score_codex":0.00015338698,"about_ca_topic_score_gemma":0.00006696304,"teacher_disagreement_score":0.7145196,"about_ca_system_score_codex":0.00006765422,"about_ca_system_score_gemma":0.00022131154,"threshold_uncertainty_score":0.72266406},"labels":[],"label_agreement":null},{"id":"W4400499291","doi":"10.1007/978-3-031-64171-8_2","title":"S2malloc: Statistically Secure Allocator for Use-After-Free Protection and More","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Allocator; Computer security; Parallel computing; Programming language; Operating system; Theoretical computer science","score_opus":0.017271699023899016,"score_gpt":0.25613888559090386,"score_spread":0.23886718656700484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400499291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030337866,0.0005266578,0.9953116,0.0013890342,0.0008431515,0.0010059464,0.000036885613,0.00062382425,0.00023253914],"genre_scores_gemma":[0.022087658,0.00004033603,0.97582376,0.0009290934,0.00027760497,0.00009598343,0.00000746249,0.000052810206,0.00068528287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668366,0.000022697724,0.0004794479,0.0016615558,0.00062163634,0.00053103233],"domain_scores_gemma":[0.99775106,0.00037669874,0.00017343054,0.0011796829,0.0003405683,0.00017854084],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006126174,0.0005155707,0.00043817153,0.0006994574,0.00021965728,0.001283008,0.0018595435,0.0003569814,0.0000043890786],"category_scores_gemma":[0.00019378522,0.00047203247,0.000101557765,0.00041465863,0.0005228953,0.00054821005,0.0015032162,0.0006539868,0.0000073146857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059184025,0.000056542016,0.000030976138,0.0006811855,0.000051643845,0.00018138268,0.0016235292,0.0404357,0.00008420877,0.22213992,0.00047022392,0.7341855],"study_design_scores_gemma":[0.0001572468,0.00022653969,0.000035396424,0.00036339046,0.000011995336,0.000055125387,8.078375e-8,0.74608594,0.0001852281,0.24991119,0.002507262,0.00046060205],"about_ca_topic_score_codex":0.000019122459,"about_ca_topic_score_gemma":0.000037449387,"teacher_disagreement_score":0.7337249,"about_ca_system_score_codex":0.00018646408,"about_ca_system_score_gemma":0.00033024422,"threshold_uncertainty_score":0.99977314},"labels":[],"label_agreement":null},{"id":"W4400612051","doi":"10.48550/arxiv.2407.08663","title":"Mon CHÉRI: Mitigating Uninitialized Memory Access with Conditional Capabilities","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Horizon 2020 Framework Programme; University of Waterloo; KU Leuven; Waalse Gewest","keywords":"Computer science; Computer hardware; Embedded system; Parallel computing","score_opus":0.06654008795038215,"score_gpt":0.22279027666123388,"score_spread":0.15625018871085172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400612051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094411805,0.00009630524,0.8925462,0.0003016424,0.00035979997,0.0003246928,0.000036505207,0.0017239467,0.010199153],"genre_scores_gemma":[0.9838663,0.000049354334,0.013702674,0.00016446308,0.00009847836,0.000004606577,0.000071346345,0.000027275264,0.0020155413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997984,0.00018444438,0.00023995273,0.0011166427,0.00015707497,0.00031789974],"domain_scores_gemma":[0.9983662,0.0001433181,0.00023666094,0.00084240304,0.000275783,0.00013565368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024843225,0.00035411635,0.00035027074,0.0003628167,0.00022244356,0.0005264716,0.0018778099,0.00023192208,0.000025748603],"category_scores_gemma":[0.000031058033,0.000366789,0.00015637954,0.0006157199,0.00024515562,0.00041602468,0.0028541642,0.00070998806,0.000030631614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019801679,0.00004492419,0.00020031717,0.00025253493,0.000117425516,0.00032878382,0.0004310122,0.7316233,0.0000067162673,0.26572508,0.0010354376,0.0002146781],"study_design_scores_gemma":[0.0002962229,0.000048308393,0.00012537192,0.0003105202,0.00004927466,0.000014264947,0.0000627692,0.6954483,0.0005184511,0.30252272,0.00014140186,0.00046238262],"about_ca_topic_score_codex":0.00032326058,"about_ca_topic_score_gemma":0.00001818383,"teacher_disagreement_score":0.8894545,"about_ca_system_score_codex":0.00018727784,"about_ca_system_score_gemma":0.00044830953,"threshold_uncertainty_score":0.9998784},"labels":[],"label_agreement":null},{"id":"W4400792608","doi":"10.1007/s12532-024-00255-x","title":"PyEPO: a PyTorch-based end-to-end predict-then-optimize library for linear and integer programming","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integer programming; End-to-end principle; Computer science; Linear programming; Theory of computation; Integer (computer science); Parallel computing; Algorithm; Artificial intelligence; Programming language","score_opus":0.02221699247781377,"score_gpt":0.2937117696713729,"score_spread":0.27149477719355913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400792608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007722651,0.0002006024,0.99090755,0.0021481754,0.00019275675,0.0015042536,0.000006085318,0.004061749,0.00020655488],"genre_scores_gemma":[0.15041627,0.0000024203737,0.8487081,0.0002236674,0.0001247394,0.00029989303,0.000051344232,0.000054283933,0.00011926934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775463,0.000098755605,0.00057047984,0.00072860054,0.00037623037,0.000471292],"domain_scores_gemma":[0.99831855,0.0009213412,0.00010118883,0.0003082638,0.00011227772,0.00023836056],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007274102,0.00030054923,0.00033470592,0.0003556827,0.00020683293,0.0013234275,0.0004573341,0.00013386422,0.000010262267],"category_scores_gemma":[0.00021520382,0.0002660294,0.00014029638,0.0007412543,0.00010823204,0.00056618435,0.00025344934,0.0002289441,0.000027257245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029050037,0.00024513333,0.000019895522,0.0008027559,0.000058824648,0.0000193842,0.0018081919,0.022484692,0.000023630879,0.06005704,0.0019650431,0.9124864],"study_design_scores_gemma":[0.0002678439,0.00036365326,0.000008849169,0.00046485098,0.00002676608,0.000019546213,0.000021362286,0.9650657,0.00034789005,0.022239769,0.010873999,0.00029977955],"about_ca_topic_score_codex":0.0000024292478,"about_ca_topic_score_gemma":2.0981464e-7,"teacher_disagreement_score":0.942581,"about_ca_system_score_codex":0.00004428636,"about_ca_system_score_gemma":0.00012402135,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W4401211787","doi":"10.1109/isca59077.2024.00011","title":"GhOST: a GPU Out-of-Order Scheduling Technique for Stall Reduction","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Advanced Scientific Computing Research; U.S. Department of Energy; Office of Science; National Science Foundation","keywords":"Computer science; Stall (fluid mechanics); Parallel computing; Scheduling (production processes); Reduction (mathematics); Computer graphics (images); Mathematical optimization; Engineering; Aerospace engineering; Mathematics","score_opus":0.02592621405378824,"score_gpt":0.304596467975418,"score_spread":0.27867025392162975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401211787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013967493,0.00021497103,0.993751,0.00077871373,0.00048537448,0.00037490792,0.0000012442268,0.0013263404,0.002927781],"genre_scores_gemma":[0.13239418,0.000022661363,0.8666328,0.000040984974,0.00006435275,0.00007425587,0.0000028977609,0.000010502772,0.0007573585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991808,0.000022245784,0.00022408331,0.00030408255,0.00011587186,0.00015290098],"domain_scores_gemma":[0.9994222,0.000058240326,0.00004423398,0.00027599596,0.00016592938,0.000033380802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003869149,0.000095760006,0.00011251985,0.00018023704,0.000059425383,0.00012330092,0.000341355,0.00007228428,0.000007316312],"category_scores_gemma":[0.000042138516,0.000085370404,0.00006823104,0.00039745527,0.000023610208,0.00027506708,0.000105253624,0.00008687667,0.000006464211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018624964,0.00015412495,0.000011932039,0.0004475072,0.0000860135,0.000005976201,0.0020552487,0.026734147,0.13450237,0.72995484,0.016127685,0.08990151],"study_design_scores_gemma":[0.00007531798,0.000116751464,0.0000026804687,0.00012381891,0.000005513622,0.000012390062,0.000017533637,0.7655698,0.20652533,0.018665971,0.008711233,0.00017367986],"about_ca_topic_score_codex":0.000008659243,"about_ca_topic_score_gemma":5.820521e-7,"teacher_disagreement_score":0.73883563,"about_ca_system_score_codex":0.000026003545,"about_ca_system_score_gemma":0.000102781436,"threshold_uncertainty_score":0.3481304},"labels":[],"label_agreement":null},{"id":"W4401335869","doi":"10.1145/3676849","title":"PASTA: Programming and Automation Support for Scalable Task-Parallel HLS Programs on Modern Multi-Die FPGAs","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Field-programmable gate array; High-level synthesis; Scalability; Embedded system; Task (project management); Computer architecture; FIFO (computing and electronics); Parallel computing; Computer hardware; Operating system","score_opus":0.029559222490131792,"score_gpt":0.27636824371404184,"score_spread":0.24680902122391005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401335869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001995524,0.0012934416,0.9898678,0.0014924073,0.00039797564,0.0012526485,0.000010137573,0.0034416916,0.000248378],"genre_scores_gemma":[0.79883635,0.0002871546,0.19733518,0.00005586752,0.000021831998,0.0010918106,0.000014147722,0.000030468966,0.0023271544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983068,0.00005401285,0.00039539268,0.0007101908,0.00013499653,0.00039857003],"domain_scores_gemma":[0.9989869,0.00015536573,0.00009296531,0.00057911215,0.0001038794,0.00008180097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049541675,0.0002502043,0.00031020644,0.0007035117,0.0004611294,0.0004726408,0.00043129278,0.00035033422,0.000002529548],"category_scores_gemma":[0.000025408677,0.00022700301,0.00006641994,0.0005135028,0.00010692868,0.0003497923,0.000012557936,0.00032173147,0.0000131402685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019701874,0.00018387738,0.000040784216,0.00033928652,0.00010452126,0.000012935935,0.00036318676,0.00808206,0.00021431068,0.014364962,0.00019391136,0.9760805],"study_design_scores_gemma":[0.0005173467,0.0008078927,0.000014590417,0.00038835398,0.00002778837,0.00015458502,0.000110577574,0.97641003,0.001579159,0.005250406,0.0144201275,0.00031913325],"about_ca_topic_score_codex":0.000023505667,"about_ca_topic_score_gemma":0.000008681521,"teacher_disagreement_score":0.97576135,"about_ca_system_score_codex":0.00005106828,"about_ca_system_score_gemma":0.000059999697,"threshold_uncertainty_score":0.9256914},"labels":[],"label_agreement":null},{"id":"W4401428548","doi":"10.1145/3687308","title":"High Performance and Predictable Shared Last-level Cache for Safety-Critical Systems","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Operating system","score_opus":0.0296858165112149,"score_gpt":0.27888680662038545,"score_spread":0.24920099010917054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401428548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002292056,0.00095554936,0.9895121,0.0004385807,0.00346536,0.000744564,0.000083331244,0.0022670731,0.00024139705],"genre_scores_gemma":[0.8549732,0.000047767116,0.14388485,0.00005471501,0.00023481302,0.00010141869,0.000014248472,0.000040931453,0.00064806704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736273,0.00017244028,0.00067466975,0.00085245486,0.00038831448,0.0005493886],"domain_scores_gemma":[0.99729335,0.001357005,0.00008948501,0.0008618328,0.00022854729,0.00016975513],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00095172634,0.00033190195,0.00043162602,0.00034243838,0.00071722287,0.0011624674,0.0009107327,0.00019266966,0.0000025735665],"category_scores_gemma":[0.00009326027,0.00031750734,0.00010398323,0.000596639,0.00007122459,0.0005410744,0.00005280331,0.0003675348,0.00001979407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004017173,0.00012240547,0.000023058048,0.0016330017,0.00017052786,0.000013355991,0.0018147385,0.9264534,0.000108192704,0.03373507,0.0030542724,0.032831777],"study_design_scores_gemma":[0.00036370585,0.0002713223,0.00003854707,0.0010912074,0.00003371223,0.00016050096,0.00010131153,0.99426377,0.00027607539,0.00021505725,0.00283893,0.0003458493],"about_ca_topic_score_codex":0.00007847787,"about_ca_topic_score_gemma":0.0000012680114,"teacher_disagreement_score":0.85268116,"about_ca_system_score_codex":0.00014497055,"about_ca_system_score_gemma":0.00012545963,"threshold_uncertainty_score":0.9999277},"labels":[],"label_agreement":null},{"id":"W4401482586","doi":"10.1145/3687483","title":"Transient Fault Detection in Tensor Cores for Modern GPUs","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Exploit; Parallel computing; Redundancy (engineering); Graphics processing unit; Overhead (engineering); Computer engineering; Fault injection; Pruning; Computation; Tensor (intrinsic definition); Multi-core processor; Embedded system; Software; Algorithm; Operating system","score_opus":0.024028538797165343,"score_gpt":0.2855286224567635,"score_spread":0.2615000836595982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401482586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007441136,0.0004662412,0.9865434,0.00028133835,0.0021013347,0.00080662535,0.000009716299,0.0021495826,0.00020063657],"genre_scores_gemma":[0.9222329,0.000021217484,0.07721212,0.000074423784,0.00010134382,0.00011525908,0.0000035999572,0.000035254194,0.0002038773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771214,0.00015274319,0.0005980543,0.00078066194,0.00031385646,0.00044256548],"domain_scores_gemma":[0.9983608,0.00057169376,0.00008568484,0.00076107966,0.0001307113,0.00008998843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062076916,0.00027798457,0.00032269626,0.0006218503,0.00029475582,0.0004914715,0.00083119853,0.00016773802,0.0000013013243],"category_scores_gemma":[0.000037290054,0.00027215408,0.000193168,0.0008734048,0.000030694748,0.000279158,0.000014943645,0.00034679964,0.000015795868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020586536,0.00009233048,0.0000025130723,0.00015394697,0.000040176838,0.000010701587,0.002396077,0.82089466,0.0006811251,0.0010714604,0.00013227105,0.17450413],"study_design_scores_gemma":[0.00040156217,0.00020426043,0.000022701883,0.00039279478,0.000013890116,0.00006244344,0.00009682455,0.99304825,0.0031966122,0.0012193094,0.0010428734,0.00029847038],"about_ca_topic_score_codex":0.00007880135,"about_ca_topic_score_gemma":0.000017467115,"teacher_disagreement_score":0.91479176,"about_ca_system_score_codex":0.00019828632,"about_ca_system_score_gemma":0.000075435,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W4401541599","doi":"10.1109/remar61031.2024.10617732","title":"Simplifying Dynamic Models for Parallel Robots by Introducing Virtual Degrees of Freedom","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Robot; Degrees of freedom (physics and chemistry); Parallel manipulator; Control engineering; Human–computer interaction; Artificial intelligence; Engineering; Physics","score_opus":0.019493676643106018,"score_gpt":0.2755955958049598,"score_spread":0.25610191916185376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401541599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002981146,0.00074664137,0.9963738,0.00047913933,0.00024387671,0.00020056375,0.0000061082055,0.0009833006,0.000668467],"genre_scores_gemma":[0.3523921,0.00003789325,0.6468631,0.000039272738,0.000027464912,0.00001752462,0.000007806764,0.000011650205,0.0006031603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881333,0.000028854165,0.0003084934,0.0004473063,0.00016609493,0.0002359272],"domain_scores_gemma":[0.9992072,0.0002181261,0.000057682984,0.0003728725,0.00009357981,0.000050558414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003303954,0.0001394187,0.00019072746,0.00014600692,0.000084748746,0.00017714252,0.0006367821,0.00006697575,0.0000042995553],"category_scores_gemma":[0.000028508593,0.00012329014,0.000092009795,0.00028420857,0.000032999156,0.00048092258,0.00019926156,0.00009093933,0.0000034524098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002596801,0.00001576147,0.0000023722162,0.00002759049,0.000016104908,5.111089e-7,0.00020265684,0.86443293,0.0004886848,0.11516081,0.009364709,0.010285249],"study_design_scores_gemma":[0.00011388398,0.00009339498,0.0000032764472,0.000052789914,0.0000051890374,0.0000036577494,0.000014040858,0.9917882,0.00046881245,0.0070610475,0.00024529832,0.00015037843],"about_ca_topic_score_codex":0.000044361524,"about_ca_topic_score_gemma":0.000005151198,"teacher_disagreement_score":0.352094,"about_ca_system_score_codex":0.00003609086,"about_ca_system_score_gemma":0.00005598045,"threshold_uncertainty_score":0.5027626},"labels":[],"label_agreement":null},{"id":"W4401568304","doi":"10.23919/date58400.2024.10546600","title":"A Compiler Phase to Optimally Split GPU Wavefronts for Safety-Critical Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compiler; Computer science; Parallel computing; Wavefront; Phase (matter); Programming language; Optics; Physics","score_opus":0.027784354601110964,"score_gpt":0.3456621647818399,"score_spread":0.31787781018072897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401568304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090803864,0.00032135067,0.98406595,0.0033995456,0.0008824102,0.0004982192,0.00001672555,0.001842081,0.008882909],"genre_scores_gemma":[0.16994809,0.0000062819668,0.8264035,0.0008422609,0.00016359707,0.00008871252,0.000008712275,0.000018766097,0.0025200685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855405,0.000045604582,0.00032962614,0.0005161697,0.0002090391,0.0003454838],"domain_scores_gemma":[0.998908,0.00032902893,0.000016627499,0.00040653432,0.0001522912,0.0001875475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004423026,0.00015572403,0.0002050185,0.00016390398,0.00013038467,0.0006710038,0.00064881204,0.00006539827,0.000020754254],"category_scores_gemma":[0.00008208849,0.00013446352,0.000086518085,0.00032103198,0.000025480887,0.00027691387,0.00021336375,0.00009123141,0.0001420564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026417978,0.00010995611,0.0000016760783,0.000117474134,0.000023348546,0.000022398424,0.00026146107,0.017127737,0.00012078322,0.8535812,0.10915818,0.019449381],"study_design_scores_gemma":[0.00021413673,0.00023298923,0.0000030264891,0.00010249546,0.000005169581,0.000022005292,0.0000068870277,0.8834404,0.0002562698,0.0012088715,0.114325196,0.00018256123],"about_ca_topic_score_codex":0.000010449351,"about_ca_topic_score_gemma":6.931534e-7,"teacher_disagreement_score":0.8663126,"about_ca_system_score_codex":0.00006396666,"about_ca_system_score_gemma":0.00008544642,"threshold_uncertainty_score":0.6470505},"labels":[],"label_agreement":null},{"id":"W4401709128","doi":"10.1007/978-3-031-65123-6_24","title":"Proactive Hybrid Autoscaling for Container-Based Edge Applications in Kubernetes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Container (type theory); Computer science; Enhanced Data Rates for GSM Evolution; Materials science; Telecommunications; Composite material","score_opus":0.020888791345851268,"score_gpt":0.25390487611792734,"score_spread":0.23301608477207608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401709128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029874689,0.00042796807,0.9960438,0.0006698525,0.00021683538,0.0011804844,0.000065288754,0.00017529106,0.0011905864],"genre_scores_gemma":[0.010548187,0.000030280715,0.9888633,0.000114442926,0.000084556785,0.0001833316,0.000060001552,0.000018039298,0.0000978443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988647,0.000007341258,0.00056055066,0.00020448503,0.0001567135,0.00020622532],"domain_scores_gemma":[0.9985346,0.00049618725,0.00030692935,0.00046042516,0.00016813344,0.000033705655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003698514,0.00024818635,0.00032530035,0.00031545115,0.00049639185,0.0002471291,0.0013634482,0.00013963426,1.6760488e-7],"category_scores_gemma":[0.000040667208,0.0002052895,0.0001853339,0.00025132688,0.00022035507,0.00021604238,0.00044640523,0.00031368385,2.396149e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.380356e-7,0.000010933195,0.0000012523445,0.00017961222,0.000029795348,3.322853e-8,0.0004309353,0.8069822,0.0000022697143,0.18705241,0.000037941147,0.005271758],"study_design_scores_gemma":[0.00014679859,0.00004649274,0.0000050289373,0.00021682931,0.000025757516,0.0000025508978,0.000001808077,0.9710565,0.00027550803,0.009168917,0.018825151,0.00022862125],"about_ca_topic_score_codex":0.00001832952,"about_ca_topic_score_gemma":0.000024656954,"teacher_disagreement_score":0.17788349,"about_ca_system_score_codex":0.00009049694,"about_ca_system_score_gemma":0.00021257956,"threshold_uncertainty_score":0.8371463},"labels":[],"label_agreement":null},{"id":"W4401862227","doi":"10.1007/978-3-031-69766-1_14","title":"PCTC: Hardware and Software Co-design for Pruned Capsule Networks on Tensor Cores","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Software; Tensor (intrinsic definition); Capsule; Computer hardware; Embedded system; Computer architecture; Parallel computing; Operating system; Geometry; Geology; Mathematics","score_opus":0.02590293987086669,"score_gpt":0.2683755111308871,"score_spread":0.2424725712600204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401862227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004460272,0.001162546,0.9944529,0.00056238886,0.0012594371,0.0009500711,0.0000146759785,0.0009033437,0.00069016544],"genre_scores_gemma":[0.008145676,0.00014017911,0.987501,0.0017585097,0.0005011231,0.000049289472,0.000016408207,0.000070891554,0.0018168688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645275,0.000037785514,0.00047639752,0.001791243,0.0005915878,0.0006502088],"domain_scores_gemma":[0.9974918,0.000815843,0.00022711234,0.001010475,0.00027628202,0.00017850279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008772044,0.0006037492,0.00057506637,0.000726731,0.00039230203,0.0009996651,0.0020372705,0.00040758797,0.000005133906],"category_scores_gemma":[0.00015486676,0.00052576803,0.00013556388,0.00040863882,0.00048392176,0.00027581645,0.00070619636,0.0007084251,0.000014953102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019610596,0.000026787431,0.000010817048,0.00010613655,0.000025197427,0.0000638912,0.0004138009,0.7007673,0.000013891816,0.023054663,0.0022545683,0.27324337],"study_design_scores_gemma":[0.00020139891,0.00043490282,0.000014758248,0.0006419261,0.000010654777,0.000039246395,8.428689e-8,0.8928804,0.0006509699,0.10184765,0.0026886112,0.00058941916],"about_ca_topic_score_codex":0.0000062920585,"about_ca_topic_score_gemma":0.0000044497897,"teacher_disagreement_score":0.27265397,"about_ca_system_score_codex":0.00017438215,"about_ca_system_score_gemma":0.00029058405,"threshold_uncertainty_score":0.9997194},"labels":[],"label_agreement":null},{"id":"W4401990601","doi":"10.1109/icmew63481.2024.10645459","title":"Towards Task-Compatible Compressible Representations","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Task (project management); Computer science; Compressibility; Engineering; Systems engineering; Aerospace engineering","score_opus":0.026181191157613463,"score_gpt":0.31575337283177024,"score_spread":0.28957218167415677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401990601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014302031,0.00031605075,0.8389573,0.0014733763,0.00029521494,0.000076208344,0.00000100032,0.0028814976,0.15585631],"genre_scores_gemma":[0.45517382,0.000032182073,0.53991646,0.0002819715,0.000053121912,0.000016441325,0.0000053593462,0.000007896261,0.0045127827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.000039336148,0.00017310749,0.00033179385,0.00018136288,0.00016470155],"domain_scores_gemma":[0.9993671,0.000064315056,0.000020206482,0.00043074202,0.000056524663,0.00006111706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015299833,0.00008930189,0.000091985865,0.00017036256,0.000108954686,0.00053649314,0.0005792211,0.000033519882,0.00007428119],"category_scores_gemma":[0.000014567267,0.00007603622,0.000055613833,0.0006384285,0.000022396582,0.000462499,0.00021159045,0.00009602013,0.00018059697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.429971e-7,0.000041293562,0.000098513505,0.000025939558,0.000022034437,0.000020908014,0.00053448207,0.01022223,0.00037410724,0.7802993,0.17137283,0.03698762],"study_design_scores_gemma":[0.000047962054,0.000020785004,0.00023671876,0.00002911513,0.0000024978622,0.000013644514,0.0000069790194,0.94574475,0.0052772625,0.018661492,0.029835735,0.00012306996],"about_ca_topic_score_codex":0.0000873618,"about_ca_topic_score_gemma":0.0000021823694,"teacher_disagreement_score":0.9355225,"about_ca_system_score_codex":0.000020019492,"about_ca_system_score_gemma":0.00007786642,"threshold_uncertainty_score":0.51734155},"labels":[],"label_agreement":null},{"id":"W4402042260","doi":"10.36227/techrxiv.172503824.45535562/v1","title":"Fast Prototyping of Distributed Stream Processing Applications with stream2gym","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rapid prototyping; Computer science; Stream processing; Operating system; Engineering; Mechanical engineering","score_opus":0.013767169750992812,"score_gpt":0.2714699325716594,"score_spread":0.2577027628206666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402042260","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020647096,0.00042537437,0.9897818,0.00028468383,0.000031047464,0.0013205219,0.000035128345,0.0017158581,0.0061990945],"genre_scores_gemma":[0.32315573,0.000030267856,0.67554426,0.000022213146,0.00005523884,0.00082486845,0.00010433828,0.000024011502,0.00023907397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846685,0.000030756797,0.00037512602,0.0006624781,0.00026344156,0.00020137517],"domain_scores_gemma":[0.99855095,0.000026408901,0.00027647888,0.00077457196,0.00030721596,0.00006436979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014901461,0.00025107406,0.00029118062,0.00018758822,0.00008492806,0.0003221832,0.0010383552,0.00014983088,0.0000041994567],"category_scores_gemma":[0.0000065888976,0.00019694037,0.00006945215,0.000657213,0.00006445805,0.000088026485,0.0014670824,0.00042614946,0.000005248013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018691571,0.00046831238,0.0003889152,0.0042177774,0.0001988723,0.000011742489,0.0010565077,0.15287228,0.000061522,0.09720529,0.0015955146,0.74190456],"study_design_scores_gemma":[0.00011736493,0.00008630243,0.000087139706,0.0013422505,0.00003723374,0.000011195458,0.000034505043,0.96670467,0.005266273,0.024448717,0.0013968169,0.00046756433],"about_ca_topic_score_codex":0.000037312948,"about_ca_topic_score_gemma":0.0000052297296,"teacher_disagreement_score":0.81383234,"about_ca_system_score_codex":0.000053170195,"about_ca_system_score_gemma":0.00043403116,"threshold_uncertainty_score":0.8030995},"labels":[],"label_agreement":null},{"id":"W4402101939","doi":"10.32920/26883748.v1","title":"Power and Performance Based Autotuning of Heterogeneous Applications for CPU-GPU Systems","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Power (physics); CUDA; Parallel computing; Embedded system","score_opus":0.01782501299584427,"score_gpt":0.2661536526280768,"score_spread":0.2483286396322325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402101939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014461426,0.0009849995,0.99336916,0.00011742555,0.0002393444,0.000828535,0.000013692516,0.0007777332,0.0022229487],"genre_scores_gemma":[0.680125,0.00002654056,0.3191086,0.00004521899,0.000024175619,0.00033329174,0.000009730154,0.0000131233,0.0003143316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988816,0.000025685727,0.00032864438,0.00047710474,0.00013638356,0.00015060228],"domain_scores_gemma":[0.9989278,0.00008599044,0.00016171907,0.0006082027,0.00016525415,0.000051032774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028045167,0.00016921855,0.0002492406,0.00018898027,0.00007602486,0.00021030624,0.000591383,0.00014303264,0.0000017708138],"category_scores_gemma":[0.000006050532,0.00015576914,0.00007962677,0.00013760258,0.000033413886,0.00003706912,0.0008270108,0.00016835623,0.000002487934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093233675,0.00007874447,0.00013258627,0.0037938696,0.000101234444,0.0000017181734,0.00036160267,0.9156794,0.00010786917,0.06280918,0.0021228674,0.0148016075],"study_design_scores_gemma":[0.00005921458,0.00006122751,0.000012357377,0.0002014463,0.000009097951,0.0000059166596,0.000002293371,0.99500734,0.00094775227,0.0013768092,0.0021491128,0.00016743483],"about_ca_topic_score_codex":0.000011502038,"about_ca_topic_score_gemma":3.0301302e-7,"teacher_disagreement_score":0.6786789,"about_ca_system_score_codex":0.000028632661,"about_ca_system_score_gemma":0.00013044589,"threshold_uncertainty_score":0.63520813},"labels":[],"label_agreement":null},{"id":"W4402101957","doi":"10.32920/26883748","title":"Power and Performance Based Autotuning of Heterogeneous Applications for CPU-GPU Systems","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; CPU shielding; Parallel computing; Embedded system; Power (physics); Operating system; Central processing unit","score_opus":0.01782501299584427,"score_gpt":0.2661536526280768,"score_spread":0.2483286396322325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402101957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014461426,0.0009849995,0.99336916,0.00011742555,0.0002393444,0.000828535,0.000013692516,0.0007777332,0.0022229487],"genre_scores_gemma":[0.680125,0.00002654056,0.3191086,0.00004521899,0.000024175619,0.00033329174,0.000009730154,0.0000131233,0.0003143316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988816,0.000025685727,0.00032864438,0.00047710474,0.00013638356,0.00015060228],"domain_scores_gemma":[0.9989278,0.00008599044,0.00016171907,0.0006082027,0.00016525415,0.000051032774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028045167,0.00016921855,0.0002492406,0.00018898027,0.00007602486,0.00021030624,0.000591383,0.00014303264,0.0000017708138],"category_scores_gemma":[0.000006050532,0.00015576914,0.00007962677,0.00013760258,0.000033413886,0.00003706912,0.0008270108,0.00016835623,0.000002487934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093233675,0.00007874447,0.00013258627,0.0037938696,0.000101234444,0.0000017181734,0.00036160267,0.9156794,0.00010786917,0.06280918,0.0021228674,0.0148016075],"study_design_scores_gemma":[0.00005921458,0.00006122751,0.000012357377,0.0002014463,0.000009097951,0.0000059166596,0.000002293371,0.99500734,0.00094775227,0.0013768092,0.0021491128,0.00016743483],"about_ca_topic_score_codex":0.000011502038,"about_ca_topic_score_gemma":3.0301302e-7,"teacher_disagreement_score":0.6786789,"about_ca_system_score_codex":0.000028632661,"about_ca_system_score_gemma":0.00013044589,"threshold_uncertainty_score":0.63520813},"labels":[],"label_agreement":null},{"id":"W4402167912","doi":"10.1109/fccm60383.2024.00045","title":"The BRAM is the Limit: Shattering Myths, Shaping Standards, and Building Scalable PIM Accelerators","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"National Science Foundation","keywords":"Computer science; Field-programmable gate array; Scalability; Clock rate; Embedded system; Set (abstract data type); Computer hardware; Operating system; Chip; Telecommunications","score_opus":0.0321547135110045,"score_gpt":0.30341250861046193,"score_spread":0.2712577950994574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402167912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023499106,0.0059829624,0.9638417,0.013560986,0.0010833299,0.0004710547,0.000012314455,0.0016442781,0.011053469],"genre_scores_gemma":[0.6611666,0.006967426,0.32126305,0.0063877087,0.0006529242,0.00016888941,0.000004351759,0.00011939949,0.0032696542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976437,0.00011582949,0.0004159454,0.0008484405,0.0005417901,0.00043426998],"domain_scores_gemma":[0.9981654,0.00030100974,0.00015884277,0.0010980332,0.00018888975,0.000087800916],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016141159,0.00034599775,0.00026672636,0.00012485901,0.0009386003,0.005124285,0.0021016863,0.00018166214,0.000011805991],"category_scores_gemma":[0.00008183809,0.00020199563,0.00012429077,0.000331395,0.00011640392,0.00016986481,0.008205543,0.0009519799,0.000008015033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015690508,0.00004378341,0.00020778083,0.00068613916,0.00043981714,0.000033912187,0.0064959503,0.030927038,0.00021548278,0.17590266,0.24722095,0.5378108],"study_design_scores_gemma":[0.000079007266,0.000023806098,0.000043264812,0.0005566613,0.00001910592,0.00001999614,0.00006834755,0.8942182,0.0028331624,0.03437428,0.06733941,0.00042477887],"about_ca_topic_score_codex":0.000070166156,"about_ca_topic_score_gemma":0.000006987439,"teacher_disagreement_score":0.86329114,"about_ca_system_score_codex":0.000120410434,"about_ca_system_score_gemma":0.00024587015,"threshold_uncertainty_score":0.9998159},"labels":[],"label_agreement":null},{"id":"W4402293332","doi":"10.1002/9781119912965.ch2","title":"Characterization of Parallelism in Applications","year":2024,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Parallelism (grammar); Characterization (materials science); Computer science; Parallel computing; Task parallelism; Nanotechnology; Materials science","score_opus":0.011030213300809076,"score_gpt":0.25778093898999277,"score_spread":0.2467507256891837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402293332","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.9545188e-7,0.00013755244,0.6062782,0.00008269688,0.000049498707,0.00015719791,0.0000026340047,0.00055243226,0.3927394],"genre_scores_gemma":[0.00043679,0.0003123593,0.17630671,0.00008903739,0.00006941226,0.000096058444,0.00003572148,0.00010801261,0.8225459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936694,0.000018752968,0.0001906895,0.0002492288,0.00009335957,0.000081015256],"domain_scores_gemma":[0.99948686,0.0000061458168,0.0001049638,0.0003678872,0.000016357055,0.000017773626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007339013,0.00009761488,0.00015281307,0.00041767038,0.0000045359798,0.00003097176,0.0004374005,0.00012204935,0.00008607475],"category_scores_gemma":[0.00000212856,0.000091355534,0.000031880427,0.0004091799,0.000014138648,0.00003651769,0.000114408875,0.00007901768,0.00014136333],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.632141e-7,0.000121496254,0.000027371685,0.00037026362,0.000030786377,0.000004686573,0.00021782663,0.00007436282,0.00080381957,0.5435182,0.431839,0.022991454],"study_design_scores_gemma":[0.000065283624,0.000011402821,0.000030500116,0.00022873828,0.0000035278495,0.0000016296838,9.907073e-7,0.019813193,0.00052412756,0.0046551763,0.97446257,0.0002028473],"about_ca_topic_score_codex":0.00003953845,"about_ca_topic_score_gemma":0.000009769692,"teacher_disagreement_score":0.5426236,"about_ca_system_score_codex":0.000010627971,"about_ca_system_score_gemma":0.000026891628,"threshold_uncertainty_score":0.37253705},"labels":[],"label_agreement":null},{"id":"W4402572139","doi":"10.1109/newcas58973.2024.10666335","title":"A General Purpose Hyperdimensional Computing Accelerator for Edge Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Edge computing; Parallel computing; Enhanced Data Rates for GSM Evolution; Computational science; Operating system; Artificial intelligence","score_opus":0.029335824589263423,"score_gpt":0.2996045137148192,"score_spread":0.2702686891255558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402572139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009330175,0.00036375984,0.9819954,0.0007069226,0.0009614065,0.00031613468,0.0000027252802,0.0029235291,0.0033999283],"genre_scores_gemma":[0.4158096,0.0000037730454,0.5823788,0.00077460293,0.00033937595,0.0000062375907,0.000008280986,0.000017194781,0.00066215306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831593,0.00005335073,0.00035616706,0.0006318059,0.00022686587,0.00041585794],"domain_scores_gemma":[0.99903524,0.0003046745,0.000053063482,0.00033676627,0.00015444688,0.00011581284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099767,0.00020997433,0.00021955551,0.00020290038,0.00032471426,0.00049534626,0.00069679244,0.00008452056,0.000013954385],"category_scores_gemma":[0.000033891647,0.0001858925,0.00015162709,0.00049167534,0.000030883755,0.00033693903,0.00046751733,0.0001597368,0.000054874028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009822697,0.00012021524,0.00012304311,0.00014326052,0.0000883912,0.000045087178,0.0009884181,0.026753185,0.003434869,0.6886854,0.08823782,0.19137046],"study_design_scores_gemma":[0.00016772107,0.000061244755,0.00005995742,0.00006235148,0.000005080262,0.000046575336,0.0000045814245,0.9743275,0.0035953224,0.0027050131,0.018708862,0.00025580468],"about_ca_topic_score_codex":0.0000061270616,"about_ca_topic_score_gemma":4.1800982e-7,"teacher_disagreement_score":0.9475743,"about_ca_system_score_codex":0.000056122713,"about_ca_system_score_gemma":0.00013425223,"threshold_uncertainty_score":0.7580476},"labels":[],"label_agreement":null},{"id":"W4402634849","doi":"10.1007/978-3-031-72567-8_14","title":"Detrimental Task Execution Patterns in Mainstream OpenMP® Runtimes","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Engineering and Physical Sciences Research Council; Durham University; Advanced Micro Devices","keywords":"Computer science; Parallel computing; Task (project management); Mainstream; Programming language; Operating system","score_opus":0.011791359499760987,"score_gpt":0.2529430034522362,"score_spread":0.2411516439524752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402634849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002232777,0.00055625406,0.98892605,0.0004614191,0.0013752611,0.00044973177,0.000009315783,0.0005047663,0.00749395],"genre_scores_gemma":[0.5578944,0.00019639729,0.43884793,0.001083481,0.0003710893,0.000023198483,0.000025991885,0.00006301019,0.0014945177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961841,0.000038054262,0.00063594343,0.0017212108,0.00076092477,0.00065974233],"domain_scores_gemma":[0.9982836,0.00019604558,0.00020549113,0.0010690552,0.000110290835,0.00013550735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082760316,0.0005539467,0.00050450413,0.0017177018,0.00016079664,0.00088422233,0.0029603832,0.0003363852,0.000018008852],"category_scores_gemma":[0.000032528755,0.0005291394,0.00013628896,0.0009763945,0.00029300447,0.0006028646,0.0019817066,0.00089314085,0.000085173364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014392147,0.00017488905,0.001112835,0.00017700007,0.000036682733,0.0008054364,0.0018850628,0.22803085,0.00021759928,0.08207835,0.0003259057,0.685141],"study_design_scores_gemma":[0.00029287793,0.00018639171,0.0002924616,0.0012388965,0.000007706289,0.00009825545,3.3109427e-7,0.88357186,0.0025585087,0.10981492,0.0010551761,0.00088260206],"about_ca_topic_score_codex":0.00009147604,"about_ca_topic_score_gemma":0.00006638922,"teacher_disagreement_score":0.6842584,"about_ca_system_score_codex":0.00057435205,"about_ca_system_score_gemma":0.00037701183,"threshold_uncertainty_score":0.99971604},"labels":[],"label_agreement":null},{"id":"W4402634902","doi":"10.1007/978-3-031-72567-8_4","title":"Integrating Multi-FPGA Acceleration to OpenMP Distributed Computing","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Field-programmable gate array; Parallel computing; Acceleration; Computational science; Distributed computing; Embedded system; Physics","score_opus":0.029502028297544673,"score_gpt":0.2952120802992664,"score_spread":0.2657100520017217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402634902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023264209,0.00026366595,0.9917544,0.0011892094,0.0018118965,0.0006771377,0.000012149213,0.0011514697,0.0031167977],"genre_scores_gemma":[0.08701501,0.000014611976,0.9105374,0.001341438,0.0004078301,0.000010814425,0.000030211824,0.000052836116,0.00058980536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954091,0.00004705341,0.0008532546,0.002063641,0.00086271414,0.00076424255],"domain_scores_gemma":[0.99736524,0.00036973067,0.00029149785,0.0012645402,0.0004465802,0.00026238622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012547891,0.0006879006,0.0006248991,0.0012146408,0.00045445893,0.002247325,0.0038717298,0.00034848085,0.000011638345],"category_scores_gemma":[0.00018831312,0.0006395778,0.00015753813,0.0014503354,0.00023518396,0.0006170862,0.0030746623,0.0011515428,0.00010962222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034306206,0.000032463926,0.000017547294,0.000051685693,0.000015381382,0.00007955945,0.0012843698,0.45197657,0.00010989116,0.042452652,0.00020224358,0.5037742],"study_design_scores_gemma":[0.00014162208,0.00012823714,0.000029761417,0.00092530897,0.000006706727,0.00004343954,4.150812e-7,0.9664725,0.0015891291,0.02831159,0.0016194516,0.00073183177],"about_ca_topic_score_codex":0.000037697835,"about_ca_topic_score_gemma":0.000059824502,"teacher_disagreement_score":0.5144959,"about_ca_system_score_codex":0.0005447446,"about_ca_system_score_gemma":0.00042957198,"threshold_uncertainty_score":0.99960554},"labels":[],"label_agreement":null},{"id":"W4402724897","doi":"10.48550/arxiv.2408.05314","title":"rule4ml: An Open-Source Tool for Resource Utilization and Latency Estimation for ML Models on FPGA","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Research Chairs","keywords":"Field-programmable gate array; Open source; Latency (audio); Computer science; Resource (disambiguation); Embedded system; Estimation; Operating system; Telecommunications; Engineering; Computer network; Systems engineering; Software","score_opus":0.1457523296126396,"score_gpt":0.2550926770164411,"score_spread":0.10934034740380152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402724897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011662479,0.000058840382,0.9847103,0.00018284659,0.00015470274,0.0013375398,0.000032057054,0.00084357033,0.0010176641],"genre_scores_gemma":[0.8017025,0.000077985875,0.19580288,0.00018489796,0.000052702657,0.00001967324,0.00015020143,0.000043180033,0.0019659763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981807,0.00009238795,0.0002263133,0.001184497,0.00007439589,0.00024172549],"domain_scores_gemma":[0.99855477,0.00016473558,0.0002035201,0.00079310715,0.00018924806,0.00009460403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004844193,0.0002699072,0.00026573468,0.0002873174,0.00027691037,0.0005886568,0.0013645684,0.0002610651,0.0000013672427],"category_scores_gemma":[0.00005364557,0.00030843713,0.00008597772,0.0003028717,0.000041993095,0.00051745365,0.0017020915,0.00023232403,0.0000034688376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004269875,0.000048078,0.0000043098225,0.00010210905,0.000017265394,0.0000023635048,0.00019947867,0.73006505,0.0000023066077,0.2597969,0.0007793,0.008940148],"study_design_scores_gemma":[0.00027587416,0.00017784278,0.000009330129,0.00013601554,0.00003268361,0.0000011743513,0.000009214729,0.7080872,0.00010078144,0.29008436,0.00083214825,0.00025334163],"about_ca_topic_score_codex":0.00002996165,"about_ca_topic_score_gemma":0.0000039847696,"teacher_disagreement_score":0.79004,"about_ca_system_score_codex":0.00010880812,"about_ca_system_score_gemma":0.00011895829,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W4402791308","doi":"10.1007/978-3-031-73370-3_5","title":"Improved MPI Collectives for 3D-FFT","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Fast Fourier transform; Parallel computing; Programming language; Algorithm","score_opus":0.015659025965667983,"score_gpt":0.2656998293147867,"score_spread":0.2500408033491187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402791308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018956722,0.0009001402,0.9847596,0.00076919,0.0021419022,0.00083517993,0.000011167476,0.000909761,0.009671163],"genre_scores_gemma":[0.003752358,0.000058043854,0.9898759,0.0009103166,0.0004982751,0.00004843622,0.0000065868153,0.00005464113,0.00479544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963569,0.000021128279,0.00054084975,0.0018598777,0.00054034486,0.0006808921],"domain_scores_gemma":[0.99745154,0.00061504997,0.00023700816,0.001161889,0.00038523463,0.00014929552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086762663,0.00056935026,0.00056055974,0.0011126577,0.00035138833,0.0009885571,0.0030297122,0.00037200993,0.000008164034],"category_scores_gemma":[0.00011914742,0.00052223646,0.00020825751,0.00083835673,0.00044667633,0.0003825795,0.0013020043,0.0006603354,0.00002156102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022802054,0.000064855456,0.000007917122,0.00023950261,0.00006460327,0.00005489527,0.001542572,0.057278432,0.00032477046,0.17810534,0.0008662515,0.76142806],"study_design_scores_gemma":[0.00014477938,0.00020579794,0.0000027121887,0.00024823038,0.000008005797,0.000023182334,5.3805923e-8,0.73466796,0.0008139811,0.25837952,0.005035295,0.00047051348],"about_ca_topic_score_codex":0.000010892714,"about_ca_topic_score_gemma":0.000020546235,"teacher_disagreement_score":0.76095754,"about_ca_system_score_codex":0.00034120536,"about_ca_system_score_gemma":0.00070415635,"threshold_uncertainty_score":0.9997229},"labels":[],"label_agreement":null},{"id":"W4402967731","doi":"10.1145/3698365.3698371","title":"The Case of Unsustainable CPU Affinity","year":2024,"lang":"en","type":"article","venue":"ACM SIGEnergy Energy Informatics Review","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Business; Chemistry","score_opus":0.016254783407520235,"score_gpt":0.2829942075504298,"score_spread":0.2667394241429096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402967731","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034923054,0.11586017,0.8692933,0.0013419054,0.00023149917,0.00009972429,0.0000018140056,0.00046182572,0.01267488],"genre_scores_gemma":[0.0846044,0.5876539,0.32117102,0.003512015,0.0001227154,0.0001507244,0.00002620297,0.000040959945,0.0027180833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984525,0.00010934729,0.0008185197,0.00013394647,0.00019819211,0.00028749852],"domain_scores_gemma":[0.99770886,0.0004814714,0.00022816993,0.0012918267,0.00021158365,0.00007810276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093102903,0.00017380594,0.00026852096,0.000101758196,0.00026115865,0.00022869046,0.0015751508,0.00006199729,0.00000766848],"category_scores_gemma":[0.0002920272,0.000113693386,0.00014657596,0.0010154494,0.0000654183,0.00045549122,0.00070777116,0.00011808186,0.000009374779],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0687735e-7,0.000012122592,2.7062177e-7,0.0010286772,0.000033665463,0.00008587452,0.00013582605,0.00406449,0.0000010478938,0.6182548,0.018492576,0.35789025],"study_design_scores_gemma":[0.000037290916,0.000051612475,1.7347793e-7,0.0009264805,0.00002068812,0.00041070627,0.000027992117,0.22678708,0.0008510084,0.012941082,0.7577662,0.00017971142],"about_ca_topic_score_codex":0.0001187738,"about_ca_topic_score_gemma":0.00001623092,"teacher_disagreement_score":0.7392736,"about_ca_system_score_codex":0.00004646231,"about_ca_system_score_gemma":0.00021955642,"threshold_uncertainty_score":0.46362817},"labels":[],"label_agreement":null},{"id":"W4403005583","doi":"10.48550/arxiv.2409.01495","title":"The Compressor-Retriever Architecture for Language Model OS","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Architecture; Labrador Retriever; Computer science; Medicine; Geography; Archaeology","score_opus":0.049576309456386955,"score_gpt":0.21203298642914709,"score_spread":0.16245667697276012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403005583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003949528,0.00048276188,0.9908297,0.00052146346,0.0003883436,0.00045258785,0.0000324738,0.0009744091,0.0023687354],"genre_scores_gemma":[0.9424389,0.00014273362,0.04902582,0.00019482833,0.000092075665,0.000004852413,0.000017297585,0.000027975471,0.008055494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854606,0.000075142816,0.00016218743,0.0008162268,0.00008561437,0.00031476194],"domain_scores_gemma":[0.99829113,0.00023384142,0.00013516769,0.0011261643,0.00012744471,0.00008626945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757313,0.00025910535,0.0002145499,0.00014866187,0.00029569888,0.00032240417,0.0022631804,0.00022010013,0.0000016310049],"category_scores_gemma":[0.000037701622,0.00021743028,0.00024874764,0.0003434258,0.00008875391,0.000067696295,0.002686611,0.00064498564,0.000016584403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013964156,0.0000132108225,0.0000037324176,0.00006275143,0.00004399844,0.000020915293,0.00034111115,0.8470798,0.000008525222,0.14594387,0.0053467336,0.0011213963],"study_design_scores_gemma":[0.00011820789,0.000016261534,0.0000022992776,0.000051137344,0.000025186406,0.000001722352,0.000012075141,0.7842065,0.00015962002,0.21329993,0.0018955785,0.00021148208],"about_ca_topic_score_codex":0.000025263493,"about_ca_topic_score_gemma":0.000013149516,"teacher_disagreement_score":0.9418039,"about_ca_system_score_codex":0.00008717679,"about_ca_system_score_gemma":0.00016315424,"threshold_uncertainty_score":0.886655},"labels":[],"label_agreement":null},{"id":"W4403061208","doi":"10.1109/rtcsa62462.2024.00021","title":"Duration-based Instruction Cache Locking","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Duration (music); Parallel computing","score_opus":0.015153297389006759,"score_gpt":0.258139634026646,"score_spread":0.24298633663763927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403061208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095715804,0.00007501963,0.9863618,0.0010749503,0.00033635116,0.000043612214,1.263729e-7,0.002250676,0.0089003155],"genre_scores_gemma":[0.68745965,0.0000023986704,0.3119512,0.00020484255,0.000040931056,0.000003772336,0.0000016720819,0.0000033833717,0.00033214837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994805,0.000022173606,0.0001182555,0.00018875531,0.00010524504,0.00008510921],"domain_scores_gemma":[0.99970865,0.00004091366,0.00001638318,0.00017308278,0.00003665938,0.000024318528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013605422,0.000055319662,0.00004179948,0.00011728992,0.00007510984,0.00030645818,0.00020219843,0.00003125332,0.000018826164],"category_scores_gemma":[0.000014411405,0.00004774525,0.000028221113,0.00037198607,0.000009791545,0.00026517748,0.00003485874,0.00006300355,0.000039699153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018614544,0.000028496605,0.00035221284,0.00005031321,0.000016551912,0.000019435869,0.00038992803,0.08986028,0.000625432,0.5997336,0.014917147,0.29400474],"study_design_scores_gemma":[0.00003798829,0.000012135437,0.00007077332,0.000018569133,9.567117e-7,0.0000062939653,0.0000018845504,0.9847048,0.0072268015,0.0021757782,0.0056764926,0.00006751308],"about_ca_topic_score_codex":0.00001540549,"about_ca_topic_score_gemma":0.0000017386516,"teacher_disagreement_score":0.89484453,"about_ca_system_score_codex":0.00002918191,"about_ca_system_score_gemma":0.00006381383,"threshold_uncertainty_score":0.29551834},"labels":[],"label_agreement":null},{"id":"W4403864027","doi":"10.23919/annsim61499.2024.10732662","title":"Flattened Parallel DEVS Simulations on GPU Architectures","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; DEVS; Parallel computing; Computational science; General-purpose computing on graphics processing units; Discrete event simulation; Computer architecture; Distributed computing; Computer graphics (images); Modeling and simulation; Simulation; Graphics","score_opus":0.01896411824136749,"score_gpt":0.2836682702820986,"score_spread":0.2647041520407311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403864027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017005072,0.00009924924,0.9728386,0.0025870106,0.00018494204,0.00009649783,0.0000011408429,0.0025377816,0.019954313],"genre_scores_gemma":[0.6967028,0.000005073029,0.3008826,0.00090902427,0.000050863502,0.000004921774,0.0000028083016,0.000007275429,0.00143468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914753,0.000038764505,0.000149284,0.00032331343,0.00016798575,0.00017313966],"domain_scores_gemma":[0.9993303,0.00020244699,0.000016823957,0.0003637129,0.000030446221,0.000056290384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007883665,0.00011231744,0.00008503395,0.00020066032,0.000109612694,0.00029502876,0.00043572736,0.00004468,0.000040470353],"category_scores_gemma":[0.000025898113,0.000087980974,0.000057995323,0.00037819316,0.000017862989,0.000090400405,0.000103704806,0.00012334104,0.00013345167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024305562,0.000024659608,0.00005586455,0.0000081991975,0.000016731492,0.000012122531,0.00022024292,0.7050441,0.000064706466,0.24725716,0.010390063,0.036903724],"study_design_scores_gemma":[0.00005444007,0.000049116872,0.00019274902,0.000025002986,0.0000018900846,0.0000057989614,0.0000013506348,0.96711296,0.000687627,0.023123736,0.008612309,0.00013304836],"about_ca_topic_score_codex":0.000013927091,"about_ca_topic_score_gemma":0.0000069386037,"teacher_disagreement_score":0.69500226,"about_ca_system_score_codex":0.000019613555,"about_ca_system_score_gemma":0.00004143868,"threshold_uncertainty_score":0.35877597},"labels":[],"label_agreement":null},{"id":"W4403943995","doi":"10.1103/prxquantum.5.040316","title":"Time-Dependent Hamiltonian Simulation Using Discrete-Clock Constructions","year":2024,"lang":"en","type":"article","venue":"PRX Quantum","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation of Sri Lanka","keywords":"Computer science; Hamiltonian (control theory); Statistical physics; Mathematics; Physics; Mathematical optimization","score_opus":0.024254203508049032,"score_gpt":0.30339418735306045,"score_spread":0.27913998384501143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403943995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008017318,0.00030376718,0.9880034,0.0003250703,0.0005627248,0.00013232566,0.000003819665,0.0016219742,0.0010296243],"genre_scores_gemma":[0.89363956,0.000010551752,0.10580772,0.000056409684,0.000085164276,0.0000043484415,0.0000034015982,0.000013991064,0.00037882937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989382,0.00006879159,0.00022465365,0.00035401163,0.00020892614,0.00020543077],"domain_scores_gemma":[0.99938446,0.000110225716,0.000049113478,0.00032687624,0.00006436019,0.00006493981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021082023,0.00012422958,0.00011604727,0.00017606762,0.00020494292,0.00036540325,0.00032789548,0.00006182487,0.000028770031],"category_scores_gemma":[0.000033392902,0.00011824863,0.000063513515,0.00039613125,0.00005187058,0.00040779213,0.00015271243,0.00013726663,0.00014264228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002003911,0.00002023932,0.000065439664,0.000023674913,0.00002343734,0.000015922311,0.0004077509,0.9385498,0.00051963044,0.05346412,0.00058136653,0.006326596],"study_design_scores_gemma":[0.000052124153,0.00002353603,0.000036722377,0.00005978898,0.000007909032,0.000031994467,0.000006845518,0.9895914,0.00034148621,0.0071994895,0.002494836,0.00015384487],"about_ca_topic_score_codex":0.00002069564,"about_ca_topic_score_gemma":8.635608e-7,"teacher_disagreement_score":0.88562226,"about_ca_system_score_codex":0.00006737162,"about_ca_system_score_gemma":0.00008838482,"threshold_uncertainty_score":0.48220393},"labels":[],"label_agreement":null},{"id":"W4404057240","doi":"10.1109/cases60062.2024.00011","title":"Work-in-Progress:ACPO: An AI-Enabled Compiler Framework","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Compiler; Work (physics); Programming language; Engineering","score_opus":0.01704291282491489,"score_gpt":0.3060309845694917,"score_spread":0.2889880717445768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404057240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011722753,0.00066093716,0.98611075,0.0026694692,0.00044928343,0.00012528319,2.9393786e-7,0.0028315901,0.005980128],"genre_scores_gemma":[0.46888253,0.000017454819,0.5294909,0.0008932472,0.00006818649,0.000013861674,0.0000021381834,0.0000109153225,0.0006208016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986688,0.000084582636,0.0002363853,0.0004929347,0.00020664293,0.00031064145],"domain_scores_gemma":[0.999158,0.000105192754,0.000023133613,0.0005667375,0.000051073708,0.0000958447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003520231,0.00014535876,0.00015397047,0.00022844215,0.00007135144,0.0007215555,0.00083611003,0.00011482769,0.00008911886],"category_scores_gemma":[0.000016879827,0.00012396276,0.00005050695,0.0012160122,0.0000400347,0.0005683542,0.00021630457,0.00032645703,0.00013057508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011975159,0.0001920055,0.0043913317,0.00003909545,0.000021693335,0.000144964,0.0013363069,0.010475322,0.000008441657,0.8272819,0.043724224,0.11237275],"study_design_scores_gemma":[0.000092058326,0.00007314598,0.0014720996,0.00022808186,0.0000022993,0.000009112888,0.000008905645,0.9381511,0.00028119612,0.042233843,0.0171525,0.00029562306],"about_ca_topic_score_codex":0.000011792003,"about_ca_topic_score_gemma":0.0000026503021,"teacher_disagreement_score":0.9276758,"about_ca_system_score_codex":0.00003652157,"about_ca_system_score_gemma":0.00005798481,"threshold_uncertainty_score":0.6957976},"labels":[],"label_agreement":null},{"id":"W4404516313","doi":"10.1016/j.cpc.2024.109437","title":"TorchAmi: Generalized CPU/GPU implementation of algorithmic matsubara integration","year":2024,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Computational science; CUDA; Algebra over a field; Mathematics; Pure mathematics","score_opus":0.03735373262090503,"score_gpt":0.3388699826398673,"score_spread":0.30151625001896226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404516313","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056624017,0.00056787604,0.99595034,0.0009862216,0.000291645,0.00025178675,0.0000106491225,0.0008091103,0.0005661256],"genre_scores_gemma":[0.28822446,0.00022298247,0.7111532,0.00010886793,0.000107710395,0.00004260764,0.00009448327,0.000013820073,0.000031845007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987252,0.0001881443,0.0004242035,0.00029392957,0.00019854074,0.0001699961],"domain_scores_gemma":[0.9978354,0.00015137915,0.00012998139,0.0016277999,0.00020700967,0.00004843614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024742293,0.00015943819,0.00018713335,0.00015045638,0.00017382103,0.00026200656,0.0016321371,0.0000494734,0.00000623382],"category_scores_gemma":[0.0000023747316,0.00016211165,0.00012079821,0.00072218943,0.00007905543,0.0005642745,0.0007029169,0.00018823775,0.000022401813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.8319705e-7,0.00006530408,0.000020084188,0.000022312452,0.000038038397,6.0034097e-7,0.0017016309,0.0018435738,0.0008734892,0.54201967,0.0026671083,0.45074758],"study_design_scores_gemma":[0.00012767359,0.000049170427,0.00018641427,0.00006213559,0.000010938193,0.000004631238,0.000020013098,0.97181314,0.00236362,0.023072263,0.0021311496,0.00015885413],"about_ca_topic_score_codex":0.000079050486,"about_ca_topic_score_gemma":0.000008665496,"teacher_disagreement_score":0.9699696,"about_ca_system_score_codex":0.00006486159,"about_ca_system_score_gemma":0.00011597504,"threshold_uncertainty_score":0.66107213},"labels":[],"label_agreement":null},{"id":"W4404667156","doi":"10.5220/0013016800003837","title":"Tangled Program Graphs with Indexed Memory in Control Tasks with Short Time Dependencies","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Control (management); Parallel computing; Worst-case execution time; Execution time; Programming language; Artificial intelligence","score_opus":0.007030125426598868,"score_gpt":0.2354232740455335,"score_spread":0.22839314861893464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404667156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011261224,0.00019415142,0.96968496,0.0003391091,0.000043009597,0.00067673175,9.1493587e-7,0.0034732122,0.014326663],"genre_scores_gemma":[0.7440571,0.0000047047924,0.25492808,0.0001570886,0.000012001703,0.000099562974,0.000002593071,0.000013122245,0.00072574907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868155,0.000059560876,0.00019364183,0.00045172498,0.00031906675,0.00029446924],"domain_scores_gemma":[0.99938625,0.00007708652,0.000024993167,0.00035681794,0.00008228174,0.00007259501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031300366,0.00018138383,0.00020674495,0.000294868,0.00005868585,0.00036999074,0.00050579815,0.0000679816,0.000018476156],"category_scores_gemma":[0.000007673716,0.0001176623,0.00003601611,0.0009850659,0.00006839967,0.00038423366,0.00007058486,0.00019403212,0.000019417823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004927951,0.0017101085,0.030931208,0.00032092902,0.0007771714,0.003064809,0.005081017,0.098959,0.0021528555,0.093769275,0.01676546,0.7459754],"study_design_scores_gemma":[0.00055906625,0.00069822144,0.0011691427,0.00015856832,0.000013589351,0.000101749334,0.000024794768,0.9933041,0.0019567139,0.00095371663,0.0006732226,0.00038712274],"about_ca_topic_score_codex":0.000041482577,"about_ca_topic_score_gemma":0.00006684419,"teacher_disagreement_score":0.8943451,"about_ca_system_score_codex":0.000035295405,"about_ca_system_score_gemma":0.00014230667,"threshold_uncertainty_score":0.47981292},"labels":[],"label_agreement":null},{"id":"W4404848770","doi":"10.1109/igsc64514.2024.00037","title":"Low-Power Register File for Tensor Cores","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Register file; Computer science; Register (sociolinguistics); Tensor (intrinsic definition); Power (physics); Parallel computing; Physics; Instruction set; Mathematics; Geometry","score_opus":0.017921237333541996,"score_gpt":0.2749139673076215,"score_spread":0.2569927299740795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041554125,0.000094893374,0.9684784,0.001100865,0.00027420605,0.0001269806,0.000010823965,0.0015964719,0.028275797],"genre_scores_gemma":[0.051448897,0.000009222014,0.8978046,0.0014965311,0.00008258939,0.000066932545,0.000014953093,0.000014606285,0.04906164],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938005,0.000010849607,0.000116784984,0.00026224606,0.00008441824,0.00014566525],"domain_scores_gemma":[0.99943846,0.00016395329,0.000016726035,0.000286484,0.000058803103,0.000035580528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010969136,0.00007366521,0.000073291,0.000072508934,0.000056682715,0.0002834701,0.0003682762,0.00003737919,0.0002957865],"category_scores_gemma":[0.000039436763,0.00005650271,0.00006285467,0.00016373837,0.000017463652,0.00017757219,0.00009247751,0.000045334513,0.00009235818],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012831113,0.000011211743,0.0000033489239,0.000016537895,0.0000055800065,0.0000036285799,0.00009458682,0.00019471973,0.000030319838,0.07578979,0.91707647,0.0067725],"study_design_scores_gemma":[0.00005795838,0.00007289601,0.000042208732,0.000054222866,0.0000015653162,0.000008470279,0.000003437432,0.6433556,0.002400142,0.0059648072,0.34790495,0.0001337644],"about_ca_topic_score_codex":0.000002993675,"about_ca_topic_score_gemma":6.028009e-7,"teacher_disagreement_score":0.6431609,"about_ca_system_score_codex":0.000012479006,"about_ca_system_score_gemma":0.000031364667,"threshold_uncertainty_score":0.3238655},"labels":[],"label_agreement":null},{"id":"W4404954833","doi":"10.1109/micro61859.2024.00029","title":"A Case for Speculative Address Translation with Rapid Validation for GPUs","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Research Foundation of Korea","keywords":"Computer science; Translation (biology); Parallel computing; Programming language","score_opus":0.05516113104157151,"score_gpt":0.31109214119090955,"score_spread":0.25593101014933806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404954833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004739591,0.00009931685,0.9955146,0.00059677963,0.00010580414,0.0007150974,0.0000081114085,0.0007890497,0.001697287],"genre_scores_gemma":[0.35640717,0.0000025238094,0.64310324,0.000041110347,0.00004445051,0.00011107805,0.000017144204,0.000007905412,0.00026539544],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993828,0.000020709855,0.00012796799,0.00027090847,0.00007877273,0.00011887009],"domain_scores_gemma":[0.9994616,0.00022573373,0.000028707562,0.0001447905,0.00010996302,0.000029214398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021339103,0.00008429654,0.000079723344,0.000100302444,0.0001033923,0.00023144083,0.0001232652,0.000035168105,0.0000057491707],"category_scores_gemma":[0.000010667121,0.000065127264,0.000050588184,0.00022369016,0.00001206024,0.00034880984,0.000011629043,0.000031289354,0.0000016476704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010783588,0.000087360946,0.000008772314,0.0003053969,0.00012589473,0.00012022156,0.0044767545,0.04822592,0.00049100653,0.4345842,0.007958442,0.5035082],"study_design_scores_gemma":[0.00027189034,0.00021087562,0.0000015287217,0.000029705223,0.000011503323,0.00015537109,0.000012691021,0.9718748,0.01583027,0.004821769,0.0066594905,0.00012013129],"about_ca_topic_score_codex":0.0000060738766,"about_ca_topic_score_gemma":0.000003291017,"teacher_disagreement_score":0.92364883,"about_ca_system_score_codex":0.000019361187,"about_ca_system_score_gemma":0.00004096331,"threshold_uncertainty_score":0.26558128},"labels":[],"label_agreement":null},{"id":"W4404954870","doi":"10.1109/micro61859.2024.00051","title":"Low-Overhead General-Purpose Near-Data Processing in CXL Memory Expanders","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Ministry of Science and ICT, South Korea","keywords":"Computer science; Overhead (engineering); Memory management; Parallel computing; Embedded system; Computer hardware; Operating system; Semiconductor memory","score_opus":0.03581298967467898,"score_gpt":0.30730844062067786,"score_spread":0.27149545094599886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404954870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028941894,0.0011113137,0.98454285,0.0008489328,0.0002460537,0.00012879669,0.0000010730433,0.0015260832,0.008700711],"genre_scores_gemma":[0.51750004,0.00010031326,0.47879583,0.00083553686,0.00009211543,0.000011667734,0.000015212502,0.000018940878,0.0026303197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986502,0.00005112449,0.00024868152,0.0005831944,0.00020895379,0.00025786195],"domain_scores_gemma":[0.99916714,0.00003679662,0.000028699771,0.0006726163,0.00003351036,0.000061237384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043805843,0.00013112604,0.00013129273,0.00014968032,0.00009080525,0.0007953241,0.001209067,0.000064021086,0.000019771634],"category_scores_gemma":[0.000026658403,0.000115286995,0.000027820071,0.00067601097,0.000038371316,0.0009931037,0.0005898834,0.00016257861,0.000042589556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003233019,0.000106813844,0.00012251505,0.00016079056,0.000008957841,0.00011787462,0.0016834429,0.020070106,0.00041913742,0.00887711,0.04388536,0.92454463],"study_design_scores_gemma":[0.000096442105,0.000016141481,0.00008319846,0.000117564625,0.0000015977303,0.000012183771,0.000014650696,0.99407214,0.0014696352,0.000905751,0.0030423498,0.00016833584],"about_ca_topic_score_codex":0.00007556174,"about_ca_topic_score_gemma":0.00002186736,"teacher_disagreement_score":0.97400206,"about_ca_system_score_codex":0.00004554614,"about_ca_system_score_gemma":0.00023630058,"threshold_uncertainty_score":0.76693285},"labels":[],"label_agreement":null},{"id":"W4404955552","doi":"10.1109/micro61859.2024.00006","title":"Message from the MICRO 2024 Program Chairs","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Programming language","score_opus":0.014329702405966373,"score_gpt":0.27452707327999154,"score_spread":0.26019737087402517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404955552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002973032,0.001305946,0.9492513,0.0057507157,0.0006211695,0.00017025626,0.0000023440975,0.0033243468,0.039276626],"genre_scores_gemma":[0.15814601,0.00011872107,0.81843007,0.0015386014,0.00024300498,0.000061509185,0.0000070084993,0.00001590049,0.021439165],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993107,0.000039091083,0.00011024337,0.000274699,0.00012235147,0.00014292287],"domain_scores_gemma":[0.99940574,0.00014700014,0.000013507959,0.00037964465,0.000022542512,0.00003155164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001772383,0.000082923354,0.00006241164,0.000030717478,0.00008729264,0.0006222201,0.0007537549,0.000035594636,0.00009098481],"category_scores_gemma":[0.000011518385,0.000048876755,0.00005377224,0.00031764785,0.000027348644,0.00011466119,0.00022989628,0.00012213753,0.00012606292],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.131583e-7,0.000041513198,0.00007524369,0.000007649416,0.000030611383,0.000021687956,0.00073547335,0.00027943362,0.00014639388,0.07619492,0.62720066,0.29526561],"study_design_scores_gemma":[0.000040338957,0.00003471505,0.00016119263,0.000049839393,0.0000044100384,0.0000058796027,0.000014862973,0.6049348,0.002653304,0.009314147,0.3826466,0.00013991915],"about_ca_topic_score_codex":0.00007461747,"about_ca_topic_score_gemma":0.0000059846825,"teacher_disagreement_score":0.6046554,"about_ca_system_score_codex":0.000012549496,"about_ca_system_score_gemma":0.00003474293,"threshold_uncertainty_score":0.60000825},"labels":[],"label_agreement":null},{"id":"W4405675217","doi":"10.1007/978-3-031-76273-4_12","title":"Introducing Novel Parallel Computing Using Orbital Data","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Information retrieval","score_opus":0.0880867427648737,"score_gpt":0.3380531793774628,"score_spread":0.2499664366125891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405675217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001042288,0.00070706604,0.9088895,0.00063582446,0.00046692186,0.00027563696,0.000021025995,0.00038622835,0.088607416],"genre_scores_gemma":[0.008218997,0.00062038633,0.9897397,0.00041136876,0.00010324879,0.0000030307274,0.00012300763,0.000016388556,0.0007638387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974249,0.00001780686,0.001004574,0.0006882353,0.00052927097,0.0003352303],"domain_scores_gemma":[0.994247,0.00021312528,0.0004204991,0.004631407,0.00037256174,0.00011535824],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0020568394,0.00031772308,0.00034715468,0.0013801501,0.0006314922,0.0017203253,0.00788186,0.00015554497,0.0000024221956],"category_scores_gemma":[0.00007133881,0.00032840273,0.00004505186,0.00073803065,0.0006711764,0.008051746,0.014327395,0.000711153,0.00004283991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012301696,0.00001843986,0.000012304412,0.000054233507,0.000012761636,0.0000013065986,0.0012202123,0.025721809,0.000004797062,0.9055323,0.00038425857,0.06703635],"study_design_scores_gemma":[0.00013486999,0.00001989004,0.00004312915,0.00039064864,0.0000079809815,0.000094323,0.00000873335,0.9627303,0.000002606491,0.006423981,0.02979338,0.00035015083],"about_ca_topic_score_codex":0.000031279727,"about_ca_topic_score_gemma":0.0000040055334,"teacher_disagreement_score":0.9370085,"about_ca_system_score_codex":0.00019696925,"about_ca_system_score_gemma":0.00043476163,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W4406083589","doi":"10.1007/978-3-030-54621-2_129-1","title":"Direct Search Luus–Jaakola Optimization Procedure","year":2024,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01267615159411441,"score_gpt":0.24737192570591815,"score_spread":0.23469577411180373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406083589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.157042e-7,0.0009676799,0.51623833,0.00015471867,0.0003869527,0.00037898243,0.0000122189485,0.0007273843,0.48113343],"genre_scores_gemma":[0.00017198874,0.008345532,0.5821883,0.00007607372,0.00030869633,0.000031749005,0.00029577102,0.00014542286,0.40843648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968177,0.00005176785,0.0009090087,0.0010501998,0.00079923053,0.0003720743],"domain_scores_gemma":[0.9978134,0.00012131784,0.0003473985,0.00093682774,0.0006322721,0.00014880442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004478035,0.00058531616,0.00064014585,0.0008347877,0.00015181553,0.00023444765,0.0011530716,0.0006170818,0.00021444677],"category_scores_gemma":[0.00008303053,0.0006001798,0.000244078,0.00045082293,0.00010504741,0.00057144475,0.00050533336,0.0005149561,0.00006921149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071132076,0.000030097564,0.0000041048083,0.00020627817,0.000059469883,0.0000117183545,0.00026788661,0.9470177,0.0000012569303,0.044702806,0.0062615247,0.0014300195],"study_design_scores_gemma":[0.00017067377,0.00012848925,0.0000014633907,0.0005420196,0.00006996512,0.000015976984,0.0000036339911,0.96455,0.00012235352,0.0021950174,0.031573024,0.0006273591],"about_ca_topic_score_codex":0.0000063133407,"about_ca_topic_score_gemma":0.0000010567469,"teacher_disagreement_score":0.07269697,"about_ca_system_score_codex":0.00015036776,"about_ca_system_score_gemma":0.00040360016,"threshold_uncertainty_score":0.99964494},"labels":[],"label_agreement":null},{"id":"W4406110898","doi":"10.1109/tc.2025.3525606","title":"Karatsuba Matrix Multiplication and Its Efficient Custom Hardware Implementations","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Matrix multiplication; Scalar multiplication; Multiplication algorithm; Computer science; Multiplication (music); Parallel computing; Multiplier (economics); Reduction (mathematics); Arithmetic; Scalar (mathematics); Algorithm; Mathematics; Binary number","score_opus":0.015170705946591881,"score_gpt":0.2995743447746522,"score_spread":0.28440363882806036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406110898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033677253,0.00007340082,0.9932036,0.0013377873,0.00061833346,0.00037040946,0.000010514802,0.00076346594,0.00025478992],"genre_scores_gemma":[0.85714084,0.000043104836,0.14193869,0.00048424854,0.000013513657,0.000060498136,0.000003393731,0.000008069341,0.0003076397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881494,0.00007672406,0.00027751562,0.0004502939,0.00016472129,0.00021578671],"domain_scores_gemma":[0.9991861,0.0001678779,0.000071244016,0.00037528647,0.00012231874,0.0000771887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014861213,0.00016778486,0.00014654426,0.00039485964,0.0004413108,0.00018056511,0.0004303737,0.00006243273,0.0000056298495],"category_scores_gemma":[0.0000031806044,0.00017784424,0.0000715745,0.0006440099,0.000027433724,0.00016710663,0.000010816625,0.00015565833,0.000023400937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001094606,0.0001907943,0.000012463571,0.000026715677,0.00004937541,0.000002092325,0.00050225673,0.90763205,0.00057010096,0.010709915,0.002339659,0.07795365],"study_design_scores_gemma":[0.00042838024,0.000049163038,0.00015249616,0.0000516281,0.000013888384,0.0000055866262,0.000016124259,0.98283356,0.015157387,0.00013590214,0.000987295,0.00016858256],"about_ca_topic_score_codex":0.0000142711815,"about_ca_topic_score_gemma":0.0000036201093,"teacher_disagreement_score":0.8537731,"about_ca_system_score_codex":0.00008077475,"about_ca_system_score_gemma":0.000063058666,"threshold_uncertainty_score":0.7252277},"labels":[],"label_agreement":null},{"id":"W4406120973","doi":"10.1088/2632-2153/ada71c","title":"rule4ml: an open-source tool for resource utilization and latency estimation for ML models on FPGA","year":2025,"lang":"en","type":"article","venue":"Machine Learning Science and Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut interdisciplinaire d'innovation technologique; Université de Sherbrooke","funders":"","keywords":"Field-programmable gate array; Open source; Latency (audio); Computer science; Estimation; Resource (disambiguation); Embedded system; Operating system; Engineering; Computer network; Telecommunications; Software; Systems engineering","score_opus":0.02588689577435285,"score_gpt":0.3162581162998396,"score_spread":0.29037122052548675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406120973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016557217,0.0001200326,0.97775817,0.0037127126,0.000036397796,0.0005425422,0.0000012677797,0.0007394386,0.00053225073],"genre_scores_gemma":[0.6691845,0.000026719475,0.32985595,0.00038820086,0.000006032784,0.00008694978,0.000008386831,0.000008056374,0.0004351881],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987961,0.000034795765,0.00018348939,0.0006032485,0.00013158632,0.00025077086],"domain_scores_gemma":[0.99919647,0.0001243059,0.0001029165,0.00032450721,0.00021618138,0.000035640693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011954006,0.00012010929,0.0001538729,0.0006188537,0.0009703939,0.00041699636,0.0009370046,0.00010645645,3.4489318e-7],"category_scores_gemma":[0.00069555925,0.00011204958,0.000010755548,0.0011021036,0.00023129088,0.00064293883,0.00048587268,0.0001495406,3.027245e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001580868,0.000038210404,0.000324461,0.000018955288,0.000002867011,1.8712522e-7,0.00015185331,0.047483105,0.00031054337,0.3970059,0.00013364677,0.55451447],"study_design_scores_gemma":[0.000337324,0.0004701812,0.00010417344,0.000035238598,0.00000399266,0.0000042001893,0.000016028218,0.91503084,0.0016073892,0.07638402,0.0058909683,0.00011565936],"about_ca_topic_score_codex":0.000015653291,"about_ca_topic_score_gemma":0.0000023598545,"teacher_disagreement_score":0.8675477,"about_ca_system_score_codex":0.00003004164,"about_ca_system_score_gemma":0.00008989857,"threshold_uncertainty_score":0.74635834},"labels":[],"label_agreement":null},{"id":"W4406157368","doi":"10.1109/scw63240.2024.00065","title":"Design and Implementation of MPI-Native GPU-Initiated MPI Partitioned Communication","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Message passing; Message Passing Interface","score_opus":0.05510419237434539,"score_gpt":0.3494644485519362,"score_spread":0.2943602561775908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406157368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015921037,0.00026879046,0.99541557,0.0008115388,0.00003006843,0.0001790358,0.0000011455496,0.0005010457,0.001200708],"genre_scores_gemma":[0.6670327,0.00013049293,0.33269125,0.00007419263,0.000003388966,0.000014800271,0.000010000918,0.0000031457698,0.00004003798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.0001570598,0.00019438744,0.00015405354,0.00010257278,0.00007963901],"domain_scores_gemma":[0.99940354,0.00018185012,0.00005398524,0.00020194413,0.00013443576,0.000024218993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039159556,0.00006229755,0.00007533079,0.000107770655,0.00007503663,0.000111948575,0.00019865412,0.000026487989,0.000027806029],"category_scores_gemma":[0.000012154329,0.00005700813,0.000014522196,0.000364533,0.0000324628,0.00037097596,0.000099101046,0.000048506656,0.0000044739627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014302689,0.00011134162,0.00041024192,0.000113820926,0.00013238065,0.0000057753805,0.012832866,0.012470229,0.0026418604,0.82563424,0.020104239,0.1255287],"study_design_scores_gemma":[0.00017642819,0.00010423923,0.00075406005,0.000050592065,0.0000075890157,0.0000048331763,0.000117795076,0.92893726,0.04936673,0.020057058,0.0003108792,0.0001125405],"about_ca_topic_score_codex":0.000044404682,"about_ca_topic_score_gemma":0.0000038186936,"teacher_disagreement_score":0.916467,"about_ca_system_score_codex":0.000017659408,"about_ca_system_score_gemma":0.00005190082,"threshold_uncertainty_score":0.2324724},"labels":[],"label_agreement":null},{"id":"W4406403030","doi":"10.1007/s10703-024-00467-w","title":"A scalable entropy estimator","year":2025,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministry of Education - Singapore; National Research Foundation Singapore; National Science Foundation","keywords":"Estimator; Statistics; Computer science; Econometrics; Mathematics","score_opus":0.03761707096719169,"score_gpt":0.3607803377685572,"score_spread":0.32316326680136553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406403030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022585464,0.00021988965,0.9872928,0.00007601955,0.00048351375,0.00034075842,2.6042215e-7,0.00080496114,0.010759214],"genre_scores_gemma":[0.02489937,0.000003821946,0.9744651,0.000088569206,0.000015591559,0.00007815611,3.0465267e-7,0.000006020766,0.00044310623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779034,0.0009879716,0.00042501025,0.0003065833,0.00013632308,0.0003537536],"domain_scores_gemma":[0.9988425,0.000442044,0.000103370876,0.00048976246,0.00007151381,0.000050829447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036573748,0.00013812596,0.00027251037,0.00033064059,0.00014194273,0.0001502787,0.0008415812,0.000095492636,0.0000023751],"category_scores_gemma":[0.00017822212,0.00012591011,0.000053241616,0.00091661385,0.000020819452,0.00041674357,0.00024677924,0.00012939106,0.000016585307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027348564,0.000059802045,0.00044499728,0.00021662959,0.000022149496,0.000019709032,0.00028046293,0.04735812,0.00071804447,0.8561396,0.0033405945,0.091372535],"study_design_scores_gemma":[0.00024509177,0.0000430465,0.0001095156,0.00022704297,0.000003231046,0.000013890531,0.000021738568,0.9778718,0.015972193,0.0042209867,0.0011425181,0.00012898112],"about_ca_topic_score_codex":0.000016060647,"about_ca_topic_score_gemma":1.4910678e-7,"teacher_disagreement_score":0.9305136,"about_ca_system_score_codex":0.00014141851,"about_ca_system_score_gemma":0.00011964922,"threshold_uncertainty_score":0.51344657},"labels":[],"label_agreement":null},{"id":"W4406408912","doi":"10.6112/kscfe.2024.29.4.175","title":"COMPARISON OF PARALLELIZATION PERFORMANCE OF FIRE DYNAMIC SIMULATOR(FDS) PROGRAM","year":2024,"lang":"en","type":"article","venue":"Journal of computational fluids engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Computer science; Fire Dynamics Simulator; Simulation; Parallel computing; Aerospace engineering; Engineering; Computational fluid dynamics","score_opus":0.011135006350133958,"score_gpt":0.3036065021899412,"score_spread":0.2924714958398072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406408912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2616426,0.0009627177,0.73689324,0.000048289286,0.00024078203,0.00006759322,8.5226594e-7,0.0001238042,0.000020128891],"genre_scores_gemma":[0.700535,0.00003768909,0.2993752,0.0000038757776,0.000029115434,0.0000011825316,0.0000030927715,0.000008333347,0.000006507569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998545,0.000023058285,0.00076822407,0.00011629745,0.00042853478,0.000118892596],"domain_scores_gemma":[0.9990088,0.00019550418,0.00022587823,0.00011216182,0.00040779694,0.000049913004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029955615,0.000117700656,0.0002873179,0.00030612855,0.000027978693,0.000057091187,0.00037977996,0.000053036332,0.0000028357915],"category_scores_gemma":[0.000044163447,0.000111142755,0.00011328918,0.0005419402,0.000020924215,0.00040568452,0.00005760846,0.00016191632,0.0000010096788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058317787,0.00006556396,0.0005224247,0.00021368843,0.000035801164,0.0000024311205,0.00022303834,0.97467494,0.00044921867,0.0028847521,0.00011708854,0.020805249],"study_design_scores_gemma":[0.00013773456,0.0003432514,0.0028476634,0.00038844906,0.000011321919,0.000028888098,0.0000031216234,0.99401605,0.0016332389,0.00029486354,0.00019833405,0.00009710517],"about_ca_topic_score_codex":6.443462e-7,"about_ca_topic_score_gemma":3.486986e-8,"teacher_disagreement_score":0.43889236,"about_ca_system_score_codex":0.000049782062,"about_ca_system_score_gemma":0.00011842619,"threshold_uncertainty_score":0.45322698},"labels":[],"label_agreement":null},{"id":"W4406428192","doi":"10.1145/3711926","title":"Maximizing Data and Hardware Reuse for HLS with Early-Stage Symbolic Partitioning","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Architecture and Code Optimization","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Reuse; High-level synthesis; Parallel computing; Computer architecture; Embedded system; Field-programmable gate array; Programming language","score_opus":0.023446393610317383,"score_gpt":0.2755962635566579,"score_spread":0.25214986994634053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406428192","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006383039,0.00010710086,0.9952142,0.0029835752,0.000049801914,0.00036366342,0.00006119666,0.0003590806,0.000223055],"genre_scores_gemma":[0.08230866,0.00022388127,0.91644907,0.0004946145,0.000012918686,0.0000611926,0.000049924784,0.0000140550055,0.00038567735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00005236066,0.00018258038,0.00051965896,0.00010739826,0.00018467556],"domain_scores_gemma":[0.9984722,0.00017531529,0.000068452544,0.0011441833,0.000080972066,0.000058872218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016427173,0.00016134928,0.0001575375,0.00023475228,0.00051888,0.00027493056,0.00072119833,0.000071704584,0.000003324907],"category_scores_gemma":[0.000061972954,0.00014422605,0.000022414008,0.0003670115,0.000051761457,0.00032671177,0.000082992534,0.00015694996,2.830939e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005698902,0.000037324317,0.00007795446,0.000044517943,0.000041674786,0.0000011072302,0.0005823004,0.9365881,0.000014411151,0.001400529,0.000099518045,0.061055545],"study_design_scores_gemma":[0.0006637973,0.00015841919,0.00016920322,0.00015928029,0.000044022872,0.000011063717,0.00003187321,0.9919062,0.0007060241,0.002836192,0.003097559,0.00021631406],"about_ca_topic_score_codex":0.000013179392,"about_ca_topic_score_gemma":0.000029969324,"teacher_disagreement_score":0.08167035,"about_ca_system_score_codex":0.000013862172,"about_ca_system_score_gemma":0.00004718485,"threshold_uncertainty_score":0.5881368},"labels":[],"label_agreement":null},{"id":"W4406485468","doi":"10.1016/0967-0653(96)84903-9","title":"10.1016/0967-0653(96)84903-9","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computation; Scheme (mathematics); Parallel computing; Computer science; Computational science; Mathematics; Algorithm; Mathematical analysis","score_opus":0.00773317609912164,"score_gpt":0.1906178874928058,"score_spread":0.18288471139368417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406485468","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013169373,0.000038828708,0.030059405,0.0004906288,0.000002438058,0.00012491834,0.0000015150908,0.0012100394,0.96805906],"genre_scores_gemma":[0.0000743119,3.4187104e-7,0.053687047,0.00013923406,0.00006539136,0.000011547607,0.000004333147,0.0000117706995,0.946006],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893725,0.00005771066,0.00018841961,0.00033958085,0.00020012037,0.00027691972],"domain_scores_gemma":[0.99916625,0.000043274722,0.00003585376,0.000554994,0.000060725422,0.00013891693],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020107429,0.00013718911,0.0001447035,0.000103033315,0.000121165125,0.00015369956,0.00090263056,0.000058438734,0.9379229],"category_scores_gemma":[0.000023045084,0.00013647036,0.000054710636,0.0004307171,0.000020496445,0.00020172157,0.00013886172,0.00009709092,0.98422796],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054601655,0.000028263903,4.5865615e-8,0.0000016645075,0.000004473155,0.0000034622717,0.000025572455,0.0032430463,0.0000034616528,0.000030940057,0.30032074,0.6963329],"study_design_scores_gemma":[0.000089636116,0.00008960278,0.000005364983,0.00001222954,0.000002121776,0.000008977408,9.1942965e-8,0.06676585,0.00022659963,0.000081527265,0.93254113,0.00017686127],"about_ca_topic_score_codex":0.0000105162035,"about_ca_topic_score_gemma":3.1946005e-8,"teacher_disagreement_score":0.696156,"about_ca_system_score_codex":0.00002786274,"about_ca_system_score_gemma":0.000032554417,"threshold_uncertainty_score":0.55651},"labels":[],"label_agreement":null},{"id":"W4406486996","doi":"10.1016/s0197-2510(10)70184-4","title":"10.1016/s0197-2510(10)70184-4","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.007249436596637671,"score_gpt":0.19139362613115865,"score_spread":0.18414418953452097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406486996","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016461514,0.00004093902,0.019314552,0.0005210753,0.0000021347666,0.00013093695,0.000001682804,0.001265659,0.97870654],"genre_scores_gemma":[0.000056085246,3.746127e-7,0.05397672,0.000111372334,0.00007170084,0.000011336837,0.0000044503563,0.000013112079,0.9457548],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988507,0.00006215265,0.00020783966,0.0003669935,0.00021415592,0.00029814217],"domain_scores_gemma":[0.9990929,0.00005012271,0.000042676296,0.00059308205,0.00007768535,0.00014357404],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002216451,0.00014971729,0.00015717851,0.000111031215,0.0001317036,0.00017957095,0.00094764156,0.00006378715,0.9631619],"category_scores_gemma":[0.00003128022,0.00014934805,0.000057950674,0.00046088663,0.00002221948,0.00023025468,0.00016438376,0.000094909876,0.9836797],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068517165,0.000026857244,2.6370556e-8,0.0000016269477,0.000004293278,0.000002909653,0.00001964595,0.0028963715,0.0000045552997,0.000014060399,0.500447,0.4965758],"study_design_scores_gemma":[0.000099285324,0.000102654376,0.000007234136,0.000013302567,0.0000023469595,0.00000836741,9.1117954e-8,0.080137976,0.00019057916,0.000059771155,0.9191913,0.00018709284],"about_ca_topic_score_codex":0.000010670226,"about_ca_topic_score_gemma":3.0058647e-8,"teacher_disagreement_score":0.4963887,"about_ca_system_score_codex":0.000029790637,"about_ca_system_score_gemma":0.000037653786,"threshold_uncertainty_score":0.60902363},"labels":[],"label_agreement":null},{"id":"W4406659519","doi":"10.1016/b978-0-340-66287-8.50005-4","title":"10.1016/b978-0-340-66287-8.50005-4","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Turbo Pascal; Computer science; Turbo; Programming language; Engineering; Automotive engineering","score_opus":0.010206375514632549,"score_gpt":0.1902118902352169,"score_spread":0.18000551472058435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659519","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7274862e-8,0.00021395079,0.013796272,0.00024761213,0.000007711068,0.00032056842,0.000013006432,0.0017405613,0.9836603],"genre_scores_gemma":[4.938422e-7,0.0000020721604,0.027506327,0.00015319175,0.00022030655,0.000014870351,0.00003485097,0.000070346774,0.97199756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978292,0.000035224053,0.00045486796,0.0008158463,0.00045207798,0.00041278117],"domain_scores_gemma":[0.9981031,0.00008084718,0.00018853074,0.0012390458,0.00014300291,0.0002454676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022998889,0.000489795,0.0004916073,0.0004031304,0.0001541511,0.00025287524,0.0018378004,0.000360267,0.93923044],"category_scores_gemma":[0.00001816912,0.00051846815,0.00020238347,0.00013032413,0.000054127882,0.00017941839,0.0004928487,0.00039461977,0.9814463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000089435725,0.000014536501,1.3854698e-9,0.00000659951,0.000025164298,0.000017072924,0.000013153125,0.0007833997,5.9844683e-7,0.0013126788,0.3429347,0.65488315],"study_design_scores_gemma":[0.00010512531,0.00015113523,1.9525565e-7,0.00012460841,0.000015318188,0.000022864073,2.3816924e-8,0.008154086,0.000024725636,0.0020401177,0.98875374,0.00060805096],"about_ca_topic_score_codex":0.0000064596097,"about_ca_topic_score_gemma":8.649895e-8,"teacher_disagreement_score":0.6542751,"about_ca_system_score_codex":0.00009271307,"about_ca_system_score_gemma":0.00012017137,"threshold_uncertainty_score":0.9997267},"labels":[],"label_agreement":null},{"id":"W4406659852","doi":"10.1016/b978-0-340-67769-8.50035-5","title":"10.1016/b978-0-340-67769-8.50035-5","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer hardware; Embedded system","score_opus":0.01032849469635297,"score_gpt":0.19033842414457677,"score_spread":0.1800099294482238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406659852","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7080326e-8,0.00020268677,0.014016211,0.00022158238,0.000007929144,0.00031056083,0.000014322592,0.0016445641,0.98358214],"genre_scores_gemma":[4.0084234e-7,0.0000019018003,0.027630743,0.00014794338,0.00020859196,0.000013907529,0.000034178778,0.000067793604,0.97189456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979129,0.000034053246,0.0004358334,0.00078618206,0.00043621217,0.0003948614],"domain_scores_gemma":[0.9981625,0.00007619075,0.0001783274,0.001203958,0.00014486298,0.00023412619],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022177008,0.0004714233,0.00047405367,0.00038605343,0.00015112243,0.00024149325,0.0017531622,0.0003486031,0.9437664],"category_scores_gemma":[0.000018806635,0.000497693,0.00019212463,0.00012954295,0.000050349216,0.00016967735,0.0004737625,0.0003805879,0.98238313],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000879009,0.000014561585,1.4698548e-9,0.00000692554,0.000025853336,0.00001755,0.000013437126,0.0006852144,6.43475e-7,0.0016345419,0.38089404,0.61669844],"study_design_scores_gemma":[0.00009968934,0.00014392608,1.5743818e-7,0.000120111086,0.00001472273,0.000021307531,2.3483414e-8,0.007652961,0.000023977527,0.002081528,0.9892567,0.000584922],"about_ca_topic_score_codex":0.000006699067,"about_ca_topic_score_gemma":6.638044e-8,"teacher_disagreement_score":0.61611354,"about_ca_system_score_codex":0.00008816045,"about_ca_system_score_gemma":0.00011632994,"threshold_uncertainty_score":0.99974746},"labels":[],"label_agreement":null},{"id":"W4406660019","doi":"10.1016/b978-0-340-60035-1.50008-0","title":"10.1016/b978-0-340-60035-1.50008-0","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.010270963635520073,"score_gpt":0.1899507904197857,"score_spread":0.1796798267842656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406660019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7786146e-8,0.0002182221,0.0133274095,0.00022136046,0.000007686883,0.00031128767,0.000014734046,0.0016702958,0.98422897],"genre_scores_gemma":[3.86142e-7,0.000002118139,0.026934855,0.00014517523,0.00020791436,0.000014414186,0.000034979286,0.00006951749,0.9725906],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978808,0.00003530006,0.00044266874,0.00079730735,0.00044367826,0.00040025005],"domain_scores_gemma":[0.99814063,0.00007682698,0.00018335617,0.0012140427,0.00014414167,0.00024102519],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021812448,0.000479118,0.0004811374,0.00038990958,0.00015435084,0.00024188792,0.0017709209,0.00035380636,0.9463241],"category_scores_gemma":[0.000018313258,0.0005063674,0.00019517074,0.0001328629,0.000053014068,0.00017215643,0.0004795054,0.00036948963,0.98291945],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008605104,0.000014232634,1.1824992e-9,0.0000065198215,0.000024757284,0.000017338858,0.000013121239,0.0007280915,4.7409014e-7,0.0013319647,0.33830202,0.6595529],"study_design_scores_gemma":[0.000107153435,0.00015099121,1.6284844e-7,0.00012305677,0.000014833959,0.000023300721,2.4476076e-8,0.008848112,0.00002158567,0.0018541407,0.9882627,0.0005939505],"about_ca_topic_score_codex":0.000007672697,"about_ca_topic_score_gemma":7.381886e-8,"teacher_disagreement_score":0.6589589,"about_ca_system_score_codex":0.00009008114,"about_ca_system_score_gemma":0.00012425466,"threshold_uncertainty_score":0.9997388},"labels":[],"label_agreement":null},{"id":"W4406660512","doi":"10.1016/b978-0-340-67769-8.50022-7","title":"10.1016/b978-0-340-67769-8.50022-7","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.01040275094089802,"score_gpt":0.18994189303582681,"score_spread":0.1795391420949288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406660512","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.9380188e-8,0.0002118253,0.012820869,0.00023999155,0.000007917794,0.00031968785,0.000015144418,0.0017144465,0.9846701],"genre_scores_gemma":[3.9844542e-7,0.0000018508945,0.027272508,0.00014596013,0.00021753467,0.000014973569,0.000035944548,0.00006929309,0.9722415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784863,0.000035318088,0.0004493683,0.00080869504,0.00045291334,0.0004050885],"domain_scores_gemma":[0.9981201,0.00008060374,0.0001852038,0.0012282397,0.00014613509,0.0002397157],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022878566,0.0004832824,0.000485284,0.00040099188,0.0001597818,0.0002460295,0.0018255262,0.00035080317,0.9475461],"category_scores_gemma":[0.000018919009,0.00051249337,0.00020136601,0.00013186818,0.00005242161,0.0001725563,0.00050333136,0.00039578465,0.9817603],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009041715,0.000015282581,1.5146245e-9,0.000006874411,0.000026047883,0.000017755712,0.000013641959,0.0007425259,6.2360533e-7,0.0015298324,0.36374658,0.6338918],"study_design_scores_gemma":[0.00010417154,0.0001498723,1.7097142e-7,0.00011849596,0.000015013983,0.00002276439,2.4797567e-8,0.00856798,0.000022662103,0.0020603803,0.98833746,0.00060103385],"about_ca_topic_score_codex":0.000007095889,"about_ca_topic_score_gemma":6.346582e-8,"teacher_disagreement_score":0.63329077,"about_ca_system_score_codex":0.000090581954,"about_ca_system_score_gemma":0.000112535155,"threshold_uncertainty_score":0.9997327},"labels":[],"label_agreement":null},{"id":"W4406670035","doi":"10.1016/b978-0-08-092870-8.50022-7","title":"10.1016/b978-0-08-092870-8.50022-7","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Turbo Pascal; Turbo; Computer science; Pascal (unit); Programming language; Engineering","score_opus":0.010581398131162746,"score_gpt":0.19125277463379048,"score_spread":0.18067137650262774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406670035","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0023018e-8,0.00021318579,0.014030365,0.00023720946,0.000007866592,0.00032158042,0.000015725069,0.0017230829,0.98345095],"genre_scores_gemma":[3.83974e-7,0.0000018426026,0.028865172,0.0001432812,0.000214886,0.000015321237,0.000037679925,0.00006914592,0.9706523],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783015,0.000035664892,0.00045274023,0.0008146216,0.00045594052,0.00041087976],"domain_scores_gemma":[0.9981056,0.0000790151,0.000190888,0.0012353902,0.00014735076,0.00024174234],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023240788,0.0004870745,0.0004907022,0.00040242026,0.00016181398,0.00024835046,0.0018344133,0.0003532051,0.95121896],"category_scores_gemma":[0.000018870913,0.0005166105,0.00020267675,0.00013301762,0.000054271593,0.00017395853,0.0005086559,0.0003985608,0.98563147],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009709638,0.000015984737,1.538279e-9,0.000007431361,0.000027230504,0.000018493405,0.000014114846,0.0008018218,6.4736895e-7,0.0015531387,0.3771779,0.62037355],"study_design_scores_gemma":[0.000111310605,0.00015418502,1.7329033e-7,0.000119605225,0.000015266454,0.00002380289,2.5674815e-8,0.008308409,0.000021780297,0.001890128,0.98875004,0.0006052469],"about_ca_topic_score_codex":0.0000060244465,"about_ca_topic_score_gemma":6.048718e-8,"teacher_disagreement_score":0.61976826,"about_ca_system_score_codex":0.00008985057,"about_ca_system_score_gemma":0.000113864044,"threshold_uncertainty_score":0.99972856},"labels":[],"label_agreement":null},{"id":"W4406670160","doi":"10.1016/b978-0-08-092870-8.50029-x","title":"10.1016/b978-0-08-092870-8.50029-x","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Turbo Pascal; Computer science; Turbo; Programming language; Engineering","score_opus":0.010495288473003076,"score_gpt":0.1914636823454605,"score_spread":0.18096839387245742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406670160","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2376678e-8,0.00021254538,0.012666196,0.00023618137,0.000007145368,0.00032130064,0.000015139026,0.0017350216,0.9848065],"genre_scores_gemma":[4.016584e-7,0.0000019480372,0.027565524,0.00014641184,0.00021543975,0.000014880602,0.000036186124,0.0000693416,0.9719499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783,0.000035222994,0.00045421693,0.0008159391,0.000452127,0.00041252165],"domain_scores_gemma":[0.99809897,0.00007970172,0.00019032549,0.0012374254,0.0001497334,0.00024382782],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022978321,0.0004898566,0.00049390254,0.00040120023,0.0001593665,0.00025305804,0.0018274917,0.00036018156,0.9511802],"category_scores_gemma":[0.000019094332,0.0005183149,0.00020316785,0.0001323518,0.000054748474,0.00017835124,0.0004996823,0.00039502038,0.98664135],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000973368,0.000015716192,1.5199199e-9,0.0000076613205,0.00002766776,0.000018872619,0.000014346121,0.001134214,6.722171e-7,0.0012705635,0.40592694,0.5915736],"study_design_scores_gemma":[0.00010966726,0.00015353314,1.6718865e-7,0.000126307,0.000015364965,0.000023579712,2.4674716e-8,0.010787128,0.000022904687,0.0016177825,0.98653775,0.0006057649],"about_ca_topic_score_codex":0.0000058959695,"about_ca_topic_score_gemma":6.2042396e-8,"teacher_disagreement_score":0.59096783,"about_ca_system_score_codex":0.00008845751,"about_ca_system_score_gemma":0.00011498832,"threshold_uncertainty_score":0.99972683},"labels":[],"label_agreement":null},{"id":"W4406673134","doi":"10.1016/b978-0-08-050403-2.50013-2","title":"10.1016/b978-0-08-050403-2.50013-2","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language","score_opus":0.01065631058009704,"score_gpt":0.19221064166600274,"score_spread":0.1815543310859057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406673134","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8842941e-8,0.00021568217,0.014984402,0.00024801516,0.000008112504,0.0003241884,0.000016392089,0.0017390426,0.98246413],"genre_scores_gemma":[3.0691555e-7,0.0000022041907,0.030268472,0.00014463389,0.00021762229,0.000014554067,0.00004799305,0.000069055124,0.9692352],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978203,0.000036260488,0.00045604014,0.0008191856,0.0004505645,0.00041761828],"domain_scores_gemma":[0.9980996,0.00007700838,0.00019103344,0.0012400066,0.0001506089,0.00024168931],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023168632,0.0004932009,0.0004932331,0.00040429,0.00015936501,0.0002553711,0.0018277331,0.00036098543,0.9552559],"category_scores_gemma":[0.000018315608,0.00052173855,0.00020197895,0.00013192155,0.000053811247,0.0001807829,0.0005109468,0.00039654918,0.9859058],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009255321,0.000015205952,1.2309029e-9,0.0000071299137,0.0000269273,0.000017463051,0.000012471794,0.0007653703,7.00158e-7,0.0013778997,0.386315,0.6114526],"study_design_scores_gemma":[0.00011173641,0.00015485103,1.5566063e-7,0.00012680443,0.000014820964,0.000024410047,2.4752136e-8,0.008224997,0.000023681994,0.0018485445,0.9888596,0.00061035086],"about_ca_topic_score_codex":0.000007045495,"about_ca_topic_score_gemma":6.502442e-8,"teacher_disagreement_score":0.6108422,"about_ca_system_score_codex":0.0000888822,"about_ca_system_score_gemma":0.00011452611,"threshold_uncertainty_score":0.99972343},"labels":[],"label_agreement":null},{"id":"W4407087982","doi":"10.2139/ssrn.5122694","title":"Quic-Sfec: Lower Latency Quic for Resource Dependencies Using Forward Error Correction","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Latency (audio); Computer science; Computer network; Telecommunications","score_opus":0.020585855038139707,"score_gpt":0.29267515878482464,"score_spread":0.27208930374668494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407087982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003079411,0.002396792,0.98887116,0.0005334559,0.003002297,0.0005049354,0.000005345507,0.00053349615,0.0010731191],"genre_scores_gemma":[0.6133046,0.004652209,0.35318965,0.00078044855,0.0020046525,0.00014219413,0.000054218213,0.00014376575,0.025728274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99568826,0.00022782713,0.0006990162,0.0007629223,0.00046133593,0.0021606223],"domain_scores_gemma":[0.99786705,0.00016202973,0.0006895945,0.0007076447,0.00046384745,0.00010983822],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002618892,0.00044125185,0.0005083591,0.00057457987,0.00067949365,0.00048696998,0.0019110563,0.00045018882,0.0000041938297],"category_scores_gemma":[0.00021336756,0.00043774254,0.0004784506,0.0004105517,0.00004516055,0.0003203858,0.0008860421,0.0034037714,0.0000035042447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032945615,0.0005627519,0.0004994436,0.0002852748,0.0010548464,0.000019868246,0.0014411374,0.7279633,0.00018089892,0.13094874,0.01240324,0.124311],"study_design_scores_gemma":[0.00047381772,0.0004597853,0.000020298352,0.0004156204,0.00009969528,0.00035797036,0.00014302533,0.77747995,0.00032830113,0.21554445,0.004053312,0.0006237956],"about_ca_topic_score_codex":0.000120225275,"about_ca_topic_score_gemma":0.00018648403,"teacher_disagreement_score":0.6356815,"about_ca_system_score_codex":0.0018821617,"about_ca_system_score_gemma":0.005572531,"threshold_uncertainty_score":0.9998074},"labels":[],"label_agreement":null},{"id":"W4407197217","doi":"10.1145/3669940.3707225","title":"RANGE-BLOCKS: A Synchronization Facility for Domain-Specific Architectures","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Synchronization (alternating current); Computer science; Range (aeronautics); Domain (mathematical analysis); Distributed computing; Parallel computing; Computer network; Engineering; Mathematics","score_opus":0.012353797682980156,"score_gpt":0.2572908515755343,"score_spread":0.24493705389255413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407197217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077679765,0.00022933082,0.9904336,0.001595826,0.00015738152,0.0003665404,0.0000034112863,0.00090126746,0.005535879],"genre_scores_gemma":[0.22124982,0.000017343209,0.7769258,0.0006476922,0.000026132228,0.000058430396,0.00000803731,0.0000031074242,0.0010636466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991379,0.000045645593,0.00019104777,0.0003423451,0.00010204012,0.00018106012],"domain_scores_gemma":[0.99926,0.00012832365,0.000041092768,0.00042042934,0.000118284705,0.00003185559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020815936,0.00010560222,0.00012320728,0.00015034442,0.00017696459,0.00013594274,0.00051794876,0.000055147248,0.000011446373],"category_scores_gemma":[0.000024665176,0.00009245324,0.00006479405,0.00040594823,0.000030485935,0.00006098288,0.00012646275,0.00005897026,0.000004963417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041285766,0.0001400162,0.0015023081,0.00007583356,0.000041539475,0.0000015431131,0.0006498698,0.028806653,0.00017338668,0.4878119,0.061942566,0.41881308],"study_design_scores_gemma":[0.0014104898,0.0001324012,0.0011346542,0.000056385612,0.000006851927,0.000005420729,0.000036435435,0.5008983,0.0062201573,0.18342033,0.30617294,0.0005056634],"about_ca_topic_score_codex":0.0000075186954,"about_ca_topic_score_gemma":0.0000048685692,"teacher_disagreement_score":0.47209162,"about_ca_system_score_codex":0.000041800515,"about_ca_system_score_gemma":0.000045910205,"threshold_uncertainty_score":0.3770134},"labels":[],"label_agreement":null},{"id":"W4407361541","doi":"10.1109/tse.2025.3540549","title":"Search-Based DNN Testing and Retraining With GAN-Enhanced Simulations","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Software Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; European Space Agency; Science Foundation Ireland; Université du Luxembourg","keywords":"Computer science; Retraining; Artificial intelligence; Machine learning; Distributed computing; Computer architecture; Computer engineering","score_opus":0.01589608177396644,"score_gpt":0.24175184292689342,"score_spread":0.225855761152927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407361541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006136669,0.000017875585,0.9917147,0.00006229807,0.00011233972,0.00012734716,0.000002856227,0.0017230603,0.00010281644],"genre_scores_gemma":[0.5617683,0.0000010336137,0.43812138,0.000054787703,0.0000051064717,0.000008795743,3.5459493e-7,0.0000079748725,0.000032301912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991913,0.000019474532,0.00015224355,0.00029054584,0.00013945729,0.00020699472],"domain_scores_gemma":[0.9988992,0.00064800825,0.00002451603,0.00026598937,0.00010375898,0.000058493646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110081484,0.00014328638,0.00012537524,0.00032268983,0.00023724372,0.00011431944,0.00019410174,0.00005593456,0.000002807885],"category_scores_gemma":[0.000062975414,0.00014552857,0.000025724019,0.0008841905,0.000024927,0.00018408528,0.000002321367,0.00024315827,0.0000010709333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032977389,0.000016726659,0.000045522353,0.000024185367,0.000012538947,0.0000017842129,0.00009104101,0.98459375,0.0005247397,0.000056953693,0.000006036983,0.014623422],"study_design_scores_gemma":[0.00023633022,0.00006291848,0.00021288816,0.00022560022,0.000007075709,0.0000023917246,0.0000039217834,0.95110583,0.04795453,0.000019848354,0.000022255494,0.0001463834],"about_ca_topic_score_codex":0.000007601075,"about_ca_topic_score_gemma":0.000001580853,"teacher_disagreement_score":0.55563164,"about_ca_system_score_codex":0.000052185063,"about_ca_system_score_gemma":0.00008544981,"threshold_uncertainty_score":0.5934483},"labels":[],"label_agreement":null},{"id":"W4407692579","doi":"10.1109/iedm50854.2024.10873340","title":"Coevolution of Chiplet Technology and Cache Architecture for AI and Compute","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Taiwan Semiconductor Manufacturing Company","keywords":"Computer science; Cache; Coevolution; Architecture; Computer architecture; Parallel computing; Geology","score_opus":0.008667926369359674,"score_gpt":0.2604967208161944,"score_spread":0.2518287944468347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407692579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002428264,0.0010847038,0.99094087,0.0045001623,0.00005822064,0.00013405202,0.000002119073,0.00058355625,0.00026805451],"genre_scores_gemma":[0.50606513,0.000026082695,0.4936714,0.00012446214,0.000012364017,0.000005826323,0.0000012118464,0.0000032387843,0.00009028449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995242,0.000012628566,0.0001077052,0.00021421279,0.00004657666,0.000094725634],"domain_scores_gemma":[0.9997234,0.00006186469,0.000020706393,0.00013194657,0.000039392235,0.00002270635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012415585,0.00006532275,0.00009877704,0.0002594845,0.000047444144,0.00005416577,0.00014693371,0.000063084364,5.6350416e-7],"category_scores_gemma":[0.000015109861,0.000053409214,0.000016745042,0.0003047881,0.00006781511,0.00006775357,0.0001433406,0.0000750078,2.9396622e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034386878,0.000014774847,0.0002622794,0.00013001534,0.000020531026,0.0000013732052,0.00028679305,0.0014511127,0.0007233647,0.79078853,0.0048873764,0.2014304],"study_design_scores_gemma":[0.00010011768,0.00011006301,0.00018371925,0.00003792695,0.0000037340367,0.00003871226,0.0000029544096,0.92845696,0.0025501098,0.062059976,0.0063797883,0.00007593662],"about_ca_topic_score_codex":0.0000059055455,"about_ca_topic_score_gemma":0.0000023186894,"teacher_disagreement_score":0.9270058,"about_ca_system_score_codex":0.0000055216246,"about_ca_system_score_gemma":0.000020695477,"threshold_uncertainty_score":0.21779644},"labels":[],"label_agreement":null},{"id":"W4407768270","doi":"10.1007/978-981-96-2845-2","title":"WALCOM: Algorithms and Computation","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology Guwahati; Università degli Studi di Perugia; Eötvös Loránd Tudományegyetem; University of Science and Technology of China; Università degli Studi di Salerno; Universitetet i Bergen; Shanghai Jiao Tong University; University of Engineering and Technology, Lahore; Chinese Academy of Sciences; Nanyang Technological University; University of Electronic Science and Technology of China; Ohio State University; Kyonggi University; National University of Singapore; Indian Statistical Institute; Brock University; King's College London; Rheinische Friedrich-Wilhelms-Universität Bonn; Ben-Gurion University of the Negev; Friedrich-Schiller-Universität Jena; Shanghai Educational Development Foundation; Bangladesh University of Engineering and Technology; Georgia State University","keywords":"Computer science; Computation; Algorithm","score_opus":0.014543127721006,"score_gpt":0.27648738607860135,"score_spread":0.2619442583575953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407768270","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008605906,0.00067493564,0.9916371,0.0007183696,0.0010705487,0.00034249036,0.0000025668824,0.0005650639,0.004980315],"genre_scores_gemma":[0.005057804,0.00009791417,0.99175155,0.0014747275,0.0002088912,0.000010375137,0.000012247491,0.000016458713,0.001370039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967693,0.00008282464,0.00048420706,0.0014409486,0.00063807954,0.0005846476],"domain_scores_gemma":[0.9979836,0.0005619428,0.00023618301,0.000796427,0.0002785118,0.0001433526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000968374,0.00043504307,0.00049245113,0.0011650927,0.00031235834,0.00076174433,0.0021675632,0.00030805107,0.0000018772588],"category_scores_gemma":[0.00010717659,0.00042518892,0.000074171025,0.0013569533,0.00045205344,0.00047040652,0.0016997631,0.0006416184,0.000006890344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000155948,0.00002372751,0.00002790298,0.000055115062,0.00000728647,0.000023724391,0.00032913624,0.09002026,0.000005506154,0.003629468,0.00085525325,0.9050211],"study_design_scores_gemma":[0.00017903477,0.00007699314,0.00007537842,0.00033106108,0.000004511094,0.000030108245,4.845267e-8,0.884597,0.00023805625,0.11305084,0.0010179011,0.00039904247],"about_ca_topic_score_codex":0.000017063592,"about_ca_topic_score_gemma":0.000008293607,"teacher_disagreement_score":0.904622,"about_ca_system_score_codex":0.00035369265,"about_ca_system_score_gemma":0.0012443672,"threshold_uncertainty_score":0.99982},"labels":[],"label_agreement":null},{"id":"W4408048905","doi":"10.1109/icac2n63387.2024.10894767","title":"Go vs. Java: A Detailed Performance Analysis in Concurrent Programming","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Becton Dickinson (Canada)","funders":"","keywords":"Computer science; Java; Programming language; Operating system","score_opus":0.01492276561742436,"score_gpt":0.2734318527326751,"score_spread":0.2585090871152508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408048905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016828373,0.00034225703,0.97813475,0.00027702004,0.00012665211,0.00011018555,1.7180757e-7,0.0011082728,0.0030723023],"genre_scores_gemma":[0.8638653,0.00006400332,0.13545597,0.00006458173,0.000014285423,0.000021237849,0.0000023684186,0.0000037642358,0.00050845655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990445,0.000036408015,0.00022409172,0.00033308993,0.00015149363,0.00021041019],"domain_scores_gemma":[0.99959576,0.000056663015,0.00002595795,0.00024126263,0.000036429985,0.000043939563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032340336,0.00009773118,0.00015413488,0.00044758417,0.00004425082,0.00030780595,0.000414763,0.000035861496,0.000017917255],"category_scores_gemma":[0.000013837216,0.00008086519,0.00008188534,0.002295747,0.000017811155,0.000293988,0.00014021556,0.00011349088,0.00004484193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005893807,0.00015626359,0.056081533,0.00016783168,0.00026439232,0.000054088345,0.0020605624,0.05115824,0.000018549985,0.067915626,0.0028269563,0.81929004],"study_design_scores_gemma":[0.000056006535,0.000036851696,0.0027663268,0.000039105835,0.000015719963,0.0000023602365,0.0000050543613,0.9923849,0.00037743372,0.00005121083,0.004147779,0.0001172169],"about_ca_topic_score_codex":0.00001592865,"about_ca_topic_score_gemma":0.000039448296,"teacher_disagreement_score":0.9412267,"about_ca_system_score_codex":0.00004559455,"about_ca_system_score_gemma":0.000059005255,"threshold_uncertainty_score":0.32975867},"labels":[],"label_agreement":null},{"id":"W4408049841","doi":"10.1145/3710848.3710897","title":"FlashFFTStencil: Bridging Fast Fourier Transforms to Memory-Efficient Stencil Computations on Tensor Core Units","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Stencil; Bridging (networking); Computation; Computer science; Out-of-core algorithm; Fourier transform; Tensor (intrinsic definition); Parallel computing; Computational science; Algorithm; Mathematics; Geometry; Mathematical analysis","score_opus":0.032939256614256646,"score_gpt":0.2765377758844314,"score_spread":0.24359851927017476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408049841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010165434,0.00001554946,0.946799,0.0033097032,0.0003225401,0.00047092667,0.0000047830194,0.0012945142,0.03761756],"genre_scores_gemma":[0.6140189,0.0000041693643,0.37189665,0.0054705427,0.00004145336,0.0000422494,0.0000079860665,0.000016049902,0.00850198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981995,0.000051049694,0.00037702723,0.0005514192,0.000424356,0.000396614],"domain_scores_gemma":[0.998525,0.00015203872,0.00005990676,0.00059226557,0.0005103985,0.00016036391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036709217,0.00022801952,0.00023650941,0.00047834826,0.00039369203,0.00020559062,0.00088658294,0.000073495394,0.00001297331],"category_scores_gemma":[0.000111655594,0.0001933414,0.00007494294,0.0020739087,0.000039327242,0.00012052662,0.00017795495,0.00018658112,0.00008931542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009140853,0.0001014055,0.000034356217,0.000016030675,0.000020844553,0.000008066896,0.0012147304,0.8002452,0.00006488451,0.055362318,0.012167472,0.1307555],"study_design_scores_gemma":[0.00032249268,0.00012347776,0.0005279172,0.00011518548,0.0000068272566,0.0000055895034,0.00012300983,0.99295026,0.0025772701,0.00053655816,0.0024548278,0.00025657442],"about_ca_topic_score_codex":0.000037298556,"about_ca_topic_score_gemma":0.000012872248,"teacher_disagreement_score":0.60385346,"about_ca_system_score_codex":0.00012486351,"about_ca_system_score_gemma":0.0002399277,"threshold_uncertainty_score":0.78842336},"labels":[],"label_agreement":null},{"id":"W4408183445","doi":"10.1109/isscc49661.2025.10904529","title":"“Zen 5”: The AMD High-Performance 4nm x86-64 Microprocessor Core","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"x86; Microprocessor; Computer science; Core (optical fiber); Embedded system; Operating system; Telecommunications; Software","score_opus":0.01258534142056432,"score_gpt":0.25207013188265487,"score_spread":0.23948479046209054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408183445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03140806,0.00011771922,0.93833524,0.0026899625,0.000262779,0.00014167531,4.186265e-7,0.0008692459,0.026174892],"genre_scores_gemma":[0.8452642,0.00007049454,0.1402663,0.003148616,0.000032877797,0.000016621732,0.0000015565261,0.0000049111495,0.011194453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917215,0.000024449188,0.00018464643,0.0002725483,0.00013730825,0.00020890664],"domain_scores_gemma":[0.999182,0.00006754979,0.00005844847,0.00056363683,0.00010098715,0.0000273962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023803333,0.00011377058,0.0001111951,0.00008381609,0.00028002073,0.00016859909,0.0013631108,0.00005090796,0.000014718415],"category_scores_gemma":[0.000021921289,0.00007312493,0.00003085266,0.0006240297,0.00005214551,0.00018338565,0.0003505557,0.00013006151,0.000045448072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022836084,0.0001813375,0.006058064,0.0001241684,0.00006848796,0.00000677603,0.00092959125,0.021136649,0.0015265718,0.5771932,0.23321049,0.15954182],"study_design_scores_gemma":[0.0003907628,0.00008354417,0.006932953,0.00009257742,0.000009678883,0.000010131869,0.000023609557,0.89206517,0.054967552,0.010262458,0.034808725,0.00035281785],"about_ca_topic_score_codex":0.000043174936,"about_ca_topic_score_gemma":0.0000040783502,"teacher_disagreement_score":0.8709285,"about_ca_system_score_codex":0.000026365262,"about_ca_system_score_gemma":0.00008631591,"threshold_uncertainty_score":0.29819483},"labels":[],"label_agreement":null},{"id":"W4408199075","doi":"10.3390/electronics14051048","title":"A Survey of Advancements in Scheduling Techniques for Efficient Deep Learning Computations on GPUs","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Toronto Metropolitan University","funders":"","keywords":"Computer science; Exploit; Scheduling (production processes); Deep learning; Computation; Computer architecture; Latency (audio); Efficient energy use; Distributed computing; Parallel computing; Artificial intelligence","score_opus":0.014626080607870115,"score_gpt":0.30687515814089134,"score_spread":0.2922490775330212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408199075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011430972,0.001093367,0.9863915,0.00008200312,0.00005009103,0.00029163662,7.297899e-7,0.00022821454,0.00043152264],"genre_scores_gemma":[0.7258564,0.00010021417,0.27386662,0.00007495856,0.000003409945,0.000035543115,0.000009988868,0.000005345204,0.000047511596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990329,0.00010904437,0.00026559836,0.00024249697,0.000109500186,0.00024044944],"domain_scores_gemma":[0.9991951,0.00032007063,0.00011130586,0.00018508449,0.00017213456,0.00001629548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069469167,0.00009144088,0.00015642836,0.00028473337,0.00009738016,0.000031709213,0.0003549349,0.00004680433,3.6264876e-7],"category_scores_gemma":[0.00024294404,0.00009914483,0.000033272812,0.00078461925,0.00001529847,0.00004503387,0.00007761858,0.00016990119,5.385288e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016566819,0.000121477955,0.0011157611,0.000019617055,0.000009342261,2.1564168e-7,0.00009782946,0.8734851,0.00011431866,0.027934646,0.000025079176,0.09706003],"study_design_scores_gemma":[0.0002325915,0.00020920832,0.0014433948,0.0000788734,0.0000017549206,1.9361114e-7,0.0000033406939,0.9853031,0.010142791,0.0017647042,0.0007326001,0.00008745326],"about_ca_topic_score_codex":0.000011473315,"about_ca_topic_score_gemma":0.000033731827,"teacher_disagreement_score":0.71442544,"about_ca_system_score_codex":0.0001204806,"about_ca_system_score_gemma":0.00013005956,"threshold_uncertainty_score":0.4043009},"labels":[],"label_agreement":null},{"id":"W4408218751","doi":"10.1145/3721143","title":"Memory Consistency and Program Transformations","year":2025,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Sequential consistency; Consistency (knowledge bases); Computer science; Consistency model; Programming language; Causal consistency; Parallel computing; Artificial intelligence","score_opus":0.009103749864728304,"score_gpt":0.2683146532359275,"score_spread":0.25921090337119923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408218751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014296993,0.00027072243,0.8837326,0.000345514,0.00010919572,0.00023459423,5.002083e-7,0.0006165647,0.10039329],"genre_scores_gemma":[0.76366264,0.0000137627285,0.23617506,0.00009578556,0.000010208247,0.000003196202,0.000001257694,0.000002376822,0.00003573764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000031323165,0.0003388976,0.00016870577,0.00012051045,0.00022010972],"domain_scores_gemma":[0.9994224,0.00008927104,0.00010756376,0.00021748674,0.00012302639,0.000040262235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028842414,0.00010249244,0.00017446693,0.00019317427,0.00023905929,0.000086754924,0.0003668689,0.000043900436,0.0000014766231],"category_scores_gemma":[0.000031434316,0.000099182944,0.000051080086,0.0004349871,0.00006790745,0.000424667,0.00020923717,0.00010396309,0.0000015873302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027000588,0.00007751314,0.00010467551,0.000097110984,0.000021705937,0.0000015200511,0.00082140695,0.0030380134,0.00003568211,0.5818114,0.00024328905,0.41374493],"study_design_scores_gemma":[0.0004249476,0.00015361885,0.0030658422,0.0002105961,0.000010060498,0.000018649534,0.00007100995,0.96816736,0.006674735,0.020417785,0.000610488,0.0001749072],"about_ca_topic_score_codex":0.000007405192,"about_ca_topic_score_gemma":0.0000012123062,"teacher_disagreement_score":0.9651294,"about_ca_system_score_codex":0.000013109398,"about_ca_system_score_gemma":0.00008460761,"threshold_uncertainty_score":0.40445632},"labels":[],"label_agreement":null},{"id":"W4408712634","doi":"10.1007/978-3-031-85634-1_10","title":"CPU Benchmarks","year":2025,"lang":"en","type":"book-chapter","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing","score_opus":0.011791323611469206,"score_gpt":0.237186161947667,"score_spread":0.2253948383361978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408712634","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.1015797e-9,0.00013130173,0.48405966,0.0002531738,0.00014601734,0.000056624365,7.794875e-7,0.00046061486,0.5148918],"genre_scores_gemma":[0.00002619785,0.00012485383,0.25537324,0.0006791369,0.000041511266,0.000002346087,0.000016254311,0.0000063957687,0.74373007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902004,0.000008573376,0.00022778334,0.00041877225,0.00018018715,0.00014463664],"domain_scores_gemma":[0.9989686,0.00006189239,0.00009656646,0.00072154956,0.000101650796,0.000049763854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112702335,0.00020864357,0.00021814222,0.00021498189,0.000075033284,0.00012473429,0.0010627488,0.00024224452,0.00043670315],"category_scores_gemma":[0.000010591663,0.0001954163,0.00011243314,0.00004579602,0.000024375404,0.0000867278,0.00050657836,0.00023216942,0.000076671655],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3295833e-7,0.0000022352883,2.5248144e-7,0.000005988785,0.000009350304,0.0000036965275,0.000006923261,0.00004149978,1.5620677e-7,0.7453667,0.23455922,0.020003768],"study_design_scores_gemma":[0.000050162475,0.00002387614,0.0000011791965,0.00010979974,0.00000596129,0.0000039636025,1.7271736e-7,0.03878905,0.000046945577,0.13586387,0.82481915,0.00028584208],"about_ca_topic_score_codex":0.000005148532,"about_ca_topic_score_gemma":0.0000014221353,"teacher_disagreement_score":0.6095028,"about_ca_system_score_codex":0.000035688558,"about_ca_system_score_gemma":0.00011966509,"threshold_uncertainty_score":0.79688454},"labels":[],"label_agreement":null},{"id":"W4408902000","doi":"10.1145/3676641.3716027","title":"Virtuoso: Enabling Fast and Accurate Virtual Memory Research via an Imitation-based Operating System Simulation Methodology","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer architecture; Embedded system","score_opus":0.13434219950139104,"score_gpt":0.41891990771158577,"score_spread":0.28457770821019474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408902000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008002456,0.000049030616,0.98797005,0.00040150297,0.00015950596,0.00027004353,4.7325105e-7,0.00076401065,0.0023829406],"genre_scores_gemma":[0.6146258,0.0000014603363,0.38488477,0.00020628292,0.000025360285,0.000015785521,0.000003891415,0.0000054722987,0.00023117408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969636,0.001591112,0.0003707147,0.000538237,0.00025400156,0.000282323],"domain_scores_gemma":[0.99676865,0.0020998253,0.000080404396,0.0004384667,0.0005351112,0.00007755843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037400497,0.00013467042,0.00020032901,0.0005369633,0.0006117543,0.0004299091,0.00051757164,0.0001142201,0.0000038110402],"category_scores_gemma":[0.0005307511,0.00012588018,0.000027302718,0.00085701037,0.00006696784,0.00056289014,0.0002431995,0.00022477323,0.0000047552976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007691846,0.000019362393,0.000052759664,0.000027843345,0.0000078123085,0.0000023443793,0.00045884377,0.90516055,0.0018073122,0.046063956,0.000047396745,0.046344105],"study_design_scores_gemma":[0.0002475958,0.00011820235,0.00012380297,0.00005641599,0.0000030864985,0.0000017676268,0.00042901613,0.99035156,0.007895792,0.00061845465,0.000029681747,0.00012460702],"about_ca_topic_score_codex":0.000104770996,"about_ca_topic_score_gemma":0.000011426246,"teacher_disagreement_score":0.60662335,"about_ca_system_score_codex":0.000080629055,"about_ca_system_score_gemma":0.00016896661,"threshold_uncertainty_score":0.5133245},"labels":[],"label_agreement":null},{"id":"W4408925909","doi":"10.1145/3676641.3716009","title":"PAPI: Exploiting Dynamic Parallelism in Large Language Model Decoding with a Processing-In-Memory-Enabled Computing System","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Universitas Brawijaya","keywords":"Computer science; Parallel computing; Parallelism (grammar); Decoding methods; Computer architecture; Programming language; Algorithm","score_opus":0.00812880525198429,"score_gpt":0.2625035649182994,"score_spread":0.2543747596663151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408925909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06503608,0.00022837151,0.9179398,0.00015264664,0.000039287144,0.0002942739,3.866963e-7,0.0011889137,0.015120249],"genre_scores_gemma":[0.6871401,0.000003718611,0.31225422,0.00021009175,0.00000623973,0.000019442952,0.0000020233547,0.0000105157715,0.00035366212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980261,0.00010522503,0.0005016614,0.0005924374,0.0002104107,0.00056417857],"domain_scores_gemma":[0.9992383,0.000075556934,0.00015092998,0.00040091306,0.00008239836,0.00005189192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008614895,0.00022708073,0.0003471842,0.00054215133,0.000195678,0.00026915598,0.000732393,0.0000914423,0.0000010583551],"category_scores_gemma":[0.000036514637,0.00020110949,0.00003921038,0.0012078225,0.000018186649,0.00042877474,0.000345403,0.0002806646,0.0000027562057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001740088,0.0001333871,0.0031295444,0.00041872502,0.000008839861,0.00013128326,0.0051759095,0.93561614,0.00017202058,0.036354188,0.00006460645,0.018777966],"study_design_scores_gemma":[0.0008626571,0.000015512916,0.00042982417,0.0010894485,0.0000027065912,0.00001032274,0.001233608,0.99567187,0.000193166,0.00024985825,0.0000027850774,0.00023823965],"about_ca_topic_score_codex":0.000083170446,"about_ca_topic_score_gemma":0.00014744238,"teacher_disagreement_score":0.62210405,"about_ca_system_score_codex":0.00023688021,"about_ca_system_score_gemma":0.00018688022,"threshold_uncertainty_score":0.8201007},"labels":[],"label_agreement":null},{"id":"W4409153976","doi":"10.1109/mnet.2025.3557812","title":"Physical Layer Standardization for AI Data Centers: Challenges, Progress, and Perspectives","year":2025,"lang":"en","type":"article","venue":"IEEE Network","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Standardization; Computer science; Layer (electronics); Physical layer; Telecommunications; Wireless; Operating system; Nanotechnology","score_opus":0.04868215273617273,"score_gpt":0.32990205751864365,"score_spread":0.28121990478247094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409153976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116863994,0.0049272855,0.9891592,0.0039335033,0.00055707217,0.00025916146,0.0000070031465,0.00033924537,0.0007006461],"genre_scores_gemma":[0.75801134,0.0015842483,0.23710875,0.00064816553,0.00232375,0.00006683364,0.0000349357,0.000018978659,0.00020301405],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914694,0.000049238166,0.0001014249,0.00042119913,0.0000983222,0.00018284911],"domain_scores_gemma":[0.99922436,0.00007674433,0.00004616631,0.00051353266,0.00010899501,0.000030202948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023102059,0.00009456522,0.00013074583,0.00003798075,0.00015022063,0.00014487533,0.00052927906,0.000039619914,1.6849985e-7],"category_scores_gemma":[0.000020203535,0.00008855057,0.000022756045,0.0001926493,0.000049923045,0.00028133913,0.00023322369,0.00006882999,4.800001e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009858549,0.00030497936,0.0005848318,0.00013535321,0.00015893817,0.0000030354968,0.0026895548,0.033194207,0.000015054713,0.28258246,0.49122673,0.18900624],"study_design_scores_gemma":[0.00041260011,0.000092992865,0.0004249569,0.00013845087,0.00001527011,0.0000013852999,0.000033215914,0.8905305,0.00014441575,0.0280702,0.0799558,0.00018019254],"about_ca_topic_score_codex":0.0000011694691,"about_ca_topic_score_gemma":0.0000025283564,"teacher_disagreement_score":0.8573363,"about_ca_system_score_codex":0.00002138195,"about_ca_system_score_gemma":0.00004387619,"threshold_uncertainty_score":0.36109874},"labels":[],"label_agreement":null},{"id":"W4409156678","doi":"10.1109/ieeeconf60004.2024.10942712","title":"Every Bit Matters: A Hardware/Software Approach for Enabling More Powerful Machine Learning Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Computer science; Bit (key); Software; Computer architecture; Embedded system; Computer hardware; Software engineering; Programming language; Computer security","score_opus":0.0331270041054755,"score_gpt":0.26507450993262743,"score_spread":0.23194750582715193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409156678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052473224,0.0011299116,0.99141896,0.0012720583,0.00015998317,0.00028069384,0.000004843846,0.0041810446,0.0015000632],"genre_scores_gemma":[0.03297899,0.000042013242,0.96011245,0.001289973,0.00007593692,0.000042894313,0.000041738796,0.000035034325,0.005380975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985026,0.00004568734,0.00025698112,0.00062088994,0.00023118482,0.0003426274],"domain_scores_gemma":[0.9992454,0.00016455694,0.00004802936,0.00035986654,0.00010062444,0.000081507394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004272234,0.0002029998,0.00019653977,0.0002832083,0.00017227772,0.0006548878,0.0006846361,0.000086272405,0.000013133147],"category_scores_gemma":[0.000046085177,0.00017524853,0.00013875015,0.00047970103,0.00002321562,0.00076501525,0.00029793978,0.00023574835,0.000015548714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009186328,0.000056878976,0.000055183777,0.0002610762,0.00005741723,0.000012756136,0.0014174379,0.93319297,0.00006454137,0.017528597,0.026963426,0.020380545],"study_design_scores_gemma":[0.00010740627,0.000047795376,0.0000016389939,0.00006522501,0.0000068575196,0.000022359267,0.000023550843,0.9848222,0.00044637048,0.0029202641,0.011297167,0.00023917563],"about_ca_topic_score_codex":0.000031141022,"about_ca_topic_score_gemma":3.2004627e-7,"teacher_disagreement_score":0.051629238,"about_ca_system_score_codex":0.000049369843,"about_ca_system_score_gemma":0.000064066895,"threshold_uncertainty_score":0.71464276},"labels":[],"label_agreement":null},{"id":"W4409282847","doi":"10.1145/3676536.3676807","title":"A Framework for Explainable, Comprehensive, and Customizable Memory-Centric Workloads","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer architecture; Memory management; Operating system; Semiconductor memory","score_opus":0.024164423346374093,"score_gpt":0.2899961210250301,"score_spread":0.265831697678656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409282847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002565774,0.0032553785,0.9885858,0.0009827683,0.00034339397,0.00028949944,9.503974e-7,0.0016286825,0.0046569454],"genre_scores_gemma":[0.05039844,0.0002587015,0.9456296,0.0006639474,0.00008133537,0.00005172698,0.0000017365162,0.000014111005,0.002900409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897087,0.000031912794,0.00017173811,0.0004230388,0.00011856833,0.00028390292],"domain_scores_gemma":[0.99903256,0.000462895,0.000027452468,0.00030127465,0.00008898958,0.00008683967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001605119,0.00013591559,0.00015832201,0.0001887983,0.00016239984,0.00052238913,0.00036458255,0.00008994026,0.000021702313],"category_scores_gemma":[0.000045689587,0.000117523254,0.000054611268,0.0006149213,0.00002974759,0.0003072601,0.0002089295,0.00012655552,0.000018851415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008487604,0.0000342869,0.000025326884,0.00014388614,0.000030182495,0.000017235438,0.00034407366,0.00433693,0.000021939935,0.8519611,0.07042085,0.072655715],"study_design_scores_gemma":[0.00015644512,0.00005794043,0.000018094246,0.000115349234,0.000006391176,0.000021101292,0.000025839428,0.871823,0.00067349954,0.065512426,0.06138992,0.00019995612],"about_ca_topic_score_codex":0.000008172001,"about_ca_topic_score_gemma":2.0520167e-7,"teacher_disagreement_score":0.8674861,"about_ca_system_score_codex":0.000026701488,"about_ca_system_score_gemma":0.000048740614,"threshold_uncertainty_score":0.503741},"labels":[],"label_agreement":null},{"id":"W4409363815","doi":"10.1609/aaai.v39i21.34421","title":"HVAdam: A Full-Dimension Adaptive Optimizer","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Wuhan University","keywords":"Dimension (graph theory); Fourth Dimension; Mathematics; Computer science; Mathematical optimization; Physics; Combinatorics","score_opus":0.055197277646863774,"score_gpt":0.2981781979622881,"score_spread":0.24298092031542434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009899742,0.0000419724,0.9392537,0.0050090803,0.00046115907,0.00044647534,0.0000015690672,0.000368023,0.04451828],"genre_scores_gemma":[0.90980947,0.000032928776,0.08886451,0.00046009332,0.000021606422,0.000022380878,2.2319357e-7,0.000006834967,0.0007819238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998363,0.000024503755,0.00048328185,0.0004952996,0.00034932082,0.00028455438],"domain_scores_gemma":[0.9983802,0.00009834687,0.0002949829,0.0003475445,0.0008231418,0.00005581047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043879816,0.00021092537,0.0002531235,0.00020841202,0.00024676975,0.00020568476,0.0019453438,0.0001019949,0.000021523487],"category_scores_gemma":[0.0002612867,0.0001588424,0.00011869722,0.0009997255,0.00019292728,0.0002887542,0.0006226207,0.00027479566,0.00003510903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006740603,0.00009883452,0.000021110713,0.0000133708445,0.000014651913,2.6676773e-7,0.00036144524,0.0017657547,0.0090316925,0.9584548,0.0013097579,0.028860934],"study_design_scores_gemma":[0.000026404483,0.00014708756,0.00003182324,0.0002785326,0.000008461088,0.0000019751003,0.000116413124,0.5077688,0.3453613,0.14598872,0.00011005206,0.0001604463],"about_ca_topic_score_codex":0.000022406532,"about_ca_topic_score_gemma":0.0000021082346,"teacher_disagreement_score":0.89990973,"about_ca_system_score_codex":0.00005052176,"about_ca_system_score_gemma":0.00012927769,"threshold_uncertainty_score":0.64774054},"labels":[],"label_agreement":null},{"id":"W4409624861","doi":"10.1177/10943420251334456","title":"Preparing the TAU performance system for exascale and beyond","year":2025,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada); École de Technologie Supérieure","funders":"Office of Science; National Aeronautics and Space Administration","keywords":"Exascale computing; Computer science; Parallel computing; Supercomputer","score_opus":0.008627947745729165,"score_gpt":0.26427825634278473,"score_spread":0.25565030859705556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409624861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12813038,0.00024260342,0.8668197,0.003007712,0.00044473735,0.00027179494,0.0000012799436,0.000091875634,0.0009899159],"genre_scores_gemma":[0.94185954,0.00011302927,0.057305023,0.00035291037,0.00022577525,0.00003410654,0.0000014211087,0.0000053418726,0.00010286388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989389,0.00003423313,0.0004525368,0.00016023453,0.00026889972,0.00014520042],"domain_scores_gemma":[0.9983108,0.00037920094,0.00040254433,0.00032623255,0.0005538174,0.000027381642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010407498,0.00010488028,0.00013928769,0.00013970156,0.0005967891,0.00025147834,0.0020419376,0.000032969925,3.180919e-7],"category_scores_gemma":[0.00002524575,0.000066228946,0.00005605487,0.0002577245,0.000082904095,0.00026409994,0.000386546,0.00018855317,0.0000016148022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006939966,0.00010804838,0.0026110844,0.00015530638,0.00029027686,6.721797e-7,0.0011173198,0.18901321,0.00032103003,0.2621371,0.0084803235,0.5356962],"study_design_scores_gemma":[0.00040314233,0.000059897295,0.005024109,0.00018375141,0.000024073712,0.00013985475,0.00007267015,0.97615933,0.004056651,0.001584586,0.012187082,0.00010485692],"about_ca_topic_score_codex":0.0000059773233,"about_ca_topic_score_gemma":6.701035e-7,"teacher_disagreement_score":0.81372917,"about_ca_system_score_codex":0.00008681524,"about_ca_system_score_gemma":0.00009839956,"threshold_uncertainty_score":0.45900798},"labels":[],"label_agreement":null},{"id":"W4409653123","doi":"10.1007/s44373-025-00026-w","title":"Integrating Wolfram Language and Python into Marcus theory: computing toolbox and teaching for students","year":2025,"lang":"en","type":"article","venue":"Discover Electrochemistry.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Institut Universitaire de France; National Research Council of Thailand; Vidyasirimedhi Institute of Science and Technology","keywords":"Toolbox; Python (programming language); Computer science; Programming language; Mathematics education; Psychology","score_opus":0.003451628915600321,"score_gpt":0.30410244575230405,"score_spread":0.30065081683670375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409653123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19385707,0.0005163827,0.80252016,0.00019769213,0.000032691834,0.00015182511,8.987263e-7,0.00023121502,0.0024920574],"genre_scores_gemma":[0.8818734,0.000011485076,0.11690896,0.00027163923,0.00003621751,0.000013865196,0.000009730419,0.000009175672,0.0008654822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989199,0.00005856866,0.00019656088,0.00043595192,0.0001259439,0.0002630422],"domain_scores_gemma":[0.9993249,0.00024558452,0.00008732471,0.00025570358,0.00003940421,0.000047073903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056697114,0.00017092389,0.00018120649,0.000063101295,0.00031210468,0.0004839805,0.0004797348,0.000068849666,6.4933363e-7],"category_scores_gemma":[0.00025222695,0.00015940417,0.000037919854,0.00010847939,0.00004129351,0.00017487138,0.00034006106,0.00023108169,1.788603e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112033085,0.00026348687,0.01279947,0.0007000986,0.0002515025,0.0000112791795,0.014135291,0.00020592175,0.21871689,0.39619365,0.002548768,0.3540616],"study_design_scores_gemma":[0.002719099,0.00034576218,0.0021116547,0.0010545976,0.000093210656,0.000052762145,0.0023395636,0.41944924,0.44322166,0.1251843,0.0019626883,0.0014654843],"about_ca_topic_score_codex":0.0000143758025,"about_ca_topic_score_gemma":0.0000016844198,"teacher_disagreement_score":0.68801636,"about_ca_system_score_codex":0.000048297698,"about_ca_system_score_gemma":0.000049709368,"threshold_uncertainty_score":0.6500313},"labels":[],"label_agreement":null},{"id":"W4409865208","doi":"10.1007/978-3-031-87345-4_19","title":"A653MSim: An ARINC 653 Multicore Simulator","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Shriners Hospitals for Children - Canada; Polytechnique Montréal","funders":"","keywords":"Computer science; Multi-core processor; Embedded system; Operating system","score_opus":0.022925447836538736,"score_gpt":0.26197389160892054,"score_spread":0.2390484437723818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409865208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035400473,0.00021717543,0.994271,0.00048182972,0.00042896866,0.00044287683,0.000029055065,0.00022158623,0.0038721154],"genre_scores_gemma":[0.008455584,0.00007107198,0.99084985,0.0002845826,0.00009010806,0.000014090917,0.00002837792,0.000012268032,0.00019404048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987234,0.000014170699,0.000603589,0.00020580755,0.00023136764,0.00022167504],"domain_scores_gemma":[0.99813557,0.0002983285,0.00041335355,0.00086596137,0.00023087877,0.000055911045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034297685,0.00028884108,0.00036605776,0.00026778696,0.0009080132,0.0002997126,0.0028000136,0.00023967937,6.2371845e-7],"category_scores_gemma":[0.00006869755,0.00024147185,0.0001723586,0.0002563717,0.00028728996,0.00042313972,0.0011374732,0.00038248493,3.2446943e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.058052e-7,0.000011917791,0.0000020663651,0.000090614165,0.00003367855,4.653604e-8,0.00054924045,0.8601189,0.0000013932925,0.11666225,0.00010021912,0.022428952],"study_design_scores_gemma":[0.00013772817,0.00005301962,0.000013587627,0.00018149373,0.000023875886,0.000003479808,0.0000010959535,0.9701078,0.000055276676,0.0020084952,0.027155712,0.00025843995],"about_ca_topic_score_codex":0.000023811568,"about_ca_topic_score_gemma":0.000024724202,"teacher_disagreement_score":0.11465375,"about_ca_system_score_codex":0.000058653524,"about_ca_system_score_gemma":0.00022431517,"threshold_uncertainty_score":0.9846936},"labels":[],"label_agreement":null},{"id":"W4409930260","doi":"10.1007/979-8-8688-1460-0_8","title":"Building Blocks of JavaScript","year":2025,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"JavaScript; Unobtrusive JavaScript; Computer science; Programming language; Rich Internet application","score_opus":0.019662509105884386,"score_gpt":0.2509333414228847,"score_spread":0.23127083231700032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409930260","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.3800336e-7,0.0002738314,0.4743547,0.000018198552,0.00019679427,0.000102716345,0.0000032396592,0.00028792073,0.52476174],"genre_scores_gemma":[0.0012140858,0.00002709027,0.27139494,0.00018249491,0.000057986916,0.000007885822,0.0000022589143,0.00001895356,0.7270943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986646,0.000018880544,0.0004056683,0.00045281838,0.00026988174,0.00018814561],"domain_scores_gemma":[0.9984549,0.00009255151,0.00029269658,0.0009315054,0.00017517002,0.000053127413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016404527,0.00026067227,0.0003919606,0.00028303397,0.00007648996,0.000068197696,0.0013830286,0.00026585723,0.000010609106],"category_scores_gemma":[0.000018061697,0.00027068044,0.00016885392,0.000020133417,0.000074242285,0.00004584769,0.00073024374,0.00027304346,0.0000034026186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018587531,0.0000045036095,5.246437e-7,0.00004840954,0.00004674095,0.000005352269,0.00006276707,0.00014174772,0.00008732422,0.9403952,0.011611645,0.047593955],"study_design_scores_gemma":[0.00024638072,0.00007485792,0.0000011949502,0.0011839633,0.000055020653,0.000009840752,6.2545496e-7,0.021880956,0.018838828,0.23941588,0.7176591,0.00063331064],"about_ca_topic_score_codex":0.000019489427,"about_ca_topic_score_gemma":8.59431e-7,"teacher_disagreement_score":0.7060475,"about_ca_system_score_codex":0.000026423242,"about_ca_system_score_gemma":0.00011080056,"threshold_uncertainty_score":0.99997455},"labels":[],"label_agreement":null},{"id":"W4409930899","doi":"10.1007/979-8-8688-1460-0_10","title":"Control Flow in JavaScript","year":2025,"lang":"en","type":"book-chapter","venue":"Apress eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"JavaScript; Computer science; Unobtrusive JavaScript; Control flow; Programming language; Rich Internet application","score_opus":0.013641746383127968,"score_gpt":0.22575055474867062,"score_spread":0.21210880836554266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409930899","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.7416849e-7,0.0002235353,0.46073908,0.000060692793,0.00021372359,0.00018385283,0.0000048948345,0.0003436421,0.5382304],"genre_scores_gemma":[0.0019999444,0.000028723867,0.08063626,0.0012494894,0.00008819646,0.000036832895,0.000007158717,0.000026642525,0.91592675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856603,0.00003775668,0.00037716015,0.000538085,0.0002304199,0.00025056498],"domain_scores_gemma":[0.99875003,0.000107752916,0.00014252574,0.0008476722,0.00009323081,0.0000587835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020198304,0.00029138054,0.00040565204,0.00033460645,0.00006460785,0.00013126047,0.001202064,0.00030544848,0.000012156613],"category_scores_gemma":[0.000019010196,0.00030308779,0.00012748045,0.000020216929,0.000049116734,0.00006230334,0.00033634325,0.0003939609,0.00002488508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007187636,0.000009541497,0.0000030991828,0.00003861665,0.00004184471,0.000043762033,0.00012285422,0.0012648702,0.0000075356093,0.89670384,0.023312448,0.078444414],"study_design_scores_gemma":[0.0007794339,0.000050316878,0.000006309001,0.00064091204,0.000022398031,0.000007107383,4.471267e-7,0.2562024,0.00027753494,0.099460825,0.6419068,0.00064548827],"about_ca_topic_score_codex":0.000031233034,"about_ca_topic_score_gemma":0.000010435426,"teacher_disagreement_score":0.797243,"about_ca_system_score_codex":0.000054822824,"about_ca_system_score_gemma":0.00012626081,"threshold_uncertainty_score":0.9999421},"labels":[],"label_agreement":null},{"id":"W4410299961","doi":"10.1016/j.sysarc.2025.103423","title":"GAROS: Genetic algorithm-aided row-skipping for shift and duplicate kernel mapping in processing-in-memory architectures","year":2025,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Information Technology Research Centre; Ministry of Science and ICT, South Korea; Ministry of Trade, Industry and Energy; National Research Foundation of Korea; Samsung; Ministry of Education; Sungkyunkwan University","keywords":"Computer science; Kernel (algebra); Algorithm; Parallel computing; Mathematics","score_opus":0.009903244853141379,"score_gpt":0.2517593208499379,"score_spread":0.24185607599679654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410299961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047422614,0.0056463373,0.9450015,0.0010403562,0.0002255533,0.00045168944,0.0000013776323,0.00007152063,0.00013905276],"genre_scores_gemma":[0.6913341,0.000035586694,0.30821875,0.00018523143,0.00012293547,0.000026776363,3.8356447e-7,0.000012493957,0.00006374124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980802,0.0001495225,0.0008596739,0.00034332555,0.0002282753,0.00033902138],"domain_scores_gemma":[0.99889946,0.00017336672,0.00047533077,0.00025182473,0.00012015554,0.00007988837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008822601,0.00021532305,0.0004887583,0.0010684794,0.00010912958,0.00025109464,0.00069646316,0.00011853992,2.3318168e-7],"category_scores_gemma":[0.00010850882,0.00017968337,0.00009328857,0.00063883583,0.000046859288,0.000098595054,0.0001547887,0.0004593862,1.6045729e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041656265,0.0000972457,0.0041711032,0.0010542544,0.00004212889,0.0000872569,0.0065794867,0.5933279,0.00087592413,0.00042913776,0.00022594223,0.39306796],"study_design_scores_gemma":[0.0020489634,0.00018036732,0.0454508,0.0043405253,0.000015227453,0.0005202375,0.00018276731,0.9265828,0.00046819498,0.018300677,0.0014608576,0.000448592],"about_ca_topic_score_codex":0.000039099185,"about_ca_topic_score_gemma":0.00001035416,"teacher_disagreement_score":0.6439115,"about_ca_system_score_codex":0.000077221666,"about_ca_system_score_gemma":0.000183606,"threshold_uncertainty_score":0.7327275},"labels":[],"label_agreement":null},{"id":"W4410356746","doi":"10.1145/3672608.3707822","title":"On the Time Predictability of AXI4","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"HORIZON EUROPE Digital, Industry and Space; Natural Sciences and Engineering Research Council of Canada","keywords":"Predictability; Computer science; Mathematics; Statistics","score_opus":0.007823658933440128,"score_gpt":0.24067216490605844,"score_spread":0.2328485059726183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410356746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00323911,0.000007893861,0.87185806,0.0023129915,0.000034303288,0.0000701401,2.2775654e-7,0.00024141395,0.12223589],"genre_scores_gemma":[0.93745315,0.0000018185224,0.05751223,0.0010078073,0.0000037941472,0.000004398781,2.3586561e-7,0.0000010575864,0.004015495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996057,0.0000498633,0.00010090924,0.000109421846,0.00007795192,0.000056145404],"domain_scores_gemma":[0.99925935,0.00024783827,0.000025196236,0.00041223774,0.00004654296,0.000008835462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002854826,0.000035894795,0.000054432043,0.0000342775,0.000042675212,0.00001924648,0.00052130123,0.00001847882,0.000036536178],"category_scores_gemma":[0.00009678533,0.000021114078,0.000025791114,0.0002380822,0.000029231902,0.000034584406,0.00013036291,0.00004044202,0.000013327588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001984276,0.000043886237,0.00023308117,0.0000037060165,0.000005495712,8.0842796e-8,0.000050862298,0.0013725959,0.00007240254,0.9548139,0.03989314,0.0035088658],"study_design_scores_gemma":[0.00007698619,0.00006127342,0.0022661954,0.000025457757,0.000001590019,2.4666127e-7,0.0000023092189,0.8812149,0.018965444,0.09615911,0.0011709437,0.000055528762],"about_ca_topic_score_codex":0.000006442234,"about_ca_topic_score_gemma":2.063688e-7,"teacher_disagreement_score":0.93421406,"about_ca_system_score_codex":0.0000074307422,"about_ca_system_score_gemma":0.000028985403,"threshold_uncertainty_score":0.09687161},"labels":[],"label_agreement":null},{"id":"W4410427856","doi":"10.1109/tcsvt.2025.3570707","title":"ShiftQuant: Toward Accurate and Efficient Sub-8-bit Integer Training","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Integer (computer science); Bit (key); Algorithm; Theoretical computer science; Computer network; Programming language","score_opus":0.03626091097901787,"score_gpt":0.27870715096948784,"score_spread":0.24244623999046996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410427856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013867035,0.0008454475,0.9817718,0.0011344814,0.000689892,0.0005307164,0.000010397622,0.0009262387,0.00022395569],"genre_scores_gemma":[0.99714184,0.00012286328,0.0022586228,0.0001456945,0.000011106216,0.00019110994,5.28515e-7,0.000011062313,0.00011719105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986555,0.000046423702,0.00036205727,0.00052677706,0.00010199123,0.00030727783],"domain_scores_gemma":[0.9991706,0.00020443402,0.00009852321,0.00035344862,0.00011507866,0.000057888912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037432232,0.00019145611,0.00032804027,0.00073814,0.00035721497,0.00017314055,0.0003605865,0.00021356822,5.5366496e-7],"category_scores_gemma":[0.000023159108,0.00017794778,0.000059288006,0.0006230851,0.000117967706,0.000105966916,0.000008683802,0.00023466976,0.0000016963193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000337252,0.0002563553,0.000050518793,0.0005501451,0.0002575894,0.000016712094,0.0027740102,0.07516584,0.0040053315,0.3809855,0.00072732475,0.53517693],"study_design_scores_gemma":[0.00089696667,0.00034895004,0.00002990276,0.00039261492,0.000037243797,0.00010464219,0.00042705907,0.97305435,0.015575316,0.0046710907,0.004067788,0.00039408443],"about_ca_topic_score_codex":0.000017468798,"about_ca_topic_score_gemma":0.0000050281988,"teacher_disagreement_score":0.98327476,"about_ca_system_score_codex":0.000043551987,"about_ca_system_score_gemma":0.00006662393,"threshold_uncertainty_score":0.72564995},"labels":[],"label_agreement":null},{"id":"W4410599492","doi":"10.1119/5.0218051","title":"Enhancing conceptual understanding of Gauss's law through asymmetric infinite sheet/slab charge examples","year":2025,"lang":"en","type":"article","venue":"American Journal of Physics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Slab; Gauss; Gauss's law; Charge (physics); Theoretical physics; Classical mechanics; Quantum mechanics; Geophysics","score_opus":0.03686317244691239,"score_gpt":0.2878918878221576,"score_spread":0.2510287153752452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410599492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029855834,0.00014811863,0.9875912,0.000305455,0.00018986862,0.000045466848,0.000001463493,0.000049481176,0.00868338],"genre_scores_gemma":[0.8502498,0.00010285941,0.14876214,0.0007798583,0.000072350675,6.047852e-7,5.322109e-7,0.0000065492254,0.000025297324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986581,0.0001295531,0.00053715624,0.00016191107,0.0003040547,0.00020921543],"domain_scores_gemma":[0.99815404,0.00044441177,0.00084335904,0.00025638295,0.00025295693,0.000048837683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003740128,0.00013558922,0.000419502,0.00017046648,0.00011419597,0.00006533396,0.0006631267,0.000025459327,0.0000030963006],"category_scores_gemma":[0.000070463546,0.00012526847,0.00013253388,0.0016829158,0.00035398963,0.00047809462,0.00014477129,0.00021412496,0.0000015516187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009779092,0.000064896565,0.0001637632,0.000012949364,0.000074865515,0.0000037246132,0.0022055372,0.0024470785,0.0008956629,0.9833981,0.0006180272,0.010105657],"study_design_scores_gemma":[0.0029309483,0.003991558,0.0003613375,0.002120334,0.00020817958,0.00007598881,0.009650143,0.05117858,0.4367115,0.48209623,0.009205475,0.0014697522],"about_ca_topic_score_codex":0.000071266215,"about_ca_topic_score_gemma":0.0000020042205,"teacher_disagreement_score":0.84726423,"about_ca_system_score_codex":0.0001016233,"about_ca_system_score_gemma":0.0001801693,"threshold_uncertainty_score":0.51083},"labels":[],"label_agreement":null},{"id":"W4411374395","doi":"10.1145/3722212.3725096","title":"Demo of LearnedWMP: Workload Memory Prediction Using Deep Query Template Representations","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Workload; Artificial intelligence; Query optimization; Information retrieval; Parallel computing; Data mining; Operating system","score_opus":0.022754715188950336,"score_gpt":0.3026753439356133,"score_spread":0.27992062874666296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411374395","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038728726,0.0001539879,0.95799494,0.00024380964,0.00019689265,0.000117005715,4.4507775e-7,0.00053695077,0.036883123],"genre_scores_gemma":[0.45706534,0.00003878072,0.540826,0.00015379048,0.000018144608,0.0000055282867,0.0000016048238,0.000004067128,0.0018867506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990964,0.00008033693,0.0003006809,0.00025671974,0.00013503226,0.00013084772],"domain_scores_gemma":[0.99922496,0.00009504353,0.0001012235,0.0004173095,0.000131127,0.000030352265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024535882,0.00007981853,0.00012272024,0.0002423108,0.00014235271,0.000057272893,0.00037157058,0.000061523206,0.000013930927],"category_scores_gemma":[0.00006193664,0.00007922976,0.000053929925,0.0007236685,0.000038005233,0.00028890543,0.00019036778,0.00008709398,0.000003107716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017802262,0.00017994607,0.012627063,0.00006675169,0.000103698665,0.000005666834,0.0008051996,0.8177711,0.0028198245,0.060220808,0.0073975516,0.09798459],"study_design_scores_gemma":[0.00014174494,0.000016364036,0.0015657849,0.00007264179,0.000008649331,0.0000044480807,0.000040059356,0.9811057,0.011484384,0.0053147655,0.00016924902,0.000076198],"about_ca_topic_score_codex":0.00011310303,"about_ca_topic_score_gemma":0.00000565207,"teacher_disagreement_score":0.45319247,"about_ca_system_score_codex":0.00003153535,"about_ca_system_score_gemma":0.00007722994,"threshold_uncertainty_score":0.32308957},"labels":[],"label_agreement":null},{"id":"W4411374885","doi":"10.1145/3724389.3731256","title":"Enhancing MIPS Assembly Language Education with Saturn","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Saturn; Computer science; Rings of Saturn; Astrobiology; Astronomy; Planet; Physics","score_opus":0.004618073348547401,"score_gpt":0.2634619113086738,"score_spread":0.2588438379601264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411374885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006649207,0.00015001411,0.9280124,0.0007263165,0.00011660074,0.00007075494,5.0985342e-8,0.0005994815,0.06367522],"genre_scores_gemma":[0.43886378,0.0000062510053,0.551452,0.0012133558,0.000018715224,0.000008102634,0.0000013924717,0.000002571265,0.008433865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950254,0.000026808373,0.0000953406,0.00018547194,0.0000829218,0.000106898544],"domain_scores_gemma":[0.9995394,0.000035878806,0.000033423054,0.0002952104,0.000070626564,0.0000255104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001209918,0.00006523623,0.00006789209,0.000117295174,0.00007308094,0.00011861575,0.000330186,0.00002915315,0.000004473529],"category_scores_gemma":[0.00001986467,0.000051014405,0.000015805552,0.00040032362,0.000008303493,0.000165956,0.000076154756,0.000062088584,0.000010103289],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010927167,0.00030294625,0.0015718003,0.00006979426,0.00004580213,0.000006483608,0.0022609804,0.0015134197,0.009942223,0.52633566,0.04625803,0.41168198],"study_design_scores_gemma":[0.0007200998,0.0002401279,0.0056619383,0.0006333615,0.00002393427,0.00003855898,0.00089731504,0.24715291,0.7075254,0.005594806,0.03056162,0.0009499385],"about_ca_topic_score_codex":0.00005360976,"about_ca_topic_score_gemma":0.000028541217,"teacher_disagreement_score":0.6975832,"about_ca_system_score_codex":0.000025458645,"about_ca_system_score_gemma":0.00021053414,"threshold_uncertainty_score":0.2080307},"labels":[],"label_agreement":null},{"id":"W4411486321","doi":"10.1145/3695053.3731054","title":"Magellan: A High-Performance Loop-Guided Prefetcher for Indirect Memory Access","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Computer architecture; Parallel computing","score_opus":0.03163824291625985,"score_gpt":0.30615243303645867,"score_spread":0.27451419012019884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411486321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0134492265,0.00005330799,0.9358379,0.0012955558,0.00030172733,0.0003578989,7.17816e-7,0.0011415805,0.04756207],"genre_scores_gemma":[0.50540084,0.000048410428,0.43289834,0.0024661291,0.00005648559,0.00012349596,0.0000057856214,0.000012013061,0.058988493],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904877,0.00003531042,0.00020428226,0.0003569961,0.00011798147,0.00023665506],"domain_scores_gemma":[0.9991724,0.000098163524,0.000068926434,0.00048813154,0.0001342929,0.000038119597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032027278,0.00012963501,0.0001705068,0.00018572446,0.00014043064,0.000246395,0.0012672705,0.00007320988,0.000019242909],"category_scores_gemma":[0.00004033917,0.00011245371,0.000044781882,0.0005115876,0.000022480255,0.0003888319,0.00039253882,0.000076667275,0.000012610606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041702246,0.00018928594,0.003182244,0.00029940662,0.00011327323,0.0000035809737,0.00026605016,0.035378322,0.00046057123,0.04079164,0.71728146,0.2019925],"study_design_scores_gemma":[0.0007202824,0.00007204181,0.002750312,0.00007209317,0.000010096028,0.0000028671889,0.0000032542391,0.81047606,0.17001191,0.0043923524,0.011170918,0.00031781703],"about_ca_topic_score_codex":0.000021799031,"about_ca_topic_score_gemma":0.0000023860277,"teacher_disagreement_score":0.7750977,"about_ca_system_score_codex":0.00003481301,"about_ca_system_score_gemma":0.00010001132,"threshold_uncertainty_score":0.4585729},"labels":[],"label_agreement":null},{"id":"W4411502515","doi":"10.15388/ioi.2025.02","title":"Virtual Time Measurement in Programming Contests","year":2025,"lang":"en","type":"article","venue":"OLYMPIADS IN INFORMATICS","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Computer science; Scalability; CONTEST; Execution time; Programming language; Operating system","score_opus":0.014185918040118456,"score_gpt":0.256310648241054,"score_spread":0.24212473020093553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411502515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004074871,0.00005839614,0.9746167,0.00018876097,0.00013531622,0.00025227666,2.343273e-7,0.00029733978,0.020376109],"genre_scores_gemma":[0.5993659,0.000018370478,0.39936647,0.00071141904,0.000010077421,0.000049583396,0.0000026043779,0.000005429855,0.00047012675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987844,0.00004425649,0.00055447203,0.00010166642,0.0002722989,0.0002428757],"domain_scores_gemma":[0.9993988,0.000065785636,0.00009864092,0.00031633195,0.00009077065,0.000029656932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009908923,0.0001111494,0.0001657063,0.00037948115,0.0000439477,0.00013943139,0.0006136077,0.00006698161,0.0000021855105],"category_scores_gemma":[0.00017169368,0.000108453954,0.000027537657,0.0007993454,0.00002572356,0.000404712,0.00022711387,0.00013302562,0.000025454314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016501781,0.00035848498,0.011116653,0.0001436853,0.00002688852,0.000012967846,0.011090374,0.0544695,0.0000688646,0.12222967,0.0049373787,0.795529],"study_design_scores_gemma":[0.0006325141,0.000058045,0.0012475222,0.00036241062,0.000001495899,0.0000027154792,0.00008069893,0.9896704,0.0007958462,0.0011198372,0.0058402573,0.00018824772],"about_ca_topic_score_codex":0.000012417209,"about_ca_topic_score_gemma":0.000011168304,"teacher_disagreement_score":0.9352009,"about_ca_system_score_codex":0.00019248314,"about_ca_system_score_gemma":0.00015216674,"threshold_uncertainty_score":0.4422624},"labels":[],"label_agreement":null},{"id":"W4411548970","doi":"10.1103/bqpq-5cp9","title":"GPU-accelerated subcycling time integration with the einstein toolkit","year":2025,"lang":"en","type":"article","venue":"Physical review. D/Physical review. D.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute; University of Waterloo; University of British Columbia","funders":"Ministry of Colleges and Universities; National Science Foundation; Government of Canada; Natural Sciences and Engineering Research Council of Canada; Rochester Institute of Technology; National Aeronautics and Space Administration; Innovation, Science and Economic Development Canada","keywords":"Einstein; Computer science; Physics; Mathematical physics","score_opus":0.017245589684978017,"score_gpt":0.3929269510817956,"score_spread":0.37568136139681757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411548970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040745456,0.07080451,0.7627841,0.054420747,0.0002903452,0.005449129,0.000010284362,0.0025408983,0.06295451],"genre_scores_gemma":[0.83336717,0.09887321,0.024391575,0.03964217,0.00077595847,0.0009601471,0.00010950049,0.00010273709,0.0017775288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970652,0.00053087826,0.00057634944,0.00079249236,0.0005796397,0.00045543603],"domain_scores_gemma":[0.9972993,0.0005397359,0.00035234002,0.001284472,0.00039025073,0.00013390683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006667359,0.00046588873,0.0010703818,0.00006709181,0.00029695075,0.0002267011,0.001678308,0.000040096173,0.000007898666],"category_scores_gemma":[0.00041537647,0.0002736792,0.0004076724,0.0022795645,0.00012932725,0.000499406,0.00037660383,0.0005763148,0.0003427779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032396463,0.0014670667,0.00014977867,0.0042213504,0.00022589153,0.000018900299,0.0002385681,0.0006838283,0.0107240025,0.33504677,0.14107774,0.5061137],"study_design_scores_gemma":[0.0008064501,0.0008222148,0.0005896248,0.046310473,0.0007477101,0.000014760809,0.000006585033,0.6428437,0.025973285,0.050850313,0.22909945,0.0019354054],"about_ca_topic_score_codex":0.0000112745565,"about_ca_topic_score_gemma":0.0000013978188,"teacher_disagreement_score":0.79262173,"about_ca_system_score_codex":0.00008467223,"about_ca_system_score_gemma":0.00016034498,"threshold_uncertainty_score":0.99997157},"labels":[],"label_agreement":null},{"id":"W4411552578","doi":"10.1109/icse55347.2025.00059","title":"Measuring the Runtime Performance of C++ Code Written by Humans Using Github Copilot","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Code (set theory); Source code; Parallel computing; Operating system; Programming language","score_opus":0.03200102663015766,"score_gpt":0.26429539102200694,"score_spread":0.23229436439184928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411552578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060613252,0.00015886371,0.9248922,0.00041577857,0.00008058727,0.000104816776,8.0866994e-7,0.00027085637,0.0134628285],"genre_scores_gemma":[0.89382666,0.000027838498,0.10418877,0.00039185822,0.0000099043955,0.0000032517205,6.851442e-7,0.0000041073117,0.0015468918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922764,0.00004565728,0.00022077358,0.00018781317,0.00016493638,0.00015318632],"domain_scores_gemma":[0.9993258,0.0000527205,0.00007708607,0.00042038882,0.00010570512,0.000018276261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003437899,0.00008705452,0.0001236182,0.00007834394,0.00022065615,0.00007875806,0.0008757851,0.000030996533,0.000006286911],"category_scores_gemma":[0.000015082395,0.00006276493,0.000035443816,0.00038566397,0.000054197895,0.000172192,0.000267572,0.00008495076,0.0000030955969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007710701,0.0008731813,0.07694201,0.00060138357,0.0004700432,0.000004875062,0.0040184623,0.30901635,0.061342757,0.2656877,0.21350726,0.06745885],"study_design_scores_gemma":[0.00012940279,0.000034923174,0.00092844066,0.00007399767,0.0000058457185,0.000001339392,0.000009067284,0.94620067,0.05024832,0.00028186175,0.001984884,0.00010126083],"about_ca_topic_score_codex":0.00005121598,"about_ca_topic_score_gemma":0.000002231925,"teacher_disagreement_score":0.83321345,"about_ca_system_score_codex":0.000024745783,"about_ca_system_score_gemma":0.000054244694,"threshold_uncertainty_score":0.25594795},"labels":[],"label_agreement":null},{"id":"W4411600806","doi":"10.1109/tnsm.2025.3582223","title":"FR-SFCO: Energy-Aware Offloading on Data Plane for Delay-Sensitive SFC","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Major Research Plan; National Natural Science Foundation of China","keywords":"Computer science; Forwarding plane; Energy consumption; Computer network; Network packet; Electrical engineering","score_opus":0.022041244304607605,"score_gpt":0.2585684639979712,"score_spread":0.23652721969336357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411600806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060716597,0.000039642295,0.9914562,0.0020151455,0.00056704145,0.00029322767,0.000020651416,0.00036651484,0.0051808734],"genre_scores_gemma":[0.7967901,0.0009903326,0.18286793,0.017046334,0.00014987377,0.00013799821,0.00008767548,0.000027681863,0.0019020488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874735,0.00005623098,0.00021052768,0.00057259377,0.00014023189,0.00027304547],"domain_scores_gemma":[0.99890494,0.00016920918,0.00005611273,0.00075036683,0.000063845844,0.000055510205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023456682,0.0001818589,0.0001710477,0.00016826365,0.0004500645,0.00014872772,0.0006495817,0.00006436358,0.0000025411334],"category_scores_gemma":[5.011122e-7,0.0001821612,0.00003836827,0.00052698527,0.000012919681,0.0001535409,0.00003492534,0.00010964114,0.00000411325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010412779,0.00014767765,0.0000018179684,0.00011519023,0.00025252817,0.00001372053,0.00014653821,0.6680531,0.0000031911572,0.028256165,0.019166945,0.283739],"study_design_scores_gemma":[0.00040798626,0.000090594345,0.000015111703,0.00018904528,0.000053896147,0.0000020236862,0.000034827855,0.9631724,0.0002740105,0.0010803617,0.034488767,0.00019099342],"about_ca_topic_score_codex":0.00005113008,"about_ca_topic_score_gemma":0.00011575149,"teacher_disagreement_score":0.80858827,"about_ca_system_score_codex":0.00003449516,"about_ca_system_score_gemma":0.00001746612,"threshold_uncertainty_score":0.74283177},"labels":[],"label_agreement":null},{"id":"W4411801362","doi":"10.3390/fi17070297","title":"Lower-Latency Screen Updates over QUIC with Forward Error Correction","year":2025,"lang":"en","type":"article","venue":"Future Internet","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Latency (audio); Forward error correction; Error detection and correction; Real-time computing; Algorithm; Telecommunications; Decoding methods","score_opus":0.005884714626503385,"score_gpt":0.24603332902205954,"score_spread":0.24014861439555615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411801362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056958734,0.00013987417,0.9780368,0.0011323506,0.002280984,0.00013787838,0.0000014230144,0.0007740416,0.0118007455],"genre_scores_gemma":[0.8629522,0.0000270452,0.11840033,0.001704716,0.000326751,0.000019714616,0.000020615258,0.000015391086,0.016533284],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990873,0.00004003063,0.00017983378,0.00035239995,0.0001471189,0.00019336907],"domain_scores_gemma":[0.99935514,0.000029288509,0.00008367865,0.00038793185,0.000100531804,0.000043409575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011195943,0.00015237882,0.00014761,0.00016363812,0.00006144285,0.00016129813,0.0006544149,0.000090486465,0.000045853205],"category_scores_gemma":[0.000013141465,0.00011868266,0.000053769676,0.00042049502,0.000027465869,0.00026568415,0.00018953618,0.00017873626,0.00003137906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012756829,0.00014985997,0.0069170333,0.000026616639,0.000119709606,0.000028065147,0.00064869836,0.0023130311,0.000052977422,0.03652874,0.91085553,0.0422322],"study_design_scores_gemma":[0.0007763862,0.00061720866,0.011902166,0.00038065956,0.00002848089,0.00003932353,0.000049113856,0.7150029,0.004597157,0.0023710332,0.26366663,0.00056895113],"about_ca_topic_score_codex":0.00011690782,"about_ca_topic_score_gemma":0.000059861257,"teacher_disagreement_score":0.8596365,"about_ca_system_score_codex":0.00004583677,"about_ca_system_score_gemma":0.000048466016,"threshold_uncertainty_score":0.48397386},"labels":[],"label_agreement":null},{"id":"W4411851502","doi":"10.1007/978-981-96-3936-6_18","title":"Enhancing Processor Efficiency with Machine Learning-Based Branch Prediction Techniques","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Branch predictor; Computer science; Artificial intelligence; Machine learning; Parallel computing","score_opus":0.003461019655064605,"score_gpt":0.19607349507256652,"score_spread":0.19261247541750193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411851502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004902394,0.0013136971,0.99109226,0.00014104214,0.00007149926,0.0004076893,0.0000021147232,0.0024633093,0.004503465],"genre_scores_gemma":[0.32348812,0.00027733247,0.66983354,0.00052986125,0.00032522058,0.00017223782,0.000088204724,0.0001951051,0.005090419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979917,0.00002433081,0.00043486437,0.000715559,0.00038510805,0.00044843776],"domain_scores_gemma":[0.9988428,0.0004088186,0.0001591408,0.00038105992,0.00013842822,0.000069762384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025605925,0.0004847327,0.00047775422,0.00092615874,0.00010028876,0.000109770124,0.0006391051,0.00048150116,0.000005435262],"category_scores_gemma":[0.00035660563,0.00043844848,0.000091750306,0.0007350183,0.000022508008,0.000103304024,0.00009099397,0.001587289,0.0000016237739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018072793,0.000033562534,0.0000313402,0.00018942919,0.000022037299,0.00001915685,0.00004630755,0.9498871,0.00040221395,0.0036492285,0.000014818226,0.045686737],"study_design_scores_gemma":[0.00018141158,0.00034435472,0.0000053236813,0.00078975514,0.000015018751,0.000013645781,1.5467984e-8,0.9617198,0.0321909,0.0011299753,0.0031703797,0.00043939878],"about_ca_topic_score_codex":0.000010460074,"about_ca_topic_score_gemma":0.000009206696,"teacher_disagreement_score":0.3234832,"about_ca_system_score_codex":0.00026713312,"about_ca_system_score_gemma":0.00023405207,"threshold_uncertainty_score":0.9998067},"labels":[],"label_agreement":null},{"id":"W4412373995","doi":"10.1007/978-3-031-98208-8_8","title":"Portability of Optimizations from SC to TSO","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Software portability; Computer science; Programming language; Operating system; Software engineering","score_opus":0.013828346141456971,"score_gpt":0.2622796473828148,"score_spread":0.2484513012413578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412373995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002476017,0.00018060308,0.9896022,0.00082860695,0.0008022833,0.00041691907,0.000024219056,0.00031969463,0.0078007244],"genre_scores_gemma":[0.026354155,0.000026233334,0.9717876,0.0011011809,0.00010229361,0.000007957949,0.000011790721,0.00001461274,0.0005942255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677175,0.000042230567,0.000715823,0.00139417,0.0006817307,0.00039426424],"domain_scores_gemma":[0.99662507,0.00055402535,0.00030339556,0.0018383978,0.00052213226,0.00015698583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006480746,0.00039140397,0.0005833858,0.0010011726,0.00017546106,0.00023645339,0.0035395722,0.00026749432,0.000028459059],"category_scores_gemma":[0.00026076328,0.00039005547,0.00013205902,0.0011007645,0.00035310848,0.0002886785,0.0017753314,0.00043201458,0.000009900045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000462506,0.00004831948,0.0001669735,0.000023218998,0.000013842327,0.000009477254,0.0004978585,0.7029275,0.00004768986,0.02479475,0.00021815299,0.27124766],"study_design_scores_gemma":[0.00012842027,0.00009881715,0.00019771895,0.00045745447,0.000008613712,0.00000300239,6.939912e-8,0.87573403,0.0029736948,0.11898615,0.00092824665,0.00048379565],"about_ca_topic_score_codex":0.000106520274,"about_ca_topic_score_gemma":0.000048947502,"teacher_disagreement_score":0.27076384,"about_ca_system_score_codex":0.00018667502,"about_ca_system_score_gemma":0.0007966267,"threshold_uncertainty_score":0.99985516},"labels":[],"label_agreement":null},{"id":"W4412444696","doi":"10.1109/access.2025.3589353","title":"P4Muse: Enabling Modular P4 Programming via Compiler-Managed Code Merging Without Syntax Modifications","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Intel Corporation","keywords":"Computer science; Programming language; Compiler; Modular design; Abstract syntax tree; Syntax; Code (set theory); Parallel computing; Parsing; Artificial intelligence","score_opus":0.03322025648786596,"score_gpt":0.3280879164643197,"score_spread":0.2948676599764537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412444696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007863971,0.0001407078,0.986622,0.0008908313,0.00056229316,0.00041332046,0.0000017630208,0.0016729777,0.0018321767],"genre_scores_gemma":[0.80618477,0.000030338071,0.19295175,0.00034994198,0.00005313696,0.000088204695,0.0000048977413,0.0000143638035,0.0003225937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981856,0.0001270637,0.0004008615,0.000626405,0.00026831956,0.00039176183],"domain_scores_gemma":[0.998458,0.000111881614,0.00018870794,0.0009485658,0.00021050307,0.0000823054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046132054,0.00021166597,0.00025830214,0.0004151893,0.0005746528,0.00091060164,0.002297648,0.00008764059,0.0000031641257],"category_scores_gemma":[0.000058589063,0.00019832278,0.00008025071,0.0012892918,0.00006029422,0.00089412084,0.00042337074,0.00024485795,0.000009353695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022369617,0.0004904574,0.0072240056,0.00030028934,0.00022971701,0.000033208344,0.0014433078,0.70340216,0.0074648024,0.049680166,0.003839031,0.2258705],"study_design_scores_gemma":[0.0002440506,0.000010951621,0.0005350855,0.00013692217,0.000018844406,0.0000023797234,0.000013007069,0.9713112,0.018863125,0.004030972,0.0045444393,0.00028903782],"about_ca_topic_score_codex":0.00015462424,"about_ca_topic_score_gemma":0.000027446622,"teacher_disagreement_score":0.7983208,"about_ca_system_score_codex":0.00007527274,"about_ca_system_score_gemma":0.00007835788,"threshold_uncertainty_score":0.87809527},"labels":[],"label_agreement":null},{"id":"W4412819452","doi":"10.1007/978-3-031-89033-8_18","title":"OpenMP I","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.026363888787892687,"score_gpt":0.2678378213290092,"score_spread":0.2414739325411165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819452","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.5226201e-7,0.00023990321,0.44538608,0.000110122855,0.00017306795,0.00026197263,0.0000028954125,0.00038719445,0.5534383],"genre_scores_gemma":[0.000046118446,0.00014571165,0.38613477,0.00026951844,0.000042412197,0.000017357386,0.0000062401523,0.000031316868,0.6133065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979439,0.0000240304,0.00076210994,0.0005800795,0.00037529357,0.00031458327],"domain_scores_gemma":[0.99775773,0.00025023674,0.00035613892,0.001428364,0.00013135555,0.00007615309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050589157,0.00043554,0.0006429062,0.00048251273,0.000095812364,0.00024839016,0.0020452146,0.00040657018,0.000051961248],"category_scores_gemma":[0.0000815232,0.00043890806,0.0001643734,0.00009546595,0.000080056234,0.00014512167,0.00093685405,0.00055777136,0.00014221584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.050817e-7,0.00002894336,0.0000010018929,0.00016556123,0.000020612435,0.000030329813,0.00032225208,0.00019020675,0.0000015300138,0.9652838,0.028185494,0.0057694768],"study_design_scores_gemma":[0.00019173833,0.000037257727,9.551734e-7,0.0014747016,0.000017167271,0.000016203328,0.000004661419,0.099248946,0.000113386275,0.7748126,0.1235253,0.00055713416],"about_ca_topic_score_codex":0.0000033980205,"about_ca_topic_score_gemma":0.0000040486257,"teacher_disagreement_score":0.19047123,"about_ca_system_score_codex":0.00013557258,"about_ca_system_score_gemma":0.00022015226,"threshold_uncertainty_score":0.9998063},"labels":[],"label_agreement":null},{"id":"W4412819481","doi":"10.1007/978-3-031-89033-8_21","title":"GPU/CUDA Programming I","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"CUDA; Computer science; Parallel computing; General-purpose computing on graphics processing units; Computational science; Computer graphics (images); Graphics","score_opus":0.024289162827851454,"score_gpt":0.2655252250000956,"score_spread":0.24123606217224416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.383281e-7,0.0003043244,0.507151,0.000091154296,0.00018478502,0.00038301552,0.00000202984,0.0006478165,0.49123505],"genre_scores_gemma":[0.00005551179,0.00010134776,0.5540908,0.00015450161,0.000055937144,0.000032587326,0.0000075771345,0.000038523063,0.4454632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976018,0.000026231699,0.00086168305,0.00065165054,0.00044385492,0.00041474565],"domain_scores_gemma":[0.9977015,0.0002569044,0.00044185645,0.0013516906,0.00015852142,0.000089524554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005745336,0.0004999606,0.00068288227,0.0005333223,0.0001240268,0.0003068311,0.0017508218,0.00045439514,0.00002484667],"category_scores_gemma":[0.00009605293,0.00050656823,0.0002000873,0.00012780135,0.00009885859,0.00014671391,0.0007905205,0.000654032,0.00007466614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010422457,0.00004806668,0.0000026031703,0.00032467654,0.000030132222,0.00004010343,0.0005856818,0.00017756678,0.0000014570015,0.95390296,0.009486136,0.035399597],"study_design_scores_gemma":[0.00025392364,0.00006876018,0.0000011220989,0.0025100023,0.000031173917,0.0000257739,0.000011969452,0.10372017,0.00011457787,0.6758856,0.21655129,0.00082561665],"about_ca_topic_score_codex":0.0000041118274,"about_ca_topic_score_gemma":0.0000056270087,"teacher_disagreement_score":0.2780173,"about_ca_system_score_codex":0.00016224307,"about_ca_system_score_gemma":0.00022125078,"threshold_uncertainty_score":0.9997386},"labels":[],"label_agreement":null},{"id":"W4412819496","doi":"10.1007/978-3-031-89033-8_23","title":"CUDA/GPU Programming III","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"CUDA; Computer science; General-purpose computing on graphics processing units; Parallel computing; Computer graphics (images); Computational science; Graphics","score_opus":0.023710946959208074,"score_gpt":0.2665041928437761,"score_spread":0.242793245884568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.823325e-7,0.00031798778,0.5192739,0.000084529325,0.00019244711,0.00041576015,0.0000017998018,0.00067328167,0.4790393],"genre_scores_gemma":[0.00008104852,0.00011547465,0.53188545,0.00015948102,0.00006162216,0.000037106107,0.000008374918,0.000040952054,0.4676105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974203,0.000026990705,0.00094619294,0.000691382,0.00047268378,0.0004424275],"domain_scores_gemma":[0.997572,0.00025666138,0.00048960303,0.0014142452,0.00017029796,0.000097192074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006114051,0.00053315907,0.00075024745,0.00056328287,0.00014185352,0.00032370532,0.0018339587,0.00047879157,0.000026756179],"category_scores_gemma":[0.00007951229,0.0005401391,0.00021547996,0.00013664985,0.00011097854,0.0001581264,0.00086219737,0.0006895521,0.00006389706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015538642,0.000053988162,0.0000017076992,0.0002970402,0.00003436297,0.00004187899,0.00082113926,0.00019268945,0.0000015939852,0.95430696,0.010158968,0.0340881],"study_design_scores_gemma":[0.00038560812,0.00007441452,7.704238e-7,0.002751991,0.000037408674,0.000030088366,0.000016091413,0.12743402,0.00013546682,0.6234253,0.24478358,0.0009252761],"about_ca_topic_score_codex":0.0000056281406,"about_ca_topic_score_gemma":0.000006003792,"teacher_disagreement_score":0.33088169,"about_ca_system_score_codex":0.00016753422,"about_ca_system_score_gemma":0.00023100726,"threshold_uncertainty_score":0.999705},"labels":[],"label_agreement":null},{"id":"W4412819499","doi":"10.1007/978-3-031-89033-8_19","title":"OpenMP II","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.025602819586063794,"score_gpt":0.2658811527870025,"score_spread":0.24027833320093867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819499","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010236068,0.00025500276,0.42145097,0.00015063184,0.00019478824,0.00029297092,0.0000034382651,0.00043201807,0.5772191],"genre_scores_gemma":[0.000064875676,0.00013797195,0.36982128,0.00028294008,0.000045273966,0.000018493962,0.0000067703254,0.000032164313,0.6295902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978307,0.000023491746,0.000803468,0.00061084883,0.00039650046,0.00033502077],"domain_scores_gemma":[0.997707,0.00020871911,0.00038171926,0.0014811849,0.00014060568,0.00008078271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052882364,0.00046251214,0.000678078,0.0004961346,0.00017939322,0.00020585765,0.0021438564,0.00042839927,0.0000575593],"category_scores_gemma":[0.00008392802,0.0004656627,0.00017447154,0.000102411876,0.00008648309,0.00015446766,0.0015409044,0.00058629573,0.00009315465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.215725e-7,0.000039981154,7.254178e-7,0.00015290834,0.00002279108,0.000026232767,0.0005207657,0.00020420908,0.0000020316666,0.95998466,0.03362929,0.0054155057],"study_design_scores_gemma":[0.00020901265,0.000061847975,7.306779e-7,0.0015275198,0.000018902403,0.000016707729,0.000004840306,0.09528133,0.00013172349,0.7372718,0.16488852,0.0005870622],"about_ca_topic_score_codex":0.0000036286349,"about_ca_topic_score_gemma":0.0000043408395,"teacher_disagreement_score":0.22271283,"about_ca_system_score_codex":0.00014088005,"about_ca_system_score_gemma":0.00023116384,"threshold_uncertainty_score":0.9997795},"labels":[],"label_agreement":null},{"id":"W4412819505","doi":"10.1007/978-3-031-89033-8_10","title":"Laptops, Desktops, and Workstations","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Workstation; Computer science; Operating system; Computer graphics (images)","score_opus":0.02102706023238847,"score_gpt":0.2585058145917319,"score_spread":0.2374787543593434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002383921,0.0005571183,0.54958373,0.00014739811,0.00009916351,0.00023670666,0.00000455032,0.0003122702,0.4490567],"genre_scores_gemma":[0.0001623066,0.00045865515,0.5650214,0.00020773956,0.00003123669,0.000021225555,0.000009641973,0.000028269023,0.4340595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983738,0.000023597611,0.00060709193,0.0004883802,0.0002553381,0.00025176353],"domain_scores_gemma":[0.9983113,0.00037357365,0.00027744376,0.00084321847,0.00011755223,0.00007692545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000373935,0.00035181912,0.0004797332,0.0004177046,0.00012437705,0.00024061977,0.00080405665,0.00032364688,0.00001798685],"category_scores_gemma":[0.00008786363,0.00036276726,0.00008477147,0.00009639868,0.000107478954,0.00013565895,0.0005034725,0.00045678145,0.000021348902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3375656e-7,0.000022277774,0.0000048196403,0.00016031257,0.000019572657,0.000014342617,0.0005727708,0.00015171901,9.974216e-7,0.9806027,0.008162295,0.010287505],"study_design_scores_gemma":[0.00018658946,0.00002726388,0.0000061315786,0.0013234179,0.000022950113,0.00001698253,0.000012334312,0.09585357,0.000030552615,0.8654133,0.036651284,0.00045561805],"about_ca_topic_score_codex":0.0000037416482,"about_ca_topic_score_gemma":0.000009342428,"teacher_disagreement_score":0.11518934,"about_ca_system_score_codex":0.00008216241,"about_ca_system_score_gemma":0.00014733523,"threshold_uncertainty_score":0.9998824},"labels":[],"label_agreement":null},{"id":"W4412819509","doi":"10.1007/978-3-031-89033-8_35","title":"The Trilinos Ecosystem","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Environmental science; Ecosystem; Ecology; Biology","score_opus":0.020446903744270713,"score_gpt":0.2520784084380105,"score_spread":0.23163150469373978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819509","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011026074,0.000626061,0.4117823,0.00019061279,0.00036745702,0.00044538165,0.000004899031,0.00042832704,0.58615386],"genre_scores_gemma":[0.00020972727,0.0005266255,0.15941867,0.00016770791,0.00010178718,0.000047234713,0.0000049726623,0.000045355628,0.8394779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770284,0.00004974206,0.0009740355,0.0005040997,0.0004214076,0.00034785765],"domain_scores_gemma":[0.9966959,0.0008982762,0.00050414546,0.001673705,0.0001617826,0.000066236884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009971404,0.00041876093,0.0005794754,0.00027801562,0.000259897,0.0003762082,0.0023609598,0.0003695607,0.00000927345],"category_scores_gemma":[0.00013835439,0.00032078987,0.00020899548,0.0000930496,0.00007408753,0.000090672416,0.00067962654,0.00057874527,0.00009008398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001462202,0.000016784059,6.5923194e-7,0.00016540149,0.00002825584,0.000014721284,0.0002528106,0.00017831878,5.883719e-7,0.97207445,0.019627675,0.007638902],"study_design_scores_gemma":[0.00017970355,0.000034530614,4.8530677e-7,0.0012594503,0.00001819976,0.000016766393,0.000010301001,0.19767629,0.00007549379,0.5423831,0.25793496,0.00041075805],"about_ca_topic_score_codex":0.0000015980485,"about_ca_topic_score_gemma":0.000017659808,"teacher_disagreement_score":0.42969137,"about_ca_system_score_codex":0.00016355462,"about_ca_system_score_gemma":0.0002452073,"threshold_uncertainty_score":0.9999244},"labels":[],"label_agreement":null},{"id":"W4412819511","doi":"10.1007/978-3-031-89033-8_6","title":"Advanced C++","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.018814626627587733,"score_gpt":0.2621776508075659,"score_spread":0.24336302417997815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819511","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.817506e-7,0.00031191684,0.45590842,0.000086298896,0.00018047012,0.00024576427,0.0000027089104,0.00046738324,0.54279625],"genre_scores_gemma":[0.00005223185,0.00018001928,0.45900565,0.0002040253,0.00003138572,0.000018343302,0.0000058899145,0.000029948933,0.5404725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980164,0.000019352501,0.00072850636,0.0005695769,0.0003539766,0.0003121994],"domain_scores_gemma":[0.9978369,0.00025163757,0.00036796916,0.001339639,0.00013284359,0.00007101952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036293743,0.0004294853,0.0006176908,0.00045714492,0.00008638007,0.00014982575,0.0015989974,0.00036765414,0.000030475472],"category_scores_gemma":[0.000086638735,0.00043955038,0.00016215668,0.000094192976,0.00007399781,0.00014257169,0.0006424659,0.0005267596,0.00008309697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012289355,0.00002832445,7.0302855e-7,0.0001825927,0.000017898492,0.000024996722,0.00029754618,0.00047260916,0.0000035087064,0.9732333,0.010515701,0.015221615],"study_design_scores_gemma":[0.00023603637,0.00004286128,8.6439337e-7,0.0015703725,0.00001461827,0.000011925881,0.000005161151,0.08881123,0.00016387618,0.8007116,0.10787509,0.0005564086],"about_ca_topic_score_codex":0.0000013771283,"about_ca_topic_score_gemma":0.0000032351866,"teacher_disagreement_score":0.17252173,"about_ca_system_score_codex":0.00013891165,"about_ca_system_score_gemma":0.00018147362,"threshold_uncertainty_score":0.9998056},"labels":[],"label_agreement":null},{"id":"W4412819519","doi":"10.1007/978-3-031-89033-8_22","title":"CUDA/GPU Programming II","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"CUDA; Computer science; General-purpose computing on graphics processing units; Parallel computing; Computer graphics (images); Computational science; Graphics","score_opus":0.02406387339961501,"score_gpt":0.26572427844390506,"score_spread":0.24166040504429004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015385965,0.00034650168,0.4994376,0.00012650907,0.00020203568,0.00042003722,0.0000023328373,0.00072100793,0.49874243],"genre_scores_gemma":[0.00006637983,0.00010296859,0.52677935,0.00015309191,0.000057329384,0.000033410342,0.000007780841,0.000038576254,0.4727611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974838,0.000025835712,0.00090120995,0.00068300817,0.00046916923,0.00043696054],"domain_scores_gemma":[0.9976582,0.00021119561,0.00046710373,0.0014003386,0.0001688363,0.00009434991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059621804,0.0005266577,0.0007109561,0.0005546064,0.00022129968,0.0002629413,0.0018283019,0.00047140985,0.000026139991],"category_scores_gemma":[0.00009900908,0.00053375843,0.00021175432,0.00013536264,0.00010786709,0.00015830656,0.0012554901,0.00067845004,0.000051586503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011722449,0.00006665797,0.0000017053368,0.00029362703,0.000032083288,0.000034613684,0.0009952575,0.00018314709,0.0000017470718,0.9495261,0.010739482,0.038124435],"study_design_scores_gemma":[0.0002485214,0.00009993975,6.58989e-7,0.002341044,0.0000307723,0.000025157982,0.000011377055,0.0976636,0.00011901926,0.59129095,0.30738005,0.0007889141],"about_ca_topic_score_codex":0.0000038312214,"about_ca_topic_score_gemma":0.0000049307596,"teacher_disagreement_score":0.35823512,"about_ca_system_score_codex":0.0001636874,"about_ca_system_score_gemma":0.00022681108,"threshold_uncertainty_score":0.9997114},"labels":[],"label_agreement":null},{"id":"W4412819545","doi":"10.1007/978-3-031-89033-8_11","title":"Accelerators and Cluster Architectures","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Cluster (spacecraft); Computer science; Operating system","score_opus":0.0187380285842179,"score_gpt":0.2553561074471128,"score_spread":0.23661807886289488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819545","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024845767,0.0004849786,0.45297182,0.00018648196,0.00013999814,0.00035156458,0.0000036222127,0.00037753853,0.54545915],"genre_scores_gemma":[0.00084595504,0.000208669,0.5378299,0.00079105725,0.000080089216,0.000026011152,0.000005512124,0.00005379661,0.46015903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983198,0.000029003224,0.0005772138,0.0005312786,0.00027561677,0.0002670767],"domain_scores_gemma":[0.998417,0.00032300642,0.00025699887,0.00085112505,0.000074898184,0.000076964956],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036905357,0.0004114447,0.0005362438,0.0004992479,0.00009808461,0.0002544332,0.000965982,0.0003439202,0.000014819304],"category_scores_gemma":[0.00006794228,0.0003832767,0.000098905424,0.00006577426,0.00011048854,0.00006468571,0.00079935504,0.0005345087,0.00001358102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030085032,0.000030922165,0.000009381407,0.00042378946,0.000041722855,0.000024266486,0.0013301522,0.0005601305,0.0000029300215,0.9670036,0.01289209,0.01767803],"study_design_scores_gemma":[0.00027167317,0.000048019665,0.000006305684,0.0012345867,0.000021426273,0.0000308403,0.0000059370036,0.112149745,0.00013678405,0.8540449,0.031446945,0.0006028021],"about_ca_topic_score_codex":0.0000025703457,"about_ca_topic_score_gemma":0.0000063515677,"teacher_disagreement_score":0.11295864,"about_ca_system_score_codex":0.000060984283,"about_ca_system_score_gemma":0.00010750283,"threshold_uncertainty_score":0.9998619},"labels":[],"label_agreement":null},{"id":"W4412819574","doi":"10.1007/978-3-031-89033-8_20","title":"OpenMP III","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Materials science; Computer science","score_opus":0.02521516603688049,"score_gpt":0.2668016717263623,"score_spread":0.24158650568948184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819574","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.434501e-7,0.00023860476,0.45618105,0.00009837973,0.00018376949,0.00028991696,0.000002606094,0.0004015141,0.5426035],"genre_scores_gemma":[0.00007933023,0.00016029633,0.35686883,0.00029309245,0.000048515813,0.000020549218,0.0000072253324,0.000034042143,0.6424881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977708,0.000024637267,0.00084478664,0.0006180437,0.00040263883,0.00033910587],"domain_scores_gemma":[0.9976215,0.0002566892,0.00040101766,0.0014950673,0.00014243682,0.00008333552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005460886,0.00046790458,0.00071593013,0.000502216,0.0001118277,0.00025863212,0.0021459577,0.00043321936,0.000058879064],"category_scores_gemma":[0.000066998284,0.0004712281,0.00017754297,0.00010330462,0.0000890361,0.0001553631,0.0010329877,0.0005942368,0.00011676378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012392468,0.000031925596,7.0603966e-7,0.00015307861,0.000024460247,0.000032058295,0.00047022972,0.00021475024,0.0000017476888,0.9639851,0.029644797,0.005439913],"study_design_scores_gemma":[0.00031194926,0.000042473497,7.752503e-7,0.0016866827,0.000021817432,0.000018954106,0.000007006266,0.11834553,0.00013731174,0.7542137,0.12456213,0.00065168703],"about_ca_topic_score_codex":0.0000054568827,"about_ca_topic_score_gemma":0.000005349314,"teacher_disagreement_score":0.20977141,"about_ca_system_score_codex":0.00014430638,"about_ca_system_score_gemma":0.00023543015,"threshold_uncertainty_score":0.9997739},"labels":[],"label_agreement":null},{"id":"W4412960910","doi":"10.1145/3749986","title":"HLSRewriter: Efficient Refactoring and Optimization of C/C++ Code with LLMs for High-Level Synthesis","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"International Graduate School of Science and Engineering; Deutsche Forschungsgemeinschaft","keywords":"Code refactoring; Computer science; High-level synthesis; Pipeline (software); Code generation; Code (set theory); Process (computing); Programming language; Parallel computing; Embedded system; Software; Operating system; Field-programmable gate array","score_opus":0.02432252241982122,"score_gpt":0.25692611228392254,"score_spread":0.23260358986410132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412960910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010386987,0.00014613832,0.9975606,0.00015590894,0.00009641976,0.0006950484,0.000010053333,0.0002645684,0.00003252635],"genre_scores_gemma":[0.6193499,0.000029345054,0.38041255,0.000006374649,0.0000033449533,0.00012009566,0.0000016107847,0.0000070962615,0.000069709204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987423,0.00013673933,0.0004327084,0.00028729747,0.00020039573,0.00020060332],"domain_scores_gemma":[0.99822974,0.00073468423,0.00027321777,0.00047475658,0.00026040064,0.000027191105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005391934,0.00014251543,0.0002745542,0.0004103523,0.00013582071,0.000053546864,0.0003793801,0.00008421422,0.0000017782716],"category_scores_gemma":[0.000072059374,0.00013004438,0.000041694813,0.0005307787,0.000034990724,0.00014688521,0.0000072938114,0.000074105476,2.8039818e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004071199,0.00007351933,0.0000034033735,0.00012197158,0.00006465866,8.402359e-8,0.0000989522,0.98468894,0.0005326986,0.008727815,0.00003367547,0.005613563],"study_design_scores_gemma":[0.0003944415,0.00031029148,0.0000327186,0.0003315043,0.00003739953,0.000004721162,0.000020093603,0.94156075,0.056932576,0.00024343752,0.000020770012,0.00011128635],"about_ca_topic_score_codex":0.000026747344,"about_ca_topic_score_gemma":0.0000015620277,"teacher_disagreement_score":0.61831117,"about_ca_system_score_codex":0.00011677922,"about_ca_system_score_gemma":0.00015834444,"threshold_uncertainty_score":0.53030556},"labels":[],"label_agreement":null},{"id":"W4412987079","doi":"10.1109/ispass64960.2025.00018","title":"ConCCL: Optimizing ML Concurrent Computation and Communication with GPU DMA Engines","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Computation; Computational science; Algorithm","score_opus":0.012490285193232253,"score_gpt":0.27286113705506226,"score_spread":0.26037085186183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412987079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012855792,0.0007781394,0.9878812,0.001281798,0.00005901834,0.0001505817,2.7814974e-7,0.00066618365,0.007897219],"genre_scores_gemma":[0.45915148,0.00012638175,0.5402767,0.00024650648,0.0000039609254,0.000008373317,0.0000047862445,0.0000029872663,0.0001788323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993254,0.00006969563,0.00016961376,0.00022297293,0.000095318916,0.00011701468],"domain_scores_gemma":[0.9993408,0.00014391397,0.000068884416,0.00026783746,0.00014351355,0.000035053912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018051846,0.00010385178,0.00012435844,0.000121844714,0.00017007132,0.00020102615,0.00032251645,0.000037149446,0.0000017824239],"category_scores_gemma":[0.000013189879,0.00008721329,0.000015119379,0.00031100548,0.000058769085,0.00024888202,0.00020661653,0.000087709974,0.0000016472287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010214342,0.00009409488,0.0014340682,0.00006321347,0.000059081332,0.0000024430612,0.0011884688,0.09277848,0.000079480225,0.57205176,0.0075227087,0.32471597],"study_design_scores_gemma":[0.00035907584,0.000045616835,0.0005491975,0.00008761753,0.0000055813152,0.0000057684742,0.000034523513,0.99486065,0.0010970545,0.0013079057,0.001519585,0.00012741548],"about_ca_topic_score_codex":0.000022433385,"about_ca_topic_score_gemma":0.0000038411144,"teacher_disagreement_score":0.90208215,"about_ca_system_score_codex":0.000021048007,"about_ca_system_score_gemma":0.000041843574,"threshold_uncertainty_score":0.35564548},"labels":[],"label_agreement":null},{"id":"W4413014932","doi":"10.1145/3676642.3736119","title":"HybridTier: an Adaptive and Lightweight CXL-Memory Tiering System","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; VMware","keywords":"Computer science; Embedded system; Operating system","score_opus":0.00997036059076892,"score_gpt":0.23475334514550425,"score_spread":0.22478298455473533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413014932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002985412,0.00020918211,0.9273083,0.0001712615,0.00018113329,0.000104528655,2.9897598e-7,0.0013081084,0.067731775],"genre_scores_gemma":[0.6845214,0.000014193283,0.31292757,0.00018177388,0.00002120076,0.000008190864,5.214013e-7,0.0000042646616,0.002320898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991862,0.000058633213,0.00016241813,0.00033713362,0.00009646139,0.00015912442],"domain_scores_gemma":[0.9994157,0.00003733148,0.000040822444,0.00037593543,0.000064931315,0.000065308785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020426356,0.000106430845,0.00013361394,0.00015382965,0.00016268401,0.00016313074,0.00042874788,0.000042451113,0.000001918685],"category_scores_gemma":[0.0000068698523,0.00009378115,0.000023047338,0.0002606864,0.000025873547,0.00033170445,0.00026225016,0.00007478517,0.000005716097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011603576,0.000051282248,0.00021416934,0.00008383239,0.000036089798,0.000021982423,0.00047708474,0.002289493,0.00019371147,0.929041,0.00550496,0.062074743],"study_design_scores_gemma":[0.00014493758,0.00007621918,0.00033465266,0.00008769896,0.0000040657364,0.000014675158,0.00007190603,0.989963,0.0066684526,0.001215097,0.0012601332,0.00015916227],"about_ca_topic_score_codex":0.000027477014,"about_ca_topic_score_gemma":0.0000014398172,"teacher_disagreement_score":0.9876735,"about_ca_system_score_codex":0.000038751903,"about_ca_system_score_gemma":0.000042753443,"threshold_uncertainty_score":0.38242844},"labels":[],"label_agreement":null},{"id":"W4413068300","doi":"10.1007/978-3-031-84560-4_3","title":"Repetition","year":2025,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Materials science","score_opus":0.01607379610051244,"score_gpt":0.26361629800215347,"score_spread":0.24754250190164104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413068300","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018684036,0.0001334612,0.7053147,0.00034782654,0.0007661076,0.00016702243,0.0000011814888,0.0005420025,0.29272583],"genre_scores_gemma":[0.0019560254,0.00014562672,0.8582795,0.0010975037,0.00017894518,0.000009491291,0.0000047103667,0.000016425229,0.13831173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972041,0.000024904215,0.000486984,0.001219278,0.0006568462,0.0004078625],"domain_scores_gemma":[0.9978659,0.000111916735,0.00022570325,0.0014453883,0.0002502487,0.0001008371],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009660567,0.00031844454,0.00034399208,0.001212849,0.00021916827,0.000439714,0.003440535,0.00019549495,0.000020783053],"category_scores_gemma":[0.00003161482,0.00033274374,0.00009062833,0.0005843361,0.00034180967,0.00055678445,0.0017307021,0.00043091428,0.00007358807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001064894,0.000017578783,0.000005388614,0.000019519795,0.000003132878,0.000032603475,0.00009228537,0.0027332942,0.0000033623362,0.7311352,0.006832259,0.25912434],"study_design_scores_gemma":[0.0001914307,0.00009554509,0.00008160488,0.0008473659,0.0000038088274,0.000030432293,1.5452329e-7,0.746327,0.00019095717,0.19938816,0.052200735,0.00064281677],"about_ca_topic_score_codex":0.0000073069014,"about_ca_topic_score_gemma":0.000003882614,"teacher_disagreement_score":0.7435937,"about_ca_system_score_codex":0.00025387626,"about_ca_system_score_gemma":0.0006040637,"threshold_uncertainty_score":0.99991244},"labels":[],"label_agreement":null},{"id":"W4413275926","doi":"10.1016/j.jpdc.2025.105170","title":"A scheduler to foster data locality for GPU and out-of-core task-based linear algebra applications","year":2025,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Hôpital Notre-Dame","funders":"Conseil National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Computer science; Locality; Parallel computing; Linear algebra; Task (project management); Core (optical fiber); Mathematics","score_opus":0.051742038856388915,"score_gpt":0.3392052337675418,"score_spread":0.2874631949111529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413275926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043623853,0.00041787483,0.9924429,0.0022343942,0.00010344752,0.0002962353,0.000055144723,0.000055334287,0.00003229649],"genre_scores_gemma":[0.4609942,0.000010611775,0.5383369,0.0005507372,0.000058369696,0.0000040543996,0.000034282086,0.000004186242,0.000006652419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986592,0.00005047335,0.00062058883,0.00031380873,0.00015733269,0.00019858556],"domain_scores_gemma":[0.9982719,0.0003309677,0.0003902839,0.0004663135,0.00041135697,0.00012918387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078677444,0.00014236209,0.00033509897,0.00015957447,0.00017785215,0.00010849936,0.0008155884,0.000072392424,5.3682373e-7],"category_scores_gemma":[0.00017685835,0.00012532505,0.00006130814,0.00035860031,0.000056973044,0.00016863685,0.0005826362,0.00015029637,4.4886215e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006968416,0.0014475819,0.025800388,0.0014302635,0.0007268631,0.000025655248,0.0013986655,0.48780325,0.0013735763,0.08292246,0.06628309,0.33009136],"study_design_scores_gemma":[0.0009265158,0.0001425023,0.0013023291,0.00018997674,0.000036288122,0.000008916893,0.000031907646,0.98292476,0.0002021171,0.004605932,0.009473001,0.00015575215],"about_ca_topic_score_codex":0.0000026078162,"about_ca_topic_score_gemma":0.000001022371,"teacher_disagreement_score":0.4951215,"about_ca_system_score_codex":0.000020989404,"about_ca_system_score_gemma":0.0001477502,"threshold_uncertainty_score":0.5110607},"labels":[],"label_agreement":null},{"id":"W4413278069","doi":"10.1109/icfpt64416.2024.11113454","title":"TableCache: An Open-Source, Configurable, Last-Level Cache for FPGA Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Open source; Cache; Field-programmable gate array; Embedded system; Operating system; Computer architecture; Software","score_opus":0.06204639759207236,"score_gpt":0.3128189126801895,"score_spread":0.25077251508811715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413278069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086473556,0.00051379733,0.9665536,0.00041322512,0.0005668724,0.0006228049,0.0000106277,0.0022374725,0.02899512],"genre_scores_gemma":[0.39779362,0.000029672892,0.54788005,0.00069917593,0.00022154843,0.00026880705,0.000041045165,0.000054080283,0.053012002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984983,0.000086048865,0.00029484913,0.0005934201,0.00018773829,0.00033959938],"domain_scores_gemma":[0.9988705,0.00018116088,0.000052879317,0.00059735944,0.0001651096,0.00013300762],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008275183,0.00017704729,0.00022135777,0.00014776658,0.00020741868,0.002512805,0.0018061791,0.0001014145,0.00001923583],"category_scores_gemma":[0.00003093997,0.00014915284,0.000046064637,0.00048470005,0.000024423329,0.0009385538,0.00033576757,0.0001250019,0.000042952997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001113435,0.00015624668,0.000036704183,0.00021279365,0.00008122891,0.000013661037,0.0007231795,0.057081178,0.0006068933,0.56578565,0.3038936,0.07139773],"study_design_scores_gemma":[0.0001551238,0.00011820573,0.0000113497135,0.0000589766,0.0000052931127,0.000023058343,0.000024358449,0.8138687,0.0016849722,0.0010645491,0.18277608,0.00020932301],"about_ca_topic_score_codex":0.00027238522,"about_ca_topic_score_gemma":0.000014358208,"teacher_disagreement_score":0.75678754,"about_ca_system_score_codex":0.000046610556,"about_ca_system_score_gemma":0.00017079583,"threshold_uncertainty_score":0.9985227},"labels":[],"label_agreement":null},{"id":"W4413278563","doi":"10.1109/icfpt64416.2024.11113396","title":"HEPPO: Hardware-Efficient Proximal Policy Optimization a Universal Pipelined Architecture for Generalized Advantage Estimation","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Architecture; Computer architecture; Parallel computing; Hardware architecture; Computer hardware; Estimation; Embedded system; Operating system; Software; Engineering","score_opus":0.010821885033687927,"score_gpt":0.28228480929876737,"score_spread":0.27146292426507945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413278563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014259749,0.0000921733,0.9919119,0.0032311992,0.00019643865,0.0006300894,0.0000105622585,0.0025133784,0.0012716666],"genre_scores_gemma":[0.051659193,0.000012566216,0.9465932,0.0003976511,0.00013691784,0.00005023241,0.00007231569,0.000021764037,0.0010561146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.000060562394,0.00026260037,0.00048750342,0.00021445098,0.00028520307],"domain_scores_gemma":[0.9993112,0.00008351475,0.00006073302,0.00032187198,0.00013595325,0.00008673417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025107566,0.00018706279,0.00015758364,0.000449541,0.00016232146,0.00039219277,0.00045234512,0.00008267279,0.00001432703],"category_scores_gemma":[0.000081654565,0.00016310716,0.00010914528,0.0007490865,0.000028693723,0.0002558775,0.00013985827,0.00010169032,0.000008325547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012503342,0.000027829503,9.66684e-7,0.000040661107,0.000009371325,0.000003081689,0.00028721322,0.8669465,0.000096557,0.11433506,0.0023505331,0.015889678],"study_design_scores_gemma":[0.0003357682,0.000087014065,0.0000017114938,0.0000350719,0.000010203343,0.000014075315,0.000006914471,0.991167,0.0011877734,0.003435598,0.0035148193,0.00020404448],"about_ca_topic_score_codex":0.000025932204,"about_ca_topic_score_gemma":0.0000013692129,"teacher_disagreement_score":0.12422046,"about_ca_system_score_codex":0.000119545024,"about_ca_system_score_gemma":0.00027176572,"threshold_uncertainty_score":0.6651317},"labels":[],"label_agreement":null},{"id":"W4413437607","doi":"10.1007/978-3-031-99857-7_3","title":"ARM SVE Unleashed: Performance and Insights Across HPC Applications on Nvidia Grace","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Supercomputer; Computational science; Computer architecture; Operating system","score_opus":0.012286322679524458,"score_gpt":0.2610294713338044,"score_spread":0.24874314865427993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413437607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002308183,0.00052943925,0.9885014,0.00051899307,0.00048122907,0.0005563048,0.0000046846767,0.00045859796,0.008718523],"genre_scores_gemma":[0.2606265,0.00079770584,0.7324275,0.0034889295,0.00027506452,0.00007732058,0.000012968651,0.000040600502,0.0022534472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670225,0.000034372366,0.00046287646,0.0016159704,0.0006336191,0.00055092585],"domain_scores_gemma":[0.9974362,0.00045410104,0.00026180077,0.0014357347,0.00025486964,0.00015728013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050549384,0.0005123464,0.0004589441,0.0006591304,0.0006486124,0.0006349499,0.0026143496,0.00032088792,0.0000031633379],"category_scores_gemma":[0.0000460882,0.00047280462,0.00007979332,0.0008504329,0.00060451246,0.0004250978,0.0014859827,0.000799017,0.00002377883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060907523,0.00006381597,0.00010124717,0.00009023464,0.000012170464,0.000013221891,0.0013422958,0.07807371,0.000013203352,0.07021279,0.00018060576,0.8498906],"study_design_scores_gemma":[0.00025260367,0.00024023805,0.000262773,0.00063215103,0.0000066048838,0.00002857658,3.3590587e-7,0.8962903,0.0013351159,0.08845864,0.011698028,0.0007946169],"about_ca_topic_score_codex":0.0000075896355,"about_ca_topic_score_gemma":0.000013152874,"teacher_disagreement_score":0.849096,"about_ca_system_score_codex":0.00019662542,"about_ca_system_score_gemma":0.00033739174,"threshold_uncertainty_score":0.99977237},"labels":[],"label_agreement":null},{"id":"W4413600660","doi":"10.1007/978-3-031-84869-8_43","title":"pythOS: An Operator-Splitting Library in Python","year":2025,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Python (programming language); Computer science; Programming language; World Wide Web","score_opus":0.01572908913747085,"score_gpt":0.2583223885826967,"score_spread":0.24259329944522584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413600660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006344994,0.00023871099,0.66165817,0.000100271405,0.00020055396,0.0005922398,0.00003306901,0.00085179525,0.33626178],"genre_scores_gemma":[0.00038546024,0.0004214765,0.93949056,0.00018290893,0.00008775783,0.000035323625,0.000022491766,0.00010490081,0.05926911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693215,0.000015371175,0.0012069441,0.00088024914,0.0004726693,0.000492639],"domain_scores_gemma":[0.9983625,0.00023875297,0.00052751764,0.0005451679,0.00020252133,0.00012355598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007824375,0.00056540524,0.0007576362,0.00089448,0.00010314194,0.0006784618,0.0016515821,0.0004225605,0.000028030323],"category_scores_gemma":[0.00025318394,0.0006227605,0.0000653968,0.00026887542,0.000076756005,0.00072614296,0.00096223515,0.0009177412,0.000020466397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027831622,0.00008211233,0.00011856587,0.00076403975,0.0000128869115,0.000050799146,0.0017264907,0.00011016083,0.0000074736,0.9862909,0.0024770575,0.008356784],"study_design_scores_gemma":[0.00030251718,0.00009090633,0.000047787853,0.0029955688,0.000019917858,0.000011801686,0.00005608036,0.29785323,0.0001972914,0.68399906,0.0134977605,0.00092806044],"about_ca_topic_score_codex":0.0000063514617,"about_ca_topic_score_gemma":0.0000050018793,"teacher_disagreement_score":0.30229178,"about_ca_system_score_codex":0.00015008016,"about_ca_system_score_gemma":0.00025703188,"threshold_uncertainty_score":0.99962234},"labels":[],"label_agreement":null},{"id":"W4413756604","doi":"10.1145/3718958.3750484","title":"ParserHawk: Hardware-aware parser generator using program synthesis","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Computer science; Generator (circuit theory); Parsing; Programming language; LR parser; Computer hardware; Parser combinator; Physics","score_opus":0.028636530613600577,"score_gpt":0.300860181233262,"score_spread":0.2722236506196615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413756604","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024094526,0.00009266005,0.9862657,0.00049883785,0.00023412534,0.00024865623,9.316357e-7,0.0022333749,0.008016226],"genre_scores_gemma":[0.22242452,0.000016301974,0.7753259,0.0007727387,0.000035991794,0.0000675072,0.0000012952287,0.0000087380895,0.0013469895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988008,0.00008380987,0.0002481096,0.000416845,0.00016186762,0.00028853255],"domain_scores_gemma":[0.9990614,0.000074550204,0.000061932275,0.00059259485,0.00014254445,0.00006694762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021668736,0.00015771214,0.00018414,0.00016811313,0.00021387477,0.000314437,0.0007782807,0.000085161424,0.00002700739],"category_scores_gemma":[0.000054566623,0.00014009284,0.000079891506,0.0006600408,0.00003102249,0.00025120765,0.00031464946,0.00008952412,0.00001578331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014357231,0.0007715256,0.0065933727,0.000119521625,0.00020776843,0.00004639793,0.00026613942,0.044436816,0.0010428189,0.15978502,0.09669324,0.690023],"study_design_scores_gemma":[0.00007940575,0.000019008065,0.00016298743,0.000054409495,0.000009968845,0.0000036848708,0.000008147219,0.9582305,0.02372726,0.0008424388,0.016657654,0.00020456544],"about_ca_topic_score_codex":0.000035077224,"about_ca_topic_score_gemma":0.0000031192499,"teacher_disagreement_score":0.9137936,"about_ca_system_score_codex":0.000048526454,"about_ca_system_score_gemma":0.00014602162,"threshold_uncertainty_score":0.571282},"labels":[],"label_agreement":null},{"id":"W4413886689","doi":"10.1109/eurospw67616.2025.00055","title":"Enclave Application Cache for RISC-V Keystone","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cache; Operating system; Embedded system","score_opus":0.009594980762279597,"score_gpt":0.290932943718494,"score_spread":0.2813379629562144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413886689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000518162,0.00006599541,0.96216565,0.0016081395,0.00007157018,0.00025417615,3.6870424e-7,0.00065950764,0.03512277],"genre_scores_gemma":[0.1538854,0.00001144832,0.83762133,0.0009768556,0.000021323978,0.000119674,0.0000041111234,0.0000029379341,0.007356919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994768,0.000015576637,0.00012458237,0.00021727283,0.000057441837,0.00010832325],"domain_scores_gemma":[0.9994517,0.00007298104,0.00003582967,0.0003319394,0.00008677257,0.000020755777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001849102,0.000057833342,0.00007187418,0.00008198435,0.00010041332,0.000058596954,0.00044673274,0.000041356983,0.000002293694],"category_scores_gemma":[0.000026789829,0.000052306237,0.000034341265,0.00027022904,0.000012144095,0.00008887754,0.00009972426,0.000035591223,0.000014348987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025346735,0.000040591498,0.0001232147,0.000013969529,0.00000940513,1.1225031e-7,0.000071062736,0.002163871,0.00038613053,0.8525271,0.045067675,0.09959435],"study_design_scores_gemma":[0.0001466519,0.000019435542,0.0001604697,0.000006265483,0.0000025855152,3.840575e-7,0.0000037816076,0.8813759,0.014530254,0.036171697,0.06749906,0.00008348478],"about_ca_topic_score_codex":0.000019415345,"about_ca_topic_score_gemma":0.0000024134285,"teacher_disagreement_score":0.8792121,"about_ca_system_score_codex":0.000022864895,"about_ca_system_score_gemma":0.000038800074,"threshold_uncertainty_score":0.21329863},"labels":[],"label_agreement":null},{"id":"W4414405631","doi":"10.1109/clusterworkshops65972.2025.11164211","title":"A similarity-aware MOE-based method for optimizing tensor programs across diverse GPUs","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Youth Innovation Promotion Association; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Representation (politics); Compiler; Tensor (intrinsic definition); Multi-core processor; Artificial neural network; Core (optical fiber)","score_opus":0.03564461568228783,"score_gpt":0.35592847574280173,"score_spread":0.3202838600605139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414405631","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116913776,0.00003064009,0.9940951,0.0017918431,0.00019698012,0.00064504717,0.000005325322,0.0017930509,0.0013250984],"genre_scores_gemma":[0.017341413,0.0000030476237,0.9789753,0.0020231737,0.000022063823,0.00013398424,0.000011582524,0.000009849005,0.0014795663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984816,0.0000912478,0.00027148178,0.0005494591,0.00016558327,0.00044063412],"domain_scores_gemma":[0.99867994,0.0002736941,0.0000891073,0.0005725135,0.00030678432,0.00007797024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006767142,0.0001892182,0.00024396538,0.00012230893,0.00042226465,0.00040768797,0.00095055933,0.00011990263,0.0000041009275],"category_scores_gemma":[0.00009319644,0.00016993108,0.00016073366,0.00062467775,0.000039729577,0.00021531036,0.00036901966,0.00013067691,0.0000032693576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010036393,0.0006937364,0.001746073,0.00028683592,0.00013924869,0.00002023312,0.0011306782,0.2562786,0.00020169343,0.061161533,0.024186714,0.6540543],"study_design_scores_gemma":[0.0006449761,0.00009022081,0.000039405782,0.000051208757,0.000009187333,0.0000014003803,0.00006341337,0.9847175,0.0056897495,0.0019067548,0.006576966,0.00020920775],"about_ca_topic_score_codex":0.00005811888,"about_ca_topic_score_gemma":0.000010586817,"teacher_disagreement_score":0.7284389,"about_ca_system_score_codex":0.000055885957,"about_ca_system_score_gemma":0.00011491961,"threshold_uncertainty_score":0.69295883},"labels":[],"label_agreement":null},{"id":"W4414492320","doi":"10.22323/1.501.1088","title":"Status update of various simulation components for P-ONE.","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; UK Research and Innovation; Deutsche Forschungsgemeinschaft; Canada First Research Excellence Fund; National Science Foundation","keywords":"Neutrino; Telescope; Cherenkov radiation; Cascade; Neutrino detector; Neutrino oscillation","score_opus":0.02898489331092837,"score_gpt":0.3082841712353055,"score_spread":0.27929927792437714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414492320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013822367,0.000028830393,0.9939652,0.0002324353,0.0000957128,0.00017910663,0.0000017359458,0.0002803559,0.003834363],"genre_scores_gemma":[0.5759949,0.00000624572,0.42353165,0.00019865006,0.00000330053,0.0000041101057,0.00000514581,0.0000015500399,0.00025445063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944174,0.000021011892,0.00018405812,0.00015213802,0.00007839933,0.00012266627],"domain_scores_gemma":[0.99941725,0.0001207139,0.000064834574,0.00023658907,0.00013897846,0.00002164091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012521892,0.000053293996,0.000102258724,0.000114043614,0.00005411727,0.00003519198,0.00027524866,0.00003153905,0.0000034639008],"category_scores_gemma":[0.00003267057,0.00005261425,0.000033618064,0.00022490961,0.000012337172,0.00010818844,0.00010302563,0.00002573806,0.0000021063336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001867103,0.00014312625,0.00078070257,0.00004556105,0.000033561082,1.8131402e-7,0.00012474721,0.54838544,0.0004360166,0.41029957,0.002471883,0.037260517],"study_design_scores_gemma":[0.00023511634,0.000024232444,0.001027057,0.000014135727,0.0000029690714,5.5341825e-8,9.1160996e-7,0.97368616,0.003354932,0.017133994,0.0044677085,0.000052722502],"about_ca_topic_score_codex":0.000025567548,"about_ca_topic_score_gemma":0.0000011258772,"teacher_disagreement_score":0.5746127,"about_ca_system_score_codex":0.000016574148,"about_ca_system_score_gemma":0.000035463203,"threshold_uncertainty_score":0.2145547},"labels":[],"label_agreement":null},{"id":"W4414512981","doi":"10.3233/scc-2001-238","title":"SpaceMux <sup>TM</sup> : An on‐board mesh processor","year":2001,"lang":"en","type":"article","venue":"Space Communications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ste. Anne's Hospital","funders":"","keywords":"Integrated Services Digital Network; The Internet; Communications satellite; Interconnection; Mesh networking; Teleconference; Internet access; Satellite; Wireless mesh network","score_opus":0.0426923741119357,"score_gpt":0.31597298370921567,"score_spread":0.27328060959727996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414512981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006746157,0.00040377467,0.8835083,0.033820968,0.00006310746,0.00043436044,0.000004250303,0.0024943023,0.07252473],"genre_scores_gemma":[0.6070035,0.0006918128,0.3890868,0.00082868244,0.00004184314,0.00007458448,0.000020265017,0.000021153493,0.0022313502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985421,0.0002441797,0.00024071199,0.0003892663,0.0002562315,0.00032753337],"domain_scores_gemma":[0.99504596,0.00017970763,0.00013634963,0.004239342,0.0002316529,0.00016701464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003563127,0.00019469736,0.00018770288,0.00019981524,0.0006076455,0.00026673256,0.00386827,0.00009387745,0.000022368138],"category_scores_gemma":[0.000116368545,0.00019538104,0.00006928194,0.000875601,0.0001283001,0.0005295753,0.0008064145,0.00032956718,0.00015999377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034749282,0.0020182016,0.0045638657,0.000029052926,0.00008849663,0.000019061845,0.01170109,0.057138834,0.00019388644,0.814748,0.05865119,0.05081359],"study_design_scores_gemma":[0.0003229824,0.00021570308,0.0007960047,0.000057634985,0.000009370373,0.000023643446,0.00020550314,0.8290774,0.00035093783,0.0067233113,0.16180629,0.00041121844],"about_ca_topic_score_codex":0.00007156076,"about_ca_topic_score_gemma":0.00006113024,"teacher_disagreement_score":0.80802464,"about_ca_system_score_codex":0.00006628787,"about_ca_system_score_gemma":0.00011473505,"threshold_uncertainty_score":0.7967408},"labels":[],"label_agreement":null},{"id":"W4414978573","doi":"10.1145/3763125","title":"Sound and Modular Activity Analysis for Automatic Differentiation in MLIR","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Speedup; Correctness; Compiler; Benchmark (surveying); Modular design; Function (biology); Representation (politics); Automatic differentiation","score_opus":0.013300363735059807,"score_gpt":0.28711590772076434,"score_spread":0.2738155439857045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7937158,0.00007078153,0.20474343,0.00089284964,0.000023081142,0.00031164568,5.4254036e-7,0.00016280664,0.000079082674],"genre_scores_gemma":[0.8609968,0.0000033813849,0.13886662,0.000039841354,0.0000047973276,0.000033922515,4.824338e-7,0.0000029526504,0.000051199215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993803,0.000009852449,0.00014425577,0.0002224747,0.00011304493,0.00013010853],"domain_scores_gemma":[0.99939114,0.000106094216,0.0001456665,0.00026381662,0.00007902254,0.000014283995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031708542,0.00008687882,0.00017156282,0.00028220267,0.00008284015,0.00013549133,0.0008262534,0.000043749635,2.3802119e-7],"category_scores_gemma":[0.00061193557,0.00006440147,0.00007297627,0.0008611263,0.000028245906,0.00013844603,0.00039401153,0.00006793257,5.7721053e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044024542,0.000570705,0.29366446,0.0009785873,0.0005672944,4.2175003e-7,0.0049994052,0.0020940376,0.0070294146,0.061669443,0.00020774985,0.6281744],"study_design_scores_gemma":[0.00051061314,0.00011381731,0.20373884,0.00019763112,0.00014830333,7.642159e-7,0.000195467,0.7046915,0.047810078,0.042330414,0.000046368386,0.00021614826],"about_ca_topic_score_codex":0.000020776359,"about_ca_topic_score_gemma":0.0000045162265,"teacher_disagreement_score":0.7025975,"about_ca_system_score_codex":0.000025188123,"about_ca_system_score_gemma":0.000007910822,"threshold_uncertainty_score":0.26262158},"labels":[],"label_agreement":null},{"id":"W4415002701","doi":"10.1145/3759425.3763382","title":"Towards Repository-Level Program Verification with Large Language Models","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Benchmark (surveying); Focus (optics); Software verification; Software; Code (set theory); Formal verification; Formal methods; Functional verification","score_opus":0.01716724560965954,"score_gpt":0.28360604322900257,"score_spread":0.266438797619343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415002701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080652523,0.00005387977,0.8985479,0.00034261213,0.00005330028,0.00018659345,5.2039024e-7,0.001545283,0.09846338],"genre_scores_gemma":[0.45365793,0.0000031897025,0.5424529,0.00016062715,0.00000810882,0.000035063258,0.0000029815615,0.0000028111103,0.003676401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993016,0.000031728006,0.00012682794,0.00025986598,0.00012985073,0.00015012115],"domain_scores_gemma":[0.99934775,0.000011210286,0.00004279283,0.00046773732,0.0001004169,0.000030083025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013972822,0.00008137574,0.00008257994,0.00008348991,0.00011421528,0.0001655781,0.00045531814,0.000042752115,0.000001763763],"category_scores_gemma":[0.000006765145,0.00006301798,0.000023238896,0.0003983815,0.00001469177,0.00024694327,0.00010520085,0.000063949374,0.000002893156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012051128,0.00034467384,0.00020599084,0.000029256704,0.00003316777,0.0000120512295,0.0011230989,0.00818797,0.00029376007,0.8603028,0.0070927762,0.12236238],"study_design_scores_gemma":[0.00020545154,0.0000642831,0.0005754109,0.000026253025,0.000003615667,0.000004725871,0.000031282478,0.9800802,0.01524542,0.0018995474,0.0017452246,0.000118608565],"about_ca_topic_score_codex":0.000045595283,"about_ca_topic_score_gemma":0.000003366342,"teacher_disagreement_score":0.9718922,"about_ca_system_score_codex":0.000025487529,"about_ca_system_score_gemma":0.000087716755,"threshold_uncertainty_score":0.25697985},"labels":[],"label_agreement":null},{"id":"W4415007672","doi":"10.1145/3763149","title":"CoSSJIT: Combining Static Analysis and Speculation in JIT Compilers","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Static analysis; Compiler; Just-in-time compilation; Correctness; Dataflow; Heap (data structure); Call stack; Register allocation; Compile time; Abstract interpretation","score_opus":0.00994595358639701,"score_gpt":0.28211585247744103,"score_spread":0.27216989889104404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415007672","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9365678,0.00023728321,0.056161948,0.0034356907,0.00006615029,0.000471784,9.598901e-7,0.0003754503,0.0026829722],"genre_scores_gemma":[0.835598,0.00000898366,0.1641605,0.0001353038,0.0000035223081,0.0000108328295,8.3775404e-7,0.0000032128048,0.00007879861],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992053,0.000014480202,0.00022139512,0.000244755,0.0001633568,0.00015070153],"domain_scores_gemma":[0.999326,0.00011142377,0.00016726668,0.00028743857,0.000087269385,0.000020607946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041383694,0.000097336546,0.00019016222,0.00039633395,0.00008375311,0.000149205,0.0010010655,0.000038195714,7.4415965e-7],"category_scores_gemma":[0.00046997768,0.00007608608,0.000055633587,0.0016394227,0.00005575406,0.00013257356,0.00054333475,0.000115330666,2.6160478e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003780098,0.00029033123,0.6242587,0.00032966695,0.00035329317,0.0000024919216,0.006404163,0.0043809963,0.0015533599,0.14704303,0.00094624714,0.2143999],"study_design_scores_gemma":[0.0017319123,0.00033164746,0.51454926,0.0012829677,0.0003296497,0.0000060182433,0.0022672524,0.38660112,0.04690195,0.044429693,0.0008287279,0.0007397898],"about_ca_topic_score_codex":0.000045872366,"about_ca_topic_score_gemma":0.0000069892817,"teacher_disagreement_score":0.38222012,"about_ca_system_score_codex":0.000029155624,"about_ca_system_score_gemma":0.000012921281,"threshold_uncertainty_score":0.31027},"labels":[],"label_agreement":null},{"id":"W4415302108","doi":"10.18280/isi.300810","title":"Chain-of-Thought Augmented Fine‑Tuning of a Distilled Llama‑8B Model for SIEM Detection Query Generation","year":2025,"lang":"","type":"article","venue":"Ingénierie des systèmes d information","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Calibration; Measure (data warehouse); Term (time)","score_opus":0.021856764582826555,"score_gpt":0.25771028842204563,"score_spread":0.23585352383921906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415302108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020849029,0.00032207294,0.9749673,0.00007776399,0.00076041004,0.0012825464,0.00004390179,0.00028162383,0.0014153502],"genre_scores_gemma":[0.8490693,0.00008064757,0.15009327,0.00007874824,0.00006103832,0.00014877405,0.000115501534,0.00001386204,0.00033885558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661654,0.00016929781,0.0020726172,0.00033719742,0.00039282048,0.0004115035],"domain_scores_gemma":[0.9958091,0.00018831535,0.0016897729,0.00059430127,0.001643774,0.000074768446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012547947,0.00037209998,0.00060633087,0.0009951122,0.00053681526,0.0002988934,0.00057222415,0.0003204191,0.0000037674429],"category_scores_gemma":[0.000796022,0.0004115871,0.0002562745,0.0014142077,0.00017674673,0.0025138415,0.0002448397,0.00017892766,0.0000018718949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001699767,0.00009409505,0.00007387184,0.0017135713,0.00012399952,2.0315396e-7,0.007404895,0.61139137,0.0044048945,0.021148028,0.0005142241,0.35296085],"study_design_scores_gemma":[0.0009035262,0.00022872428,0.00008691002,0.00078543066,0.000062421495,0.000003619201,0.000113816284,0.9369152,0.05736366,0.0029696943,0.00026676216,0.00030020316],"about_ca_topic_score_codex":0.00006156115,"about_ca_topic_score_gemma":0.000025599742,"teacher_disagreement_score":0.82822025,"about_ca_system_score_codex":0.0004091849,"about_ca_system_score_gemma":0.00047920694,"threshold_uncertainty_score":0.9998336},"labels":[],"label_agreement":null},{"id":"W4415308586","doi":"10.1145/3725843.3756110","title":"A TRRIP Down Memory Lane: Temperature-Based Re-Reference Interval Prediction For Instruction Caching","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Cache; Dead code; Unreachable code; Code (set theory); Central processing unit; CPU cache; Software; Redundant code; Compiler","score_opus":0.015562422790286043,"score_gpt":0.2673065165744125,"score_spread":0.2517440937841265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415308586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005876374,0.000028590168,0.9811173,0.0008518289,0.0005570941,0.00028220215,0.0000048556853,0.0012230333,0.01005869],"genre_scores_gemma":[0.7176813,0.0000039138486,0.28025964,0.0007982988,0.000050291474,0.000052837106,0.000025912352,0.000005103203,0.0011226941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904305,0.000069583024,0.00024460955,0.00035391908,0.00012272992,0.00016610316],"domain_scores_gemma":[0.9993247,0.00008509838,0.00006952246,0.00034694345,0.00013633701,0.000037399048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003254711,0.0001233287,0.0001353261,0.00022131781,0.00022223656,0.00019514147,0.00044335471,0.000108021726,0.000007165378],"category_scores_gemma":[0.00007240354,0.000109079876,0.000059446927,0.0003434228,0.000021371594,0.00027923018,0.00008481505,0.00016007994,0.0000022376903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032845786,0.00046306863,0.0024352348,0.0005184989,0.00016010663,0.0000064429705,0.0011278861,0.24836862,0.00984765,0.28988653,0.12789401,0.31896347],"study_design_scores_gemma":[0.00083176774,0.00014023503,0.0007157873,0.000117772055,0.0000090446065,0.000003510428,0.000024685436,0.97184175,0.019599877,0.002926936,0.0036187796,0.00016983379],"about_ca_topic_score_codex":0.000058652753,"about_ca_topic_score_gemma":0.000017868151,"teacher_disagreement_score":0.72347313,"about_ca_system_score_codex":0.00006687304,"about_ca_system_score_gemma":0.00011632642,"threshold_uncertainty_score":0.44481483},"labels":[],"label_agreement":null},{"id":"W4415406059","doi":"10.1145/3771938","title":"PoCo: Extending Task-Parallel HLS Programming with Shared Multi- <i>P</i> r <i>o</i> ducer Multi- <i>Co</i> nsumer Buffer Support","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Dataflow; Scalability; Abstraction; Task (project management); Routing (electronic design automation); Field-programmable gate array; Reduction (mathematics); Design flow","score_opus":0.021797602499628817,"score_gpt":0.2780463524000699,"score_spread":0.2562487499004411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415406059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009319921,0.0011492749,0.9913284,0.0013171103,0.00044788432,0.0010565609,0.000015698584,0.0024478156,0.001305259],"genre_scores_gemma":[0.7054585,0.00036260957,0.28409126,0.000547899,0.000015092884,0.0008633832,0.000015159681,0.00004407751,0.008602015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997421,0.00012415077,0.00060451566,0.000995931,0.00020587191,0.0006484983],"domain_scores_gemma":[0.9979901,0.00015237731,0.00021738128,0.0013261578,0.0001976299,0.00011638365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000477075,0.00042752238,0.000557812,0.0011106019,0.0007743344,0.00031009855,0.0012133615,0.0004804121,0.000017728524],"category_scores_gemma":[0.000035737543,0.00037506197,0.00009760709,0.0014501786,0.00020005918,0.0004794135,0.00002867353,0.0006593877,0.00003929971],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004194081,0.0035008225,0.008232849,0.0012752732,0.0022283925,0.00039765268,0.0016364562,0.045405332,0.010260364,0.038898736,0.0076497835,0.88009495],"study_design_scores_gemma":[0.021691475,0.0035664237,0.0020452645,0.0048996997,0.00071418576,0.0035757544,0.002303056,0.57290834,0.10345977,0.0030582577,0.2749316,0.0068461406],"about_ca_topic_score_codex":0.00007517343,"about_ca_topic_score_gemma":0.00001908032,"teacher_disagreement_score":0.8732488,"about_ca_system_score_codex":0.000073596806,"about_ca_system_score_gemma":0.00011574546,"threshold_uncertainty_score":0.9998701},"labels":[],"label_agreement":null},{"id":"W4415477479","doi":"10.1145/3772724","title":"OpenDRAM: A Modular, High-performance Soft Memory Controller for DDR4 DRAM","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Memory controller; Dram; Controller (irrigation); Field-programmable gate array; Open source; Registered memory; Interface (matter)","score_opus":0.013350483180256141,"score_gpt":0.247049703298821,"score_spread":0.23369922011856487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415477479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005515833,0.0007217107,0.9863401,0.0027629938,0.00066788605,0.00086709054,0.000007685792,0.001274994,0.0018417],"genre_scores_gemma":[0.96227026,0.00016104868,0.030096995,0.00026309415,0.00001196713,0.0005703506,0.000002353537,0.000011314776,0.006612603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858874,0.00005452172,0.0003973283,0.0005248358,0.00009391466,0.0003406428],"domain_scores_gemma":[0.99863154,0.0002255155,0.0001170978,0.00082214776,0.00015904813,0.00004465981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044344758,0.00020599389,0.00039681236,0.0007883601,0.0005665481,0.00014532264,0.00095184497,0.000348317,0.000005496147],"category_scores_gemma":[0.000052967604,0.0001931901,0.000059335915,0.0007371398,0.000102648046,0.00024931898,0.000015137079,0.00028848936,0.000011213117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013704179,0.00028408205,0.000102407765,0.00034205124,0.00037022994,0.0000057472266,0.00014829812,0.13454124,0.0013285876,0.14657933,0.0021160075,0.714045],"study_design_scores_gemma":[0.002084172,0.00043030886,0.0000766717,0.00030257812,0.000041761643,0.00006218751,0.000101037105,0.94142866,0.026203347,0.018964728,0.009886899,0.0004176271],"about_ca_topic_score_codex":0.000038744034,"about_ca_topic_score_gemma":0.000002501069,"teacher_disagreement_score":0.95675445,"about_ca_system_score_codex":0.000047036516,"about_ca_system_score_gemma":0.00007450169,"threshold_uncertainty_score":0.7878064},"labels":[],"label_agreement":null},{"id":"W4415594765","doi":"10.36227/techrxiv.176158640.04381493/v1","title":"EC6: Enhancing Energy Efficiency in Kubernetes Through Dynamic Extension of CPU Deep Idle States (C6)","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Idle; Cloud computing; Efficient energy use; Energy (signal processing); Orchestration; Energy consumption; Power (physics); Footprint","score_opus":0.007624384190392582,"score_gpt":0.26343756978729105,"score_spread":0.2558131855968985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415594765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013813658,0.0049507176,0.97013515,0.00041320163,0.0005809473,0.00022801374,0.0000017234544,0.0003474607,0.009529139],"genre_scores_gemma":[0.82874304,0.0021200546,0.16694118,0.00047670404,0.000012120124,0.000008672048,0.00000737739,0.00001610571,0.0016747678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604434,0.0003144153,0.0013817039,0.0011089594,0.0004287891,0.0007217972],"domain_scores_gemma":[0.9975962,0.0005036026,0.00040197952,0.0010228241,0.00040082756,0.000074571115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007476131,0.0004324385,0.0006852269,0.0006158584,0.00021825111,0.00018322757,0.0013173544,0.00023959044,0.000049248065],"category_scores_gemma":[0.00017006829,0.0004259022,0.00017054977,0.002542426,0.00020859332,0.00052779657,0.0009942712,0.0002640703,0.000008013607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050252882,0.0009845058,0.00052151293,0.00028499454,0.000056709807,0.000021895366,0.0038062965,0.70006764,0.006187607,0.16839398,0.0004235146,0.119201094],"study_design_scores_gemma":[0.00040320226,0.00020680232,0.00035492683,0.0005663952,0.000012971089,0.0000033032638,0.00014093153,0.901802,0.07057542,0.025303578,0.00026948086,0.00036098022],"about_ca_topic_score_codex":0.0020064479,"about_ca_topic_score_gemma":0.00062786305,"teacher_disagreement_score":0.81492937,"about_ca_system_score_codex":0.00018241032,"about_ca_system_score_gemma":0.0003112201,"threshold_uncertainty_score":0.9998193},"labels":[],"label_agreement":null},{"id":"W4415702056","doi":"10.1145/3774327","title":"HiSpMM: High Performance High Bandwidth Sparse-Dense Matrix Multiplication on HBM-equipped FPGAs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scalability; Bottleneck; Field-programmable gate array; Workload; Speedup; Matrix multiplication; Design space exploration; Bandwidth (computing); Robustness (evolution)","score_opus":0.013608908343037511,"score_gpt":0.25046420109222134,"score_spread":0.23685529274918382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415702056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11699878,0.00040493277,0.8719212,0.0048023467,0.0008997953,0.00062962016,0.0000086748105,0.002338581,0.0019960657],"genre_scores_gemma":[0.98011166,0.000494672,0.013394185,0.0001646903,0.000016827358,0.00022412224,0.0000052554637,0.000014967509,0.005573611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982236,0.00010459998,0.00047163485,0.0006800519,0.00016090348,0.0003592224],"domain_scores_gemma":[0.99803853,0.00020894356,0.00017270466,0.0013756872,0.00014467882,0.000059474733],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038263944,0.0002697624,0.0003748111,0.0011714805,0.0006102394,0.00013770051,0.00096313935,0.0004307358,0.000014316118],"category_scores_gemma":[0.000044693585,0.00025690458,0.000052731615,0.0012027684,0.00011619596,0.00023979406,0.000018663019,0.00047367404,0.000071269795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024277762,0.000721773,0.0009282569,0.00041683688,0.00034433164,0.000021725014,0.0002500946,0.17470652,0.00387626,0.34162635,0.003259505,0.47360557],"study_design_scores_gemma":[0.0037935425,0.0017612869,0.002618948,0.0015244712,0.00011702037,0.00024166354,0.0002284386,0.7738869,0.17243828,0.026994819,0.014836899,0.001557732],"about_ca_topic_score_codex":0.00009772684,"about_ca_topic_score_gemma":0.0000054941015,"teacher_disagreement_score":0.86311287,"about_ca_system_score_codex":0.000099879544,"about_ca_system_score_gemma":0.00006707589,"threshold_uncertainty_score":0.9999883},"labels":[],"label_agreement":null},{"id":"W4416003937","doi":"10.1145/3731599.3767535","title":"RISC-V Vectorization Coverage for HPC: A TSVC-Based Analysis","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compiler; Benchmark (surveying); Key (lock); Compiler correctness; Kernel (algebra); Vectorization (mathematics)","score_opus":0.012695724004970908,"score_gpt":0.28964163983564345,"score_spread":0.2769459158306725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416003937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001578531,0.00023127813,0.9819515,0.0017008943,0.00065208704,0.0006632113,0.000015893802,0.00069900486,0.013928309],"genre_scores_gemma":[0.68456125,0.00005717404,0.30171534,0.0019123986,0.00006632205,0.000064239444,0.00006426237,0.000011709987,0.011547334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974823,0.00018182104,0.00068405224,0.00090781663,0.00029679283,0.00044723213],"domain_scores_gemma":[0.99764085,0.00042218604,0.00027263208,0.0009406474,0.000619514,0.00010417573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006048903,0.00031720614,0.0005258838,0.0011802886,0.0005214947,0.00072837353,0.0009746776,0.00021822342,0.00014396543],"category_scores_gemma":[0.00022239788,0.00032745727,0.00053126185,0.0056795566,0.00005740712,0.00028607418,0.0001976671,0.0001390477,0.00001594667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056533307,0.00034066293,0.002633825,0.00012164428,0.00079223857,0.0000017131653,0.00014399081,0.86562616,0.00008669067,0.07819772,0.019661611,0.032337233],"study_design_scores_gemma":[0.0006870798,0.00013825455,0.000733363,0.00005119666,0.00048336823,1.3428024e-7,0.0000034673296,0.97722405,0.004701994,0.0030579595,0.012591732,0.00032738718],"about_ca_topic_score_codex":0.000087085915,"about_ca_topic_score_gemma":0.000022852175,"teacher_disagreement_score":0.68440336,"about_ca_system_score_codex":0.00014155683,"about_ca_system_score_gemma":0.00037181296,"threshold_uncertainty_score":0.99991775},"labels":[],"label_agreement":null},{"id":"W4416003994","doi":"10.1145/3731599.3767523","title":"Fast on-demand Memory Mapping for Shared Memory and Disaggregated Systems","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronization (alternating current); Shared memory; Physical address; Distributed shared memory; Memory management; Table (database); Distributed memory; Memory map","score_opus":0.02194265321430747,"score_gpt":0.26608086314121576,"score_spread":0.2441382099269083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416003994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010088854,0.0031664458,0.96348083,0.0017497594,0.0015395641,0.0016114964,0.000019538773,0.000856863,0.026566606],"genre_scores_gemma":[0.74788725,0.00067772594,0.15453227,0.0025063069,0.00034282857,0.00032869994,0.000034284338,0.0000614232,0.09362923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968996,0.00021962934,0.00081489,0.0011645078,0.00029193654,0.00060941867],"domain_scores_gemma":[0.9977733,0.0005399187,0.0002931752,0.000864914,0.00034344677,0.00018528328],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009489988,0.00045925027,0.00062330806,0.00053562154,0.0007311621,0.0012335448,0.0009454361,0.00026025562,0.000019544374],"category_scores_gemma":[0.00018026991,0.00043691864,0.00014306002,0.0008776975,0.00015190095,0.0003971611,0.00058748515,0.00023743216,0.000011894086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032569226,0.0008732728,0.00046710146,0.004578823,0.0009724963,0.000042874246,0.0076505155,0.23896292,0.0007107802,0.1608108,0.24401708,0.34058765],"study_design_scores_gemma":[0.0011537574,0.00018538754,0.00018440906,0.0015068774,0.000030231406,0.00000931804,0.00029244108,0.99118954,0.0012618704,0.0008236032,0.002882215,0.00048032822],"about_ca_topic_score_codex":0.00006261132,"about_ca_topic_score_gemma":0.0000028127772,"teacher_disagreement_score":0.8089486,"about_ca_system_score_codex":0.000101803045,"about_ca_system_score_gemma":0.00020709986,"threshold_uncertainty_score":0.99980825},"labels":[],"label_agreement":null},{"id":"W4416004258","doi":"10.1145/3731599.3767392","title":"Accelerating Intra-Node GPU Communication: A Performance Model for Multi-Path Transfers","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Pipeline (software); Overhead (engineering); Key (lock); Path (computing); Models of communication; Communications system; Reliability (semiconductor)","score_opus":0.07152579302323961,"score_gpt":0.318105012464722,"score_spread":0.2465792194414824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416004258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010188235,0.0007262938,0.9846562,0.002868034,0.00022996496,0.0010643272,0.000009250482,0.0007857102,0.00864137],"genre_scores_gemma":[0.43564638,0.00065663847,0.5589084,0.0013506204,0.00001596286,0.00011240473,0.000008171412,0.000013698695,0.0032877324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732035,0.00014818441,0.0009206433,0.00077011756,0.0002329966,0.0006077308],"domain_scores_gemma":[0.9975761,0.00020374183,0.00017214516,0.0014116253,0.00051868457,0.00011766277],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00096484326,0.00040350933,0.00044014264,0.00026860362,0.0013275598,0.00069563335,0.0024375087,0.0002431797,0.000015625295],"category_scores_gemma":[0.0000758452,0.0004223911,0.00020321901,0.0008353345,0.00015280963,0.000844324,0.0004494496,0.0004192291,0.0000063998555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004247995,0.00030618286,0.00019238016,0.00028525226,0.00006578178,3.0227e-7,0.0035324765,0.741646,0.00006847964,0.09567901,0.004155019,0.15402663],"study_design_scores_gemma":[0.0011846991,0.00010797363,0.00006706312,0.00041398668,0.00002940952,0.000001944301,0.00005150017,0.9935404,0.0030947083,0.0007448597,0.00032539328,0.00043807618],"about_ca_topic_score_codex":0.000026515061,"about_ca_topic_score_gemma":0.000013422941,"teacher_disagreement_score":0.43462756,"about_ca_system_score_codex":0.00012894454,"about_ca_system_score_gemma":0.00054127735,"threshold_uncertainty_score":0.9999726},"labels":[],"label_agreement":null},{"id":"W4416004510","doi":"10.1145/3731599.3767478","title":"Implementing OpenMP Offload Support in the AMD Next Generation Fortran Compiler","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Compiler; Fortran; Graphics; Supercomputer; Pipeline (software); Code (set theory); Source code; Multithreading","score_opus":0.06712360270663426,"score_gpt":0.329952398670176,"score_spread":0.26282879596354175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416004510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044196276,0.00019619094,0.9199471,0.0051201233,0.0005727387,0.0008447105,0.0000025821248,0.0001987833,0.06869817],"genre_scores_gemma":[0.8927046,0.00016969912,0.09698185,0.0070373835,0.00013951024,0.000052832725,0.00003595787,0.000010364376,0.0028677813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651533,0.00046005394,0.0010525989,0.0007404003,0.00042041464,0.00081118924],"domain_scores_gemma":[0.9984504,0.00014824516,0.00021646905,0.00094267714,0.00018610233,0.00005610381],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030074366,0.00031052707,0.0003273721,0.00036478398,0.00076301466,0.0016737538,0.001964088,0.00013218659,0.0003074986],"category_scores_gemma":[0.00004467143,0.00024980592,0.00013862943,0.0015008543,0.00007305295,0.0008517106,0.0007895383,0.0003585891,0.000038032158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019837677,0.0006615407,0.00830016,0.00010537576,0.000095393596,0.000035901892,0.007098015,0.023296135,0.0012848714,0.35260963,0.27286732,0.33362582],"study_design_scores_gemma":[0.00054792553,0.00010403098,0.0016305054,0.00005687383,0.000016859047,0.000010047246,0.00022182454,0.96249974,0.0022727365,0.0009975143,0.031348564,0.00029337034],"about_ca_topic_score_codex":0.00030262655,"about_ca_topic_score_gemma":0.00041843418,"teacher_disagreement_score":0.9392036,"about_ca_system_score_codex":0.00008004296,"about_ca_system_score_gemma":0.00035530378,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W4416021351","doi":"10.48550/arxiv.2511.02043","title":"Flashlight: PyTorch Compiler Extensions to Accelerate Attention Variants","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Austin; Georgia Institute of Technology; National Science Foundation","keywords":"Compiler; Workflow; Kernel (algebra); Template; Block (permutation group theory); Flexibility (engineering); Computation; Pipeline (software); Compile time","score_opus":0.07403998737022514,"score_gpt":0.3224161343961718,"score_spread":0.24837614702594663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416021351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13436657,0.00023205143,0.8437019,0.0052390634,0.0061074314,0.0015510833,0.0000558303,0.0014279494,0.007318148],"genre_scores_gemma":[0.8184768,0.00078378763,0.15537801,0.0046021347,0.00070806005,0.00020952424,0.00014667519,0.000076824224,0.019618185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9921635,0.0007688564,0.0017689441,0.0031645263,0.00085133815,0.0012828356],"domain_scores_gemma":[0.99327224,0.00029916965,0.0007579608,0.0034619211,0.0015791699,0.00062952715],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001336299,0.0011283093,0.0012552104,0.0010362787,0.0012138643,0.00091171294,0.004212066,0.0008573133,0.00021871837],"category_scores_gemma":[0.00030295204,0.0012160634,0.00055687234,0.0021583333,0.00014849409,0.000559454,0.007600995,0.0016065139,0.001913576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039278987,0.0038055247,0.18064523,0.0011599084,0.0016405428,0.00045858734,0.007173021,0.40977958,0.012761698,0.026203511,0.29445764,0.06152195],"study_design_scores_gemma":[0.0009854229,0.0003382693,0.5163247,0.0030144288,0.00019090703,0.000030243798,0.000032427688,0.44685635,0.0038695745,0.0015598193,0.024311014,0.0024868716],"about_ca_topic_score_codex":0.00018856864,"about_ca_topic_score_gemma":0.000018961222,"teacher_disagreement_score":0.68832386,"about_ca_system_score_codex":0.00031918846,"about_ca_system_score_gemma":0.0008014457,"threshold_uncertainty_score":0.9990289},"labels":[],"label_agreement":null},{"id":"W4416287448","doi":"10.2139/ssrn.5714822","title":"Forecast of Compute Platform Development","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Golder Associates (Canada)","funders":"","keywords":"Wright; Constraint (computer-aided design); Key (lock); Upper and lower bounds; Development (topology); Power (physics); Magnitude (astronomy)","score_opus":0.020807073612915516,"score_gpt":0.2675969598844404,"score_spread":0.24678988627152487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416287448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032716962,0.004751738,0.984645,0.00038250678,0.0015811712,0.0004995088,0.0000054605134,0.00020941011,0.0046535246],"genre_scores_gemma":[0.5057955,0.022259323,0.46183848,0.00022147984,0.00050814095,0.000027416478,0.00003144762,0.000056205557,0.009262043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911005,0.00024273136,0.002314451,0.0010173918,0.0010215848,0.0043033455],"domain_scores_gemma":[0.9953076,0.00019116935,0.0021699164,0.0010250875,0.0010774358,0.00022877747],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0057995394,0.00081669533,0.0011878661,0.0010142141,0.0007721867,0.000393022,0.0045876307,0.00058504817,0.000016638485],"category_scores_gemma":[0.00008616069,0.0008263981,0.00057259074,0.0009097226,0.00015435135,0.00040165166,0.0029588444,0.007107217,0.000016813163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007925768,0.00035160832,0.00024997003,0.00021495318,0.0010982327,0.0000071984314,0.0019139043,0.073377624,0.000008388161,0.33181715,0.00044522528,0.59043646],"study_design_scores_gemma":[0.0016344275,0.0008493229,0.00030405578,0.0024011298,0.00014149003,0.0008554165,0.00030937465,0.50016725,0.0021897305,0.476845,0.012725145,0.0015776876],"about_ca_topic_score_codex":0.000057708206,"about_ca_topic_score_gemma":0.00012747696,"teacher_disagreement_score":0.5888588,"about_ca_system_score_codex":0.0029532993,"about_ca_system_score_gemma":0.03446558,"threshold_uncertainty_score":0.9994187},"labels":[],"label_agreement":null},{"id":"W4416342724","doi":"10.1109/socc66126.2025.11235425","title":"Hardware-aware Gradient-based Column-wise Mixed-Precision Quantization for Compute-in-Memory Accelerators","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"King Abdullah University of Science and Technology","keywords":"Quantization (signal processing); Context (archaeology); Noise (video); Product (mathematics)","score_opus":0.024772826139800638,"score_gpt":0.29754868996147793,"score_spread":0.2727758638216773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416342724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043633385,0.0005312417,0.98451,0.0015553149,0.0036670114,0.0023982583,0.000026703032,0.0010751428,0.0018729772],"genre_scores_gemma":[0.72846013,0.0001280754,0.26675788,0.00195482,0.00010662188,0.0001719932,0.00010344969,0.000048529928,0.002268504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945581,0.00047927277,0.0015956085,0.0017888083,0.00058792543,0.0009902937],"domain_scores_gemma":[0.995812,0.0009991018,0.00048656185,0.001420728,0.0010369001,0.00024469817],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014925454,0.0006758711,0.0008751988,0.0014821328,0.0007792958,0.0010964815,0.0021527188,0.00047759805,0.000046946814],"category_scores_gemma":[0.00035099115,0.0007538334,0.0003906531,0.0033529236,0.00015727585,0.00073379034,0.00065444154,0.00039056165,0.000027051456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025534298,0.0012450534,0.0034634683,0.000542762,0.000072512186,0.000018701729,0.0004303825,0.6223387,0.000060772407,0.027417656,0.07618548,0.2679692],"study_design_scores_gemma":[0.0030566615,0.00034387354,0.0015177551,0.00086331944,0.000033413453,0.0000016766551,0.000057191326,0.97659355,0.008390911,0.0019025351,0.006510429,0.00072869565],"about_ca_topic_score_codex":0.00015970948,"about_ca_topic_score_gemma":0.00015567036,"teacher_disagreement_score":0.7240968,"about_ca_system_score_codex":0.00041734165,"about_ca_system_score_gemma":0.0010047965,"threshold_uncertainty_score":0.99994045},"labels":[],"label_agreement":null},{"id":"W4416429953","doi":"10.1109/iiswc66894.2025.00022","title":"The Curious Case of Global Stable Loads","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Becton Dickinson (Canada)","funders":"","keywords":"Compiler; Cache; Spec#; Microarchitecture; x86; Speedup; Fetch; Execution time","score_opus":0.009949960081502155,"score_gpt":0.29032372857348643,"score_spread":0.28037376849198425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416429953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001423141,0.0029708482,0.90514416,0.0020988164,0.0007501531,0.0002202902,0.0000044791177,0.00023597246,0.08715215],"genre_scores_gemma":[0.9198921,0.00039802917,0.071153946,0.00047904198,0.000023585182,0.0000056542444,3.1275067e-7,0.000003742179,0.008043622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982497,0.00018297827,0.00057728647,0.00039869134,0.0001912318,0.00040011274],"domain_scores_gemma":[0.9981077,0.00023787156,0.00019521655,0.0010143109,0.00037384251,0.00007105812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007018535,0.00018914069,0.00023738219,0.000046216,0.00066062825,0.00039039654,0.0012155783,0.00010551034,0.000020189425],"category_scores_gemma":[0.0001116657,0.00013798744,0.00011834413,0.0014600639,0.00022252789,0.00016914036,0.0008602902,0.00013972237,0.000011377892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015240056,0.0001252345,0.0005794537,0.000037998252,0.00006291102,0.0001305583,0.00014343731,0.007974043,0.0000044211674,0.791193,0.03910509,0.16062859],"study_design_scores_gemma":[0.00028951044,0.00010741772,0.00013056317,0.00008146113,0.000021913356,0.00023899338,0.000060401253,0.9583686,0.0013264345,0.025889076,0.013299012,0.00018660941],"about_ca_topic_score_codex":0.00085397944,"about_ca_topic_score_gemma":0.00014357192,"teacher_disagreement_score":0.9503946,"about_ca_system_score_codex":0.00010423626,"about_ca_system_score_gemma":0.0005332237,"threshold_uncertainty_score":0.56269646},"labels":[],"label_agreement":null},{"id":"W4416557590","doi":"10.1007/978-3-032-07612-0_11","title":"Automatically Parallelizing Batch Inference on Deep Neural Networks Using Fiats and Fortran 2023 “Do Concurrent”","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Scalability; Inference; Leverage (statistics); Fortran; Artificial neural network; Compiler; Computation; Context (archaeology); Range (aeronautics)","score_opus":0.02276136667519307,"score_gpt":0.28838624080774095,"score_spread":0.2656248741325479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416557590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011379736,0.00073512906,0.99512213,0.0002921144,0.0012387224,0.00043192643,0.0000023578755,0.0004430803,0.0016207425],"genre_scores_gemma":[0.37052283,0.00014470046,0.62748355,0.0014880116,0.00023339583,0.000008571981,0.0000060422817,0.000027871376,0.00008505816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961928,0.0000771651,0.0006930716,0.0015737441,0.0007135043,0.00074972847],"domain_scores_gemma":[0.9971787,0.0010448247,0.0003295299,0.0010010736,0.00024067979,0.00020523617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006987611,0.00063386024,0.0006604821,0.00076589116,0.00043805505,0.0009884932,0.002288921,0.0003969604,0.000008561633],"category_scores_gemma":[0.00014016392,0.00059788063,0.00012041159,0.00070321234,0.0005033148,0.0004447202,0.0014482642,0.0010215053,0.0000031124225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025213635,0.00001367857,0.000046809793,0.000031554282,0.000007853528,0.000023736296,0.00014916633,0.5521979,0.0000032418784,0.021851605,0.000014018001,0.42565796],"study_design_scores_gemma":[0.00020283253,0.00014767182,0.00007260383,0.0007578374,0.0000101308315,0.000026494383,1.2123887e-7,0.96978563,0.000038000482,0.02828771,0.000095916475,0.0005750296],"about_ca_topic_score_codex":0.000022007158,"about_ca_topic_score_gemma":0.000024130488,"teacher_disagreement_score":0.42508292,"about_ca_system_score_codex":0.00023514975,"about_ca_system_score_gemma":0.0002843615,"threshold_uncertainty_score":0.99964726},"labels":[],"label_agreement":null},{"id":"W4416564610","doi":"10.1007/978-3-032-08187-2_4","title":"GPU Implementations for Midsize Integer Addition and Multiplication","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"CUDA; Multiplication (music); Fast Fourier transform; Integer (computer science); Computation; Implementation; Domain (mathematical analysis); SIMD","score_opus":0.018900148783402314,"score_gpt":0.29475572556548485,"score_spread":0.27585557678208256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416564610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004711593,0.00016277887,0.99573284,0.0015341922,0.0003990914,0.00069957296,0.000030949686,0.00026731647,0.0011685281],"genre_scores_gemma":[0.012050945,0.0000720271,0.98547995,0.0014837658,0.0001433097,0.000073617906,0.000052858137,0.000014053523,0.0006294847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797153,0.000021163902,0.00040524013,0.0009992504,0.0002911242,0.00031168206],"domain_scores_gemma":[0.998017,0.0006913871,0.0002200429,0.00066045043,0.0003365575,0.00007453261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050889386,0.00028667215,0.00027473154,0.0006772864,0.00032261127,0.00038303985,0.0011210027,0.00017850731,0.000007875148],"category_scores_gemma":[0.00013481374,0.00028613675,0.000073139156,0.00036016104,0.00023716755,0.0003703438,0.00058177917,0.00025998178,0.00000292835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051375573,0.00002164682,0.000016422908,0.000055855937,0.000011079862,0.0000016887202,0.00038239412,0.013444482,0.000082812716,0.09355983,0.0013936091,0.89102507],"study_design_scores_gemma":[0.00024423073,0.00008502064,0.000054495766,0.00021715907,0.000007313702,0.000007737735,1.2598086e-7,0.8250743,0.0010477036,0.1676684,0.005282132,0.00031138235],"about_ca_topic_score_codex":0.00001654721,"about_ca_topic_score_gemma":0.000030179823,"teacher_disagreement_score":0.89071363,"about_ca_system_score_codex":0.00016488881,"about_ca_system_score_gemma":0.00027568307,"threshold_uncertainty_score":0.99995905},"labels":[],"label_agreement":null},{"id":"W4416714690","doi":"10.1109/mwscas53549.2025.11244417","title":"Binary Insertion Sort for Hardware Acceleration: Balancing Flexibility and Resource Efficiency","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"sort; Sorting; Scalability; Sorting algorithm; Flexibility (engineering); Binary number","score_opus":0.027132609477974818,"score_gpt":0.2990428848673205,"score_spread":0.2719102753893457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416714690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015683964,0.00085120427,0.97033113,0.0027870683,0.00041424006,0.00094579573,0.000005044952,0.00069012557,0.008291418],"genre_scores_gemma":[0.8241194,0.000094808805,0.16830774,0.0016201677,0.00009396761,0.00006058966,0.000019013789,0.000012245973,0.0056720665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974292,0.00017325889,0.0006806412,0.0010550607,0.00023794534,0.0004239313],"domain_scores_gemma":[0.9983185,0.00027450582,0.00017226831,0.00074966304,0.00037776312,0.000107323496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012636633,0.0002912319,0.00033567703,0.00028990148,0.0010052786,0.00067012577,0.0006343551,0.00020914312,0.000022518821],"category_scores_gemma":[0.0002685964,0.0002938868,0.00011234183,0.00092431396,0.00012266284,0.0005216797,0.0005735419,0.00019833056,0.0000032806772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049520424,0.0013847665,0.013944011,0.0018724296,0.00016003048,0.000009831568,0.0041711726,0.16592613,0.0022935832,0.16360816,0.09005477,0.5560799],"study_design_scores_gemma":[0.00052801677,0.00025712984,0.0040383153,0.00020194087,0.000019949135,0.0000036374634,0.000051943436,0.97831494,0.0034062744,0.0024967694,0.010380686,0.00030037638],"about_ca_topic_score_codex":0.000028656848,"about_ca_topic_score_gemma":0.000005567417,"teacher_disagreement_score":0.81238884,"about_ca_system_score_codex":0.00011936485,"about_ca_system_score_gemma":0.0003189804,"threshold_uncertainty_score":0.9999513},"labels":[],"label_agreement":null},{"id":"W4416725785","doi":"10.1109/mwscas53549.2025.11244432","title":"Sequencing on Silicon: AI SoC Design for Mobile Genomics at the Edge","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; GlobalFoundries; Qualcomm","keywords":"Deep learning; Enhanced Data Rates for GSM Evolution; Domain (mathematical analysis); Nanopore sequencing; Mobile device; Genomics; Signal processing; DNA sequencing","score_opus":0.039555739604592,"score_gpt":0.298000484499992,"score_spread":0.2584447448954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416725785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010331332,0.0008426305,0.9830765,0.0035800932,0.00089698803,0.001925495,0.000004905425,0.00047624388,0.008163995],"genre_scores_gemma":[0.3841577,0.0006195532,0.5093846,0.031065684,0.00039029625,0.0007790396,0.000009845683,0.00006198353,0.073531345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975358,0.00027332891,0.00056539295,0.0008409746,0.00020756715,0.0005769342],"domain_scores_gemma":[0.997124,0.0011455615,0.00018591988,0.0011736396,0.00028394663,0.00008692897],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013806708,0.00034427547,0.00032487125,0.0001646702,0.0013034258,0.0005526327,0.0015802995,0.00019943272,0.000061337356],"category_scores_gemma":[0.00010528509,0.00026393938,0.0002294516,0.00057774386,0.00016242621,0.00018249176,0.0007532315,0.00027146033,0.00006364047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006282958,0.00007894726,0.000014156434,0.000050825292,0.000066284614,0.0000018665507,0.0011102358,0.74749035,0.0009678252,0.049207043,0.1201969,0.080752745],"study_design_scores_gemma":[0.00032764947,0.00035851015,0.0000067152164,0.000075348544,0.000022304283,0.0000037822053,0.000046620014,0.88251334,0.08506938,0.0058394005,0.025462823,0.0002741243],"about_ca_topic_score_codex":0.000022418077,"about_ca_topic_score_gemma":0.0000064043606,"teacher_disagreement_score":0.47369194,"about_ca_system_score_codex":0.0007713314,"about_ca_system_score_gemma":0.0008593235,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W4416881061","doi":"10.37665/smiwgew72664","title":"Ceramic Grid Array Technologies for ACPI Applications","year":2000,"lang":"","type":"article","venue":"SMTA International","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Ball grid array; Ceramic; Soldering; Reliability (semiconductor); Grid; Surface-mount technology; Power (physics); Column (typography)","score_opus":0.015854711085176564,"score_gpt":0.28468275720191966,"score_spread":0.2688280461167431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416881061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022177176,0.0004429294,0.96083754,0.008640895,0.0011849109,0.00088076096,0.00013364191,0.0015748088,0.02608276],"genre_scores_gemma":[0.38101932,0.0017270077,0.5934058,0.0009338438,0.001389561,0.0012566616,0.00024263168,0.00005678345,0.019968411],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977068,0.00003726585,0.0005855088,0.0008255747,0.00041266732,0.00043223466],"domain_scores_gemma":[0.99837536,0.0001479792,0.00022679959,0.00076824613,0.00041486698,0.00006673865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030095433,0.0002989945,0.00024195982,0.00030570538,0.00040261375,0.0005331325,0.002813308,0.00023749733,0.0005247064],"category_scores_gemma":[0.00007419643,0.00032448946,0.00020792625,0.00046919053,0.00019799707,0.00048852526,0.00020203147,0.00027826155,0.0003080857],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039070783,0.00033115878,0.0002140686,0.000028475684,0.00013566493,0.0000018075718,0.00026045716,0.009624036,0.00036082123,0.08000255,0.027370645,0.88163126],"study_design_scores_gemma":[0.00052713254,0.00012360435,0.00018796355,0.00007063061,0.000016637068,0.000027678201,0.000026934149,0.3178005,0.0049847853,0.029943569,0.6458229,0.00046771628],"about_ca_topic_score_codex":0.000012632826,"about_ca_topic_score_gemma":0.000002488273,"teacher_disagreement_score":0.88116354,"about_ca_system_score_codex":0.00015564263,"about_ca_system_score_gemma":0.00014364725,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W4416962742","doi":"10.1109/sbac-pad66369.2025.00012","title":"Extraction and Representation of Sparsity Patterns for Efficient Data Transfer on Accelerators","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sparse approximation; Computation; A priori and a posteriori; Representation (politics); Sparse matrix; Pattern recognition (psychology); Transfer (computing); Compressed sensing","score_opus":0.07966446153088773,"score_gpt":0.3586842892701675,"score_spread":0.27901982773927975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416962742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080748014,0.00006902349,0.91628796,0.0005707826,0.0004267345,0.00061933405,0.000044377895,0.00010928961,0.0011244797],"genre_scores_gemma":[0.963178,0.00017376947,0.036077,0.00019143718,0.000026712865,0.000008793214,0.000034322315,0.000005589721,0.00030441344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982729,0.00011337573,0.00045309446,0.00076983334,0.0002040482,0.00018677162],"domain_scores_gemma":[0.9983398,0.0003203286,0.00009565788,0.0010060485,0.00018807904,0.000050142542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000514836,0.0001633261,0.00024918077,0.00024892617,0.00020340028,0.00016358598,0.0007062979,0.000107152606,0.000013043272],"category_scores_gemma":[0.00008487534,0.00016301539,0.00005524216,0.00045500576,0.000049782615,0.0002808578,0.00030136044,0.00010970968,7.1187026e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005470962,0.0018022336,0.009274376,0.0008158229,0.0002427276,0.0000030303013,0.0017404427,0.15471949,0.0016804746,0.0881618,0.007812854,0.73319966],"study_design_scores_gemma":[0.00062157476,0.00015846032,0.0073033962,0.000152643,0.000036044137,9.545919e-7,0.000038919516,0.9449304,0.045933697,0.0002873768,0.00039599455,0.00014054308],"about_ca_topic_score_codex":0.000101749276,"about_ca_topic_score_gemma":0.000009906164,"teacher_disagreement_score":0.88242996,"about_ca_system_score_codex":0.000029129053,"about_ca_system_score_gemma":0.00008057838,"threshold_uncertainty_score":0.6647575},"labels":[],"label_agreement":null},{"id":"W4417131097","doi":"10.1109/tdsc.2025.3641055","title":"NOProbe: A NOP-Based Dynamic Binary Instrumentation Framework Using Binary Rewriting on x86","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Telefonaktiebolaget LM Ericsson; Google","keywords":"x86; Instrumentation (computer programming); Binary number; Code (set theory); Binary translation; Rewriting; Binary code; Trampoline","score_opus":0.01674311255718804,"score_gpt":0.29385212819226453,"score_spread":0.2771090156350765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417131097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1493265,0.00051015493,0.84577745,0.00068334845,0.0018870715,0.0007089572,0.000023556444,0.00070317654,0.0003798042],"genre_scores_gemma":[0.7573784,0.00013194355,0.24111077,0.0011413824,0.00006588771,0.000012841037,0.0000096223075,0.00004976489,0.00009939809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950231,0.0005432386,0.0011817466,0.0016556807,0.0006212752,0.0009750064],"domain_scores_gemma":[0.9971641,0.000881585,0.00051260286,0.00090930704,0.0002957712,0.00023667769],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00088335073,0.0008116874,0.0007330772,0.0014086108,0.0028501782,0.0009242331,0.0008146064,0.00061950827,0.00003136738],"category_scores_gemma":[0.000037893835,0.0009373712,0.0002947071,0.0024960116,0.00019228467,0.0005690936,0.000044024928,0.0017587866,0.000018000592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015575551,0.0005435609,0.000060316892,0.00032537238,0.000107530315,0.00006175518,0.0006087023,0.88974154,0.0011011922,0.0012942781,0.000038953815,0.105961025],"study_design_scores_gemma":[0.0011573518,0.0007361532,0.00007012339,0.0043556322,0.00012524867,0.00003660054,0.00021442596,0.97944635,0.012070701,0.0009277417,0.000070717295,0.00078896736],"about_ca_topic_score_codex":0.00009143853,"about_ca_topic_score_gemma":0.000009485754,"teacher_disagreement_score":0.6080519,"about_ca_system_score_codex":0.00045457733,"about_ca_system_score_gemma":0.000549713,"threshold_uncertainty_score":0.9993077},"labels":[],"label_agreement":null},{"id":"W4417241966","doi":"10.1145/3760250.3762219","title":"Tilus: A Tile-Level GPGPU Programming Language for Low-Precision Computation","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Vector Institute","funders":"University of Toronto; VMware; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Compiler; General-purpose computing on graphics processing units; Computation; Memory bandwidth; Programming paradigm; CUDA; Key (lock); Memory hierarchy; High-level programming language","score_opus":0.02719246606388686,"score_gpt":0.3302743869949385,"score_spread":0.30308192093105163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417241966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084832864,0.0006468192,0.987857,0.0011303611,0.0010360098,0.0016775434,0.000011605332,0.0011191813,0.0056731384],"genre_scores_gemma":[0.2660394,0.00003589877,0.72383505,0.0006952136,0.000096595904,0.00009448991,0.000033814038,0.000020427871,0.009149107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699616,0.00016096304,0.0008441702,0.0009924328,0.00037961316,0.0006266724],"domain_scores_gemma":[0.9977803,0.0005669442,0.00029303506,0.0006545538,0.0005761297,0.00012901057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009977366,0.00038845203,0.00044506602,0.00052129326,0.00054398435,0.0009124664,0.0011104868,0.0002616085,0.000023066275],"category_scores_gemma":[0.00030349093,0.0003875763,0.000248528,0.0013246401,0.00008387973,0.0004562399,0.0006338956,0.00023071335,0.000034781984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000448337,0.00025676808,0.000038735187,0.00020011576,0.000045207787,0.0000037801715,0.0014235404,0.016295217,0.00011624932,0.010942383,0.012576799,0.9580564],"study_design_scores_gemma":[0.00091133243,0.00021665322,0.00015122705,0.00061077776,0.000029304781,0.0000041675125,0.00015095565,0.9834103,0.0037349188,0.002720797,0.007654929,0.00040463675],"about_ca_topic_score_codex":0.000061392835,"about_ca_topic_score_gemma":0.000014683028,"teacher_disagreement_score":0.9671151,"about_ca_system_score_codex":0.00014148159,"about_ca_system_score_gemma":0.00033454172,"threshold_uncertainty_score":0.9998576},"labels":[],"label_agreement":null},{"id":"W46242658","doi":"","title":"Detecting repetitive program behaviour from hardware data","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Profiling (computer programming); Workload; Computer science; Embedded system; Execution time; Microarchitecture; Real-time computing; Parallel computing; Operating system","score_opus":0.04419069411704736,"score_gpt":0.32754505240935144,"score_spread":0.2833543582923041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46242658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041900314,0.000036853824,0.9825944,0.00011596793,0.00013894685,0.00016212538,0.000006292978,0.0025116147,0.0102438],"genre_scores_gemma":[0.31238994,0.0000032764835,0.68717897,0.00013783936,0.000057596764,0.0000033165318,0.00003534645,0.000005661229,0.00018806316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.000031499625,0.00021386075,0.00051607913,0.00018798053,0.00024252881],"domain_scores_gemma":[0.99844015,0.0001460989,0.000083280356,0.0011575351,0.00009600009,0.00007693552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061762927,0.000099306,0.000098864206,0.00006809743,0.00013338236,0.0002530743,0.0015165127,0.00005803343,0.000019112023],"category_scores_gemma":[0.00013618844,0.000091554226,0.000025728199,0.00027358514,0.000020127169,0.0005544912,0.00092680485,0.00013062837,0.000022369932],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004202752,0.000120051125,0.005966057,0.0000022492877,0.000014002177,0.000048372844,0.00032399208,0.00009810186,0.00008763286,0.0027280226,0.0024799032,0.9881274],"study_design_scores_gemma":[0.0005790045,0.00030841582,0.045113575,0.0001055852,0.000022254633,0.000039232793,0.00023661098,0.8760044,0.051965754,0.002431895,0.022240754,0.00095250393],"about_ca_topic_score_codex":0.00022774708,"about_ca_topic_score_gemma":0.00006791282,"teacher_disagreement_score":0.9871749,"about_ca_system_score_codex":0.00002196895,"about_ca_system_score_gemma":0.000028299346,"threshold_uncertainty_score":0.3733473},"labels":[],"label_agreement":null},{"id":"W52060701","doi":"","title":"Characterizing the Sort Operation on Multithreaded Architectures.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of British Columbia","funders":"","keywords":"Multithreading; Computer science; sort; Parallel computing; Simultaneous multithreading; Parallelism (grammar); Computer architecture; Thread (computing); Operating system","score_opus":0.022304633844523372,"score_gpt":0.26700604677388384,"score_spread":0.24470141292936048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52060701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026674373,0.00043943743,0.992436,0.0023972394,0.000006166624,0.00042187882,0.0000123335785,0.0008634544,0.00075606065],"genre_scores_gemma":[0.85608214,0.00051368517,0.14215994,0.00055590324,0.000076069686,0.00048653924,0.00006069325,0.000009324782,0.00005569404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912053,0.00003323485,0.00019864751,0.00035055625,0.00012300868,0.00017399614],"domain_scores_gemma":[0.9994275,0.000047550715,0.00010223459,0.00029045215,0.00006400741,0.00006824786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014463784,0.0001530419,0.00012859555,0.000059188602,0.0010750307,0.0001920364,0.00031913232,0.00006830213,9.82302e-7],"category_scores_gemma":[0.000009392123,0.000107893844,0.000024757215,0.00022532087,0.00015005912,0.00012247,0.00012832653,0.00016949444,0.0000016762747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054297983,0.0004337242,0.0016354867,0.00012859683,0.000034738678,0.000015921014,0.0022308815,0.0021864206,0.0024318602,0.13407412,0.0028100773,0.85396385],"study_design_scores_gemma":[0.0013366555,0.00048171714,0.013067449,0.00031120694,0.000048070335,0.001333646,0.0001206529,0.6105688,0.027783586,0.051121235,0.2919558,0.001871144],"about_ca_topic_score_codex":0.000012491218,"about_ca_topic_score_gemma":6.450863e-7,"teacher_disagreement_score":0.8534147,"about_ca_system_score_codex":0.000012538453,"about_ca_system_score_gemma":0.000034754066,"threshold_uncertainty_score":0.82683754},"labels":[],"label_agreement":null},{"id":"W562030935","doi":"","title":"International Workshop on Parallel Symbolic Computation, PASCO '07, July 27-28, 2007, London, Ontario, Canada","year":2007,"lang":"en","type":"book","venue":"Association for Computing Machinery eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computation; Computer science; Programming language","score_opus":0.013118930178955079,"score_gpt":0.2525605916081413,"score_spread":0.23944166142918624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W562030935","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019382907,0.00005979007,0.5792901,0.0004911655,0.004427718,0.0007171979,0.00005018009,0.000761513,0.41418296],"genre_scores_gemma":[0.0035849132,0.000016316866,0.09114543,0.0039629703,0.0017868936,0.000034629364,0.0011460652,0.0001559179,0.89816684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942186,0.00019153002,0.001538106,0.0013484914,0.0017085226,0.0009947685],"domain_scores_gemma":[0.99331886,0.0021226667,0.002320358,0.00074894633,0.0012126205,0.00027657952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017424156,0.000897617,0.00096582266,0.00062892394,0.00068257476,0.0006611963,0.0020824294,0.0007527721,0.000027704775],"category_scores_gemma":[0.00035663554,0.0010136237,0.00045624297,0.0001678047,0.00004720926,0.0001664929,0.000536466,0.0014067892,0.00006886957],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037486927,0.00007033952,0.00034783885,0.000040217466,0.00041725568,0.000020812286,0.0004821415,0.08490707,7.033003e-7,0.0142485285,0.88265705,0.016770525],"study_design_scores_gemma":[0.0011785936,0.000099650446,0.00043882162,0.0003911774,0.00006507271,0.000013695637,0.0000043664945,0.17424212,0.000011143898,0.008590191,0.8137784,0.0011867455],"about_ca_topic_score_codex":0.04999173,"about_ca_topic_score_gemma":0.10290972,"teacher_disagreement_score":0.48814467,"about_ca_system_score_codex":0.0066801347,"about_ca_system_score_gemma":0.0031611966,"threshold_uncertainty_score":0.9992314},"labels":[],"label_agreement":null},{"id":"W576352615","doi":"10.1017/cbo9780511584046","title":"Memory as a Programming Concept in C and C++","year":2003,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Debugging; Programming language; Compiler; Memory protection; Memory address; Software engineering; Memory management; Virtual memory; Operating system; Semiconductor memory","score_opus":0.013558003316056447,"score_gpt":0.21017555529599818,"score_spread":0.19661755197994174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W576352615","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018883802,0.00029888697,0.13588412,0.000012909293,0.00009159282,0.00035230594,0.000004479965,0.0003546379,0.86298215],"genre_scores_gemma":[0.00014979867,0.000054319466,0.018432828,0.00011446978,0.00002308329,0.0000013176955,0.000008907816,0.00001564766,0.9811996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872386,0.00011760609,0.00015867047,0.0005550028,0.00017727792,0.0002675713],"domain_scores_gemma":[0.9991255,0.00006308903,0.00015425192,0.00045821618,0.00008191216,0.00011704833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014884054,0.00024555638,0.0003019997,0.00024489444,0.000115491996,0.00011607984,0.00073075324,0.00025735464,3.3713712e-7],"category_scores_gemma":[0.000015403726,0.0003050491,0.00006617587,0.00003538738,0.0001520208,0.00013834392,0.00050788635,0.00037298366,0.0000020329394],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013373742,0.000026531703,0.0000031721759,0.0000861475,0.000040554954,0.0005891688,0.0005702193,0.00012999169,0.0000026200705,0.83863777,0.1336621,0.026238374],"study_design_scores_gemma":[0.000593493,0.00007788076,0.000005376278,0.00021619431,0.000016097816,0.000051136583,0.000025035653,0.0043342547,0.00028401127,0.00005605359,0.9938347,0.0005057752],"about_ca_topic_score_codex":0.00007074628,"about_ca_topic_score_gemma":5.9715535e-7,"teacher_disagreement_score":0.86017257,"about_ca_system_score_codex":0.00017952305,"about_ca_system_score_gemma":0.00032968726,"threshold_uncertainty_score":0.99994016},"labels":[],"label_agreement":null},{"id":"W577694231","doi":"10.1007/978-1-4615-0288-3_32","title":"Monte Carlo Methods Designed for Parallel Computation","year":2003,"lang":"en","type":"book-chapter","venue":"High Performance Computing Systems and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Message Passing Interface; Overhead (engineering); Monte Carlo method; Computation; Interface (matter); Cluster (spacecraft); Parallel computing; Message passing; Computer cluster; Distributed computing; Coupling (piping); Algorithm; Computer network; Operating system; Engineering; Mathematics","score_opus":0.031643569968571726,"score_gpt":0.30237939156396904,"score_spread":0.27073582159539733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W577694231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003705911,0.0018695123,0.98472804,0.000119676806,0.0002980456,0.0019960064,0.00001380619,0.0007236012,0.010214229],"genre_scores_gemma":[0.018440574,0.0004426695,0.9533704,0.0002206142,0.00036300684,0.00043051163,0.000044391832,0.00007994373,0.026607892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976592,0.0000786395,0.00078968634,0.0008676319,0.00023414067,0.00037067366],"domain_scores_gemma":[0.99773717,0.0003525235,0.0006990252,0.00065635773,0.0004194703,0.00013547196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087516237,0.00046631158,0.00063445105,0.00025272364,0.0007959576,0.00036786866,0.0006239326,0.00033006072,0.0000010608939],"category_scores_gemma":[0.000010326432,0.00047883176,0.00011497223,0.00013750515,0.00008212127,0.00018471394,0.00018489046,0.00026782576,0.0000101529085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008256147,0.000033285865,0.000011559171,0.00057567057,0.000093465555,7.036416e-7,0.0001667754,0.26599154,0.000015332434,0.6195325,0.006643555,0.106927305],"study_design_scores_gemma":[0.00034267813,0.00012887105,0.000022013703,0.00026040224,0.000037411166,0.00003451344,0.0000042953707,0.8588911,0.000023220015,0.00345901,0.13623753,0.0005589522],"about_ca_topic_score_codex":0.000016105734,"about_ca_topic_score_gemma":5.213784e-7,"teacher_disagreement_score":0.61607355,"about_ca_system_score_codex":0.000103621496,"about_ca_system_score_gemma":0.00008104224,"threshold_uncertainty_score":0.99976635},"labels":[],"label_agreement":null},{"id":"W61934617","doi":"10.82308/12281","title":"McVM: An optimizing virtual machine for the MATLAB programming language","year":2010,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Compiler; Programming language; Just-in-time compilation; Python (programming language); Interpreter; Virtual machine; Dynamic compilation; MATLAB; JavaScript; Operating system; Software engineering","score_opus":0.01535417131402649,"score_gpt":0.2602440541522965,"score_spread":0.24488988283827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61934617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5561933,0.00054590084,0.40130422,0.0011354609,0.004700035,0.004849657,0.00042378597,0.0112896655,0.019557998],"genre_scores_gemma":[0.6112011,0.000011799978,0.38774365,0.000456439,0.000059954036,0.00011449241,0.000019590789,0.000046755602,0.00034620034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997484,0.00017815789,0.0004638317,0.00078723877,0.0004202807,0.0006664378],"domain_scores_gemma":[0.997541,0.00044195863,0.0002443218,0.0012952376,0.00022877136,0.00024869232],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017291118,0.00036489026,0.00028971303,0.00017624571,0.0017366072,0.00046826163,0.0022215452,0.00021557581,0.000023341978],"category_scores_gemma":[0.0004412125,0.00029138138,0.00018194965,0.0005319787,0.00008938268,0.0012238475,0.0005574452,0.0008965473,0.000030488247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021287426,0.00014293408,0.000012886742,0.000016085001,0.00003739634,0.000013787953,0.000038988197,0.0019934524,0.01712133,0.3263156,0.0000104958635,0.6542758],"study_design_scores_gemma":[0.0023518999,0.0010643764,0.00021813452,0.00011044078,0.00010088699,0.0002734825,0.00021702198,0.64840037,0.15092504,0.019453809,0.17475085,0.0021336768],"about_ca_topic_score_codex":0.00013868824,"about_ca_topic_score_gemma":0.00014104777,"teacher_disagreement_score":0.65214205,"about_ca_system_score_codex":0.00007571367,"about_ca_system_score_gemma":0.000028730725,"threshold_uncertainty_score":0.9999538},"labels":[],"label_agreement":null},{"id":"W659530620","doi":"10.1145/2870544.2870551","title":"Real-Time Fine-Grained Parallelism in Ada","year":2015,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Parallelism (grammar); Task parallelism; Programming language; Parallel computing; Data parallelism; Instruction-level parallelism; Implicit parallelism","score_opus":0.02270847754535184,"score_gpt":0.2530869120129884,"score_spread":0.23037843446763653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W659530620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30390903,0.00014732742,0.62755775,0.05774041,0.00069358165,0.00059080654,0.0000033691526,0.0025676112,0.0067901127],"genre_scores_gemma":[0.32086805,0.000023555927,0.67139,0.0067938417,0.00017456079,0.000041450185,0.000020020878,0.00003410555,0.00065442635],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981189,0.00015754972,0.00037057887,0.00049923925,0.0004104187,0.00044331286],"domain_scores_gemma":[0.9982722,0.00021128148,0.00012700859,0.001135706,0.000074107076,0.00017972964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121148,0.0002252553,0.00026730215,0.00021774547,0.000065523986,0.00014343062,0.001847303,0.00008524742,0.000011194049],"category_scores_gemma":[0.0002901506,0.00022298182,0.000067588204,0.00059661857,0.00004962405,0.00041342326,0.0005481153,0.00019933973,0.00010534009],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056384397,0.00018282236,0.0026711489,0.000025873993,0.000045927714,0.00046246694,0.0037377868,0.06609901,0.013495546,0.00489009,0.8990912,0.009241758],"study_design_scores_gemma":[0.007770768,0.0007060601,0.008522437,0.00045000797,0.000033035656,0.00017714468,0.00014165614,0.8577562,0.013924757,0.031462878,0.074999325,0.0040557194],"about_ca_topic_score_codex":0.0005723028,"about_ca_topic_score_gemma":0.000025982701,"teacher_disagreement_score":0.82409185,"about_ca_system_score_codex":0.00011024828,"about_ca_system_score_gemma":0.000106505686,"threshold_uncertainty_score":0.9092935},"labels":[],"label_agreement":null},{"id":"W6650973","doi":"10.1007/0-306-47015-2_11","title":"Roots: An Object-Oriented Active Message Library","year":2005,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Object (grammar); Peer-to-peer; Object-oriented programming; Contrast (vision); Parallel computing; Distributed computing; Operating system; Artificial intelligence","score_opus":0.016232701468301837,"score_gpt":0.24643930249966073,"score_spread":0.2302066010313589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6650973","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013720908,0.0004631725,0.10912294,0.0008492922,0.00072903733,0.0005708959,0.000030348636,0.0040517002,0.8841689],"genre_scores_gemma":[0.0013155174,0.00009018524,0.055839054,0.004463241,0.001183125,0.00006324589,0.00023090397,0.00023754952,0.9365772],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955175,0.00013885461,0.00093205355,0.0016504651,0.00094303605,0.0008180791],"domain_scores_gemma":[0.99662966,0.00014216448,0.00076832453,0.0016816828,0.00021241463,0.0005657468],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0004931927,0.0008910018,0.0007710097,0.00090867426,0.0002946181,0.0011360223,0.0043335897,0.0026352897,0.00026780576],"category_scores_gemma":[0.000058173056,0.00091479195,0.00030682917,0.0001455177,0.0002332304,0.0061741266,0.0014381513,0.004518492,0.00009103218],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040760922,0.000034180026,0.000012011271,0.000031534386,0.00019012595,0.00005557075,0.0013274457,0.00016116217,0.000026661044,0.4057354,0.40824428,0.18414085],"study_design_scores_gemma":[0.00042636786,0.0001176991,0.000021198643,0.00022666852,0.00004106592,0.000041451203,0.00001782263,0.0066554807,0.0005070197,0.04024272,0.9505252,0.0011772637],"about_ca_topic_score_codex":0.00000874046,"about_ca_topic_score_gemma":0.0000018385495,"teacher_disagreement_score":0.542281,"about_ca_system_score_codex":0.00022737247,"about_ca_system_score_gemma":0.0006385725,"threshold_uncertainty_score":0.9999009},"labels":[],"label_agreement":null},{"id":"W6890365917","doi":"10.34989/tr-61","title":"Un modèle du coût du financement et du ratio d'endettement des entreprises non financières","year":2021,"lang":"en","type":"article","venue":"Bank of Canada Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cost of equity; Cost of capital; Debt; Rate of return; Interest rate; Investment (military); Creditor; Equity (law); Weighted average cost of capital","score_opus":0.041776953985307605,"score_gpt":0.2916513851942475,"score_spread":0.24987443120893987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6890365917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068864726,0.00060657563,0.9092278,0.013587713,0.00017192744,0.00030409344,0.000009052768,0.00008435112,0.0071437745],"genre_scores_gemma":[0.9404046,0.0006012248,0.057754695,0.00032788093,0.00004824413,0.00004319236,0.0000082252245,0.000009355412,0.0008025973],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751693,0.0003099495,0.0003161005,0.00039827428,0.0010235846,0.0004351806],"domain_scores_gemma":[0.9980199,0.00027570795,0.00008442851,0.0005758459,0.0009397019,0.00010442489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012226315,0.000120866505,0.00018979902,0.00011076707,0.00035699812,0.0001250262,0.00073415355,0.000039734987,0.00007764965],"category_scores_gemma":[0.00040537387,0.000120690645,0.000042889922,0.0005833984,0.00008833795,0.00017058036,0.00060707825,0.00016645133,0.0000024199792],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058052596,0.0007398072,0.011861529,0.00023893999,0.00010903978,0.00077475613,0.0022185533,0.114582725,0.0028510508,0.14913158,0.64603496,0.071399026],"study_design_scores_gemma":[0.0010846391,0.0003106335,0.02937859,0.00022648418,0.000006582683,0.000033952292,0.00015298265,0.56857574,0.27843294,0.004890183,0.116427846,0.0004794342],"about_ca_topic_score_codex":0.044683415,"about_ca_topic_score_gemma":0.036342364,"teacher_disagreement_score":0.87153983,"about_ca_system_score_codex":0.0002673166,"about_ca_system_score_gemma":0.0027218347,"threshold_uncertainty_score":0.9812419},"labels":[],"label_agreement":null},{"id":"W6891987171","doi":"10.48550/arxiv.nlin/0506030","title":"Chaos in computer performance","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alchemy (Canada)","funders":"","keywords":"Aperiodic graph; CHAOS (operating system); Nonlinear system; Key (lock); Sensitivity (control systems); Series (stratigraphy); Variable (mathematics); Multiprocessing","score_opus":0.0527980152786885,"score_gpt":0.1835261731524682,"score_spread":0.1307281578737797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891987171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14910036,0.000035650104,0.84768426,0.00009407086,0.00028627322,0.00017192242,0.0000012931941,0.00055948755,0.002066679],"genre_scores_gemma":[0.934206,0.0003044247,0.06455016,0.00018216064,0.00011726946,8.327067e-7,0.000006636335,0.000011453343,0.0006210271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984255,0.00009610679,0.00021270124,0.0008698351,0.00007404851,0.00032182477],"domain_scores_gemma":[0.9986707,0.00004055141,0.00017175628,0.0009406973,0.00008658452,0.00008969716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024187219,0.00025474344,0.0002770643,0.0003886874,0.000083995226,0.00009914595,0.0018418367,0.00024422273,0.000011538885],"category_scores_gemma":[0.0000053006706,0.00030707792,0.00010344695,0.0005336174,0.000050479524,0.00032965266,0.001952966,0.0005569655,0.000068904716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049672203,0.000056405224,0.003739203,0.00002670762,0.000009634316,0.000052136627,0.00014001295,0.97777927,6.205882e-7,0.011728601,0.00032538397,0.006137063],"study_design_scores_gemma":[0.0002413475,0.000033314565,0.0026508246,0.0001093013,0.0000046279697,0.0000036118174,0.0000016501335,0.99361765,0.00006189647,0.002493871,0.00044453656,0.00033734005],"about_ca_topic_score_codex":0.00003396447,"about_ca_topic_score_gemma":0.000012020465,"teacher_disagreement_score":0.78510565,"about_ca_system_score_codex":0.00019028227,"about_ca_system_score_gemma":0.00011974943,"threshold_uncertainty_score":0.99993813},"labels":[],"label_agreement":null},{"id":"W6892365158","doi":"10.5281/zenodo.10053063","title":"Refining siliceous zeolite framework structures with Si-29 2D J-resolved NMR Spectroscopy","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University","funders":"","keywords":"Zeolite; Nuclear magnetic resonance spectroscopy; Refining (metallurgy); Spectroscopy; Two-dimensional nuclear magnetic resonance spectroscopy; Solid-state nuclear magnetic resonance","score_opus":0.022023067057248658,"score_gpt":0.26148696323609444,"score_spread":0.23946389617884578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892365158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002732562,0.00033765272,0.94664013,0.00072065025,0.00012451636,0.0001754235,0.000019772335,0.0056074094,0.043641876],"genre_scores_gemma":[0.7313247,0.0000911009,0.26565075,0.0005018981,0.00030506725,1.199589e-7,0.0002359343,0.0011503684,0.00074011524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792135,0.00024116195,0.00025215745,0.00068374386,0.00045029924,0.00045127122],"domain_scores_gemma":[0.9986315,0.00007349163,0.000079774494,0.0007334786,0.00031230968,0.00016945053],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00049183046,0.00020485684,0.00017069776,0.0003218405,0.0014274089,0.0028271296,0.0017341953,0.000092030336,0.0011356529],"category_scores_gemma":[0.00026182,0.00018442348,0.00005311621,0.001169524,0.00012173217,0.0004221932,0.0010619492,0.00051842723,0.0011211997],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013709755,0.00017028613,0.000016484268,0.00027389522,0.00021011586,0.00029949538,0.007812976,0.012156618,0.007141084,0.57055056,0.18172115,0.21951026],"study_design_scores_gemma":[0.00027507727,0.00061843166,0.00020155436,0.0002733848,0.000017439239,0.0003280906,0.0001203945,0.09012828,0.0034899816,0.007379708,0.8966524,0.0005152696],"about_ca_topic_score_codex":0.000011112809,"about_ca_topic_score_gemma":1.7960011e-7,"teacher_disagreement_score":0.7285921,"about_ca_system_score_codex":0.000120054836,"about_ca_system_score_gemma":0.000011999481,"threshold_uncertainty_score":0.9998726},"labels":[],"label_agreement":null},{"id":"W6893079477","doi":"10.5281/zenodo.14185647","title":"1313e/CMasher: v1.9.1","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Energy","funders":"","keywords":"Filter (signal processing); Process (computing); Troubleshooting; Product (mathematics)","score_opus":0.028837417805965947,"score_gpt":0.2556257965766563,"score_spread":0.22678837877069036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893079477","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.1934726e-7,0.0005618793,0.3109708,0.0004272261,0.00024375253,0.00022822182,0.000052972766,0.008202518,0.67931217],"genre_scores_gemma":[0.0007677659,0.0005685336,0.039312746,0.00040425305,0.0006557918,9.7299996e-8,0.0009481304,0.013670584,0.9436721],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979503,0.0002424026,0.0002469363,0.00076479954,0.00041671345,0.00037883045],"domain_scores_gemma":[0.9984772,0.000011346807,0.00014536112,0.0010029302,0.00020341277,0.00015971347],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00045588418,0.00025324154,0.00022357964,0.00063742575,0.00060245075,0.0019076308,0.002883982,0.00019427166,0.010504495],"category_scores_gemma":[0.00013908143,0.00026231777,0.0000900273,0.0008071077,0.000097310825,0.00014538591,0.0026644694,0.00042743763,0.04832058],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016316397,0.000032409218,3.4363325e-8,0.00007855862,0.000035652854,0.00001980982,0.00018474822,0.00002410762,0.000018858791,0.017581644,0.92853737,0.053485204],"study_design_scores_gemma":[0.00011557629,0.00008193614,0.0000012023365,0.0001589146,0.000009691868,0.00007217025,0.000009133844,0.0045473296,0.00004096492,0.000948505,0.9937292,0.0002854091],"about_ca_topic_score_codex":0.000020026151,"about_ca_topic_score_gemma":1.9383624e-7,"teacher_disagreement_score":0.27165806,"about_ca_system_score_codex":0.00010219883,"about_ca_system_score_gemma":0.000006664658,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W6893274388","doi":"10.5281/zenodo.14908149","title":"Chplx — an Asynchronous Many Task Runtime Foundation for Chapel","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories","funders":"","keywords":"Chapel; Task (project management); Asynchronous communication; Code (set theory); Closing (real estate)","score_opus":0.0234251727712796,"score_gpt":0.26747402926594804,"score_spread":0.24404885649466845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893274388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008417422,0.00003410626,0.95116544,0.00092822546,0.00014294933,0.00050499645,0.000016483242,0.00224326,0.0441228],"genre_scores_gemma":[0.81830144,0.00009580064,0.17318316,0.0012747576,0.00028426794,7.537036e-7,0.0019349521,0.0009996538,0.003925221],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845314,0.00019816906,0.00026124148,0.00053434126,0.00022048072,0.0003326059],"domain_scores_gemma":[0.99847066,0.000032496813,0.000109609435,0.00065968203,0.0006236351,0.00010391116],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007573228,0.00014033863,0.00014103836,0.0003401653,0.002145408,0.0013966578,0.0018163156,0.00006872914,0.00043411876],"category_scores_gemma":[0.00027796658,0.00015622374,0.000053297223,0.0006947827,0.00007587469,0.0006112957,0.0009691058,0.00014045194,0.00086458324],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043389413,0.00029299242,0.0000034640118,0.000082002334,0.00004894314,0.0000033301465,0.0010191079,0.001760534,0.0024014784,0.30196875,0.10080794,0.59156805],"study_design_scores_gemma":[0.00045080745,0.00026724927,0.00027087,0.000028301112,0.0000065236823,0.000016553875,0.000029817616,0.22081737,0.0008460996,0.0036096051,0.7734657,0.00019109549],"about_ca_topic_score_codex":0.000008230904,"about_ca_topic_score_gemma":1.7120843e-7,"teacher_disagreement_score":0.8174597,"about_ca_system_score_codex":0.00013531778,"about_ca_system_score_gemma":0.00001146252,"threshold_uncertainty_score":0.99991333},"labels":[],"label_agreement":null},{"id":"W6893314937","doi":"10.5281/zenodo.14061541","title":"Artifact of \"Scalar Interpolation: A Better Balance Between Vector and Scalar Execution for SuperScalar Architectures\"","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Artifact (error); Scalar (mathematics); Image (mathematics); Scripting language; Image processing","score_opus":0.023422351049686485,"score_gpt":0.25260041833006386,"score_spread":0.22917806728037737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893314937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01943851,0.00022332255,0.9749444,0.0016646801,0.000081170176,0.00037711038,0.000078320554,0.0011897187,0.0020027307],"genre_scores_gemma":[0.96762156,0.000025871821,0.03156336,0.00009016796,0.00012839255,1.7123389e-7,0.00022513526,0.00026380134,0.00008155623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986117,0.00018356559,0.00027570446,0.00044647497,0.00023568481,0.00024686972],"domain_scores_gemma":[0.9991305,0.00008755442,0.00006625574,0.0003489789,0.00026291073,0.00010378507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060183695,0.00013277911,0.00016594723,0.00027381137,0.000578258,0.0006814894,0.00073366676,0.000069569134,0.00016401448],"category_scores_gemma":[0.00021798564,0.0001304206,0.000066147026,0.000474181,0.0001139525,0.00025901452,0.00060630444,0.00018414619,0.0001075837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011514135,0.0001939779,0.00027869135,0.0009995182,0.00027823096,0.000018468698,0.0072429525,0.0010373909,0.024083432,0.061383005,0.11258841,0.79178077],"study_design_scores_gemma":[0.0006070595,0.00069292175,0.0034970052,0.00030637797,0.000035517158,0.00009662706,0.00004723975,0.43998393,0.008979635,0.0059316736,0.5393664,0.00045556916],"about_ca_topic_score_codex":0.0000037113139,"about_ca_topic_score_gemma":4.8933956e-8,"teacher_disagreement_score":0.94818306,"about_ca_system_score_codex":0.000047390102,"about_ca_system_score_gemma":0.0000053146223,"threshold_uncertainty_score":0.65716183},"labels":[],"label_agreement":null},{"id":"W6901829718","doi":"10.60692/6bp0n-h8443","title":"Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Isogeny; Computation; Concurrency; Implementation; Scheduling (production processes); Synchronization (alternating current); Parallelism (grammar); Reduction (mathematics); Software","score_opus":0.06429800963886571,"score_gpt":0.26822381020300745,"score_spread":0.20392580056414172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901829718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26235393,0.0000052020205,0.736175,0.000023401039,0.00015980148,0.0001991971,0.000011472588,0.00075438037,0.00031764107],"genre_scores_gemma":[0.87332374,6.854063e-7,0.12659875,0.000021987444,0.000021513331,0.000011256853,0.000008627528,0.0000055416854,0.000007923163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986236,0.000093291535,0.0005983394,0.00017544757,0.00027291896,0.00023638504],"domain_scores_gemma":[0.99903476,0.0000216394,0.00041111006,0.00023923953,0.00023176734,0.00006147942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000649719,0.0001501906,0.00024377617,0.00044023414,0.00019661413,0.0002056413,0.00025813255,0.00009008544,9.532825e-7],"category_scores_gemma":[0.000036017376,0.00014011492,0.000052993273,0.00066250376,0.00003713587,0.0010915586,0.0001735839,0.00006917511,0.000027500435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012462432,0.000015820653,0.096367426,0.0023560312,0.00022133737,0.00001118699,0.22846916,0.64199877,0.0002112796,0.02357779,0.00013295743,0.0065135914],"study_design_scores_gemma":[0.0006751055,0.000030393376,0.0069542583,0.00019367863,0.0000075884504,0.00001707998,0.0013574989,0.9901657,0.00041062006,0.000023695759,0.000008899064,0.00015547762],"about_ca_topic_score_codex":0.0000063970588,"about_ca_topic_score_gemma":8.082503e-8,"teacher_disagreement_score":0.6109698,"about_ca_system_score_codex":0.000039900275,"about_ca_system_score_gemma":0.000052704094,"threshold_uncertainty_score":0.57137203},"labels":[],"label_agreement":null},{"id":"W6903410700","doi":"10.1184/r1/6468971.v1","title":"Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung; National Science Foundation","keywords":"Cache; Page cache; Cache coloring; CPU cache; Cache algorithms; Data compression; Latency (audio); Compression (physics); Computation","score_opus":0.03723042197928312,"score_gpt":0.2681623911304028,"score_spread":0.2309319691511197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903410700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004904511,0.0005146003,0.97547567,0.0008254905,0.0001919132,0.0009868483,0.007829243,0.0030173294,0.006254406],"genre_scores_gemma":[0.6211056,0.000010429803,0.37447903,0.001135336,0.00026832192,0.00006494332,0.002713,0.000033660282,0.00018969127],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864435,0.00010468526,0.0002024953,0.0004795711,0.00026726298,0.00030166248],"domain_scores_gemma":[0.99868315,0.00018373312,0.00014664672,0.0006134134,0.00022759379,0.00014545131],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000082301216,0.00020898244,0.00022213846,0.000084498664,0.00030991292,0.00029803024,0.00077123696,0.00013220772,0.002506002],"category_scores_gemma":[0.00015636077,0.0001706032,0.000033799282,0.0003348638,0.000065322405,0.00031453118,0.00048618866,0.00025877086,0.00019870872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015804786,0.0005870229,0.0005369467,0.0010520865,0.00008172202,0.00019713039,0.0047564767,0.0036946821,0.00045586517,0.0030533203,0.9520695,0.033357166],"study_design_scores_gemma":[0.0008320197,0.00051343784,0.008050821,0.0070146774,0.0000061702262,0.000052018764,0.000020327087,0.9677976,0.006022298,0.003430149,0.0055249576,0.0007355287],"about_ca_topic_score_codex":0.000010009773,"about_ca_topic_score_gemma":0.0000059225863,"teacher_disagreement_score":0.9641029,"about_ca_system_score_codex":0.000018603672,"about_ca_system_score_gemma":0.000058668404,"threshold_uncertainty_score":0.9984058},"labels":[],"label_agreement":null},{"id":"W6908418202","doi":"10.26180/18226577.v1","title":"Characterising opioid overdose and mortality in cohorts of people who use drugs","year":2022,"lang":"en","type":"dissertation","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Opioid overdose; Drug overdose; Opioid; Suicide prevention; Injury prevention; Poison control; Human factors and ergonomics; Occupational safety and health","score_opus":0.02269875191840973,"score_gpt":0.2884176146705621,"score_spread":0.26571886275215234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6908418202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9415718,0.0011712135,0.0005207229,0.000023749713,0.00048022892,0.001280341,0.051392682,0.0007039845,0.0028552813],"genre_scores_gemma":[0.684172,0.00018382202,0.0049391612,0.00017809043,0.00006562488,0.00033672215,0.30848792,0.0000662204,0.0015704511],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99871683,0.0000796576,0.00033857685,0.00041368252,0.0002862569,0.00016498256],"domain_scores_gemma":[0.9989646,0.000104684885,0.00036986207,0.00041415708,0.000101220125,0.000045448614],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000103642386,0.0001807269,0.00037720555,0.00021211663,0.00008025152,0.00015872704,0.0004605715,0.00012761593,0.0028307035],"category_scores_gemma":[0.00021465258,0.00021029286,0.000057948935,0.00038272116,0.0000025699544,0.0003906216,0.00026634693,0.000253814,0.0000044244307],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003070546,0.001977279,0.18539862,0.02615322,0.0006257889,0.00056110736,0.34499854,0.009197593,0.0006465155,0.003590066,0.30137715,0.12516706],"study_design_scores_gemma":[0.00017672297,0.00004323134,0.9607865,0.0026886065,0.00000818474,0.0000037905309,0.00010680723,0.03193732,0.0007767854,0.00015716856,0.0028642719,0.00045056437],"about_ca_topic_score_codex":0.0002053379,"about_ca_topic_score_gemma":0.00004427022,"teacher_disagreement_score":0.77538794,"about_ca_system_score_codex":0.000045840294,"about_ca_system_score_gemma":0.00011561717,"threshold_uncertainty_score":0.99808085},"labels":[],"label_agreement":null},{"id":"W6911733598","doi":"10.5281/zenodo.14061540","title":"Artifact of \"Scalar Interpolation: A Better Balance Between Vector and Scalar Execution for SuperScalar Architectures\"","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Artifact (error); Scalar (mathematics); Image (mathematics); Scripting language; Image processing","score_opus":0.023422351049686485,"score_gpt":0.25260041833006386,"score_spread":0.22917806728037737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6911733598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01943851,0.00022332255,0.9749444,0.0016646801,0.000081170176,0.00037711038,0.000078320554,0.0011897187,0.0020027307],"genre_scores_gemma":[0.96762156,0.000025871821,0.03156336,0.00009016796,0.00012839255,1.7123389e-7,0.00022513526,0.00026380134,0.00008155623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986117,0.00018356559,0.00027570446,0.00044647497,0.00023568481,0.00024686972],"domain_scores_gemma":[0.9991305,0.00008755442,0.00006625574,0.0003489789,0.00026291073,0.00010378507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060183695,0.00013277911,0.00016594723,0.00027381137,0.000578258,0.0006814894,0.00073366676,0.000069569134,0.00016401448],"category_scores_gemma":[0.00021798564,0.0001304206,0.000066147026,0.000474181,0.0001139525,0.00025901452,0.00060630444,0.00018414619,0.0001075837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011514135,0.0001939779,0.00027869135,0.0009995182,0.00027823096,0.000018468698,0.0072429525,0.0010373909,0.024083432,0.061383005,0.11258841,0.79178077],"study_design_scores_gemma":[0.0006070595,0.00069292175,0.0034970052,0.00030637797,0.000035517158,0.00009662706,0.00004723975,0.43998393,0.008979635,0.0059316736,0.5393664,0.00045556916],"about_ca_topic_score_codex":0.0000037113139,"about_ca_topic_score_gemma":4.8933956e-8,"teacher_disagreement_score":0.94818306,"about_ca_system_score_codex":0.000047390102,"about_ca_system_score_gemma":0.0000053146223,"threshold_uncertainty_score":0.65716183},"labels":[],"label_agreement":null},{"id":"W6924961993","doi":"10.15468/dl.p5bgcv","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Data compression; Identification (biology)","score_opus":0.018860395855539343,"score_gpt":0.23600895186417215,"score_spread":0.2171485560086328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924961993","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049075684,0.000009307227,0.011384793,0.00024483207,0.0007281234,0.00021810185,0.9861208,0.0012083913,0.00008074628],"genre_scores_gemma":[0.0000010484591,0.00008655348,0.0001546459,0.0004796562,0.0000013075813,0.0000039846814,0.9992725,1.2470976e-8,2.5914554e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838775,0.000078419056,0.0003925782,0.0003135271,0.00051587017,0.0003118506],"domain_scores_gemma":[0.99835753,0.000032858607,0.0003178599,0.00085618277,0.00029548307,0.00014009787],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003763803,0.00026273678,0.00025004338,0.00016817391,0.00031673646,0.00040415153,0.0017884348,0.0003068805,0.00004865544],"category_scores_gemma":[0.00015550626,0.00027734955,0.00013518523,0.00081435655,0.00008282212,0.0013145566,0.0010882948,0.0002630878,0.3283823],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038990984,0.00001538555,0.000050477756,0.000053305117,0.000012926701,0.0000024592173,0.000023935214,0.00020820014,4.2323096e-9,0.0000011006714,0.9980329,0.0015953942],"study_design_scores_gemma":[0.00014255286,0.00002813149,0.000026193045,0.0000034898621,0.000009398806,0.0000037857073,0.000009461155,0.000043148462,0.0000019592644,0.000007493356,0.99943334,0.00029103507],"about_ca_topic_score_codex":0.00036241964,"about_ca_topic_score_gemma":0.000004486477,"teacher_disagreement_score":0.32833365,"about_ca_system_score_codex":0.00021060358,"about_ca_system_score_gemma":0.00016534378,"threshold_uncertainty_score":0.9999679},"labels":[],"label_agreement":null},{"id":"W6925258640","doi":"10.17181/videos.2298370","title":"ATLAS students explain their posters | ATLAS Week Vancouver 2023","year":2023,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Atlas (anatomy); Line drawings; Work (physics)","score_opus":0.019344458289081462,"score_gpt":0.2673079362739458,"score_spread":0.24796347798486432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925258640","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005833244,0.00012166996,0.49632025,0.00013506498,0.0020754281,0.00036679473,0.00001235092,0.008078744,0.4928839],"genre_scores_gemma":[0.00013716654,0.0002645161,0.052562654,0.0004183438,0.00022470592,0.000041150994,0.000012912843,0.00050075736,0.9458378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774003,0.000108574146,0.0003292886,0.0008001414,0.00057034375,0.0004516233],"domain_scores_gemma":[0.9984146,0.00012730525,0.00024094208,0.0010296757,0.000052700834,0.00013481006],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029605514,0.0004334175,0.00041596527,0.0004836615,0.00009456466,0.00028105915,0.002587338,0.00030411736,0.0003584037],"category_scores_gemma":[0.000027026848,0.00035718756,0.00015535629,0.0006151029,0.00004475136,0.00014717359,0.0010788342,0.0002511815,0.001313503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014917565,0.000053059022,0.00007309516,0.000012867126,0.00006355615,0.000021826783,0.00010669544,0.00013952625,0.0000012350456,0.00049001054,0.9961366,0.0029000575],"study_design_scores_gemma":[0.00040009167,0.00013464071,0.00007218427,0.00032310523,0.0000106023535,0.0000043462637,0.000048661008,0.011786252,0.00012185872,0.000495912,0.9857865,0.0008158394],"about_ca_topic_score_codex":0.00044619935,"about_ca_topic_score_gemma":0.0014456703,"teacher_disagreement_score":0.4529539,"about_ca_system_score_codex":0.00007453009,"about_ca_system_score_gemma":0.0000640264,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W6925283933","doi":"10.17895/ices.pub.21957017.v1","title":"Temperature and Density-Dependent Effects on the Size-at-Age of Haddock (Melanogrammus aeglefinus) on the Scotian Shelf","year":2001,"lang":"en","type":"report","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Haddock; Nova scotia; Linear regression; Seasonality; Regression analysis","score_opus":0.030582441025458137,"score_gpt":0.25802023863052903,"score_spread":0.22743779760507088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925283933","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042420503,0.030328624,0.003920543,0.029939052,0.011463312,0.03317302,0.21010809,0.013797056,0.6248498],"genre_scores_gemma":[0.84879196,0.0025049266,0.0074510654,0.015938377,0.0030148681,0.0012934224,0.05917115,0.00051539164,0.06131883],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972831,0.00031857193,0.0003547262,0.0006681491,0.0010177251,0.00035773971],"domain_scores_gemma":[0.99573064,0.0019506013,0.0004459124,0.0014486952,0.00032924337,0.000094921576],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035916764,0.0004474861,0.0004674408,0.00012319056,0.00040699934,0.00034485356,0.0015555554,0.0004244403,0.0018494922],"category_scores_gemma":[0.002381342,0.0002581386,0.00019095503,0.00036005056,0.00002717799,0.00006031094,0.0008695692,0.0009244102,0.00012024143],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008775372,0.00007549754,0.00003705362,0.00035810372,0.00007317552,0.00024513828,0.00021041701,0.00024278069,0.000036041358,0.00020464796,0.9935305,0.004977837],"study_design_scores_gemma":[0.00093303964,0.0017162318,0.013602671,0.04161966,0.00011712165,0.0009980921,0.000040407394,0.0042716265,0.024855647,0.0011080058,0.9080702,0.0026673004],"about_ca_topic_score_codex":0.000035600333,"about_ca_topic_score_gemma":0.00005157338,"teacher_disagreement_score":0.80637145,"about_ca_system_score_codex":0.00014082593,"about_ca_system_score_gemma":0.00024001165,"threshold_uncertainty_score":0.99998707},"labels":[],"label_agreement":null},{"id":"W6925346828","doi":"10.17605/osf.io/cunvk","title":"Early Palliative Care in Oncology Across Canada: A Scoping Review Protocol","year":2023,"lang":"en","type":"other","venue":"Open Science Framework","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Palliative care; Protocol (science); MEDLINE; End-of-life care; Patient care","score_opus":0.04663262847937099,"score_gpt":0.4413972182584043,"score_spread":0.3947645897790333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925346828","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022331185,0.0029527443,0.26693034,0.0025665383,0.0017510881,0.32180005,0.000035714987,0.0021768075,0.40178448],"genre_scores_gemma":[0.00007269807,0.001539886,0.746146,0.0054370947,0.00023767975,0.20684065,0.0000048256434,0.0005119072,0.039209258],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99669164,0.00016870606,0.0004908596,0.0011691776,0.00075395114,0.000725643],"domain_scores_gemma":[0.99753445,0.0002172673,0.0005480549,0.0013433342,0.00018935249,0.00016751049],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014980633,0.00029171072,0.00068649894,0.00014621405,0.00027921723,0.0006598186,0.008718045,0.000274264,0.00006480166],"category_scores_gemma":[0.0009420361,0.0002675562,0.000041892694,0.003535167,0.00025263164,0.00035870506,0.0034399056,0.00061358116,0.000051739342],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021157817,0.00016554535,0.0022444357,0.008980322,0.000035245943,0.0005301839,0.0080622025,0.00086125196,0.0000011298193,0.013569685,0.4273852,0.53814363],"study_design_scores_gemma":[0.00060017203,0.00036530345,0.00095124386,0.40970957,0.00000667346,0.0000046071195,0.00014572783,0.0020072525,0.0000540671,0.0010662206,0.5834873,0.001601899],"about_ca_topic_score_codex":0.22701742,"about_ca_topic_score_gemma":0.5305523,"teacher_disagreement_score":0.53654176,"about_ca_system_score_codex":0.0009162144,"about_ca_system_score_gemma":0.007263671,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W6925460970","doi":"10.17611/dp/15126668","title":"Magnetotelluric Transfer Functions","year":2017,"lang":"en","type":"other","venue":"NSF Seismological Facility for the Advancement of Geoscience (SAGE)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Geological Survey of Canada","funders":"","keywords":"Magnetotellurics; Transfer function; Field (mathematics); Transfer (computing); Interpretation (philosophy)","score_opus":0.03181482067666708,"score_gpt":0.2792136928990832,"score_spread":0.24739887222241613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925460970","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000085480315,0.0012451065,0.9932107,0.0015696508,0.0007710596,0.0010244723,0.0002645484,0.00048459042,0.0014213696],"genre_scores_gemma":[0.0009447444,0.001473996,0.056097526,0.0004910431,0.000060200517,0.00014369594,0.000026982712,0.000024523066,0.9407373],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977026,0.0000871232,0.00036950465,0.00083388196,0.000511146,0.0004957323],"domain_scores_gemma":[0.9978017,0.00023440234,0.00025012126,0.0015293019,0.000084933665,0.00009950162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007534756,0.00034236544,0.00044437617,0.00013541713,0.0005573668,0.00011839327,0.0027203402,0.00022959668,0.00018865224],"category_scores_gemma":[0.00015700684,0.00022757145,0.000265271,0.00027177576,0.00065698,0.00020322746,0.00037134605,0.00022520346,0.000029679053],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010545283,0.00011498411,0.000015971737,0.000047301244,0.000018235081,0.0000016369839,0.000028102764,0.0010226188,0.000024645693,0.0019519639,0.00026130246,0.9965027],"study_design_scores_gemma":[0.0002525187,0.0003405126,0.00010187809,0.00007819316,0.00002415088,0.0000033375525,0.000005881849,0.0131069105,0.00012081313,0.0007905965,0.98488957,0.00028564516],"about_ca_topic_score_codex":0.00015486215,"about_ca_topic_score_gemma":0.0000101703845,"teacher_disagreement_score":0.9962171,"about_ca_system_score_codex":0.00004628425,"about_ca_system_score_gemma":0.00009016091,"threshold_uncertainty_score":0.92800945},"labels":[],"label_agreement":null},{"id":"W6926309985","doi":"10.23645/epacomptox.27625683","title":"A Simple Physiologically-Based Toxicokinetic Model for Multi-Route In Vitro-In Vivo Extrapolation","year":2024,"lang":"en","type":"other","venue":"Open MIND","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Extrapolation; Simple (philosophy); In vivo; Toxicokinetics","score_opus":0.08013130896664213,"score_gpt":0.35289546034939007,"score_spread":0.27276415138274795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926309985","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005780811,0.000117235504,0.9739291,0.00006299308,0.000064547305,0.0010340955,0.000060000406,0.000050972965,0.02462325],"genre_scores_gemma":[0.010196516,0.000007777825,0.89328027,0.000099796205,0.000029954006,0.00014229206,0.000044083703,0.000083877036,0.09611542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867356,0.000053595206,0.0002776855,0.0006551216,0.00010266923,0.00023735987],"domain_scores_gemma":[0.9993805,0.000037773378,0.00012718716,0.00039671353,0.000019737165,0.000038056834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025283193,0.000211176,0.00030987358,0.00032694876,0.000018170796,0.00022590722,0.0010407396,0.00021993711,0.00012384981],"category_scores_gemma":[0.000024021378,0.00019467219,0.00006753714,0.00029683634,0.00001888174,0.00008113129,0.0002524625,0.00014527513,0.000043440064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001983232,0.0012386804,0.000041789488,0.0003266191,0.00006303615,0.000064196254,0.0014902976,0.6233513,0.018328814,0.0011600681,0.18712765,0.16660927],"study_design_scores_gemma":[0.00047947202,0.00003340096,0.00000558072,0.00016048882,0.0000037719053,2.9256407e-7,0.0000015114315,0.9707708,0.0016265785,0.00075771246,0.025922246,0.00023817792],"about_ca_topic_score_codex":0.00007615209,"about_ca_topic_score_gemma":0.00015266503,"teacher_disagreement_score":0.3474195,"about_ca_system_score_codex":0.000057586687,"about_ca_system_score_gemma":0.00010733189,"threshold_uncertainty_score":0.7938501},"labels":[],"label_agreement":null},{"id":"W6926549710","doi":"10.25446/oxford.25732062","title":"53855: The Sisters Buried at Lemnos","year":2024,"lang":"en","type":"other","venue":"University of Oxford","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"World War II; Period (music); Biography; Pandemic; MEDLINE","score_opus":0.011931371906712562,"score_gpt":0.20752621232612306,"score_spread":0.1955948404194105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926549710","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029708785,0.000261114,0.2681201,0.0007947368,0.00018161717,0.000100428915,0.000007027799,0.00057835947,0.72995365],"genre_scores_gemma":[0.00046107787,0.0002053104,0.04021762,0.00008959415,0.000043140422,9.2633094e-8,0.000004912901,0.000044365766,0.9589339],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993926,0.000033717024,0.00006711734,0.00024506034,0.0001477604,0.00011373838],"domain_scores_gemma":[0.999325,0.000022868497,0.00012084744,0.00047761263,0.000021712398,0.000031984364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008177949,0.00011333862,0.00014673421,0.00015431574,0.000069946334,0.000025150037,0.0010877532,0.00011076913,0.00018157043],"category_scores_gemma":[0.0000041055246,0.000098283446,0.00010561589,0.00018116683,0.00009659812,0.00003431311,0.00061655615,0.00010966183,0.00009551612],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002179394,0.000006884766,0.000007704864,0.000032011943,0.000038054546,0.0000128052025,0.0003067303,0.000049237908,0.0000011375737,0.0072081354,0.9911501,0.0011850079],"study_design_scores_gemma":[0.00007668925,0.000020106192,0.0000051296242,0.000092626215,0.000017732447,0.0000028144498,0.000025515086,0.0038339803,0.000015382957,0.00039986102,0.9953986,0.00011159833],"about_ca_topic_score_codex":0.00012590767,"about_ca_topic_score_gemma":0.00004115804,"teacher_disagreement_score":0.22898026,"about_ca_system_score_codex":0.000042866563,"about_ca_system_score_gemma":0.00003387198,"threshold_uncertainty_score":0.40078828},"labels":[],"label_agreement":null},{"id":"W6926715531","doi":"10.25318/3410023101-fra","title":"Pratiques de gestion des actifs relatifs aux eaux usées de propriété municipale, selon la zone (urbaine ou rurale) et la taille de population, Infrastructure Canada, inactif","year":2019,"lang":"fr","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Coastal zone; Productivity; Context (archaeology); Sugar industry","score_opus":0.012200604857670116,"score_gpt":0.284915191582747,"score_spread":0.27271458672507687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926715531","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008724284,0.00034744022,0.7817189,0.0014875204,0.00054759486,0.0008193731,0.20592304,0.0001701862,0.0002616331],"genre_scores_gemma":[0.16341338,0.00077952445,0.31201494,0.00050012465,0.00014627479,0.000097469485,0.5184392,0.00010517159,0.004503966],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9947788,0.001673434,0.0009208227,0.0007601093,0.0009984387,0.0008683637],"domain_scores_gemma":[0.9945995,0.0020863174,0.0010490278,0.000826265,0.0010485549,0.00039034296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001434176,0.0007042476,0.00060378475,0.0002765658,0.0007147333,0.0006014293,0.0009696972,0.00073995447,0.00005698309],"category_scores_gemma":[0.0031796973,0.0008037093,0.000051282655,0.0006931962,0.00017367765,0.00061782764,0.00026569027,0.0013514484,0.0000018821246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.000030467207,0.00007176176,0.0041170805,0.000597848,0.00007642476,0.0001632881,0.0017834042,0.058947444,0.000046557034,0.019520959,0.89677227,0.017872512],"study_design_scores_gemma":[0.00041392483,0.00019614316,0.3951628,0.0016050336,0.00022252342,0.00036163122,0.0004273062,0.38772577,0.00039951445,0.004179905,0.20789386,0.0014115871],"about_ca_topic_score_codex":0.9602313,"about_ca_topic_score_gemma":0.99212974,"teacher_disagreement_score":0.68887836,"about_ca_system_score_codex":0.0056769503,"about_ca_system_score_gemma":0.013827642,"threshold_uncertainty_score":0.9994414},"labels":[],"label_agreement":null},{"id":"W6926781006","doi":"10.25446/oxford.24969261.v1","title":"1076: Pte Sidney John Crook (watch)","year":2024,"lang":"en","type":"other","venue":"Open MIND","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Front (military); Clearing; Front line; Queen (butterfly); Adversary","score_opus":0.03347041147429338,"score_gpt":0.3148080018190245,"score_spread":0.28133759034473116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926781006","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.253051e-7,0.0005658552,0.20284545,0.0004310188,0.0005207109,0.00030185498,0.000014168375,0.00013454724,0.79518586],"genre_scores_gemma":[0.000025498659,0.000046906167,0.31478855,0.00013897325,0.00014561528,0.000011218312,0.00001262125,0.00013582285,0.6846948],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984855,0.0000567407,0.00022800991,0.0007560418,0.00021760425,0.00025607867],"domain_scores_gemma":[0.9987609,0.000018813767,0.00015271813,0.0009252558,0.00003084564,0.000111467096],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027024557,0.00026740387,0.0003081332,0.00017669529,0.000047312416,0.0011757289,0.002763025,0.00024280079,0.0040413365],"category_scores_gemma":[0.000019692769,0.00024436344,0.00008201362,0.00031346802,0.00003939771,0.00014109102,0.0015447275,0.00024638293,0.011088781],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.812465e-7,0.000017779013,0.0000016468335,0.0000139560325,0.000028955308,0.00003668045,0.00012856089,0.000026714699,0.000003117566,0.0006944504,0.9560283,0.043019075],"study_design_scores_gemma":[0.00008830061,0.00002846295,8.992722e-7,0.00034530737,0.000011819475,0.000011426878,0.0000022299002,0.004480757,0.00026937932,0.00063566223,0.9938033,0.0003224464],"about_ca_topic_score_codex":0.00016343276,"about_ca_topic_score_gemma":0.000048372516,"teacher_disagreement_score":0.11194309,"about_ca_system_score_codex":0.00003473071,"about_ca_system_score_gemma":0.00015715194,"threshold_uncertainty_score":0.9998611},"labels":[],"label_agreement":null},{"id":"W6926955628","doi":"10.25384/sage.20278517.v1","title":"Supplementary material - Supplemental material for Implementation of Teledermatology in Alberta, Canada: A Report of One Thousand Cases","year":2022,"lang":"en","type":"article","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Teledermatology; MEDLINE; Telemedicine","score_opus":0.022337202300151297,"score_gpt":0.28443692260879583,"score_spread":0.26209972030864453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926955628","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12307368,0.000007372729,0.0007138759,0.0006268412,0.0003069031,0.0010850127,0.87409526,0.000039916442,0.000051144594],"genre_scores_gemma":[0.80152464,3.0274657e-7,0.009922927,0.00007422613,0.000022685424,0.000383188,0.18805318,0.000007882815,0.0000109700095],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877906,0.00007296806,0.00052800245,0.0002182159,0.00020729873,0.00019448205],"domain_scores_gemma":[0.9992815,0.00009988565,0.00033257887,0.00020436913,0.00005693089,0.000024692292],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009696792,0.00009199381,0.00021408591,0.00010085616,0.000081221086,0.000016294638,0.0003614587,0.000019555837,0.062236823],"category_scores_gemma":[0.000034049983,0.00010838614,0.00003373608,0.00013830794,0.000004574337,0.00007856314,0.00040006783,0.00003674047,1.8398167e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011410748,0.00016507339,0.0035094176,0.00034900956,0.000051582298,0.000241909,0.00061254157,0.0007098236,0.0011442179,0.00045822316,0.99166185,0.0009822639],"study_design_scores_gemma":[0.003465675,0.001078285,0.0052892813,0.00019145894,0.000026899754,0.0013437609,0.0007190095,0.0066467,0.8196228,0.0003236739,0.1605951,0.00069734117],"about_ca_topic_score_codex":0.32607397,"about_ca_topic_score_gemma":0.27640998,"teacher_disagreement_score":0.8310667,"about_ca_system_score_codex":0.00010900057,"about_ca_system_score_gemma":0.0004526101,"threshold_uncertainty_score":0.93862045},"labels":[],"label_agreement":null},{"id":"W6928782512","doi":"10.37916/arq.urb.vi4.201","title":"The concepts of urban mobility in the second post-war: analysis of the Runcorn and Milton Keynes planes for the \"New Towns","year":2019,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Urbanism; Quarter (Canadian coin); Moment (physics); Urban planning; Urban economics; Urban theory","score_opus":0.013913447210082702,"score_gpt":0.24781550977905736,"score_spread":0.23390206256897467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6928782512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8331236,0.004451399,0.09700955,0.048721634,0.0014604524,0.0037706734,0.00015909073,0.00029541802,0.01100818],"genre_scores_gemma":[0.99688375,0.000070679154,0.0024852618,0.00022363197,0.000056689714,0.00006601635,0.000012811278,0.000007649233,0.00019353189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979426,0.00037725817,0.0005479093,0.0003902739,0.0004581293,0.00028378417],"domain_scores_gemma":[0.9963989,0.0017791837,0.00043013002,0.0010011675,0.00032601785,0.00006458332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012403135,0.0001962805,0.00032454223,0.0001546759,0.00047074884,0.00013693466,0.0016938746,0.00014129638,0.0000049573673],"category_scores_gemma":[0.00035970408,0.00009757461,0.00022367018,0.0010504347,0.000056122928,0.00019132931,0.00030074516,0.00025107755,3.076482e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015149741,0.0002814467,0.010300165,0.00008997683,0.00046139845,0.0000022224356,0.012492539,0.003760873,0.0010824886,0.96686816,0.0017437062,0.0027655172],"study_design_scores_gemma":[0.0013951329,0.00025552083,0.15211213,0.00011934537,0.00030693205,0.000121518526,0.002159353,0.10662411,0.004139855,0.0021957052,0.73006827,0.00050211756],"about_ca_topic_score_codex":0.00000838384,"about_ca_topic_score_gemma":0.0005919912,"teacher_disagreement_score":0.96467245,"about_ca_system_score_codex":0.00006713686,"about_ca_system_score_gemma":0.00028332864,"threshold_uncertainty_score":0.3978977},"labels":[],"label_agreement":null},{"id":"W6929997263","doi":"10.5281/zenodo.10002200","title":"Simulation-Based Inference for the Synchronization of Business Cycles","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Synchronization (alternating current); Inference; Business cycle; Scheme (mathematics)","score_opus":0.0502283035455763,"score_gpt":0.29054247071313255,"score_spread":0.24031416716755624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929997263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004031952,0.000024494131,0.9954152,0.0010449158,0.000068569825,0.00037503277,0.00002773701,0.0015523349,0.0010885282],"genre_scores_gemma":[0.98850745,0.000026888702,0.010669984,0.000096886506,0.0000464009,1.6784027e-7,0.00034945953,0.00022618168,0.00007659367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989373,0.00013150294,0.00022137286,0.0002569874,0.00025375458,0.00019907272],"domain_scores_gemma":[0.99748236,0.0006512116,0.00013691907,0.00046488995,0.0012213541,0.00004325431],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000663834,0.00008830006,0.000097057375,0.00022788404,0.0013694133,0.00043020386,0.0013457957,0.00004084468,0.0001417601],"category_scores_gemma":[0.0026237816,0.00007686227,0.00003682692,0.0016425753,0.000088862325,0.00022137414,0.00053351646,0.00007187923,0.00022581911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008628962,0.000028860482,0.000006870781,0.000042564872,0.000009588533,4.198025e-7,0.00026144995,0.90670615,0.00013233589,0.00916808,0.0079596015,0.07567544],"study_design_scores_gemma":[0.00019862062,0.00005275259,0.0006622282,0.000024450232,0.000004317043,7.968822e-7,0.000018899058,0.9136709,0.00032265318,0.0006234454,0.08433667,0.00008426098],"about_ca_topic_score_codex":0.0000069338444,"about_ca_topic_score_gemma":1.0470087e-7,"teacher_disagreement_score":0.9881042,"about_ca_system_score_codex":0.000040044022,"about_ca_system_score_gemma":0.000011778054,"threshold_uncertainty_score":0.9999307},"labels":[],"label_agreement":null},{"id":"W6930018813","doi":"10.5281/zenodo.11724447","title":"Iso 10855 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Submarine pipeline; Certification; Service (business); Permission; Standardization; Production (economics); Data format","score_opus":0.02602882517890883,"score_gpt":0.25343979408794437,"score_spread":0.22741096890903553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930018813","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.43936e-7,0.00060161366,0.29879698,0.00045894465,0.00020504657,0.00020047817,0.000034885823,0.0058387653,0.69386303],"genre_scores_gemma":[0.00028738304,0.00045914334,0.0201389,0.00027977081,0.00038003255,5.198663e-8,0.00044210287,0.006880702,0.9711319],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981493,0.00021719141,0.00022353214,0.00069200364,0.00037549535,0.0003424782],"domain_scores_gemma":[0.9986385,0.000010237195,0.00013430082,0.0008945227,0.0001785401,0.00014391636],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037604076,0.00022698093,0.00020025682,0.000600452,0.00056094216,0.0017582589,0.0026303213,0.00017059452,0.044578847],"category_scores_gemma":[0.00013712596,0.00023782607,0.00008080446,0.0007432594,0.00009171833,0.00012924548,0.0023909274,0.0003812539,0.18459114],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010337027,0.000033207758,1.8314884e-8,0.00007118885,0.000030541018,0.000017242159,0.00017795518,0.000017718274,0.00001337099,0.009346776,0.94665277,0.04363819],"study_design_scores_gemma":[0.00010037742,0.00007717104,6.0082385e-7,0.00014171026,0.000008393817,0.000067547226,0.00000975927,0.0072239563,0.00002805101,0.0006958068,0.99139,0.0002566617],"about_ca_topic_score_codex":0.000015064242,"about_ca_topic_score_gemma":1.8573917e-7,"teacher_disagreement_score":0.27865806,"about_ca_system_score_codex":0.00008546156,"about_ca_system_score_gemma":0.0000032580876,"threshold_uncertainty_score":0.999278},"labels":[],"label_agreement":null},{"id":"W6930218671","doi":"10.5281/zenodo.12061344","title":"Ul 2272 pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Work (physics); Subpoena; Limiting; Filter (signal processing)","score_opus":0.026106190528443294,"score_gpt":0.25253380752108134,"score_spread":0.22642761699263805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930218671","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.506977e-7,0.0003551591,0.3229292,0.00035905148,0.00020738477,0.00019851304,0.000032420394,0.005731805,0.6701861],"genre_scores_gemma":[0.0004239201,0.00031064995,0.023245603,0.0002583733,0.00040711544,5.2631663e-8,0.0005676184,0.0070495326,0.96773714],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813414,0.0002202054,0.0002240153,0.00069353223,0.00038325205,0.00034486683],"domain_scores_gemma":[0.9986286,0.000010431889,0.00013388493,0.0008901922,0.00019036923,0.00014652857],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043607102,0.00022596805,0.00020033897,0.0006043906,0.00055618945,0.00173315,0.0026418352,0.00016908317,0.027887858],"category_scores_gemma":[0.00014180838,0.00023573128,0.0000798952,0.0007486454,0.00009019719,0.00012985374,0.0023991265,0.00038346386,0.14286852],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014674881,0.000029978128,2.7367044e-8,0.000072539915,0.000031298372,0.000018867036,0.00015702906,0.000022362763,0.000020751138,0.014357051,0.95499885,0.03028977],"study_design_scores_gemma":[0.00010250611,0.00007543809,0.0000012225315,0.00014906956,0.000008437728,0.00007042074,0.0000084434105,0.0032266874,0.000050443206,0.00096366537,0.9950881,0.00025553803],"about_ca_topic_score_codex":0.00001411226,"about_ca_topic_score_gemma":1.5336505e-7,"teacher_disagreement_score":0.2996836,"about_ca_system_score_codex":0.00008996851,"about_ca_system_score_gemma":0.0000053446806,"threshold_uncertainty_score":0.99930316},"labels":[],"label_agreement":null},{"id":"W6930651493","doi":"10.5281/zenodo.14090974","title":"Artifact of \"Scalar Interpolation: A Better Balance Between Vector and Scalar Execution for SuperScalar Architectures\"","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Artifact (error); Scalar (mathematics); Image (mathematics); Scripting language; Image processing","score_opus":0.023422351049686485,"score_gpt":0.25260041833006386,"score_spread":0.22917806728037737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930651493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01943851,0.00022332255,0.9749444,0.0016646801,0.000081170176,0.00037711038,0.000078320554,0.0011897187,0.0020027307],"genre_scores_gemma":[0.96762156,0.000025871821,0.03156336,0.00009016796,0.00012839255,1.7123389e-7,0.00022513526,0.00026380134,0.00008155623],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986117,0.00018356559,0.00027570446,0.00044647497,0.00023568481,0.00024686972],"domain_scores_gemma":[0.9991305,0.00008755442,0.00006625574,0.0003489789,0.00026291073,0.00010378507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060183695,0.00013277911,0.00016594723,0.00027381137,0.000578258,0.0006814894,0.00073366676,0.000069569134,0.00016401448],"category_scores_gemma":[0.00021798564,0.0001304206,0.000066147026,0.000474181,0.0001139525,0.00025901452,0.00060630444,0.00018414619,0.0001075837],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011514135,0.0001939779,0.00027869135,0.0009995182,0.00027823096,0.000018468698,0.0072429525,0.0010373909,0.024083432,0.061383005,0.11258841,0.79178077],"study_design_scores_gemma":[0.0006070595,0.00069292175,0.0034970052,0.00030637797,0.000035517158,0.00009662706,0.00004723975,0.43998393,0.008979635,0.0059316736,0.5393664,0.00045556916],"about_ca_topic_score_codex":0.0000037113139,"about_ca_topic_score_gemma":4.8933956e-8,"teacher_disagreement_score":0.94818306,"about_ca_system_score_codex":0.000047390102,"about_ca_system_score_gemma":0.0000053146223,"threshold_uncertainty_score":0.65716183},"labels":[],"label_agreement":null},{"id":"W6930978000","doi":"10.5281/zenodo.16671149","title":"nipype/pydra: 1.0a2","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Guard (computer science); Task (project management); State (computer science); Value (mathematics)","score_opus":0.02301139513314772,"score_gpt":0.24983240220225622,"score_spread":0.22682100706910852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930978000","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6415455e-7,0.00016732645,0.4356281,0.0003320208,0.00013319234,0.00019730725,0.00004005365,0.0046567307,0.55884504],"genre_scores_gemma":[0.00095488643,0.0006474295,0.057004806,0.0006758019,0.0004090368,8.897866e-8,0.0012282291,0.0065197647,0.93255997],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980943,0.00029244178,0.00023963515,0.0006593836,0.00035752353,0.00035670312],"domain_scores_gemma":[0.9983175,0.000019603694,0.00018201959,0.0010287823,0.0003244205,0.00012768955],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004086309,0.00023099568,0.00023319371,0.0006573501,0.0009821277,0.0011164161,0.0031915747,0.00018823068,0.007881964],"category_scores_gemma":[0.00027474234,0.00025049452,0.00007562155,0.00081360113,0.00009196277,0.00013367196,0.0026824418,0.00033604258,0.0064920164],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002203382,0.0000423212,1.1444773e-7,0.000042975174,0.000028716735,0.000007444357,0.00007693103,0.0000443595,0.000013200799,0.025858559,0.8966145,0.07726871],"study_design_scores_gemma":[0.0001733099,0.00006261473,0.0000057885686,0.00012324135,0.000007339715,0.00002333391,0.0000063815505,0.003210031,0.00006331196,0.00055524637,0.9955234,0.00024601052],"about_ca_topic_score_codex":0.000033645683,"about_ca_topic_score_gemma":2.3516698e-7,"teacher_disagreement_score":0.37862328,"about_ca_system_score_codex":0.00009820404,"about_ca_system_score_gemma":0.000011971207,"threshold_uncertainty_score":0.99999475},"labels":[],"label_agreement":null},{"id":"W6931053210","doi":"10.5281/zenodo.3659794","title":"Fig. 9 in A revision of the genus Rudolfina Roháček (Sphaeroceridae: Limosininae)","year":2020,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Dorsum; Genus; Scale (ratio); Terminalia; Key (lock)","score_opus":0.028328913118634405,"score_gpt":0.24802229343781534,"score_spread":0.21969338031918095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931053210","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037085858,0.0006568639,0.2605732,0.0018287011,0.00022254376,0.0008585212,0.00008342711,0.0024035673,0.7333361],"genre_scores_gemma":[0.24011184,0.014576732,0.31321567,0.0053438367,0.0022871892,7.120264e-7,0.003047086,0.04603571,0.3753812],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808013,0.00041177947,0.00033320623,0.0005057031,0.0004096349,0.00025955483],"domain_scores_gemma":[0.9985704,0.000017557286,0.00032974643,0.0008308106,0.00016178773,0.000089740955],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00039357995,0.00019183426,0.0002613957,0.0002855543,0.00040255298,0.00032931933,0.003138506,0.00013433874,0.0018042299],"category_scores_gemma":[0.000423597,0.0001688616,0.00008057614,0.0012170546,0.00010436662,0.000102018115,0.002718202,0.0003597968,0.0008042858],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007829729,0.000053221323,0.0000017105054,0.00011026367,0.000013190685,0.000008061036,0.0005245998,0.00013390995,0.000035814388,0.0036174073,0.87982875,0.11566523],"study_design_scores_gemma":[0.00021424572,0.00009743076,0.000050088725,0.00031060335,0.0000048191773,0.000020657872,0.000010987205,0.0050629703,0.00013996275,0.000067256515,0.9938523,0.00016867288],"about_ca_topic_score_codex":0.00003192237,"about_ca_topic_score_gemma":4.484658e-7,"teacher_disagreement_score":0.35795486,"about_ca_system_score_codex":0.00007495497,"about_ca_system_score_gemma":0.00001116472,"threshold_uncertainty_score":0.9999737},"labels":[],"label_agreement":null},{"id":"W6931086222","doi":"10.5281/zenodo.15635315","title":"Cercyon (Cercyon) praetextatus","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Statistical analysis; Deposition (geology)","score_opus":0.04573648752647792,"score_gpt":0.24961055816885502,"score_spread":0.20387407064237711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931086222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007101805,0.000080342594,0.88163877,0.0045289006,0.00007490962,0.00025469298,0.00001751713,0.004528631,0.10816605],"genre_scores_gemma":[0.9253562,0.00015477183,0.06866264,0.0031544808,0.00032858903,7.1107515e-8,0.00043045252,0.0012638774,0.00064888864],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982364,0.000284796,0.0002442684,0.0005330412,0.00034778574,0.00035371617],"domain_scores_gemma":[0.99869764,0.000022643293,0.00010628747,0.0005049063,0.0003932231,0.0002752858],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003854589,0.00014496894,0.00014431794,0.00013585063,0.0014094608,0.0011574072,0.002197395,0.00006265645,0.0014417545],"category_scores_gemma":[0.0003685034,0.00015531873,0.00005708721,0.0008627205,0.00007282081,0.00047433464,0.0018909893,0.00026213157,0.005460612],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037891332,0.00013253765,0.000003574975,0.00006790945,0.000038554932,0.000032379914,0.0032916225,0.002140119,0.002558951,0.060217187,0.5741464,0.3573329],"study_design_scores_gemma":[0.00028091096,0.00026138002,0.00011989955,0.000014199871,0.000003748475,0.000047231162,0.000045221354,0.04946374,0.0012725603,0.00039930324,0.9478832,0.00020860731],"about_ca_topic_score_codex":0.0000046550385,"about_ca_topic_score_gemma":2.6949063e-8,"teacher_disagreement_score":0.924646,"about_ca_system_score_codex":0.00006903624,"about_ca_system_score_gemma":0.0000053175345,"threshold_uncertainty_score":0.99989057},"labels":[],"label_agreement":null},{"id":"W6931295122","doi":"10.5281/zenodo.5719224","title":"Supplementary Figure and Table","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Table (database); Table of contents; Chitinase","score_opus":0.024895692439072532,"score_gpt":0.24782314614691542,"score_spread":0.2229274537078429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931295122","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035242201,0.00065581594,0.26783964,0.00061299466,0.00010120379,0.00025653234,0.00025478745,0.0017638345,0.7285117],"genre_scores_gemma":[0.0015560113,0.002891835,0.18038088,0.0013651141,0.000740196,1.7907436e-7,0.02098202,0.012027686,0.78005606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986014,0.00020517215,0.0001580983,0.0005216176,0.0002497171,0.0002640465],"domain_scores_gemma":[0.9990126,0.0000112530615,0.000111700705,0.00058228127,0.0001644672,0.00011773622],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027521813,0.00016198843,0.00016791519,0.00026162685,0.0007551883,0.000989416,0.0012506313,0.000104715444,0.040557284],"category_scores_gemma":[0.0000842934,0.00017835954,0.000029839854,0.00044278157,0.00006471237,0.000077325974,0.0021631052,0.00021637112,0.0003964615],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012028903,0.000029093166,4.9700583e-7,0.000053597654,0.000023479563,0.000012857835,0.0001089555,0.000014269139,0.000043636042,0.0047662,0.9690177,0.02592852],"study_design_scores_gemma":[0.00016683659,0.00005759014,0.000006774579,0.00008991616,0.000005114745,0.00006106969,0.000016716253,0.0021170473,0.00008255131,0.00012607584,0.99708176,0.00018855643],"about_ca_topic_score_codex":0.000052804942,"about_ca_topic_score_gemma":6.234077e-7,"teacher_disagreement_score":0.08745875,"about_ca_system_score_codex":0.00004653865,"about_ca_system_score_gemma":0.0000052646305,"threshold_uncertainty_score":0.96031976},"labels":[],"label_agreement":null},{"id":"W6931440070","doi":"10.5281/zenodo.5089338","title":"FIGURE 3. Cryphalus mangiferae Stebbing, 1914. A in New records and taxonomic notes on Cryphalus Erichson, 1836 in Hawaiʻi (Coleoptera: Curculionidae: Scolytinae)","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Line drawings; Feature (linguistics); Quarter (Canadian coin); Taxonomy (biology)","score_opus":0.03272969227605968,"score_gpt":0.25425389060139386,"score_spread":0.22152419832533418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931440070","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011493397,0.001735302,0.17922385,0.0013377259,0.00036100016,0.0014207875,0.00004514434,0.0023610236,0.81236583],"genre_scores_gemma":[0.1983398,0.00892211,0.20481871,0.0031429797,0.002195683,0.0000040068217,0.0033889106,0.01882262,0.5603652],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970235,0.0005356991,0.0004636265,0.0010751195,0.0003747522,0.0005273079],"domain_scores_gemma":[0.99846,0.000060959715,0.0002861059,0.00082625094,0.0001523815,0.0002142791],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006042763,0.0003880958,0.0004498308,0.0011507241,0.0004586831,0.0012461533,0.0015998443,0.00025675772,0.0040456643],"category_scores_gemma":[0.00041066724,0.00043246645,0.00006949436,0.0012485844,0.00008973681,0.00019456785,0.0016284646,0.00061723625,0.00079233147],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048707683,0.00029632385,0.00014293691,0.0002157202,0.000049488543,0.00021894008,0.0008935242,0.0012075666,0.000055025102,0.007129973,0.805408,0.18433377],"study_design_scores_gemma":[0.0008876308,0.0002474711,0.0010696824,0.0008446732,0.0000059025783,0.00006335622,0.000022424356,0.011102841,0.000064892614,0.00013784952,0.9850603,0.0004929752],"about_ca_topic_score_codex":0.00062567345,"about_ca_topic_score_gemma":0.00005092683,"teacher_disagreement_score":0.25200066,"about_ca_system_score_codex":0.00029144014,"about_ca_system_score_gemma":0.000042721535,"threshold_uncertainty_score":0.9999857},"labels":[],"label_agreement":null},{"id":"W6931513516","doi":"10.5683/sp3/yb9k8v","title":"Canadian Income Survey, 2020","year":2023,"lang":"en","type":"dataset","venue":"Borealis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Statistics Canada","funders":"","keywords":"Metropolitan area; Government (linguistics); Census; Household income; Raw data; Survey data collection; Benchmarking; Family income; Income tax","score_opus":0.020653436893160612,"score_gpt":0.27151941607941404,"score_spread":0.2508659791862534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931513516","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.269109e-7,0.00004438269,0.013947759,0.00048144872,0.00036345673,0.0001297235,0.984113,0.0005780795,0.00034206238],"genre_scores_gemma":[0.0000023116265,0.000272946,0.0040453104,0.00050125533,0.00013122108,0.000018530094,0.9947349,0.000018140248,0.00027540087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983043,0.00020061608,0.00028179135,0.00050167553,0.0002915892,0.00042003635],"domain_scores_gemma":[0.9978904,0.00015399943,0.00013518952,0.001365702,0.00014042467,0.00031426526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007097188,0.00024123066,0.00028535936,0.00039600168,0.000163247,0.00029655758,0.0024625387,0.0002911679,0.000007961868],"category_scores_gemma":[0.00024588272,0.0002469711,0.00007028234,0.0007613413,0.000024282013,0.00010243898,0.00043247303,0.0002991295,0.00040500643],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.2584162e-7,0.000004621181,0.000032391366,0.000011124572,0.000012369712,0.00007027891,0.0000060552775,0.00014520623,6.1811183e-9,0.00006194633,0.99937505,0.00028051663],"study_design_scores_gemma":[0.000043752025,0.000021186293,0.0034204796,0.000035364956,0.00000432108,0.000006882562,3.1250545e-7,0.0037564964,7.967516e-7,0.0002781657,0.9921403,0.00029197693],"about_ca_topic_score_codex":0.9825722,"about_ca_topic_score_gemma":0.97037905,"teacher_disagreement_score":0.012193165,"about_ca_system_score_codex":0.00019416379,"about_ca_system_score_gemma":0.0007201527,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W6931744129","doi":"10.5683/sp3/bnsn4y","title":"Labour Force Survey, March 2016 [Canada] [Rebased 2025]","year":2016,"lang":"en","type":"dataset","venue":"Borealis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Unemployment; Current Population Survey; Government (linguistics); Population; Wage; Descriptive statistics; Minimum wage; Discouraged worker","score_opus":0.01984059220498157,"score_gpt":0.2687347735150934,"score_spread":0.24889418131011182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931744129","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3893364e-7,0.00013378225,0.1821953,0.0006677048,0.0002955702,0.00018641037,0.81579506,0.00022709036,0.00049884146],"genre_scores_gemma":[0.0000055052146,0.00045154188,0.006783346,0.0011774636,0.00020321144,0.000029957766,0.9879578,0.000021729462,0.0033694955],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99721295,0.00040780441,0.00044792297,0.0007332134,0.0006486028,0.00054952706],"domain_scores_gemma":[0.9966714,0.00044810804,0.0003242822,0.0020182966,0.00033106504,0.00020688254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086889416,0.00038335944,0.0004353794,0.00020906556,0.00017838641,0.00020447448,0.0030128916,0.00027645077,0.00007126],"category_scores_gemma":[0.00028245084,0.00030846757,0.00008873981,0.00034274746,0.00005214689,0.00016220383,0.0006739453,0.00028598154,0.000022368866],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057962625,0.000018550003,0.000010820776,0.000027471615,0.000023479211,0.00002849394,0.0000019328584,0.000023797416,5.028786e-7,0.00029448338,0.99836326,0.001201399],"study_design_scores_gemma":[0.00019049915,0.000036639594,0.000911472,0.000109591725,0.000006596167,0.000005630124,2.8416767e-7,0.0006115973,0.00003258184,0.00031425589,0.9973421,0.0004387514],"about_ca_topic_score_codex":0.8937867,"about_ca_topic_score_gemma":0.7846563,"teacher_disagreement_score":0.17541197,"about_ca_system_score_codex":0.00020249975,"about_ca_system_score_gemma":0.0016518813,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W6932051143","doi":"10.5683/sp3/w6hb5d","title":"Internet Data Library System (IDLS)","year":2006,"lang":"en","type":"dataset","venue":"Borealis","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Variety (cybernetics); The Internet; Presentation (obstetrics); Product (mathematics); Information system","score_opus":0.0330798920860249,"score_gpt":0.2585334123998906,"score_spread":0.22545352031386567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6932051143","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5643503e-8,0.00021446233,0.23154481,0.000103988015,0.00022120075,0.00012785375,0.76332355,0.001279112,0.0031850007],"genre_scores_gemma":[0.0000027731282,0.000070127375,0.052282073,0.0002923994,0.0003346794,0.000012565726,0.9465465,0.000020189638,0.0004386869],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796844,0.00014114067,0.00043109298,0.00083472935,0.00033813692,0.00028647413],"domain_scores_gemma":[0.99525714,0.000070583716,0.00030329608,0.004237884,0.000038018417,0.00009309625],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.000238815,0.00030424853,0.00035357897,0.00023746124,0.000066743916,0.0006231935,0.0077916537,0.00027946426,0.000009752396],"category_scores_gemma":[0.000024273708,0.00028269907,0.000064517444,0.0002735785,0.00003617283,0.0006798111,0.0035311861,0.00028949673,0.00004393138],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012947652,0.000025807736,0.0000026867865,0.000091034155,0.00001649551,0.000061748855,0.0000040411783,0.00005592271,2.04337e-8,0.0011772579,0.997935,0.000628696],"study_design_scores_gemma":[0.000068304464,0.00002177014,0.000013792991,0.00017990646,0.000015289435,0.000031102834,7.6825825e-7,0.05188069,0.000012476845,0.00006629391,0.9474153,0.0002943131],"about_ca_topic_score_codex":0.017675966,"about_ca_topic_score_gemma":0.0003640012,"teacher_disagreement_score":0.18322296,"about_ca_system_score_codex":0.000038749396,"about_ca_system_score_gemma":0.00014229651,"threshold_uncertainty_score":0.9999625},"labels":[],"label_agreement":null},{"id":"W6949212883","doi":"10.5281/zenodo.12042658","title":"toxic femininity pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Femininity; Feminism; Power (physics); Pariah group; Appeal; Order (exchange); Masculinity","score_opus":0.03206878399960659,"score_gpt":0.26008460474402945,"score_spread":0.22801582074442286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949212883","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.5709013e-7,0.0002832376,0.26270777,0.00025556606,0.00022058343,0.0002051573,0.000033346336,0.0058342894,0.7304592],"genre_scores_gemma":[0.0009698618,0.00029066394,0.023890233,0.00026551177,0.00042089564,6.2979915e-8,0.0005858223,0.0067558694,0.9668211],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998152,0.00023851487,0.00022459733,0.0006800274,0.0003686624,0.00033619892],"domain_scores_gemma":[0.99862844,0.000012872527,0.00014143213,0.0008923081,0.00017137709,0.00015354855],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004962643,0.00022419276,0.00020498366,0.0005433701,0.0005791332,0.0015767798,0.0025845023,0.00017854695,0.025180995],"category_scores_gemma":[0.00018172736,0.0002357707,0.0000777589,0.00073822454,0.00009634941,0.00012180951,0.002478958,0.00040929174,0.11133043],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019200575,0.000035077934,3.1376324e-8,0.00007092147,0.000029294974,0.000016972499,0.00018993132,0.000013112177,0.000021932516,0.008690568,0.95880944,0.032120816],"study_design_scores_gemma":[0.000099221084,0.00008698872,0.000002459861,0.0001438297,0.000008338742,0.000066978806,0.000010958393,0.0025845517,0.00006326727,0.00070815056,0.99597263,0.00025263222],"about_ca_topic_score_codex":0.000011241545,"about_ca_topic_score_gemma":1.4900905e-7,"teacher_disagreement_score":0.23881753,"about_ca_system_score_codex":0.00009331719,"about_ca_system_score_gemma":0.000006084927,"threshold_uncertainty_score":0.9994597},"labels":[],"label_agreement":null},{"id":"W6950407456","doi":"10.5281/zenodo.8192913","title":"156 Hours of Labeled Power Consumption Dataset of Computer","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ground truth; Power consumption; Python (programming language); Spurious relationship; Offset (computer science)","score_opus":0.04718754379963328,"score_gpt":0.27947595390849994,"score_spread":0.23228841010886667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6950407456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0312626,0.00003846923,0.96087974,0.00031209903,0.0001391305,0.00031842676,0.0006058149,0.0021174354,0.004326305],"genre_scores_gemma":[0.9430806,0.00016598031,0.050831843,0.00015510367,0.00005157765,4.5809315e-8,0.0050735446,0.00048553356,0.0001557477],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998703,0.00022588717,0.0002946498,0.00027847575,0.0002961741,0.0002018351],"domain_scores_gemma":[0.99876386,0.00003860839,0.00017941238,0.00055126473,0.00039661347,0.000070244474],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007399728,0.00008745267,0.00014411632,0.000322565,0.00037783873,0.00016934019,0.0013248789,0.000043532014,0.00056428264],"category_scores_gemma":[0.00012849164,0.00009168386,0.0000350909,0.0008145791,0.00011207014,0.00023363346,0.0014205279,0.000104650666,0.0011272668],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032296844,0.00020111035,0.00006393149,0.0001175966,0.000058956026,0.000011432252,0.001360365,0.0040711886,0.005264285,0.020768367,0.9114735,0.056576982],"study_design_scores_gemma":[0.0014141937,0.0009248055,0.006281509,0.00018142306,0.000018239587,0.00008733343,0.000069548136,0.19182311,0.013251239,0.00089237466,0.7845349,0.00052137004],"about_ca_topic_score_codex":0.000005178962,"about_ca_topic_score_gemma":3.6429537e-8,"teacher_disagreement_score":0.911818,"about_ca_system_score_codex":0.000024545772,"about_ca_system_score_gemma":0.000003675106,"threshold_uncertainty_score":0.9996505},"labels":[],"label_agreement":null},{"id":"W6955573897","doi":"10.58066/w0m6-cd56","title":"Prison news service - No. 26","year":2023,"lang":"en","type":"article","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Prison; Mohawk; Government (linguistics); Indigenous; Resistance (ecology); Dominion; Dignity; Power (physics); National security; White (mutation)","score_opus":0.03222764780869499,"score_gpt":0.27996150239962597,"score_spread":0.24773385459093097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6955573897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6922108,0.00050715555,0.22542696,0.0036521712,0.0014152518,0.00070295983,0.0000018661214,0.005381735,0.070701115],"genre_scores_gemma":[0.9198348,0.00059257,0.044079643,0.000041920637,0.00035721218,0.0000014316287,0.000009918389,0.000032085147,0.03505045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982582,0.00039613547,0.000110822875,0.00038380869,0.00051240704,0.00033866617],"domain_scores_gemma":[0.9984544,0.00029625726,0.000086231084,0.00034943683,0.0006532971,0.00016036782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085759046,0.00009180119,0.0001587723,0.0003156024,0.00096416177,0.00013269833,0.00074802106,0.0001045882,0.000011463444],"category_scores_gemma":[0.00012734161,0.000110450215,0.000039797666,0.0012756413,0.00009660026,0.00034386857,0.0006556951,0.00052850205,0.00018334728],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010530066,0.0012423557,0.18916886,0.002313309,0.0007318406,0.0019703393,0.10764224,0.048690077,0.084588915,0.025114303,0.41108415,0.1264006],"study_design_scores_gemma":[0.0009972817,0.001187742,0.026260916,0.00022608732,0.000009665393,0.00002598954,0.0027413946,0.5809591,0.0011178604,0.0010455435,0.3849253,0.0005031599],"about_ca_topic_score_codex":0.00070520875,"about_ca_topic_score_gemma":0.00001824803,"teacher_disagreement_score":0.532269,"about_ca_system_score_codex":0.00004790552,"about_ca_system_score_gemma":0.00011029786,"threshold_uncertainty_score":0.74156505},"labels":[],"label_agreement":null},{"id":"W6957815890","doi":"10.6068/dp14ba8d788af45","title":"Most Recent Data (2003). Statistics Canada. CANSIM: Science and Technology - Research and Development | Country: Canada | Table: Survey of innovation, selected service industries, percentage of business units using methods to protect their intellectual property | Variable: Method of protection, registration of design patterns, Internet service providers, Non-innovative business units | Units: %, 2003. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-182.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic statistics; Official statistics; Census; The Internet; Service (business); Publication; Business statistics; Big data; Statistical analysis","score_opus":0.14421088769113016,"score_gpt":0.32954916488763697,"score_spread":0.1853382771965068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957815890","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.6573716e-7,0.00007301918,0.40373024,0.000009601771,0.00007909008,0.00145021,0.5946112,0.000030026313,0.000015912157],"genre_scores_gemma":[0.000007852079,0.00008124896,0.16066574,0.00005864029,0.000010054706,0.000023640292,0.83902556,0.00005273643,0.00007453364],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99404514,0.001556389,0.0014611115,0.0012178012,0.0012304797,0.0004891035],"domain_scores_gemma":[0.740953,0.0005847162,0.0014283851,0.002183795,0.2547218,0.000128311],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008023494,0.00044719758,0.000859719,0.0007211436,0.00016038027,0.00016150123,0.0038284466,0.00035394897,0.000020926522],"category_scores_gemma":[0.05073616,0.0003791212,7.930996e-9,0.16088326,0.00038108844,0.0005141373,0.0029236719,0.0006832305,1.3957096e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011002709,0.00006248212,0.000021894,0.001245389,0.000109826644,0.000005397384,0.00003335072,0.00024292237,0.00029792052,0.000099024415,0.9953509,0.0024208785],"study_design_scores_gemma":[0.00027664742,0.00011323922,0.000015321953,0.0003259985,0.000023234361,0.00005038098,0.00023491542,0.13749462,0.00014466225,8.461903e-8,0.8609736,0.00034727372],"about_ca_topic_score_codex":0.9981018,"about_ca_topic_score_gemma":0.95548064,"teacher_disagreement_score":0.34607995,"about_ca_system_score_codex":0.00031586902,"about_ca_system_score_gemma":0.34639582,"threshold_uncertainty_score":0.99986607},"labels":[],"label_agreement":null},{"id":"W6957929902","doi":"10.60692/1vsc4-jjz49","title":"The number of tree species on Earth","year":2022,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University; Lakehead University","funders":"","keywords":"Biome; Species richness; Biodiversity; Global biodiversity; Tree (set theory); Vulnerability (computing); Endemism; Distribution (mathematics)","score_opus":0.027079079742542093,"score_gpt":0.21711861521658996,"score_spread":0.19003953547404787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957929902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030868609,0.000001940366,0.869795,0.0001933425,0.0005191694,0.00022832745,0.000017079394,0.00056036806,0.09781615],"genre_scores_gemma":[0.9944617,1.1014128e-7,0.0042840955,0.00011363872,0.000016959686,0.00003244616,0.0000020724726,0.0000025810557,0.0010863512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989869,0.000099954275,0.00034356312,0.00008154611,0.00036423476,0.00012381795],"domain_scores_gemma":[0.9991804,0.000019162178,0.0002582399,0.00043333406,0.00008454118,0.000024346162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044273472,0.00007549862,0.00009667705,0.00008744699,0.0004236767,0.00014867222,0.00059394207,0.00001744054,0.00001086861],"category_scores_gemma":[0.000009522911,0.000052783744,0.000050397142,0.00028785729,0.000019246792,0.00025900075,0.00022427159,0.000078452,0.000108563145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013153843,0.000017748738,0.065437496,0.00018746662,0.00010389843,0.000005922476,0.1662039,0.073768035,0.0000029818,0.669017,0.0086734425,0.01645057],"study_design_scores_gemma":[0.0019241348,0.0004317892,0.081557214,0.00013880974,0.000015241422,0.00021614143,0.015709898,0.8082034,0.0050799325,0.00013626069,0.08576223,0.0008249191],"about_ca_topic_score_codex":0.0000015894019,"about_ca_topic_score_gemma":2.2896566e-8,"teacher_disagreement_score":0.9635931,"about_ca_system_score_codex":0.000037639154,"about_ca_system_score_gemma":0.000024385745,"threshold_uncertainty_score":0.32586214},"labels":[],"label_agreement":null},{"id":"W6958163281","doi":"10.60692/4evda-x3c13","title":"Fast matrix multiplication via compiler‐only layered data reorganization and intrinsic lowering","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Code (set theory); Subroutine; Task (project management); Matrix multiplication; Matrix (chemical analysis); Kernel (algebra); Intrinsics; Modular design; Code generation","score_opus":0.03505876196169128,"score_gpt":0.2455975891745945,"score_spread":0.21053882721290323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958163281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034201633,0.0000031755505,0.96227705,0.00012537322,0.00022483245,0.00031400062,0.000029649927,0.002471047,0.00035324288],"genre_scores_gemma":[0.97534066,0.0000013913682,0.024264822,0.000064690306,0.000049690727,0.000013607403,0.0001933351,0.0000102669455,0.00006153052],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865943,0.000055100885,0.00052383967,0.00029586896,0.0002571961,0.00020854239],"domain_scores_gemma":[0.99841183,0.00001567861,0.0003023976,0.0009864442,0.00020697381,0.00007669017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528545,0.00015410359,0.00017037004,0.00040103498,0.00023888664,0.0004792108,0.0007585772,0.000088810055,0.0000017346889],"category_scores_gemma":[0.000036294732,0.0001486741,0.000018401877,0.00095931196,0.000019345376,0.0018918787,0.000740104,0.00008174042,0.00043919415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013171574,0.00003302383,0.40168962,0.0029087947,0.00028147383,0.000030248066,0.24344306,0.12570909,0.00020234752,0.018714173,0.011483046,0.19537342],"study_design_scores_gemma":[0.00037359732,0.00001787598,0.026791763,0.00007130642,0.0000048390984,0.00004924154,0.00037642772,0.9714969,0.00032626218,0.0000072410994,0.00029196995,0.00019256673],"about_ca_topic_score_codex":0.00000649712,"about_ca_topic_score_gemma":1.4325778e-7,"teacher_disagreement_score":0.94113904,"about_ca_system_score_codex":0.000056793466,"about_ca_system_score_gemma":0.000033938828,"threshold_uncertainty_score":0.6062753},"labels":[],"label_agreement":null},{"id":"W6958164496","doi":"10.60692/8ghah-d6137","title":"Observation of the 1S–2P Lyman-α transition in antihydrogen","year":2018,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of British Columbia; University of Victoria; Simon Fraser University; University of Calgary","funders":"","keywords":"Antihydrogen; Antimatter; Atomic clock; CPT symmetry; Laser; Excited state; Spectroscopy; Field (mathematics)","score_opus":0.03258875963917076,"score_gpt":0.21625441625634587,"score_spread":0.1836656566171751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958164496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37866607,7.948736e-7,0.6195294,0.00009262998,0.0001549543,0.00016361791,0.0000031942068,0.00016114085,0.0012281383],"genre_scores_gemma":[0.9903507,7.687558e-8,0.009400509,0.00018437242,0.000028507637,0.000011106146,0.0000025649183,0.000002749087,0.000019366698],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989949,0.000081951075,0.00047337427,0.000102558224,0.0002243443,0.00012287553],"domain_scores_gemma":[0.99911493,0.0000045279694,0.00026521288,0.00039959935,0.00019509041,0.000020635664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003809699,0.000085640095,0.00011759747,0.00017457019,0.0000923416,0.00007979584,0.00044813685,0.00006527344,0.0000018228508],"category_scores_gemma":[0.000010087317,0.00006279689,0.000045949564,0.00060009037,0.00003142064,0.00085509935,0.000066808025,0.000046892746,0.0000405445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078049896,0.000024116058,0.32242575,0.0008020666,0.00005955228,0.000002082722,0.6063795,0.03295048,0.00015987425,0.028742585,0.00080445973,0.007571469],"study_design_scores_gemma":[0.0005660352,0.000054778884,0.10386388,0.00026437695,0.000004740534,0.000013719603,0.00071446353,0.8719036,0.022287821,0.000035632078,0.00012335149,0.00016760806],"about_ca_topic_score_codex":0.000013396107,"about_ca_topic_score_gemma":3.5112208e-7,"teacher_disagreement_score":0.83895314,"about_ca_system_score_codex":0.000051553732,"about_ca_system_score_gemma":0.00003205548,"threshold_uncertainty_score":0.25607827},"labels":[],"label_agreement":null},{"id":"W6958370788","doi":"10.6084/m9.figshare.26987950.v1","title":"Additional file 1 of Divergent migration routes reveal contrasting energy-minimization strategies to deal with differing resource predictability","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Windsor; Fisheries and Oceans Canada","funders":"","keywords":"Predictability; Resource (disambiguation); Resource allocation; Economic model; Variation (astronomy)","score_opus":0.016181839071649357,"score_gpt":0.22263575959815118,"score_spread":0.20645392052650183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958370788","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000534111,0.000034578632,0.15117076,0.000069079746,0.000011415617,0.000121724326,0.84668446,0.0006248661,0.0012297122],"genre_scores_gemma":[0.09135741,6.951505e-7,0.17875156,0.00009191774,0.0001450496,0.0006162399,0.72866887,0.000019035291,0.00034922617],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990629,0.0000472437,0.00020469601,0.00030411806,0.00023884294,0.00014221753],"domain_scores_gemma":[0.9988114,0.00073151296,0.00007919084,0.00016249096,0.0001550651,0.000060315233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000028473347,0.00011277732,0.00011076388,0.00009401513,0.00009165234,0.00020887218,0.0002616872,0.000046414723,0.20736805],"category_scores_gemma":[0.0002615409,0.00009931202,0.000034303634,0.00036580898,0.0000069891485,0.0003498654,0.000141995,0.00006738723,0.000022095513],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041073577,0.0000127621515,0.0000061932196,0.000059060043,0.000009300557,0.0000027275212,0.00021263958,0.010054176,0.000007370868,0.00016740755,0.98469985,0.004764434],"study_design_scores_gemma":[0.000069302165,0.00019039509,0.004205981,0.0045118127,0.0000047053354,0.000010375086,0.000045429428,0.5654154,0.00087052985,0.00016688669,0.4242562,0.00025298048],"about_ca_topic_score_codex":0.0000075956405,"about_ca_topic_score_gemma":0.000011795466,"teacher_disagreement_score":0.56044364,"about_ca_system_score_codex":0.00003930935,"about_ca_system_score_gemma":0.00013437553,"threshold_uncertainty_score":0.79335654},"labels":[],"label_agreement":null},{"id":"W6958526558","doi":"10.6084/m9.figshare.17089025.v2","title":"Evaluating stability of human spine in static tasks: a combined <i>in vivo</i>-computational study","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre Intégré Universitaire de Santé et de Services Sociaux du Centre-Sud-de-l'Île-de-Montréal; Institut de recherche Robert-Sauvé en santé et en sécurité du travail","funders":"","keywords":"Trunk; Stiffness; Muscle stiffness; Kinematics; Electromyography; Moment (physics); Stability (learning theory); Biomechanics","score_opus":0.08346569387910456,"score_gpt":0.3738289861530489,"score_spread":0.2903632922739443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958526558","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034469215,0.00003842725,0.00023680404,0.000016610704,0.00004053315,0.0011454351,0.9980325,0.00011059637,0.00003439304],"genre_scores_gemma":[0.0027679577,7.777184e-7,0.005476064,0.00007262676,0.000011793537,0.0004893061,0.9911618,0.000012901519,0.0000067375245],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965254,0.0007196717,0.00094160036,0.0007114962,0.00081871345,0.00028311418],"domain_scores_gemma":[0.9979403,0.00035878122,0.0005937296,0.00086873694,0.00018754021,0.00005091177],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088098197,0.00028361884,0.00055371807,0.0005210972,0.00010793225,0.00008529073,0.001658274,0.00009492173,0.09430242],"category_scores_gemma":[0.00093067216,0.00032191895,0.000075944896,0.0010611067,0.000009868144,0.0001682665,0.0011957156,0.0005376006,0.0000128389875],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057338357,0.00085599866,0.000046874833,0.00031538255,0.00001157711,0.00003076391,0.00033951216,0.060928468,0.0000019506958,0.0000066163593,0.9372783,0.00017887497],"study_design_scores_gemma":[0.006960375,0.006495373,0.008502472,0.0047496827,0.000040475894,0.000010702583,0.00032708913,0.90262026,0.00012035609,0.0024933028,0.0653387,0.0023412183],"about_ca_topic_score_codex":0.00020098234,"about_ca_topic_score_gemma":0.00020112384,"teacher_disagreement_score":0.87193954,"about_ca_system_score_codex":0.00021197404,"about_ca_system_score_gemma":0.0003846665,"threshold_uncertainty_score":0.9999233},"labels":[],"label_agreement":null},{"id":"W6965190402","doi":"10.34943/1757a949-b670-41af-b940-581698795a19","title":"British Columbia North Coast Drifter Buoy Deployed 2015-02-19","year":2018,"lang":"en","type":"dataset","venue":"Ocean Networks Canada Society","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Drifter; Buoy; Mooring; Nautical mile; Latitude; Pacific ocean; Sea surface temperature","score_opus":0.005634775218464167,"score_gpt":0.20229028343604183,"score_spread":0.19665550821757766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6965190402","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000821677,0.0006449616,0.21039398,0.00024387176,0.002310269,0.0005134842,0.7850277,0.00077655487,0.0000070337337],"genre_scores_gemma":[0.0004838607,0.0014093068,0.022447245,0.008219889,0.0013235856,0.000018228418,0.96482867,0.00007228858,0.0011969327],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99645466,0.00015785373,0.00060937135,0.001079188,0.0007880847,0.0009108685],"domain_scores_gemma":[0.9971545,0.00013137725,0.00047875918,0.0014280152,0.00032599183,0.00048137308],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003718365,0.00043630067,0.0005968523,0.00002373778,0.0006503858,0.0014591989,0.0025914954,0.00053416064,0.000040806015],"category_scores_gemma":[0.000034417008,0.00066474715,0.00029437253,0.0006662503,0.00018156118,0.00020898163,0.00086157746,0.0009065885,3.8636566e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010338271,0.000029363331,0.00047299528,0.000036114772,0.00009097975,0.0000619133,0.000018378267,0.005024483,4.691699e-9,6.673795e-7,0.993821,0.00044305032],"study_design_scores_gemma":[0.00022549993,0.00004690978,0.0002955413,0.000109563254,0.000035514837,0.00006056154,0.0000044747812,0.07063316,1.0838436e-7,0.000017476435,0.92789483,0.0006763588],"about_ca_topic_score_codex":0.9163938,"about_ca_topic_score_gemma":0.991714,"teacher_disagreement_score":0.18794672,"about_ca_system_score_codex":0.00044937263,"about_ca_system_score_gemma":0.0018374474,"threshold_uncertainty_score":0.9995804},"labels":[],"label_agreement":null},{"id":"W6976653309","doi":"10.60692/58t0e-fe489","title":"Fast matrix multiplication via compiler‐only layered data reorganization and intrinsic lowering","year":2023,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); University of Alberta","funders":"","keywords":"Code (set theory); Subroutine; Task (project management); Matrix multiplication; Matrix (chemical analysis); Kernel (algebra); Intrinsics; Modular design; Code generation","score_opus":0.03505876196169128,"score_gpt":0.2455975891745945,"score_spread":0.21053882721290323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976653309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034201633,0.0000031755505,0.96227705,0.00012537322,0.00022483245,0.00031400062,0.000029649927,0.002471047,0.00035324288],"genre_scores_gemma":[0.97534066,0.0000013913682,0.024264822,0.000064690306,0.000049690727,0.000013607403,0.0001933351,0.0000102669455,0.00006153052],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865943,0.000055100885,0.00052383967,0.00029586896,0.0002571961,0.00020854239],"domain_scores_gemma":[0.99841183,0.00001567861,0.0003023976,0.0009864442,0.00020697381,0.00007669017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000528545,0.00015410359,0.00017037004,0.00040103498,0.00023888664,0.0004792108,0.0007585772,0.000088810055,0.0000017346889],"category_scores_gemma":[0.000036294732,0.0001486741,0.000018401877,0.00095931196,0.000019345376,0.0018918787,0.000740104,0.00008174042,0.00043919415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013171574,0.00003302383,0.40168962,0.0029087947,0.00028147383,0.000030248066,0.24344306,0.12570909,0.00020234752,0.018714173,0.011483046,0.19537342],"study_design_scores_gemma":[0.00037359732,0.00001787598,0.026791763,0.00007130642,0.0000048390984,0.00004924154,0.00037642772,0.9714969,0.00032626218,0.0000072410994,0.00029196995,0.00019256673],"about_ca_topic_score_codex":0.00000649712,"about_ca_topic_score_gemma":1.4325778e-7,"teacher_disagreement_score":0.94113904,"about_ca_system_score_codex":0.000056793466,"about_ca_system_score_gemma":0.000033938828,"threshold_uncertainty_score":0.6062753},"labels":[],"label_agreement":null},{"id":"W6977734212","doi":"10.6084/m9.figshare.29429660.v1","title":"<b>Acceptance of entomophagy among Canadians: Insights from Visitors to the Montreal Insectarium</b>","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Consumption (sociology); Openness to experience; Sustainability; Cricket; Logistic regression; Variety (cybernetics); Public health; Ordered logit","score_opus":0.010334808851721312,"score_gpt":0.23597424501145406,"score_spread":0.22563943615973275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977734212","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000034133013,0.0006135878,0.0012203776,0.00006870995,0.00031256894,0.00038830139,0.99662757,0.0001560753,0.0006094112],"genre_scores_gemma":[0.0004008474,0.000017110475,0.0013824378,0.0004840153,0.00017884924,0.00014883181,0.99719983,0.0000074087643,0.00018065295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982605,0.00015784966,0.00036916492,0.0005924771,0.00035718924,0.00026280046],"domain_scores_gemma":[0.9974201,0.00034422314,0.00027625106,0.001584098,0.0002290672,0.00014631193],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000046374982,0.00029660214,0.00035921065,0.0002968,0.00014069265,0.00021251573,0.0036934747,0.0002633213,0.0019877066],"category_scores_gemma":[0.00051287893,0.00024000007,0.00011477667,0.0008015607,0.000009961088,0.00016798482,0.00085494656,0.00035727705,0.00007748947],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021227108,0.000014632988,0.0000011645584,0.000055589728,0.000029660185,0.000016050744,0.00011810144,0.0011886177,2.455761e-7,0.0000090183285,0.9979266,0.00063817436],"study_design_scores_gemma":[0.00008177791,0.000034653574,0.0007277741,0.001975694,0.000012830375,5.6101715e-7,0.0000050305275,0.0044257906,0.00015536857,0.0000764458,0.99222094,0.00028310812],"about_ca_topic_score_codex":0.04255179,"about_ca_topic_score_gemma":0.03666083,"teacher_disagreement_score":0.0058909566,"about_ca_system_score_codex":0.000104419334,"about_ca_system_score_gemma":0.00042060917,"threshold_uncertainty_score":0.9989246},"labels":[],"label_agreement":null},{"id":"W6980579835","doi":"","title":"Coastal Collaboration: How Co-Governance Strategies and Community-based Conservation Frameworks Can Strengthen Social Equity and Tackle the Issue of Anthropogenic Marine Debris on the BC Coast","year":2023,"lang":"en","type":"other","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stewardship (theology); Indigenous; Marine debris; Marine conservation; Environmental stewardship; Marine protected area; Equity (law); Marine pollution","score_opus":0.03673787728199683,"score_gpt":0.30326973052226336,"score_spread":0.2665318532402665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980579835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55703706,0.0028039997,0.1373679,0.12027062,0.002203054,0.005852041,0.00058445666,0.0037459857,0.17013492],"genre_scores_gemma":[0.9758529,0.00074750726,0.0021423425,0.000059263362,0.00018314994,0.000002498142,0.00003537779,0.00006894721,0.020908035],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99753994,0.0013839527,0.00010708191,0.00024159368,0.0005400991,0.00018733263],"domain_scores_gemma":[0.99779874,0.001185395,0.00031689493,0.0003167826,0.0003262024,0.00005599718],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011749896,0.00014166912,0.00023461824,0.00011308201,0.0018918328,0.00035271593,0.00057581277,0.00025277096,0.000017069542],"category_scores_gemma":[0.00015125012,0.00012351562,0.000029935245,0.00042547693,0.0010057695,0.00013843356,0.00074127095,0.0014242182,5.969178e-7],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010973191,0.0009722751,0.04683428,0.002756098,0.0011923866,0.00015242536,0.08302737,0.0033571783,0.0014108091,0.0688664,0.75016975,0.0401637],"study_design_scores_gemma":[0.0043246923,0.006886924,0.0761498,0.002142445,0.00016676025,0.000027244208,0.11245962,0.1711335,0.0013423907,0.0035783537,0.6199039,0.0018843383],"about_ca_topic_score_codex":0.008278274,"about_ca_topic_score_gemma":0.0043403395,"teacher_disagreement_score":0.41881585,"about_ca_system_score_codex":0.000042204807,"about_ca_system_score_gemma":0.00028953166,"threshold_uncertainty_score":0.9994076},"labels":[],"label_agreement":null},{"id":"W6981715192","doi":"","title":"Exploiting parallelism of irregular problems and performance evaluation on heterogeneous multi-core architectures","year":2012,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multi-core processor; Locality; Symmetric multiprocessor system; Data parallelism; Parallelism (grammar); IBM; Computation; Homogeneous; CUDA; Task parallelism","score_opus":0.041022472909442595,"score_gpt":0.24360637805852292,"score_spread":0.2025839051490803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6981715192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9407437,0.00052904896,0.05754046,0.000048967,0.00014755875,0.00042166826,0.000003254463,0.00012959889,0.00043575434],"genre_scores_gemma":[0.9562671,0.00014982239,0.04333163,0.0000081190765,0.000022892104,0.000001659581,0.000057226072,0.000013869559,0.0001476318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876034,0.000095981435,0.00015487858,0.00034780538,0.00044063438,0.00020035249],"domain_scores_gemma":[0.9987674,0.00004448006,0.00050133077,0.0003735987,0.00025213417,0.000061094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036014308,0.00020783734,0.00029892646,0.00030666217,0.0001906179,0.000020448308,0.00050151104,0.00017815555,0.0000020130117],"category_scores_gemma":[0.000020603034,0.00024542166,0.00008508454,0.00016973421,0.00005960701,0.00014736319,0.0001180322,0.00019130202,0.0000028621762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004979607,0.0010149893,0.031940274,0.003477688,0.00053217425,0.00002409501,0.031919673,0.5538048,0.004628965,0.0019758255,0.00070383906,0.36947972],"study_design_scores_gemma":[0.0008342268,0.00038982573,0.23368812,0.0008550502,0.00009996378,0.000010568599,0.0010431185,0.758753,0.003401231,0.000265686,0.0001619705,0.00049721944],"about_ca_topic_score_codex":0.00019259538,"about_ca_topic_score_gemma":0.0032674992,"teacher_disagreement_score":0.3689825,"about_ca_system_score_codex":0.00005000161,"about_ca_system_score_gemma":0.00004902433,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W6989741960","doi":"","title":"Cache line reservation: exploring a scheme for cache-friendly object allocation","year":2009,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Cache; Cache algorithms; Cache invalidation; Scheme (mathematics); Cache coloring; Overhead (engineering); Reservation; Cache pollution; Object (grammar)","score_opus":0.054019236046151435,"score_gpt":0.2870341486077637,"score_spread":0.23301491256161228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989741960","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72251344,0.003860797,0.08228015,0.0015059415,0.011284,0.012598122,0.0010146833,0.01895372,0.14598912],"genre_scores_gemma":[0.47206622,0.0005824711,0.51096964,0.0007400359,0.0003440002,0.0015520662,0.0029463437,0.00028047853,0.010518785],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99471647,0.0003258277,0.0012972163,0.0017557887,0.0009984726,0.00090620044],"domain_scores_gemma":[0.995305,0.00034171934,0.0009692983,0.0016117343,0.0014584638,0.00031377084],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0017986995,0.00088067935,0.0008088791,0.0007605753,0.0015748176,0.00039975965,0.0023040392,0.0007990279,0.000013803307],"category_scores_gemma":[0.0013632386,0.0010002196,0.00043210617,0.0014660454,0.00003223,0.0023770537,0.00023858745,0.0012059627,0.000050890532],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036709275,0.0007017581,0.000026451808,0.0007972199,0.00035537328,0.00004609225,0.00013439351,0.005399582,0.018109182,0.41709507,0.00039480848,0.556573],"study_design_scores_gemma":[0.004547383,0.002671882,0.0013259496,0.0028174163,0.00036757792,0.000079542464,0.0003709859,0.13750482,0.47043857,0.12146915,0.2515164,0.0068903244],"about_ca_topic_score_codex":0.00015207559,"about_ca_topic_score_gemma":0.00030455244,"teacher_disagreement_score":0.5496827,"about_ca_system_score_codex":0.00071029796,"about_ca_system_score_gemma":0.00019414625,"threshold_uncertainty_score":0.999725},"labels":[],"label_agreement":null},{"id":"W69956373","doi":"10.1007/978-3-642-38236-9_18","title":"On the Sublinear Processor Gap for Parallel Architectures","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Sublinear function; Computer science; Parallel computing; Lemma (botany); Parallel algorithm; Parallelism (grammar); Architecture; Analysis of parallel algorithms; Algorithm; Discrete mathematics; Mathematics","score_opus":0.02870829396250173,"score_gpt":0.26674835929370133,"score_spread":0.2380400653311996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69956373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031901214,0.00021099014,0.9882962,0.0043736,0.0005980867,0.0012840326,0.0000046567616,0.00045700316,0.004743528],"genre_scores_gemma":[0.036974285,0.000027240827,0.95472497,0.006204405,0.0004743085,0.00014192385,0.000006501422,0.000054041255,0.0013923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651057,0.000047995058,0.0005005913,0.0014152153,0.00082565576,0.0006999614],"domain_scores_gemma":[0.9959444,0.0016486788,0.00035444743,0.001510456,0.00040676584,0.00013530026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010137907,0.00057135493,0.00046356395,0.0006345853,0.00050721096,0.00090082025,0.004778638,0.0002881171,0.00002781747],"category_scores_gemma":[0.00035480273,0.00037946927,0.00018307785,0.00049197546,0.0005559061,0.00019239676,0.00079497386,0.00079393265,0.000053147494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015383803,0.00004336558,0.0000035627213,0.00005419879,0.000016588618,0.0000076718425,0.00053346856,0.43066725,0.00001441779,0.30424097,0.0017088392,0.26269427],"study_design_scores_gemma":[0.00012893346,0.00018137378,0.000005991705,0.00015611522,0.0000027940334,0.000011794336,4.0048537e-8,0.58024037,0.00042163927,0.41690668,0.0016011273,0.00034313198],"about_ca_topic_score_codex":0.00000956574,"about_ca_topic_score_gemma":0.000009486112,"teacher_disagreement_score":0.26235116,"about_ca_system_score_codex":0.0001236817,"about_ca_system_score_gemma":0.00040904875,"threshold_uncertainty_score":0.9998657},"labels":[],"label_agreement":null},{"id":"W6999534413","doi":"","title":"Design of an Architectural Model for the Coffee Processor Using ArchC","year":2010,"lang":"en","type":"dissertation","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Set (abstract data type); Software; Notice; Documentation; Architecture; Core (optical fiber); Software architecture; Core model","score_opus":0.03882715431936031,"score_gpt":0.2847868448700184,"score_spread":0.24595969055065806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999534413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005475573,0.00022225222,0.98973054,0.0009664112,0.000650194,0.0011273551,0.000023892875,0.00043572512,0.0013680601],"genre_scores_gemma":[0.6174855,0.000022792834,0.3815074,0.000055427456,0.00020356654,0.00026988413,0.00018360854,0.00004743289,0.00022434849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996826,0.00027331724,0.0007758204,0.0008278849,0.0007302009,0.0005668086],"domain_scores_gemma":[0.9964453,0.00050502265,0.0008703355,0.0009652497,0.00098716,0.0002269182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009653318,0.0005010282,0.00053029845,0.0004725102,0.0008388555,0.00033449486,0.002251548,0.0006734701,0.0000022722788],"category_scores_gemma":[0.00043405432,0.00040607498,0.00023520051,0.00054134656,0.000024256846,0.00044989827,0.0001653888,0.00086231367,5.240607e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054523034,0.0005293782,0.000005260399,0.00045454712,0.00022268633,0.000015831876,0.008577798,0.30530402,0.01154742,0.65460044,0.00017212347,0.018025273],"study_design_scores_gemma":[0.00046813735,0.00009556296,0.00006579721,0.00015656104,0.00008254302,0.00028295055,0.00007174327,0.97855914,0.0062671737,0.0032912248,0.010184081,0.00047509017],"about_ca_topic_score_codex":0.000001400258,"about_ca_topic_score_gemma":0.00007894925,"teacher_disagreement_score":0.67325515,"about_ca_system_score_codex":0.00017281342,"about_ca_system_score_gemma":0.0014429941,"threshold_uncertainty_score":0.9998391},"labels":[],"label_agreement":null},{"id":"W7000149987","doi":"","title":"Efficient JIT compilation of MATLAB loops","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"MATLAB; Interpreter; Compiler; Scripting language; Fortran; Just-in-time compilation; Dataflow; Software; Code (set theory)","score_opus":0.013015435453268089,"score_gpt":0.24273818053321428,"score_spread":0.2297227450799462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000149987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7034359,0.0005509392,0.015301172,0.00006880909,0.0043151523,0.0019901597,0.00052837894,0.0038029996,0.2700065],"genre_scores_gemma":[0.93886375,0.00004790119,0.057272837,0.00014442884,0.000038426893,0.000046887595,0.00053524546,0.00009678886,0.0029537375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99564314,0.00042863164,0.0011841565,0.0011480986,0.0010306471,0.00056533515],"domain_scores_gemma":[0.9960281,0.00026273142,0.0012644264,0.0013854856,0.00083560974,0.00022360407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011817702,0.00064310135,0.000838721,0.0006787076,0.00065952475,0.00014329501,0.001929539,0.0006509921,0.000043791126],"category_scores_gemma":[0.00036068299,0.0006897489,0.00034044136,0.0009896746,0.00005292418,0.00028329427,0.00030160736,0.00086088094,0.00016536647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119591714,0.0006120392,0.000038383645,0.0008703257,0.00020088958,0.000033488894,0.00005204853,0.06094832,0.0113877235,0.7023208,0.00011621168,0.22330019],"study_design_scores_gemma":[0.0032948013,0.0011064342,0.005294403,0.0033871157,0.0003657699,0.0000724874,0.00011174703,0.42726436,0.40911233,0.08350374,0.060927883,0.0055589257],"about_ca_topic_score_codex":0.000088506815,"about_ca_topic_score_gemma":0.000056853933,"teacher_disagreement_score":0.61881703,"about_ca_system_score_codex":0.00028538532,"about_ca_system_score_gemma":0.000070011636,"threshold_uncertainty_score":0.99955535},"labels":[],"label_agreement":null},{"id":"W7000453708","doi":"","title":"Fast Sparse Matrix Reordering on GPU for Cholesky Based Solvers","year":2024,"lang":"en","type":"other","venue":"eScholarship (California Digital Library)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cholesky decomposition; Speedup; Implementation; Sparse matrix; Graph; Minimum degree algorithm; Reduction (mathematics); CUDA; Matrix (chemical analysis)","score_opus":0.01606751837522267,"score_gpt":0.24318904352014917,"score_spread":0.2271215251449265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000453708","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000097644,0.00058680744,0.56675744,0.0008567817,0.0006297855,0.00078408484,0.002139357,0.007464338,0.42077163],"genre_scores_gemma":[0.004488062,0.00005913081,0.32422113,0.002135565,0.0008581559,0.00019644538,0.001352087,0.0018690181,0.6648204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99715793,0.000058544592,0.0004843256,0.0012036116,0.00046087024,0.00063471624],"domain_scores_gemma":[0.99817246,0.00013583608,0.00027548528,0.0010990346,0.000031219362,0.00028598114],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019815394,0.0006657241,0.000522351,0.00083558896,0.00010596452,0.0035145949,0.0018068098,0.0004677953,0.00021905794],"category_scores_gemma":[0.00011093536,0.00063879945,0.0003975503,0.0006671534,0.000069272246,0.0010953253,0.00050794065,0.0006538877,0.003764842],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003346799,0.00012917543,0.00007399532,0.0003784254,0.00007216427,0.000047095607,0.0000114764935,0.0007073786,0.000005623799,0.011320381,0.9782319,0.008988892],"study_design_scores_gemma":[0.00039012966,0.0001327182,0.0000026489527,0.0010277064,0.000016144226,0.0000043220316,0.0000019386862,0.022002634,0.0006206275,0.0055273646,0.9695118,0.00076193427],"about_ca_topic_score_codex":0.0000021331275,"about_ca_topic_score_gemma":5.2247594e-7,"teacher_disagreement_score":0.24404877,"about_ca_system_score_codex":0.000056374174,"about_ca_system_score_gemma":0.00018552654,"threshold_uncertainty_score":0.9996063},"labels":[],"label_agreement":null},{"id":"W7001191164","doi":"","title":"Improving power of L1 data cache and register file utilizing critical path instructions","year":2015,"lang":"en","type":"dissertation","venue":"Knowledge Commons (Lakehead University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Lakehead University","keywords":"Power (physics); Limiting; Nucleofection; Reliability (semiconductor); Hyporeflexia; Voltage","score_opus":0.053797927444426956,"score_gpt":0.29741770443380755,"score_spread":0.2436197769893806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001191164","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02160861,0.003593166,0.42252284,0.00031125773,0.0027476694,0.00073485466,0.0012700382,0.0014978307,0.5457137],"genre_scores_gemma":[0.90153843,0.000017939688,0.07501545,0.0000069490866,0.00011566179,0.000003673315,0.002700776,0.00007100257,0.020530138],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836296,0.00019104457,0.00029655237,0.0006806887,0.00019969285,0.00026908267],"domain_scores_gemma":[0.9972241,0.0002817627,0.00023341159,0.00146383,0.0006163976,0.00018051117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026073205,0.00026656373,0.00039579396,0.0006081975,0.00030721247,0.00011673128,0.0018786426,0.000301361,0.000031990516],"category_scores_gemma":[0.0003930574,0.00031050306,0.0000710762,0.00076042,0.00015391975,0.0006925774,0.001143122,0.00044171623,0.0000073312426],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022464637,0.0013715052,0.0022408694,0.0018754243,0.00036511238,0.00026452373,0.021588158,0.000056564502,0.00033582593,0.36195102,0.43416163,0.17556472],"study_design_scores_gemma":[0.0027903202,0.0008536569,0.009747421,0.0035518317,0.00060277054,0.00017931733,0.0054369313,0.15376309,0.0006613805,0.005299008,0.81347543,0.0036388345],"about_ca_topic_score_codex":0.000093366994,"about_ca_topic_score_gemma":0.005357046,"teacher_disagreement_score":0.8799298,"about_ca_system_score_codex":0.00010188624,"about_ca_system_score_gemma":0.0005146188,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W7001998175","doi":"","title":"Methodologies for Researching Cultural Diversity in Education : International Perspectives","year":2014,"lang":"en","type":"other","venue":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cultural diversity; Agency (philosophy); Diversity (politics); Cultural competence; Ethnic group; Educational research; Work (physics)","score_opus":0.0490484537480222,"score_gpt":0.29876299988817534,"score_spread":0.24971454614015315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001998175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006159902,0.0006532345,0.7207596,0.000842335,0.0007397479,0.00089459843,0.0001308121,0.00035242233,0.2694674],"genre_scores_gemma":[0.5471078,0.0017106715,0.38350347,0.000024438576,0.00028146445,0.0000010578616,0.00008523249,0.000054889595,0.06723094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978203,0.0003417426,0.00026368076,0.0007021169,0.0005837327,0.00028841724],"domain_scores_gemma":[0.9978528,0.00024653404,0.000664214,0.0006195593,0.00051670277,0.00010020422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072274555,0.00029898883,0.0004655374,0.0005127424,0.0009060388,0.000060333678,0.003064174,0.00034772215,0.00005812085],"category_scores_gemma":[0.00011419443,0.00032981244,0.00031552868,0.00037449755,0.0012387371,0.0005572626,0.0010276858,0.00047553598,0.0000057206034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060697924,0.0013372989,0.0018312712,0.0007240014,0.0010267798,0.00015226894,0.019929752,0.010307268,0.0023175788,0.868506,0.07345739,0.019803397],"study_design_scores_gemma":[0.014501937,0.003038953,0.07840976,0.009612813,0.0010943463,0.00055080804,0.3007182,0.08285073,0.0033472413,0.070604034,0.42781398,0.0074571874],"about_ca_topic_score_codex":0.003258791,"about_ca_topic_score_gemma":0.0005546683,"teacher_disagreement_score":0.797902,"about_ca_system_score_codex":0.00032485553,"about_ca_system_score_gemma":0.0009915424,"threshold_uncertainty_score":0.9999154},"labels":[],"label_agreement":null},{"id":"W7009313114","doi":"","title":"DFEMwork: a parallel computing framework for material processing","year":2008,"lang":"en","type":"article","venue":"NPARC","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Parallel processing; Data processing; Key (lock); Parallel algorithm; Concurrent computing","score_opus":0.03182085169541007,"score_gpt":0.28677758794918606,"score_spread":0.254956736253776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7009313114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045842873,0.000031527026,0.99052876,0.0005657365,0.0002777972,0.00022656676,0.0000013614334,0.001049877,0.0027340758],"genre_scores_gemma":[0.39115864,0.0000069408447,0.6082836,0.0002807062,0.00017299622,0.000013826427,0.0000027246817,0.000009983726,0.000070626746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877864,0.000040556675,0.00026010204,0.0003703979,0.00018660033,0.00036372323],"domain_scores_gemma":[0.999233,0.000112260925,0.00013697242,0.0003248933,0.00011677751,0.000076108416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022535611,0.00014685445,0.00019169843,0.00007743234,0.0005005792,0.00015828223,0.00069075066,0.00010451047,0.000013172357],"category_scores_gemma":[0.00007997019,0.00014310025,0.000068473295,0.0002702158,0.00005303989,0.00021381238,0.00019219151,0.000121936486,0.000009182078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012662636,0.00037613648,0.0011712697,0.00021182696,0.000052101932,0.00006308604,0.007637595,0.023151793,0.0024173534,0.6422804,0.037611663,0.28490016],"study_design_scores_gemma":[0.00031861116,0.00009415096,0.00031257205,0.00011241654,0.000003773471,0.00006553569,0.000009833783,0.8527999,0.0028465774,0.14002223,0.0030754479,0.0003389562],"about_ca_topic_score_codex":0.000001592304,"about_ca_topic_score_gemma":9.561718e-8,"teacher_disagreement_score":0.8296481,"about_ca_system_score_codex":0.000026008667,"about_ca_system_score_gemma":0.00008333629,"threshold_uncertainty_score":0.58354586},"labels":[],"label_agreement":null},{"id":"W7011363500","doi":"","title":"“A love-hate relationship”: Canadian laypeople’s construction of academic theories as diffusing innovations","year":2015,"lang":"en","type":"dissertation","venue":"Oxford University Research Archive (ORA) (University of Oxford)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Popularity; Conceptual framework; Strict constructionism; Feeling; Qualitative research; Social constructionism; Perception; Order (exchange)","score_opus":0.030165412573878714,"score_gpt":0.2880491220252575,"score_spread":0.2578837094513788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011363500","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22641061,0.00016288953,0.29745463,0.0017902299,0.0004951985,0.001289655,0.0005103009,0.0003503975,0.47153607],"genre_scores_gemma":[0.80024236,0.002104192,0.16744223,0.000029448742,0.00006600864,4.52294e-7,0.0018255853,0.00005327095,0.028236441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968604,0.0005893129,0.00032194267,0.0006456246,0.00095616834,0.00062656007],"domain_scores_gemma":[0.9957324,0.00048716436,0.0005875,0.00073211,0.0020402519,0.0004205389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011479089,0.0002923124,0.0005002546,0.0034700334,0.0009952034,0.000061654915,0.0024190994,0.00046706296,0.000064992535],"category_scores_gemma":[0.0004161128,0.00040464432,0.00017803661,0.0029947115,0.0007475587,0.0010707956,0.0005797522,0.0014931756,0.000015494576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033220425,0.0000814764,0.009120704,0.0002183591,0.00015344862,0.00006557979,0.01438916,0.0007361513,0.00015227389,0.96097213,0.0041005705,0.0096779475],"study_design_scores_gemma":[0.003140121,0.0011308666,0.03792274,0.0015687383,0.00022451473,0.00005891727,0.08632643,0.039874356,0.0004553856,0.6557433,0.17161292,0.0019417398],"about_ca_topic_score_codex":0.023098461,"about_ca_topic_score_gemma":0.043419644,"teacher_disagreement_score":0.57383174,"about_ca_system_score_codex":0.00057110394,"about_ca_system_score_gemma":0.004016571,"threshold_uncertainty_score":0.99984056},"labels":[],"label_agreement":null},{"id":"W7017210310","doi":"","title":"Algebraic Enhancements for Systolic Arrays","year":2024,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Deep learning; Workload; Field (mathematics); Systolic array; Point (geometry); Inference; Class (philosophy); Algebraic number; Range (aeronautics)","score_opus":0.013283652622630152,"score_gpt":0.23422150401054284,"score_spread":0.2209378513879127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017210310","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010748948,0.00025128512,0.669681,0.00006105648,0.0009770881,0.00040549017,0.000008907192,0.0007372198,0.32777047],"genre_scores_gemma":[0.0029172592,0.00006696248,0.06552826,0.00009739171,0.00011108034,0.000009369635,0.0002028841,0.00004551218,0.9310213],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983763,0.000052064992,0.00023243568,0.00074934115,0.00023743157,0.00035239363],"domain_scores_gemma":[0.99907345,0.00005039937,0.00019191267,0.00043437633,0.00015070013,0.00009915485],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000101038466,0.00033564575,0.0003217717,0.00036134923,0.00019108994,0.0002678964,0.0013186437,0.00026997557,0.0018783907],"category_scores_gemma":[0.000010664255,0.00038074685,0.00021409428,0.0006965416,0.00001819312,0.00030308354,0.0001677893,0.00024237389,0.00013593728],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120172524,0.00013795396,0.000013311362,0.0016895725,0.00043165372,0.00011690603,0.003411103,0.0011792057,0.0004939546,0.17721894,0.039876517,0.7753107],"study_design_scores_gemma":[0.0006756368,0.00021381446,0.000019996753,0.0008552901,0.00015761018,0.0000063042603,0.0004875941,0.075536035,0.004303196,0.0041399724,0.91261274,0.0009918294],"about_ca_topic_score_codex":0.000021044272,"about_ca_topic_score_gemma":0.00005457627,"teacher_disagreement_score":0.8727362,"about_ca_system_score_codex":0.00016694037,"about_ca_system_score_gemma":0.00015962371,"threshold_uncertainty_score":0.99986446},"labels":[],"label_agreement":null},{"id":"W7019723183","doi":"","title":"A High Performance DDR4 Memory Controller on FPGA","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada)","funders":"","keywords":"Memory controller; Field-programmable gate array; Controller (irrigation); Dram; Registered memory; Scheme (mathematics); Interleaved memory; Throughput; CAS latency","score_opus":0.008065297123549314,"score_gpt":0.19925024069927527,"score_spread":0.19118494357572596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7019723183","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827288,0.00025185102,0.0070996108,0.001309758,0.0012850492,0.0004362509,0.000012008777,0.0010974861,0.0057792077],"genre_scores_gemma":[0.3036174,0.00023944203,0.025728047,0.00007609811,0.00006184196,0.0000010499767,0.00010017497,0.000028074946,0.6701479],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986855,0.000054747627,0.0001405034,0.000515646,0.0003466965,0.00025693123],"domain_scores_gemma":[0.9990708,0.000039354738,0.00020364898,0.0004453842,0.00016781733,0.00007298396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001823344,0.0002548183,0.00039817533,0.00044170866,0.00018981867,0.00007162229,0.0010290295,0.00025134863,0.000038528684],"category_scores_gemma":[0.0000073220504,0.00027227867,0.00015550561,0.00031800597,0.000042246604,0.00024346945,0.00013242668,0.00034117987,0.00022035734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014747321,0.00081310276,0.00008803924,0.0034842447,0.0012949207,0.0005158091,0.4810034,0.06901589,0.0029822795,0.036646336,0.17144391,0.23123732],"study_design_scores_gemma":[0.0058453004,0.0031472289,0.006097898,0.005358386,0.0006033631,0.00002969593,0.03509663,0.8731639,0.052496895,0.0055723777,0.008348564,0.004239783],"about_ca_topic_score_codex":0.0030213308,"about_ca_topic_score_gemma":0.0005475293,"teacher_disagreement_score":0.80414796,"about_ca_system_score_codex":0.000080362355,"about_ca_system_score_gemma":0.00009112829,"threshold_uncertainty_score":0.99997294},"labels":[],"label_agreement":null},{"id":"W7023402456","doi":"","title":"Optical measurements of a free-surface granular flow","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Resources Canada; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Flow (mathematics); Context (archaeology); Limiting","score_opus":0.025304713913193642,"score_gpt":0.2569539309010073,"score_spread":0.23164921698781368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023402456","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42844597,0.00285703,0.009477835,0.00021427828,0.005633154,0.0036297096,0.0008516984,0.006075187,0.54281515],"genre_scores_gemma":[0.4657569,0.00020237933,0.53047127,0.00021325417,0.00005762369,0.00004848026,0.00029573764,0.00015091835,0.0028034698],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9945609,0.0003855918,0.0012598849,0.0013358402,0.0016988356,0.0007589341],"domain_scores_gemma":[0.99571455,0.00016152358,0.0007869777,0.0020382968,0.00094856805,0.00035010933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014602765,0.00078498176,0.0009489589,0.0004020115,0.0006330861,0.0001527254,0.0034822375,0.00082606194,0.000056372417],"category_scores_gemma":[0.000724116,0.00085355184,0.00046331334,0.000936645,0.00006256733,0.0008804408,0.00048211915,0.0011636462,0.000106221785],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003879264,0.0021174194,0.0001327656,0.0011951029,0.00085230364,0.00013508988,0.000093465766,0.04619921,0.09338352,0.24306634,0.00043319742,0.6120036],"study_design_scores_gemma":[0.0025289832,0.0005314097,0.0006213497,0.0014071638,0.00027249465,0.00004620204,0.000039091545,0.029178241,0.91112304,0.034933887,0.01640274,0.0029153873],"about_ca_topic_score_codex":0.000066910114,"about_ca_topic_score_gemma":0.0001368554,"teacher_disagreement_score":0.81773955,"about_ca_system_score_codex":0.00039279961,"about_ca_system_score_gemma":0.00011492191,"threshold_uncertainty_score":0.9993915},"labels":[],"label_agreement":null},{"id":"W7023452885","doi":"","title":"Os sentidos da educaçao escolar na metafora do desenvolvimento sustentavel do sertao semi-arido : o caso do povoado do Sao Bento","year":2003,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Ethnography; Perspective (graphical); Identity (music)","score_opus":0.005912070724780832,"score_gpt":0.17420883808765264,"score_spread":0.1682967673628718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023452885","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039135013,0.01973523,0.02802566,0.0049230526,0.003187977,0.0019414217,0.00062724383,0.00018735154,0.9374586],"genre_scores_gemma":[0.26448563,0.0022566707,0.062953025,0.0038077298,0.00047020116,0.00007505665,0.00007350115,0.0003947332,0.6654835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99167216,0.0005457539,0.0011346712,0.0015737071,0.0037187878,0.0013549053],"domain_scores_gemma":[0.99612594,0.00040220362,0.0009812613,0.0013660425,0.000011471939,0.0011131137],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00010974981,0.0011692545,0.0012066454,0.0002233024,0.0007048916,0.00093695574,0.0018262642,0.00027291395,0.0013128301],"category_scores_gemma":[0.000017913691,0.0012148325,0.00023528888,0.00056689885,0.00029799298,0.0010882431,0.0010165344,0.0007245088,3.0411297e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005173826,0.000916125,0.043266047,0.0025832953,0.00259254,0.001694468,0.0020621854,0.008987549,0.0035424805,0.62931824,0.24198407,0.062535614],"study_design_scores_gemma":[0.0018418953,0.0004142906,0.003403272,0.0027572187,0.00039141157,0.00022199651,0.0031017337,0.042183258,0.024092527,0.0036971192,0.9146216,0.003273685],"about_ca_topic_score_codex":0.013691485,"about_ca_topic_score_gemma":0.007512353,"teacher_disagreement_score":0.6726375,"about_ca_system_score_codex":0.00012663603,"about_ca_system_score_gemma":0.005495464,"threshold_uncertainty_score":0.9996001},"labels":[],"label_agreement":null},{"id":"W7023873349","doi":"","title":"Positive Accounting Information for Sustainable Development Decision-making Using Sustainability Financial Monetising Accounting System: An Empirical Study","year":2014,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Accounting information system; Sustainability; Social accounting; Sustainable development; Management accounting; Sustainability reporting; Environmental accounting; Financial accounting; Accounting management; Audit","score_opus":0.011233515564197636,"score_gpt":0.3073172164485308,"score_spread":0.29608370088433317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023873349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036843547,0.000030159696,0.9793952,0.000012708422,0.0002390662,0.0025764725,0.0000017838045,0.0017987586,0.012261511],"genre_scores_gemma":[0.26963234,4.9193756e-7,0.7278351,0.00016547123,0.0002747983,0.000101687256,0.000020842903,0.00013994848,0.0018292958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650776,0.00020912841,0.0010209584,0.0008080417,0.0006406276,0.0008134586],"domain_scores_gemma":[0.99633753,0.00036555843,0.0009770703,0.0007735237,0.0014498637,0.00009643718],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002644658,0.0005085673,0.00064588356,0.0010225477,0.00093325163,0.0015953039,0.0011906079,0.0003996804,0.000008756566],"category_scores_gemma":[0.0011345785,0.00050015666,0.0001059795,0.00073927746,0.00003354726,0.001890333,0.0008881381,0.00026586695,0.000006100041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034841534,0.0019458886,0.022656063,0.007940854,0.00045516875,0.00016816944,0.032099497,0.1491853,0.0000030466283,0.03505505,0.121475324,0.62866724],"study_design_scores_gemma":[0.0006751286,0.00021343742,0.0017464344,0.001061642,0.000043999065,0.000018267927,0.0039805304,0.97387135,0.00001592363,0.0009846052,0.016246798,0.0011418769],"about_ca_topic_score_codex":0.00032835966,"about_ca_topic_score_gemma":0.000039292183,"teacher_disagreement_score":0.82468605,"about_ca_system_score_codex":0.0012194926,"about_ca_system_score_gemma":0.0011221973,"threshold_uncertainty_score":0.999745},"labels":[],"label_agreement":null},{"id":"W7025368858","doi":"","title":"The war we won apart the untold story of two elite agents who became one of the most decorated couples of WWII","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Adversary; German; Elite; Spanish Civil War; Sacrifice; World War II; Resistance (ecology)","score_opus":0.02349456954300756,"score_gpt":0.27487849215264254,"score_spread":0.251383922609635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025368858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050541542,0.010170999,0.9207559,0.006816823,0.0007497852,0.0007710532,0.000021176504,0.0005766362,0.009596037],"genre_scores_gemma":[0.98411065,0.0022152804,0.010486659,0.00032391105,0.00003410087,0.000011268663,0.0000018849198,0.00001429452,0.0028019606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867415,0.00023083878,0.00036608445,0.0002033068,0.00036679782,0.00015882449],"domain_scores_gemma":[0.9983353,0.00046302463,0.00019910216,0.0007662705,0.00020992073,0.000026383708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794127,0.00011261092,0.00017957788,0.000058690897,0.00018565646,0.00005155931,0.0013698235,0.000041387182,0.000014908025],"category_scores_gemma":[0.00006671684,0.000054570686,0.000088811066,0.0008010725,0.00021323992,0.000107969594,0.00037558176,0.0001775293,0.00000448672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007491991,0.00065605395,0.0028526532,0.00057561405,0.00079177384,0.0000056268786,0.016116668,0.13454756,0.01627806,0.43485194,0.23349251,0.15975663],"study_design_scores_gemma":[0.00015614563,0.00007162198,0.0009933022,0.00039304057,0.000023004388,0.0000020539746,0.00010214946,0.9248359,0.05358312,0.002534866,0.017179154,0.00012561228],"about_ca_topic_score_codex":0.00012515091,"about_ca_topic_score_gemma":0.000044454788,"teacher_disagreement_score":0.9335691,"about_ca_system_score_codex":0.000019995672,"about_ca_system_score_gemma":0.00012928972,"threshold_uncertainty_score":0.25454956},"labels":[],"label_agreement":null},{"id":"W7027282955","doi":"","title":"CANADA : TRANSCANADA acquires 9 solar project for $470 million","year":2011,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics)","score_opus":0.02128523896192478,"score_gpt":0.24036266179039933,"score_spread":0.21907742282847456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027282955","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.5433946e-8,0.0002427902,0.67081064,0.00013010018,0.00031629606,0.00042476854,0.000025336076,0.00061290583,0.32743707],"genre_scores_gemma":[0.0001290311,0.0000902681,0.40903667,0.0007813607,0.00012719934,0.0000734323,0.000026927903,0.00014671593,0.5895884],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881136,0.00003491168,0.00018879598,0.00044689505,0.00021196832,0.0003060703],"domain_scores_gemma":[0.9992056,0.000032855085,0.00013003359,0.00051167764,0.00005295287,0.000066897344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010370358,0.00024372723,0.00025475223,0.00019838587,0.00007505252,0.000056140605,0.0010280309,0.00016435084,0.00017205725],"category_scores_gemma":[0.0000101368505,0.00021206544,0.00007404779,0.00018907593,0.000017704822,0.00005270142,0.00006186364,0.00007797662,0.0000027930098],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014627298,0.000008627726,0.0000015474185,0.000039633345,0.000021978049,0.0000025870731,0.00002748834,0.000011289831,9.952171e-7,0.0035386742,0.9913451,0.0050005885],"study_design_scores_gemma":[0.00013413749,0.00004280215,0.000002155067,0.00006136621,0.0000072613457,0.000002992521,0.0000022834765,0.011044944,0.0003671019,0.0001943762,0.98782754,0.00031301854],"about_ca_topic_score_codex":0.91694814,"about_ca_topic_score_gemma":0.91237426,"teacher_disagreement_score":0.26215133,"about_ca_system_score_codex":0.00007164634,"about_ca_system_score_gemma":0.0017191981,"threshold_uncertainty_score":0.86477774},"labels":[],"label_agreement":null},{"id":"W7027581431","doi":"","title":"Describing patterns of mastitis indicators during a clinical mastitis episode","year":2021,"lang":"en","type":"other","venue":"Epsilon Archive for Student Projects (University of Southampton)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mastitis; Somatic cell count; Milking; Lactate dehydrogenase; Statistical analysis","score_opus":0.03784321785010045,"score_gpt":0.2807961007156757,"score_spread":0.24295288286557523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027581431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008036408,0.00017223755,0.9677129,0.000054813,0.00036092557,0.0008617497,0.0003129812,0.00033889516,0.022149088],"genre_scores_gemma":[0.08353943,0.0008128827,0.8392719,0.000053235686,0.00015049917,0.000009563917,0.00027515605,0.00022513676,0.0756622],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99778885,0.00019415969,0.00042065303,0.000792466,0.00044323542,0.00036061107],"domain_scores_gemma":[0.9979817,0.00015519935,0.00094908744,0.0006618905,0.00009026856,0.0001618297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003175293,0.00030839726,0.0007558861,0.0009443339,0.00016648883,0.000035630306,0.0016062869,0.00021401171,0.0001903805],"category_scores_gemma":[0.00006630109,0.00038346532,0.00043533786,0.00037331766,0.00018557406,0.00009576699,0.001289521,0.00030099272,0.0000040739797],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003807965,0.0036925597,0.7780693,0.006022608,0.004467385,0.0007936255,0.049361914,0.001162218,0.00028422454,0.027363086,0.08020986,0.048192386],"study_design_scores_gemma":[0.041822422,0.009821221,0.5331164,0.06326579,0.0021730936,0.0002650794,0.024994897,0.056993604,0.0039668805,0.002339948,0.24684884,0.014391814],"about_ca_topic_score_codex":0.0007611487,"about_ca_topic_score_gemma":0.00049383653,"teacher_disagreement_score":0.24495292,"about_ca_system_score_codex":0.00004406521,"about_ca_system_score_gemma":0.00018792116,"threshold_uncertainty_score":0.9998617},"labels":[],"label_agreement":null},{"id":"W7028054552","doi":"","title":"Dynamic profiling and trace creation","year":2003,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Profiling (computer programming); TRACE (psycholinguistics); Code (set theory); Ideal (ethics); Dynamic programming","score_opus":0.011401744995029106,"score_gpt":0.2560923945950372,"score_spread":0.24469064960000808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028054552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6970679,0.0029871757,0.0066421903,0.00008237951,0.0029416655,0.0024533279,0.00022575512,0.0044664154,0.28313318],"genre_scores_gemma":[0.62820905,0.0010658704,0.34437823,0.00029498758,0.00002234199,0.00018250883,0.0005999488,0.00019472072,0.025052348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99656975,0.00034476706,0.0007119809,0.0012644,0.0005712363,0.0005378678],"domain_scores_gemma":[0.99785537,0.00015462496,0.0005653694,0.00081640645,0.00038024152,0.00022801592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008527472,0.00060778926,0.0005419371,0.0004807329,0.001030713,0.00031057512,0.0009203344,0.0006500666,0.00001653877],"category_scores_gemma":[0.00036911215,0.00067244394,0.00016507413,0.00068971387,0.000038422302,0.0010053421,0.00013462784,0.00096357986,0.00004633075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060483442,0.0002568764,0.000032232998,0.00051369134,0.00015147237,0.000056956545,0.00003723743,0.0013407427,0.015156924,0.52681094,0.000019257772,0.4555632],"study_design_scores_gemma":[0.003822417,0.0011198719,0.002308772,0.0027176419,0.0005081847,0.00043232902,0.0004042919,0.20584811,0.40613768,0.29107347,0.07682062,0.008806628],"about_ca_topic_score_codex":0.000036594873,"about_ca_topic_score_gemma":0.00006635388,"teacher_disagreement_score":0.44675657,"about_ca_system_score_codex":0.00032303485,"about_ca_system_score_gemma":0.000069155634,"threshold_uncertainty_score":0.9995727},"labels":[],"label_agreement":null},{"id":"W7030072960","doi":"","title":"Massachusetts Department of Children and Families quarterly profile (FY 2015, Quarter 1 (July 1, 2014 – September 30, 2014))","year":2014,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Population; Census","score_opus":0.0034057266521193954,"score_gpt":0.2010202393396988,"score_spread":0.1976145126875794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030072960","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072402637,0.03412377,0.14262088,0.0032618374,0.0019325727,0.008351756,0.0029583615,0.0123252245,0.7871853],"genre_scores_gemma":[0.032370802,0.008803014,0.1365675,0.0008666803,0.00081669027,0.0003514632,0.0027507439,0.0022351241,0.815238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9929184,0.0010414537,0.0017871549,0.0018750975,0.0009284943,0.0014494369],"domain_scores_gemma":[0.99483424,0.0002222552,0.0022067856,0.0022697556,0.00006332446,0.0004036635],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00036098843,0.0012891612,0.0017174619,0.0010661648,0.00018894587,0.000512427,0.0025024125,0.0005668226,0.0005555006],"category_scores_gemma":[0.00000464664,0.0012237502,0.0004276556,0.0005188921,0.00044232814,0.002407358,0.00061504816,0.0009054976,0.0001738359],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008781184,0.00020946909,0.002873717,0.0003682634,0.00058013183,0.00002591754,0.00038076835,0.000126031,0.00012950721,0.00044110557,0.9927599,0.0020174154],"study_design_scores_gemma":[0.003288446,0.0046154237,0.00518202,0.0012205916,0.00027826676,0.00020949394,0.000031728294,0.006882737,0.021131217,0.0072682793,0.9460256,0.003866185],"about_ca_topic_score_codex":0.000068263405,"about_ca_topic_score_gemma":0.0000036570736,"teacher_disagreement_score":0.04673425,"about_ca_system_score_codex":0.000048689784,"about_ca_system_score_gemma":0.00068539684,"threshold_uncertainty_score":0.999986},"labels":[],"label_agreement":null},{"id":"W7030386998","doi":"","title":"Nature's improvement : wildlife, conservation, and conflict in Quebec, 1850-1914","year":2007,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"McGill University","keywords":"Politics; Fishing; State (computer science); Estate; Spanish Civil War; Variety (cybernetics); Product (mathematics); Historiography","score_opus":0.011840173079257112,"score_gpt":0.2653175875040357,"score_spread":0.2534774144247786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030386998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.905658,0.0021743933,0.0013015157,0.000557517,0.003390526,0.0029239326,0.00022210945,0.0027488486,0.081023134],"genre_scores_gemma":[0.88772994,0.0014413266,0.072463624,0.0116781695,0.00011968557,0.00028334066,0.0011879731,0.00026633445,0.024829604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955242,0.00024230892,0.0011903737,0.0014670742,0.00081859506,0.00075744675],"domain_scores_gemma":[0.9970436,0.00033081806,0.000744003,0.000990427,0.00059544924,0.00029567335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001546839,0.00074626965,0.00073020585,0.00095613906,0.00066826085,0.0003734133,0.0013539555,0.0012766919,0.000018899167],"category_scores_gemma":[0.0005039786,0.0008317828,0.00016542993,0.0010990837,0.00006965162,0.0011309552,0.0003242646,0.0020412488,0.00002730851],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020162067,0.00050130533,0.00053654274,0.0006033976,0.00021563786,0.00019901794,0.00013242391,0.00033659802,0.0076997825,0.5589143,0.0006103747,0.43004897],"study_design_scores_gemma":[0.005251717,0.0008703485,0.020773044,0.00258913,0.00017206385,0.00008344893,0.00033352943,0.016808422,0.1368402,0.05308754,0.75683266,0.0063578747],"about_ca_topic_score_codex":0.0059006466,"about_ca_topic_score_gemma":0.017905489,"teacher_disagreement_score":0.7562223,"about_ca_system_score_codex":0.0005459294,"about_ca_system_score_gemma":0.00014694515,"threshold_uncertainty_score":0.9994133},"labels":[],"label_agreement":null},{"id":"W7031981593","doi":"","title":"Webinaire 2019","year":2019,"lang":"fr","type":"other","venue":"OpenEdition (OpenEdition)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Order (exchange); Closure (psychology); Subject (documents)","score_opus":0.016604719190002764,"score_gpt":0.24731084046832433,"score_spread":0.23070612127832157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7031981593","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011469217,0.0017641577,0.40485868,0.03692792,0.0075357915,0.0013680065,0.00021272663,0.0009141822,0.54640704],"genre_scores_gemma":[0.002703295,0.0013506212,0.065584995,0.028672881,0.0020528121,0.00026131934,0.0013669234,0.00032912314,0.897678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99389106,0.0006216894,0.0011973152,0.0019836356,0.0012111863,0.00109514],"domain_scores_gemma":[0.9950729,0.000300424,0.001187955,0.0021911839,0.0007743852,0.0004731636],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083400623,0.0011374403,0.0011519269,0.0007140211,0.0006673002,0.0014521556,0.0028745448,0.0011231604,0.022914097],"category_scores_gemma":[0.00019003723,0.0012449222,0.00048095157,0.0010747515,0.00034282723,0.0118792355,0.0010986157,0.00094837794,0.06041223],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001660977,0.00025298024,0.000025663878,0.00013953334,0.00009027883,0.00005412284,0.000077965145,0.0023310315,0.000023073157,0.46326384,0.51732475,0.01640016],"study_design_scores_gemma":[0.0011364964,0.00042473015,0.0021845459,0.0014872077,0.000091534916,0.00014375703,0.000018765442,0.025021287,0.00050643325,0.0033475137,0.96405894,0.0015788072],"about_ca_topic_score_codex":0.00019686914,"about_ca_topic_score_gemma":0.0002493692,"teacher_disagreement_score":0.45991632,"about_ca_system_score_codex":0.0004445159,"about_ca_system_score_gemma":0.0007973826,"threshold_uncertainty_score":0.99958444},"labels":[],"label_agreement":null},{"id":"W7033045182","doi":"","title":"Ouverture de la Chaire-Miroir Ottawa-Liège sur \"Le droit des corps\"","year":2024,"lang":"fr","type":"article","venue":"ORBi (University of Liège)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Acquiescence; Intervention (counseling); Context (archaeology)","score_opus":0.015881175716571404,"score_gpt":0.22072901345173612,"score_spread":0.2048478377351647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033045182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03357377,0.0048801936,0.94259703,0.007415814,0.00058103225,0.00013591145,0.000026075268,0.0007450598,0.010045122],"genre_scores_gemma":[0.8115478,0.0008775109,0.14900814,0.00013322283,0.00009046909,2.5527243e-7,0.0000067686815,0.000021740676,0.038314085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833083,0.00029658736,0.00017510218,0.0005061746,0.0002664,0.0004248888],"domain_scores_gemma":[0.9987483,0.0003109114,0.00012039395,0.00044623972,0.00018040981,0.00019374675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006357358,0.00022570277,0.00030323866,0.00024862448,0.00037587754,0.00020728895,0.0010467586,0.00033264988,0.00013189469],"category_scores_gemma":[0.000015508362,0.00030937957,0.00021022846,0.0008591554,0.00070796156,0.0008965742,0.00048092002,0.00041878223,0.00007616391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041901272,0.00068549986,0.0075497064,0.0012218684,0.00030502214,0.0020692637,0.024261605,0.010498157,0.0006849977,0.66689926,0.16263475,0.12314798],"study_design_scores_gemma":[0.0006413564,0.0002633354,0.013365068,0.0012648416,0.00008836681,0.00026822384,0.00041952904,0.81059283,0.00067488337,0.026245613,0.14551124,0.00066473545],"about_ca_topic_score_codex":0.008130884,"about_ca_topic_score_gemma":0.00037426682,"teacher_disagreement_score":0.80009466,"about_ca_system_score_codex":0.00024758046,"about_ca_system_score_gemma":0.0006698103,"threshold_uncertainty_score":0.9999358},"labels":[],"label_agreement":null},{"id":"W7033388470","doi":"","title":"With a Quebec Law, Equality for Gay Parents","year":2002,"lang":"en","type":"other","venue":"DigitalGeorgetown (Georgetown University Library)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.014733725415630734,"score_gpt":0.2017240758480369,"score_spread":0.18699035043240617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033388470","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009107756,0.00011980224,0.3153098,0.0011049258,0.00020751232,0.00074625795,0.0002744086,0.0046051973,0.67762303],"genre_scores_gemma":[0.001109617,0.00010977359,0.095418036,0.0004691364,0.00014852388,0.000009497173,0.00048356195,0.00036699412,0.90188485],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99684894,0.00014050287,0.00035266357,0.0013484195,0.000493975,0.0008155227],"domain_scores_gemma":[0.99736005,0.00014134467,0.00053301774,0.0014773842,0.00009646479,0.0003917147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010266542,0.0007591792,0.0007769739,0.000614243,0.00029497952,0.0006657103,0.0027303055,0.00052246125,0.00042592338],"category_scores_gemma":[0.00001902283,0.0007397926,0.00032427072,0.0009249077,0.00028563966,0.0021374736,0.0008521045,0.00031573232,0.0001012038],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003595424,0.00020570365,0.00019463418,0.000111275636,0.00014306649,0.00005392748,0.000109005174,0.000063305386,6.629536e-7,0.1559996,0.84048593,0.002596945],"study_design_scores_gemma":[0.0009026902,0.00014572406,0.000024575951,0.00026212263,0.000040687773,0.000006333095,0.000025592764,0.0021885787,0.00014607441,0.001120472,0.99409515,0.001042007],"about_ca_topic_score_codex":0.0011792143,"about_ca_topic_score_gemma":0.0002884368,"teacher_disagreement_score":0.22426185,"about_ca_system_score_codex":0.00011202651,"about_ca_system_score_gemma":0.00026224973,"threshold_uncertainty_score":0.99950534},"labels":[],"label_agreement":null},{"id":"W7033404908","doi":"","title":"Projeto Diretrizes, Sociedade Brasileira de Angiologia e Cirurgia Vascular : aneurisma da aorta abdominal","year":2023,"lang":"en","type":"article","venue":"Lume (Universidade Federal do Rio Grande do Sul)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Universidade Federal do Estado do Rio de Janeiro; Universidade Federal do Rio de Janeiro; Universidade Federal do Paraná; Universidade Estadual Paulista; Universidade Estadual de Campinas; Faculdade de Medicina da Universidade de São Paulo; Universidade Federal de Santa Catarina; Universidade Federal do Rio Grande do Sul; Pontifícia Universidade Católica do Rio de Janeiro; Hospital de Clínicas de Porto Alegre; Association Belge contre les Maladies Neuro-Musculaires","keywords":"Abdominal aortic aneurysm; Aneurysm; Aortic aneurysm; Aorta; Abdominal aorta","score_opus":0.01691564135527861,"score_gpt":0.24922678625017833,"score_spread":0.2323111448948997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033404908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48798382,0.00042281902,0.49919522,0.0016281836,0.0005220575,0.0007485698,0.00002118902,0.004125712,0.0053524324],"genre_scores_gemma":[0.9567105,0.00024188572,0.039722808,0.0004263586,0.00016171444,0.000021538106,0.00006939818,0.000049880022,0.0025959034],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968615,0.00032139733,0.000355047,0.00097607134,0.0004962506,0.0009896869],"domain_scores_gemma":[0.99830824,0.0001700316,0.00021614121,0.0008554725,0.00014769532,0.00030241537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077094726,0.00041782565,0.00048765962,0.0005767639,0.000939686,0.0010013588,0.0017548723,0.0003418994,0.00006461896],"category_scores_gemma":[0.00008275805,0.0004446046,0.0004164761,0.0020185348,0.00016992209,0.0007665482,0.00063622615,0.00049150194,0.00013808232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007103212,0.0013251863,0.2134105,0.0008611825,0.0018111294,0.0047716727,0.031058613,0.032693338,0.0120394565,0.10187107,0.43106717,0.16838038],"study_design_scores_gemma":[0.0095720235,0.001154404,0.31520683,0.00047779112,0.00020214319,0.0004310538,0.0020363675,0.5970613,0.0020604327,0.017775914,0.04952204,0.004499713],"about_ca_topic_score_codex":0.00025934432,"about_ca_topic_score_gemma":0.000012591624,"teacher_disagreement_score":0.56436795,"about_ca_system_score_codex":0.00019406376,"about_ca_system_score_gemma":0.0002142612,"threshold_uncertainty_score":0.99980056},"labels":[],"label_agreement":null},{"id":"W7033549617","doi":"","title":"Review of &lt;i&gt;The Catherian Cathedral: Gothic Cathedral\\nIconography in Willa Cather's Fiction&lt;/i&gt; by Christine E. Kephart","year":2012,"lang":"en","type":"article","venue":"Insecta mundi","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Motif (music); Archbishop; Bridge (graph theory); Performance art; Architecture","score_opus":0.014100415961916602,"score_gpt":0.2523372768448679,"score_spread":0.2382368608829513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033549617","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106767885,0.57368094,0.27921817,0.009056947,0.0028336016,0.0035183164,0.000102595724,0.002634373,0.022187177],"genre_scores_gemma":[0.9612123,0.021342214,0.01344809,0.0031577076,0.00021774445,0.0001598574,0.00003790649,0.00006202501,0.00036219443],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971982,0.00045493906,0.0008466138,0.00048382633,0.00037105608,0.0006453479],"domain_scores_gemma":[0.9975813,0.00022018311,0.0005049813,0.0013486492,0.00017542244,0.00016947636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017334713,0.00035980585,0.000518588,0.00026282508,0.00022826713,0.000090586764,0.0016676302,0.00016030596,0.000055102766],"category_scores_gemma":[0.00017411393,0.0002913442,0.00024248453,0.0014425733,0.00019965228,0.0004944487,0.0002866492,0.00031608526,0.000034781075],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009001438,0.0044098776,0.06499463,0.004324696,0.0004859172,0.000021231152,0.0301352,0.00078289246,0.03650704,0.07129661,0.7539135,0.03303835],"study_design_scores_gemma":[0.00090660446,0.00033823441,0.012065698,0.0030897825,0.0000663432,0.0001220402,0.0000063115017,0.006606381,0.0014223629,0.0008098734,0.9734334,0.0011330179],"about_ca_topic_score_codex":0.0011175928,"about_ca_topic_score_gemma":0.000160621,"teacher_disagreement_score":0.8544444,"about_ca_system_score_codex":0.00009731961,"about_ca_system_score_gemma":0.00012368136,"threshold_uncertainty_score":0.99995387},"labels":[],"label_agreement":null},{"id":"W7033737210","doi":"","title":"Scoping Review of Research on Islamophobia in Healthcare Settings","year":2023,"lang":"en","type":"report","venue":"MacSphere (McMaster University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Hyporeflexia; Liquation; Hemopericardium; Fusible alloy","score_opus":0.12698819064667788,"score_gpt":0.37989303978048006,"score_spread":0.2529048491338022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033737210","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014237378,0.010324809,0.019164508,0.003872176,0.00077663764,0.002086821,0.000019995232,0.0009811512,0.9627597],"genre_scores_gemma":[0.0007935056,0.1993229,0.03368835,0.0014097389,0.00028971478,0.000018384872,0.000090007525,0.00016340052,0.764224],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99608225,0.00068470935,0.00056486664,0.00084919366,0.0012936263,0.00052536],"domain_scores_gemma":[0.9972774,0.00038248397,0.00044276816,0.0008745401,0.00091863726,0.00010421194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025694687,0.00027115192,0.0007136125,0.0011139888,0.00013591838,0.00005829208,0.0017632239,0.00030981543,0.000879243],"category_scores_gemma":[0.00025293982,0.0003067491,0.00016207859,0.003852166,0.000085525295,0.00017627815,0.001130922,0.00095946965,0.00005599005],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052017214,0.00023907545,0.0009286471,0.22598365,0.00009897718,0.0015941897,0.0006260388,0.0012505945,0.0000062841673,0.009138528,0.23825964,0.52182233],"study_design_scores_gemma":[0.00045937157,0.00038781748,0.0001591887,0.79093885,0.000017905222,0.000021036081,0.00009170654,0.001957713,0.00015948973,0.000434883,0.20462903,0.00074297853],"about_ca_topic_score_codex":0.00081015204,"about_ca_topic_score_gemma":0.00023277824,"teacher_disagreement_score":0.56495523,"about_ca_system_score_codex":0.00062942,"about_ca_system_score_gemma":0.0017297828,"threshold_uncertainty_score":0.9999385},"labels":[],"label_agreement":null},{"id":"W7033786422","doi":"","title":"Shockwave consolidation of nano silver powder into bulk nano structured silver","year":2007,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Materials Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Brittleness; Ductility (Earth science); Toughness; Surface roughness; Fracture toughness; Grain size; Nanostructure; Surface finish; Scanning electron microscope","score_opus":0.013058636343366854,"score_gpt":0.2647118771423469,"score_spread":0.25165324079898005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033786422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86740583,0.0010648418,0.002929891,0.00007076927,0.006129372,0.0026303933,0.00046035298,0.003226694,0.116081856],"genre_scores_gemma":[0.91134244,0.00014466826,0.08132639,0.00044396197,0.00006361928,0.000046438305,0.0008261864,0.00015162541,0.0056546936],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.994244,0.0003902454,0.0015906567,0.0015732165,0.0013677954,0.0008341058],"domain_scores_gemma":[0.9948839,0.00031558506,0.0014486398,0.00163231,0.0013853924,0.00033418724],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012020887,0.0009634554,0.0010411096,0.0011264158,0.00089909433,0.0002088927,0.002226551,0.0013134124,0.00022456546],"category_scores_gemma":[0.0005329877,0.0010282387,0.00046735123,0.0014287645,0.00011174063,0.0012253149,0.0004082056,0.0011539928,0.00013507716],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038723773,0.00057246245,0.000054929136,0.00095031835,0.00064700656,0.00009803453,0.0002894547,0.0035544513,0.42795217,0.29010993,0.00036617587,0.2750178],"study_design_scores_gemma":[0.0010515823,0.00027765654,0.0003571647,0.0005844834,0.00012966894,0.00004081948,0.00009370984,0.0022262528,0.92852044,0.041399196,0.023539219,0.001779787],"about_ca_topic_score_codex":0.00019566528,"about_ca_topic_score_gemma":0.0002671694,"teacher_disagreement_score":0.5005683,"about_ca_system_score_codex":0.00055542646,"about_ca_system_score_gemma":0.00018018569,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W7033804257","doi":"","title":"René LATOURELLE, Miracles de Jésus et théologie du miracle, Éds. Bellarmin - Éds. du Cerf («Recherches. Nouvelle Série», 8), Montreal - Paris 1986, 393 pp., 16 x 24. [RECENSIÓN]","year":2018,"lang":"fr","type":"other","venue":"Deposito Adademico Digital Universidad De Navarra (University of Navarra)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subject (documents); Theme (computing); Context (archaeology); Exposition (narrative); Government (linguistics)","score_opus":0.0234532389603014,"score_gpt":0.232442734293802,"score_spread":0.20898949533350059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033804257","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034529224,0.0040077185,0.4989887,0.0073809866,0.0012521293,0.001289977,0.00046788852,0.0019678501,0.45011556],"genre_scores_gemma":[0.33272356,0.033091467,0.24501416,0.0013455381,0.0011670707,0.0000046762493,0.0007002412,0.00072174845,0.38523155],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99291193,0.0010624239,0.00091057393,0.0021930295,0.0010701856,0.0018518445],"domain_scores_gemma":[0.99330825,0.0010870575,0.0017279781,0.0016841718,0.0011157998,0.0010767555],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011117727,0.001482959,0.0017377988,0.000989109,0.0011370699,0.00059813383,0.0045249104,0.0029480804,0.00077605445],"category_scores_gemma":[0.0004982096,0.001927204,0.0009868375,0.001837128,0.0014869665,0.0020100486,0.0024696956,0.001860264,0.00042950755],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091518543,0.0015504508,0.023436071,0.00042724243,0.0014357023,0.0029259329,0.013109872,0.0035596488,0.00089320046,0.005441832,0.9163378,0.029967085],"study_design_scores_gemma":[0.0063045914,0.0017344493,0.013668125,0.0025041052,0.0010235464,0.0016665927,0.0069506345,0.075415164,0.0023910373,0.002188217,0.88119954,0.004953975],"about_ca_topic_score_codex":0.014427906,"about_ca_topic_score_gemma":0.0011523007,"teacher_disagreement_score":0.29819432,"about_ca_system_score_codex":0.0022947364,"about_ca_system_score_gemma":0.0026189697,"threshold_uncertainty_score":0.999792},"labels":[],"label_agreement":null},{"id":"W7033862407","doi":"","title":"Rhabdomyosarcoma in Adults:A Retrospective Analysis of Case Records Diagnosed between 1979 and 2018 in Western Denmark","year":2021,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Particle Physics","funders":"","keywords":"Rhabdomyosarcoma; Retrospective cohort study; Medical record; MEDLINE; Epidemiology","score_opus":0.013140338634804736,"score_gpt":0.2671209193711946,"score_spread":0.25398058073638985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033862407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69936824,0.00010167369,0.29940206,0.00015112877,0.000024783627,0.00007826421,0.0000045464412,0.000054495995,0.0008148467],"genre_scores_gemma":[0.91183954,0.000080343176,0.08787845,0.000060550854,0.000010323915,0.000006614262,0.000004995912,0.0000041034205,0.00011507837],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986929,0.00016904916,0.00039181346,0.00042890743,0.00014022503,0.00017704727],"domain_scores_gemma":[0.9990617,0.0002646744,0.00010815948,0.00039940662,0.00011080832,0.00005524393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036332948,0.00011169162,0.000397887,0.00056722417,0.000030191575,0.000051279716,0.00023624352,0.00007391289,0.000015711565],"category_scores_gemma":[0.00011549845,0.000112258596,0.000059656653,0.0025629962,0.000035436522,0.0002013254,0.000258311,0.0001233452,0.0000012539182],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035174567,0.000053623364,0.9928575,0.0000085195115,0.00005232169,0.0006189043,0.0006843373,0.00037166954,0.0000036973097,0.00032744627,0.00007573061,0.0049426905],"study_design_scores_gemma":[0.000490282,0.00006315527,0.8841775,0.00006553625,0.000030577492,0.00003523747,0.00006500673,0.11394939,0.0005281075,0.00041959403,0.000018933835,0.00015664869],"about_ca_topic_score_codex":0.0014196245,"about_ca_topic_score_gemma":0.0070502935,"teacher_disagreement_score":0.21247132,"about_ca_system_score_codex":0.0000626307,"about_ca_system_score_gemma":0.000045102326,"threshold_uncertainty_score":0.45777726},"labels":[],"label_agreement":null},{"id":"W7033980871","doi":"","title":"Şeyh Ali Celâleddin Çelebi ve Döneminde Afyonkarahisar Mevlevîhânesi (1894-1918)","year":2015,"lang":"tr","type":"dissertation","venue":"DSpace - AKÜ (Afyon Kocatepe University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Quarter (Canadian coin); Power (physics)","score_opus":0.021669647973518696,"score_gpt":0.25314161884652786,"score_spread":0.23147197087300916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033980871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09383742,0.0032910376,0.44628224,0.0029908118,0.0106730675,0.004588467,0.00035234037,0.007420445,0.43056417],"genre_scores_gemma":[0.44572127,0.003101342,0.12786283,0.0009000147,0.0014263788,0.000031208376,0.0032693422,0.0006511494,0.41703647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99188423,0.0007198459,0.0010042841,0.0028350016,0.0017566187,0.0017999944],"domain_scores_gemma":[0.9925967,0.00030326587,0.0016787021,0.0021093385,0.0021423271,0.0011697],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011743343,0.0017382376,0.0016535614,0.0028406405,0.0011725102,0.00094459584,0.0049753683,0.0018698098,0.00020674079],"category_scores_gemma":[0.00025433386,0.0021271352,0.00072063756,0.004109237,0.00037983045,0.0016565317,0.0011266622,0.0017127893,0.0010326658],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035194962,0.0041862438,0.0037717118,0.0023713494,0.0028334444,0.0045046024,0.06371957,0.034421723,0.0039951336,0.18003975,0.6559375,0.040699504],"study_design_scores_gemma":[0.0066322177,0.0023059445,0.0014618216,0.002262986,0.0013479425,0.00013852178,0.013253712,0.14798339,0.012065922,0.002637062,0.80151683,0.008393663],"about_ca_topic_score_codex":0.0011651785,"about_ca_topic_score_gemma":0.00035941682,"teacher_disagreement_score":0.35188386,"about_ca_system_score_codex":0.0013144969,"about_ca_system_score_gemma":0.0017277388,"threshold_uncertainty_score":0.99974513},"labels":[],"label_agreement":null},{"id":"W7034052827","doi":"","title":"Thesaurus multilingue des Arts de la scène (version 1)","year":2025,"lang":"en","type":"other","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Digital Research Infrastructure for the Arts and Humanities","keywords":"Interoperability; Cultural heritage; Thesaurus; Work (physics); The arts; Indonesian","score_opus":0.010307354183220823,"score_gpt":0.245311033416415,"score_spread":0.23500367923319418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034052827","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031537835,0.0005750663,0.5289971,0.0006610093,0.00006377319,0.00011979324,0.0000071073855,0.0012222752,0.46832228],"genre_scores_gemma":[0.005915883,0.00092549773,0.6176487,0.00012585196,0.0000195883,0.000016915505,0.00004681642,0.00007957267,0.37522113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99507874,0.0033890668,0.00028442778,0.0006333223,0.0002796794,0.00033474495],"domain_scores_gemma":[0.99601567,0.0012266818,0.00031703163,0.0016901986,0.00061627995,0.00013416179],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034509753,0.0002881635,0.00028266208,0.00039117716,0.00031160517,0.0004195804,0.0018968413,0.00034047212,0.00015524188],"category_scores_gemma":[0.0010863021,0.00030278284,0.00014160034,0.0005456515,0.00025497898,0.00010810372,0.0007928985,0.00034881922,0.000056721896],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000082357565,0.0008576257,0.0006085581,0.0002763597,0.00013694626,0.000045648652,0.006064664,0.00036381814,0.00037790337,0.35140058,0.40626776,0.2335919],"study_design_scores_gemma":[0.0006838779,7.9781876e-7,0.00038117237,0.0046313233,0.000033576867,0.000031656193,0.000027970053,0.22262923,0.017350521,0.009155206,0.7443226,0.000752059],"about_ca_topic_score_codex":0.0011797468,"about_ca_topic_score_gemma":0.00022890809,"teacher_disagreement_score":0.34224537,"about_ca_system_score_codex":0.00010379373,"about_ca_system_score_gemma":0.00030420523,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W7034110568","doi":"","title":"Social Policy Trends: Responding to the COVID-19 Pandemic in Alberta’s Homeless Serving Sectors","year":2022,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pandemic; Social policy; Public policy; Government (linguistics); Coronavirus disease 2019 (COVID-19); Social isolation; Social distance","score_opus":0.24811314593929396,"score_gpt":0.5485999526727594,"score_spread":0.30048680673346545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034110568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7782339,0.004031627,0.17408086,0.0314314,0.0013388479,0.0013099068,0.00005251591,0.00068094017,0.008840031],"genre_scores_gemma":[0.9924399,0.00038657954,0.0013685216,0.0044263317,0.00023882296,0.000106134874,0.000006055571,0.000034953766,0.0009926967],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9960394,0.0012395937,0.00077856943,0.000591846,0.0008203141,0.0005302991],"domain_scores_gemma":[0.997695,0.0006532963,0.00065588614,0.0006186679,0.00010339433,0.00027371224],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036100545,0.00027520343,0.0005820636,0.0035050702,0.001212613,0.0014974356,0.008621115,0.00007125643,0.00073657185],"category_scores_gemma":[0.0006275175,0.0002453671,0.00016304475,0.008767358,0.000053429438,0.0012824255,0.0052579762,0.0006295974,0.0000038089313],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033248935,0.00037894625,0.5004661,0.000079619735,0.00015240864,0.00008930712,0.019416213,0.2166181,0.004081987,0.010067553,0.17871574,0.06960155],"study_design_scores_gemma":[0.0025395497,0.000094794486,0.55241984,0.00029715663,0.00005374988,0.0002434868,0.0008965932,0.052873872,0.0018976601,0.03345428,0.3526603,0.0025687218],"about_ca_topic_score_codex":0.00894995,"about_ca_topic_score_gemma":0.00079361117,"teacher_disagreement_score":0.21420603,"about_ca_system_score_codex":0.0007500032,"about_ca_system_score_gemma":0.00056309253,"threshold_uncertainty_score":0.9999999},"labels":[],"label_agreement":null},{"id":"W7034165963","doi":"","title":"Spatial and temporal patterns of biofouling aquatic invasive species in the Salish Sea","year":2022,"lang":"en","type":"article","venue":"Western CEDAR (Western Washington University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Biofouling; Invasive species; Recreational fishing; Watercraft; Tunicate; Aquatic animal; Introduced species; Spatial ecology","score_opus":0.022725297651803814,"score_gpt":0.2207934316104605,"score_spread":0.1980681339586567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034165963","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76281273,0.000021783868,0.23570578,0.0005672785,0.00011332445,0.00021111648,0.000015557107,0.00011976284,0.00043263118],"genre_scores_gemma":[0.99737906,0.00002985391,0.0018195971,0.00027813058,0.00002781204,0.0000012680885,0.000014775033,0.000010652264,0.00043886504],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99830765,0.00042502314,0.0002527043,0.00038074402,0.00039068295,0.00024322583],"domain_scores_gemma":[0.999,0.00024077474,0.0002424566,0.0004300377,0.000034048237,0.000052667703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045864712,0.00017184709,0.00023881966,0.00043845287,0.0002513522,0.00015022895,0.0014364774,0.000046854562,0.0000061542987],"category_scores_gemma":[0.000023410172,0.00016291656,0.00006368676,0.0005044685,0.00006370766,0.00044800687,0.0010710441,0.00029127835,0.0000015598036],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001706797,0.00008303242,0.9901356,0.00003740887,0.000014592379,0.0001523747,0.0057402905,0.0015482029,0.00007670817,0.0013036953,0.000030886837,0.0008601173],"study_design_scores_gemma":[0.006630364,0.0024401494,0.855432,0.0007521395,0.00014150667,0.00032959995,0.018266493,0.0709549,0.0065738885,0.001432687,0.03427086,0.0027754635],"about_ca_topic_score_codex":0.0009664579,"about_ca_topic_score_gemma":0.0015517194,"teacher_disagreement_score":0.23456629,"about_ca_system_score_codex":0.000087270855,"about_ca_system_score_gemma":0.00009757298,"threshold_uncertainty_score":0.6643545},"labels":[],"label_agreement":null},{"id":"W7034213730","doi":"","title":"Surface roughness estimation by 3D stereo SEM reconstruction","year":2015,"lang":"en","type":"other","venue":"Repositorio Institucional UN - Biblioteca Digital","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Nacional de Colombia; Government of Canada; Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Stylus; Pixel; Surface roughness; Surface finish; Tilt (camera); Brightness; Surface reconstruction; Surface (topology)","score_opus":0.013918819289087125,"score_gpt":0.24665082343164857,"score_spread":0.23273200414256145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034213730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011122218,0.00087167724,0.66865927,0.00012241842,0.0031045154,0.00029706754,0.00014059566,0.0023273795,0.32436582],"genre_scores_gemma":[0.02092212,0.00039614073,0.66478086,0.00016089424,0.0024159593,0.00004303653,0.0015497424,0.00064314774,0.30908808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717367,0.000067938345,0.0005635568,0.00090167054,0.00092179375,0.00037137256],"domain_scores_gemma":[0.9979915,0.000054942906,0.0005952156,0.0008213399,0.00029891342,0.00023810122],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002232601,0.0005069857,0.0004572664,0.0015324071,0.00017945182,0.0018236965,0.0010163824,0.0006123587,0.000028720515],"category_scores_gemma":[0.000082371516,0.0005126973,0.0001159665,0.003050566,0.000091012225,0.0015698352,0.0003688904,0.0003893483,0.00012913719],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010080818,0.00015832872,0.00004702116,0.000047098198,0.00009631803,0.000033777083,0.00005084687,0.004124897,0.00003104946,0.0014522544,0.9610387,0.032909628],"study_design_scores_gemma":[0.0004823051,0.0001323898,0.000007240744,0.00048499866,0.000022608914,0.0005185999,0.000004337194,0.07154663,0.0005674238,0.00075953157,0.9245326,0.0009413125],"about_ca_topic_score_codex":0.00005661416,"about_ca_topic_score_gemma":0.0000027950857,"teacher_disagreement_score":0.067421734,"about_ca_system_score_codex":0.00022949494,"about_ca_system_score_gemma":0.00040590376,"threshold_uncertainty_score":0.99973243},"labels":[],"label_agreement":null},{"id":"W7034224855","doi":"","title":"The Spatial Turn in the Heritage Field : A case study of the Arctic during the crisis of places.","year":2023,"lang":"en","type":"other","venue":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Cambridge","keywords":"Liminality; Declaration; Subject (documents); Field (mathematics); Natural (archaeology); Cultural heritage; Cultural heritage management; Space (punctuation); Postmodernism","score_opus":0.016999979151832625,"score_gpt":0.2696828670085257,"score_spread":0.2526828878566931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034224855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23671558,0.006155693,0.45193678,0.17458463,0.009521146,0.032331094,0.001996163,0.013301965,0.07345693],"genre_scores_gemma":[0.99063176,0.00016461906,0.0047912262,0.00016514723,0.00006501325,0.0003483585,0.000019018456,0.000088106404,0.003726767],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99787605,0.000200846,0.0007014049,0.0004693366,0.00048922317,0.00026316353],"domain_scores_gemma":[0.99520856,0.00023679355,0.001032711,0.0032715981,0.00022652288,0.000023796896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009766277,0.00025030668,0.0003311031,0.0005521739,0.00031353423,0.00009103203,0.0046828035,0.00023759127,0.000012935363],"category_scores_gemma":[0.0010839872,0.00013016605,0.00009753781,0.0020545789,0.0003822851,0.00016782287,0.0016555298,0.0006473889,0.0000023113241],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981966,0.0047983294,0.029028451,0.0015500708,0.0012530638,0.00056270586,0.009490686,0.008117411,0.000097041695,0.100910984,0.7858916,0.058169853],"study_design_scores_gemma":[0.009188783,0.002146179,0.014308431,0.0045197164,0.0007909308,0.0012556751,0.02908719,0.15062875,0.009171136,0.0026309947,0.77248156,0.0037906673],"about_ca_topic_score_codex":0.009314396,"about_ca_topic_score_gemma":0.010254964,"teacher_disagreement_score":0.75391614,"about_ca_system_score_codex":0.000040371364,"about_ca_system_score_gemma":0.00013549147,"threshold_uncertainty_score":0.9972827},"labels":[],"label_agreement":null},{"id":"W7034545139","doi":"","title":"Tirez-vous une chaise et rassemblez-vous autour du tout nouveau Cercle des conteurs de l’est de l’Ontario\\n","year":2004,"lang":"fr","type":"article","venue":"Érudit (Université de Montréal)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Work (physics); Period (music)","score_opus":0.011301459095989891,"score_gpt":0.19487170225625114,"score_spread":0.18357024316026124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034545139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20425256,0.00949155,0.72385484,0.050403565,0.00052876654,0.00039445973,0.000019722822,0.0011431739,0.009911371],"genre_scores_gemma":[0.79738724,0.0065523554,0.14956559,0.0020731222,0.00021449132,0.000013630087,0.00002016668,0.00008900126,0.04408437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.996754,0.0003140105,0.0003860685,0.0008113034,0.00040726885,0.0013273801],"domain_scores_gemma":[0.99772346,0.00019286569,0.00033342128,0.0007929634,0.00030459848,0.00065267953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000736861,0.0005345952,0.0005432998,0.0002941463,0.0012486434,0.00024373205,0.0013620983,0.00043273537,0.000055372813],"category_scores_gemma":[0.000110648056,0.0006838958,0.00030686983,0.00085679995,0.00029102244,0.00079648616,0.00078174495,0.0006158508,0.00014440902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002939896,0.0013122977,0.008905556,0.00017552669,0.0003888364,0.016443318,0.04946667,0.528009,0.001053673,0.22915462,0.08290645,0.08189009],"study_design_scores_gemma":[0.006246458,0.0012553964,0.023773726,0.00090923737,0.0003570518,0.006945168,0.0011794496,0.25730085,0.002769339,0.025289468,0.67170054,0.0022733412],"about_ca_topic_score_codex":0.37193552,"about_ca_topic_score_gemma":0.52216464,"teacher_disagreement_score":0.5931347,"about_ca_system_score_codex":0.019458156,"about_ca_system_score_gemma":0.0015664725,"threshold_uncertainty_score":0.99956125},"labels":[],"label_agreement":null},{"id":"W7034709941","doi":"","title":"U.S., Canada Announce Shared Goals For Fighting Climate Change","year":2016,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Climate change; Government (linguistics); Work (physics)","score_opus":0.0264801482544647,"score_gpt":0.26923131627974917,"score_spread":0.24275116802528446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034709941","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4985116e-8,0.00023624852,0.58408296,0.0008257252,0.00032909017,0.00035075305,0.0001661305,0.00096689217,0.4130422],"genre_scores_gemma":[0.000028722292,0.00022390444,0.36273685,0.0021141341,0.00057528785,0.00017747443,0.000042812393,0.00015966034,0.6339412],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872273,0.000025755122,0.00019640777,0.00045725418,0.00019686366,0.00040099028],"domain_scores_gemma":[0.9990236,0.00008186763,0.00023548864,0.0005088998,0.000074438874,0.000075676704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014967815,0.000222707,0.0002530254,0.00011938435,0.00009132744,0.00010744182,0.0009693386,0.0001340412,0.00029395148],"category_scores_gemma":[0.000027014084,0.00016910379,0.000054504457,0.00010502695,0.000011697197,0.000104534236,0.00023955695,0.000056421934,0.00003318459],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2216986e-7,0.0000038819353,0.00000826431,0.000039114057,0.000007857631,0.0000021678284,0.000010272836,0.0000019338545,0.0000013929326,0.009241746,0.98204845,0.008634288],"study_design_scores_gemma":[0.00012545467,0.000015330099,0.0000061660253,0.00028355085,0.000002631808,0.0000018064814,5.5319714e-7,0.012073037,0.00004923295,0.0001730722,0.98698086,0.00028828942],"about_ca_topic_score_codex":0.08164482,"about_ca_topic_score_gemma":0.10525509,"teacher_disagreement_score":0.2213461,"about_ca_system_score_codex":0.00007821788,"about_ca_system_score_gemma":0.00024466228,"threshold_uncertainty_score":0.9244706},"labels":[],"label_agreement":null},{"id":"W7036302034","doi":"","title":"Canadian Solar Announces Appointment of Yan Zhuang as Acting Chief Executive Officer while Dr. Shawn Qu is on a Medical Leave of Absence - NASDAQ (NASDAQ01) News","year":2019,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chief executive officer; Officer; Government (linguistics); Work (physics)","score_opus":0.015980306177122944,"score_gpt":0.264534934762558,"score_spread":0.24855462858543506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036302034","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040245883,0.0003340421,0.15053867,0.001367689,0.00041762582,0.0006038252,0.000048766487,0.0004153396,0.8462338],"genre_scores_gemma":[0.02604069,0.0012214852,0.11780689,0.0066063986,0.00052845775,0.00006246042,0.00009465685,0.0004208089,0.84721816],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968856,0.00014248953,0.0006094716,0.00083526166,0.0010185222,0.00050866697],"domain_scores_gemma":[0.99759233,0.00016669846,0.0007419847,0.0009972763,0.00016908125,0.00033260722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050495105,0.00043543684,0.0007360092,0.00067979883,0.00009295426,0.0000806947,0.001737305,0.00050894154,0.00073924905],"category_scores_gemma":[0.00012082549,0.0003773008,0.000186939,0.00050440826,0.00011386854,0.00012760445,0.0003197986,0.00042014392,0.0001264816],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010675378,0.000139584,0.00015173154,0.00014098744,0.00015642028,0.000019652642,0.0018023659,0.0002446808,0.00001620513,0.009679578,0.97574306,0.011895091],"study_design_scores_gemma":[0.000945533,0.0013484893,0.000058751342,0.004258399,0.000045310295,0.00003328663,0.0006552975,0.065846294,0.0048695,0.0006177277,0.9197698,0.001551583],"about_ca_topic_score_codex":0.14360458,"about_ca_topic_score_gemma":0.027680738,"teacher_disagreement_score":0.115923844,"about_ca_system_score_codex":0.00017910525,"about_ca_system_score_gemma":0.0015548674,"threshold_uncertainty_score":0.9998679},"labels":[],"label_agreement":null},{"id":"W7036587723","doi":"","title":"Canadian Preference Law Reform","year":2007,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.09197251472498942,"score_gpt":0.3003744185145285,"score_spread":0.2084019037895391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036587723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54573685,0.000042233823,0.4253968,0.00042820515,0.0002870964,0.00021952555,0.0000059397607,0.000947794,0.026935572],"genre_scores_gemma":[0.9883363,0.000016558975,0.0060980786,0.0010454046,0.00004907162,3.9541237e-7,0.000008744461,0.000018497212,0.00442694],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980309,0.00010026618,0.00024275068,0.0005840028,0.0003271872,0.00071487523],"domain_scores_gemma":[0.99817204,0.000052003918,0.00013158967,0.00084322714,0.00020659628,0.00059455895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069181196,0.00024904092,0.00020922924,0.00063557184,0.00044951294,0.00040771053,0.0021580153,0.00020953448,0.000008135943],"category_scores_gemma":[0.000014931713,0.00027821487,0.00008492552,0.00079197483,0.000075565564,0.0020524662,0.00045391676,0.00044306644,0.00016955902],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046448957,0.00011755519,0.87951064,0.00003993585,0.00006687854,0.0010510526,0.0011640621,0.0002279133,0.00023685247,0.11119601,0.000006995939,0.006335638],"study_design_scores_gemma":[0.0011673659,0.0003044448,0.9361375,0.0002482457,0.000032858883,0.00015122806,0.00012308452,0.00005738344,0.013050187,0.002698917,0.04452609,0.0015027053],"about_ca_topic_score_codex":0.0024266085,"about_ca_topic_score_gemma":0.26176804,"teacher_disagreement_score":0.44259948,"about_ca_system_score_codex":0.00093204394,"about_ca_system_score_gemma":0.00024161812,"threshold_uncertainty_score":0.999967},"labels":[],"label_agreement":null},{"id":"W7036943461","doi":"","title":"Defining and Establishing Goals for Medicare for All","year":2019,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Presidential system; Health care; Human services; Democracy; Government (linguistics); Popularity","score_opus":0.014063636216878363,"score_gpt":0.2675926949683804,"score_spread":0.25352905875150206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036943461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00572015,0.00073359493,0.987425,0.0010231177,0.00034860751,0.0005791932,0.000012037527,0.000523683,0.0036345818],"genre_scores_gemma":[0.25389218,0.000026791122,0.7427526,0.0025046559,0.000097308424,0.00009249688,0.000023672957,0.00002050222,0.0005897559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884105,0.00003665624,0.0002238514,0.0004233511,0.000162085,0.00031299467],"domain_scores_gemma":[0.99875134,0.0004918708,0.00010530876,0.0003810963,0.00012441323,0.00014596032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067502767,0.00013092632,0.00020133141,0.000058114278,0.00016451914,0.0004043601,0.0005788017,0.0000969232,0.000009028425],"category_scores_gemma":[0.0002900302,0.00012643535,0.00006362895,0.000113358925,0.000025526202,0.0005839977,0.00019801877,0.00011474497,0.000016079997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018014283,0.000027978289,0.0018107258,0.00014104701,0.00003511082,0.0000014654379,0.0004736349,0.0015722935,0.0002350791,0.95991147,0.021727128,0.014046086],"study_design_scores_gemma":[0.0023643866,0.0005089962,0.00044391287,0.0003024695,0.000027551634,0.000019233466,0.000086394895,0.53307116,0.0042690383,0.055291325,0.4028002,0.0008153339],"about_ca_topic_score_codex":0.00005706153,"about_ca_topic_score_gemma":0.00001817907,"teacher_disagreement_score":0.9046201,"about_ca_system_score_codex":0.000025691208,"about_ca_system_score_gemma":0.000052360778,"threshold_uncertainty_score":0.5155884},"labels":[],"label_agreement":null},{"id":"W70371667","doi":"","title":"On domain decomposition with space filling curves for the parallel solution of the coupled Maxwell/Vlasov equations","year":2008,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metis; Domain decomposition methods; Solver; Maxwell's equations; Decomposition method (queueing theory); Computer science; Context (archaeology); Mathematical optimization; Finite element method; Scalability; Vlasov equation; Graph partition; Applied mathematics; Constraint satisfaction problem; Domain (mathematical analysis); Mathematics; Graph; Algorithm; Theoretical computer science; Physics; Mathematical analysis; Discrete mathematics; Probabilistic logic","score_opus":0.01606300918458973,"score_gpt":0.23398636847733703,"score_spread":0.2179233592927473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70371667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039037757,0.00035671517,0.9740871,0.018796153,0.000057380177,0.00053182285,0.0000054299926,0.00022308325,0.002038548],"genre_scores_gemma":[0.6088098,0.00027037284,0.3899182,0.00021677565,0.0000065188615,0.000047192323,0.00003191089,0.000010824864,0.00068834866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997765,0.0011349742,0.00027281218,0.0003002013,0.00033085694,0.00019617248],"domain_scores_gemma":[0.99485475,0.002701354,0.00034542676,0.0011569252,0.0008955192,0.000046026697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002074669,0.00013736784,0.00014405882,0.00006698335,0.0009783529,0.00008008905,0.0011167835,0.000052782296,0.000005742407],"category_scores_gemma":[0.0004967308,0.00009167611,0.000106008374,0.0005101344,0.00020675825,0.00014124534,0.00018635376,0.00014355693,0.000002346341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038602622,0.0005173734,0.0004057885,0.00007500652,0.000067022585,8.877539e-7,0.0057753175,0.043768413,0.0018480398,0.937949,0.0065875384,0.002966994],"study_design_scores_gemma":[0.00047240919,0.000002918918,0.0011127107,0.0007139681,0.00001451971,0.000011256477,0.000021773745,0.97783566,0.01372329,0.004846413,0.0010858984,0.00015918979],"about_ca_topic_score_codex":0.00012526773,"about_ca_topic_score_gemma":0.00011967913,"teacher_disagreement_score":0.93406725,"about_ca_system_score_codex":0.00004408209,"about_ca_system_score_gemma":0.00012377815,"threshold_uncertainty_score":0.7524798},"labels":[],"label_agreement":null},{"id":"W7037695508","doi":"","title":"Expressing Vague Knowledge in the Fuzzy Description Logic","year":2009,"lang":"en","type":"article","venue":"NPARC","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Description logic; Fuzzy logic; Knowledge representation and reasoning; Knowledge-based systems; T-norm fuzzy logics; Fuzzy set","score_opus":0.039806121536507075,"score_gpt":0.2859318063289247,"score_spread":0.2461256847924176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037695508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006062751,0.00010991848,0.8805153,0.0013621231,0.000075476295,0.00008108671,7.5462275e-8,0.00026281335,0.1115305],"genre_scores_gemma":[0.82049716,0.000010712239,0.1786602,0.0006961593,0.00003915205,0.000004263269,6.34522e-7,0.0000016846197,0.000090057736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929184,0.00013551889,0.00013028414,0.00017777662,0.00010643655,0.00015815953],"domain_scores_gemma":[0.99956286,0.000044016437,0.000039353243,0.00030115718,0.00003210611,0.000020484851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038663295,0.00007079458,0.00007178303,0.00008332562,0.00009976031,0.00016674906,0.0006528949,0.000039730458,0.0000037041948],"category_scores_gemma":[0.000022686028,0.000051120824,0.000026433932,0.0003329593,0.000015428259,0.0002367638,0.000048603415,0.00011476285,0.000016407905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000744698,0.00041891861,0.00035267562,0.000010549477,0.0000031856273,0.00002849288,0.00947652,0.0042399517,0.018399319,0.53800064,0.029125368,0.3999369],"study_design_scores_gemma":[0.00028766695,0.00013973848,0.008073966,0.00007510019,0.0000022707886,0.00002715655,0.00006821294,0.36116353,0.0028883782,0.62412626,0.002898964,0.00024877882],"about_ca_topic_score_codex":0.0000023046443,"about_ca_topic_score_gemma":0.0000015409042,"teacher_disagreement_score":0.8144344,"about_ca_system_score_codex":0.000022825123,"about_ca_system_score_gemma":0.00002001755,"threshold_uncertainty_score":0.20846467},"labels":[],"label_agreement":null},{"id":"W7038064448","doi":"","title":"Global Corruption: Its Regulation under International Conventions, US, UK, and Canadian Law and Practice","year":2022,"lang":"en","type":"book","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"International law; Key (lock); Set (abstract data type); Public law; Public policy; Law reform","score_opus":0.0295172815340581,"score_gpt":0.28846888093706896,"score_spread":0.2589515994030109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038064448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019252124,0.003021859,0.041202135,0.0024497404,0.0011469505,0.00055025774,0.00003052826,0.00026693012,0.9494064],"genre_scores_gemma":[0.2713556,0.0027869865,0.022084625,0.00018842302,0.00049152505,0.0000029367266,0.0002595579,0.000032655313,0.7027977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980841,0.0005171035,0.00013639085,0.00045879468,0.0005916524,0.00021191781],"domain_scores_gemma":[0.99838847,0.00035301823,0.0001952624,0.000208136,0.00062335836,0.00023175888],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010110099,0.00012466505,0.0001726755,0.0002697894,0.0015079486,0.00026680727,0.0004074935,0.00018482318,0.00007651118],"category_scores_gemma":[0.000117115356,0.00017200105,0.000031086063,0.00019740083,0.00025783424,0.0004523175,0.0005642565,0.00062998774,0.0000028086463],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028477766,0.00011298572,0.004514066,0.00025565558,0.0004817368,0.0003667967,0.0033502646,0.004571834,0.000096274285,0.92906815,0.052359544,0.0045379237],"study_design_scores_gemma":[0.00047363655,0.00038553934,0.0059344713,0.00014328177,0.00002808218,0.00026482553,0.0005369148,0.023421694,0.0000023735322,0.003954974,0.9645723,0.00028190948],"about_ca_topic_score_codex":0.010639152,"about_ca_topic_score_gemma":0.0017180352,"teacher_disagreement_score":0.92511314,"about_ca_system_score_codex":0.0005273459,"about_ca_system_score_gemma":0.0005868699,"threshold_uncertainty_score":0.999792},"labels":[],"label_agreement":null},{"id":"W7038323936","doi":"","title":"Healthcare Costs And Resource Utilization In Chronic Pain Patients Treated With Extended-Release Formulations Of Tapentadol, Oxycodone, Or Morphine Stratified By Type Of Pain: A Retrospective Claims Analysis, 2012&amp;amp;ndash;2016","year":2019,"lang":"en","type":"other","venue":"Dove Medical Press (Taylor and Francis Group)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Retrospective cohort study; Chronic pain; Medical prescription; Health care; Oxycodone; Cohort; Emergency department; Medicare Advantage","score_opus":0.02256012365627932,"score_gpt":0.28416333117627857,"score_spread":0.26160320751999927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038323936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041590384,0.0032824816,0.9938113,0.0000723522,0.00003745235,0.0008500555,0.00015807197,0.00012262132,0.0012497335],"genre_scores_gemma":[0.9903233,0.00023524745,0.0065836166,0.0002205919,0.000054414148,0.000046712234,0.0012781504,0.00010059694,0.0011573888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720687,0.0005255505,0.0006325311,0.00066296215,0.0006807626,0.00029132605],"domain_scores_gemma":[0.9981129,0.000280684,0.0006025559,0.00058890297,0.00020031465,0.00021463944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008492957,0.00033495165,0.0008180121,0.00042304807,0.000058947357,0.000040676867,0.00039549338,0.00040123754,0.00012622887],"category_scores_gemma":[0.0002623155,0.0002469443,0.00006701704,0.0009817216,0.00019241293,0.00014760246,0.00013857956,0.000315406,0.0000010890691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013499064,0.0020433932,0.10689737,0.0025049602,0.0015524436,0.000018811987,0.0015526889,0.00073623663,0.00007685121,0.0049092737,0.03839281,0.8399653],"study_design_scores_gemma":[0.0034754223,0.0015000909,0.012536135,0.00032409283,0.00020336967,0.000002345512,0.000018008948,0.9745795,0.000027129034,0.00020711226,0.0064596436,0.00066714484],"about_ca_topic_score_codex":0.0017021424,"about_ca_topic_score_gemma":0.0023896527,"teacher_disagreement_score":0.9899074,"about_ca_system_score_codex":0.00010845758,"about_ca_system_score_gemma":0.000024377077,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W7038584778","doi":"","title":"iemens Gamesa Completes Commissioning of 147 MW Mont Sainte-Marguerite Wind Farm Project in Québec","year":2018,"lang":"en","type":"other","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Project commissioning; Work (physics); Wind power; Power station; Production (economics)","score_opus":0.021038289426821538,"score_gpt":0.2776396988512758,"score_spread":0.2566014094244543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038584778","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002675502,0.00033165797,0.42699936,0.0001622585,0.00013379168,0.0003925562,0.0000047830727,0.0008181251,0.5711307],"genre_scores_gemma":[0.0035457723,0.00009073275,0.5081172,0.00027356387,0.00012758191,0.000015769974,0.000018857889,0.00017348683,0.48763704],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818397,0.0001452084,0.000495274,0.00054683106,0.00029548968,0.00033326095],"domain_scores_gemma":[0.99852145,0.000104037346,0.0003978395,0.0008151005,0.00009864349,0.000062904284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035417505,0.00032579532,0.00054281304,0.0006607604,0.000056078607,0.000078059646,0.0012751921,0.00021305066,0.00034368804],"category_scores_gemma":[0.00006596774,0.0002791596,0.00010108606,0.00046254502,0.00012584309,0.000055969853,0.0005483594,0.00020272881,0.000037129994],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070699493,0.00018436393,0.0017919656,0.00013391403,0.00005954003,0.000012055675,0.0009533727,0.00040158938,0.00006891564,0.0049026413,0.97809213,0.013392418],"study_design_scores_gemma":[0.0004053247,0.00017750422,0.0002050165,0.001098314,0.0000073093324,0.000006907054,0.00004121475,0.15806292,0.00038396072,0.00022000012,0.83883864,0.00055290206],"about_ca_topic_score_codex":0.029331202,"about_ca_topic_score_gemma":0.008541045,"teacher_disagreement_score":0.15766133,"about_ca_system_score_codex":0.000092962655,"about_ca_system_score_gemma":0.00029340846,"threshold_uncertainty_score":0.9999661},"labels":[],"label_agreement":null},{"id":"W7038785767","doi":"","title":"La transplantation rénale : entre l'attente et la réalisation : parcours d'adaptation psychologique et sociale selon la perspective des individus greffés","year":2012,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Context (archaeology); Subject (documents); Field (mathematics); Meaning (existential)","score_opus":0.009554959452304501,"score_gpt":0.20535557177303615,"score_spread":0.19580061232073165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038785767","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004108093,0.00062645826,0.2834103,0.004325097,0.00025212194,0.00035153163,0.00029748518,0.00008166262,0.70654726],"genre_scores_gemma":[0.8639469,0.0031184787,0.06683096,0.0015167024,0.00013737561,0.00003564481,0.000120391756,0.00010222885,0.0641913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99593276,0.0017951289,0.00035853306,0.00047166154,0.001081103,0.0003607871],"domain_scores_gemma":[0.9980424,0.0010470067,0.00047899253,0.000211571,0.000005941774,0.00021408816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001687203,0.00036952272,0.0003339634,0.00008639614,0.0002442277,0.00014992399,0.00039620703,0.00019252334,0.000090715446],"category_scores_gemma":[0.000016635286,0.0003929579,0.00006398841,0.00016363127,0.00027032822,0.00082454464,0.000101110265,0.00045133696,2.2767948e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014757273,0.00015364288,0.008841115,0.00030707306,0.00020136165,0.000098772,0.010130461,0.0030841532,0.00038408564,0.89689225,0.0012443701,0.07851512],"study_design_scores_gemma":[0.0037845704,0.0006440042,0.50986725,0.004876956,0.00052562053,0.00038640707,0.022221591,0.071388535,0.017922673,0.06133584,0.30352253,0.003523991],"about_ca_topic_score_codex":0.0029674172,"about_ca_topic_score_gemma":0.018105665,"teacher_disagreement_score":0.85983884,"about_ca_system_score_codex":0.000039611812,"about_ca_system_score_gemma":0.0021331762,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W7038938547","doi":"","title":"Jason Kenney's fossil-fuel based \"reconciliaction\"","year":2021,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Indigenous; Joins","score_opus":0.008319119665667984,"score_gpt":0.19738963985577435,"score_spread":0.18907052019010637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038938547","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.3732397e-7,0.00093415624,0.0033387793,0.00036739052,0.00050307077,0.00028090246,0.000025568317,0.00087448227,0.9936748],"genre_scores_gemma":[0.00010982067,0.00020353308,0.091657475,0.00047136276,0.00011313527,0.000017311912,0.00009573164,0.00006922643,0.9072624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980777,0.00014170363,0.00063166756,0.00036094384,0.0004720239,0.0003159603],"domain_scores_gemma":[0.9979668,0.0001382971,0.0006973932,0.0007792422,0.00028471788,0.00013351609],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030562602,0.0003641724,0.0004597813,0.00014860091,0.000080319944,0.0001818655,0.0008276255,0.00048059053,0.13423544],"category_scores_gemma":[0.00014025837,0.00038440665,0.00022281098,0.000027030772,0.00007328634,4.465965e-7,0.00017358892,0.00032341626,0.001894813],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000734574,0.00004076592,0.0000010768615,0.0002986509,0.000031043535,0.000013356627,0.00004224425,0.0023816226,1.6020876e-7,0.0001405176,0.992721,0.0043221815],"study_design_scores_gemma":[0.00034009776,0.00007770171,0.000004338673,0.00032816498,0.000015587788,0.00003718369,0.000010894868,0.0067234486,0.00003416855,0.000021478418,0.99201685,0.00039005606],"about_ca_topic_score_codex":0.0013548603,"about_ca_topic_score_gemma":0.0003124736,"teacher_disagreement_score":0.13234062,"about_ca_system_score_codex":0.00006125435,"about_ca_system_score_gemma":0.0001160705,"threshold_uncertainty_score":0.99986076},"labels":[],"label_agreement":null},{"id":"W7038990127","doi":"","title":"La citoyenneté et son double, les conceptions de la citoyenneté dans les programmes et les manuels d'histoire des écoles secondaires anglophones et francophones de l'Ontario et du Québec, 1970-1995","year":2001,"lang":"fr","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identity (music); Context (archaeology); Perspective (graphical); Ethnography; Narrative","score_opus":0.006498104026856179,"score_gpt":0.18771355147841368,"score_spread":0.1812154474515575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038990127","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065458424,0.008059874,0.17611572,0.007887704,0.00067588425,0.0008452147,0.00047892577,0.00035792965,0.74012035],"genre_scores_gemma":[0.64452046,0.009326801,0.14898016,0.0024991634,0.0002460558,0.00016728729,0.000114640905,0.00025813663,0.19388732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99487156,0.0015815566,0.00068192056,0.00083222945,0.0012142957,0.0008184374],"domain_scores_gemma":[0.99696654,0.0014294592,0.00061694,0.0005051789,0.000008317668,0.00047357252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021896114,0.0008012565,0.00075612613,0.00014083623,0.0009766648,0.00047692412,0.0010518804,0.00035577422,0.00038297966],"category_scores_gemma":[0.000021549624,0.00083237485,0.00016495386,0.00027134636,0.0011182969,0.00070432056,0.0005184009,0.0010044214,4.0988045e-8],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005155797,0.00078754657,0.24797423,0.001386942,0.00068790454,0.0008841607,0.033281844,0.026343808,0.002810564,0.4534247,0.04025033,0.1916524],"study_design_scores_gemma":[0.001396817,0.0002818108,0.14316551,0.0020337987,0.000086899694,0.00027558274,0.005534998,0.0085138725,0.004825668,0.0048560305,0.8275352,0.0014937775],"about_ca_topic_score_codex":0.47182974,"about_ca_topic_score_gemma":0.89782786,"teacher_disagreement_score":0.7872849,"about_ca_system_score_codex":0.0001362979,"about_ca_system_score_gemma":0.0056561674,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W7039035722","doi":"","title":"Leases as subdivisions of land : A comparative analysis of Singapore, New South Wales &amp; British Columbia","year":2024,"lang":"en","type":"article","venue":"Singapore Management University Institutional Knowledge (InK) (Singapore Management University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Subdivision; Lease; Zoning; Estate; Real estate; Easement; Estate planning; Demise; Land tenure","score_opus":0.02473787122168737,"score_gpt":0.24391526508314854,"score_spread":0.21917739386146118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039035722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05362233,0.00044125615,0.67631197,0.00015109289,0.00043755583,0.000749396,0.00014752822,0.0009218495,0.26721704],"genre_scores_gemma":[0.88393956,0.0004155346,0.048746888,0.00003455441,0.00004151151,6.422238e-7,0.00037617655,0.00001746396,0.06642767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99684995,0.00023622478,0.0005437152,0.001147241,0.00071822444,0.0005046567],"domain_scores_gemma":[0.9979632,0.00014509071,0.0004050312,0.0008069556,0.0004121642,0.00026756598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044289022,0.00039127853,0.00076450413,0.0031613703,0.000911794,0.0004933877,0.0017813817,0.00015731527,0.00016275051],"category_scores_gemma":[0.000021603519,0.0005982428,0.00059427804,0.0077812294,0.0006368502,0.0010060421,0.001789491,0.00029175667,0.000042072013],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013475184,0.001360303,0.010040371,0.001125564,0.009150629,0.0022579075,0.0045009195,0.05613296,0.000020200278,0.8560741,0.033270307,0.025931967],"study_design_scores_gemma":[0.0033929835,0.0003775362,0.026761698,0.003257986,0.0077980035,0.00003826741,0.0051841685,0.11177738,0.000072792056,0.00504789,0.83402765,0.0022636715],"about_ca_topic_score_codex":0.0024357776,"about_ca_topic_score_gemma":0.004784327,"teacher_disagreement_score":0.85102624,"about_ca_system_score_codex":0.000535317,"about_ca_system_score_gemma":0.0003440048,"threshold_uncertainty_score":0.9996469},"labels":[],"label_agreement":null},{"id":"W7039310303","doi":"","title":"L'enseignement postsecondaire au Canada : un bilan positif, un avenir incertain /","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Public policy; Context (archaeology)","score_opus":0.00860369477815464,"score_gpt":0.20732958357908202,"score_spread":0.19872588880092737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039310303","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009888367,0.0127044935,0.06458604,0.03758275,0.000930061,0.0012442735,0.000749535,0.00066299626,0.8716515],"genre_scores_gemma":[0.39527708,0.00059954566,0.03603183,0.00888958,0.0010861732,0.00023164277,0.0002211716,0.00043154584,0.5572314],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933355,0.00076406216,0.0011989109,0.0014325113,0.0023228398,0.0009461741],"domain_scores_gemma":[0.9928539,0.0039264085,0.0011605294,0.0010985351,0.00028944452,0.0006712106],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069699343,0.001074207,0.00087151723,0.0010811172,0.00066721864,0.0007268951,0.0026786092,0.00024626844,0.0079330355],"category_scores_gemma":[0.0015879294,0.0011063949,0.0003123436,0.0014628494,0.00039609795,0.00051453116,0.0015276946,0.00073332316,0.0002503648],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00010396814,0.000659606,0.010187977,0.00024776682,0.0007561394,0.00021982181,0.008048205,0.005421505,0.00009740579,0.050927892,0.9146643,0.0086654015],"study_design_scores_gemma":[0.0013211002,0.00032655333,0.032347467,0.000616795,0.000107310356,0.00017073243,0.00010703417,0.027168866,0.0005473343,0.001034024,0.9346565,0.0015962861],"about_ca_topic_score_codex":0.9638775,"about_ca_topic_score_gemma":0.99935013,"teacher_disagreement_score":0.38538873,"about_ca_system_score_codex":0.025968226,"about_ca_system_score_gemma":0.29509342,"threshold_uncertainty_score":0.9991386},"labels":[],"label_agreement":null},{"id":"W7039511848","doi":"","title":"Measurement of $D^{* /-}$ Meson Production in Jets from Pp Collisions at Sqrt(S) = 7 TeV with the ATLAS Detector","year":2012,"lang":"en","type":"article","venue":"University of North Texas Digital Library (University of North Texas)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Institut National de Physique Nucléaire et de Physique des Particules; Agencia Nacional de Promoción Científica y Tecnológica; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; H. Lundbeck A/S; State Atomic Energy Corporation ROSATOM; Centre National pour la Recherche Scientifique et Technique; Centre National de la Recherche Scientifique; Israel Science Foundation; Max-Planck-Gesellschaft; Lundbeckfonden; Leverhulme Trust; General Secretariat for Research and Technology; Ministry of Education, Culture, Sports, Science and Technology; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Bundesministerium für Bildung und Forschung; Joint Institute for Nuclear Research; National Science Council; Japan Society for the Promotion of Science; Conselho Nacional de Desenvolvimento Científico e Tecnológico; U.S. Department of Energy; National Natural Science Foundation of China; Fundação de Amparo à Pesquisa do Estado de São Paulo; Ministerstwo Edukacji i Nauki; CERN; Deutsche Forschungsgemeinschaft; Services Fédéraux des Affaires Scientifiques, Techniques et Culturelles; Department of Science and Technology, Ministry of Science and Technology, India; Ministerio de Ciencia e Innovación; European Commission; Danmarks Grundforskningsfond; Alexander von Humboldt-Stiftung; Bundesministerium für Wissenschaft und Forschung; Javna Agencija za Raziskovalno Dejavnost RS; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Türkiye Atom Enerjisi Kurumu; National Science Foundation","keywords":"Pseudorapidity; Large Hadron Collider; Meson; Hadron; Rapidity; Atlas (anatomy); Monte Carlo method; Luminosity","score_opus":0.014616597433467132,"score_gpt":0.17321041255897715,"score_spread":0.15859381512551002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039511848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756736,0.00015914456,0.02211627,0.00040643656,0.000057920744,0.0003377695,0.000121221776,0.00016271937,0.00096490956],"genre_scores_gemma":[0.9890808,0.00008713481,0.0101529285,0.000010337871,0.000017159213,4.1444338e-8,0.000052343283,0.000010523204,0.0005887385],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984449,0.000109137785,0.00018747002,0.0003921745,0.00057455734,0.0002917395],"domain_scores_gemma":[0.99853307,0.00009083398,0.00043807516,0.00060620176,0.00018711263,0.00014473275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013181582,0.00020582761,0.0003473654,0.00026454794,0.0002302227,0.000026638805,0.0013437107,0.00007043085,0.000034331653],"category_scores_gemma":[0.000020913481,0.00020422693,0.00013542306,0.0010290188,0.00032128688,0.0028918493,0.000893819,0.00017066606,0.000018816338],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015925478,0.00027112008,0.9904503,0.000026724925,0.00006547601,0.000010819809,0.00028584088,0.0024391408,0.0000027809929,0.00007405633,0.0021988074,0.004015672],"study_design_scores_gemma":[0.0005373979,0.00018462726,0.9896196,0.00009787081,0.00003540583,0.0000034955654,0.000051254836,0.001415001,0.00088096014,0.000017649469,0.0069204774,0.0002362374],"about_ca_topic_score_codex":0.0003868899,"about_ca_topic_score_gemma":0.0011494214,"teacher_disagreement_score":0.013407185,"about_ca_system_score_codex":0.000108295855,"about_ca_system_score_gemma":0.00015530657,"threshold_uncertainty_score":0.83281326},"labels":[],"label_agreement":null},{"id":"W7039610714","doi":"","title":"Moleclar-dynamics simulations using spatial decomposition and task-based parallelism","year":2016,"lang":"en","type":"dissertation","venue":"Lu Zone Ul (Laurentian University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Compute Canada","keywords":"Xeon Phi; Xeon; Parallelism (grammar); Benchmark (surveying); Message Passing Interface; Task (project management); Domain decomposition methods; Decomposition; Interface (matter); Parallel processing","score_opus":0.008896332068634969,"score_gpt":0.23720619814792276,"score_spread":0.2283098660792878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039610714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011474124,0.00008614897,0.98499304,0.00017692594,0.00041300824,0.00024995918,0.000041720607,0.00043579616,0.0021292747],"genre_scores_gemma":[0.8445918,0.000072917974,0.14916378,0.00010016877,0.00011370194,0.0000010512049,0.0018015084,0.000051106403,0.0041039577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984262,0.00013987138,0.00024303497,0.0006228861,0.0002721628,0.000295838],"domain_scores_gemma":[0.99877167,0.000071363706,0.0003317551,0.00045582533,0.00023035657,0.00013903037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007087516,0.00031440714,0.00028936221,0.00083104824,0.0004758765,0.00018358468,0.00063108926,0.00033689287,0.000022574044],"category_scores_gemma":[0.000010060707,0.00035720866,0.00012241307,0.00048426643,0.00004811255,0.00038893466,0.00011367357,0.00023776275,0.000004773679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001100294,0.0018364466,0.0036845542,0.0013855936,0.0015154621,0.001181663,0.0079483725,0.4292316,0.011866202,0.33532274,0.004677385,0.20024967],"study_design_scores_gemma":[0.0007688285,0.00006299348,0.00021530876,0.0002657162,0.00010379254,0.0000052587775,0.00006269339,0.9943889,0.0008229417,0.0010376843,0.0017060111,0.00055988587],"about_ca_topic_score_codex":0.00011381747,"about_ca_topic_score_gemma":0.0011522181,"teacher_disagreement_score":0.83582926,"about_ca_system_score_codex":0.00021213637,"about_ca_system_score_gemma":0.00020444063,"threshold_uncertainty_score":0.999888},"labels":[],"label_agreement":null},{"id":"W7043078883","doi":"","title":"On the running of gravitational constant.pdf","year":2012,"lang":"en","type":"article","venue":"ScholarWorks@UMassAmherst (University of Massachusetts Amherst)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Gravitation; Planck; Coupling (piping); Quantum; Gravitational field; Quantum gravity; Gravitational acceleration","score_opus":0.01984709178067452,"score_gpt":0.22289798354694734,"score_spread":0.20305089176627283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043078883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06979246,0.00046980847,0.8184411,0.0040169107,0.00077840505,0.0005972492,0.000022076096,0.00049409526,0.10538789],"genre_scores_gemma":[0.9053066,0.000030116356,0.093320444,0.00024829907,0.000037712354,7.4125677e-7,0.00000872571,0.000013141973,0.0010342692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998063,0.00028834966,0.0002677773,0.0003223439,0.0006386207,0.00041988137],"domain_scores_gemma":[0.9977535,0.00059850037,0.00045285243,0.0006927927,0.00034523476,0.00015709203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014379306,0.00021692498,0.00030469807,0.0002479816,0.00048837357,0.00006441084,0.001439452,0.00016638472,0.00039672962],"category_scores_gemma":[0.00017911784,0.00020711697,0.00019583109,0.00071879145,0.00033822624,0.0010065602,0.000309794,0.00049706514,0.00019051862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018846118,0.00067811785,0.024383033,0.00007741005,0.0003524066,0.00001497435,0.005774152,0.004389274,0.0013433719,0.89063823,0.068236895,0.003923649],"study_design_scores_gemma":[0.021749888,0.0052104825,0.16132721,0.00530537,0.001063549,0.00018324426,0.034231737,0.33904976,0.0147147365,0.18509051,0.22155216,0.010521343],"about_ca_topic_score_codex":0.00003681583,"about_ca_topic_score_gemma":0.000003455647,"teacher_disagreement_score":0.83551407,"about_ca_system_score_codex":0.00009936709,"about_ca_system_score_gemma":0.00009949108,"threshold_uncertainty_score":0.8445985},"labels":[],"label_agreement":null},{"id":"W7067025481","doi":"","title":"Just-in-time binary translation of operating system kernels","year":2009,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Binary number; Kernel (algebra); Binary data; Translation (biology); Interface (matter); Computer program; Field (mathematics)","score_opus":0.014883928090440469,"score_gpt":0.2649319733617046,"score_spread":0.2500480452712641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067025481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50094557,0.010211819,0.41529503,0.0041176807,0.00392099,0.0051346766,0.0001333328,0.010017379,0.050223522],"genre_scores_gemma":[0.6919551,0.00017778654,0.30673113,0.000025836373,0.000041391213,0.00005354224,0.00019701043,0.000045924506,0.0007722653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966908,0.000083505736,0.0012928263,0.0008566798,0.0006138858,0.00046230387],"domain_scores_gemma":[0.9972075,0.00004259202,0.0011150935,0.0012067386,0.00036278696,0.000065241795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053047785,0.00053808314,0.0011142826,0.0023958462,0.00014337795,0.00006949327,0.002386559,0.0012955414,0.0000036306121],"category_scores_gemma":[0.00012148049,0.00057634205,0.00022455402,0.002202079,0.00014464061,0.0005869883,0.00013914528,0.00072171306,0.000011922617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030777222,0.0025556844,0.0039868746,0.0070327055,0.00095552974,0.00062120205,0.0070296694,0.11624559,0.095346265,0.1331397,0.0058422918,0.62693673],"study_design_scores_gemma":[0.0056384364,0.0024093778,0.007124862,0.020125208,0.00046297145,0.00016079194,0.0010382254,0.5759058,0.36390343,0.0036238467,0.0146428505,0.004964209],"about_ca_topic_score_codex":0.00006355264,"about_ca_topic_score_gemma":0.00006040086,"teacher_disagreement_score":0.6219725,"about_ca_system_score_codex":0.00018465696,"about_ca_system_score_gemma":0.00033173108,"threshold_uncertainty_score":0.9996688},"labels":[],"label_agreement":null},{"id":"W7067064640","doi":"","title":"Le conflit germano-soviétique, 1941-1945 : analyse des principaux enjeux militaires, politiques et stratégiques","year":2005,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ideology; Politics; Cold war; Soviet union; Front (military)","score_opus":0.01063312086753646,"score_gpt":0.21129222109633714,"score_spread":0.20065910022880068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067064640","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022376316,0.002288704,0.01995893,0.004253543,0.00008784458,0.00027433838,0.00021012126,0.00031306062,0.9723897],"genre_scores_gemma":[0.2652022,0.004810413,0.2620809,0.005877361,0.00029621602,0.00004074532,0.00007568046,0.0003152516,0.46130124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969548,0.00024547006,0.00048282222,0.0005909646,0.0012370091,0.000488963],"domain_scores_gemma":[0.99843174,0.0001845156,0.00039084128,0.0006261421,0.0000031365173,0.00036361525],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003869885,0.0004376427,0.000527099,0.00012487522,0.00018092628,0.00011103059,0.0009928702,0.00011517046,0.000076300945],"category_scores_gemma":[0.00000805016,0.00044787044,0.00007141744,0.00014438768,0.00019219225,0.00049922575,0.0004663947,0.00027649026,1.0986124e-8],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051824813,0.00007478366,0.00090809254,0.00035135413,0.00019074269,0.00010275014,0.0002643528,0.000181067,0.00023645649,0.93605566,0.051207937,0.010375003],"study_design_scores_gemma":[0.0005369685,0.00023062706,0.006364171,0.0010680786,0.000043322903,0.000029553175,0.0004153653,0.012801777,0.027521085,0.012861183,0.93673056,0.001397289],"about_ca_topic_score_codex":0.030690625,"about_ca_topic_score_gemma":0.11654463,"teacher_disagreement_score":0.92319447,"about_ca_system_score_codex":0.000018860252,"about_ca_system_score_gemma":0.005312725,"threshold_uncertainty_score":0.9997973},"labels":[],"label_agreement":null},{"id":"W7067134323","doi":"","title":"Machine learning in webassembly","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Implementation; Compiler; Overhead (engineering); Limiting; Interface (matter); Code (set theory); JavaScript; Function (biology)","score_opus":0.01635165168846014,"score_gpt":0.24804846120223487,"score_spread":0.23169680951377472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067134323","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15609275,0.0031892715,0.0029626759,0.0005858501,0.004791709,0.0027363466,0.00025737617,0.013643564,0.81574047],"genre_scores_gemma":[0.9329838,0.00066508685,0.056493163,0.0006636079,0.000050862025,0.00010390456,0.00070244004,0.00018357266,0.008153566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955531,0.0005653407,0.000954611,0.0014550633,0.0007644758,0.000707405],"domain_scores_gemma":[0.9978304,0.00021832885,0.00061921607,0.0007721899,0.0002552457,0.00030462016],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00087282405,0.00071526907,0.00078294525,0.000685875,0.00070973893,0.0002596062,0.0021346689,0.00064709294,0.0000414201],"category_scores_gemma":[0.00074681645,0.0008100119,0.00027572134,0.0015104258,0.000021682676,0.0008881779,0.00042991462,0.0025707656,0.00026642362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013850835,0.00034820155,0.00021464932,0.00047195476,0.00014438156,0.00047967397,0.00008099385,0.00739577,0.00849547,0.45735797,0.00003893681,0.5248335],"study_design_scores_gemma":[0.0031431953,0.0010070606,0.0019639132,0.0019867208,0.00012801023,0.0000963504,0.00013796808,0.27862206,0.11401118,0.07820367,0.5148286,0.005871215],"about_ca_topic_score_codex":0.00022178865,"about_ca_topic_score_gemma":0.00034007657,"teacher_disagreement_score":0.8075869,"about_ca_system_score_codex":0.00039490464,"about_ca_system_score_gemma":0.00009883489,"threshold_uncertainty_score":0.99973035},"labels":[],"label_agreement":null},{"id":"W7067287499","doi":"","title":"La formazione degli assistenti sociali per l'applicazione delle misure di contrasto alla poverta","year":2022,"lang":"it","type":"book-chapter","venue":"CINECA IRIS Institutional Research Information System (University of Bari Aldo Moro)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Economic analysis; Cost cutting","score_opus":0.052101314315147466,"score_gpt":0.2747254870742134,"score_spread":0.22262417275906593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7067287499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060113467,0.000254004,0.62164307,0.0011820022,0.0004055293,0.0012814667,0.0004945736,0.00034638584,0.3737918],"genre_scores_gemma":[0.95406127,0.0012213604,0.022322142,0.00017847621,0.00022308732,0.000026273292,0.0015152647,0.000053453008,0.02039868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99274945,0.0006482525,0.0012421518,0.0007553763,0.0037789524,0.00082584337],"domain_scores_gemma":[0.9934286,0.0005601015,0.0012574272,0.0010767911,0.0031855756,0.00049149495],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044832025,0.0005959447,0.0010112991,0.0017209843,0.004184954,0.00039196474,0.0026463934,0.00082714896,0.0013587432],"category_scores_gemma":[0.0001607098,0.00073967123,0.0006006409,0.0007557152,0.0012121567,0.0035468584,0.0023459438,0.0017543708,0.0006320112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002896641,0.00012578444,0.000097556134,0.0009497489,0.00040740205,0.000066522814,0.002753135,0.01608173,0.000031310738,0.9496928,0.021793282,0.007711065],"study_design_scores_gemma":[0.002296029,0.000312531,0.0013878513,0.0008196991,0.00009505936,0.0002448675,0.0035089292,0.15815671,0.000016303262,0.0003445551,0.8319877,0.0008297869],"about_ca_topic_score_codex":0.0012043874,"about_ca_topic_score_gemma":0.000032088486,"teacher_disagreement_score":0.95346016,"about_ca_system_score_codex":0.0021607035,"about_ca_system_score_gemma":0.0024920127,"threshold_uncertainty_score":0.99955416},"labels":[],"label_agreement":null},{"id":"W7070064151","doi":"","title":"Patrons, Clients, Brokers: Ontario Society and Politics, 1791–1896","year":2023,"lang":"en","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Agency (philosophy); Subject (documents)","score_opus":0.01956880665744458,"score_gpt":0.22823726355914012,"score_spread":0.20866845690169555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7070064151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096324846,0.000007479613,0.58422834,0.00095659203,0.0005943791,0.00090899953,0.00002802053,0.005667791,0.3112836],"genre_scores_gemma":[0.4602724,0.11915685,0.41383514,0.001749231,0.00035538562,0.000009987183,0.00013567574,0.000105676285,0.004379649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985587,0.000084197134,0.00014868253,0.00052944606,0.00022119065,0.00045780936],"domain_scores_gemma":[0.9991548,0.00007409005,0.00009048609,0.00046312643,0.00010147238,0.000116002506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020188569,0.00019370628,0.00018745245,0.0030290328,0.0003530948,0.00015265448,0.0007098499,0.00011584177,0.0000053545014],"category_scores_gemma":[0.000019063782,0.00021699906,0.0001255472,0.0048531415,0.00008356525,0.00051688886,0.0007802452,0.00022605553,0.00002783945],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012239456,0.0013199493,0.07754666,0.00048155434,0.0010971156,0.0010933586,0.16037557,0.004562728,0.000039442246,0.4222642,0.15450315,0.17659387],"study_design_scores_gemma":[0.0004743921,0.0000945448,0.0008173402,0.000028280712,0.000016621094,0.0000074244485,0.00016567421,0.025586916,0.000094989635,0.000019967852,0.9724175,0.00027639486],"about_ca_topic_score_codex":0.094053365,"about_ca_topic_score_gemma":0.010762842,"teacher_disagreement_score":0.8179143,"about_ca_system_score_codex":0.00026437535,"about_ca_system_score_gemma":0.00046923617,"threshold_uncertainty_score":0.91197944},"labels":[],"label_agreement":null},{"id":"W7084077008","doi":"10.64628/aam.yn37ngyrk","title":"It’s tax time! Do you know the difference between avoiding and evading taxes?","year":2019,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Work (physics); Order (exchange); Government (linguistics); Term (time); Payment","score_opus":0.01612403448248132,"score_gpt":0.24991136691091637,"score_spread":0.23378733242843505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084077008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034552366,0.00010074595,0.94587994,0.0028159504,0.00009515848,0.00018932876,0.0000015163728,0.00040852054,0.015956474],"genre_scores_gemma":[0.92714745,0.000042662046,0.060344066,0.00051247055,0.00005509571,0.000004824607,0.0000010668809,0.000007656347,0.011884717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896175,0.00011933487,0.0001546697,0.00034682834,0.00018756934,0.00022982224],"domain_scores_gemma":[0.998964,0.00036058258,0.000085630396,0.00047771216,0.000050574166,0.00006148849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029982,0.00012807164,0.00015426327,0.00007311339,0.00025604802,0.00037286957,0.0008001127,0.000054977358,0.000040827254],"category_scores_gemma":[0.00005917246,0.00008469475,0.00003421425,0.00024537562,0.00003487364,0.00021228731,0.00047102736,0.000186756,0.00013832908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012924807,0.000115061855,0.21048878,0.00012029163,0.00017848478,0.0000097077755,0.009967546,0.0026684697,0.008484849,0.16380115,0.101943694,0.50220907],"study_design_scores_gemma":[0.00043856615,0.00018142942,0.018099733,0.00019794216,0.000016211614,0.000020542897,0.000084100684,0.93933064,0.00977539,0.008004867,0.023143044,0.000707543],"about_ca_topic_score_codex":0.000021234855,"about_ca_topic_score_gemma":0.0000010361673,"teacher_disagreement_score":0.93666214,"about_ca_system_score_codex":0.000018355167,"about_ca_system_score_gemma":0.000022368546,"threshold_uncertainty_score":0.359559},"labels":[],"label_agreement":null},{"id":"W7092211971","doi":"10.1145/3725843.3756070","title":"SHADOW: Simultaneous Multi-Threading Architecture with Asymmetric Threads","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Architecture; Systems architecture; Set (abstract data type); Component (thermodynamics); Scheme (mathematics)","score_opus":0.012967145569406676,"score_gpt":0.2697854785938272,"score_spread":0.2568183330244205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092211971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021978267,0.0016541559,0.9378532,0.0015219366,0.00049321965,0.0006879296,0.000003703615,0.0016128983,0.055953138],"genre_scores_gemma":[0.5226524,0.00012523735,0.46255854,0.0011454794,0.00004749246,0.000014618277,0.0000033333133,0.000023419518,0.013429492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959634,0.00023162061,0.0007332992,0.0014886376,0.0005879566,0.0009950651],"domain_scores_gemma":[0.99653184,0.00097486953,0.00027990283,0.0014316987,0.00052262354,0.00025903157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056401547,0.0007001306,0.00067731243,0.0015903395,0.00071075774,0.0009556236,0.0021325129,0.00034508161,0.000045379984],"category_scores_gemma":[0.00039427044,0.0005678872,0.00018847059,0.0063045137,0.0002390237,0.00030506228,0.00086559606,0.0008088506,0.00006254229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007923758,0.00040513958,0.0009817156,0.00009141152,0.00016748485,0.00011499372,0.0006235321,0.5279357,0.000021394162,0.028903915,0.001278467,0.439397],"study_design_scores_gemma":[0.0010475273,0.0004991119,0.00018881982,0.00045606346,0.00005867149,0.000059958824,0.000031450894,0.9901316,0.0020556175,0.0018283246,0.0029236472,0.0007192078],"about_ca_topic_score_codex":0.00021133537,"about_ca_topic_score_gemma":0.00008314211,"teacher_disagreement_score":0.5224326,"about_ca_system_score_codex":0.00018184923,"about_ca_system_score_gemma":0.0004979212,"threshold_uncertainty_score":0.99967724},"labels":[],"label_agreement":null},{"id":"W7092505648","doi":"10.18419/darus-5056","title":"Replication Data for: Parallel FFTW on RISC-V: A Comparative Study including OpenMP, MPI, and HPX","year":2025,"lang":"","type":"dataset","venue":"Universitätsbibliothek Stuttgart","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Glycemic Index Laboratories","funders":"","keywords":"Replication (statistics); DNA replication; Independent and identically distributed random variables; DNA","score_opus":0.14016632961475306,"score_gpt":0.39315435872547955,"score_spread":0.2529880291107265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092505648","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021651543,0.000664102,0.63099056,0.0012867933,0.00077568804,0.0074726795,0.35260716,0.0006132085,0.0053732744],"genre_scores_gemma":[0.009122539,0.0059466194,0.13942747,0.0023806524,0.0005859842,0.00024396382,0.83167106,0.000092940805,0.010528759],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99098563,0.0009340994,0.0012099566,0.0048932596,0.0009995595,0.0009774999],"domain_scores_gemma":[0.9845875,0.0016425621,0.0012822812,0.01134533,0.0007722132,0.00037011944],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0028374009,0.0012302506,0.0016771759,0.0063301525,0.0024519162,0.0018238869,0.0102552725,0.0005193072,0.000058717476],"category_scores_gemma":[0.00050423265,0.0013361787,0.00018641747,0.0062420834,0.00038361078,0.0029293976,0.012004939,0.0010501652,0.00003682607],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041108226,0.0014412985,0.000094471,0.00015190667,0.00062216085,0.00003222074,0.0012240617,0.0023198512,0.0000019593988,0.002939587,0.98893136,0.0018300647],"study_design_scores_gemma":[0.0032283776,0.0020081345,0.00013795294,0.0006367491,0.00047517326,0.000012768902,0.0011970769,0.15953127,0.000016699467,0.00037539995,0.8311401,0.0012403053],"about_ca_topic_score_codex":0.00028704372,"about_ca_topic_score_gemma":0.000128857,"teacher_disagreement_score":0.4915631,"about_ca_system_score_codex":0.00037027578,"about_ca_system_score_gemma":0.0007854435,"threshold_uncertainty_score":0.9992123},"labels":[],"label_agreement":null},{"id":"W7094520818","doi":"","title":"Histoire<br />et géographie du bal en France.: Une évolution qui accompagne celle des<br />structures socio-politiques.","year":2001,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Fusible alloy; Triacetin","score_opus":0.016239137083407316,"score_gpt":0.24295629614891215,"score_spread":0.22671715906550483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094520818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022624895,0.004586835,0.85411626,0.028055653,0.0011481489,0.0007239393,0.000054089756,0.0017722168,0.086917974],"genre_scores_gemma":[0.54554534,0.0049935244,0.42752203,0.00047800512,0.00019873051,0.000112243164,0.00047674077,0.00010437564,0.020569015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98306054,0.011386438,0.0014102258,0.0019824365,0.0009817595,0.001178586],"domain_scores_gemma":[0.98822194,0.0019692606,0.0013469071,0.0035360686,0.004386065,0.0005397612],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0071719442,0.0010175272,0.0009851438,0.00062207854,0.0020533346,0.0012522334,0.004374663,0.0008500887,0.00041022684],"category_scores_gemma":[0.001143893,0.0011882145,0.000691184,0.0019583968,0.0025098792,0.0007908188,0.0031628646,0.001652922,0.000063261476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018424156,0.0010392814,0.012602055,0.00023377116,0.00015934238,0.00002199158,0.019577214,0.005861766,0.0005091042,0.8784366,0.011138818,0.0704016],"study_design_scores_gemma":[0.0020966814,0.0000070904293,0.10183093,0.0040137894,0.00019567637,0.0002169646,0.00046727626,0.4307961,0.013387637,0.34728864,0.096585535,0.003113707],"about_ca_topic_score_codex":0.019882748,"about_ca_topic_score_gemma":0.0015644208,"teacher_disagreement_score":0.531148,"about_ca_system_score_codex":0.0006318738,"about_ca_system_score_gemma":0.00077404565,"threshold_uncertainty_score":0.9997846},"labels":[],"label_agreement":null},{"id":"W7094718228","doi":"","title":"Michael C. Mineiro","year":2014,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Space law; Space (punctuation); Space policy; Government (linguistics); Outer space; Administration (probate law); Service (business); Sustainability","score_opus":0.015788586870356187,"score_gpt":0.2511812727096098,"score_spread":0.23539268583925363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094718228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003161475,0.0001793087,0.85092354,0.0020972202,0.00064634916,0.00011141779,3.8356862e-7,0.00077523245,0.14495043],"genre_scores_gemma":[0.4793008,0.000055539356,0.50226194,0.0023255171,0.00023187,0.0000038838803,0.0000013466504,0.000013851912,0.015805243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980235,0.00019517665,0.0004133091,0.0006267092,0.00028861582,0.00045265333],"domain_scores_gemma":[0.99839485,0.00013544544,0.00014629963,0.00095993635,0.00017158082,0.0001918816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065739977,0.00025219982,0.00026303556,0.00016053878,0.00022128553,0.00036237662,0.0012990029,0.00014195191,0.00017012164],"category_scores_gemma":[0.00011980716,0.00024148377,0.00011777729,0.00048820194,0.000086364176,0.00028154097,0.00051433675,0.00016892582,0.00048454164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065717054,0.00022412576,0.00046529583,0.00004287003,0.000030429706,0.000004138437,0.0007439095,0.0075452705,0.00019076525,0.4375233,0.110457614,0.4427657],"study_design_scores_gemma":[0.00021122105,0.00014756407,0.0002406452,0.000031981424,0.000005607523,0.000011904504,0.0000032951873,0.9270435,0.0021976868,0.00439999,0.065386996,0.00031958733],"about_ca_topic_score_codex":0.000039647424,"about_ca_topic_score_gemma":0.0000028691584,"teacher_disagreement_score":0.91949826,"about_ca_system_score_codex":0.00002456978,"about_ca_system_score_gemma":0.000058231566,"threshold_uncertainty_score":0.98474216},"labels":[],"label_agreement":null},{"id":"W7095104898","doi":"","title":"Cryogenesis and soil formation along a bioclimate gradient in Arctic North America","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tundra; Arctic; Soil water; Permafrost; Vegetation (pathology); Frost (temperature); Taiga; Arctic vegetation; Soil carbon; Arctic geoengineering","score_opus":0.017519922498520166,"score_gpt":0.22391503607918758,"score_spread":0.20639511358066742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095104898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36589167,0.000048945643,0.63320345,0.00013534952,0.000025031262,0.00005745469,2.1271161e-7,0.00019713737,0.0004407848],"genre_scores_gemma":[0.86652786,0.00027683342,0.1328773,0.00025967753,0.0000054351367,0.0000088465,0.0000022041884,0.0000028413099,0.0000389885],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999363,0.000033864064,0.00017501811,0.00017488307,0.000097473145,0.00015575255],"domain_scores_gemma":[0.9996625,0.00002635288,0.000055805933,0.0001732508,0.00003694998,0.000045150147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007087795,0.00007477113,0.00009290838,0.0001542729,0.00010206804,0.00003554237,0.00017922641,0.000018995768,0.0000017745965],"category_scores_gemma":[0.000014021504,0.00006697837,0.000018693681,0.0003837376,0.000031844986,0.0003176815,0.000107875545,0.000038813116,0.0000072984635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036238096,0.0006618134,0.64002275,0.0002164551,0.000041143165,0.00021562316,0.019953828,0.13033892,0.0004304504,0.009475905,0.0076885424,0.19091834],"study_design_scores_gemma":[0.00021843788,0.00006728399,0.05301578,0.000015916423,0.000001463803,0.000056713834,0.000019888215,0.94453716,0.0011314112,0.00040216494,0.00035327303,0.00018051169],"about_ca_topic_score_codex":0.00029463758,"about_ca_topic_score_gemma":0.00024333615,"teacher_disagreement_score":0.81419826,"about_ca_system_score_codex":0.000025643021,"about_ca_system_score_gemma":0.000015387941,"threshold_uncertainty_score":0.27312985},"labels":[],"label_agreement":null},{"id":"W7095313404","doi":"","title":"Scalar Optimization and Code Generation Development at the University of Toronto","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Code generation; Compiler; Uniprocessor system; Locality; Code (set theory); Optimizing compiler; Scalar (mathematics); Source code; Representation (politics)","score_opus":0.015463514145168588,"score_gpt":0.22351027423471667,"score_spread":0.2080467600895481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095313404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005298267,0.00012979135,0.9908882,0.00012340854,0.000025767571,0.000055645676,1.4864911e-7,0.00008301989,0.0033957863],"genre_scores_gemma":[0.15580937,0.000073546114,0.84315974,0.000066893386,0.0000074543145,9.803763e-8,0.0000027085662,0.0000014674943,0.0008787217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996478,0.000019234314,0.00007992083,0.0001086264,0.00008249154,0.000061906714],"domain_scores_gemma":[0.99973017,0.000020540841,0.000042756168,0.00012720107,0.000057095593,0.00002224653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033027303,0.000036204558,0.00003875928,0.000010524928,0.00017666753,0.000014713448,0.00015321525,0.00002349901,0.00002965052],"category_scores_gemma":[0.000004756217,0.00002871409,0.000008034078,0.00004673138,0.000022977347,0.00013387811,0.00013948775,0.000013751725,0.0000011772067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020832424,0.000103045495,0.0025686056,0.00001750225,0.00003824761,0.000004063861,0.008082212,0.74965495,0.0028590332,0.04149317,0.015370692,0.17978765],"study_design_scores_gemma":[0.000091163085,0.00001348355,0.0017194605,0.0000030222657,0.0000013890251,0.0000022586164,0.000028183722,0.9759226,0.016016359,0.000012329239,0.006132871,0.00005687829],"about_ca_topic_score_codex":0.000073237345,"about_ca_topic_score_gemma":0.0007353278,"teacher_disagreement_score":0.22626765,"about_ca_system_score_codex":0.000060403505,"about_ca_system_score_gemma":0.000018973495,"threshold_uncertainty_score":0.13588016},"labels":[],"label_agreement":null},{"id":"W7095321200","doi":"","title":"Natural Resource Scarity and Technological Change","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Natural resource; Scarcity; Non-renewable resource; Technological change; Resource (disambiguation); Quarter (Canadian coin); Investment (military)","score_opus":0.02669269668395562,"score_gpt":0.26980076652348184,"score_spread":0.2431080698395262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095321200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008343109,0.00028253987,0.9760088,0.0012220027,0.000033408258,0.00007783778,6.732352e-8,0.0015088201,0.012523471],"genre_scores_gemma":[0.7184252,0.0000092903965,0.28072724,0.00063956087,0.000019856863,0.0000016346124,3.2562895e-7,0.0000015923433,0.00017526401],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942154,0.000016501635,0.000090998125,0.00020547376,0.00009777439,0.00016773496],"domain_scores_gemma":[0.9996438,0.00005461124,0.000024502056,0.00020924477,0.000025124862,0.00004269289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047935528,0.00006267857,0.000066374036,0.000086410015,0.000087358254,0.00005882168,0.0003365849,0.00006742934,0.0000019817235],"category_scores_gemma":[0.00003529071,0.000048548653,0.000015510575,0.0002833602,0.0000633245,0.00013452176,0.0003104884,0.00012207784,0.000003775034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046466403,0.000028066079,0.0025870667,0.0000048610304,0.0000042874185,0.000021819103,0.00020219406,0.0000042196066,0.00023650096,0.480508,0.0020682742,0.51433],"study_design_scores_gemma":[0.0010503541,0.00040799982,0.11198331,0.00007466311,0.000008539324,0.00044869276,0.00014324079,0.6428093,0.048446577,0.050449576,0.14266437,0.001513389],"about_ca_topic_score_codex":0.000009512811,"about_ca_topic_score_gemma":0.0000029205335,"teacher_disagreement_score":0.7100821,"about_ca_system_score_codex":0.000010433482,"about_ca_system_score_gemma":0.0000030983317,"threshold_uncertainty_score":0.19797567},"labels":[],"label_agreement":null},{"id":"W7095594600","doi":"","title":"Atmospheric Chemistry and Physics Boreal forest fire emissions in fresh Canadian smoke plumes: C1-C10","year":2011,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Atmospheric chemistry; Taiga; Smoke; Boreal; Atmosphere (unit); Air pollution; Atmospheric emissions","score_opus":0.017577558891455024,"score_gpt":0.22788879024457828,"score_spread":0.21031123135312327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095594600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11739158,0.00015607286,0.7173046,0.00027161042,0.000073062794,0.00016509654,0.0000034494694,0.0005485646,0.16408597],"genre_scores_gemma":[0.7432144,0.000026705424,0.25594676,0.00021810949,0.000020290681,0.000007206542,0.00000421362,0.0000067766055,0.00055555446],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920726,0.000015434864,0.00014686969,0.00027658476,0.00008534668,0.00026852748],"domain_scores_gemma":[0.999342,0.000017398641,0.000039526167,0.00033336092,0.00003879389,0.0002288847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007987134,0.000117985546,0.000114910035,0.0000044523727,0.00010560224,0.000060062077,0.0004393342,0.000084349434,0.00003946837],"category_scores_gemma":[0.000020548554,0.000110198154,0.000024425406,0.00029586052,0.000042196505,0.0001647007,0.00012884033,0.00012329363,0.0000029066068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001125614,0.00034065684,0.641354,0.000101162026,0.000044422108,0.00018363302,0.007504183,0.0026947055,0.0000732237,0.04734234,0.038713668,0.26163673],"study_design_scores_gemma":[0.00018262316,0.000024313564,0.08625525,0.000035481717,0.0000021744422,0.000009911565,0.00004832769,0.90623665,0.00081887323,0.005041189,0.0010923903,0.0002528059],"about_ca_topic_score_codex":0.11264658,"about_ca_topic_score_gemma":0.02269574,"teacher_disagreement_score":0.9035419,"about_ca_system_score_codex":0.000053407108,"about_ca_system_score_gemma":0.00019472903,"threshold_uncertainty_score":0.9951375},"labels":[],"label_agreement":null},{"id":"W7096611084","doi":"","title":"Managing Compilation Overheads in a Runtime Specializer for OpenMP Abstract","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Runtime system; Benchmark (surveying); Java; Key (lock); Spec#; Optimizing compiler; Just-in-time compilation","score_opus":0.0402471859131741,"score_gpt":0.2890657538307695,"score_spread":0.24881856791759538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096611084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023360096,0.0000208207,0.95455915,0.00078847195,0.000092574475,0.00023622924,7.4112023e-7,0.00032402689,0.04164198],"genre_scores_gemma":[0.5215912,0.000024169829,0.47651857,0.0003730029,0.00005085968,0.000014723476,0.000006274475,0.0000065944832,0.001414581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923337,0.000015192163,0.00021574931,0.00023707809,0.00012153486,0.00017706688],"domain_scores_gemma":[0.9995746,0.00006364761,0.00005864993,0.00022455858,0.00004664823,0.00003190727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022567886,0.000083729385,0.00012070718,0.00014742414,0.00011385949,0.00006826011,0.0003735156,0.0000374525,0.000027807177],"category_scores_gemma":[0.00001539357,0.00008239171,0.000040383715,0.00024277641,0.000016952308,0.00036986516,0.00008911328,0.000055826,0.000022386133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009444202,0.0007396833,0.024307521,0.00010299129,0.00004516052,0.000097883545,0.0042522266,0.24159205,0.0008123247,0.53190464,0.124286324,0.071764745],"study_design_scores_gemma":[0.0005128149,0.000038232425,0.034292564,0.000027256485,8.937422e-7,0.00001258159,0.0000041125963,0.94738567,0.0011366337,0.009404016,0.0069859354,0.00019927841],"about_ca_topic_score_codex":0.000048858023,"about_ca_topic_score_gemma":0.000008059927,"teacher_disagreement_score":0.7057936,"about_ca_system_score_codex":0.000035678542,"about_ca_system_score_gemma":0.000030129255,"threshold_uncertainty_score":0.33598363},"labels":[],"label_agreement":null},{"id":"W7097033443","doi":"","title":"University of Toronto Dependence Testing for Parallelizing Compilers ECE 1754 Survey Paper","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Compiler; Terminology; Dependence analysis; Simple (philosophy); Parallelism (grammar); Unit testing","score_opus":0.0476319984031204,"score_gpt":0.2595850057699418,"score_spread":0.2119530073668214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097033443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015885953,0.00012332725,0.9785817,0.00002853553,0.000064624364,0.00013470373,0.0000018330874,0.00026240625,0.01921425],"genre_scores_gemma":[0.42934546,0.000014509012,0.57032126,0.000061361505,0.0000031756954,4.490045e-7,0.0000014599331,0.0000032514408,0.00024907582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991443,0.00013647,0.00014742749,0.00026286006,0.00012093446,0.00018801002],"domain_scores_gemma":[0.9988143,0.00048340147,0.00010129641,0.00029858953,0.00024682007,0.000055595527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006980393,0.00008905091,0.00014110321,0.00001856546,0.00014829962,0.000031633233,0.0005346578,0.00004626001,0.000027085562],"category_scores_gemma":[0.00026771054,0.00009407759,0.000041624422,0.00013971304,0.000027981012,0.0003814618,0.000089634086,0.00004111987,0.000002325777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096558666,0.0005881855,0.23060478,0.00019356246,0.00016238359,0.00001826691,0.002940875,0.1239236,0.0047416086,0.53297687,0.032237645,0.071515664],"study_design_scores_gemma":[0.0012733634,0.00039440542,0.076849535,0.00009070893,0.000013719432,0.00001665495,0.00024158155,0.90254575,0.0042396677,0.0033370813,0.010181495,0.00081600866],"about_ca_topic_score_codex":0.002953799,"about_ca_topic_score_gemma":0.001386776,"teacher_disagreement_score":0.77862215,"about_ca_system_score_codex":0.000045245924,"about_ca_system_score_gemma":0.00007899638,"threshold_uncertainty_score":0.44652805},"labels":[],"label_agreement":null},{"id":"W7097212885","doi":"","title":"Kernel scalability—expanding the horizon beyond fine grain locks. Ottawa Linux Symposium","year":2007,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Kernel (algebra); Locality; Scalability; Cache; Process (computing); Lock (firearm); CPU cache; Memory management","score_opus":0.009640384309124166,"score_gpt":0.2596452241370327,"score_spread":0.25000483982790855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097212885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074943537,0.00007370568,0.9560003,0.0029574283,0.0003719967,0.00020867617,8.38044e-7,0.0010024762,0.031890176],"genre_scores_gemma":[0.8370299,0.000010463559,0.159606,0.0006220399,0.00016010487,0.000007267022,0.0000029370967,0.000012401657,0.0025489351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983093,0.00008764005,0.00039942327,0.00045156284,0.00032387636,0.00042820562],"domain_scores_gemma":[0.99856293,0.00029496392,0.00011321188,0.00078600424,0.00013035089,0.0001125644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017062775,0.00018201252,0.00016601378,0.00012931107,0.00032103749,0.00022677646,0.0011702538,0.00009627099,0.00001981778],"category_scores_gemma":[0.00007407864,0.00012464539,0.00009413953,0.0006676191,0.00008851958,0.00023801022,0.00036849212,0.0002167756,0.000034782865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000543166,0.0008095251,0.022167029,0.00008945689,0.00012234754,0.0000737337,0.004352965,0.018700326,0.011143472,0.5108787,0.15718397,0.2744242],"study_design_scores_gemma":[0.0014707478,0.0011437848,0.007340119,0.00011068384,0.000033312746,0.00013089486,0.0002521877,0.70256454,0.1761002,0.056062598,0.05297921,0.0018117246],"about_ca_topic_score_codex":0.000063697305,"about_ca_topic_score_gemma":0.0000914624,"teacher_disagreement_score":0.8295355,"about_ca_system_score_codex":0.00006575314,"about_ca_system_score_gemma":0.00004461205,"threshold_uncertainty_score":0.50828916},"labels":[],"label_agreement":null},{"id":"W7097347886","doi":"","title":"UNIVERSITY OF TORONTO","year":2003,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cache; Variety (cybernetics); Cache algorithms; Cache pollution; CPU cache; Generator (circuit theory); Smart Cache; Cache invalidation","score_opus":0.010045442155234504,"score_gpt":0.21256210190041624,"score_spread":0.20251665974518174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097347886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017812286,0.00003911085,0.7696005,0.000019291394,0.000016638684,0.00001074718,2.5755714e-8,0.0001079584,0.23002762],"genre_scores_gemma":[0.3698324,0.000021007527,0.62850934,0.000025090145,8.528203e-7,1.4482856e-8,4.7602818e-8,5.195906e-7,0.0016107209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998177,0.000019409465,0.000028456077,0.00005965344,0.000036144753,0.000038584214],"domain_scores_gemma":[0.99979657,0.000009152513,0.000015764948,0.00013716138,0.000026448251,0.000014874653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006426801,0.000018277313,0.00003060643,0.00000497702,0.00002110933,0.0000045174706,0.00018300967,0.000011220856,0.00008304531],"category_scores_gemma":[0.000005786749,0.000018458513,0.0000131142615,0.00003386129,0.00000720418,0.00010176984,0.000026586977,0.000008551751,0.000004116866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.5695751e-7,0.000018273171,0.0002272034,0.0000013105672,0.0000022944669,7.634087e-7,0.00017991726,0.00035806868,0.00007113587,0.98973876,0.0047035962,0.00469832],"study_design_scores_gemma":[0.0009629144,0.00027675537,0.00431783,0.000025156938,0.0000069304974,0.000018825283,0.00027893434,0.4810155,0.051246095,0.026193682,0.43503907,0.0006183002],"about_ca_topic_score_codex":0.00019657798,"about_ca_topic_score_gemma":0.00002654306,"teacher_disagreement_score":0.9635451,"about_ca_system_score_codex":0.000009760136,"about_ca_system_score_gemma":0.0000148875315,"threshold_uncertainty_score":0.090928786},"labels":[],"label_agreement":null},{"id":"W7097571842","doi":"","title":"Edmonton, Alberta,","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Component (thermodynamics); Animation; Asynchronous communication; Architecture; Computation; Parallel programming model; Visualization","score_opus":0.01655445578611647,"score_gpt":0.23319621898250079,"score_spread":0.2166417631963843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097571842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081548054,0.000021077783,0.8303847,0.000508057,0.000046544963,0.000026230846,1.8416488e-8,0.00048377534,0.16771416],"genre_scores_gemma":[0.4430307,0.000022856044,0.5389587,0.00082437176,0.000023610233,0.000002999579,4.0978452e-7,0.0000029138773,0.017133454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995613,0.000014661817,0.000083780156,0.0001452116,0.000086423584,0.000108612025],"domain_scores_gemma":[0.9995956,0.00003377677,0.000020081763,0.00027373727,0.0000356958,0.000041099403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047159912,0.000049386028,0.000054020333,0.000039007755,0.00010091837,0.000022133128,0.0004080778,0.000022498596,0.000027101172],"category_scores_gemma":[0.000015669908,0.000041994066,0.000024629655,0.00015450151,0.000016536926,0.00016679695,0.00009205397,0.000034038116,0.00012333774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024899098,0.00013871495,0.004129095,0.000004016996,0.00001537944,0.000040432147,0.001647125,0.0036870267,0.00016985448,0.57632256,0.39114255,0.022700751],"study_design_scores_gemma":[0.00031178523,0.000096491705,0.007420114,0.0000075207886,0.000001342991,0.00022516091,0.0000037565385,0.85025305,0.0098607605,0.006678461,0.12470392,0.00043765764],"about_ca_topic_score_codex":0.00016552948,"about_ca_topic_score_gemma":0.00000866936,"teacher_disagreement_score":0.846566,"about_ca_system_score_codex":0.000007344669,"about_ca_system_score_gemma":0.00002282689,"threshold_uncertainty_score":0.17124684},"labels":[],"label_agreement":null},{"id":"W7097595441","doi":"","title":"1ELSA Performance Analysis","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Cluster analysis; Graph; Communications system; Metis; Job shop scheduling","score_opus":0.02000475021228546,"score_gpt":0.23624523214521503,"score_spread":0.21624048193292958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097595441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034220673,0.000016570017,0.93195647,0.00013218755,0.00002572562,0.000019562995,5.1888275e-8,0.00066015695,0.032968603],"genre_scores_gemma":[0.6898821,0.00004010578,0.3079954,0.00020421117,0.000008052791,0.0000014916785,5.951183e-7,0.0000011413301,0.0018668934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950624,0.000015248639,0.00009631932,0.0001583812,0.000115817726,0.000108020344],"domain_scores_gemma":[0.9995584,0.000015329662,0.000027139393,0.0003158791,0.000047844394,0.0000354133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086191336,0.000050224597,0.000083215884,0.00015847245,0.00013306261,0.000024447592,0.00042090568,0.000021098487,0.00002534366],"category_scores_gemma":[0.0000054758593,0.00004236128,0.000052554777,0.001012489,0.000018080073,0.0001974223,0.00008876684,0.000039624912,0.000046059882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007689821,0.00029832343,0.316097,0.000016992553,0.00059526885,0.00005843861,0.0024985317,0.42838258,0.00013743271,0.118006185,0.050370052,0.08353152],"study_design_scores_gemma":[0.000036880523,0.000017386708,0.022125173,7.4384843e-7,0.0000056136278,0.000009358783,5.8043076e-7,0.97466016,0.0014353289,0.00007953326,0.0015507643,0.0000784851],"about_ca_topic_score_codex":0.000009175098,"about_ca_topic_score_gemma":6.009671e-7,"teacher_disagreement_score":0.6556614,"about_ca_system_score_codex":0.000008174767,"about_ca_system_score_gemma":0.000018286144,"threshold_uncertainty_score":0.17274429},"labels":[],"label_agreement":null},{"id":"W7097893434","doi":"","title":"Canada Contents An interblock VLIW-targeted instruction scheduler for GCC 1","year":2006,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Documentation; Context (archaeology); Scheduling (production processes); Negotiation","score_opus":0.013669025572827651,"score_gpt":0.23270953151495608,"score_spread":0.21904050594212843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097893434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031715993,0.000015522088,0.9650534,0.00040275248,0.0003508084,0.00015919402,0.0000029524072,0.00044670116,0.0018526982],"genre_scores_gemma":[0.66904676,5.4838705e-7,0.3297199,0.00043019082,0.000051756895,0.000011823336,0.000014723169,0.0000051982547,0.00071907556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999197,0.000025959147,0.00019496132,0.00025889892,0.00013519835,0.00018796987],"domain_scores_gemma":[0.99942315,0.000020485419,0.00006780947,0.00026570872,0.00016885634,0.000054018583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008260953,0.00009734414,0.00010049373,0.00006169571,0.00011680817,0.000096934826,0.00040826763,0.00004221869,0.0000079032625],"category_scores_gemma":[0.00001629939,0.00008961361,0.000028530478,0.00015318401,0.000012733955,0.00028849568,0.00006158479,0.000051178515,0.0000014864719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000719184,0.00044326557,0.007430176,0.000058895304,0.00007891533,0.000012282573,0.00020073936,0.056043465,0.0042875065,0.4783696,0.37272504,0.08027822],"study_design_scores_gemma":[0.0005766001,0.00009310518,0.0025745793,0.000010683913,0.0000026841537,0.000009855731,0.000012324335,0.95740795,0.020279888,0.003494219,0.015299199,0.00023890949],"about_ca_topic_score_codex":0.21992306,"about_ca_topic_score_gemma":0.12040791,"teacher_disagreement_score":0.9013645,"about_ca_system_score_codex":0.00007525459,"about_ca_system_score_gemma":0.00013906189,"threshold_uncertainty_score":0.89564234},"labels":[],"label_agreement":null},{"id":"W7098088540","doi":"","title":"Biography","year":2008,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rendering (computer graphics); Java; Forgetting; Focus (optics); Buffer (optical fiber)","score_opus":0.02005389557350968,"score_gpt":0.2339421628627969,"score_spread":0.21388826728928723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098088540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00125352,0.000030306343,0.94447935,0.0002269503,0.000042419328,0.000019410645,3.2366653e-8,0.0010091559,0.05293888],"genre_scores_gemma":[0.4421822,0.000018990824,0.55689734,0.00037135486,0.000008667742,0.0000012054361,1.7580886e-7,0.0000011487992,0.0005188777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996913,0.000009905468,0.00005452805,0.0001041985,0.000064993576,0.00007505174],"domain_scores_gemma":[0.99972755,0.000010572203,0.000012851458,0.00019708113,0.000024732895,0.000027201244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038781345,0.000033482207,0.0000348864,0.00008353784,0.00008110866,0.00001615756,0.0003080978,0.000014565748,0.000008770993],"category_scores_gemma":[0.0000036104225,0.000027829421,0.000028506593,0.00032570786,0.000017782828,0.000108180415,0.000060865743,0.00002316096,0.000037328067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017515544,0.00015006769,0.021602584,0.000003697858,0.000019741721,0.00005247956,0.000739136,0.0031307214,0.00017085383,0.64726347,0.29661694,0.030248577],"study_design_scores_gemma":[0.0003139071,0.00012835662,0.01748427,0.000006886822,0.0000012374919,0.00012377003,0.0000037495604,0.88700396,0.016022965,0.012741972,0.06569803,0.0004708856],"about_ca_topic_score_codex":0.00000661931,"about_ca_topic_score_gemma":9.842042e-8,"teacher_disagreement_score":0.8838732,"about_ca_system_score_codex":0.0000020658108,"about_ca_system_score_gemma":0.0000094699835,"threshold_uncertainty_score":0.11348509},"labels":[],"label_agreement":null},{"id":"W7098136535","doi":"","title":"To appear in the 9th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2010), Vancouver. FlexSC: Flexible System Call Scheduling with Exception-Less System Calls","year":2010,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"System call; Thread (computing); File system; Scheduling (production processes); POSIX; Server; Multi-core processor; Embedded operating system; Remote procedure call; Legacy system","score_opus":0.020655400851250286,"score_gpt":0.27048617288558446,"score_spread":0.24983077203433418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098136535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02663276,0.000015326394,0.96862936,0.00020920445,0.0010892904,0.001484836,0.000001715474,0.0007365399,0.0012009882],"genre_scores_gemma":[0.75391954,0.0000024192796,0.24536599,0.00013722053,0.00008703204,0.00016485571,0.00000257826,0.00001808181,0.00030230512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761254,0.00039756883,0.00050653546,0.0006090263,0.00047543476,0.00039887516],"domain_scores_gemma":[0.99866194,0.0002179492,0.00017346186,0.00063763926,0.00018307494,0.0001259682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019544184,0.0002647721,0.00028712137,0.0002359,0.00042008524,0.00086063356,0.00074122334,0.00010368789,0.000001387618],"category_scores_gemma":[0.000013341383,0.00017873583,0.000028188422,0.0005328203,0.000027166057,0.0004103567,0.00014056542,0.00029222626,0.000014616168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028740915,0.00006432194,0.0011201506,0.00033295853,0.000025928945,0.000028872422,0.0037103395,0.9213246,0.004028792,0.065053776,0.0030032042,0.0012783103],"study_design_scores_gemma":[0.00055832113,0.00030418343,0.00014239005,0.0004894467,0.00000964233,0.0001028013,0.0032626719,0.99205786,0.002542701,0.0000056936087,0.0001763751,0.00034792823],"about_ca_topic_score_codex":0.0010030317,"about_ca_topic_score_gemma":0.00039369956,"teacher_disagreement_score":0.72728676,"about_ca_system_score_codex":0.0001404878,"about_ca_system_score_gemma":0.00011192133,"threshold_uncertainty_score":0.82991093},"labels":[],"label_agreement":null},{"id":"W7098524218","doi":"","title":"Restorative Effect of Vitamin D Deficiency on Knee Pain and Quadriceps Muscle Strength in Knee Osteoarthritis","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Osteoarthritis; Muscle weakness; vitamin D deficiency; Knee pain; Vitamin D and neurology; Knee Joint; Muscle strength","score_opus":0.005983738277995974,"score_gpt":0.2281737356522792,"score_spread":0.22218999737428322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098524218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33217704,0.000059778547,0.65828645,0.00009143567,0.000060046536,0.0002298224,7.6768686e-7,0.00022376908,0.008870897],"genre_scores_gemma":[0.95988786,0.0000046521104,0.03991477,0.00009384287,0.0000098555465,0.000014439267,0.0000011075291,0.0000052946084,0.00006818329],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850655,0.0006093459,0.00022682882,0.00030946426,0.00016962709,0.00017815997],"domain_scores_gemma":[0.99862266,0.00088457455,0.000088454384,0.00031779104,0.00003795371,0.00004857247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013762027,0.00012821946,0.00020473338,0.00020045151,0.00005601205,0.000046337656,0.00023581312,0.000058863072,0.0000035445469],"category_scores_gemma":[0.0003316662,0.000107550695,0.000028835588,0.00037904794,0.000049668528,0.00014917912,0.000106907864,0.00010375707,0.0000042245506],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001984664,0.000108812514,0.0048773717,0.000044956425,0.000002701921,0.0000042795773,0.0010235397,0.002520327,0.00029596878,0.03742666,0.00044353915,0.953232],"study_design_scores_gemma":[0.002897814,0.019053148,0.049060002,0.00039881913,0.000006478987,0.000006319653,0.000093821385,0.9112853,0.013230152,0.0022564442,0.0009750083,0.00073671486],"about_ca_topic_score_codex":0.00006482888,"about_ca_topic_score_gemma":0.000034399578,"teacher_disagreement_score":0.9524953,"about_ca_system_score_codex":0.00002013823,"about_ca_system_score_gemma":0.000015665544,"threshold_uncertainty_score":0.43857902},"labels":[],"label_agreement":null},{"id":"W7099147620","doi":"","title":"Certification A Study of Eight Canadian Jurisdictions","year":2013,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Certification; Work (physics); Agency (philosophy); Field (mathematics)","score_opus":0.0184028596873474,"score_gpt":0.24196504177226516,"score_spread":0.22356218208491777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099147620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044136398,0.00000859322,0.9247513,0.00093114015,0.00007144828,0.00031675014,3.0855324e-7,0.0002541389,0.029529924],"genre_scores_gemma":[0.94161797,0.0000015716265,0.057679914,0.00007836686,0.0000064938404,0.00002745843,8.5784166e-7,0.0000020871191,0.00058530894],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952,0.000030163274,0.00014085395,0.00013189769,0.00008151891,0.00009553767],"domain_scores_gemma":[0.9994101,0.000014809652,0.000036996687,0.00033189976,0.00013090808,0.00007527988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006774918,0.00004220132,0.000054518016,0.00016238415,0.00008679108,0.000053857242,0.00033408444,0.000020684285,0.00006250138],"category_scores_gemma":[0.0000079403035,0.000036739464,0.000013194154,0.00031403592,0.000008012853,0.00019331039,0.00003351,0.000033008637,0.000055019194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037896036,0.0041218814,0.0836247,0.00003919912,0.00020883098,0.000008094221,0.04060308,0.032269057,0.002463984,0.2873156,0.30380312,0.24553868],"study_design_scores_gemma":[0.00027218735,0.00029405556,0.100751385,0.000006931131,0.0000054349425,0.0000038896533,0.00022963008,0.8864495,0.0022114564,0.0033877755,0.0061538736,0.00023387073],"about_ca_topic_score_codex":0.09922623,"about_ca_topic_score_gemma":0.007856132,"teacher_disagreement_score":0.89748156,"about_ca_system_score_codex":0.000022441163,"about_ca_system_score_gemma":0.00005674587,"threshold_uncertainty_score":0.9067721},"labels":[],"label_agreement":null},{"id":"W7099337307","doi":"","title":"Child Care and Young Children: A Practitioner’s View","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Child care; Workforce; Scope (computer science); Health care; Plan (archaeology)","score_opus":0.007579540542111858,"score_gpt":0.24113722527181658,"score_spread":0.23355768472970473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099337307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013905709,0.00097607385,0.9600266,0.0009533372,0.000063003645,0.0001168324,5.2977686e-7,0.00069284724,0.03578019],"genre_scores_gemma":[0.61977994,0.00024354504,0.37928137,0.00059714506,0.000028850682,0.0000054131656,0.0000038886797,0.0000040302616,0.000055784716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9994419,0.000017277465,0.00009897528,0.00022649221,0.00010139645,0.00011391907],"domain_scores_gemma":[0.99962324,0.000006167461,0.000039507246,0.00023031357,0.000050600534,0.00005016758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059988204,0.0000785436,0.00007540879,0.000054907254,0.00016877249,0.00013660647,0.00022388776,0.00003326392,0.0000046829628],"category_scores_gemma":[0.000011499638,0.00006895711,0.000022787863,0.00016492656,0.000019025902,0.0003068457,0.00012405626,0.00007600055,0.000014017416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004299085,0.00018082949,0.0044759293,0.0000491837,0.000048824222,0.000018928846,0.0051679686,0.011419562,0.00003395162,0.8501598,0.0036543966,0.1247863],"study_design_scores_gemma":[0.021699747,0.005551487,0.38410673,0.0032588127,0.00022368587,0.014743684,0.0014236709,0.18567595,0.06605788,0.19091083,0.11394623,0.012401314],"about_ca_topic_score_codex":0.00007733164,"about_ca_topic_score_gemma":0.0000094187635,"teacher_disagreement_score":0.659249,"about_ca_system_score_codex":0.000022059803,"about_ca_system_score_gemma":0.000025425039,"threshold_uncertainty_score":0.28119895},"labels":[],"label_agreement":null},{"id":"W7100327662","doi":"","title":"Balancing assembly lines with tabu search","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tabu search; Assembly line; Key (lock); Line (geometry); Heuristic","score_opus":0.01571159446393715,"score_gpt":0.26516642339826024,"score_spread":0.24945482893432308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100327662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016425755,0.000022243794,0.97249776,0.0010990878,0.000036017675,0.00006181394,7.906037e-8,0.0009208145,0.008936432],"genre_scores_gemma":[0.49883464,0.000004782275,0.5005899,0.00026811007,0.000022286846,0.0000019964712,4.287289e-7,0.0000034440206,0.00027442432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993014,0.00001715579,0.00009504853,0.00021531126,0.00018661101,0.00018448001],"domain_scores_gemma":[0.9995163,0.000023501172,0.000022426346,0.00028221236,0.00009822897,0.000057334943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016680305,0.000076240576,0.00007924856,0.00007230374,0.000094593925,0.00013666553,0.00043081035,0.000027900307,0.0000037643242],"category_scores_gemma":[0.00000935979,0.000055182663,0.000017761378,0.00034496989,0.000016255579,0.00023375436,0.00011244769,0.00007614032,0.000028452465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008217276,0.00018732174,0.0046021696,0.000027032233,0.000030661624,0.00007082259,0.0012556836,0.60351956,0.0020734775,0.35997674,0.0021231228,0.026125202],"study_design_scores_gemma":[0.0012899021,0.0005408061,0.0035359054,0.00014477209,0.0000048940665,0.0001429756,0.000076147706,0.8443463,0.14202537,0.0049710283,0.0022098161,0.0007121077],"about_ca_topic_score_codex":0.00009789746,"about_ca_topic_score_gemma":0.000012133735,"teacher_disagreement_score":0.48240888,"about_ca_system_score_codex":0.000025635776,"about_ca_system_score_gemma":0.000088900226,"threshold_uncertainty_score":0.22502837},"labels":[],"label_agreement":null},{"id":"W7100681886","doi":"","title":"and Applied Chemistry University of Toronto","year":2014,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Toughness; Fracture toughness; Ultimate tensile strength; Delamination (geology); Enthusiasm; Fracture (geology)","score_opus":0.004658744890998115,"score_gpt":0.18267663411204155,"score_spread":0.17801788922104345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100681886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022552295,0.000013571152,0.834465,0.000032332224,0.000004106468,0.000010619224,3.346149e-8,0.0001093781,0.16310969],"genre_scores_gemma":[0.7271508,0.000010307986,0.27237538,0.000021953141,0.0000031946147,2.8471693e-8,1.4495572e-7,5.68492e-7,0.00043760458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982476,0.0000046849264,0.00002739116,0.000077514815,0.000031113792,0.000034531182],"domain_scores_gemma":[0.9998164,0.000012414723,0.000018166742,0.000120785175,0.000013405159,0.000018812352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005906898,0.000022192271,0.000039198254,0.0000021608328,0.000022152555,0.000006533591,0.00015698727,0.000016044634,0.000019201098],"category_scores_gemma":[0.000002449174,0.00002254908,0.000006170532,0.00001600478,0.000014066405,0.000043004973,0.000089354595,0.00001065109,7.4862896e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012750343,0.0001002607,0.0008975327,0.00008852819,0.00002279022,7.3925287e-7,0.0016643818,0.0018531557,0.019279806,0.61748725,0.011147298,0.34744552],"study_design_scores_gemma":[0.0006243525,0.000052403488,0.0041012466,0.000014195387,0.000004763602,0.0000045912134,0.00008215548,0.86179197,0.10526423,0.0054210974,0.022325084,0.00031391776],"about_ca_topic_score_codex":0.00007886372,"about_ca_topic_score_gemma":0.000005300198,"teacher_disagreement_score":0.8599388,"about_ca_system_score_codex":0.000005038,"about_ca_system_score_gemma":0.000004601833,"threshold_uncertainty_score":0.09195248},"labels":[],"label_agreement":null},{"id":"W7106105931","doi":"10.1109/iccad66269.2025.11240777","title":"Mamba-X: An End-to-End Vision Mamba Accelerator for Edge Computing Devices","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Samsung; Samsung Advanced Institute of Technology","keywords":"Transformer; Quantization (signal processing); High memory; Latency (audio); Machine vision; Computational complexity theory; Digital signal processing","score_opus":0.027883341401245,"score_gpt":0.33803807118422896,"score_spread":0.310154729782984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106105931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010374623,0.00041135913,0.97206026,0.0028614711,0.0017750707,0.0015431461,0.00002360052,0.0014367346,0.009513728],"genre_scores_gemma":[0.5467231,0.00002144316,0.4458884,0.0050726137,0.00025594124,0.000028821692,0.000025287876,0.00002879712,0.001955552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476606,0.0003544525,0.0012680042,0.0019391158,0.0005333131,0.0011390519],"domain_scores_gemma":[0.99612856,0.0006062664,0.0003753924,0.0015155924,0.00085450994,0.0005196932],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017057054,0.0006759424,0.00075533666,0.0008690927,0.0013993002,0.0017332175,0.00281489,0.00034603133,0.00014742215],"category_scores_gemma":[0.00016199907,0.000699384,0.00028275684,0.002072609,0.000118117074,0.0011572996,0.001677994,0.00036119274,0.000068708614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001594982,0.0010937769,0.0010658116,0.00050869386,0.00016298096,0.000018107286,0.0021575524,0.029621644,0.0011457416,0.08423038,0.059317175,0.8205186],"study_design_scores_gemma":[0.00079901173,0.0008084824,0.001608801,0.0004817593,0.00004467852,0.000006570517,0.000102184524,0.9475514,0.011817761,0.0011253355,0.034854773,0.0007991903],"about_ca_topic_score_codex":0.00012757527,"about_ca_topic_score_gemma":0.00006381793,"teacher_disagreement_score":0.9179298,"about_ca_system_score_codex":0.00018395948,"about_ca_system_score_gemma":0.0005514539,"threshold_uncertainty_score":0.99990076},"labels":[],"label_agreement":null},{"id":"W7107939236","doi":"10.5281/zenodo.17753294","title":"Recursive Resemblance: A Cross-Scale Invariant of Structural Self-Similarity in the Cascade Efficiency Continuum","year":2025,"lang":"","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cascades (Canada)","funders":"","keywords":"Cascade; Iterated function; Invariant (physics); Rendering (computer graphics); Entropy (arrow of time); Polynomial; Parametric statistics; Tensor (intrinsic definition)","score_opus":0.03028399306881034,"score_gpt":0.29626239508740027,"score_spread":0.2659784020185899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107939236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08870227,0.0012314476,0.70034724,0.004463549,0.0015244209,0.00644308,0.0013186629,0.0031337931,0.19283552],"genre_scores_gemma":[0.9714168,0.0007536542,0.024736648,0.0004546046,0.00025423002,6.259005e-7,0.0008405065,0.00068004936,0.00086292165],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99209225,0.0030467596,0.0013140314,0.0015209789,0.0011424227,0.0008835796],"domain_scores_gemma":[0.9941807,0.00025622963,0.000886106,0.0021819966,0.002316702,0.00017827276],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004760179,0.00051001465,0.0006869869,0.00078459777,0.0030042685,0.0027470915,0.009228307,0.0004381468,0.0006183005],"category_scores_gemma":[0.0016528553,0.00047131474,0.00023292733,0.0026897273,0.00063892466,0.0004349066,0.009529677,0.001962531,0.00017751596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015942364,0.0047354456,0.0010954627,0.005847647,0.00088342285,0.00042652973,0.26963615,0.107840925,0.0021294996,0.1379291,0.35525614,0.11262545],"study_design_scores_gemma":[0.004527429,0.0018579157,0.028603045,0.0025126634,0.00016413919,0.0006295578,0.001668705,0.5510181,0.0064228377,0.015456696,0.38459718,0.0025417153],"about_ca_topic_score_codex":0.00017504652,"about_ca_topic_score_gemma":0.0000047884623,"teacher_disagreement_score":0.8827145,"about_ca_system_score_codex":0.00038852665,"about_ca_system_score_gemma":0.00008523366,"threshold_uncertainty_score":0.99977386},"labels":[],"label_agreement":null},{"id":"W7107939436","doi":"10.5281/zenodo.17753403","title":"Polyparallelism: A Symbolic Concurrency Framework for Harmonic Kernel Systems","year":2025,"lang":"","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cascades (Canada)","funders":"","keywords":"Concurrency; Symbolic trajectory evaluation; Computation; Kernel (algebra); Symbolic computation; Scheduling (production processes); Algebra over a field","score_opus":0.056211322791307736,"score_gpt":0.30026888494149584,"score_spread":0.2440575621501881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107939436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017053378,0.0025893769,0.9538103,0.0017076415,0.0021637168,0.0034358117,0.001020774,0.004287105,0.030814795],"genre_scores_gemma":[0.6570951,0.011663664,0.27875844,0.0020065196,0.003892776,0.000012771348,0.011940876,0.008776703,0.025853181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99199456,0.0014987832,0.0015451949,0.00250838,0.0010078398,0.0014452535],"domain_scores_gemma":[0.9919206,0.00034990566,0.0010634655,0.0027893458,0.0033111763,0.0005655197],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.002472907,0.000888826,0.0010601149,0.0010748828,0.0058824793,0.007449382,0.009086819,0.0008215074,0.001230086],"category_scores_gemma":[0.0023635572,0.001048128,0.00047045975,0.001781632,0.00040496147,0.00050143676,0.011502569,0.0018982796,0.0021245591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016645367,0.0006422228,0.0000024280828,0.0021049504,0.00048017112,0.000018518362,0.004702543,0.028231975,0.000101313395,0.5225878,0.30848876,0.13247292],"study_design_scores_gemma":[0.0007564127,0.00040263592,0.000037761045,0.0014207419,0.00008597243,0.00008430966,0.000134173,0.30961293,0.00015599755,0.00855795,0.67783254,0.00091858185],"about_ca_topic_score_codex":0.00007775981,"about_ca_topic_score_gemma":1.1100845e-7,"teacher_disagreement_score":0.6750518,"about_ca_system_score_codex":0.00064817205,"about_ca_system_score_gemma":0.00010742323,"threshold_uncertainty_score":0.9996829},"labels":[],"label_agreement":null},{"id":"W7107960903","doi":"10.5281/zenodo.17753402","title":"Polyparallelism: A Symbolic Concurrency Framework for Harmonic Kernel Systems","year":2025,"lang":"","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cascades (Canada)","funders":"","keywords":"Concurrency; Symbolic trajectory evaluation; Computation; Kernel (algebra); Symbolic computation; Scheduling (production processes); Algebra over a field","score_opus":0.056211322791307736,"score_gpt":0.30026888494149584,"score_spread":0.2440575621501881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107960903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017053378,0.0025893769,0.9538103,0.0017076415,0.0021637168,0.0034358117,0.001020774,0.004287105,0.030814795],"genre_scores_gemma":[0.6570951,0.011663664,0.27875844,0.0020065196,0.003892776,0.000012771348,0.011940876,0.008776703,0.025853181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99199456,0.0014987832,0.0015451949,0.00250838,0.0010078398,0.0014452535],"domain_scores_gemma":[0.9919206,0.00034990566,0.0010634655,0.0027893458,0.0033111763,0.0005655197],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.002472907,0.000888826,0.0010601149,0.0010748828,0.0058824793,0.007449382,0.009086819,0.0008215074,0.001230086],"category_scores_gemma":[0.0023635572,0.001048128,0.00047045975,0.001781632,0.00040496147,0.00050143676,0.011502569,0.0018982796,0.0021245591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016645367,0.0006422228,0.0000024280828,0.0021049504,0.00048017112,0.000018518362,0.004702543,0.028231975,0.000101313395,0.5225878,0.30848876,0.13247292],"study_design_scores_gemma":[0.0007564127,0.00040263592,0.000037761045,0.0014207419,0.00008597243,0.00008430966,0.000134173,0.30961293,0.00015599755,0.00855795,0.67783254,0.00091858185],"about_ca_topic_score_codex":0.00007775981,"about_ca_topic_score_gemma":1.1100845e-7,"teacher_disagreement_score":0.6750518,"about_ca_system_score_codex":0.00064817205,"about_ca_system_score_gemma":0.00010742323,"threshold_uncertainty_score":0.9996829},"labels":[],"label_agreement":null},{"id":"W7107968729","doi":"10.5281/zenodo.17753295","title":"Recursive Resemblance: A Cross-Scale Invariant of Structural Self-Similarity in the Cascade Efficiency Continuum","year":2025,"lang":"","type":"preprint","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cascades (Canada)","funders":"","keywords":"Cascade; Iterated function; Invariant (physics); Rendering (computer graphics); Entropy (arrow of time); Polynomial; Parametric statistics; Tensor (intrinsic definition)","score_opus":0.03028399306881034,"score_gpt":0.29626239508740027,"score_spread":0.2659784020185899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7107968729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08870227,0.0012314476,0.70034724,0.004463549,0.0015244209,0.00644308,0.0013186629,0.0031337931,0.19283552],"genre_scores_gemma":[0.9714168,0.0007536542,0.024736648,0.0004546046,0.00025423002,6.259005e-7,0.0008405065,0.00068004936,0.00086292165],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99209225,0.0030467596,0.0013140314,0.0015209789,0.0011424227,0.0008835796],"domain_scores_gemma":[0.9941807,0.00025622963,0.000886106,0.0021819966,0.002316702,0.00017827276],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.004760179,0.00051001465,0.0006869869,0.00078459777,0.0030042685,0.0027470915,0.009228307,0.0004381468,0.0006183005],"category_scores_gemma":[0.0016528553,0.00047131474,0.00023292733,0.0026897273,0.00063892466,0.0004349066,0.009529677,0.001962531,0.00017751596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015942364,0.0047354456,0.0010954627,0.005847647,0.00088342285,0.00042652973,0.26963615,0.107840925,0.0021294996,0.1379291,0.35525614,0.11262545],"study_design_scores_gemma":[0.004527429,0.0018579157,0.028603045,0.0025126634,0.00016413919,0.0006295578,0.001668705,0.5510181,0.0064228377,0.015456696,0.38459718,0.0025417153],"about_ca_topic_score_codex":0.00017504652,"about_ca_topic_score_gemma":0.0000047884623,"teacher_disagreement_score":0.8827145,"about_ca_system_score_codex":0.00038852665,"about_ca_system_score_gemma":0.00008523366,"threshold_uncertainty_score":0.99977386},"labels":[],"label_agreement":null},{"id":"W7108212318","doi":"10.5281/zenodo.17779396","title":"Scalable Address Spaces using Concurrent Interval Skiplist","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Interval (graph theory); Scalability; Concurrency; Artifact (error); Key (lock)","score_opus":0.05379176065578454,"score_gpt":0.30234485342652456,"score_spread":0.24855309277074003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108212318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002048796,0.0008371076,0.9006405,0.0011687208,0.00096497155,0.00063104177,0.000092890135,0.0019090059,0.09170699],"genre_scores_gemma":[0.97953415,0.0004211918,0.012989452,0.00048300528,0.00026682988,7.5384136e-8,0.00038797595,0.001104786,0.0048125056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959108,0.0009576078,0.0006822343,0.0010820576,0.0005800478,0.0007872245],"domain_scores_gemma":[0.99679285,0.000059903912,0.00032830823,0.0010659219,0.001479416,0.00027360494],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014183436,0.0003691364,0.0004008711,0.0007120551,0.004917964,0.0058180992,0.0037272908,0.00017175087,0.003063481],"category_scores_gemma":[0.0006883856,0.00042640898,0.0001491114,0.002121142,0.0004616359,0.0007178697,0.006508964,0.0006109406,0.001522061],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855678,0.0007790393,0.00001599531,0.0005171832,0.00024135101,0.00003645463,0.0029170378,0.0131388875,0.0015630584,0.11109238,0.37142912,0.49818394],"study_design_scores_gemma":[0.0005626632,0.0001964857,0.00007152966,0.0004894822,0.000033134344,0.00005635267,0.00014133668,0.38996133,0.0014254502,0.00052309525,0.6061761,0.00036306414],"about_ca_topic_score_codex":0.000054111693,"about_ca_topic_score_gemma":2.9201522e-7,"teacher_disagreement_score":0.97748536,"about_ca_system_score_codex":0.00045587504,"about_ca_system_score_gemma":0.000034326873,"threshold_uncertainty_score":0.99981874},"labels":[],"label_agreement":null},{"id":"W7110212416","doi":"10.1145/3721462.3730950","title":"FreeRide: Harvesting Bubbles in Pipeline Parallelism","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pipeline (software); Task (project management); Overhead (engineering); Parallelism (grammar); Graph; Data parallelism; Side effect (computer science); Resource (disambiguation)","score_opus":0.018211081972937374,"score_gpt":0.2825840220147766,"score_spread":0.26437294004183925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110212416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006840935,0.0017741426,0.8963067,0.0052157175,0.00078813935,0.00033846343,0.0000014068319,0.00076472136,0.09412665],"genre_scores_gemma":[0.42448586,0.000550468,0.51159924,0.0026989134,0.00010931132,0.000026543423,0.0000051046454,0.000017893726,0.060506683],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658734,0.00026483083,0.0011389576,0.0009751604,0.00031414838,0.0007195561],"domain_scores_gemma":[0.9981203,0.00031733193,0.00020724795,0.0009784813,0.00025130197,0.00012532873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001220545,0.000400679,0.0005154591,0.0007530926,0.00025330082,0.000685098,0.0017243318,0.00025004797,0.00008330172],"category_scores_gemma":[0.0004965595,0.00041875537,0.00012805976,0.0023626324,0.00012285041,0.00061013066,0.0010716656,0.0004900887,0.000051298623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028610903,0.00050360186,0.006368766,0.00020182593,0.000039745963,0.000086072665,0.00089929486,0.21759778,0.00015328756,0.28043154,0.087918,0.40577146],"study_design_scores_gemma":[0.0006156887,0.000042129697,0.0015685008,0.00056260155,0.000008393918,0.000005528663,0.000026560467,0.9720659,0.0015475951,0.009850551,0.013293931,0.0004125662],"about_ca_topic_score_codex":0.0009906419,"about_ca_topic_score_gemma":0.00020504136,"teacher_disagreement_score":0.75446814,"about_ca_system_score_codex":0.00012461416,"about_ca_system_score_gemma":0.00042448292,"threshold_uncertainty_score":0.99982643},"labels":[],"label_agreement":null},{"id":"W7115821976","doi":"","title":"Polaris and TRACE/PARCS Code Development for CANDU Analysis","year":2022,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Code (set theory); Development (topology); Coupling (piping); Systems analysis","score_opus":0.014275037269863577,"score_gpt":0.23194069593253522,"score_spread":0.21766565866267165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115821976","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011615087,0.0003244034,0.88965464,0.000084802414,0.00021392078,0.00040328052,0.000035656198,0.00037697586,0.107744806],"genre_scores_gemma":[0.007696007,0.00007600843,0.23791447,0.00008131639,0.000021100783,0.000009876671,0.00044648914,0.000030157598,0.7537246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985888,0.00007984491,0.00021427107,0.00062091777,0.00023349025,0.00026268125],"domain_scores_gemma":[0.99919224,0.000067322784,0.00023212723,0.00029249318,0.000110348345,0.00010548805],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015582427,0.0002520568,0.00035852552,0.00054608705,0.00047874183,0.00015612046,0.00082268903,0.00015943476,0.0030181084],"category_scores_gemma":[0.000008795638,0.00030329655,0.0001488837,0.0011965696,0.000017125007,0.00020114577,0.00022142894,0.00021326591,0.0000019694921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018473285,0.00015571142,0.0024089518,0.00025621272,0.0017774989,0.00006301693,0.008578287,0.004670441,0.000031835396,0.013808828,0.0038709575,0.9641935],"study_design_scores_gemma":[0.00050582265,0.00007905595,0.0017054909,0.000027023532,0.00037350834,0.0000020160574,0.00089043373,0.03726838,0.00035362397,0.000095232,0.95813406,0.0005653547],"about_ca_topic_score_codex":0.00014478224,"about_ca_topic_score_gemma":0.001385632,"teacher_disagreement_score":0.9636282,"about_ca_system_score_codex":0.00017955578,"about_ca_system_score_gemma":0.00022032378,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W7116630505","doi":"10.23977/jnca.2025.100113","title":"A Parallel GEM5-Based Simulation Infrastructure for Multicluster SoC Performance Evaluation","year":2025,"lang":"","type":"article","venue":"Journal of Network Computing and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Emulation; Scalability; Synchronization (alternating current); Rollback; Spec#; Hardware emulation; Throughput; Execution time","score_opus":0.0206617484114931,"score_gpt":0.32651637930192384,"score_spread":0.30585463089043075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116630505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007855997,0.0018339653,0.9872362,0.0010413387,0.00047073985,0.0013032017,0.000002179162,0.000076937664,0.00017942832],"genre_scores_gemma":[0.69353914,0.000105215644,0.30505002,0.00051189266,0.00070283597,0.000028718207,0.0000065880413,0.000011719587,0.000043896922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972661,0.00024667603,0.0012387156,0.0004355497,0.00041084026,0.0004020788],"domain_scores_gemma":[0.9952642,0.0010431937,0.0013726619,0.00041553332,0.0017814726,0.00012295446],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025296677,0.00029338198,0.00046588306,0.00030061047,0.0010362292,0.00039129483,0.0006349185,0.00021454101,0.0000035762216],"category_scores_gemma":[0.00012814428,0.00028796965,0.00019297817,0.00093802635,0.00010732018,0.00026998608,0.00018115803,0.00041660565,8.954758e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003828209,0.000053733027,0.0007208967,0.00007289212,0.0000448702,1.1270654e-7,0.00011300143,0.650984,0.000002499002,0.0011804214,0.0013415923,0.34544772],"study_design_scores_gemma":[0.0017192354,0.00019034697,0.0049648155,0.0006017915,0.00018888412,0.000007715323,0.00001565492,0.9787733,0.000017124878,0.0049796025,0.008300818,0.00024071967],"about_ca_topic_score_codex":0.0000011547356,"about_ca_topic_score_gemma":4.9376195e-7,"teacher_disagreement_score":0.68568313,"about_ca_system_score_codex":0.00015086727,"about_ca_system_score_gemma":0.0005769123,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W7116851878","doi":"10.5281/zenodo.18017843","title":"D5.2 Report on algorithm design, code porting and optimization","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"European Commission","keywords":"Code (set theory); Porting; Source code; Optimization algorithm; Dead code; Minification","score_opus":0.04101179242570929,"score_gpt":0.2804297027990418,"score_spread":0.2394179103733325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116851878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005974303,0.0002554985,0.950884,0.0018261829,0.00030576196,0.00076234556,0.00003589495,0.0020051883,0.04386537],"genre_scores_gemma":[0.07692681,0.0014755795,0.907854,0.0015812289,0.00034524561,3.4673218e-7,0.0011826525,0.0020912185,0.008542884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571663,0.00095931324,0.0008733363,0.001260118,0.0005742289,0.0006163996],"domain_scores_gemma":[0.9967377,0.000109605644,0.00052123604,0.0010799987,0.0013039662,0.0002474886],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027990902,0.0003527335,0.00034817916,0.0007478488,0.0046510044,0.003109959,0.0016913795,0.00019558267,0.0008044836],"category_scores_gemma":[0.0017454397,0.000407815,0.00007905859,0.0017278357,0.00026236146,0.00053383596,0.002588105,0.0005253161,0.00035300115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005527505,0.00027219913,0.0000025039494,0.00009068,0.0000929631,0.00014034266,0.0007985079,0.2107701,0.0000995747,0.0078107333,0.09540997,0.6844571],"study_design_scores_gemma":[0.00046841032,0.00035292178,0.000055507302,0.00023756224,0.000025363937,0.00031551303,0.000050123992,0.78279525,0.000661038,0.0004939637,0.21421884,0.00032551205],"about_ca_topic_score_codex":0.000011856504,"about_ca_topic_score_gemma":4.272562e-8,"teacher_disagreement_score":0.6841316,"about_ca_system_score_codex":0.0002442986,"about_ca_system_score_gemma":0.000030172667,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W7116893544","doi":"10.5281/zenodo.18017842","title":"D5.2 Report on algorithm design, code porting and optimization","year":2025,"lang":"","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Standards Association","funders":"European Commission","keywords":"Code (set theory); Porting; Source code; Optimization algorithm; Dead code; Minification","score_opus":0.04101179242570929,"score_gpt":0.2804297027990418,"score_spread":0.2394179103733325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116893544","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005974303,0.0002554985,0.950884,0.0018261829,0.00030576196,0.00076234556,0.00003589495,0.0020051883,0.04386537],"genre_scores_gemma":[0.07692681,0.0014755795,0.907854,0.0015812289,0.00034524561,3.4673218e-7,0.0011826525,0.0020912185,0.008542884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571663,0.00095931324,0.0008733363,0.001260118,0.0005742289,0.0006163996],"domain_scores_gemma":[0.9967377,0.000109605644,0.00052123604,0.0010799987,0.0013039662,0.0002474886],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027990902,0.0003527335,0.00034817916,0.0007478488,0.0046510044,0.003109959,0.0016913795,0.00019558267,0.0008044836],"category_scores_gemma":[0.0017454397,0.000407815,0.00007905859,0.0017278357,0.00026236146,0.00053383596,0.002588105,0.0005253161,0.00035300115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005527505,0.00027219913,0.0000025039494,0.00009068,0.0000929631,0.00014034266,0.0007985079,0.2107701,0.0000995747,0.0078107333,0.09540997,0.6844571],"study_design_scores_gemma":[0.00046841032,0.00035292178,0.000055507302,0.00023756224,0.000025363937,0.00031551303,0.000050123992,0.78279525,0.000661038,0.0004939637,0.21421884,0.00032551205],"about_ca_topic_score_codex":0.000011856504,"about_ca_topic_score_gemma":4.272562e-8,"teacher_disagreement_score":0.6841316,"about_ca_system_score_codex":0.0002442986,"about_ca_system_score_gemma":0.000030172667,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W7117773429","doi":"10.1109/rtss66672.2025.00045","title":"Exploiting Burstiness to Improve Multi-Core Interference Analysis","year":2025,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Burstiness; Instruction prefetch; Interference (communication); Variety (cybernetics); Multi-core processor; Simple (philosophy)","score_opus":0.03229925336010446,"score_gpt":0.3132409125364565,"score_spread":0.280941659176352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117773429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014820091,0.000025635494,0.9930072,0.0011174913,0.00013690052,0.0001159178,5.960361e-7,0.0008715371,0.0032427155],"genre_scores_gemma":[0.4865292,0.0000018578762,0.5102379,0.0010421384,0.000007047523,0.000015230091,0.0000011941204,0.0000020316165,0.0021634437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900925,0.000029559673,0.0002489491,0.000414656,0.00009172778,0.00020588214],"domain_scores_gemma":[0.9991579,0.000059096594,0.00006317497,0.0005081,0.00014450435,0.000067217676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024635103,0.00011031743,0.00019760373,0.00047949384,0.00011380474,0.0001808337,0.00081362657,0.000030046995,0.000007743534],"category_scores_gemma":[0.00010643732,0.00009899124,0.00007897169,0.0022479517,0.00001172679,0.00014969375,0.000548292,0.00007262795,0.000013479813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001397338,0.0003739432,0.017051285,0.00007298876,0.00069151365,0.000010777812,0.0034272098,0.118930526,0.0032485581,0.22028692,0.012861366,0.62303096],"study_design_scores_gemma":[0.000099190525,0.000028383698,0.0015555115,0.000033379874,0.000012723001,2.934589e-7,0.000036916896,0.9924881,0.0048288424,0.0005054305,0.0002721391,0.00013911899],"about_ca_topic_score_codex":0.00010798206,"about_ca_topic_score_gemma":0.00002326443,"teacher_disagreement_score":0.87355757,"about_ca_system_score_codex":0.000037626218,"about_ca_system_score_gemma":0.0000494348,"threshold_uncertainty_score":0.40367457},"labels":[],"label_agreement":null},{"id":"W7118159527","doi":"10.1145/3731599.3787539","title":"10.1145/3731599.3787539","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Software portability; Productivity; Standardization","score_opus":0.006850888222040198,"score_gpt":0.19529595046210466,"score_spread":0.18844506224006446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118159527","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052913943,0.000029458144,0.031815313,0.0005034752,0.0000035830583,0.000110382025,0.0000010113519,0.0011785022,0.9663054],"genre_scores_gemma":[0.00021618145,5.135416e-7,0.068793155,0.00021292176,0.000047614307,0.0000086530345,0.0000025385953,0.000009097017,0.9307093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991165,0.000043017142,0.00015457973,0.00028606292,0.00016702223,0.0002328302],"domain_scores_gemma":[0.9992826,0.000034533132,0.000026824397,0.00048875384,0.00005036479,0.000116901196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016160544,0.00011169037,0.00011900038,0.00009013346,0.000099666446,0.00012584422,0.0007826544,0.00004562264,0.8149328],"category_scores_gemma":[0.000018094506,0.00011108808,0.00004329263,0.00038048354,0.000015469017,0.00017234478,0.00011881978,0.00006901406,0.9007505],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005142378,0.000026425803,1.2001834e-7,0.0000013505883,0.0000039946144,0.0000035670303,0.000024132538,0.004082645,0.000010838195,0.000063341184,0.20838928,0.78738916],"study_design_scores_gemma":[0.000074892625,0.0000797535,0.000011886785,0.000008831972,0.0000014814182,0.000007877299,6.033163e-8,0.08282982,0.0001820793,0.00007390534,0.916585,0.00014438156],"about_ca_topic_score_codex":0.000007989614,"about_ca_topic_score_gemma":1.938355e-8,"teacher_disagreement_score":0.7872448,"about_ca_system_score_codex":0.000021371647,"about_ca_system_score_gemma":0.0000267215,"threshold_uncertainty_score":0.45300403},"labels":[],"label_agreement":null},{"id":"W7118169375","doi":"10.1145/3731599.3787547","title":"10.1145/3731599.3787547","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Scalability; Key (lock)","score_opus":0.006846420784389006,"score_gpt":0.19525741139859695,"score_spread":0.18841099061420793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118169375","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049561106,0.000029417703,0.030804452,0.0004979503,0.0000035596247,0.00010878173,9.981695e-7,0.0011628735,0.9673424],"genre_scores_gemma":[0.00021497224,5.1451843e-7,0.067652,0.00021287397,0.000047544756,0.000008841033,0.0000024827987,0.0000091074935,0.9318517],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991155,0.000043388765,0.00015468463,0.00028629616,0.0001671442,0.00023293965],"domain_scores_gemma":[0.99928224,0.000034146346,0.000026846561,0.0004891647,0.00005058276,0.00011699492],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016197801,0.0001117578,0.00011936964,0.00012362069,0.00009960284,0.0001264901,0.0007832356,0.000045750105,0.81142706],"category_scores_gemma":[0.000017803937,0.00011115069,0.000043348882,0.0005056229,0.000015475238,0.00017402314,0.00011887254,0.000069033835,0.9009314],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005213059,0.00002637992,1.1401791e-7,0.0000013491691,0.000003994896,0.0000035082296,0.000024076824,0.0039057876,0.000010992089,0.000082228886,0.20416513,0.79177123],"study_design_scores_gemma":[0.00007512978,0.00007979857,0.000010266248,0.00000902572,0.0000014764818,0.00000777551,6.002812e-8,0.0808134,0.00018146075,0.00007309823,0.9186043,0.00014416747],"about_ca_topic_score_codex":0.000006584107,"about_ca_topic_score_gemma":1.6056784e-8,"teacher_disagreement_score":0.79162705,"about_ca_system_score_codex":0.000021220083,"about_ca_system_score_gemma":0.000026604745,"threshold_uncertainty_score":0.45325938},"labels":[],"label_agreement":null},{"id":"W7118170117","doi":"10.1145/3731599.3787529","title":"10.1145/3731599.3787529","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Convergence (economics); Key (lock)","score_opus":0.006856341424376899,"score_gpt":0.19533081325399587,"score_spread":0.18847447182961896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118170117","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048446418,0.00003132489,0.030726695,0.00049954344,0.0000035603282,0.00010871258,9.986761e-7,0.0011675463,0.9674132],"genre_scores_gemma":[0.00022234936,4.90418e-7,0.06763126,0.0002123016,0.000047496884,0.000008846687,0.0000025422523,0.000009114409,0.9318656],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991175,0.00004315536,0.00015458201,0.00028584042,0.00016625882,0.00023266385],"domain_scores_gemma":[0.9992859,0.00003408138,0.000026803615,0.0004861986,0.000050140367,0.000116877876],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016079546,0.00011167045,0.00011911678,0.000086829044,0.00009907971,0.0001254422,0.0007746387,0.00004554326,0.84232205],"category_scores_gemma":[0.000017810751,0.000111051166,0.0000432653,0.00038214718,0.0000151994545,0.00017242403,0.00011638322,0.0000686689,0.91833115],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049414616,0.000025081983,9.035298e-8,0.0000012853471,0.000003786757,0.0000033218382,0.000022583246,0.0037902659,0.000010164449,0.00005697761,0.24543418,0.7506473],"study_design_scores_gemma":[0.000074849966,0.00007961428,0.000012124407,0.0000087537455,0.0000014721163,0.000007751618,6.0943e-8,0.08131452,0.00017632284,0.000063758926,0.91811687,0.00014387365],"about_ca_topic_score_codex":0.000007738342,"about_ca_topic_score_gemma":1.8619593e-8,"teacher_disagreement_score":0.7505035,"about_ca_system_score_codex":0.000021388756,"about_ca_system_score_gemma":0.000026462585,"threshold_uncertainty_score":0.45285353},"labels":[],"label_agreement":null},{"id":"W7118181368","doi":"10.1109/aiccsa66935.2025.11315210","title":"A Data-driven Analysis of Code Optimizations","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Compiler; Program optimization; Code (set theory); Code generation; Process (computing); Optimizing compiler; Key (lock); Focus (optics); Dead code elimination","score_opus":0.04453646840462206,"score_gpt":0.3360602732772272,"score_spread":0.29152380487260515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118181368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006210399,0.00034640808,0.96328795,0.0013745236,0.00022082505,0.00020373464,0.00022538,0.00034267304,0.033936407],"genre_scores_gemma":[0.20796622,0.00045831056,0.7848555,0.00050969084,0.000012405454,0.000005093625,0.00021661432,0.000006720211,0.0059694797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997434,0.0001962857,0.00090205,0.0008840711,0.00029613698,0.00028745361],"domain_scores_gemma":[0.9955888,0.00025479202,0.0003402404,0.0032079034,0.00052644865,0.00008182791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390552,0.00021949413,0.00064479274,0.001722176,0.00022514953,0.00023744474,0.0037928617,0.00013766752,0.00021404479],"category_scores_gemma":[0.0001915179,0.00022480958,0.0002059855,0.01045139,0.0001529619,0.00047352468,0.0024763283,0.0001456623,0.0000069216635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003578737,0.0001812305,0.0009755851,0.000019564126,0.0016182171,9.910185e-7,0.00014248291,0.90366066,0.0000065254194,0.07347204,0.014407865,0.0055112694],"study_design_scores_gemma":[0.0001640796,0.000028294626,0.00092524145,0.000054715587,0.0014300568,3.0488422e-7,0.000015341131,0.99360085,0.00015935823,0.0003050966,0.0031292364,0.00018740227],"about_ca_topic_score_codex":0.00010060742,"about_ca_topic_score_gemma":0.0001045996,"teacher_disagreement_score":0.20790412,"about_ca_system_score_codex":0.000040608367,"about_ca_system_score_gemma":0.0004373912,"threshold_uncertainty_score":0.91674685},"labels":[],"label_agreement":null},{"id":"W7118182713","doi":"10.1145/3731599.3787538","title":"10.1145/3731599.3787538","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Key (lock); Component (thermodynamics); Session key","score_opus":0.006853450990710485,"score_gpt":0.1953195507024032,"score_spread":0.1884660997116927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118182713","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052981934,0.000029742394,0.031690385,0.0005020158,0.0000035988605,0.00011045146,0.0000010091052,0.0011776042,0.9664322],"genre_scores_gemma":[0.00022020427,5.1642036e-7,0.06844499,0.00021317822,0.000047620273,0.000008700699,0.0000025319482,0.000009130141,0.9310531],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911547,0.000043216474,0.00015468948,0.00028636947,0.00016718001,0.0002330912],"domain_scores_gemma":[0.9992834,0.0000342146,0.000026854617,0.0004891189,0.000049466424,0.00011698981],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001616727,0.00011176524,0.00011936553,0.00008873932,0.00009924044,0.00012587625,0.0007836199,0.0000456325,0.8123674],"category_scores_gemma":[0.00001766703,0.000111213616,0.00004335052,0.00038213134,0.000015490832,0.0001732452,0.00011892652,0.00006901086,0.9003682],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005184176,0.000026364729,1.1731268e-7,0.0000013612251,0.0000039924544,0.0000035630233,0.000023612158,0.003973083,0.000010991524,0.000062291205,0.21118177,0.78470767],"study_design_scores_gemma":[0.00007523229,0.00008015016,0.0000122883985,0.000008879343,0.0000014862788,0.0000079087795,5.994986e-8,0.08112033,0.00018109489,0.00007307978,0.91829467,0.00014483141],"about_ca_topic_score_codex":0.000007935125,"about_ca_topic_score_gemma":1.9296913e-8,"teacher_disagreement_score":0.7845628,"about_ca_system_score_codex":0.00002141025,"about_ca_system_score_gemma":0.000026718622,"threshold_uncertainty_score":0.45351595},"labels":[],"label_agreement":null},{"id":"W7118484731","doi":"10.1145/3725843.3786378","title":"10.1145/3725843.3786378","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Microarchitecture; Component (thermodynamics); Term (time)","score_opus":0.006865654277314561,"score_gpt":0.1952731929953494,"score_spread":0.18840753871803484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118484731","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004901131,0.000033425924,0.032783527,0.00055023277,0.0000036490665,0.00011181665,0.0000010811683,0.0011951196,0.9652721],"genre_scores_gemma":[0.0002099935,5.545515e-7,0.065211296,0.00021804756,0.000049921808,0.000009182463,0.000002612419,0.000009217897,0.93428916],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991055,0.0000439044,0.00015656813,0.00028772588,0.00016979969,0.00023646599],"domain_scores_gemma":[0.9992713,0.00003478185,0.00002692029,0.0004961685,0.000051197825,0.000119654076],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016420495,0.00011309043,0.000120930184,0.00009078512,0.00010204251,0.000124899,0.0007920212,0.000046258247,0.8144398],"category_scores_gemma":[0.000017858913,0.0001128348,0.00004413005,0.0003891394,0.000015876703,0.00017473778,0.00012045072,0.00007011057,0.90460247],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052574924,0.00002802854,1.1625145e-7,0.0000013938939,0.0000040617265,0.000003563634,0.000024265353,0.00415054,0.000010346581,0.00006375081,0.22127235,0.77443635],"study_design_scores_gemma":[0.00007600751,0.00008325648,0.000012113639,0.000009196907,0.0000015201666,0.000007660032,6.413193e-8,0.07439227,0.00017882197,0.00007134181,0.92502034,0.00014740568],"about_ca_topic_score_codex":0.000008263806,"about_ca_topic_score_gemma":1.9852315e-8,"teacher_disagreement_score":0.77428895,"about_ca_system_score_codex":0.000021901324,"about_ca_system_score_gemma":0.000026393362,"threshold_uncertainty_score":0.46012697},"labels":[],"label_agreement":null},{"id":"W7118569851","doi":"10.1145/3725843.3786397","title":"10.1145/3725843.3786397","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Reconfigurable computing; Key (lock); Component (thermodynamics)","score_opus":0.006856655644365112,"score_gpt":0.1952080205479603,"score_spread":0.1883513649035952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118569851","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000048460053,0.000032881304,0.033504378,0.0005406661,0.0000035817704,0.00011064188,0.0000010814899,0.0011857086,0.9645726],"genre_scores_gemma":[0.00020913625,5.2593754e-7,0.064481296,0.00021499746,0.00004864068,0.000009059884,0.0000026148805,0.000009178532,0.93502456],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999115,0.00004343334,0.00015482311,0.00028477787,0.00016800672,0.0002339867],"domain_scores_gemma":[0.99927866,0.000034434477,0.000026597223,0.0004913077,0.000050717314,0.00011827412],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016272582,0.00011177071,0.00011960584,0.000088525594,0.00010045945,0.00012405808,0.000784959,0.000045770626,0.8171637],"category_scores_gemma":[0.000017644907,0.000111492125,0.00004359955,0.00038057563,0.000015522031,0.00017279256,0.00011932702,0.00006931918,0.9050393],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051873058,0.000027797465,1.1806295e-7,0.0000013651746,0.000004021281,0.0000035083826,0.000024259316,0.004185029,0.000010021707,0.00006283018,0.2215083,0.7741676],"study_design_scores_gemma":[0.0000749236,0.000082223145,0.000012351469,0.00000901808,0.0000014951595,0.000007486825,6.282739e-8,0.07591818,0.00017362436,0.000071199946,0.923504,0.00014541653],"about_ca_topic_score_codex":0.000008029357,"about_ca_topic_score_gemma":1.9404157e-8,"teacher_disagreement_score":0.77402216,"about_ca_system_score_codex":0.000021662956,"about_ca_system_score_gemma":0.000026181924,"threshold_uncertainty_score":0.45465168},"labels":[],"label_agreement":null},{"id":"W7119031672","doi":"10.1145/3725843.3786403","title":"10.1145/3725843.3786403","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Component (thermodynamics); Session key; Key (lock)","score_opus":0.006838545420573585,"score_gpt":0.1950719004607855,"score_spread":0.18823335504021194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7119031672","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047944166,0.000033015767,0.032676928,0.0005374977,0.0000035886326,0.00011069429,0.0000010466113,0.0011664265,0.96542287],"genre_scores_gemma":[0.00020604445,5.25844e-7,0.06556973,0.00021995368,0.00004730385,0.00000908599,0.0000025361096,0.000009165192,0.93393564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991158,0.000043988246,0.0001545653,0.0002844675,0.00016742016,0.00023372985],"domain_scores_gemma":[0.99927956,0.000034433684,0.000026559283,0.00049069704,0.00005056879,0.00011815779],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016346198,0.00011168456,0.00011942469,0.0000886076,0.000100209174,0.00012368045,0.0007779318,0.00004568559,0.8162465],"category_scores_gemma":[0.000017818074,0.00011142365,0.00004354865,0.00038232282,0.000015475956,0.00017217573,0.000117207615,0.000069178204,0.9053372],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005146685,0.00002792053,1.160638e-7,0.0000013700667,0.000004076,0.000003498217,0.000023806511,0.004162605,0.000010520274,0.00006297152,0.22844654,0.76725143],"study_design_scores_gemma":[0.000075043696,0.00008202128,0.000011615606,0.000008922611,0.0000015113421,0.000007481282,6.1819286e-8,0.0735902,0.00017897708,0.000073311574,0.9258252,0.00014565837],"about_ca_topic_score_codex":0.000008053566,"about_ca_topic_score_gemma":1.9304201e-8,"teacher_disagreement_score":0.76710576,"about_ca_system_score_codex":0.000021601152,"about_ca_system_score_gemma":0.000026217776,"threshold_uncertainty_score":0.45437247},"labels":[],"label_agreement":null},{"id":"W7119133641","doi":"10.1145/3725843.3786391","title":"10.1145/3725843.3786391","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Microarchitecture; Component (thermodynamics); Term (time)","score_opus":0.006856655644365112,"score_gpt":0.1952080205479603,"score_spread":0.1883513649035952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7119133641","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056867797,0.000032190597,0.033542275,0.0005499393,0.0000036868398,0.00011237828,0.0000010733759,0.0012004726,0.96450114],"genre_scores_gemma":[0.00021950903,5.265952e-7,0.06434134,0.00021596948,0.000048714348,0.000009091976,0.000002609243,0.000009186625,0.93515307],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999116,0.000043422388,0.00015459394,0.00028439524,0.00016778825,0.00023378548],"domain_scores_gemma":[0.9992795,0.00003456274,0.000026580294,0.00049047626,0.000050681312,0.00011820068],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016220308,0.00011170187,0.00011942122,0.000088505265,0.00010037131,0.00012385163,0.0007844829,0.00004568037,0.81517464],"category_scores_gemma":[0.000017665574,0.00011143278,0.00004358278,0.0003804215,0.000015516454,0.00017270098,0.000119264805,0.00006922319,0.90503305],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053186272,0.00003110166,1.2746578e-7,0.0000014303885,0.0000039334027,0.0000029612827,0.000023673123,0.0041368743,0.000009800656,0.000059420247,0.21817973,0.77754563],"study_design_scores_gemma":[0.00007642702,0.000100624624,0.0000137981515,0.000009432616,0.0000015000367,0.0000068720456,6.2961135e-8,0.07541426,0.00014974333,0.00006893747,0.92401284,0.0001455139],"about_ca_topic_score_codex":0.000008059052,"about_ca_topic_score_gemma":1.9334479e-8,"teacher_disagreement_score":0.7774001,"about_ca_system_score_codex":0.000021622904,"about_ca_system_score_gemma":0.000025885924,"threshold_uncertainty_score":0.4544097},"labels":[],"label_agreement":null},{"id":"W7123580574","doi":"10.1145/3772052.3772270","title":"Understanding GPU Resource Interference One Level Deeper","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Key (lock); Workload; Resource (disambiguation); Block (permutation group theory); Interference (communication); SPARK (programming language); CUDA; General-purpose computing on graphics processing units","score_opus":0.1910739783396017,"score_gpt":0.3069622429318057,"score_spread":0.11588826459220397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123580574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006853886,0.00042309292,0.83663523,0.004232467,0.00044797268,0.00023090957,0.0000017594577,0.0007292288,0.15723082],"genre_scores_gemma":[0.74702805,0.00012333143,0.2303136,0.0022569168,0.000049837963,0.0000071851123,0.0000017552389,0.000013324782,0.020206008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970524,0.00026047305,0.0007018119,0.0009790148,0.0003658995,0.00064040284],"domain_scores_gemma":[0.99815637,0.0002383484,0.0001836374,0.0010836027,0.00018511631,0.00015290086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007915555,0.00036593952,0.00041174324,0.0005634511,0.00060717977,0.0009009286,0.0019303886,0.0002452731,0.00015020135],"category_scores_gemma":[0.00015518157,0.0003882545,0.00014561166,0.0015855943,0.00021048976,0.00041534702,0.0015112427,0.00048225414,0.00006721648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031650732,0.00021813624,0.00030691657,0.00008628818,0.000105530264,0.0000067322912,0.0015338478,0.0061623915,0.00008086721,0.94058084,0.02487578,0.026011027],"study_design_scores_gemma":[0.000637696,0.00018479888,0.00029787855,0.0014119525,0.000039424853,0.0000072272364,0.00029910012,0.9061048,0.003286409,0.0789831,0.008051393,0.00069624314],"about_ca_topic_score_codex":0.000067992914,"about_ca_topic_score_gemma":0.000022825236,"teacher_disagreement_score":0.8999424,"about_ca_system_score_codex":0.00047251527,"about_ca_system_score_gemma":0.0003301571,"threshold_uncertainty_score":0.99985695},"labels":[],"label_agreement":null},{"id":"W7123868952","doi":"10.1145/3772052.3772215","title":"Oneiros: KV Cache Optimization through Parameter Remapping for Multi-tenant LLM Serving","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Becton Dickinson (Canada)","funders":"National Science Foundation","keywords":"Cache; CPU cache; Key (lock); Throughput; Cache coloring; Central processing unit; Cache pollution; Memory bandwidth","score_opus":0.06892126961872165,"score_gpt":0.33311469342646177,"score_spread":0.26419342380774014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123868952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068277244,0.00093378837,0.9881477,0.003785674,0.0016548472,0.0017140174,0.000008727918,0.0011991921,0.0024877924],"genre_scores_gemma":[0.014954671,0.0006382558,0.9698811,0.0029009648,0.0001192262,0.00015207962,0.000027770324,0.000041253366,0.011284635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99562716,0.00030129764,0.0012550508,0.0014891003,0.00034865408,0.0009787278],"domain_scores_gemma":[0.99667156,0.00058025814,0.00048033148,0.0013429081,0.0007941173,0.00013083876],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011592895,0.0006017276,0.0007172781,0.00035489214,0.0010401609,0.0010808399,0.001682319,0.0004368853,0.000041735577],"category_scores_gemma":[0.00066685735,0.00050440826,0.00036874405,0.0015851504,0.00012584674,0.0011669543,0.0010335913,0.0003559264,0.0000130127655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051294035,0.0005902224,0.0002191809,0.000427292,0.00019281296,0.0000032602254,0.0018603919,0.92743415,0.00013257054,0.026359968,0.00814966,0.034579195],"study_design_scores_gemma":[0.0009479878,0.000212613,0.000054618646,0.0007551454,0.00006980586,0.0000027830831,0.00010746231,0.98461646,0.004850603,0.0019473456,0.0057728845,0.0006623054],"about_ca_topic_score_codex":0.00015241552,"about_ca_topic_score_gemma":0.000012282283,"teacher_disagreement_score":0.057182297,"about_ca_system_score_codex":0.00023936073,"about_ca_system_score_gemma":0.0003857591,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W7126205634","doi":"10.1145/3767110.3767122","title":"Stream-Aware Intelligent Memory Controller through HW/SW Co-Design","year":2025,"lang":"","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); McMaster University","funders":"","keywords":"Bottleneck; Flat memory model; Scheduling (production processes); Memory management; Speedup; Memory hierarchy; Interleaved memory; Uniform memory access; Memory map","score_opus":0.024322504317572123,"score_gpt":0.2804338254639932,"score_spread":0.2561113211464211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126205634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073783263,0.0016310293,0.70259917,0.016655425,0.018225025,0.0054704137,0.00008275046,0.0009130217,0.24704483],"genre_scores_gemma":[0.9618935,0.00038445927,0.003125539,0.0012824903,0.00055872014,0.00019471865,0.0000048512757,0.000050298553,0.032505434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99434614,0.00016987923,0.0018493886,0.0012232487,0.0017900708,0.000621268],"domain_scores_gemma":[0.99482995,0.00048253767,0.0017306828,0.0005935972,0.0022354051,0.00012784445],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021135306,0.0007023984,0.00093142886,0.00038496067,0.0005167415,0.0010533001,0.0057603177,0.00036488034,0.00003340049],"category_scores_gemma":[0.00033731357,0.0005637486,0.0005264694,0.0008756648,0.00030297137,0.00073910283,0.001009861,0.0006527109,0.000051424337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017810117,0.0023460018,0.0014524638,0.0018371252,0.003146736,0.000009068567,0.008185243,0.47931203,0.040995408,0.18470562,0.26628178,0.009947488],"study_design_scores_gemma":[0.0015910955,0.00036859565,0.00005314966,0.0036737544,0.00011446734,0.000036303256,0.00077776844,0.7164763,0.26524702,0.0018213568,0.009191535,0.00064862415],"about_ca_topic_score_codex":0.00029890196,"about_ca_topic_score_gemma":9.546986e-7,"teacher_disagreement_score":0.95451516,"about_ca_system_score_codex":0.00072421937,"about_ca_system_score_gemma":0.00031617488,"threshold_uncertainty_score":0.9999837},"labels":[],"label_agreement":null},{"id":"W7126394018","doi":"10.21428/594757db.552e5df1","title":"GPU Job Scheduler with Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); York University","funders":"","keywords":"Reinforcement learning; Scheduling (production processes); Heuristic; Artificial neural network; Deep learning; GPU cluster; Process (computing); Speedup","score_opus":0.012115869160828716,"score_gpt":0.24898192179354867,"score_spread":0.23686605263271995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126394018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002763278,0.00014740309,0.9331905,0.00048932055,0.000076714234,0.0000579466,7.657807e-9,0.0019815546,0.063780226],"genre_scores_gemma":[0.60693955,0.000018564566,0.38557202,0.0002103807,0.000026938811,0.0000069111843,8.422908e-7,0.000006561201,0.0072182096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929696,0.000021948515,0.0001101899,0.00023898414,0.00017140726,0.00016048919],"domain_scores_gemma":[0.99965453,0.000032104617,0.000017591043,0.00020572935,0.000043672302,0.000046400277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001619308,0.00008513462,0.000067003086,0.00010007513,0.00009213768,0.0003338464,0.0003012376,0.000027905104,0.00005884618],"category_scores_gemma":[0.000008537855,0.000060687726,0.000025149739,0.000340432,0.000015625727,0.00027987172,0.00012927288,0.0001361901,0.00011331243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002352086,0.000007395788,0.00023476391,0.000020400199,0.000024947552,0.000024031271,0.000492918,0.6466765,0.00003836336,0.32333976,0.002577203,0.026561407],"study_design_scores_gemma":[0.000050668357,0.000088194254,0.000048223294,0.00003808974,0.0000019579202,0.000013708617,0.000008830915,0.9860013,0.0008748478,0.0004210904,0.012342547,0.000110557914],"about_ca_topic_score_codex":0.000010549266,"about_ca_topic_score_gemma":0.0000014356234,"teacher_disagreement_score":0.6066632,"about_ca_system_score_codex":0.000024321092,"about_ca_system_score_gemma":0.000039872277,"threshold_uncertainty_score":0.32192886},"labels":[],"label_agreement":null},{"id":"W7127365024","doi":"10.1109/ccece64018.2025.11364457","title":"Systematic Design Approaches to Duty Cycle Scaling for GPUs","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Scaling; Duty cycle; Power (physics); Graphics; Frequency scaling; Energy minimization; Coprocessor; Throttle","score_opus":0.11027706718103357,"score_gpt":0.28670825322641197,"score_spread":0.17643118604537839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127365024","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005322012,0.0007436002,0.9862214,0.002100293,0.0006864071,0.003967207,0.0000016550731,0.0008321107,0.0053941053],"genre_scores_gemma":[0.23155077,0.000012235598,0.76268274,0.0009253555,0.000046888625,0.0003827294,9.726967e-7,0.000015592008,0.0043827295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967621,0.00041543483,0.0010059435,0.0009266232,0.00028169877,0.0006081766],"domain_scores_gemma":[0.9973599,0.0009826855,0.00021828721,0.0010327935,0.00022305312,0.00018329066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025037543,0.00035976982,0.00070080307,0.0004515286,0.0005587092,0.0009003936,0.0015845336,0.00018059803,0.000006561188],"category_scores_gemma":[0.00056518754,0.00033060642,0.00022169692,0.0013210899,0.000043992113,0.0002572074,0.0005572464,0.00013293955,0.0000396933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034957542,0.00020768827,0.000010159704,0.012157357,0.00015818399,0.0000016383862,0.0013156761,0.76582265,0.00002693296,0.20257722,0.0067243106,0.01096324],"study_design_scores_gemma":[0.00027851757,0.00012655568,0.000006798752,0.004579214,0.000062518935,0.000003289344,0.000073420764,0.9771866,0.00657036,0.010691518,0.00006576669,0.0003554231],"about_ca_topic_score_codex":0.000017341055,"about_ca_topic_score_gemma":0.0000011817616,"teacher_disagreement_score":0.23149754,"about_ca_system_score_codex":0.00013650573,"about_ca_system_score_gemma":0.0002679937,"threshold_uncertainty_score":0.9999146},"labels":[],"label_agreement":null},{"id":"W7132863880","doi":"","title":"Memory page placement based on predicted cache behaviour in CC-NUMA multiprocessors","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bibliothèque et Archives nationales du Québec","funders":"","keywords":"Cache-only memory architecture; Interleaved memory; Memory map; Latency (audio); Flat memory model; Uniform memory access; Cache; Memory management; Non-uniform memory access; Demand paging","score_opus":0.019552012976885535,"score_gpt":0.3189084428621646,"score_spread":0.29935642988527905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132863880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31692103,0.0005602057,0.6629644,0.0010717706,0.001965211,0.0034352122,0.000034357177,0.001960454,0.011087371],"genre_scores_gemma":[0.9473141,0.000096552845,0.043543313,0.0004348832,0.00010267019,0.0002495402,0.00065665436,0.00010707544,0.0074952515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994279,0.00043370028,0.001113312,0.0018377593,0.0013515276,0.0009846914],"domain_scores_gemma":[0.99673,0.00023892664,0.0009424448,0.001320845,0.00044654557,0.00032120047],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009855513,0.001027341,0.0008558717,0.0011573139,0.00046264104,0.0003830959,0.0017877155,0.00085665256,0.00010334384],"category_scores_gemma":[0.0002757208,0.0011391513,0.00025007123,0.0016593987,0.000090300455,0.0002643633,0.00017401873,0.0013644124,0.000058920028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048545498,0.006130444,0.0006406204,0.0005429175,0.000044550463,0.00033731296,0.033130962,0.95257026,0.00012825373,0.00012650093,0.0009033187,0.0049594133],"study_design_scores_gemma":[0.008218154,0.0008190378,0.0036294472,0.002584798,0.00006233085,0.000006571163,0.0019995167,0.9663686,0.014855841,0.000064395535,0.00006449439,0.0013268064],"about_ca_topic_score_codex":0.001079903,"about_ca_topic_score_gemma":0.00032646273,"teacher_disagreement_score":0.630393,"about_ca_system_score_codex":0.0009533441,"about_ca_system_score_gemma":0.0015287098,"threshold_uncertainty_score":0.9991059},"labels":[],"label_agreement":null},{"id":"W7132870557","doi":"","title":"Improving Multi-threaded Application Performance on Modern Chip Multiprocessors","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Thread (computing); Criticality; Instruction set; Learning to rank; Execution time","score_opus":0.03678782747637157,"score_gpt":0.33413554532853235,"score_spread":0.2973477178521608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132870557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12129295,0.00024583045,0.8722044,0.00017340101,0.00092679966,0.0013391551,0.0000038747603,0.0027216985,0.0010918917],"genre_scores_gemma":[0.8732637,0.0005361498,0.10098405,0.00018520784,0.0002612884,0.0004916876,0.00039158564,0.00020712076,0.023679184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949776,0.0001534658,0.0009086323,0.002051866,0.0009464504,0.0009619809],"domain_scores_gemma":[0.99605095,0.00021980012,0.0012837783,0.0015732558,0.00060466013,0.00026753475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076271046,0.0009570875,0.00072777807,0.00072999124,0.0009854607,0.00050523994,0.0021224136,0.0007537361,0.000009267893],"category_scores_gemma":[0.0002387762,0.0010490521,0.00023889806,0.0015905679,0.00008420271,0.00045315622,0.0002906506,0.0011062961,0.0006872392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019650644,0.00053379295,0.00031481934,0.001326857,0.00008587531,0.000008576336,0.04365488,0.3158443,0.005595904,0.0004997264,0.00027575556,0.631663],"study_design_scores_gemma":[0.0007159827,0.00025860273,0.0025125674,0.0005888485,0.00003797673,0.0000035175976,0.00055508915,0.97017163,0.023910172,0.000109085115,0.00009080143,0.0010457229],"about_ca_topic_score_codex":0.00047084183,"about_ca_topic_score_gemma":0.000056730045,"teacher_disagreement_score":0.7712203,"about_ca_system_score_codex":0.00024745206,"about_ca_system_score_gemma":0.00037276288,"threshold_uncertainty_score":0.999196},"labels":[],"label_agreement":null},{"id":"W7132871271","doi":"","title":"Synthesizing Divide-and-Conquer Programs","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Programmer; Compiler; Task (project management); Bridge (graph theory); Program synthesis; Domain (mathematical analysis); Architecture; Multi-core processor","score_opus":0.029610866329268397,"score_gpt":0.33462199978296703,"score_spread":0.3050111334536986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132871271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029221566,0.009567867,0.90370184,0.002530237,0.0030158614,0.0023217571,0.0000044129665,0.0031773064,0.04645916],"genre_scores_gemma":[0.75048804,0.002294418,0.17469585,0.00060239475,0.00036228116,0.0006112024,0.00036923372,0.00021174482,0.07036483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960644,0.00043091766,0.00063155696,0.0013718525,0.00078120246,0.00072006404],"domain_scores_gemma":[0.99760354,0.00028680346,0.00068161386,0.0009655861,0.00022143793,0.00024102702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097138406,0.0006471695,0.00066020875,0.00037050844,0.001136691,0.00090379064,0.0014468636,0.0003220007,0.00043067423],"category_scores_gemma":[0.00017469286,0.0007256477,0.00020626346,0.0008420006,0.000106857085,0.0003282697,0.00079699204,0.00090939394,0.000042693206],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094180694,0.00052731833,0.0010276139,0.00073156087,0.00028682704,0.00011396451,0.0947613,0.0038664823,0.0003490046,0.036533043,0.0037039074,0.8580048],"study_design_scores_gemma":[0.0013143083,0.0017800429,0.0020856927,0.0022918205,0.00044599976,0.0002192806,0.011638833,0.7155515,0.006841787,0.0073133465,0.24476649,0.0057508824],"about_ca_topic_score_codex":0.00044378577,"about_ca_topic_score_gemma":0.000020538442,"teacher_disagreement_score":0.8522539,"about_ca_system_score_codex":0.00013825965,"about_ca_system_score_gemma":0.0002988832,"threshold_uncertainty_score":0.99951947},"labels":[],"label_agreement":null},{"id":"W7132874723","doi":"","title":"Multi-FPGA Acceleration of Butterfly Matrix Multiplication","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matrix multiplication; Matrix (chemical analysis); Butterfly; Multiplication (music); Acceleration; Matrix exponential; Block (permutation group theory); Sparse matrix","score_opus":0.037145339383587134,"score_gpt":0.3795164249274488,"score_spread":0.34237108554386164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132874723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026164848,0.002597789,0.9652541,0.0006857487,0.001661992,0.001109444,0.000010034438,0.00090746186,0.0016085296],"genre_scores_gemma":[0.6003225,0.0007883911,0.3650745,0.00007134581,0.00022639749,0.00011823917,0.0004677076,0.00009795079,0.032832973],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996056,0.00022458422,0.0012195403,0.0013244384,0.00069951697,0.00047589466],"domain_scores_gemma":[0.996351,0.00015841161,0.0011261252,0.0012636181,0.00094673544,0.00015409934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006593798,0.00065882923,0.000700628,0.0007416788,0.00027330816,0.0005684146,0.0014347548,0.00066568574,0.000078876146],"category_scores_gemma":[0.00015046676,0.0007168786,0.00033301848,0.0013461265,0.00007915277,0.00046996408,0.0002825631,0.00067076855,0.00027124368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004922433,0.0029926717,0.00061145006,0.00957745,0.0010402123,0.000063877575,0.2975293,0.18115692,0.24010514,0.0221114,0.027189735,0.21712957],"study_design_scores_gemma":[0.00041942266,0.00017341418,0.0010508341,0.0008285415,0.000105738756,0.0000084126095,0.0006771862,0.9052625,0.08906915,0.00029548985,0.0014365222,0.0006727921],"about_ca_topic_score_codex":0.00040672097,"about_ca_topic_score_gemma":0.000043428714,"teacher_disagreement_score":0.7241056,"about_ca_system_score_codex":0.00016427755,"about_ca_system_score_gemma":0.00040972274,"threshold_uncertainty_score":0.9995282},"labels":[],"label_agreement":null},{"id":"W7132897393","doi":"","title":"The Performance Cost of Disintegrated Manycores: Which Applications Lose and Why?","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Measure (data warehouse); Bandwidth (computing); Suite; Latency (audio); Performance measurement; Variance (accounting)","score_opus":0.020157808038095318,"score_gpt":0.3259944361127181,"score_spread":0.3058366280746228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132897393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048058636,0.0025987572,0.93810505,0.0015914165,0.000785282,0.002768832,0.000016366952,0.0009155168,0.005160154],"genre_scores_gemma":[0.89373475,0.032763734,0.024425233,0.00014883315,0.0002013309,0.0010207138,0.00049338705,0.00015398074,0.04705803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752426,0.00015940497,0.0006697009,0.0007235311,0.00047763225,0.0004454573],"domain_scores_gemma":[0.99641484,0.0005508062,0.00075154635,0.0010820067,0.0010678684,0.00013292409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007118195,0.00041722934,0.00042326754,0.00023226821,0.0010365671,0.00041508104,0.0013917565,0.00027617122,0.000008494101],"category_scores_gemma":[0.00014707254,0.0003312996,0.00008592965,0.002138382,0.00020953859,0.0001837045,0.0002577566,0.00051157305,0.00004968093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005298749,0.00081620994,0.0038092595,0.0034736372,0.0007483021,0.000011306243,0.085225426,0.059310723,0.0021612532,0.07480754,0.042729788,0.72637665],"study_design_scores_gemma":[0.00032364507,0.00021536455,0.005258346,0.0008238539,0.00007180839,0.000009441136,0.0032427993,0.9692,0.0056894314,0.0006222425,0.013915406,0.00062763767],"about_ca_topic_score_codex":0.0002411196,"about_ca_topic_score_gemma":0.00026574117,"teacher_disagreement_score":0.9136798,"about_ca_system_score_codex":0.000054218322,"about_ca_system_score_gemma":0.00030121568,"threshold_uncertainty_score":0.99991393},"labels":[],"label_agreement":null},{"id":"W7132905049","doi":"","title":"A quantitative analysis framework to evaluate the performance and costs of computer architectural alternatives","year":2002,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Context (archaeology); Architecture; Architectural pattern; Function (biology); Architectural design; Task (project management); Software; Software architecture; Architectural technology","score_opus":0.03205227333656106,"score_gpt":0.36927973354662386,"score_spread":0.3372274602100628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132905049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41808772,0.00052088406,0.579729,0.00050647947,0.00023048364,0.00046506242,0.0000038682624,0.00007415579,0.00038233874],"genre_scores_gemma":[0.69368196,0.00042251378,0.3048041,0.00019290861,0.000060573544,0.00003232072,0.000017470717,0.00002130183,0.00076689763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962902,0.0006788658,0.0007205522,0.000984859,0.0008474743,0.00047801834],"domain_scores_gemma":[0.9963018,0.0011773723,0.00065584306,0.0009337536,0.0007513385,0.00017992014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090787996,0.0005758088,0.0009117039,0.0008585356,0.00046916338,0.0003452534,0.0014833462,0.00021105837,0.000049834605],"category_scores_gemma":[0.00019497977,0.00043820162,0.0002874394,0.0028940036,0.000238113,0.00017941986,0.00041941906,0.00066571595,0.000020801055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023462992,0.00015100223,0.0018057075,0.00016888,0.0019713491,0.000005518095,0.23937647,0.63843244,0.00013285496,0.010798426,0.0003236213,0.10659909],"study_design_scores_gemma":[0.00017812452,0.0008771615,0.013524238,0.0007402902,0.00041256755,0.0000060706384,0.0007922679,0.9816382,0.0011111238,0.00019987264,0.00003154854,0.00048851955],"about_ca_topic_score_codex":0.0002980811,"about_ca_topic_score_gemma":0.00004725206,"teacher_disagreement_score":0.34320578,"about_ca_system_score_codex":0.00007693778,"about_ca_system_score_gemma":0.000078699864,"threshold_uncertainty_score":0.999807},"labels":[],"label_agreement":null},{"id":"W7132923186","doi":"","title":"Catenation and operand specialization for Tcl virtual machine performance","year":2004,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Bytecode; Operand; Compiler; Machine code; Context (archaeology); Code (set theory); Overhead (engineering); Virtual machine","score_opus":0.018589323996401386,"score_gpt":0.3144564351018726,"score_spread":0.2958671111054712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132923186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06209317,0.00086341635,0.93164414,0.00052162964,0.0011457606,0.0013110117,0.000010040944,0.00034218587,0.0020686456],"genre_scores_gemma":[0.90080965,0.00264527,0.08202998,0.00021251265,0.0004196291,0.00012488654,0.0010902856,0.00008365382,0.012584113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974506,0.0000889197,0.00061740517,0.00096305646,0.00043214537,0.00044790673],"domain_scores_gemma":[0.99809396,0.00009787807,0.00055252865,0.00043692547,0.00066641154,0.00015227847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005424207,0.00053758,0.0005071351,0.0004059585,0.0008872421,0.0005944682,0.00059910305,0.00041799102,0.000030799118],"category_scores_gemma":[0.00013205438,0.00057314767,0.00010699693,0.00056341937,0.000083669685,0.0006127529,0.000114358656,0.00028581,0.000013918881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001328487,0.00082041585,0.0013915881,0.0027531737,0.0003187072,0.000012040584,0.121807195,0.42482665,0.0038467,0.07381276,0.0035236494,0.36555862],"study_design_scores_gemma":[0.0018351403,0.000821871,0.0027912492,0.00055665616,0.00007426492,0.000017398375,0.00027813512,0.97538024,0.014225922,0.0005790561,0.002561269,0.0008788232],"about_ca_topic_score_codex":0.00017161029,"about_ca_topic_score_gemma":0.00006448094,"teacher_disagreement_score":0.84961414,"about_ca_system_score_codex":0.00018445184,"about_ca_system_score_gemma":0.000405894,"threshold_uncertainty_score":0.999672},"labels":[],"label_agreement":null},{"id":"W7132997325","doi":"","title":"A Hetorogeneous Stack for a Re-configurable Data Centre","year":2023,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Stack (abstract data type); Scalability; Abstraction layer; Field-programmable gate array; Software deployment; Abstraction; Translation (biology); Scale (ratio)","score_opus":0.09389047122683479,"score_gpt":0.38972654327803236,"score_spread":0.29583607205119755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132997325","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022886896,0.002214304,0.97536844,0.002311234,0.004061523,0.003018272,0.0002695536,0.0030816882,0.0073862774],"genre_scores_gemma":[0.024007872,0.0028570318,0.43952286,0.0006743228,0.0011560284,0.00025220157,0.016412437,0.00049831404,0.51461893],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994986,0.0002019179,0.00082204625,0.0022468586,0.0006693824,0.0010737823],"domain_scores_gemma":[0.99382174,0.0005675694,0.000826774,0.0037574896,0.0007325274,0.0002939232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010215959,0.0007286955,0.0007980055,0.00033851448,0.0006867574,0.0008668795,0.00479648,0.00056892034,0.00013582688],"category_scores_gemma":[0.00060328125,0.00082685694,0.00023413243,0.0010450963,0.00005600749,0.00036890467,0.000767248,0.0004394849,0.0003603531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004079215,0.00048157608,0.000044324075,0.0019384224,0.0006207747,0.00013291951,0.058146022,0.03965398,0.0005276506,0.0045618694,0.8255859,0.06789864],"study_design_scores_gemma":[0.0006106509,0.00020020493,0.000022564253,0.0006056692,0.00011282638,0.000008545307,0.0026382671,0.9039652,0.0031223549,0.0007102636,0.08697808,0.0010253802],"about_ca_topic_score_codex":0.0006603144,"about_ca_topic_score_gemma":0.0004704689,"teacher_disagreement_score":0.8643112,"about_ca_system_score_codex":0.00013492061,"about_ca_system_score_gemma":0.00087580265,"threshold_uncertainty_score":0.9994182},"labels":[],"label_agreement":null},{"id":"W7133023002","doi":"","title":"Tagfilter :a power-aware tag hierarchy for high-level caches","year":2003,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bibliographical Society of Canada; University of Toronto","funders":"","keywords":"Cache; Spec#; Locality; Exploit; Cache algorithms; Search engine indexing; CPU cache; Bus sniffing; Smart Cache; Translation lookaside buffer","score_opus":0.045706975286939996,"score_gpt":0.340499003532781,"score_spread":0.294792028245841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133023002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037930955,0.00095267815,0.98232424,0.0011807204,0.0030173482,0.001643557,0.00006760731,0.00074863783,0.00627211],"genre_scores_gemma":[0.23145004,0.0003176743,0.5886083,0.0014987306,0.00032354574,0.00044981312,0.0010073816,0.0002325696,0.1761119],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947957,0.00033520622,0.0010011183,0.0018715144,0.00078623265,0.0012102537],"domain_scores_gemma":[0.9955012,0.000428208,0.0009845591,0.0016006823,0.0011187793,0.0003665445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082795863,0.0010906843,0.0010519066,0.0006296433,0.0008919979,0.00077460724,0.0021421858,0.00092407805,0.000270141],"category_scores_gemma":[0.00028984973,0.0011829544,0.0004690566,0.0009584979,0.00013275708,0.00044319205,0.00022690151,0.0007578482,0.000118467105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009827955,0.0023630024,0.0003831916,0.0031829744,0.0013942113,0.0001365284,0.10440701,0.032748867,0.0031047913,0.27138993,0.5053227,0.07458399],"study_design_scores_gemma":[0.009470091,0.006148346,0.003004892,0.0041613095,0.00083732017,0.00016443855,0.0103113,0.48813164,0.15968208,0.032353345,0.27034193,0.015393281],"about_ca_topic_score_codex":0.00029611532,"about_ca_topic_score_gemma":0.00003554208,"teacher_disagreement_score":0.4553828,"about_ca_system_score_codex":0.00023154345,"about_ca_system_score_gemma":0.0010424663,"threshold_uncertainty_score":0.99906206},"labels":[],"label_agreement":null},{"id":"W7133031893","doi":"","title":"Mist: Co-Optimize Memory Optimizations with Parallelism for Large Scale Distributed Training","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Pipeline (software); Schedule; Speedup; Parallelism (grammar); Distributed memory; Key (lock); Scale (ratio); Integer programming","score_opus":0.02881691282966678,"score_gpt":0.3375832647109168,"score_spread":0.30876635188125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133031893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000785077,0.0014057147,0.9821322,0.0016788003,0.0011447632,0.0022804637,0.00040961796,0.0019667791,0.008196562],"genre_scores_gemma":[0.034528084,0.00054888707,0.9000748,0.0004285094,0.00053672836,0.00097389857,0.0103751365,0.0003248037,0.052209165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940905,0.0002336477,0.0011403547,0.0021839996,0.0008681871,0.0014833028],"domain_scores_gemma":[0.9957594,0.00048903597,0.0008543083,0.0013917281,0.0010057217,0.0004997626],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009948253,0.0012320324,0.0012945615,0.00059565506,0.0014127282,0.0014827659,0.0017640345,0.000816273,0.00017959635],"category_scores_gemma":[0.00017769149,0.0012138833,0.0005322023,0.0015603068,0.00014840013,0.0004780951,0.00019222237,0.0009860945,0.00007761641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042537824,0.00048612952,0.000011821589,0.0011031714,0.00055465533,0.000066536886,0.11780824,0.8229828,0.000077897945,0.006860064,0.046468124,0.0031551805],"study_design_scores_gemma":[0.0018699169,0.00045589477,0.000025463758,0.0012584378,0.0003877529,0.00004961774,0.009770635,0.96722865,0.0011387726,0.0005191607,0.015706813,0.0015888887],"about_ca_topic_score_codex":0.000058790072,"about_ca_topic_score_gemma":0.00005740998,"teacher_disagreement_score":0.14424585,"about_ca_system_score_codex":0.00024710677,"about_ca_system_score_gemma":0.0012944636,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W7138115582","doi":"10.1109/aset66891.2025.11428122","title":"Design and Control of High Performance High Efficiency Totem-Pole PFC for Data Center Power Supply","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"","keywords":"Control (management); Power (physics); Control system; Power control; Center (category theory); Measure (data warehouse)","score_opus":0.01706277815776944,"score_gpt":0.25916197921802947,"score_spread":0.24209920106026003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7138115582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005789692,0.000659351,0.98904574,0.001704474,0.0006832567,0.0012860544,0.00006616523,0.00020593811,0.00055932434],"genre_scores_gemma":[0.67749465,0.00018893278,0.32069016,0.000564663,0.000018844148,0.000017122324,0.000015950985,0.000010014605,0.0009996765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716264,0.00018424608,0.0007971276,0.0010198884,0.00028585378,0.00055024674],"domain_scores_gemma":[0.9970234,0.0005385905,0.00028858785,0.0016537647,0.00039348382,0.000102180005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012728564,0.00033581138,0.0005592126,0.0002813292,0.00034055483,0.00027141342,0.0022516272,0.00016700379,0.000046632726],"category_scores_gemma":[0.00010867093,0.00030493786,0.000057397407,0.0005516695,0.00022075995,0.0006378208,0.0010717647,0.00015906019,0.0000042875795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022371714,0.0042649154,0.011526662,0.0020344555,0.0008902221,0.000011317445,0.0021249056,0.25493714,0.002192125,0.24845968,0.10295542,0.36836597],"study_design_scores_gemma":[0.0024105876,0.0006874575,0.0012305647,0.0002297695,0.000040264404,0.0000042471893,0.000007166933,0.9826715,0.0105103925,0.0007066147,0.0011987975,0.00030263216],"about_ca_topic_score_codex":0.00008740768,"about_ca_topic_score_gemma":0.0000010236167,"teacher_disagreement_score":0.7277344,"about_ca_system_score_codex":0.000036467445,"about_ca_system_score_gemma":0.00030166065,"threshold_uncertainty_score":0.9999403},"labels":[],"label_agreement":null},{"id":"W7161130090","doi":"10.1109/icst66402.2025.11512436","title":"GPU-Accelerated Chirplet Transform: Scalable Runtime Profiling and Analysis","year":2025,"lang":"","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Profiling (computer programming); Scalability; Feature (linguistics); Signal processing","score_opus":0.016960732282755953,"score_gpt":0.2753296751960459,"score_spread":0.25836894291328993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161130090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050334204,0.0010519461,0.93481076,0.001991244,0.00018608771,0.00049113756,0.0000065019135,0.0007661946,0.05566273],"genre_scores_gemma":[0.6423291,0.00062770536,0.34169683,0.0008304803,0.00002631335,0.0000211511,0.000024295126,0.000012555022,0.014431565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970661,0.00016792185,0.0007984667,0.0010636044,0.0002957174,0.0006082208],"domain_scores_gemma":[0.9985276,0.00009180152,0.00015282776,0.0007319839,0.00032933964,0.00016643998],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007917449,0.0004025102,0.0007116026,0.0011173668,0.0006705654,0.001192513,0.0008621228,0.00023506185,0.00016901517],"category_scores_gemma":[0.000039683557,0.00038690565,0.00023649109,0.00668947,0.0001510098,0.0006015238,0.0003632522,0.00030896565,0.000015718586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002084414,0.0014883187,0.04897396,0.00086474954,0.008871817,0.000047071822,0.0029216052,0.1964085,0.002354539,0.24613562,0.014540513,0.4771849],"study_design_scores_gemma":[0.0004383736,0.0000741727,0.0019208975,0.000071623304,0.00041784087,0.0000024344158,0.000020824073,0.9773243,0.016854083,0.0015122574,0.0009624618,0.00040072098],"about_ca_topic_score_codex":0.00016570663,"about_ca_topic_score_gemma":0.000013738657,"teacher_disagreement_score":0.7809158,"about_ca_system_score_codex":0.000055706827,"about_ca_system_score_gemma":0.00026471386,"threshold_uncertainty_score":0.99985826},"labels":[],"label_agreement":null},{"id":"W74910209","doi":"10.1017/cbo9781139022262.012","title":"Pointers and dynamic memory allocation","year":2012,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pointer (user interface); Computer science; C dynamic memory allocation; Variable (mathematics); Memory safety; Block (permutation group theory); Compiler; Operating system; Parallel computing; Memory management; Computer hardware; Semiconductor memory; Mathematics","score_opus":0.014207783800053728,"score_gpt":0.20032702870181643,"score_spread":0.1861192449017627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W74910209","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012350345,0.0002780184,0.35738254,0.000030563166,0.000113015274,0.00014686752,0.0000074397058,0.00037570568,0.6416535],"genre_scores_gemma":[0.0032774345,0.0002688424,0.013594834,0.00009756751,0.000033830853,3.9657007e-7,0.000017645294,0.000021354432,0.98268807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906206,0.000034313853,0.00013333317,0.00041121678,0.00015947298,0.0001996272],"domain_scores_gemma":[0.9990195,0.000039855357,0.00017905269,0.00052557804,0.00010200459,0.0001340315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011845515,0.00023945613,0.00021833854,0.00019443766,0.00014437569,0.00007364489,0.00066081475,0.00021075386,8.184379e-7],"category_scores_gemma":[0.0000040341884,0.0002909171,0.000080163874,0.000008338293,0.00011571288,0.00020246475,0.000625932,0.00024514206,0.0000069097846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008112806,0.000005412206,5.197756e-7,0.00003643714,0.000043167045,0.000023738201,0.000097101765,0.000024072691,0.000024730249,0.97544396,0.008493643,0.015799109],"study_design_scores_gemma":[0.0006288648,0.00009228942,0.000041771465,0.00030473032,0.00013337737,0.00008715832,0.000017180295,0.056314684,0.0005695917,0.00011741786,0.94056565,0.0011272791],"about_ca_topic_score_codex":0.000028222192,"about_ca_topic_score_gemma":5.238197e-7,"teacher_disagreement_score":0.97532654,"about_ca_system_score_codex":0.000124543,"about_ca_system_score_gemma":0.000048165126,"threshold_uncertainty_score":0.9999543},"labels":[],"label_agreement":null},{"id":"W75303139","doi":"","title":"Automatic task generation for the multi-level computing architecture","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Compiler; Task (project management); Code generation; Computer architecture; Programming language; Heuristic; Parallel computing; Source code; Optimizing compiler; Control flow; Operating system; Artificial intelligence; Key (lock)","score_opus":0.08904346494722962,"score_gpt":0.3247383573214794,"score_spread":0.23569489237424976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75303139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016827485,0.0002256148,0.9800706,0.0010594026,0.0007549186,0.0004608922,0.000052902065,0.00033482394,0.00021340039],"genre_scores_gemma":[0.92351055,0.000026816699,0.07579243,0.00021041167,0.00023481056,0.000011138754,0.000106282634,0.00001008381,0.00009744593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818236,0.00010351589,0.00053941755,0.00051721634,0.00031582997,0.0003416888],"domain_scores_gemma":[0.9983707,0.0005621142,0.00030568993,0.00028071358,0.0003620141,0.00011877717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010069889,0.00025324145,0.00025489824,0.00014507673,0.00059392414,0.0007286884,0.00059993507,0.00011375734,0.0000016658742],"category_scores_gemma":[0.00014350346,0.00018841946,0.000061115956,0.00017523498,0.00007917272,0.000111618254,0.00020488312,0.00022346375,0.0000022151912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007401962,0.00024568327,0.000867698,0.00012990598,0.0003308829,0.000017897271,0.0041126865,0.33921275,0.001714703,0.36242914,0.0026662457,0.28819838],"study_design_scores_gemma":[0.0007393343,0.00009491417,0.0019622531,0.00012506952,0.000009384564,0.00007078035,0.00029111496,0.9955522,0.000040104802,0.00035379085,0.00053064286,0.00023043067],"about_ca_topic_score_codex":0.000049333175,"about_ca_topic_score_gemma":0.000008781011,"teacher_disagreement_score":0.9066831,"about_ca_system_score_codex":0.0000432279,"about_ca_system_score_gemma":0.000037858797,"threshold_uncertainty_score":0.76835227},"labels":[],"label_agreement":null},{"id":"W82727502","doi":"10.1007/978-3-642-23397-5_2","title":"Parallel Scanning with Bitstream Addition: An XML Case Study","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bitstream; Parsing; Python (programming language); Compiler; SIMD; Programming language; Parallel computing; Byte; XML; Implementation; Decoding methods; Operating system; Algorithm","score_opus":0.02903943252509657,"score_gpt":0.2652701246432353,"score_spread":0.2362306921181387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82727502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056628324,0.0001214683,0.9934418,0.00008186864,0.00043297122,0.00068865233,0.0000041146304,0.0008171756,0.0038456717],"genre_scores_gemma":[0.31975582,0.000010539793,0.6792873,0.0004202113,0.00024677144,0.000025080373,0.000007015496,0.000042254982,0.00020495855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957915,0.000091219474,0.0005645801,0.0019965384,0.0008830912,0.0006731004],"domain_scores_gemma":[0.9966795,0.00019130138,0.00040884683,0.0020118053,0.00041798118,0.00029058743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008557563,0.00068319694,0.0005889361,0.0010087442,0.0005710578,0.00072709785,0.0029769538,0.000260746,0.000034944223],"category_scores_gemma":[0.000025874766,0.0005783647,0.00008336613,0.00079650874,0.00054129784,0.0010859289,0.0010016578,0.0008172039,0.000018113375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028921302,0.00047745096,0.00044666027,0.000033370678,0.00005506106,0.011794435,0.00876361,0.2739068,0.0000039520655,0.010009116,0.00009703059,0.6943836],"study_design_scores_gemma":[0.001008636,0.0042702947,0.00012836781,0.0006236087,0.0000382393,0.008039991,0.000006507414,0.93754673,0.0001893708,0.045589894,0.0004900216,0.0020683554],"about_ca_topic_score_codex":0.00022499802,"about_ca_topic_score_gemma":0.00030966333,"teacher_disagreement_score":0.6923153,"about_ca_system_score_codex":0.0001753077,"about_ca_system_score_gemma":0.00054011657,"threshold_uncertainty_score":0.99966675},"labels":[],"label_agreement":null},{"id":"W85643276","doi":"10.1007/978-3-642-37658-0_21","title":"Language and Architecture Independent Software Thread-Level Speculation","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Speculation; Compiler; Thread (computing); Programming language; Software; Architecture; Operating system; Parallel computing; Software engineering; Computer architecture","score_opus":0.017785509648132396,"score_gpt":0.24815490624143507,"score_spread":0.2303693965933027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85643276","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001503636,0.00060205365,0.99573654,0.00042633124,0.0004504751,0.00041778854,0.0000051297925,0.00047822317,0.0017331121],"genre_scores_gemma":[0.02994589,0.000048329515,0.96814907,0.0008142023,0.00024623855,0.000008568728,0.00001145634,0.00003213003,0.00074411306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996985,0.00003776162,0.00041106567,0.0013012202,0.00078129827,0.000483619],"domain_scores_gemma":[0.9980168,0.00026496197,0.0002676874,0.0010461815,0.00023814455,0.00016625726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004955979,0.00048138862,0.00041987785,0.00074506825,0.00023049788,0.0006774972,0.0018325914,0.00034943508,0.000028254477],"category_scores_gemma":[0.000106723506,0.00042861514,0.000072936455,0.0004308393,0.00036435408,0.00042669036,0.0013444051,0.0007701063,0.00003253391],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000210797,0.000014651274,0.000085713225,0.000032553347,0.000008774062,0.00004007709,0.0014237497,0.06870601,0.000046610487,0.010569538,0.000054614513,0.9190156],"study_design_scores_gemma":[0.00046254028,0.0002242717,0.0012442202,0.0006639757,0.00001278126,0.00025634826,5.461583e-7,0.5714688,0.0016322505,0.42149377,0.0010505527,0.0014900131],"about_ca_topic_score_codex":0.000043913944,"about_ca_topic_score_gemma":0.0000387231,"teacher_disagreement_score":0.9175256,"about_ca_system_score_codex":0.00015427658,"about_ca_system_score_gemma":0.0002457329,"threshold_uncertainty_score":0.99981654},"labels":[],"label_agreement":null},{"id":"W85801641","doi":"10.1007/978-3-540-39671-0_12","title":"Managing the Performance Impact of Administrative Utilities","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Business; Computer science","score_opus":0.03179946764888352,"score_gpt":0.2950213072813216,"score_spread":0.26322183963243806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85801641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030001355,0.00039171914,0.98810923,0.0003568465,0.00037941546,0.00027025392,0.0000028208779,0.00013805814,0.0100516435],"genre_scores_gemma":[0.65270454,0.00020061313,0.34587538,0.00054879964,0.00010173977,0.00000712855,0.0000021432504,0.000023395833,0.00053625245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997602,0.0000560863,0.00048050407,0.00077616493,0.0006350299,0.0004502133],"domain_scores_gemma":[0.997664,0.00039528107,0.00038288592,0.0012103947,0.000270078,0.000077400604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009214949,0.000400947,0.0004188583,0.00047011377,0.00027596255,0.00027136883,0.0029296274,0.00015714914,0.0000136829685],"category_scores_gemma":[0.00005147259,0.00027546525,0.00018163977,0.00056175113,0.0008832356,0.00039728548,0.0006352863,0.00056375505,0.0000050590015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010823365,0.000039930277,0.00031794416,0.00007701946,0.00004429217,0.000021021415,0.0027233239,0.51051056,0.000028824603,0.032147165,0.00016678864,0.45391232],"study_design_scores_gemma":[0.00011027079,0.00037858018,0.0002586649,0.00031013915,0.000005414701,0.000054855434,3.2811428e-7,0.92702585,0.0020820785,0.069108695,0.000264567,0.0004005321],"about_ca_topic_score_codex":0.000018810695,"about_ca_topic_score_gemma":0.000005336324,"teacher_disagreement_score":0.65240455,"about_ca_system_score_codex":0.00020128467,"about_ca_system_score_gemma":0.0005777438,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W86735328","doi":"","title":"Overlap of computation and communication on shared-memory networks-of-workstations","year":2001,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Asynchronous communication; Parallel computing; Latency (audio); Computation; Distributed memory; Shared memory; Workstation; Multiprocessing; Compiler; Transformation (genetics); CAS latency; Uniform memory access; Data access; Distributed shared memory; Memory model; Memory management; Operating system; Algorithm; Computer network; Semiconductor memory; Memory controller","score_opus":0.020143973224367326,"score_gpt":0.28078552645919475,"score_spread":0.2606415532348274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W86735328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05007029,0.0002422617,0.9467285,0.00027953048,0.000093856295,0.00017201739,7.749259e-7,0.00019417935,0.0022185529],"genre_scores_gemma":[0.74951273,0.000044259163,0.25017193,0.00020701153,0.000022094879,0.0000015572693,0.000010737221,0.0000075255666,0.000022163154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.00016319023,0.00044653015,0.00024768114,0.00017482052,0.00016455149],"domain_scores_gemma":[0.9984392,0.0005252613,0.00037983494,0.00041290972,0.00019423624,0.00004856853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042991719,0.0001247517,0.00021293265,0.0001787928,0.00017209223,0.00006815009,0.00044744575,0.00006677549,0.0000018767888],"category_scores_gemma":[0.00004826623,0.00013169051,0.000048258673,0.0004689276,0.00007683855,0.00021703215,0.00035221348,0.0001440418,0.0000016927906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001105107,0.00007051753,0.0020313864,0.00002413434,0.0000137630195,9.118725e-7,0.0011887503,0.9232352,0.000025816424,0.006333562,0.00058040593,0.06648455],"study_design_scores_gemma":[0.0003210518,0.00007919273,0.0061726854,0.0002078,0.000005057333,0.00001126098,0.000048658465,0.9917445,0.00010328037,0.0011286227,0.000059464426,0.00011843474],"about_ca_topic_score_codex":0.000015436672,"about_ca_topic_score_gemma":0.0000014567645,"teacher_disagreement_score":0.69944245,"about_ca_system_score_codex":0.00002364428,"about_ca_system_score_gemma":0.000023448149,"threshold_uncertainty_score":0.53701836},"labels":[],"label_agreement":null},{"id":"W936314561","doi":"10.29173/cais1279","title":"Microcomputer-based instruction for end users: Experimental trials of the OAK interface for DOE/RECON","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Annual Conference of CAIS / Actes du congrès annuel de l ACSI","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Microcomputer; Interface (matter); Computer science; Operating system; Telecommunications","score_opus":0.04538663391089952,"score_gpt":0.29590107892181,"score_spread":0.25051444501091047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W936314561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8759336,0.00014057785,0.11905418,0.002140178,0.0005723356,0.0013928012,0.00032756006,0.00011243708,0.00032631718],"genre_scores_gemma":[0.941801,0.0000047773347,0.05767371,0.00017761589,0.00004887401,0.00018204481,0.0000041599374,0.000014872374,0.00009295649],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998221,0.00008015594,0.00077220064,0.0003450904,0.00032566345,0.00025591097],"domain_scores_gemma":[0.9887325,0.00037189783,0.0015781788,0.00025077516,0.0090201525,0.000046503465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015157877,0.00020593067,0.00052584254,0.00015532425,0.00027541793,0.0007477239,0.002795577,0.000076679295,0.000007866215],"category_scores_gemma":[0.0027537378,0.00015185379,0.00037226846,0.00035688982,0.00019150678,0.002168073,0.0009498854,0.00015868763,8.214954e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024478666,0.0018176549,0.011980208,0.0016660292,0.00059048214,3.50242e-7,0.07566888,0.010258249,0.68766564,0.088507816,0.03586953,0.08352727],"study_design_scores_gemma":[0.0014915853,0.0008301274,0.0005986979,0.0001561829,0.000038314567,0.000011678406,0.0008999696,0.05008015,0.9109099,0.002876218,0.031878095,0.00022909744],"about_ca_topic_score_codex":0.00004159733,"about_ca_topic_score_gemma":0.0000010627834,"teacher_disagreement_score":0.22324422,"about_ca_system_score_codex":0.0000833936,"about_ca_system_score_gemma":0.0002539345,"threshold_uncertainty_score":0.72103184},"labels":[],"label_agreement":null},{"id":"W9462115","doi":"","title":"Parallel Design Automation of Computer Systems","year":2001,"lang":"en","type":"article","venue":"Oral health","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Deadlock; Class (philosophy); Distributed computing; Automation; Systems design; Object (grammar); Electronic design automation; Embedded system; Software engineering; Engineering","score_opus":0.06259495407725063,"score_gpt":0.32377015046475066,"score_spread":0.26117519638750003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9462115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000342376,0.00020100863,0.99741757,0.0006351681,0.00031065496,0.00024294705,4.2963376e-7,0.0004951143,0.000354755],"genre_scores_gemma":[0.13400008,0.000093754716,0.8653184,0.00035777484,0.000060600374,0.0000074171758,0.0000028778945,0.000005220214,0.00015387287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988217,0.00024160022,0.00033645437,0.0001987772,0.00018639892,0.00021509067],"domain_scores_gemma":[0.999247,0.00005447351,0.00021805955,0.00031027204,0.00008626294,0.00008390365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672928,0.00008777525,0.00020346572,0.000105429834,0.00009171123,0.00005394294,0.000379683,0.00004206711,0.0000030631975],"category_scores_gemma":[0.0000063515818,0.000080409016,0.000030614967,0.00032668433,0.000017389852,0.00019852394,0.000066808425,0.000060871786,0.000022262908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017851804,0.00018059724,0.0010458903,0.00012279401,0.000015170804,0.000007716634,0.0006651626,0.6957052,0.00001248658,0.08397204,0.07249967,0.14575547],"study_design_scores_gemma":[0.00016447982,0.00022623179,0.001162485,0.000048902853,6.146117e-7,0.000019755533,0.000002671947,0.99544096,0.00002348278,0.0005258458,0.0023051836,0.00007938248],"about_ca_topic_score_codex":0.00014401892,"about_ca_topic_score_gemma":0.0000015884109,"teacher_disagreement_score":0.2997358,"about_ca_system_score_codex":0.000053402102,"about_ca_system_score_gemma":0.00009876791,"threshold_uncertainty_score":0.32789847},"labels":[],"label_agreement":null},{"id":"W9530364","doi":"","title":"Return Value Prediction in a Java Virtual Machine","year":2004,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Memoization; STRIDE; Computer science; Spec#; Benchmark (surveying); Java; Context (archaeology); TRACE (psycholinguistics); Operating system; Artificial intelligence; Programming language","score_opus":0.009275155084856867,"score_gpt":0.23505106049094002,"score_spread":0.22577590540608314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W9530364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063074376,0.000029131732,0.9810439,0.00076486386,0.00011962131,0.00007950743,5.791262e-7,0.0007627373,0.01089224],"genre_scores_gemma":[0.7287334,0.000009937408,0.27033952,0.00037583566,0.000022985589,0.0000044427547,0.000002361427,0.0000037032796,0.0005078157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993116,0.000032648597,0.00016729796,0.00021633935,0.00013621902,0.00013589379],"domain_scores_gemma":[0.9996438,0.00001672573,0.000031916737,0.00024382575,0.000025010419,0.000038712864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022130807,0.00007190244,0.00007616927,0.00012732767,0.000044683,0.000055872537,0.00034207237,0.000047659858,0.000009475851],"category_scores_gemma":[0.000024701567,0.00006410381,0.000023896895,0.0003449936,0.000013279578,0.00024405753,0.0001100063,0.000103010774,0.000023387189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009621626,0.0002218539,0.0028254394,0.000005468109,0.000008128403,0.00002466332,0.0012161835,0.41487768,0.0004895324,0.5578059,0.002457153,0.02005838],"study_design_scores_gemma":[0.0004906784,0.00014299536,0.0019363054,0.000023619754,7.950926e-7,0.000017139955,0.000005516207,0.9774282,0.0038101627,0.015479694,0.00055155467,0.00011333363],"about_ca_topic_score_codex":0.00014890116,"about_ca_topic_score_gemma":0.000015294638,"teacher_disagreement_score":0.722426,"about_ca_system_score_codex":0.000060387465,"about_ca_system_score_gemma":0.000041664436,"threshold_uncertainty_score":0.26140776},"labels":[],"label_agreement":null}]}